SuperPQueue< T > Class Template Reference
A priority queue which combines two implementations: 1. More...
#include <PQueue.h>
Inheritance diagram for SuperPQueue< T >:
Public Member Functions | |
| virtual void | insert (T value, int priority)=0 |
| virtual void | remove (T value, int priority)=0 |
| virtual void | update (T value, int oldPriority, int newPriority)=0 |
| virtual T | getMax ()=0 |
| virtual void | reset ()=0 |
| virtual int | size ()=0 |
| virtual | ~SuperPQueue () |
Detailed Description
template<class T>
class SuperPQueue< T >
A priority queue which combines two implementations: 1.
heap based 2. array(for priority values) + linked-list (saving the elemements of the queue having the same priority) Which one to use depends on the max number of nodes of queue
Constructor & Destructor Documentation
template<class T>
| virtual SuperPQueue< T >::~SuperPQueue | ( | ) | [inline, virtual] |
Member Function Documentation
template<class T>
| virtual T SuperPQueue< T >::getMax | ( | ) | [pure virtual] |
Implemented in HeapQueue< T >, and LimitedPriorityQueue< T >.
template<class T>
| virtual void SuperPQueue< T >::insert | ( | T | value, | |
| int | priority | |||
| ) | [pure virtual] |
Implemented in HeapQueue< T >, and LimitedPriorityQueue< T >.
template<class T>
| virtual void SuperPQueue< T >::remove | ( | T | value, | |
| int | priority | |||
| ) | [pure virtual] |
Implemented in HeapQueue< T >, and LimitedPriorityQueue< T >.
template<class T>
| virtual void SuperPQueue< T >::reset | ( | ) | [pure virtual] |
Implemented in HeapQueue< T >, and LimitedPriorityQueue< T >.
template<class T>
| virtual int SuperPQueue< T >::size | ( | ) | [pure virtual] |
Implemented in HeapQueue< T >, and LimitedPriorityQueue< T >.
template<class T>
| virtual void SuperPQueue< T >::update | ( | T | value, | |
| int | oldPriority, | |||
| int | newPriority | |||
| ) | [pure virtual] |
Implemented in HeapQueue< T >, and LimitedPriorityQueue< T >.
The documentation for this class was generated from the following file:
