dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare > Class Template Reference

#include <heap_adaptable_priority_queue.h>

Collaboration diagram for dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >:

Public Types
typedef const int *	Locator

Public Member Functions
int	size () const
	Returns the size of the priority queue.
bool	empty () const
	Returns true if the priority queue is empty.
const Entry &	min ()
	Returns a reference to the minimum element.
void	remove_min ()
	Removes the minimum entry.
Locator	insert (const Entry &e)
	Inserts an entry and returns a Locator for that entry.
void	remove (Locator loc)
	Removes the tracked entry.
void	update (Locator loc, const Entry &e)
	Replaces the tracked entry with a new entry.

Member Typedef Documentation

Locator

template<typename Entry , typename Compare = std::less<Entry>>

typedef const int* dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >::Locator

Member Function Documentation

empty()

template<typename Entry , typename Compare = std::less<Entry>>

bool dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >::empty ( ) const

inline

Returns true if the priority queue is empty.

insert()

template<typename Entry , typename Compare = std::less<Entry>>

Locator dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >::insert ( const Entry &  e )

inline

Inserts an entry and returns a Locator for that entry.

min()

template<typename Entry , typename Compare = std::less<Entry>>

const Entry & dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >::min ( )

inline

Returns a reference to the minimum element.

remove()

template<typename Entry , typename Compare = std::less<Entry>>

void dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >::remove ( Locator  loc )

inline

Removes the tracked entry.

remove_min()

template<typename Entry , typename Compare = std::less<Entry>>

void dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >::remove_min ( )

inline

Removes the minimum entry.

size()

template<typename Entry , typename Compare = std::less<Entry>>

int dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >::size ( ) const

inline

Returns the size of the priority queue.

update()

template<typename Entry , typename Compare = std::less<Entry>>

void dsac::priority::HeapAdaptablePriorityQueue< Entry, Compare >::update ( Locator  loc, const Entry &  e  )

inline

Replaces the tracked entry with a new entry.

---

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

• dsac/priority/heap_adaptable_priority_queue.h