Difference between revisions of "cpp/container/priority queue"
From cppreference.com
(Grammar) |
(+uses_allocator) |
||
Line 48: | Line 48: | ||
{{dcl list begin}} | {{dcl list begin}} | ||
{{dcl list template | cpp/container/dcl list std_swap | priority_queue}} | {{dcl list template | cpp/container/dcl list std_swap | priority_queue}} | ||
+ | {{dcl list end}} | ||
+ | |||
+ | ===Helper classes=== | ||
+ | {{dcl list begin}} | ||
+ | {{dcl list template | cpp/container/dcl list uses_allocator | priority_queue}} | ||
{{dcl list end}} | {{dcl list end}} |
Revision as of 08:32, 1 November 2011
Template:cpp/container/priority queue/sidebar
Defined in header <queue>
|
||
template< class T, |
||
Priority queue is a container that allows for 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.
Contents |
Member types
Template:tdcl list begin 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