std::inplace_vector<T,N>::assign_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::inplace_vector

Member types
Member functions
inplace_vector::inplace_vector inplace_vector::~inplace_vector    inplace_vector::operator= inplace_vector::assign inplace_vector::assign_range Size and capacity inplace_vector::empty inplace_vector::size inplace_vector::max_size inplace_vector::capacity inplace_vector::resize inplace_vector::reserve inplace_vector::shrink_to_fit Iterators inplace_vector::begininplace_vector::cbegin inplace_vector::endinplace_vector::cend inplace_vector::rbegininplace_vector::crbegin inplace_vector::rendinplace_vector::crend	Element access inplace_vector::at inplace_vector::operator[] inplace_vector::front inplace_vector::back inplace_vector::data Modifiers inplace_vector::clear inplace_vector::erase inplace_vector::swap inplace_vector::insert inplace_vector::insert_range inplace_vector::emplace inplace_vector::emplace_back inplace_vector::try_emplace_back inplace_vector::unchecked_emplace_back inplace_vector::push_back inplace_vector::try_push_back inplace_vector::unchecked_push_back inplace_vector::pop_back inplace_vector::append_range inplace_vector::try_append_range
Non-member functions
erase(std::inplace_vector)erase_if(std::inplace_vector) swap(std::inplace_vector)	operator==operator<=>

 

template<container-compatible-range<T> R > constexprvoid assign_range( R&& rg );		(since C++26)

Replaces elements in the container with a copy of each element in rg.

Each iterator in the range rg is dereferenced exactly once.

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

Parameters

rg	-	an input_range with reference type convertible to the element type of the container
Type requirements
- If std::assignable_from<T&, ranges::range_reference_t<R>> is not modeled, the program is ill-formed.
- If T is not EmplaceConstructible into inplace_vector from *ranges::begin(rg), the behavior is undefined.

Exceptions

• std::bad_alloc, if std::ranges::distance(rg)> capacity().
• Any exception thrown by initialization of inserted element.

Example

Run this code

#include <algorithm>#include <cassert>#include <initializer_list>#include <inplace_vector>#include <iostream>#include <new>   int main(){constauto source ={1, 2, 3};std::inplace_vector<int, 4> destination{4, 5}; destination.assign_range(source);assert(std::ranges::equal(destination, source));   try{constauto bad ={-1, -2, -3, -4, -5}; destination.assign_range(bad);// throws: bad.size() > destination.capacity()}catch(conststd::bad_alloc& ex){std::cout<< ex.what()<<'\n';}}

Possible output:

std::bad_alloc

See also

insert_range	inserts a range of elements (public member function)
append_range	adds a range of elements to the end (public member function)
assign	assigns values to the container (public member function)
operator=	assigns values to the container (public member function)