[#bsl-unordered_multiset-06c-2constructor-0ab] = xref:bsl.adoc[bsl]::xref:bsl/unordered_multiset-06c.adoc[unordered_multiset]::unordered_multiset :relfileprefix: ../../ :mrdocs: Constructors == Synopses Declared in `<bslstl_unorderedmultiset.h>` Create an empty unordered multiset. Optionally specify an `initialNumBuckets` indicating the initial size of the array of buckets of this container. If `initialNumBuckets` is not supplied, a single bucket is used. Optionally specify a `hashFunction` used to generate the hash values for the keys contained in this unordered multiset. If `hashFunction` is not supplied, a default‐constructed object of the (template parameter) type `HASH` is used. Optionally specify a key‐equality functor `keyEqual` used to verify that two keys are equivalent. If `keyEqual` is not supplied, a default‐constructed object of the (template parameter) type `EQUAL` is used. Optionally specify a `basicAllocator` used to supply memory. If `basicAllocator` is not supplied, a default‐constructed object of the (template parameter) type `ALLOCATOR` is used. If the type `ALLOCATOR` is `bsl::allocator` (the default), then `basicAllocator`, if supplied, shall be convertible to `bslma::Allocator *`. If the type `ALLOCATOR` is `bsl::allocator` and `basicAllocator` is not supplied, the currently installed default allocator is used. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- xref:bsl/unordered_multiset-06c/2constructor-09e.adoc[unordered_multiset](); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-09e.adoc[_» more..._]# Create an unordered multiset having the same value as the specified `original` object. Use a copy of `original.hash_function()` to generate hash values for the keys contained in this unordered multiset. Use a copy of `original.key_eq()` to verify that two keys are equivalent. Use the allocator returned by `bsl::allocator_traits<ALLOCATOR>:: select_on_container_copy_construction(original.get_allocator())` to allocate memory. 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/2constructor-00.adoc[unordered_multiset](xref:bsl/unordered_multiset-06c.adoc[unordered_multiset] const& original); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-00.adoc[_» more..._]# Create an unordered multiset having the same value as the specified `original` object by moving (in constant time) the contents of `original` to the new unordered multiset. Use a copy of `original.hash_function()` to generate hash values for the keys contained in this unordered multiset. Use a copy of `original.key_eq()` to verify that two keys are equivalent. The allocator associated with `original` is propagated for use in the newly‐created unordered multiset. `original` is left in a valid but unspecified state. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- xref:bsl/unordered_multiset-06c/2constructor-0e0d.adoc[unordered_multiset](xref:BloombergLP/bslmf/MovableRef.adoc[BloombergLP::bslmf::MovableRef<unordered_multiset>] original); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-0e0d.adoc[_» more..._]# Same as the related overload above for `unordered_multiset`. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- explicit xref:bsl/unordered_multiset-06c/2constructor-0c.adoc[unordered_multiset](ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-0c.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- xref:bsl/unordered_multiset-06c/2constructor-017.adoc[unordered_multiset]( xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-017.adoc[_» more..._]# Create an unordered multiset having the same value as the specified `original` object that uses the specified `basicAllocator` to supply memory. The contents of `original` are moved (in constant time) to the new unordered multiset if `basicAllocator == original.get_allocator()`, and are move‐inserted (in linear time) using `basicAllocator` otherwise. `original` is left in a valid but unspecified state. Use a copy of `original.hash_function()` to generate hash values for the keys contained in this unordered multiset. Use a copy of `original.key_eq()` to verify that two keys are equivalent. This method requires that the (template parameter) type `KEY` be `move‐insertable` into this unordered multiset (see {Requirements on `KEY`}). Note that a `bslma::Allocator *` can be supplied for `basicAllocator` if the (template parameter) type `ALLOCATOR` is `bsl::allocator` (the default). [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- xref:bsl/unordered_multiset-06c/2constructor-075.adoc[unordered_multiset]( xref:BloombergLP/bslmf/MovableRef.adoc[BloombergLP::bslmf::MovableRef<unordered_multiset>] original, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-075.adoc[_» more..._]# Create an unordered multiset having the same value as the specified `original` object that uses the specified `basicAllocator` to supply memory. Use a copy of `original.hash_function()` to generate hash values for the keys contained in this unordered multiset. Use a copy of `original.key_eq()` to verify that two keys are equivalent. This method requires that the (template parameter) type `KEY` be `copy‐insertable` into this unordered multiset (see {Requirements on `KEY`}). Note that a `bslma::Allocator *` can be supplied for `basicAllocator` if the (template parameter) type `ALLOCATOR` is `bsl::allocator` (the default). [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- xref:bsl/unordered_multiset-06c/2constructor-03a.adoc[unordered_multiset]( xref:bsl/unordered_multiset-06c.adoc[unordered_multiset] const& original, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-03a.adoc[_» more..._]# Create an unordered multiset and insert each `value_type` object in the specified `values` initializer list. Optionally specify an `initialNumBuckets` indicating the initial size of the array of buckets of this container. If `initialNumBuckets` is not supplied, a single bucket is used. Optionally specify a `hashFunction` used to generate the hash values for the keys contained in this unordered multiset. If `hashFunction` is not supplied, a default‐constructed object of the (template parameter) type `HASH` is used. Optionally specify a key‐equality functor `keyEqual` used to verify that two keys are equivalent. If `keyEqual` is not supplied, a default‐constructed object of the (template parameter) type `EQUAL` is used. Optionally specify a `basicAllocator` used to supply memory. If `basicAllocator` is not supplied, a default‐constructed object of the (template parameter) type `ALLOCATOR` is used. If the type `ALLOCATOR` is `bsl::allocator` and `basicAllocator` is not supplied, the currently installed default allocator is used to supply memory. This method requires that the (template parameter) type `KEY` be `copy‐insertable` into this unordered multiset (see {Requirements on `KEY`}). Note that a `bslma::Allocator *` can be supplied for `basicAllocator` if the type `ALLOCATOR` is `bsl::allocator` (the default). [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class = void> requires bsl::IsStdAllocator<ALLOCATOR>::value xref:bsl/unordered_multiset-06c/2constructor-0a9.adoc[unordered_multiset]( std::initializer_list<KEY> values, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-0a9.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- xref:bsl/unordered_multiset-06c/2constructor-071.adoc[unordered_multiset]( xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, HASH const& hashFunction, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-071.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class INPUT_ITERATOR> xref:bsl/unordered_multiset-06c/2constructor-0e09.adoc[unordered_multiset]( INPUT_ITERATOR first, INPUT_ITERATOR last, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-0e09.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class RANGE> xref:bsl/unordered_multiset-06c/2constructor-0e1.adoc[unordered_multiset]( std::from_range_t, RANGE&& range, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-0e1.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class = void> requires bsl::IsStdAllocator<ALLOCATOR>::value xref:bsl/unordered_multiset-06c/2constructor-036.adoc[unordered_multiset]( std::initializer_list<KEY> values, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-036.adoc[_» more..._]# Same as the preceding overload, using the specified bucket count and hash/equality functors. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- explicit xref:bsl/unordered_multiset-06c/2constructor-02.adoc[unordered_multiset]( xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, HASH const& hashFunction = HASH(), EQUAL const& keyEqual = EQUAL(), ALLOCATOR const& basicAllocator = ALLOCATOR()); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-02.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class INPUT_ITERATOR> xref:bsl/unordered_multiset-06c/2constructor-019.adoc[unordered_multiset]( INPUT_ITERATOR first, INPUT_ITERATOR last, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-019.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class RANGE> xref:bsl/unordered_multiset-06c/2constructor-018.adoc[unordered_multiset]( std::from_range_t, RANGE&& range, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-018.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template< class = void, class = void> requires std::is_invocable_v<HASH, const KEY &> && bsl::IsStdAllocator<ALLOCATOR>::value xref:bsl/unordered_multiset-06c/2constructor-0e3.adoc[unordered_multiset]( std::initializer_list<KEY> values, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, HASH const& hashFunction, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-0e3.adoc[_» more..._]# Same as the preceding overload, using the specified allocator. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class INPUT_ITERATOR> xref:bsl/unordered_multiset-06c/2constructor-04a.adoc[unordered_multiset]( INPUT_ITERATOR first, INPUT_ITERATOR last, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, HASH const& hashFunction, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-04a.adoc[_» more..._]# Create an `unordered_multiset` from the specified `range`, using the optionally specified `initialNumBuckets`, `hashFunction`, `keyEqual`, and `basicAllocator`. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class RANGE> xref:bsl/unordered_multiset-06c/2constructor-06.adoc[unordered_multiset]( std::from_range_t, RANGE&& range, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets, HASH const& hashFunction, ALLOCATOR const& basicAllocator); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-06.adoc[_» more..._]# Create an unordered multiset from the specified `values` initializer list. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template< class = void, class = void, class = void> requires std::is_invocable_v<HASH, const KEY &> && std::is_invocable_v<EQUAL, const KEY &, const KEY &> && bsl::IsStdAllocator_v<ALLOCATOR> xref:bsl/unordered_multiset-06c/2constructor-047.adoc[unordered_multiset]( std::initializer_list<KEY> values, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets = 0, HASH const& hashFunction = HASH(), EQUAL const& keyEqual = EQUAL(), ALLOCATOR const& basicAllocator = ALLOCATOR()); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-047.adoc[_» more..._]# Create an unordered multiset, and insert each `value_type` object in the sequence starting at the specified `first` element, and ending immediately before the specified `last` element. Optionally specify an `initialNumBuckets` indicating the initial size of the array of buckets of this container. If `initialNumBuckets` is not supplied, a single bucket is used. Optionally specify a `hashFunction` used to generate hash values for the keys contained in this unordered multiset. If `hashFunction` is not supplied, a default‐constructed object of (template parameter) type `HASH` is used. Optionally specify a key‐equality functor `keyEqual` used to verify that two keys are equivalent. If `keyEqual` is not supplied, a default‐constructed object of (template parameter) type `EQUAL` is used. Optionally specify a `basicAllocator` used to supply memory. If `basicAllocator` is not supplied, a default‐constructed object of the (template parameter) type `ALLOCATOR` is used. If the type `ALLOCATOR` is `bsl::allocator` and `basicAllocator` is not supplied, the currently installed default allocator is used to supply memory. 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`. Note that a `bslma::Allocator *` can be supplied for `basicAllocator` if the type `ALLOCATOR` is `bsl::allocator` (the default). [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class INPUT_ITERATOR> xref:bsl/unordered_multiset-06c/2constructor-0aa.adoc[unordered_multiset]( INPUT_ITERATOR first, INPUT_ITERATOR last, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets = 0, HASH const& hashFunction = HASH(), EQUAL const& keyEqual = EQUAL(), ALLOCATOR const& basicAllocator = ALLOCATOR()); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-0aa.adoc[_» more..._]# Create an unordered multiset, and insert each `value_type` object in the specified `range`. Optionally specify an `initialNumBuckets` indicating the initial size of the array of buckets of this container. If `initialNumBuckets` is not supplied, an implementation‐defined value is used. Optionally specify a `hashFunction` used to generate the hash values for each key value contained in this unordered multiset. If `hashFunction` is not supplied, a default‐constructed object of the (template parameter) type `HASH` is used. Optionally specify a key‐equality functor `keyEqual` used to determine whether two keys have the same value. If `keyEqual` is not supplied, a default‐constructed object of the (template parameter) type `EQUAL` is used. Optionally specify a `basicAllocator` used to supply memory. If `basicAllocator` is not supplied, a default‐constructed object of the (template parameter) type `ALLOCATOR` is used. If the type `ALLOCATOR` is `bsl::allocator` (the default), then `basicAllocator`, if supplied, shall be convertible to `bslma::Allocator *`. If the type `ALLOCATOR` is `bsl::allocator` and `basicAllocator` is not supplied, the currently installed default allocator is used. This operation has `O[N]` complexity, where `N` is the number of elements in `range`. Note that `RANGE` must meet the requirements of an input range and the values from `range` must have a type matching or convertible to `value_type`. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template<class RANGE> xref:bsl/unordered_multiset-06c/2constructor-090.adoc[unordered_multiset]( std::from_range_t, RANGE&& range, xref:bsl/unordered_multiset-06c/size_type.adoc[size_type] initialNumBuckets = 0, HASH const& hashFunction = HASH(), EQUAL const& keyEqual = EQUAL(), ALLOCATOR const& basicAllocator = ALLOCATOR()); ---- [.small]#xref:bsl/unordered_multiset-06c/2constructor-090.adoc[_» more..._]# [.small]#Created with https://www.mrdocs.com[MrDocs]#