LimitedPriorityQueue< T > Class Template Reference

#include <PQueue.h>

Inheritance diagram for LimitedPriorityQueue< T >:

List of all members.

Public Member Functions
	LimitedPriorityQueue (int maxNumNodes, int maxPriority, int(*mapToInt)(T))
virtual	~LimitedPriorityQueue ()
void	insert (T value, int priority)
void	remove (T value, int priority)
void	update (T value, int oldPriority, int newPriority)
T	getMax ()
int	size ()
void	reset ()
Private Attributes
int	numNodes
int	_maxPriority
int	pPrioritySpan
int	nPrioritySpan
ListNode< T > *	nodes
vector< ListNode< T > * >	buckets
int	bucketSize
int	bucketIndex
const int	PLUS_PRIORITYSPAN
const int	NEG_PRIORITYSPAN
int(*	_mapToInt )(T)

template<class T>
class LimitedPriorityQueue< T >

---

Constructor & Destructor Documentation

template<class T>

LimitedPriorityQueue< T >::LimitedPriorityQueue	(	int	maxNumNodes,
		int	maxPriority,
		int(*)(T)	mapToInt
	)			[inline]

template<class T>

virtual LimitedPriorityQueue< T >::~LimitedPriorityQueue

(

)

[inline, virtual]

---

Member Function Documentation

template<class T>

T LimitedPriorityQueue< T >::getMax

(

)

[inline, virtual]

Implements SuperPQueue< T >.

template<class T>

void LimitedPriorityQueue< T >::insert	(	T	value,
		int	priority
	)			[inline, virtual]

Implements SuperPQueue< T >.

template<class T>

void LimitedPriorityQueue< T >::remove	(	T	value,
		int	priority
	)			[inline, virtual]

Implements SuperPQueue< T >.

template<class T>

void LimitedPriorityQueue< T >::reset

(

)

[inline, virtual]

Implements SuperPQueue< T >.

template<class T>

int LimitedPriorityQueue< T >::size

(

)

[inline, virtual]

Implements SuperPQueue< T >.

template<class T>

void LimitedPriorityQueue< T >::update	(	T	value,
		int	oldPriority,
		int	newPriority
	)			[inline, virtual]

Implements SuperPQueue< T >.

---

Member Data Documentation

template<class T>

int(* LimitedPriorityQueue< T >::_mapToInt)(T) [private]

template<class T>

int LimitedPriorityQueue< T >::_maxPriority [private]

template<class T>

int LimitedPriorityQueue< T >::bucketIndex [private]

template<class T>

vector<ListNode<T>*> LimitedPriorityQueue< T >::buckets [private]

template<class T>

int LimitedPriorityQueue< T >::bucketSize [private]

template<class T>

const int LimitedPriorityQueue< T >::NEG_PRIORITYSPAN [private]

template<class T>

ListNode<T>* LimitedPriorityQueue< T >::nodes [private]

template<class T>

int LimitedPriorityQueue< T >::nPrioritySpan [private]

template<class T>

int LimitedPriorityQueue< T >::numNodes [private]

template<class T>

const int LimitedPriorityQueue< T >::PLUS_PRIORITYSPAN [private]

template<class T>

int LimitedPriorityQueue< T >::pPrioritySpan [private]

---

The documentation for this class was generated from the following file:

• PQueue.h