PriorityQueue< T > Class Template Reference

Managed implementation of a priority queue (based on a binary heap) More...

Public Member Functions
override int	Count ()
override T	Dequeue ()
	Returns the value of the highest-priority element and removes it from the queue.
override void	Enqueue (T element)
	Enqueues an element into the queue.
override bool	IsEmpty ()
override T	Peek ()
	Retrieves the value of the highest-priority element, without taking it from the queue.
	PriorityQueue (IComparer< T > comparer)
Public Member Functions inherited from APriorityQueue< T >
int	Count ()
T	Dequeue ()
void	Enqueue (T element)
bool	IsEmpty ()
T	Peek ()

Detailed Description

Managed implementation of a priority queue (based on a binary heap)

Template Parameters

T

Member Function Documentation

Dequeue()

override T Dequeue

(

)

Returns the value of the highest-priority element and removes it from the queue.

Returns

Enqueue()

override void Enqueue

(

T

element

)

Enqueues an element into the queue.

Parameters

element

IsEmpty()

override bool IsEmpty

(

)

Returns

True if the queue is empty, and false otherwise

Peek()

override T Peek

(

)

Retrieves the value of the highest-priority element, without taking it from the queue.

Returns