std::flat_multiset<Key,Compare,KeyContainer>::insert_range
From cppreference.com
< cpp | container | flat multiset
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 into underlying container c
as if by:
for (const auto& e : rg) c.insert(c.end(), e);
Then, sorts the range of newly inserted elements with respect to compare
.
Merges the resulting sorted range and the sorted range of pre-existing elements into a single sorted range.
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 intoflat_multiset
from *ranges::begin(rg) - rg and *this overlap.
Information on iterator invalidation is copied from here |
Contents |