std::deque<T,Allocator>::insert_range - cppreference.com (original) (raw)
| | (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.
[edit] 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. |
[edit] 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 |
[edit] Example
#include #include #include #include #include int main() { auto container = std::deque{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::deque{1, 2, -1, -2, -3, 3, 4})); }
[edit] See also
| | inserts elements (public member function) | | --------------------------------------------------------------------- | | | adds a range of elements to the beginning (public member function) | | | adds a range of elements to the end (public member function) |