[#BloombergLP-bslstl-HashTable-09-tryEmplace-0d3] = xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslstl.adoc[bslstl]::xref:BloombergLP/bslstl/HashTable-09.adoc[HashTable<UnorderedMapKeyConfiguration<basic_string<char> const, pair<basic_string<char> const, Json>>, TransparentHash, TransparentEqualTo, allocator<pair<basic_string<char> const, Json>>>]::tryEmplace :relfileprefix: ../../../ :mrdocs: `tryEmplace` overloads == Synopses Declared in `<bslstl_hashtable.h>` If a key equivalent to the specified `key` already exists in this hash‐table, load `false` into the specified `isInsertedFlag` and return a pointer to the existing entry. Otherwise, insert into this hash‐table a newly‐created `value_type` object, constructed from `std::forward<KEY>(key)` and the specified `args`, load `true` into `isInsertedFlag` and return a pointer to the newly created entry. Use the optionally specified `hint` as a starting place for the search for the existing key. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class... ARGS> xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]* xref:BloombergLP/bslstl/HashTable-09/tryEmplace-0d8.adoc[tryEmplace]( bool* isInsertedFlag, xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]* hint, xref:BloombergLP/bslmf/MovableRef.adoc[bslmf::MovableRef<NonConstKeyType>] key, ARGS&&... args); ---- [.small]#xref:BloombergLP/bslstl/HashTable-09/tryEmplace-0d8.adoc[_» more..._]# If a key equivalent to the specified `key` already exists in this hash‐table, load `false` into the specified `isInsertedFlag` and return a pointer to the existing entry. Otherwise, insert into this hash‐table a newly‐created `value_type` object, constructed from `key` and the specified `args`, load `true` into `isInsertedFlag` and return a pointer to the newly created entry. Use the optionally specified `hint` as a starting place for the search for the existing key. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class... ARGS> xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]* xref:BloombergLP/bslstl/HashTable-09/tryEmplace-02.adoc[tryEmplace]( bool* isInsertedFlag, xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]* hint, xref:BloombergLP/bslstl/HashTable-09/KeyType.adoc[KeyType] const& key, ARGS&&... args); ---- [.small]#xref:BloombergLP/bslstl/HashTable-09/tryEmplace-02.adoc[_» more..._]# If a key equivalent to the specified `key` already exists in this hash‐table, load `false` into the specified `isInsertedFlag` and return a pointer to the existing entry. Otherwise, insert into this hash‐table a newly‐created `value_type` object, constructed from `key` and the specified `args`, load `true` into `isInsertedFlag` and return a pointer to the newly created entry. Use the optionally specified `hint` as a starting place for the search for the existing key. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template< class LOOKUP_KEY, class... ARGS> xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]* xref:BloombergLP/bslstl/HashTable-09/tryEmplace-00.adoc[tryEmplace]( bool* isInsertedFlag, xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]* hint, LOOKUP_KEY&& key, ARGS&&... args) requires BloombergLP::bslmf::IsTransparentPredicate<HASHER, LOOKUP_KEY>::value && BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,LOOKUP_KEY>::value; ---- [.small]#xref:BloombergLP/bslstl/HashTable-09/tryEmplace-00.adoc[_» more..._]# [.small]#Created with https://www.mrdocs.com[MrDocs]#