Create a priority queue, adapting the specified container, having the specified comparator to order elements in the priority queue, 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,
    BloombergLP::bslmf::MovableRef<CONTAINER> container);

Created with MrDocs