bsl::priority_queue::priority_queue

Create a priority queue having the same value as the specified original object and using the specified basicAllocator to supply memory. Use a copy of the comparator from original to order elements in the priority queue. Note that this constructor is only defined if the underlying container uses allocator. Otherwise this constructor is disabled.

Synopsis

Declared in <bslstl_priorityqueue.h>

template<class ALLOCATOR>
priority_queue(
    priority_queue const& original,
    ALLOCATOR const& basicAllocator,
    ALLOCATOR* = 0)
requires bsl::uses_allocator<CONTAINER, ALLOCATOR>::value;