#include <stl_queue.h>
Public Member Functions | |
priority_queue (const _Compare &__x=_Compare(), const _Sequence &__s=_Sequence()) | |
Default constructor creates no elements. | |
template<typename _InputIterator> | priority_queue (_InputIterator __first, _InputIterator __last, const _Compare &__x=_Compare(), const _Sequence &__s=_Sequence()) |
Builds a queue from a range. | |
bool | empty () const |
size_type | size () const |
const_reference | top () const |
void | push (const value_type &__x) |
Add data to the queue. | |
void | pop () |
Removes first element. | |
Protected Attributes | |
_Sequence | c |
_Compare | comp |
Private Types | |
typedef _Sequence::value_type | _Sequence_value_type |
typedef _Sequence::const_reference | const_reference |
typedef _Sequence::size_type | size_type |
typedef _Sequence | container_type |
Private Member Functions | |
__glibcxx_class_requires (_Tp, _SGIAssignableConcept) __glibcxx_class_requires(_Sequence | |
_SequenceConcept | __glibcxx_class_requires (_Sequence, _RandomAccessContainerConcept) __glibcxx_class_requires2(_Tp |
Private Attributes | |
_SequenceConcept | _Sequence_value_type |
_SequenceConcept _SameTypeConcept __glibcxx_class_requires4(_Compare, bool, _Tp, _Tp, _BinaryFunctionConcept) public typedef _Sequence::referenc | reference ) |
This is not a true container, but an adaptor. It holds another container, and provides a wrapper interface to that container. The wrapper is what enforces sorting and first-in-first-out queue behavior. Very few of the standard container/sequence interface requirements are met (e.g., iterators).
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/FIFO 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 339 of file stl_queue.h.
|
Definition at line 342 of file stl_queue.h. |
|
Definition at line 352 of file stl_queue.h. |
|
Definition at line 354 of file stl_queue.h. |
|
Definition at line 353 of file stl_queue.h. |
|
Default constructor creates no elements.
Definition at line 366 of file stl_queue.h. References std::make_heap(). |
|
Builds a queue from a range.
For more information on function objects, see the documentation on functor base classes. Definition at line 387 of file stl_queue.h. References __glibcxx_requires_valid_range, and std::make_heap(). |
|
|
|
|
|
Returns true if the queue is empty. Definition at line 401 of file stl_queue.h. |
|
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 453 of file stl_queue.h. References __glibcxx_requires_nonempty, __throw_exception_again, and std::pop_heap(). |
|
Add data to the queue.
Definition at line 427 of file stl_queue.h. References __throw_exception_again, and std::push_heap(). |
|
Returns the number of elements in the queue. Definition at line 405 of file stl_queue.h. |
|
Returns a read-only (constant) reference to the data at the first element of the queue. Definition at line 412 of file stl_queue.h. References __glibcxx_requires_nonempty. |
|
Definition at line 346 of file stl_queue.h. |
|
Definition at line 358 of file stl_queue.h. |
|
Definition at line 359 of file stl_queue.h. |
|
Definition at line 347 of file stl_queue.h. |