#include <lists.h>
Inheritance diagram for PQueue< T >:
Public Member Functions | |
Construction | |
PQueue () | |
Overrides from class PObject | |
virtual PObject * | Clone () const |
New functions for class | |
virtual void | Enqueue (T *obj) |
virtual T * | Dequeue () |
Protected Member Functions | |
PQueue (int dummy, const PQueue *c) |
By default, objects placed into the set will { not} be deleted when removed or when all references to the set are destroyed. This is different from the default on most collection classes.
Note that if templates are not used the PDECLARE_QUEUE# macro will simulate the template instantiation.
Create a new, empty, queue.
Note that by default, objects placed into the queue will { not} be deleted when removed or when all references to the queue are destroyed. This is different from the default on most collection classes.
Make a complete duplicate of the list. Note that all objects in the array are also cloned, so this will make a complete copy of the list.
Reimplemented from PObject.
virtual T* PQueue< T >::Dequeue | ( | ) | [inline, virtual] |
Remove an object that was added to the queue.
virtual void PQueue< T >::Enqueue | ( | T * | obj | ) | [inline, virtual] |
Add a new object to the queue. This places a new link at the "tail" of the list, which is the "in" side of the queue.
obj | Object to add to the queue. |