Difference between revisions of "cpp/container/priority queue"
From cppreference.com
m (1 revision: import content) |
(formatting) |
||
| Line 9: | Line 9: | ||
}} | }} | ||
| − | C++ Priority Queues are like queues, but the elements inside the queue are ordered by some predicate. {{todo}} | + | C++ Priority Queues are like queues, but the elements inside the queue are ordered by some predicate. |
| + | |||
| + | {{todo}} | ||
{{tdcl list begin}} | {{tdcl list begin}} | ||
Revision as of 12:55, 31 July 2011
Template:cpp/container/priority queue/sidebar
| Defined in header <queue>
|
||
| template< class T, |
||
C++ Priority Queues are like queues, but the elements inside the queue are ordered by some predicate.
| This section is incomplete |
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
