std::forward_list<T,Allocator>:: insert_range_after

Inserts copies of elements in the range rg after pos . Each iterator in the range rg is dereferenced exactly once.

If any of the following conditions is satisfied, the behavior is undefined:

• T is not EmplaceConstructible into forward_list from * ranges:: begin ( rg ) .
• pos is not in the range [ before_begin() , end() ) .
• rg and * this overlap.

No iterators or references become invalidated.

Parameters

Return value

An iterator to the last inserted element, or pos if rg is empty.

Complexity

Linear in size of rg .

Notes

Example

#include <algorithm>
#include <cassert>
#include <forward_list>
#include <iterator>
#include <vector>
int main()
{
    auto container = std::forward_list{1, 2, 3, 4};
    auto pos = std::next(container.cbegin());
    assert(*pos == 2);
    const auto rg = std::vector{-1, -2, -3};
#ifdef __cpp_lib_containers_ranges
    container.insert_range_after(pos, rg);
#else
    container.insert_after(pos, rg.cbegin(), rg.cend());
#endif
    assert(std::ranges::equal(container, std::vector{1, 2, -1, -2, -3, 3, 4}));
}

See also