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

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).

== Synopsis

Declared in `<bslstl_unorderedmultimap.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class ALT_VALUE_TYPE>
xref:bsl/unordered_multimap-0b0/iterator.adoc[iterator]
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]#Created with https://www.mrdocs.com[MrDocs]#