citerator.h

Go to the documentation of this file.

#ifndef CITERATOR_H
#define CITERATOR_H

#include <deque>

#include <assert.h>

template<class T> class CIterator {
public:
  virtual void first() = 0;
  virtual void next() = 0;
  virtual T *current_item() = 0;
  virtual int is_done() = 0;
};

template<class T> class CDequeForwardIterator : public CIterator<T> {
private:
  std::deque<T *> *list;
  unsigned int index;
public:
  CDequeForwardIterator(std::deque<T *> &list) : index(0) { this->list = &list; }
  void first() { index = 0; }
  void next() { index++; }
  T *current_item() { assert(!is_done()); return (*list)[index]; }
  int is_done() { return (list->empty() || index >= list->size()); }
};

template<class T> class CDequeBackwardIterator : public CIterator<T> {
private:
  std::deque<T *> *list;
  int index;

public:
  CDequeBackwardIterator(std::deque<T *> &list) : index(0) { this->list = &list; first(); }
  void first() { index = (unsigned int) list->size() - 1; }
  void next() { index--; }
  T *current_item() { assert(!is_done()); return (*list)[index]; }
  int is_done() { return (list->empty() || index < 0); }
};

#endif

---