[#bsl-unordered_map-02b-try_emplace-0f]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_map-02b.adoc[unordered_map]::try_emplace
:relfileprefix: ../../
:mrdocs:

If a key equivalent to the specified `key` already exists in this unordered_map, return an iterator referring to the existing item. Otherwise, insert into this map a newly‐created `value_type` object, constructed from `std::forward<LOOKUP_KEY>(key)` and the specified `args`, 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. This method requires that the (template parameter) types `KEY` and `VALUE` are `emplace‐constructible` from `key` and `args` respectively. For C++03, `VALUE` must also be `copy‐constructible`.

== Synopsis

Declared in `<bslstl_unorderedmap.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class LOOKUP_KEY,
    class... Args>
xref:bsl/unordered_map-02b/iterator.adoc[iterator]
try_emplace(
    xref:bsl/unordered_map-02b/const_iterator.adoc[const_iterator] hint,
    LOOKUP_KEY&& key,
    Args&&... args)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
        && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;
----

== Description

Note: implemented inline due to Sun CC compilation error.


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