Create a priority queue from [first, last)] by moving from container.

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);

Description

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.

Parameters

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 to move from

Created with MrDocs