dynamicQueue Class Template Reference
[Node based containers]

Implements a node based FIFO queue. More...

#include <dynamicQueue.h>

Inheritance diagram for dynamicQueue:

goblinQueue managedObject goblinRootObject

Public Member Functions

 dynamicQueue (TItem nn, goblinController &thisContext) throw ()
 ~dynamicQueue () throw ()
unsigned long Size () const throw ()
unsigned long Allocated () const throw ()
char * Display () const throw ()
void Insert (TItem w, TKey alpha=0) throw (ERRange)
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 ()

Data Structures

struct  queueMember

Detailed Description

template<class TItem, class TKey = TFloat>
class dynamicQueue< TItem, TKey >

Implements a node based FIFO queue.


Constructor & Destructor Documentation

dynamicQueue TItem  nn,
goblinController thisContext
throw ()
 

~dynamicQueue  )  throw ()
 


Member Function Documentation

unsigned long Allocated  )  const throw ()
 

Reimplemented from managedObject.

TItem Cardinality  )  const throw () [virtual]
 

Query the current queue cardinality.

Returns:
The queue cardinality

Implements goblinQueue.

void ChangeKey TItem  w,
TKey  alpha
throw (ERRange,ERRejected) [virtual]
 

Insert an index into the queue.

Parameters:
w An element index
alpha A new priority for this element

Implements goblinQueue.

TItem Delete  )  throw (ERRejected) [virtual]
 

Delete an element from the queue.

Returns:
The index of the deleted element

Implements goblinQueue.

char * Display  )  const throw () [virtual]
 

Unconditional display of data objects.

Reimplemented from managedObject.

bool Empty  )  const throw () [virtual]
 

Check if the queue is empty.

Return values:
true The queue is empty

Implements goblinQueue.

void Init  )  throw () [virtual]
 

Delete all elements from the queue efficently.

Implements goblinQueue.

void Insert TItem  w,
TKey  alpha = 0
throw (ERRange) [virtual]
 

Insert an index into the queue.

Parameters:
w The index to be inserted
alpha The priority of the inserted index

Implements goblinQueue.

TItem Peek  )  const throw (ERRejected) [virtual]
 

Query what is coming next on the queue.

Returns:
The index of the element to be deleted next

Implements goblinQueue.

unsigned long Size  )  const throw () [virtual]
 

Implements goblinQueue.