[#BloombergLP-bdlc-FlatHashTable-insert-0e]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlc.adoc[bdlc]::xref:BloombergLP/bdlc/FlatHashTable.adoc[FlatHashTable]::insert
:relfileprefix: ../../../
:mrdocs:

`insert` overloads

== Synopses

Declared in `<bdlc_flathashtable.h>`

Same as the preceding overload, moving from the specified `entry`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair<FlatHashTable<KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL>::iterator, bool>]
xref:BloombergLP/bdlc/FlatHashTable/insert-00.adoc[insert](xref:BloombergLP/bslmf/MovableRef.adoc[bslmf::MovableRef<ENTRY>] entry);
----

[.small]#xref:BloombergLP/bdlc/FlatHashTable/insert-00.adoc[_» more..._]#

Insert the specified `entry` if its key is not already present.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair<FlatHashTable<KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL>::iterator, bool>]
xref:BloombergLP/bdlc/FlatHashTable/insert-08.adoc[insert](ENTRY const& entry);
----

[.small]#xref:BloombergLP/bdlc/FlatHashTable/insert-08.adoc[_» more..._]#

Insert converted copies of the objects in the `[first, last)]` range.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class INPUT_ITERATOR>
void
xref:BloombergLP/bdlc/FlatHashTable/insert-06.adoc[insert](
    INPUT_ITERATOR first,
    INPUT_ITERATOR last);
----

[.small]#xref:BloombergLP/bdlc/FlatHashTable/insert-06.adoc[_» more..._]#

== Return Value

pair of iterator to the entry and whether insertion occurred

== Parameters

[cols="1,4"]
|===
| Name| Description
| *entry*
| entry to move‐insert if its key is absent
| *first*
| beginning of the range to insert
| *last*
| end of the range to insert
|===


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