Ultima::Std::priority_queue< _Ty, _Container, _Pr > Class Template Reference

#include <containers.h>

Public Member Functions
	priority_queue (const _Pr &_Pred)
	priority_queue (const _Pr &_Pred, const _Container &_Cont)
template<class _InIt >
	priority_queue (_InIt _First, _InIt _Last, const _Pr &_Pred, const _Container &_Cont)
template<class _InIt >
	priority_queue (_InIt _First, _InIt _Last)
template<class _InIt >
	priority_queue (_InIt _First, _InIt _Last, const _Pr &_Pred)
bool	empty () const
size_t	size () const
_Container::const_reference	top () const
void	push (const typename _Container::value_type &_Val)
void	pop ()
void	swap (priority_queue &_Right)

Protected Attributes
_Container	c
_Pr	comp

Detailed Description

template<class _Ty, class _Container, class _Pr>
class Ultima::Std::priority_queue< _Ty, _Container, _Pr >

Queue ordered by a provided priority function NOTE: Unlike in the C std library, we have to provde a comparitor that sorts the array so that the smallest priority comes last

---

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

• engines/ultima/shared/std/containers.h