Developer Documentation
RAVL, Recognition And Vision Library
USER HOME PAGE CLASS LIST CONTENTS
Ravl - Core - Queues - PriQueueLBodyC<class K,class D>
 

  PUBLIC
PriQueueLBodyC::PriQueueLBodyC(void)
PriQueueLBodyC::~PriQueueLBodyC(void)
PriQueueLBodyC::operator =(const PriQueueLBodyC &)
PriQueueLBodyC::IsElm(void) const
PriQueueLBodyC::IsEmpty(void) const
PriQueueLBodyC::Top(void)
PriQueueLBodyC::Top(void) const
PriQueueLBodyC::TopKey(void) const
PriQueueLBodyC::DelTop(void)
PriQueueLBodyC::GetTopPair(void)
PriQueueLBodyC::GetTop(void)
PriQueueLBodyC::Insert(const K &,const D &)
PriQueueLBodyC::Insert(Tuple2C &)
PriQueueLBodyC::Remove(const Tuple2C &)
PriQueueLBodyC::Remove(const K &)
PriQueueLBodyC::Size(void) const
PriQueueLBodyC::Dump(HeapNodeC *,int)
PriQueueLBodyC::Empty(void)
RCBodyC::References(void) const
RCBodyC::Copy(void) const
RCBodyC::DeepCopy(UIntT) const
RCBodyC::IncRefCounter(void)
RCBodyC::DecRefCounter(void)

   PriQueueLBodyC<class K,class D>   
 
Pointer based version of Priority Queue.
 
include "Ravl/PriQueueL.hh"
Created:28/10/96 
Source file:Ravl/Core/Container/Queue/PriQueueL.hh
User Level:Develop
Library:RavlCore
Example:TPriQ.cc
In Scope:RavlN

Parent Classes: Variables:
HeapNodeC * root;

Methods:
PriQueueLBodyC()
Default constructor.

~PriQueueLBodyC()
Destructor.

PriQueueLBodyC & operator =(const PriQueueLBodyC<K,D> & Oth)
Assignment operator

bool IsElm() const
Does the queue contains any items ?

bool IsEmpty() const
Is the queue empty ?

D & Top()
Look/Modify data on top of queue.

const D & Top() const
Look at data on top of queue.

const K & TopKey() const
Look at key on top of queue.

void DelTop()
Delete item on top of queue.
NB. IsElm(), must be true before calling this.

Tuple2C<K,D> & GetTopPair()
Get Key/Data pair from queue.
WARNING: For advanced users only. !! Users responsability to delete returned info after use. !!

D GetTop()
Get Data from top of queue.

void Insert(const K & Key,const D & Data)
Insert Data/Key into queue.

void Insert(Tuple2C<K,D> & New)
Insert Data/Key into queue.

bool Remove(const Tuple2C<K,D> & New)
Remove all instances of Key from queue.
Returns True if found.
BUG: NOT IMPLEMENTED

bool Remove(const K & Key)
Remove all instances of Key from queue.
Returns True if found.
BUG: NOT IMPLEMENTED

int Size() const
Get number of items in queue. Slow !!!

void Dump(HeapNodeC<K,D> * Place = 0,int level = 0)
Dump to stdout

void Empty()
Empty the queue of all its contents.

#include "Ravl/RefCounter.hh"
UIntT References() const
Access count of handles open to this object.

RCBodyC & Copy() const
Make copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

RCBodyC & DeepCopy(UIntT levels = ((UIntT))) const
Make a deep copy of body.
This should be provided in derived classes. this funtion will issue an assertion failure if called.

void IncRefCounter()
Increment reference counter.

bool DecRefCounter()
Decrement reference counter.


Maintainer:Charles Galambos, Created: 28/10/96, Documentation by CxxDoc: Tue Aug 13 09:59:30 2002