Public Member Functions
T	top (void)

void	pop (void)

int	push (const T &elt)

int	size (void) const

bool	empty (void) const

T &	at (int pos)

const T &	at (int pos) const

void	resetCurrentPosition ()

T	next_element (void)

const T &	current_element () const

T &	current_element ()

void	erase_current_element ()

const int	current_position () const

bool	last_element () const

void	update_queue (void)

Member Function Documentation

template<class T , class Compare >

T & MyPriorityQueue< T, Compare >::at ( int pos )

Retrieve element at position pos

Parameters

pos	Position in the queue

Returns: Element at position pos

template<class T , class Compare >

const T & MyPriorityQueue< T, Compare >::at ( int pos ) const

Retrieve element at position pos

Parameters

pos	Position in the queue

Returns: Element at position pos

template<class T , class Compare >

const T & MyPriorityQueue< T, Compare >::current_element ( ) const

Retrieve current element at current position

Returns: current Element at current position

template<class T , class Compare >

T & MyPriorityQueue< T, Compare >::current_element ( )

Retrieve current element at current position

Returns: current Element at current position

template<class T , class Compare >

const int MyPriorityQueue< T, Compare >::current_position ( ) const

Retrieve position of the current element

Returns: position of the current element

template<class T , class Compare >

bool MyPriorityQueue< T, Compare >::empty ( void ) const

Checks if the priority queue is empty

Returns: True if the queue is empty, false otherwise

template<class T , class Compare >

void MyPriorityQueue< T, Compare >::erase_current_element ( )

Erase element at current pos

Parameters

pos	Position in the queue

template<class T , class Compare >

bool MyPriorityQueue< T, Compare >::last_element ( ) const

End of element

Returns: True if it is the last element according to the current position, false otherwise

template<class T , class Compare >

T MyPriorityQueue< T, Compare >::next_element ( void )

Retrieve next element according to current position

Returns: next Element at current position

template<class T , class Compare >

void MyPriorityQueue< T, Compare >::pop ( void )

Removes the first element in the priority queue

template<class T, class Compare >

int MyPriorityQueue< T, Compare >::push ( const T & elt )

Inserts an element into the priority queue. The priority queue is sorted at any time during the simulation. To insert the element properly, the method uses the Compare template class.

Parameters

elt	A reference to the element to insert. The element is copied into the queue

template<class T , class Compare >

void MyPriorityQueue< T, Compare >::resetCurrentPosition ( )

Reset the current position

template<class T , class Compare >

int MyPriorityQueue< T, Compare >::size ( void ) const

Returns the size of the priority queue

Returns: The waiting queue size

template<class T , class Compare >

T MyPriorityQueue< T, Compare >::top ( void )

Returns the first element in the priority queue

template<class T , class Compare >

void MyPriorityQueue< T, Compare >::update_queue ( void )

Update queue after a priority change

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

C:/App/eclipse/TOOLS/fortress_management/fortress_dev/ref-simulation/Config_1/simulation/RecoSim/src/my_priority_queue.h

Public Member Functions

Member Function Documentation