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

Create an object for each iterator in the range starting at the specified `first` iterator and ending immediately before the specified `last` iterator, by converting from the object referred to by each iterator. Insert into this table each such object whose key is not already contained. The (template parameter) type `INPUT_ITERATOR` shall meet the requirements of an input iterator defined in the C++11 standard [24.2.3]providing access to values of a type convertible to `ENTRY`. The behavior is undefined unless `first` and `last` refer to a sequence of valid values where `first` is at a position at or before `last`.

== Synopsis

Declared in `<bdlc_flathashtable.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class INPUT_ITERATOR>
void
insert(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last);
----


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