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

`insert` overloads

== Synopses

Declared in `<bdlc_flathashset.h>`

Insert the specified `value` into this set if not already present.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair<const_iterator, bool>]
xref:BloombergLP/bdlc/FlatHashSet/insert-0ee.adoc[insert](xref:BloombergLP/bslmf/MovableRef.adoc[bslmf::MovableRef<KEY>] value);
----

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

Insert each element from the specified initializer list.


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

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

Insert the specified `value` into this set if not already present.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair<const_iterator, bool>]
xref:BloombergLP/bdlc/FlatHashSet/insert-068.adoc[insert](KEY const& value);
----

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

Insert the specified `key` into this set if not already present.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/pair-0b.adoc[bsl::pair<iterator, bool>]
xref:BloombergLP/bdlc/FlatHashSet/insert-0e3.adoc[insert](LOOKUP_KEY&& key)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
         && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;
----

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

Insert the specified `value`, ignoring the insertion hint.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:BloombergLP/bdlc/FlatHashSet/const_iterator.adoc[const_iterator]
xref:BloombergLP/bdlc/FlatHashSet/insert-06a.adoc[insert](
    xref:BloombergLP/bdlc/FlatHashSet/const_iterator.adoc[const_iterator] hint,
    xref:BloombergLP/bslmf/MovableRef.adoc[bslmf::MovableRef<KEY>] value);
----

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

Insert the specified `value`, ignoring the insertion hint.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:BloombergLP/bdlc/FlatHashSet/const_iterator.adoc[const_iterator]
xref:BloombergLP/bdlc/FlatHashSet/insert-02.adoc[insert](
    xref:BloombergLP/bdlc/FlatHashSet/const_iterator.adoc[const_iterator] hint,
    KEY const& value);
----

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

Insert each element from the specified iterator range.


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

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

Insert the specified `key`, ignoring the insertion hint.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:BloombergLP/bdlc/FlatHashSet/iterator.adoc[iterator]
xref:BloombergLP/bdlc/FlatHashSet/insert-08.adoc[insert](
    xref:BloombergLP/bdlc/FlatHashSet/const_iterator.adoc[const_iterator] hint,
    LOOKUP_KEY&& key)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
         && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value
         && bsl::is_convertible<LOOKUP_KEY&&, const_iterator>::value == false
         && bsl::is_convertible<const_iterator, LOOKUP_KEY&&>::value == false;
----

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

== Return Value

* pair of iterator to the element and whether insertion occurred
* iterator to the existing or newly inserted element

== Parameters

[cols="1,4"]
|===
| Name| Description
| *value*
| element to insert
| *values*
| initializer list of elements to insert
| *key*
| key to insert
| *hint*
| ignored hint iterator
| *first*
| beginning of the input range
| *last*
| end of the input range (exclusive)
|===


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