< cpp‎ | container‎ | deque
template< container-compatible-range<T> R >
void assign_range( R&& rg );
(since C++23)

Replaces elements in the container with a copy of each element in rg.

All iterators (including the end() iterator) and all references to the elements are invalidated.

Each iterator in the range rg is dereferenced exactly once.

The behavior is undefined if rg overlaps with the container.


[edit] Parameters

rg - an input_range with reference type convertible to the element type of the container
Type requirements
std::assignable_from<T&, ranges::range_reference_t<R>> must be modeled. Otherwise, the program is ill-formed.
T must be EmplaceConstructible into the container from *ranges::begin(rg). Otherwise, the behavior is undefined.

[edit] Return value


[edit] Notes

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

[edit] Example

#include <algorithm>
#include <cassert>
#include <deque>
#include <list>
int main()
    const auto source = std::list{2, 7, 1};
    auto destination = std::deque{3, 1, 4};
#ifdef __cpp_lib_containers_ranges
    destination.assign(source.cbegin(), source.cend());
    assert(std::ranges::equal(source, destination));

[edit] See also

inserts a range of elements
(public member function)
adds a range of elements to the beginning
(public member function)
adds a range of elements to the end
(public member function)
assigns values to the container
(public member function)