Priority Queue. More...

Public Member Functions
function	GetAuthor ()
function	GetName ()
function	GetShortName ()
function	GetDescription ()
function	GetVersion ()
function	GetDate ()
function	CreateInstance ()
function	GetCategory ()
function	Insert (item, priority)
	Insert a new entry in the list.
function	Pop ()
	Pop the first entry of the list.
function	Peek ()
	Peek the first entry of the list.
function	Count ()
	Get the amount of current items in the list.
function	Exists (item)
	Check if an item exists in the list.

Detailed Description

Priority Queue.

Peek and Pop always return the current lowest value in the list. Sort is done on insertion only.

Member Function Documentation

function Priority_Queue::Count ( )

Get the amount of current items in the list.

The complexity of this operation is O(1).

function Priority_Queue::Exists ( item )

Check if an item exists in the list.

The complexity of this operation is O(n).

Parameters

item	The item to check for.

function Priority_Queue::Insert	(	item	,
		priority
	)

Insert a new entry in the list.

The complexity of this operation is O(n).

Parameters

item	The item to add to the list.
priority	The priority this item has.

function Priority_Queue::Peek ( )

Peek the first entry of the list.

This is always the item with the lowest priority. The complexity of this operation is O(1).

function Priority_Queue::Pop ( )

Pop the first entry of the list.

This is always the item with the lowest priority. The complexity of this operation is O(1).

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