std::list<T,Allocator>::append_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::list

Member functions

list::list
list::~list
list::operator=
list::assign
list::assign_range (C++23)
list::get_allocator
Element access
list::front
list::back
Iterators
list::beginlist::cbegin (C++11)
list::endlist::cend (C++11)
list::rbeginlist::crbegin (C++11)
list::rendlist::crend (C++11)
Capacity
list::size
list::empty
list::max_size

Modifiers
list::clear
list::insert
list::insert_range (C++23)
list::emplace (C++11)
list::erase
list::push_front
list::emplace_front (C++11)
list::prepend_range (C++23)
list::pop_front
list::push_back
list::emplace_back (C++11)
list::append_range (C++23)
list::pop_back
list::resize
list::swap
Operations
list::merge
list::splice
list::removelist::remove_if
list::reverse
list::unique
list::sort

Non-member functions

operator==operator<=> (C++20)
swap(std::list)
erase(std::list)erase_if(std::list) (C++20)(C++20)

operator!=operator<operator>operator<=operator>=

(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)

Deduction guides(C++17)

[edit]

template<container-compatible-range<T> R> void append_range( R&& rg);		(since C++23) (constexpr since C++26)

Inserts copies of elements from the rangerg beforeend(), in non-reversing order.

No iterators or references are invalidated.

Each iterator inrg is dereferenced exactly once.

[edit]Parameters

rg	-	acontainer compatible range, that is, an`input_range` whose elements are convertible to`T`
Type requirements
- If`T` is notEmplaceConstructible into`list` from*ranges::begin(rg), the behavior is undefined.

[edit]Complexity

Linear in size ofrg. The number of calls to the constructor ofT is exactly equal to thestd::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};constauto tail=std::vector{-5,-6,-7};#ifdef __cpp_lib_containers_ranges    head.append_range(tail);#else    head.insert(head.end(), tail.cbegin(), tail.cend());#endifassert((head==std::list{1,2,3,4,-5,-6,-7}));}

[edit]See also

prepend_range (C++23)	adds a range of elements to the beginning (public member function)
insert_range (C++23)	inserts a range of elements (public member function)
push_back	adds an element to the end (public member function)
emplace_back (C++11)	constructs an element in-place at the end (public member function)