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

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Execution support library (C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (C++26)

deque

forward_list (C++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

Adaptors

stack

queue

priority_queue

flat_set (C++23)

flat_multiset (C++23)

flat_map (C++23)

flat_multimap (C++23)

Views

span (C++20)

mdspan (C++23)

Tables

Iterator invalidation

Member function table

Non-member function table

 

std::flat_multimap

Member types

Member functions

flat_multimap::flat_multimap    flat_multimap::operator= Modifiers flat_multimap::clear flat_multimap::erase flat_multimap::swap flat_multimap::extract flat_multimap::replace flat_multimap::insert flat_multimap::insert_range flat_multimap::emplace flat_multimap::emplace_hint Lookup flat_multimap::count flat_multimap::find flat_multimap::contains flat_multimap::equal_range flat_multimap::lower_bound flat_multimap::upper_bound Iterators flat_multimap::beginflat_multimap::cbegin flat_multimap::endflat_multimap::cend flat_multimap::rbeginflat_multimap::crbegin flat_multimap::rendflat_multimap::crend Capacity flat_multimap::size flat_multimap::max_size flat_multimap::empty Observers flat_multimap::key_comp flat_multimap::keys flat_multimap::value_comp flat_multimap::values

Non-member functions

swap(std::flat_multimap) erase_if(std::flat_multimap)     operator==operator<=>

Helper classes

uses_allocator<std::flat_multimap>

Tags

sorted_equivalent          sorted_equivalent_t

Deduction guides

 

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);

The following conditions must be met:

• The expression key_cont.size() == mapped_cont.size() is true,
• The elements of key_cont are sorted with respect to compare.

  Otherwise, the behavior is undefined.

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

Return value

(none)

Complexity

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

Example

Run this code

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

See also

extract

extracts the underlying containers (public member function)