[#BloombergLP-bslstl-HashTable-06-insertIfMissingTransparent]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslstl.adoc[bslstl]::xref:BloombergLP/bslstl/HashTable-06.adoc[HashTable]::insertIfMissingTransparent
:relfileprefix: ../../../
:mrdocs:

Insert into this hash‐table a `ValueType` object created from the specified `value` if a key equivalent to that of such an object does not already exist in this hash‐table. Return the address of the (possibly newly inserted) element in this hash‐table whose key is equivalent to that of the object created from `value`. Load `true` into the specified `isInsertedFlag` if a new value was inserted, and `false` if an equivalent key was already present. If this hash‐table contains more than one element with an equivalent key, return the first such element (from the contiguous sequence of elements having a matching key). Additional buckets are allocated, as needed, to preserve the invariant `loadFactor <= maxLoadFactor`. If this function tries to allocate a number of buckets larger than can be represented by this hash‐table's `SizeType`, a `std::length_error` exception is thrown. This method requires that the `ValueType` defined in the (template parameter) type `KEY_CONFIG` be `move‐insertable` into this hash‐table (see {Requirements on `KEY_CONFIG`}) and the (template parameter) type `SOURCE_TYPE` be implicitly convertible to `ValueType`.

== Synopsis

Declared in `<bslstl_hashtable.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]*
insertIfMissingTransparent(
    bool* isInsertedFlag,
    LOOKUP_KEY&& value)
requires BloombergLP::bslmf::IsTransparentPredicate<HASHER,    LOOKUP_KEY>::value
   && BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,LOOKUP_KEY>::value;
----


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