Inserts, in non-reversing order, copies of elements inrg beforepos.

Each iterator in the rangerg is dereferenced exactly once.

Ifrg overlaps with*this, the behavior is undefined.

[edit]Parameters

[edit]Return value

An iterator to the first element inserted into*this, orpos ifrg is empty.

Exceptions

• std::bad_alloc, ifranges::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 ofT) or by anyLegacyInputIterator operation. The elements of*this in the range[​0​, pos) are not modified.

[edit]Example

#include <cassert>#include <inplace_vector>#include <iterator>#include <new>#include <print> int main(){auto v=std::inplace_vector<int,8>{0,1,2,3};auto pos=std::next(v.begin(),2);assert(*pos==2);constauto 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(conststd::bad_alloc& ex){std::println("{}", ex.what());}}

[0, 1, -1, -2, -3, 2, 3]std::bad_alloc

[edit]See also

• In other languages

• Deutsch
• Español
• Français
• Italiano
• 日本語
• Português
• Русский
• 中文