std::vector<T,Allocator>::insert_range
From cppreference.com
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::vector
Non-member functions
Deduction guides (C++17)
(C++23)
(C++11)
(C++11)
(C++11)
(C++11)
(DR*)
vector::insert_range
(C++23)
(C++23)
(C++11)
(C++11)
(C++20)
(C++20)(C++20)
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
template< container-compatible-range <T> R >
constexpr iterator insert_range( const_iterator pos, R&& rg );
(since C++23)
constexpr iterator insert_range( const_iterator pos, R&& rg );
Inserts, in non-reversing order, copies of elements in rg before pos.
If after the operation the new size() is greater than old capacity() a reallocation takes place, in which case all iterators (including the end() iterator) and all 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.
If rg overlaps with *this, the behavior is undefined.
[edit] Parameters
pos
-
iterator before which the content will be inserted (pos may be the
end() iterator)
Type requirements
-If any of the following conditions is satisfied, the behavior is undefined:
-
Tis not EmplaceConstructible intovectorfrom *ranges::begin (rg). -
Tis not MoveInsertable intovector. -
Tdoes not satisfy the requirements of MoveConstructible, MoveAssignable, or Swappable.
-
[edit] Return value
An iterator to the first element inserted into *this, or pos if rg is empty.
Complexity
If one of the following conditions is satisfied, performs at most one reallocation:
-
Rmodels approximately_sized_range and ranges::distance (rg) <= ranges::reserve_hint(rg) is true. -
Rmodelsforward_rangeandRdoes not model approximately_sized_range.
Notes
| Feature-test macro | Value | Std | Feature |
|---|---|---|---|
__cpp_lib_containers_ranges |
202202L |
(C++23) | Ranges-aware construction and insertion |
[edit] 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})); }