PQueue< T > Class Template Reference

Convenient priority queue implemented using the STL's heap algorithm. More...

#include <PQueue.h>

---

Detailed Description

template<class T>
class PQueue< T >

Convenient priority queue implemented using the STL's heap algorithm.

Definition at line 9 of file PQueue.h.

List of all members.

Public Member Functions
	PQueue ()
void	push (const T &obj)
T	pop ()
bool	isEmpty ()
Protected Attributes
std::vector< T >	heap

---

Constructor & Destructor Documentation

template<class T>

PQueue< T >::PQueue

(

)

Definition at line 11 of file PQueue.h.

---

Member Function Documentation

template<class T >

bool PQueue< T >::isEmpty

(

)

Definition at line 35 of file PQueue.h.

Referenced by KDTree::getBestNKeypointMatch().

template<class T >

T PQueue< T >::pop

(

)

Definition at line 27 of file PQueue.h.

Referenced by KDTree::getBestNKeypointMatch().

template<class T >

void PQueue< T >::push

(

const T &

obj

)

Definition at line 21 of file PQueue.h.

Referenced by KDTree::getBestNKeypointMatch().

---

Member Data Documentation

template<class T>

std::vector<T> PQueue< T >::heap [protected]

Definition at line 17 of file PQueue.h.

Referenced by PQueue< T >::isEmpty(), PQueue< T >::pop(), and PQueue< T >::push().

---

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

• PQueue.h