The second template parameter defines the type of the underlying sequence/container. It defaults to std::vector, but it can be any type that supports front()
, push_back
, pop_back
, and random-access iterators, such as std::deque or an appropriate user-defined type.
The third template parameter supplies the means of making priority comparisons. It defaults to less<value_type>
but can be anything defining a strict weak ordering.
Members not found in "normal" containers are container_type
, which is a typedef for the second Sequence parameter, and push
, pop
, and top
, which are standard queue operations.
Sorting of the elements takes place as they are added to, and removed from, the priority_queue using the priority_queue's member functions. If you access the elements by other means, and change their data such that the sorting order would be different, the priority_queue will not re-sort the elements for you. (How could it know to do so?)
Definition at line 337 of file stl_queue.h.
priority_queue | ( | const _Compare & | __x = _Compare() , |
|
const _Sequence & | __s = _Sequence() | |||
) | [inline, explicit] |
Default constructor creates no elements.
Definition at line 364 of file stl_queue.h.
References std::make_heap().
priority_queue | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Compare & | __x = _Compare() , |
|||
const _Sequence & | __s = _Sequence() | |||
) | [inline] |
Builds a queue from a range.
first | An input iterator. | |
last | An input iterator. | |
x | A comparison functor describing a strict weak ordering. | |
s | An initial sequence with which to start. |
For more information on function objects, see the documentation on functor base classes.
Definition at line 385 of file stl_queue.h.
References std::make_heap().
bool empty | ( | ) | const [inline] |
Returns true if the queue is empty.
Definition at line 399 of file stl_queue.h.
void pop | ( | ) | [inline] |
Removes first element.
This is a typical queue operation. It shrinks the queue by one. The time complexity of the operation depends on the underlying sequence.
Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop() is called.
Definition at line 451 of file stl_queue.h.
References std::pop_heap().
void push | ( | const value_type & | __x | ) | [inline] |
Add data to the queue.
x | Data to be added. |
Definition at line 425 of file stl_queue.h.
References std::push_heap().
size_type size | ( | ) | const [inline] |
Returns the number of elements in the queue.
Definition at line 403 of file stl_queue.h.
const_reference top | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the first element of the queue.
Definition at line 410 of file stl_queue.h.