std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>::insert_range

Inserts a copy of each element in the range rg into underlying containers c as if by:

# Declarations

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

(since C++23)

# Parameters

# Return value

(none)

# Notes

Since insert_range performs an in-place merge operation, that may allocate memory.

# Example

#include <iostream>
#include <flat_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::flat_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