Insert a newly constructed entry for key unless an equivalent key exists.
Declared in <bdlc_flathashtable.h>
template<class... ARGS>
bsl::pair<FlatHashTable<KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL>::iterator, bool>
try_emplace(
KEY const& key,
ARGS&&... args);
If a key equivalent to the specified key already exists in this map, return a pair containing an iterator referring to the existing item, and false. Otherwise, insert into this map a newly-created ENTRY object, constructed from key and the specified args, and return a pair containing an iterator referring to the newly-created entry and true. 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.
pair of iterator to the entry and true if inserted
| Name | Description |
|---|---|
| key | key used to find or construct the entry |
| args | arguments forwarded to construct the mapped value |