const_iterator & operator++()
                {
                    if(*this == Map->end())  return *this;

                    if(Node->Next)
                    {
                        Node = Node->Next;
                        return *this;
                    }

                    if(Node->Hash < Map->MaxHash)
                    {
                        size_type NodeHash = Node->Hash + 1;
                        while(Map->tab[NodeHash] == NULL) NodeHash++;
                        Node = Map->tab[NodeHash];
                        return *this;
                    }
                    else
                    {
                        Node = NULL;
                        return *this;
                    }
                }