basicHeap Class Template Reference
[Priority queues]

Naive implementation of a priority queue. More...

#include <basicHeap.h>

Inheritance diagram for basicHeap:

Public Member Functions
	basicHeap (TItem nn, goblinController &thisContext) throw ()
	~basicHeap () throw ()
void	Init () throw ()
unsigned long	Size () const throw ()
unsigned long	Allocated () const throw ()
char *	Display () const throw ()
void	Insert (TItem w, TKey alpha) throw (ERRange,ERRejected)
void	Delete (TItem w) throw (ERRange,ERRejected)
TKey	Key (TItem w) const throw (ERRange)
void	ChangeKey (TItem w, TKey alpha) throw (ERRange,ERRejected)
TItem	Delete () throw (ERRejected)
TItem	Peek () const throw (ERRejected)
bool	Empty () const throw ()
TItem	Cardinality () const throw ()

---

Detailed Description

template<class TItem, class TKey>
class basicHeap< TItem, TKey >

Naive implementation of a priority queue.

---

Constructor & Destructor Documentation

basicHeap (  TItem  nn, goblinController &  thisContext )  throw ()

~basicHeap (   )  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.

void Delete (  TItem  w  )  throw (ERRange,ERRejected)

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 )  throw (ERRange,ERRejected) [virtual]

Insert an index into the queue. Parameters: w  The index to be inserted alpha  The priority of the inserted index Implements goblinQueue.

TKey Key (  TItem  w  )  const throw (ERRange)

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.