Namespaces
Variants

std::queue<T,Container>:: push_range

From cppreference.net

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

Inserts a copy of each element of rg in queue , as if by:


Each iterator in the range rg is dereferenced exactly once.

Contents

Parameters

rg - a container compatible range , that is, an input_range whose elements are convertible to T

Complexity

Identical to the complexity of c. append_range or ranges:: copy ( rg, std:: back_inserter ( c ) ) (depending on what function is used internally).

Notes

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

Example

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

Output: 

[1, 3, 2, 4]

See also

inserts element at the end
(public member function)