In file code/C/queue.H:

template<class T> class GQueue : public GObject

A generic queue class to handle pointers to objects

Inheritance:

public members:

GQueue()
~GQueue()
Remeber this does not free the stored data, only the queue storage
GQueue &operator=( GQueue &x)
Assignment operator to allow queues to be copied
void Add(T * data )
Adds a node to the end of the queue
T *Pop()
Pops the node from the head of the queue
int GetSize()
Returns the current queue size
void DeleteQueue()
Calls delete on all of the data nodes in the queue

private members:

int size
The number of nodes in the queue
GQueueNode <T> *head
The head of the queue
GQueueNode <T> *tail
The tail of the queue

Inherited from GObject:

public members:

friend ostream& operator<<(ostream& s, GObject &)

Documentation

This class implements a fifo (first in first out) queue that handles pointers to objects. Note: This class does not free up the stored objects when its destructor is called. It is necessary to call DeleteQueue() in order to clean the queue out.

this class has no child classes.

 alphabetic index hierarchy of classes

this page has been generated automatically by doc++

(c)opyright by Malte Zöckler, Roland Wunderling