std::list<T,Allocator>::insert_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)
list::insert_range
(C++23)
(C++11)
(C++11)
(C++23)
(C++11)
(C++23)
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
template< container-compatible-range <T> R >
iterator insert_range( const_iterator pos, R&& rg );
(since C++23) iterator insert_range( const_iterator pos, R&& rg );
(constexpr since C++26)
Inserts, in non-reversing order, copies of elements in rg before pos.
No iterators or references are invalidated.
Each iterator in the range rg is dereferenced exactly once.
If rg overlaps with *this, the behavior is undefined.
Contents
[edit] Parameters
pos
-
iterator before which the content will be inserted (pos may be the
end() iterator)
Type requirements
[edit] Return value
An iterator to the first element inserted into *this, or pos if rg is empty.
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 <algorithm> #include <cassert> #include <iterator> #include <list> #include <vector> int main() { auto container = std::list {1, 2, 3, 4}; auto pos = std::next (container.begin(), 2); assert (*pos == 3); const auto rg = std::vector {-1, -2, -3}; #ifdef __cpp_lib_containers_ranges container.insert_range(pos, rg); #else container.insert(pos, rg.cbegin(), rg.cend()); #endif assert (std::ranges::equal (container, std::list {1, 2, -1, -2, -3, 3, 4})); }