Util::Queue< TYPE > Class Template Reference
#include <queue.h>
Inheritance diagram for Util::Queue< TYPE >:
< TYPE >_map" border="0" alt="">Detailed Description
template<class TYPE>
class Util::Queue< TYPE >
Nebula3's queue class (a FIFO container).(C) 2006 Radon Labs GmbH
Public Member Functions | |
| Queue () | |
| constructor | |
| Queue (const Queue< TYPE > &rhs) | |
| copy constructor | |
| void | operator= (const Queue< TYPE > &rhs) |
| assignment operator | |
| TYPE & | operator[] (IndexT index) const |
| access element by index, 0 is the frontmost element (next to be dequeued) | |
| bool | operator== (const Queue< TYPE > &rhs) const |
| equality operator | |
| bool | operator!= (const Queue< TYPE > &rhs) const |
| inequality operator | |
| void | Reserve (SizeT num) |
| increase capacity to fit N more elements into the queue | |
| SizeT | Size () const |
| returns number of elements in the queue | |
| bool | IsEmpty () const |
| return true if queue is empty | |
| void | Clear () |
| remove all elements from the queue | |
| bool | Contains (const TYPE &e) const |
| return true if queue contains element | |
| void | Enqueue (const TYPE &e) |
| add element to the back of the queue | |
| TYPE | Dequeue () |
| remove the element from the front of the queue | |
| TYPE & | Peek () const |
| access to element at front of queue without removing it | |