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

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

for (const auto& e : rg)
{
    c.keys.insert(c.keys.end(), e.first);
    c.values.insert(c.values.end(), e.second);
}

Then, sorts the range of newly inserted elements with respect to value_comp() . Merges the resulting sorted range and the sorted range of pre-existing elements into a single sorted range.

Each iterator in the range rg is dereferenced exactly once.

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

• value_type is not EmplaceConstructible into flat_multimap from * ranges:: begin ( rg )
• rg and * this overlap.

Parameters

Complexity

\(\scriptsize S + N \cdot \log(N)\) S+N·log(N) , where \(\scriptsize S\) S is size ( ) and \(\scriptsize N\) N is ranges:: distance ( rg ) .

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, const auto& container)
{
    for (const auto& [key, value] : container)
        std::cout << '{' << key << ',' << value << '}' << ' ';
    std::cout << '\n';
}
int main()
{
    auto container = std::flat_multimap{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);
}

{-2,-22} {-1,-11} {1,11} {2,22} {3,33} {3,-33} {4,44}

See also