7template <
class TYPE,
class ARG_TYPE = const TYPE &,
class CONTAINER = array < TYPE, ARG_TYPE >,
class FIRST = ::comparison::less < TYPE, ARG_TYPE > >
12 inline bool is_empty()
const;
13 inline ::collection::count size()
const;
16 inline const TYPE & top
const;
18 inline void push(
const TYPE & t);
25template <
class TYPE,
class ARG_TYPE,
class CONTAINER,
class FIRST >
26inline bool priority_queue < TYPE, ARG_TYPE, CONTAINER, FIRST > ::is_empty()
const
29 return this->CONTAINER::is_empty();
33template <
class TYPE,
class ARG_TYPE,
class CONTAINER,
class FIRST >
34inline ::collection::count priority_queue < TYPE, ARG_TYPE, CONTAINER, FIRST > ::size()
const
37 return this->CONTAINER::size();
42template <
class TYPE,
class ARG_TYPE,
class CONTAINER,
class FIRST >
43inline TYPE & priority_queue < TYPE, ARG_TYPE, CONTAINER, FIRST > ::top
46 return this->CONTAINER::front();
50template <
class TYPE,
class ARG_TYPE,
class CONTAINER,
class FIRST >
51inline const TYPE & priority_queue < TYPE, ARG_TYPE, CONTAINER, FIRST > ::top
const
54 return this->CONTAINER::front();
58template <
class TYPE,
class ARG_TYPE,
class CONTAINER,
class FIRST >
59inline void priority_queue < TYPE, ARG_TYPE, CONTAINER, FIRST > ::push(
const TYPE & t)
62 this->priority_queue::add(t);
64 ::sort::quick_sort < FIRST > ((CONTAINER *)
this);
68template <
class TYPE,
class ARG_TYPE,
class CONTAINER,
class FIRST >
69inline void priority_queue < TYPE, ARG_TYPE, CONTAINER, FIRST > ::pop()
72 this->CONTAINER::pop_back();
Definition priority_queue.h:9