< cpp‎ | container
Revision as of 12:37, 21 January 2014 by Nate (Talk | contribs)

Defined in header <queue>

    class T,
    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 maximum (or minimum, depending on Compare) extraction at the expense of logarithmic insertion.

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.


Member types

Member type Definition
container_type Container [edit]
value_type Container::value_type [edit]
size_type Container::size_type [edit]
reference Container::reference [edit]
const_reference Container::const_reference [edit]

Member functions

constructs the priority_queue
(public member function) [edit]
destructs the priority_queue
(public member function) [edit]
assigns values to the container adaptor
(public member function) [edit]
Element access
accesses the top element
(public member function) [edit]
checks whether the underlying container is empty
(public member function) [edit]
returns the number of elements
(public member function) [edit]
inserts element and sorts the underlying container
(public member function) [edit]
constructs element in-place and sorts the underlying container
(public member function) [edit]
removes the top element
(public member function) [edit]
swaps the contents
(public member function) [edit]

Member objects

Container c
the underlying container
(protected member object) [edit]
Compare comp
the comparison function object
(protected member object)

Non-member functions

specializes the std::swap algorithm
(function template) [edit]

Helper classes

specializes the std::uses_allocator type trait
(function template) [edit]