std::list<T,Allocator>::append_range
From cppreference.com
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::list
Non-member functions
Deduction guides (C++17)
(C++23)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++11)
(C++11)
(C++23)
(C++11)
list::append_range
(C++23)
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
template< container-compatible-range <T> R >
void append_range( R&& rg );
(since C++23) void append_range( R&& rg );
(constexpr since C++26)
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
Type requirements
[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).
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 <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.append_range(tail); #else head.insert(head.end(), tail.cbegin(), tail.cend()); #endif assert ((head == std::list {1, 2, 3, 4, -5, -6, -7})); }