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

#include <unsorted_priority_queue.h>

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

Public Member Functions
	UnsortedPriorityQueue ()
int	size () const
	Returns the current size of the priority queue.
bool	empty () const
	Returns true if the priority queue is empty.
void	insert (const Entry &e)
	Inserts a new entry into the priority queue.
const Entry &	min () const
	Returns a constant reference to the minimum entry.
void	remove_min ()
	Removes the minimum entry.

Protected Attributes
std::list< Entry >	data
Compare	less_than

Constructor & Destructor Documentation

UnsortedPriorityQueue()

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

dsac::priority::UnsortedPriorityQueue< Entry, Compare >::UnsortedPriorityQueue ( )

inline

Member Function Documentation

empty()

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

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

inline

Returns true if the priority queue is empty.

insert()

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

void dsac::priority::UnsortedPriorityQueue< Entry, Compare >::insert ( const Entry &  e )

inline

Inserts a new entry into the priority queue.

min()

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

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

inline

Returns a constant reference to the minimum entry.

remove_min()

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

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

inline

Removes the minimum entry.

size()

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

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

inline

Returns the current size of the priority queue.

Field Documentation

data

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

std::list<Entry> dsac::priority::UnsortedPriorityQueue< Entry, Compare >::data

protected

less_than

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

Compare dsac::priority::UnsortedPriorityQueue< Entry, Compare >::less_than

protected

---

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

• dsac/priority/unsorted_priority_queue.h