std::priority_queue<T,Container,Compare>::push_range

From cppreference.com

Compiler support
Freestanding and hosted
Language
Standard library
Standard library headers
Named requirements
Feature test macros(C++20)
Language support library
Concepts library(C++20)
Diagnostics library
Memory management library
Metaprogramming library(C++11)
General utilities library
Containers library
Iterators library
Ranges library(C++20)
Algorithms library
Strings library
Text processing library
Numerics library
Date and time library
Input/output library
Filesystem library(C++17)
Concurrency support library(C++11)
Execution control library(C++26)
Technical specifications
Symbols index
External libraries

[edit]

Containers library

node-handle (C++17)
Sequence
array (C++11)
vector
vector<bool>
inplace_vector (C++26)
hive (C++26)
deque
forward_list (C++11)
list
Associative
set
multiset
map
multimap
Unordered associative
unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)
Adaptors
stack
queue
priority_queue
flat_set (C++23)
flat_multiset (C++23)
flat_map (C++23)
flat_multimap (C++23)
Views
span (C++20)
mdspan (C++23)
Tables
Iterator invalidation
Member function table
Non-member function table

[edit]

std::priority_queue

Member functions
priority_queue::priority_queue
priority_queue::~priority_queue
priority_queue::operator=
Element access
priority_queue::top
Capacity
priority_queue::empty
priority_queue::size
Modifiers
priority_queue::push
priority_queue::push_range (C++23)
priority_queue::emplace (C++11)
priority_queue::pop
priority_queue::swap (C++11)
Non-member functions
swap(std::priority_queue) (C++11)
Helper classes
uses_allocator<std::priority_queue> (C++11)
formatter<std::priority_queue> (C++23)
Deduction guides(C++17)

[edit]

template<container-compatible-range<value_type> R> void push_range( R&& rg);		(since C++23)

Inserts a copy of each element ofrg inpriority_queue, as if by:

c.append_range(std::forward<R>(rg)) if that is a valid expression (i.e. the underlying containerc has an appropriateappend_range member function), or
ranges::copy(rg,std::back_inserter(c)) otherwise.

Then restores the heap property as if byranges::make_heap(c, comp). After the insertionranges::is_heap(c, comp) istrue.

Each iterator in the rangerg is dereferenced exactly once.

[edit]Parameters

rg - acontainer compatible range, that is, aninput_range whose elements are convertible toT

[edit]Complexity

The complexity ofc.append_range plus the complexity ofranges::make_heap(c, comp).

[edit]Notes

Feature-test macro	Value	Std	Feature
`__cpp_lib_containers_ranges`	`202202L`	(C++23)	Ranges-aware construction and insertion

[edit]Example

Run this code

#include <initializer_list>#include <queue>#include <version>#ifdef __cpp_lib_format_ranges#include <print>usingstd::println;#else#define FMT_HEADER_ONLY#include <fmt/ranges.h>using fmt::println;#endif int main(){std::priority_queue<int> adaptor;constauto rg={1,3,2,4}; #ifdef __cpp_lib_containers_ranges    adaptor.push_range(rg);#elsefor(int e: rg)        adaptor.push(e);#endif     println("{}", adaptor);}