Create a priority queue from the range [first, last)].
Declared in <bslstl_priorityqueue.h>
template<class INPUT_ITERATOR>
priority_queue(
INPUT_ITERATOR first,
INPUT_ITERATOR last);Create a priority queue, adapting a default-constructed container of the (template parameter) type CONTAINER, and inserting into the container a sequence of value_type elements that starts at the specified first and ends immediately before the specified last. Use a default-constructed comparator of the (template parameter) type COMPARATOR to order elements in the priority queue.
| Name | Description |
|---|---|
| first | beginning of the range of elements to insert |
| last | end of the range of elements to insert |