[#bsl-unordered_multiset-06c-2constructor-075]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_multiset-06c.adoc[unordered&lowbar;multiset]::unordered&lowbar;multiset
:relfileprefix: ../../
:mrdocs:

Create an unordered multiset having the same value as the specified `original` object that uses the specified `basicAllocator` to supply memory&period; The contents of `original` are moved (in constant time) to the new unordered multiset if &grave;basicAllocator &equals;&equals; original&period;get&lowbar;allocator()&grave;, and are move&hyphen;inserted (in linear time) using `basicAllocator` otherwise&period; `original` is left in a valid but unspecified state&period; Use a copy of `original&period;hash&lowbar;function()` to generate hash values for the keys contained in this unordered multiset&period; Use a copy of `original&period;key&lowbar;eq()` to verify that two keys are equivalent&period; This method requires that the (template parameter) type `KEY` be `move&hyphen;insertable` into this unordered multiset (see &lcub;Requirements on `KEY`&rcub;)&period; Note that a `bslma&colon;&colon;Allocator &ast;` can be supplied for `basicAllocator` if the (template parameter) type `ALLOCATOR` is `bsl&colon;&colon;allocator` (the default)&period;

== Synopsis

Declared in `&lt;bslstl&lowbar;unorderedmultiset&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
unordered&lowbar;multiset(
    xref:BloombergLP/bslmf/MovableRef.adoc[BloombergLP::bslmf::MovableRef&lt;unordered&lowbar;multiset&gt;] original,
    ALLOCATOR const& basicAllocator);
----


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