Standard C++ Library Reference ISO/IEC (VERSION3)

priority_queue::priority_queue
priority_queue();
explicit priority_queue(const Pr& pred);
priority_queue(const Pr& pred,
const container_type& cont);
priority_queue(const priority_queue& right);
template<class InIt>
priority_queue(InIt first, InIt last);
template<class InIt>
priority_queue(InIt first, InIt last,
const Pr& pred);
template<class InIt>
priority_queue(InIt first, InIt last,
const Pr& pred, const container_type& cont);
All constructors with an argument cont initialize the stored object with c(cont). The
remaining constructors initialize the stored object with c, to specify an empty initial controlled
sequence. The last three constructors then call c.insert(c.end(), first, last).
All constructors also store a function object in comp. The function object comp is the argument
pred, if present. For the copy constructor, it is right.comp. Otherwise, it is Pr().
A non-empty initial controlled sequence is then ordered by calling
make_heap(c.begin(), c.end(), comp).
priority_queue::push
void push(const Ty& val);
The member function inserts an element with value val at the end of the controlled sequence,
then reorders it.
priority_queue::size
size_type size() const;
The member function returns the length of the controlled sequence.
priority_queue::size_type
typedef typename Container::size_type size_type;
The type is a synonym for Container::size_type.