std::priority_queue

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

Defined in header <queue>
template<     class T,     class Container = std::deque<T>,     class Compare = std::less<typename Container::value_type> > class priority_queue;

C++ Priority Queues are like queues, but the elements inside the queue are ordered by some predicate.

This section is incomplete

Contents 1 Member types 2 Member functions 2.1 Element access 2.2 Capacity 2.3 Modifiers 3 Member objects 4 Non-member functions

[edit] Member types

Member type	Definition
container_type	Container
value_type	Container::value_type
size_type	Container::size_type
reference	Container::reference
const_reference	Container::const_reference

[edit] Member functions

(constructor)	constructs the priority_queue (public member function)
(destructor)	destructs the priority_queue (public member function)
operator=	assigns values to the container adaptor (public member function)
Element access
top	access the top element (public member function)
Capacity
empty	checks whether the underlying container is empty (public member function)
size	returns the number of elements (public member function)
Modifiers
push	inserts element and sorts the underlying container (public member function)
emplace (C++11)	constructs element in-place and sorts the underlying container (public member function)
pop	removes the first element (public member function)
swap	swaps the contents (public member function)
Member objects
c	the underlying container (protected member object)

[edit] Non-member functions

std::swap(std::priority_queue)	specializes the std::swap() algorithm (function template)