[#bsl-unordered_multiset-06c-insert-09]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_multiset-06c.adoc[unordered_multiset]::insert
:relfileprefix: ../../
:mrdocs:

`insert` overloads

== Synopses

Declared in `<bslstl_unorderedmultiset.h>`

Insert the specified `value` into this unordered multiset. If one or more keys equivalent to `value` already exist in this unordered multiset, this method is guaranteed to insert `value` in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted `value_type` object that is equivalent to `value`. This method requires that the (template parameter) type `KEY` be `move‐insertable` into this unordered multiset (see {Requirements on `KEY`}).


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

[.small]#xref:bsl/unordered_multiset-06c/insert-08.adoc[_» more..._]#

Insert into this unordered multiset the value of each `value_type` object in the specified `values` initializer list. This method requires that the (template parameter) type `KEY` be `copy‐insertable` into this unordered multiset (see {Requirements on `KEY`}).


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

[.small]#xref:bsl/unordered_multiset-06c/insert-0ef.adoc[_» more..._]#

Insert the specified `value` into this unordered multiset. If one or more keys equivalent to `value` already exist in this unordered multiset, this method is guaranteed to insert `value` in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted `value_type` object that is equivalent to `value`. Note that this method requires that the (template parameter) type `KEY` be `copy‐insertable` into this unordered multiset (see {Requirements on `KEY`}).


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

[.small]#xref:bsl/unordered_multiset-06c/insert-03.adoc[_» more..._]#

Insert the specified `value` into this unordered multiset (in constant time if the specified `hint` refers to an element in this container equivalent to `value`). If one or more keys equivalent to `value` already exist in this unordered multiset, this method is guaranteed to insert `value` in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted `value_type` object that is equivalent to `value`. If `hint` does not refer to an element in this container equivalent to `value`, this operation has worst case `O[N]` and average case constant‐time complexity, where `N` is the size of this unordered multiset. This method requires that the (template parameter) type `KEY` be `move‐insertable` into this unordered multiset (see {Requirements on `KEY`}). The behavior is undefined unless `hint` is an iterator in the range `[begin() .. end()]` (both endpoints included).


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

[.small]#xref:bsl/unordered_multiset-06c/insert-0a.adoc[_» more..._]#

Insert the specified `value` into this unordered multiset (in constant time if the specified `hint` refers to an element in this container equivalent to `value`). If one or more keys equivalent to `value` already exist in this unordered multiset, this method is guaranteed to insert `value` in a position contiguous to one of those equivalent keys. Return an iterator referring to the newly inserted `value_type` object that is equivalent to `value`. If `hint` does not refer to an element in this container equivalent to `value`, this operation has worst case `O[N]` and average case constant‐time complexity, where `N` is the size of this unordered multiset. This method requires that the (template parameter) type `KEY` be `copy‐insertable` into this unordered multiset (see {Requirements on `KEY`}). The behavior is undefined unless `hint` is an iterator in the range `[begin() .. end()]` (both endpoints included).


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

[.small]#xref:bsl/unordered_multiset-06c/insert-0b.adoc[_» more..._]#

Insert into this unordered multiset the value of each `value_type` object in the range starting at the specified `first` iterator and ending immediately before the specified `last` iterator. 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 `value_type`, and `value_type` must be `emplace‐constructible` from `*i` into this unordered multiset, where `i` is a dereferenceable iterator in the range `[first .. last)]` (see {Requirements on `KEY`}). 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`.


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

[.small]#xref:bsl/unordered_multiset-06c/insert-0e8.adoc[_» more..._]#


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