std::priority_queue::pop

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::priority_queue
Member functions priority_queue::priority_queue priority_queue::~priority_queue priority_queue::operator= Element access priority_queue::top Capacity priority_queue::empty priority_queue::size Modifiers priority_queue::push priority_queue::emplace priority_queue::pop priority_queue::swap

void pop();

Removes the top element from the priority queue. Effectively calls std::pop_heap(c.begin(), c.end(), comp); c.pop_back();

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

(none)

[edit] Return value

(none)

[edit] Complexity

This section is incomplete

[edit] See also

emplace (C++11)	constructs element in-place and sorts the underlying container (public member function)
push	inserts element and sorts the underlying container (public member function)