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

largest, or highest priority.)
An object of class Container must supply random-access iterators and several public
members defined the same as for deque and vector (both of which are suitable candidates
for class Container). The required members are:
typedef Ty value_type;
typedef T0 size_type;
typedef T1 iterator;
Container();
template<class InIt>
Container(InIt first, InIt last);
template<class InIt>
void insert(iterator where, InIt first, InIt last);
iterator begin();
iterator end();
bool empty() const;
size_type size() const;
const value_type& front() const;
void push_back(const value_type& val);
void pop_back();
Here, T0 and T1 are unspecified types that meet the stated requirements.
priority_queue::container_type
typedef typename Container::container_type container_type;
The type is a synonym for the template parameter Container.
priority_queue::empty
bool empty() const;
The member function returns true for an empty controlled sequence.
priority_queue::pop
void pop();
The member function removes the first element of the controlled sequence, which must be
non-empty, then reorders it.