# std::forward_list<T,Allocator>::prepend_range

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

template< container-compatible-range<T> R > void prepend_range( R&& rg ); |  | (since C++23)

Inserts, in non-reversing order, copies of elements in rg before begin(). Each iterator in the range rg is dereferenced exactly once.

### Parameters

rg | - | a container compatible range, that is, an `input_range` whose elements are convertible to `T`.
Type requirements
- `T` must be EmplaceConstructible into `forward_list` from *ranges::begin(rg). Otherwise, the behavior is undefined.

### Return value

(none)

### Complexity

Linear in size of rg.

### Notes

Feature-test macro | Value | Std | Comment
--- | --- | --- | ---
`__cpp_lib_containers_ranges` | 202202L | (C++23) | Ranges-aware construction and insertion

### Example

Run this code

    #include <algorithm>
    #include <cassert>
    #include <forward_list>

    int main()
    {
        auto data = std::forward_list{0, 1, 2, 3};
        const auto prefix = {-3, -2, -1};

    #if __cpp_lib_containers_ranges
        data.prepend_range(prefix);
    #else
        data.insert_after(data.before_begin(), prefix.begin(), prefix.end());
    #endif
        assert(std::ranges::equal(data, std::forward_list{-3, -2, -1, 0, 1, 2, 3}));
    }

### See also

insert_range (C++23) | inserts a range of elements (public member function)
insert_range_after (C++23) | inserts a range of elements after an element (public member function)
push_front (C++11) | inserts an element to the beginning (public member function)
emplace_front (C++11) | constructs an element in-place at the beginning (public member function)

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/forward_list/prepend_range&oldid=155597"