[#bsl-unordered_map-02b-insert_or_assign-068]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_map-02b.adoc[unordered_map]::insert_or_assign
:relfileprefix: ../../
:mrdocs:

`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`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class BDE_OTHER_TYPE>
xref:bsl/pair-0b.adoc[pair<iterator, bool>]
xref:bsl/unordered_map-02b/insert_or_assign-0bf.adoc[insert_or_assign](
    xref:BloombergLP/bslmf/MovableRef.adoc[BloombergLP::bslmf::MovableRef<KEY>] key,
    BDE_OTHER_TYPE&& obj);
----

[.small]#xref:bsl/unordered_map-02b/insert_or_assign-0bf.adoc[_» more..._]#

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`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class BDE_OTHER_TYPE>
xref:bsl/pair-0b.adoc[pair<iterator, bool>]
xref:bsl/unordered_map-02b/insert_or_assign-0d6.adoc[insert_or_assign](
    KEY const& key,
    BDE_OTHER_TYPE&& obj);
----

[.small]#xref:bsl/unordered_map-02b/insert_or_assign-0d6.adoc[_» more..._]#

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`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class LOOKUP_KEY,
    class BDE_OTHER_TYPE>
xref:bsl/pair-0b.adoc[pair<iterator, bool>]
xref:bsl/unordered_map-02b/insert_or_assign-0b9.adoc[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;
----

[.small]#xref:bsl/unordered_map-02b/insert_or_assign-0b9.adoc[_» more..._]#

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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class BDE_OTHER_TYPE>
xref:bsl/unordered_map-02b/iterator.adoc[iterator]
xref:bsl/unordered_map-02b/insert_or_assign-0dd.adoc[insert_or_assign](
    xref:bsl/unordered_map-02b/const_iterator.adoc[const_iterator] hint,
    xref:BloombergLP/bslmf/MovableRef.adoc[BloombergLP::bslmf::MovableRef<KEY>] key,
    BDE_OTHER_TYPE&& obj);
----

[.small]#xref:bsl/unordered_map-02b/insert_or_assign-0dd.adoc[_» more..._]#

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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class BDE_OTHER_TYPE>
xref:bsl/unordered_map-02b/iterator.adoc[iterator]
xref:bsl/unordered_map-02b/insert_or_assign-062.adoc[insert_or_assign](
    xref:bsl/unordered_map-02b/const_iterator.adoc[const_iterator] hint,
    KEY const& key,
    BDE_OTHER_TYPE&& obj);
----

[.small]#xref:bsl/unordered_map-02b/insert_or_assign-062.adoc[_» more..._]#

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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class LOOKUP_KEY,
    class BDE_OTHER_TYPE>
xref:bsl/unordered_map-02b/iterator.adoc[iterator]
xref:bsl/unordered_map-02b/insert_or_assign-0db.adoc[insert_or_assign](
    xref:bsl/unordered_map-02b/const_iterator.adoc[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;
----

[.small]#xref:bsl/unordered_map-02b/insert_or_assign-0db.adoc[_» more..._]#


[.small]#Created with https://www.mrdocs.com[MrDocs]#