Skip to content

Search topics & cppreference

Search all study topics, concept maps, and 6,587 C++ and C reference pages.

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

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

Containers
  • C++11
  • C++23
1 min readView on cppreference
NotebookLM
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.

No iterators or references are invalidated.

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 Feature
__cpp_lib_containers_ranges 202202L (C++23) Ranges-aware construction and insertion

Example

example.cpp
#include <algorithm>
#include <cassert>
#include <list>
#include <vector>
 
int main()
{
    auto container = std::list{0, 1, 2, 3};
    const auto rg = std::vector{-3, -2, -1};
 
#if __cpp_lib_containers_ranges
    container.prepend_range(rg);
#else
    container.insert(container.begin(), rg.cbegin(), rg.cend());
#endif
    assert(std::ranges::equal(container, std::list{-3, -2, -1, 0, 1, 2, 3}));
}

See also

adds a range of elements to the end
(public member function)
inserts a range of elements
(public member function)
inserts an element to the beginning
(public member function)
constructs an element in-place at the beginning
(public member function)

Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.