bsl::priority_queue::priority

Create a priority queue, adapting the specified container, having the specified comparator to order the priorities of elements, including those originally existed in container, and those inserted into the container from a sequence of value_type elements starting at the specified first, and ending immediately before the specified last.

Synopsis

Declared in <bslstl_priorityqueue.h>

template<class INPUT_ITERATOR>
priority_queue(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last,
    COMPARATOR const& comparator,
    CONTAINER const& container);

Created with MrDocs

bsl::priority_queue::priority_queue

Synopsis