[#bsl-unordered_set-0d2d-insert-0c]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_set-0d2d.adoc[unordered_set]::insert
:relfileprefix: ../../
:mrdocs:

`insert` overloads

== Synopses

Declared in `<bslstl_unorderedset.h>`

Insert `value` if its key is missing.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair<unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::iterator, bool>]
xref:bsl/unordered_set-0d2d/insert-08.adoc[insert](xref:BloombergLP/bslmf/MovableRef.adoc[BloombergLP::bslmf::MovableRef<value_type>] value);
----

[.small]#xref:bsl/unordered_set-0d2d/insert-08.adoc[_» more..._]#

Insert each value from `values` if its key is missing.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:bsl/unordered_set-0d2d/insert-0e.adoc[insert](std::initializer_list<KEY> values);
----

[.small]#xref:bsl/unordered_set-0d2d/insert-0e.adoc[_» more..._]#

Insert `value` if its key is missing.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair<unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::iterator, bool>]
xref:bsl/unordered_set-0d2d/insert-01.adoc[insert](xref:bsl/unordered_set-0d2d/value_type.adoc[value_type] const& value);
----

[.small]#xref:bsl/unordered_set-0d2d/insert-01.adoc[_» more..._]#

Insert `value` if its key is missing.


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

[.small]#xref:bsl/unordered_set-0d2d/insert-074c.adoc[_» more..._]#

Insert `value` using `hint` if its key is missing.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/unordered_set-0d2d/iterator.adoc[unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::iterator]
xref:bsl/unordered_set-0d2d/insert-0740.adoc[insert](
    xref:bsl/unordered_set-0d2d/const_iterator.adoc[const_iterator] hint,
    xref:BloombergLP/bslmf/MovableRef.adoc[BloombergLP::bslmf::MovableRef<value_type>] value);
----

[.small]#xref:bsl/unordered_set-0d2d/insert-0740.adoc[_» more..._]#

Insert `value` using `hint` if its key is missing.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/unordered_set-0d2d/iterator.adoc[unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::iterator]
xref:bsl/unordered_set-0d2d/insert-06.adoc[insert](
    xref:bsl/unordered_set-0d2d/const_iterator.adoc[const_iterator] hint,
    xref:bsl/unordered_set-0d2d/value_type.adoc[value_type] const& value);
----

[.small]#xref:bsl/unordered_set-0d2d/insert-06.adoc[_» more..._]#

Insert `value` if its key is missing.


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

[.small]#xref:bsl/unordered_set-0d2d/insert-0f.adoc[_» more..._]#

Insert `value` using `hint` if its key is missing.


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

[.small]#xref:bsl/unordered_set-0d2d/insert-03.adoc[_» more..._]#

== Return Value

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

== Parameters

[cols="1,4"]
|===
| Name| Description
| *value*
| value to insert
| *values*
| initializer list of values
| *hint*
| position hint for insertion
| *first*
| beginning of the range of values to insert
| *last*
| end of the range of values to insert (one past last)
|===


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