#include "hiterator.h"

// author: Owen Astrachan
// for cps 100, 11/8/95

template <class Kind>
HMapIterator<Kind>::HMapIterator(Vector<Node<Kind> *>  & list)
: myList(list),
  myChainIndex(0),
  myNode(0)
{
    
}

template <class Kind>
void
HMapIterator<Kind>::First()
{
    myChainIndex = 0;
    Advance();
}

template <class Kind>
bool
HMapIterator<Kind>::IsDone() const
{
    return myChainIndex >= myList.Length();
}

template <class Kind>
void
HMapIterator<Kind>::Advance()
{
    int len = myList.Length();
    while (myChainIndex < len &&  myList[myChainIndex] == 0)
    {
	   myChainIndex++;
    }
    if (myChainIndex < len)
    {
	   myNode = myList[myChainIndex];
    }
    else
    {
	   myNode = 0;
    }    
}

template <class Kind>
void
HMapIterator<Kind>::Next()
{
    if (myNode->next)
    {
	   myNode = myNode->next;
    }
    else
    {
	   myChainIndex++;
	   Advance();
    }

}

template <class Kind>
const Kind &
HMapIterator<Kind>::Current() const
{
    if (! IsDone())
    {
	   return myNode->info;
    }
    else
    {
	   cerr << "bad call of current, iterator done" << endl;
    }
}

template <class Kind>
Kind & HMapIterator<Kind>::Current()
{
    if (! IsDone())
    {
	   return myNode->info;
    }
    else
    {
	   cerr << "bad call of current, iterator done" << endl;
    }
}