std::unordered_multiset<Key,Hash,KeyEqual,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 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).

[