std::flat_map<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)

Diagnostics library

Memory management library

Metaprogramming library(C++11)

General utilities library

Containers library

Iterators library

Ranges library(C++20)

Algorithms library

Strings library

Text processing library

Numerics library

Date and time library

Input/output library

Filesystem library(C++17)

Concurrency support library(C++11)

Execution control library(C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

node-handle (C++17)

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (C++26)

hive (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_map

Member types

Member functions

flat_map::flat_map flat_map::operator= Element access flat_map::at flat_map::operator[] Iterators flat_map::beginflat_map::cbegin flat_map::endflat_map::cend flat_map::rbeginflat_map::crbegin flat_map::rendflat_map::crend Lookup flat_map::count flat_map::find flat_map::contains flat_map::equal_range    flat_map::lower_bound flat_map::upper_bound Capacity flat_map::size flat_map::max_size flat_map::empty Modifiers flat_map::clear flat_map::erase flat_map::swap flat_map::emplace flat_map::extract flat_map::replace flat_map::insert flat_map::insert_range flat_map::insert_or_assign flat_map::emplace_hint flat_map::try_emplace Observers flat_map::key_comp flat_map::keys flat_map::value_comp flat_map::values

Non-member functions

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

Helper classes

uses_allocator<std::flat_map>

Tags

sorted_unique       sorted_unique_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, and
• key_cont does not contain equal elements.

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