std::map<Key,T,Compare,Allocator>::insert_range

Since C++23

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.

# Declarations

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

(since C++23)

# Parameters

rg: a container compatible range, that is, an input_range whose elements are convertible to T

# Return value

(none)

# Notes

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

# Example

#include <iostream>
#include <map>
#include <utility>
 
void println(auto, auto const& container)
{
    for (const auto& [key, value] : container)
        std::cout << '{' << key << ',' << value << '}' << ' ';
    std::cout << '\n';
}
 
int main()
{
    auto container = std::map{std::pair{1, 11}, {3, 33}, {2, 22}, {4, 44}};
    const auto rg = {std::pair{-1, -11}, {3, -33}, {-2, -22}};
#ifdef __cpp_lib_containers_ranges
    container.insert_range(rg);
#else
    container.insert(rg.begin(), rg.end());
#endif
    println("{}", container);
}

# See also

insert