List

template < class T_item > class List

Be careful: to simplify, this list is strange ! The place() places the current pointer out of the list, and you must do walk() before get()

Inheritance:

Public Methods
List() throw()
virtual ~List() throw()
List(List< class T_item >& from) throw()
virtual void put(T_item item) throw()
virtual T_item get() const throw(Exception)
virtual void suppr() throw(Exception)
virtual void place() throw(): PlaceCurrentOnQueue()
virtual int walk() throw(): WalkQueueToHead, return 0 if cannot
virtual int empty() const throw()
virtual void placeCurrentOnHead() throw()
virtual int walkHeadToQueue() throw()
virtual void placeCurrentOnQueue() throw()
virtual int walkQueueToHead() throw()
virtual List < class T_item > & operator=(List< class T_item >& from) throw(): Copy all the items
virtual bool atTheQueue() const throw()
virtual bool atTheHead() const throw()

Protected Classes

struct Cell

T_item item
struct Cell *next
struct Cell *last

Protected Fields
Cell* head
Cell* queue
Cell* cur

Documentation

Be careful: to simplify, this list is strange ! The place() places the current pointer out of the list, and you must do walk() before get(). It looks strange, but now, you can write easily : list.place(); while(list.walk()) ...list.get(); Also, this form avoids some problem like the suppress : you can write easily : list.place(); while(list.walk()) list.suppr(); Be careful : prefer pointer for template class T_item (list< MyClass * >)

struct Cell T_item item struct Cell *next struct Cell *last

Cell* head

Cell* queue

Cell* cur

List() throw()

virtual ~List() throw()

List(List< class T_item >& from) throw()

virtual void put(T_item item) throw()

virtual T_item get() const throw(Exception)

virtual void suppr() throw(Exception)

virtual void place() throw()