insert_or_assign overloads
Synopses
Declared in <bslstl_unorderedmap.h>
If a key equivalent to the specified key already exists in this unordered_map, assign the specified obj to the value associated with that key, and return a pair containing an iterator referring to the existing item and false. Otherwise, insert into this map a newly‐created value_type object, constructed from (std::forward<KEY>(key), std::forward<BDE_OTHER_TYPE>(obj)...)), and return a pair containing an iterator referring to the newly‐created entry and true.
template<class BDE_OTHER_TYPE>
pair<iterator, bool>
insert_or_assign(
BloombergLP::bslmf::MovableRef<KEY> key,
BDE_OTHER_TYPE&& obj);If a key equivalent to the specified key already exists in this unordered_map, assign the specified obj to the value associated with that key, and return a pair containing an iterator referring to the existing item and false. Otherwise, insert into this map a newly‐created value_type object, constructed from (key, std::forward<BDE_OTHER_TYPE>(obj)...)), and return a pair containing an iterator referring to the newly‐created entry and true.
template<class BDE_OTHER_TYPE>
pair<iterator, bool>
insert_or_assign(
KEY const& key,
BDE_OTHER_TYPE&& obj);If a key equivalent to the specified key already exists in this unordered_map, assign the specified obj to the value associated with that key, and return a pair containing an iterator referring to the existing item and false. Otherwise, insert into this map a newly‐created value_type object, constructed from (std::forward<KEY>(key), std::forward<BDE_OTHER_TYPE>(obj)...)), and return a pair containing an iterator referring to the newly‐created entry and true.
template<
class LOOKUP_KEY,
class BDE_OTHER_TYPE>
pair<iterator, bool>
insert_or_assign(
LOOKUP_KEY&& key,
BDE_OTHER_TYPE&& obj)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
&& BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;If a key equivalent to the specified key already exists in this unordered_map, assign the specified obj to the value associated with that key, and return an iterator referring to the existing item. Otherwise, insert into this map a newly‐created value_type object, constructed from (std::forward<KEY>(key), std::forward<BDE_OTHER_TYPE>(obj)...)), and return an iterator referring to the newly‐created entry. Use the specified hint as a starting point for checking to see if the key already in the unordered_map.
template<class BDE_OTHER_TYPE>
iterator
insert_or_assign(
const_iterator hint,
BloombergLP::bslmf::MovableRef<KEY> key,
BDE_OTHER_TYPE&& obj);If a key equivalent to the specified key already exists in this unordered_map, assign the specified obj to the value associated with that key, and return an iterator referring to the existing item. Otherwise, insert into this map a newly‐created value_type object, constructed from (std::forward<KEY>(key), std::forward<BDE_OTHER_TYPE>(obj)...)), and return a pair containing an iterator referring to the newly‐created entry and true. Use the specified hint as a starting point for checking to see if the key already in the unordered_map.
template<class BDE_OTHER_TYPE>
iterator
insert_or_assign(
const_iterator hint,
KEY const& key,
BDE_OTHER_TYPE&& obj);If a key equivalent to the specified key already exists in this unordered_map, assign the specified obj to the value associated with that key, and return an iterator referring to the existing item. Otherwise, insert into this map a newly‐created value_type object, constructed from (std::forward<KEY>(key), std::forward<BDE_OTHER_TYPE>(obj)...)), and return an iterator referring to the newly‐created entry. Use the specified hint as a starting point for checking to see if the key already in the unordered_map.
template<
class LOOKUP_KEY,
class BDE_OTHER_TYPE>
iterator
insert_or_assign(
const_iterator hint,
LOOKUP_KEY&& key,
BDE_OTHER_TYPE&& obj)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
&& BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;Created with MrDocs