#include <staticQueue.h>
Inheritance diagram for staticQueue:
Public Types | |
enum | TOptInsert { INSERT_NO_THROW = 0, INSERT_TWICE_THROW = 1 } |
Public Member Functions | |
staticQueue (TItem nn, goblinController &thisContext) throw () | |
staticQueue (staticQueue< TItem, TKey > &Q) throw () | |
~staticQueue () throw () | |
unsigned long | Size () const throw () |
unsigned long | Allocated () const throw () |
char * | Display () const throw () |
void | Insert (TItem w, TKey alpha, staticQueue::TOptInsert mode) throw (ERRange,ERCheck) |
void | Insert (TItem w, staticQueue::TOptInsert mode) throw (ERRange,ERCheck) |
void | Insert (TItem w, TKey alpha=0) throw (ERRange,ERCheck) |
TItem | Delete () throw (ERRejected) |
void | ChangeKey (TItem w, TKey alpha) throw (ERRange,ERRejected) |
TItem | Peek () const throw (ERRejected) |
bool | Empty () const throw () |
void | Init () throw () |
TItem | Cardinality () const throw () |
bool | IsMember (TItem i) const throw (ERRange) |
TItem | First () const throw () |
TItem | Successor (const TItem i) const throw (ERRange) |
|
Strategy for repeated queue insertions.
|
|
|
|
|
|
|
|
Reimplemented from managedObject. |
|
Query the current queue cardinality.
Implements goblinQueue. |
|
Insert an index into the queue.
Implements goblinQueue. |
|
Delete an element from the queue.
Implements goblinQueue. |
|
Unconditional display of data objects.
Reimplemented from indexSet. |
|
Check if the queue is empty.
Implements goblinQueue. |
|
Query the smallest index in an index set.
Reimplemented from indexSet. |
|
Delete all elements from the queue efficently.
Implements goblinQueue. |
|
Insert an index into the queue.
Implements goblinQueue. |
|
|
|
|
|
Test for indet set membership.
Implements indexSet. |
|
Query what is coming next on the queue.
Implements goblinQueue. |
|
Implements goblinQueue. |
|
Enumeration of the indices contained in a set.
Reimplemented from indexSet. |