vectoriterator.h

数据结构常用算法——向量遍历器。希望能给读者朋友带来帮助。

//向量遍历器类
#include "iterator.h"
template <class T>class vectorIterator:public iterator<T>
{
public:
	vectorIterator(Vector<T> &);
	vectorIterator(const vectorIterator &);
	virtual int init();
	virtual T operator ()();
	virtual int operator !();
	virtual int operator ++();
	virtual void operator=(T newvalue);
	int operator --();
	int key();
protected:
	unsigned currentkey;
	Vector<T> & data;
};

template <class T>vectorIterator<T>::vectorIterator(Vector<T> & v):data(v)
{
  init();
}

template <class T>int vectorIterator<T>::init()
{
  currentkey=0;
  return operator !();
}


template <class T>vectorIterator<T>::vectorIterator(const vectorIterator<T> & x)
:data(x.data),currentkey(x.currentkey)
{
}

template <class T>int vectorIterator<T>::operator !()
{
  return currentkey<data.length();
}

template <class T>int vectorIterator<T>::operator ++()
{
  currentkey++;
  return operator !();
}

template <class T>T vectorIterator<T>::operator()()
{
  return data[currentkey];
}

template <class T>
void vectorIterator<T>::operator = (T newvalue)
{
  data[currentkey]=newvalue;
}

template <class T>
int vectorIterator<T>::operator--()
{
  if (currentkey>0)
	  currentkey--;
  return operator!();
}

template <class T>int vectorIterator<T>::key()
{
  return currentkey;
}