std::flat_multiset<Key,Compare,KeyContainer>::insert_range

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

for (const auto& e : rg)
    c.insert(c.end(), e);

Then, sorts the range of newly inserted elements with respect to compare. 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_multiset from *ranges::begin(rg)
• rg and *this overlap.

[edit] Parameters

[edit] 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).

[edit] Notes

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

[edit] Example

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

[edit] See also