OdinAI
 All Classes Namespaces Functions Variables
IndexedPriorityQLow< T > Class Template Reference

#include <PriorityQueue.h>

Public Member Functions

 IndexedPriorityQLow (std::vector< T > &keys, int maxSize)
 
bool Empty () const
 
void Insert (int index)
 
int Pop ()
 
void ChangePriority (int index)
 

Detailed Description

template<class T>
class IndexedPriorityQLow< T >

Priority queue based on an index of keys. It prioritize the lowest value.

Member Function Documentation

template<class T >
void IndexedPriorityQLow< T >::ChangePriority ( int  index)
inline

If the key have changed, update the priority queue accordingly.

template<class T >
bool IndexedPriorityQLow< T >::Empty ( ) const
inline

Returns true if queue is empty.

template<class T >
void IndexedPriorityQLow< T >::Insert ( int  index)
inline

Insert an element.

template<class T >
int IndexedPriorityQLow< T >::Pop ( )
inline

Returns the element with the lowest value.


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