These members are not defined in the Assignable and Default Constructible requirements, but are specific to priority_queue.
| Member |
Description |
value_type |
The type of object stored in the priority_queue. This is the same as T and Sequence::value_type. |
size_type |
An unsigned integral type. This is the same as Sequence::size_type. |
priority_queue(const Compare& comp) |
The constructor. Creates an empty priority_queue, using comp as the comparison function. The default constructor uses Compare() as the comparison function. |
priority_queue(const value_type* first, const value_type* last) |
The constructor. Creates a priority_queue initialized to contain the elements in the range [first, last), and using Compare() as the comparison function. |
priority_queue(const value_type* first, const value_type* last, const Compare& comp) |
The constructor. Creates a priority_queue initialized to contain the elements in the range [first, last), and using comp as the comparison function. |
bool empty() const |
Returns true if the priority_queue contains no elements, and false otherwise. S.empty() is equivalent to S.size() == 0. |
size_type size() const |
Returns the number of elements contained in the priority_queue. |
const value_type& top() const |
Returns a const reference to the element at the top of the priority_queue. The element at the top is guaranteed to be the largest element in the priority queue, as determined by the comparison function Compare. That is, for every other element x in the priority_queue, Compare(Q.top(), x) is false. Precondition: empty() is false. |
void push(const value_type& x) |
Inserts x into the priority_queue. Postcondition: size() will be incremented by 1. |
void pop() |
Removes the element at the top of the priority_queue, that is, the largest element in the priority_queue. [3] Precondition: empty() is false. Postcondition: size() will be decremented by 1. |
