typedef Sequence::value_type value_type

typedef Sequence::reference reference

typedef Sequence::const_reference const_reference

typedef Sequence::size_type size_type

typedef Sequence container_type

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.

Sequence c

Compare comp

typedef Sequence::value_type Sequence_value_type

A standard container automatically sorting its contents.

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.

Note: No equality/comparison operators are provided for priority_queue.

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 queue.

Default constructor creates no elements.

Definition at line 366 of file queue.

References std::make_heap().

Builds a queue from a range.

Parameters: 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.

Begins by copying s, inserting a copy of the elements from [first,last) into the copy of s, then ordering the copy according to x.

For more information on function objects, see the documentation on functor base classes.

Definition at line 387 of file queue.

References std::make_heap().

Returns true if the queue is empty.

Definition at line 401 of file queue.

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 queue.

References std::pop_heap().

Add data to the queue.

Parameters: x Data to be added.

This is a typical queue operation. The time complexity of the operation depends on the underlying sequence.

Definition at line 427 of file queue.

References std::push_heap().

Returns the number of elements in the queue.

Definition at line 405 of file queue.

Returns a read-only (constant) reference to the data at the first element of the queue.

Definition at line 412 of file queue.