std::set<Key,Compare,Allocator>:: insert_range

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

Each iterator in the range rg is dereferenced exactly once. The behavior is undefined if rg overlaps with the container.

No iterators or references are invalidated.

Parameters

Return value

(none)

Complexity

N·log ( a. size ( ) + N ) , where N is ranges:: distance ( rg ) .

Notes

Example

#include <iostream>
#include <set>
 
void println(auto, auto const& container)
{
    for (const auto& elem : container)
        std::cout << elem << ' ';
    std::cout << '\n';
}
 
int main()
{
    auto container = std::set{1, 3, 2, 4};
    const auto 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

See also