Namespaces
Variants
Actions

std::list<T,Allocator>::insert_range

From cppreference.com
< cpp‎ | container‎ | list

[edit template]
 
C++
 
Containers library
 
std::list
Member functions
Non-member functions
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
Deduction guides(C++17)
 
template< container-compatible-range<T> R >
iterator insert_range( const_iterator pos, R&& rg );
 (since C++23)
(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)
rg - a container compatible range, that is, an input_range whose elements are convertible to T
Type requirements
-
If T is not EmplaceConstructible into list from *ranges::begin(rg), the behavior is undefined.

[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 =