std::priority_queue (3) - Linux Man Pages
Defined in header <queue>
class Container = std::vector<T>,
class Compare = std::less<typename Container::value_type>
> class priority_queue;
A priority queue is a container adaptor that provides constant time lookup of the largest (by default) element, at the expense of logarithmic insertion and extraction.
A user-provided Compare can be supplied to change the ordering, e.g. using std::greater<T> would cause the smallest element to appear as the top().
Working with a priority_queue is similar to managing a heap in some random access container, with the benefit of not being able to accidentally invalidate the heap.
T - The behavior is undefined if T is not the same type as Container::value_type.
Container - * push_back()
Compare - A Compare type providing a strict weak ordering.
Note that the Compare parameter is defined such that it returns true if its first argument comes before its second argument in a weak ordering. But because the priority queue outputs largest elements first, the elements that "come before" are actually output last. That is, the front of the queue contains the "last" element according to the weak ordering imposed by Compare.
Member type Definition
value_compare (C++17) Compare
constructor (public member function)
destructor (public member function)
operator= (public member function)
top (public member function)
empty (public member function)
size (public member function)
push (public member function)
emplace constructs element in-place and sorts the underlying container
pop (public member function)
swap (public member function)