Namespaces
Variants
Views
Actions

std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>::replace

From cppreference.com
 
 
 
 
void replace( key_container_type&& key_cont, mapped_container_type&& mapped_cont );
(since C++23)

Replaces the underlying containers c. Equivalent to:

c.keys = std::move(key_cont);
c.values = std::move(mapped_cont);

Before the call to this function:

  • the expression key_cont.size() == mapped_cont.size() must be true, and
  • the elements of key_cont must be sorted with respect to compare.

Otherwise, the behavior is undefined.

Contents

[edit] Parameters

keys_cont - a sorted keys container of type KeyContainer, the contents of which will be moved into *this
mapped_cont - a container of mapped values of type MappedContainer, the contents of which will be moved into *this

[edit] Return value

(none)

[edit] Complexity

Equals to complexity of std::move applied to adapted containers.

[edit] Example

#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}

[edit] See also

extracts the underlying containers
(public member function) [edit]