std::vector<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)

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

Member types

Member functions

vector::vector

vector::~vector

vector::operator=

vector::assign

vector::assign_range (C++23)

vector::get_allocator

Element access

vector::at

vector::operator[]

vector::front

vector::back

vector::data

Iterators

vector::beginvector::cbegin (C++11)

vector::endvector::cend (C++11)

vector::rbeginvector::crbegin (C++11)

vector::rendvector::crend (C++11)

Capacity

vector::empty

vector::size

vector::max_size

vector::reserve

vector::capacity

vector::shrink_to_fit (DR*)

Modifiers

vector::clear

vector::insert

vector::emplace (C++11)

vector::insert_range (C++23)

vector::erase

vector::push_back

vector::emplace_back (C++11)

vector::append_range (C++23)

vector::pop_back

vector::resize

vector::swap

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 > constexpr iterator insert_range( const_iterator pos, R&& rg );		(since C++23)

Inserts, in non-reversing order, copies of elements in rg before pos.

If new size() is greater than capacity() the function causes reallocation, in which case all iterators (including the end() iterator) and references to the elements are invalidated. Otherwise, only the iterators and references before the insertion point remain valid.

Each iterator in the range rg is dereferenced exactly once.

The behavior is undefined if rg overlaps with the container.

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
- T must be EmplaceConstructible into vector from *ranges::begin(rg). Also, T must be MoveInsertable into vector and T satisfies MoveConstructible, MoveAssignable, and Swappable. Otherwise, the behavior is undefined.

Return value

An iterator that points at the copy of the first element inserted into vector or at pos if rg is empty.

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 <iterator>
#include <vector>
#include <list>
 
int main()
{
    auto container = std::vector{1, 2, 3, 4};
    auto pos = std::next(container.begin(), 2);
    assert(*pos == 3);
    const auto rg = std::list{-1, -2, -3};
 
#ifdef __cpp_lib_containers_ranges
    container.insert_range(pos, rg);
#else
    container.insert(pos, rg.cbegin(), rg.cend());
#endif
    assert(std::ranges::equal(container, std::vector{1, 2, -1, -2, -3, 3, 4}));
}

See also

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