Create a priority queue from [first, last)] adapting container.
Declared in <bslstl_priorityqueue.h>
template<class INPUT_ITERATOR>
priority_queue(
INPUT_ITERATOR first,
INPUT_ITERATOR last,
COMPARATOR const& comparator,
CONTAINER const& container);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.
| Name | Description |
|---|---|
| first | beginning of the range of elements to insert |
| last | end of the range of elements to insert |
| comparator | comparator used to order elements |
| container | container whose contents initialize this priority queue |