Create a priority queue from range with comparator and allocator.
Synopsis
Declared in <bslstl_priorityqueue.h>
template<
class t_RANGE,
class t_ALLOCATOR>
priority_queue(
std::from_range_t unused,
t_RANGE&& range,
COMPARATOR const& comparator,
t_ALLOCATOR const& allocator)
requires bsl::uses_allocator<CONTAINER,
t_ALLOCATOR>::value;
Description
Same as the preceding overload.
Parameters
Name |
Description |
unused |
tag selecting the from‐range constructor overload |
range |
input range of elements to insert |
comparator |
comparator used to order elements |
allocator |
allocator used to supply memory |
Created with MrDocs