Appends copies of initial elements inrg beforeend(), until all elements are inserted or the internal storage is exhausted (i.e.size()== capacity() istrue).

All iterators and references remain valid. Theend() iterator is invalidated.

Each iterator inrg is dereferenced at most once.

[edit]Parameters

[edit]Return value

An iterator pointing to the first element ofrg that was not inserted into*this, orranges::end(rg) if no such element exists.

[edit]Complexity

Linear in the number of elements inserted.

[edit]Exceptions

Any exception thrown by initialization of inserted element.

inplace_vector provides thebasic exception safety guarantee, i.e., all elements of the container before the call are preserved, and all already inserted elements (before the exception, if any) are also preserved.

[edit]Notes

[edit]Example

#include <cassert>#include <initializer_list>#include <inplace_vector> int main(){using I=std::inplace_vector<int,8>;auto nums= I{1,2,3};constauto rg={-1,-2,-3}; auto it= nums.try_append_range(rg);assert(nums.size()==6);assert((nums== I{1,2,3,-1,-2,-3}));assert(it== rg.end());     it= nums.try_append_range(rg);assert(nums.size()==8);assert((nums== I{1,2,3,-1,-2,-3,-1,-2}));assert(it== rg.begin()+2);}

[edit]See also

• In other languages

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