std::flat_multiset<Key,Compare,KeyContainer>::replace
From cppreference.com
< cpp | container | flat multiset
| void replace( container_type&& cont ); |
(since C++23) | |
Replaces the underlying container c. Equivalent to:
c = std::move(cont);.
The elements of cont must be sorted with respect to compare. Otherwise, the behavior is undefined.
Contents |
[edit] Parameters
| cont | - | a sorted container of type KeyContainer, the contents of which will be moved into *this
|
[edit] Return value
(none)
[edit] Complexity
Equals to complexity of std::move applied to adapted container.
[edit] Example
Run this code
#include <algorithm> #include <cassert> #include <flat_set> #include <print> #include <vector> int main() { std::vector<int> keys{1, 2, 3}; assert(std::ranges::is_sorted(keys)); std::flat_multiset<int> set; assert(set.empty()); set.replace(keys); assert(set.size() == 3); assert(keys.empty()); std::println("{}", set); // set.keys() }
Output:
[1, 2, 3]
[edit] See also
| extracts the underlying container (public member function) |
