std::map::insert_or_assign

C++

Language

Headers

Freestanding and hosted implementations

Named requirements

Language support library

Concepts library (C++20)

Diagnostics library

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

span (C++20)

std::map

Member functions

map::map

map::~map

map::operator=

map::get_allocator

Element access

map::at

map::operator[]

Iterators

map::beginmap::cbegin (C++11)

map::endmap::cend (C++11)

map::rbeginmap::crbegin (C++11)

map::rendmap::crend (C++11)

Capacity

map::empty

map::size

map::max_size

Modifiers

map::clear

map::insert

map::insert_or_assign (C++17)

map::emplace (C++11)

map::emplace_hint (C++11)

map::try_emplace (C++17)

map::erase

map::swap

map::extract (C++17)

map::merge (C++17)

Lookup

map::count

map::find

map::contains (C++20)

map::equal_range

map::lower_bound

map::upper_bound

Observers

map::key_comp

map::value_comp

Deduction guides(C++17)

template <class M> pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj);	(1)	(since C++17)
template <class M> pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj);	(2)	(since C++17)
template <class M> iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj);	(3)	(since C++17)
template <class M> iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj);	(4)	(since C++17)

1,3) If a key equivalent to k already exists in the container, assigns std::forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, std::forward<M>(obj))

2,4) Same as (1,3), except the mapped value is constructed from value_type(std::move(k), std::forward<M>(obj))

No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid. (since C++17)

Parameters

k	-	the key used both to look up and to insert if not found
hint	-	iterator to the position before which the new element will be inserted
obj	-	the value to insert or assign

Return value

1,2) The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated

3,4) Iterator pointing at the element that was inserted or updated

Complexity

1,2) Same as for emplace

3,4) Same as for emplace_hint

Notes

insert_or_assign returns more information than operator[] and does not require default-constructibility of the mapped type.

See also

operator[]	access or insert specified element (public member function)
at (C++11)	access specified element with bounds checking (public member function)
insert	inserts elements or nodes (since C++17) (public member function)
emplace (C++11)	constructs element in-place (public member function)