Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/priority queue"

From cppreference.com
< cpp‎ | container
 
m (1 revision: import content)

Revision as of 14:44, 6 June 2011

Template:cpp/container/priority queue/sidebar

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
Template:tdcl list begin

Template:tdcl list h1 Template:tdcl list hitem Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list end

Template:cpp/container/dcl list constructorTemplate:cpp/container/dcl list destructorTemplate:cpp/container/dcl list operator=Template:cpp/container/dcl list topTemplate:cpp/container/dcl list emptyTemplate:cpp/container/dcl list sizeTemplate:cpp/container/dcl list pushTemplate:cpp/container/dcl list emplaceTemplate:cpp/container/dcl list popTemplate:cpp/container/dcl list swapTemplate:cpp/container/dcl list c

Contents

Member functions

Element access
Capacity
Modifiers

Member objects

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/priority_queue&oldid=511"