(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
void replace( key_container_type&& key_cont, mapped_container_type&& mapped_cont); | (since C++23) | |
Replaces the underlying containersc. Equivalent to:
c.keys= std::move(key_cont);c.values= std::move(mapped_cont);
The following conditions must be met:
compare.Otherwise, the behavior is undefined.
Contents |
| keys_cont | - | a sorted keys container of typeKeyContainer, the contents of which will be moved into*this |
| mapped_cont | - | a container of mapped values of typeMappedContainer, the contents of which will be moved into*this |
(none)
Equals to complexity ofstd::move applied to adapted containers.
#include <algorithm>#include <cassert>#include <flat_map>#include <print>#include <vector> int main(){std::vector<int> keys{1,2,3};assert(std::ranges::is_sorted(keys));std::vector<double> values{2.2,3.3,1.1};assert(keys.size()== values.size()); std::flat_multimap<int,double> map;assert(map.empty()); map.replace(keys, values);assert(map.size()==3);assert(map.keys()==3);assert(map.values()==3);assert(keys.empty());assert(values.empty()); std::println("{}", map);}
Output:
{1: 2.2, 2: 3.3, 3: 1.1}| extracts the underlying containers (public member function)[edit] |
