std::map<Key,T,Compare,Allocator>::insert_range - cppreference.com (original) (raw)

Inserts a copy of each element in the range rg if and only if there is no element with key equivalent to the key of that element in *this.

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

No iterators or references are invalidated.

[edit] Parameters

[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

[edit] Example

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

Output:

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

[edit] See also

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