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

 

C++

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)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (C++11)

vector

vector<bool>

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)

Iterator invalidation

Member function table

Non-member function table

 

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::empty

list::size

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

std::swap

eraseerase_if (C++20)(C++20)

operator==operator!=operator<operator>operator<=operator>=operator<=> (until C++20)(until C++20)(until C++20)(until C++20)(until C++20)(C++20)

Deduction guides(C++17)

 

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 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 <list>
 
int main()
{
    auto data = std::list{0, 1, 2, 3};
    const auto prefix = {-3, -2, -1};
 
#if __cpp_lib_containers_ranges
    data.prepend_range(prefix);
#else
    data.insert(data.begin(), prefix.begin(), prefix.end());
#endif
    assert(std::ranges::equal(data, std::list{-3, -2, -1, 0, 1, 2, 3}));
}

See also

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