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

template< container-compatible-range<value_type> R > void insert_range( R&& rg );		(since C++23)

Inserts a copy of each element of 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.

Parameters

rg	-	a container compatible range, that is, an `input_range` whose elements are convertible to `T`.
Type requirements
- `value_type` must be EmplaceConstructible into `set` from *ranges::begin(rg). Otherwise, the behavior is undefined.

Return value

(none)

Complexity

N·log(a.size() + N), where N has the value ranges::distance(rg)

Notes

Feature-test macro	Value	Std	Comment
`__cpp_lib_containers_ranges`	202202L	(C++23)	Ranges-aware construction and insertion

Example

Run this code

#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);
}

Output:

-2 -1 1 2 3 4

Compiler support
Freestanding and hosted
Language
Standard library
Standard library headers
Named requirements
Feature test macros (C++20)
Language support library
Concepts library (C++20)
Metaprogramming library (C++11)
Diagnostics library
General utilities library
Strings library
Containers library
Iterators library
Ranges library (C++20)
Algorithms library
Numerics library
Localizations library
Input/output library
Filesystem library (C++17)
Regular expressions library (C++11)
Concurrency support library (C++11)
Technical specifications
Symbols index
External libraries

Sequence
array (C++11)
vector
vector<bool>
deque
forward_list (C++11)
list
Associative
set
multiset
map
multimap
Unordered associative
unordered_set (C++11)
unordered_multiset (C++11)
unordered_map (C++11)
unordered_multimap (C++11)
Adaptors
stack
queue
priority_queue
flat_set (C++23)
flat_multiset (C++23)
flat_map (C++23)
flat_multimap (C++23)
Views
span (C++20)
mdspan (C++23)
Iterator invalidation
Member function table
Non-member function table

Member functions
set::set
set::~set
set::operator=
set::get_allocator
Iterators
set::beginset::cbegin (C++11)
set::endset::cend (C++11)
set::rbeginset::crbegin (C++11)
set::rendset::crend (C++11)
Capacity
set::empty
set::size
set::max_size
Modifiers
set::clear
set::insert
set::insert_range (C++23)
set::emplace (C++11)
set::emplace_hint (C++11)
set::erase
set::swap
set::extract (C++17)
set::merge (C++17)
Lookup
set::count
set::find
set::contains (C++20)
set::equal_range
set::lower_bound
set::upper_bound
Observers
set::key_comp
set::value_comp
Non-member functions
std::swap
erase_if (C++20)
operator==operator!=operator<operator>operator<=operator>=operator<=> (until C++20)(until C++20)(until C++20)(until C++20)(until C++20)(C++20)
Deduction guides(C++17)