std::inplace_vector<T,N>::insert_range - cppreference.com (original) (raw)
Inserts, in non-reversing order, copies of elements in rg before pos.
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 inplace_vector from *ranges::begin(rg). T is not MoveInsertable into inplace_vector. 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.
Exceptions
- std::bad_alloc, if ranges::distance(rg) + size() > capacity(). The elements of *this are not modified.
- Any exception thrown by insertion (i.e. by copy/move constructor, move/copy assignment operator of
T) or by any LegacyInputIterator operation. The elements of *this in the range[0,pos)are not modified.
[edit] Example
#include #include #include #include #include int main() { auto v = std::inplace_vector<int, 8>{0, 1, 2, 3}; auto pos = std::next(v.begin(), 2); assert(*pos == 2); const auto rg = {-1, -2, -3}; v.insert_range(pos, rg); std::println("{}", v); try { assert(v.size() + rg.size() > v.capacity()); v.insert_range(pos, rg); // throws: no space } catch(const std::bad_alloc& ex) { std::println("{}", ex.what()); } }
Possible output:
[0, 1, -1, -2, -3, 2, 3] std::bad_alloc
[edit] See also
| | inserts elements (public member function) | | ----------------------------------------------------------------------- | | | adds a range of elements to the end (public member function) | | | tries to add a range of elements to the end (public member function) |