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

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

== Synopsis

Declared in `<bslstl_unorderedmultiset.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/unordered_multiset-06c/iterator.adoc[unordered_multiset<KEY, HASH, EQUAL, ALLOCATOR>::iterator]
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]#Created with https://www.mrdocs.com[MrDocs]#