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

Inserts copies of elements from the range rg before end(), in non-reversing order.

No iterators or references are invalidated.

Each iterator in rg is dereferenced exactly once.


[edit] Parameters

rg - a container compatible range, that is, an input_range whose elements are convertible to T
Type requirements
T must be EmplaceConstructible into list from *ranges::begin(rg). Otherwise, the behavior is undefined.

[edit] Return value


[edit] Complexity

Linear in size of rg. The number of calls to the constructor of T is exactly equal to the std::ranges::size(rg)).

[edit] Exceptions

If an exception is thrown for any reason, this function has no effect (strong exception safety guarantee).

[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 <list>
#include <vector>
int main()
    auto head = std::list{1, 2, 3, 4};
    const auto tail = std::vector{-5, -6, -7};
#ifdef __cpp_lib_containers_ranges
    head.insert(head.end(), tail.cbegin(), tail.cend());
    assert(std::ranges::equal(head, std::list{1, 2, 3, 4, -5, -6, -7}));

[edit] See also

adds a range of elements to the beginning
(public member function)
inserts a range of elements
(public member function)
adds an element to the end
(public member function)
constructs an element in-place at the end
(public member function)