[#bsl-unordered_multimap-0b0-insert-0a]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_multimap-0b0.adoc[unordered_multimap]::insert
:relfileprefix: ../../
:mrdocs:

`insert` overloads

== Synopses

Declared in `<bslstl_unorderedmultimap.h>`

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:bsl/unordered_multimap-0b0/insert-046.adoc[insert](std::initializer_list<value_type> values);
----

[.small]#xref:bsl/unordered_multimap-0b0/insert-046.adoc[_» more..._]#

Insert the specified `value` into this unordered multimap, and return an iterator referring to the newly inserted `value_type` object. This method requires that the (template parameter) types `KEY` and `VALUE` both be `copy‐insertable` into this unordered multimap (see {Requirements on `KEY` and `VALUE`}).


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/unordered_multimap-0b0/iterator.adoc[unordered_multimap<KEY, VALUE, HASH, EQUAL, ALLOCATOR>::iterator]
xref:bsl/unordered_multimap-0b0/insert-047.adoc[insert](xref:bsl/unordered_multimap-0b0/value_type.adoc[value_type] const& value);
----

[.small]#xref:bsl/unordered_multimap-0b0/insert-047.adoc[_» more..._]#

Insert into this unordered multimap a `value_type` object created from the specified `value`, and return an iterator referring to the newly inserted `value_type` object. This method requires that the (template parameter) types `KEY` and `VALUE` both be `move‐insertable` into this unordered multimap (see {Requirements on `KEY` and `VALUE`}), and the `value_type` be constructible from the (template parameter) `ALT_VALUE_TYPE`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class ALT_VALUE_TYPE>
xref:bsl/unordered_multimap-0b0/iterator.adoc[iterator]
xref:bsl/unordered_multimap-0b0/insert-0c.adoc[insert](ALT_VALUE_TYPE&& value)
requires std::is_constructible<value_type,
                                             ALT_VALUE_TYPE&&>::value;
----

[.small]#xref:bsl/unordered_multimap-0b0/insert-0c.adoc[_» more..._]#

Insert the specified `value` into this unordered multimap (in constant time if the specified `hint` refers to an element in this container with a key equivalent to the key of `value`), and return an iterator referring to the newly inserted `value_type` object. If `hint` does not refer to an element in this container with a key equivalent to the key of `value`, this operation has worst case `O[N]` and average case constant‐time complexity, where `N` is the size of this unordered multimap. This method requires that the (template parameter) types `KEY` and `VALUE` both be `copy‐insertable` into this unordered multimap (see {Requirements on `KEY` and `VALUE`}). 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_multimap-0b0/iterator.adoc[unordered_multimap<KEY, VALUE, HASH, EQUAL, ALLOCATOR>::iterator]
xref:bsl/unordered_multimap-0b0/insert-054.adoc[insert](
    xref:bsl/unordered_multimap-0b0/const_iterator.adoc[const_iterator] hint,
    xref:bsl/unordered_multimap-0b0/value_type.adoc[value_type] const& value);
----

[.small]#xref:bsl/unordered_multimap-0b0/insert-054.adoc[_» more..._]#

Insert into this unordered multimap 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 multimap, where `i` is a dereferenceable iterator in the range `[first .. last)]` (see {Requirements on `KEY` and `VALUE`}). 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_multimap-0b0/insert-05e.adoc[insert](
    INPUT_ITERATOR first,
    INPUT_ITERATOR last);
----

[.small]#xref:bsl/unordered_multimap-0b0/insert-05e.adoc[_» more..._]#

Insert into this unordered multimap a `value_type` object created from the specified `value` (in constant time if the specified `hint` refers to an element in this container with a key equivalent to the key of `value`), and return an iterator referring to the newly inserted `value_type` object. If `hint` does not refer to an element in this container with a key equivalent to the key of `value`, this operation has worst case `O[N]` and average case constant‐time complexity, where `N` is the size of this unordered multimap. This method requires that the (template parameter) types `KEY` and `VALUE` both be `move‐insertable` into this unordered multimap (see {Requirements on `KEY` and `VALUE`}), and the `value_type` be constructible from the (template parameter) `ALT_VALUE_TYPE`. The behavior is undefined unless `hint` is an iterator in the range `[begin() .. end()]` (both endpoints included).


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class ALT_VALUE_TYPE>
xref:bsl/unordered_multimap-0b0/iterator.adoc[iterator]
xref:bsl/unordered_multimap-0b0/insert-050.adoc[insert](
    xref:bsl/unordered_multimap-0b0/const_iterator.adoc[const_iterator] hint,
    ALT_VALUE_TYPE&& value)
requires std::is_constructible<value_type,
                                             ALT_VALUE_TYPE&&>::value;
----

[.small]#xref:bsl/unordered_multimap-0b0/insert-050.adoc[_» more..._]#


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