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

Inserts a copy of each element in the range rg .

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 multiset from * ranges:: begin ( rg )
• rg and * this overlap.

No iterators or references are invalidated.

Parameters

Complexity

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

Notes

Example

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

See also