std::low_priority_queue< Element, Priority > Class Template Reference

a low-priority queue of Elements with Priorities More...

#include <low_priority_queue.hpp>

Public Types
typedef std::pair< Element, Priority >	value_type
typedef list< value_type >::iterator	const_iterator

Public Member Functions
	low_priority_queue ()
	construct an empty low-priority queue
	low_priority_queue (const low_priority_queue< Element, Priority > &lpq)
	copy construct a low-priority queue
const bool	empty () const
	return whether the low-priority queue is empty
const_iterator	insert (const value_type &value)
	insert an element into the low-priority queue, returning a const_iterator to the newly inserted item
void	erase (const const_iterator &it)
	erase an element (given as iterator) from the low-priority queue
void	change_priority (const const_iterator &it, const Priority &new_prio)
	change the priority of an item in the low-priority queue
void	decrement_priority (const const_iterator &it)
	decrement the priority of an item, given as iterator (see change_priority())
void	increment_priority (const const_iterator &it)
	increment the priority of an item, given as iterator (see change_priority())
const value_type &	get_min () const
	return the min of the low-priority queue - this is any item of minimum priority
void	pop_min ()
	remove the min of the low-priority queue
const value_type &	get_max () const
	return the max of the low-priority queue - this is an item of maximum priority
void	pop_max ()
	remove the max of the low-priority queue

Detailed Description

template<class Element, class Priority = size_t>
class std::low_priority_queue< Element, Priority >

a low-priority queue of Elements with Priorities

Priority should be orderable by its operator<() (see std::map)

---

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

• utils/low_priority_queue.hpp