std::deque<T,Allocator>::insert_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)

Diagnostics library

Memory management library

Metaprogramming library(C++11)

General utilities library

Containers library

Iterators library

Ranges library(C++20)

Algorithms library

Strings library

Text processing library

Numerics library

Date and time library

Input/output library

Filesystem library(C++17)

Concurrency support library(C++11)

Execution control library(C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

node-handle (C++17)

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (C++26)

hive (C++26)

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)

Tables

Iterator invalidation

Member function table

Non-member function table

 

std::deque

Member types
Member functions
deque::deque deque::~deque deque::operator= deque::assign deque::assign_range (C++23)   deque::get_allocator Element access deque::at deque::operator[] deque::front deque::back Iterators deque::begindeque::cbegin (C++11) deque::enddeque::cend (C++11) deque::rbegindeque::crbegin (C++11) deque::renddeque::crend (C++11)	Capacity deque::empty deque::size deque::max_size deque::shrink_to_fit (DR*) Modifiers deque::clear deque::insert deque::insert_range (C++23) deque::emplace deque::erase deque::push_front deque::emplace_front (C++11) deque::prepend_range (C++23) deque::pop_front deque::push_back deque::emplace_back (C++11) deque::append_range (C++23) deque::pop_back deque::resize deque::swap
Non-member functions
operator==operator<=> (C++20) swap(std::deque) erase(std::deque)erase_if(std::deque) (C++20)(C++20)	operator!=operator<operator>operator<=operator>= (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.

All iterators (including the end() iterator) are invalidated. References are invalidated too, unless pos == begin() or pos == end(), in which case they are not invalidated.

Each iterator in the range rg is dereferenced exactly once.

If rg overlaps with *this, the behavior is undefined.

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 any of the following conditions is satisfied, the behavior is undefined: T is not EmplaceConstructible into deque from *ranges::begin(rg). T is not MoveInsertable into deque. T does not satisfy the requirements of MoveConstructible, MoveAssignable, or Swappable.

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

Example

Run this code

#include <algorithm>#include <cassert>#include <iterator>#include <deque>#include <list>   int main(){auto container =std::deque{1, 2, 3, 4};auto pos =std::next(container.begin(), 2);assert(*pos ==3);constauto rg =std::list{-1, -2, -3};   #ifdef __cpp_lib_containers_ranges container.insert_range(pos, rg);#else container.insert(pos, rg.cbegin(), rg.cend());#endifassert(std::ranges::equal(container, std::deque{1, 2, -1, -2, -3, 3, 4}));}

See also

insert	inserts elements (public member function)
prepend_range (C++23)	adds a range of elements to the beginning (public member function)
append_range (C++23)	adds a range of elements to the end (public member function)