Inserts a copy of each element in the rangerg if and only if there is no element with key equivalent to the key of that element in*this.

Each iterator in the rangerg is dereferenced exactly once.

If any of the following conditions is satisfied, the behavior is undefined:

• value_type is notEmplaceConstructible intoset from*ranges::begin(rg)
• rg and*this overlap.

No iterators or references are invalidated.

[edit]Parameters

[edit]Complexity

\(\scriptsize N \cdot \log(S + N)\)N·log(S+N), where\(\scriptsize S\)S issize() and\(\scriptsize N\)N isranges::distance(rg).

[edit]Notes

[edit]Example

#include <iostream>#include <set> void println(auto,constauto& container){for(constauto& elem: container)std::cout<< elem<<' ';std::cout<<'\n';} int main(){auto container=std::set{1,3,2,4};constauto rg={-1,3,-2};#ifdef __cpp_lib_containers_ranges    container.insert_range(rg);#else    container.insert(rg.begin(), rg.end());#endif    println("{}", container);}

-2 -1 1 2 3 4

[edit]See also

• In other languages

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