std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::insert_range - cppreference.com (original) (raw)

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

If after the operation the new number of elements is greater than old max_load_factor() * bucket_count() a rehashing takes place.
If rehashing occurs (due to the insertion), all iterators are invalidated. Otherwise (no rehashing), iterators are not invalidated.

[edit] Parameters

[edit] Complexity

Average case \(\scriptsize N\)N, worst case \(\scriptsize O(N \cdot S + N)\)O(N·S+N), where \(\scriptsize S\)S is size() and \(\scriptsize N\)N is ranges::distance(rg).

[edit] Notes

[edit] Example

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

Possible output:

[edit] See also

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