|
|
| priority_queue () |
| | Default constructor.
|
| |
|
| priority_queue (const priority_queue &rhs) |
| | Copy constructor.
|
| |
| template<typename TIterator > |
| | priority_queue (TIterator first, TIterator last) |
| |
|
| ~priority_queue () |
| | Destructor.
|
| |
|
priority_queue & | operator= (const priority_queue &rhs) |
| | Assignment operator.
|
| |
| reference | top () |
| |
| const_reference | top () const |
| |
| void | push (const_reference value) |
| |
| void | emplace () |
| |
| template<typename T1 > |
| void | emplace (const T1 &value1) |
| |
| template<typename T1 , typename T2 > |
| void | emplace (const T1 &value1, const T2 &value2) |
| |
| template<typename T1 , typename T2 , typename T3 > |
| void | emplace (const T1 &value1, const T2 &value2, const T3 &value3) |
| |
| template<typename T1 , typename T2 , typename T3 , typename T4 > |
| void | emplace (const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4) |
| |
| template<typename TIterator > |
| void | assign (TIterator first, TIterator last) |
| |
| void | pop () |
| |
| void | pop_into (reference destination) |
| |
|
size_type | size () const |
| | Returns the current number of items in the priority queue.
|
| |
|
size_type | max_size () const |
| | Returns the maximum number of items that can be queued.
|
| |
| bool | empty () const |
| |
| bool | full () const |
| |
| size_type | available () const |
| |
|
void | clear () |
| | Clears the queue to the empty state.
|
| |
|
ipriority_queue & | operator= (const ipriority_queue &rhs) |
| | Assignment operator.
|
| |
A fixed capacity priority queue. This queue does not support concurrent access by different threads.
- Template Parameters
-
| T | The type this queue should support. |
| SIZE | The maximum capacity of the queue. |