std::multiset<Key,Compare,Allocator>::insert_range
From cppreference.com
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:
-
value_typeis not EmplaceConstructible intomultisetfrom *ranges::begin(rg) - rg and *this overlap.
No iterators or references are invalidated.
Contents |
[edit] Parameters
| rg | - | a container compatible range, that is, an input_range whose elements are convertible to T
|
[edit] Complexity
N·log(S+N), where S is size() and 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 <set> void println(auto, const auto& container) { for (const auto& elem : container) std::cout << elem << ' '; std::cout << '\n'; } int main() { auto container = std::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); }
Output:
-2 -1 1 2 3 3 4
[edit] See also
| inserts elements or nodes(since C++17) (public member function) |
