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

Insert the specified `entry` into this table if the key of the `entry` does not already exist in this table&semi; otherwise, this method has no effect&period; Return a `pair` whose `first` member is an iterator referring to the (possibly newly inserted) object in this table whose key is the equal to that of the object to be inserted, and whose `second` member is `true` if a new entry was inserted, and `false` if a entry having an equal key was already present&period; Bitwise movable types that are not bitwise copyable will be copied (to avoid confusion with regard to calling the `entry` destructor after this call)&period;

== Synopsis

Declared in `&lt;bdlc&lowbar;flathashtable&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair&lt;FlatHashTable&lt;KEY, ENTRY, ENTRY&lowbar;UTIL, HASH, EQUAL&gt;::iterator, bool&gt;]
insert(ENTRY const& entry);
----


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