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

`insert` overloads

== Synopses

Declared in `<bdlc_flathashmap.h>`

Insert into this map an element having the value of each object in the specified `values` initializer list if a value with an equivalent key is not already contained in this map. This method requires that the (template parameter) type `KEY` be copy‐insertable (see {Requirements on `KEY`, `HASH`, and `EQUAL`}).


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:BloombergLP/bdlc/FlatHashMap/insert-0a.adoc[insert](bsl::initializer_list<value_type> values);
----

[.small]#xref:BloombergLP/bdlc/FlatHashMap/insert-0a.adoc[_» more..._]#

Insert the specified `value` into this map if the key of `value` does not already exist in this map; otherwise, this method has no effect. Return a `pair` whose `first` member is an iterator referring to the (possibly newly inserted) modifiable element in this map whose key is equivalent to that of the element to be inserted, and whose `second` member is `true` if a new element was inserted, and `false` if an element with an equivalent key was already present.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class VALUE_TYPE>
xref:bsl/pair-0b.adoc[bsl::pair<iterator, bool>]
xref:BloombergLP/bdlc/FlatHashMap/insert-00.adoc[insert](VALUE_TYPE&& value)
requires bsl::is_constructible<value_type,
                                                  VALUE_TYPE&&>::value;
----

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

Insert into this map the value of each element in the input iterator range specified by `first` through `last` (including `first`, excluding `last`). 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`. Note that if the key of a member of the input sequence is equivalent to the key of an earlier member, the later member will not be inserted.


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

[.small]#xref:BloombergLP/bdlc/FlatHashMap/insert-0f.adoc[_» more..._]#

Insert the specified `value` into this map if the key of `value` does not already exist in this map; otherwise, this method has no effect. Return an iterator referring to the (possibly newly inserted) modifiable element in this map whose key is equivalent to that of the element to be inserted. The supplied `const_iterator` is ignored.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class VALUE_TYPE>
xref:BloombergLP/bdlc/FlatHashMap/iterator.adoc[iterator]
xref:BloombergLP/bdlc/FlatHashMap/insert-03.adoc[insert](
    xref:BloombergLP/bdlc/FlatHashMap/const_iterator.adoc[const_iterator],
    VALUE_TYPE&& value)
requires bsl::is_constructible<value_type,
                                                  VALUE_TYPE&&>::value;
----

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


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