Namespaces
Variants
Actions

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

From cppreference.com
< cpp‎ | container‎ | multimap
 
 
 
std::multimap
 
template< container-compatible-range <value_type> R >
void insert_range( R&& rg );
(since C++23)
(constexpr since C++26)

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:

No iterators or references are invalidated.

[edit] Parameters

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

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

[edit] Notes

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

[edit] Example

Run this code
#include <iostream>
#include <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::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);
}

Output:

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

[edit] See also

inserts elements or nodes(since C++17)
(public member function) [edit]

AltStyle によって変換されたページ (->オリジナル) /