std::priority_queue<T,Container,Compare>::pop
void pop(); |
Removes the top element from the priority queue. Effectively calls std::pop_heap(c.begin(), c.end(), comp); c.pop_back();
Parameters
(none).
Return value
(none).
Complexity
Logarithmic number of comparisons plus the complexity of Container::pop_back.
See also
|
(C++11) | constructs element in-place and sorts the underlying container (public member function) |
| inserts element and sorts the underlying container (public member function) |
|
| accesses the top element (public member function) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/priority_queue/pop