bsl::unordered_multiset

Synopsis

Declared in <bslstl_unorderedmultiset.h>

template<
    class KEY,
    class HASH = bsl::hash<KEY>,
    class EQUAL = bsl::equal_to<KEY>,
    class ALLOCATOR = bsl::allocator<KEY>>
class unordered_multiset;

Description

This class: * supports a complete set of value-semantic operations

except for BDEX serialization * is exception-neutral (agnostic except for the at method) * is alias-safe * is const thread-safe For terminology see {bsldoc_glossary}.

Type Aliases

Name	Description
`allocator_type`	This `typedef` is an alias to the (template parameter) `ALLOCATOR`.
`const_iterator`	This `typedef` is an alias to `iterator`.
`const_local_iterator`	This `typedef` is an alias to `local_iterator`.
`const_pointer`	This `typedef` is an alias to the allocator const-pointer type.
`const_reference`	This `typedef` is an alias for `const_reference`.
`difference_type`	This `typedef` is an alias to the allocator difference type.
`hasher`	This `typedef` is an alias to the (template parameter) `HASH` type.
`iterator`	This `typedef` is an alias to the hash-table iterator type.
`key_equal`	This `typedef` is an alias to the (template parameter) `EQUAL` type.
`key_type`	This `typedef` is an alias to the (template parameter) `KEY` type.
`local_iterator`	This `typedef` is an alias to the hash-table local iterator type.
`pointer`	This `typedef` is an alias to the allocator pointer type.
`reference`	This `typedef` is an alias to `value_type&`.
`size_type`	This `typedef` is an alias to the allocator size type.
`value_type`	This `typedef` is an alias to `key_type`.

Member Functions

Name	Description
`unordered_multiset` [constructor]	Constructors
`~unordered_multiset` [destructor]	Destroy this object.
`operator=`	Assignment operators
`begin`	`begin` overloads
`bucket`	Return the index of the bucket, in the array of buckets of this container, where a value equivalent to the specified `key` would be inserted.
`bucket_count`	Return the number of buckets in the array of buckets maintained by this unordered multiset.
`bucket_size`	Return the number of elements contained in the bucket at the specified `index` in the array of buckets maintained by this container. The behavior is undefined unless 'index < bucket_count()'.
`cbegin`	`cbegin` overloads
`cend`	`cend` overloads
`clear`	Remove all entries from this unordered multiset. Note that the container is empty after this call, but allocated memory may be retained for future use.
`contains`	Return `true` if this unordered multiset contains an element whose key is equivalent to the specified `key`.
`count`	`count` overloads
`emplace`	Insert into this unordered multiset a newly created `value_type` object, constructed by forwarding `get_allocator()` (if required) and the specified (variable number of) `args` to the corresponding constructor of `value_type`. Return an iterator referring to the newly created and inserted object in this unordered multiset whose value is equivalent to that of an object constructed from `args`. This method requires that the (template parameter) type `KEY` be `emplace-constructible` into this unordered multiset from `args` (see {Requirements on `KEY`}).
`emplace_hint`	Insert into this unordered multiset a newly created `value_type` object, constructed by forwarding `get_allocator()` (if required) and the specified (variable number of) `args` to the corresponding constructor of `value_type` (in constant time if the specified `hint` refers to an element in this container equivalent to the newly created `value_type` object). Return an iterator referring to the newly created and inserted object in this unordered multiset whose value is equivalent to that of an object constructed from `args`. If `hint` does not refer to an element in this container equivalent to the newly created `value_type` object, 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 `emplace-constructible` into this unordered multiset from `args` (see {Requirements on `KEY`}). The behavior is undefined unless `hint` is an iterator in the range `[begin() .. end()]` (both endpoints included).
`empty`	Return `true` if this unordered multiset contains no elements, and `false` otherwise.
`end`	`end` overloads
`equal_range`	`equal_range` overloads
`erase`	`erase` overloads
`find`	`find` overloads
`get_allocator`	Return (a copy of) the allocator used for memory allocation by this unordered multiset.
`hash_function`	Return (a copy of) the hash unary functor used by this unordered multiset to generate a hash value (of type `size_t`) for a `key_type` object.
`insert`	`insert` overloads
`insert_range`	Insert into this unordered multiset the value of each `value_type` object in the specified `range`. The (template parameter) type `RANGE` must meet the requirements the C++20 standard [ranges] 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 obtained from `range` (see {Requirements on `KEY`}). The behavior is undefined if `range` overlaps this unordered multiset.
`key_eq`	Return (a copy of) the key-equality binary functor that returns `true` if the value of two `key_type` objects are equivalent, and `false` otherwise.
`load_factor`	Return the current ratio between the `size` of this container and the number of buckets. The `load_factor` is a measure of how full the container is, and a higher load factor leads to an increased number of collisions, thus resulting in a loss performance.
`max_bucket_count`	Return a theoretical upper bound on the largest number of buckets that this container could possibly manage. Note that there is no guarantee that the unordered multiset can successfully grow to the returned size, or even close to that size without running out of resources.
`max_load_factor`	`max_load_factor` overloads
`max_size`	Return a theoretical upper bound on the largest number of elements that this unordered multiset could possibly hold. Note that there is no guarantee that the unordered multiset can successfully grow to the returned size, or even close to that size without running out of resources.
`rehash`	Change the size of the array of buckets maintained by this container to at least the specified `numBuckets`, and redistribute all the contained elements into the new sequence of buckets, according to their hash values. Note that this operation has no effect if rehashing the elements into `numBuckets` would cause this unordered multiset to exceed its `max_load_factor`.
`reserve`	Increase the number of buckets of this unordered multiset to a quantity such that the ratio between the specified `numElements` and this quantity does not exceed `max_load_factor`. Note that this guarantees that, after the reserve, elements can be inserted to grow the container to `size() == numElements` without rehashing. Also note that memory allocations may still occur when growing the container to `size() == numElements`. Also note that this operation has no effect if `numElements <= size()`.
`size`	Return the number of elements in this unordered multiset.
`swap`	Exchange the value, hasher, key-equality functor, and `max_load_factor` of this object with those of the specified `other` object; also exchange the allocator of this object with that of `other` if the (template parameter) type `ALLOCATOR` has the `propagate_on_container_swap` trait, and do not modify either allocator otherwise. This method provides the no-throw exception-safety guarantee if and only if both the (template parameter) types `HASH` and `EQUAL` provide no-throw swap operations; if an exception is thrown, both objects are left in valid but unspecified states. This operation guarantees `O[1]` complexity. The behavior is undefined unless either this object was created with the same allocator as `other` or `ALLOCATOR` has the `propagate_on_container_swap` trait.
`operator BloombergLP::bslmf::NestedTraitDeclaration<unordered_multiset, IsBitwiseMoveable, ::BloombergLP::bslmf::IsBitwiseMoveable<HashTable>::value>`	Nested trait declaration for `bslmf::IsBitwiseMoveable`.

Deduction Guides

Name	Description
`unordered_multiset<KEY>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `unordered_multiset`. This deduction guide does not participate unless the supplied allocator is convertible to `bsl::allocator<KEY>`.
`unordered_multiset<KEY>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `unordered_multiset`. This deduction guide does not participate unless the supplied allocator is convertible to `bsl::allocator<KEY>`.
`unordered_multiset<KEY>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `unordered_multiset`. This deduction guide does not participate unless the supplied allocator is convertible to `bsl::allocator<KEY>`.
`unordered_multiset<KEY>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `unordered_multiset`. This deduction guide does not participate unless the supplied allocator is convertible to `bsl::allocator<KEY>`.
`unordered_multiset<KEY, HASH>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `unordered_multiset`. Deduce the template parameter `HASH` from the other parameters passed to the constructor. This deduction guide does not participate unless the supplied allocator is convertible to `bsl::allocator<KEY>`.
`unordered_multiset<KEY, HASH>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `unordered_multiset`. Deduce the template parameter `HASH` from the other parameters passed to the constructor. This deduction guide does not participate unless the supplied allocator is convertible to `bsl::allocator<KEY>`.
`unordered_multiset<KEY, HASH, EQUAL>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `unordered_multiset`. Deduce the template parameters `HASH` and `EQUAL` from the other parameters passed to the constructor. This deduction guide does not participate unless the supplied allocator is convertible to `bsl::allocator<KEY>`.
`unordered_multiset<KEY, HASH, EQUAL>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `unordered_multiset`. Deduce the template parameters `HASH` and `EQUAL` from the other parameters passed to the constructor. This deduction guide does not participate unless the supplied allocator is convertible to `bsl::allocator<KEY>`.
`unordered_multiset<KEY, HASH, EQUAL, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `unordered_multiset`. Deduce the template parameters `HASH`, EQUAL and `ALLOCATOR` from the other parameters passed to the constructor. This deduction guide does not participate unless: (1) the supplied `HASH` is invocable with a `KEY`, (2) the supplied `EQUAL` is invocable with two `KEY`s, and (3) the supplied allocator meets the requirements of a standard allocator.
`unordered_multiset<KEY, HASH, EQUAL, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `unordered_multiset`. Deduce the template parameters `HASH`, `EQUAL` and `ALLOCATOR` from the other parameters passed to the constructor. This deduction guide does not participate unless: (1) the supplied `HASH` is invocable with a `KEY`, (2) the supplied `EQUAL` is invocable with two `KEY`s, and (3) the supplied allocator meets the requirements of a standard allocator.
`unordered_multiset<KEY, HASH, bsl::equal_to<KEY>, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `unordered_multiset`. Deduce the template parameters `HASH` and `ALLOCATOR` from the other parameters passed to the constructor. This deduction guide does not participate unless the supplied `HASH` is invocable with a `KEY`, and the supplied allocator meets the requirements of a standard allocator.
`unordered_multiset<KEY, HASH, bsl::equal_to<KEY>, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `unordered_multiset`. Deduce the template parameters `HASH` and `ALLOCATOR` from the other parameters passed to the constructor. This deduction guide does not participate unless the supplied `HASH` is invocable with a `KEY`, and the supplied allocator meets the requirements of a standard allocator.
`unordered_multiset<KEY, bsl::hash<KEY>, bsl::equal_to<KEY>, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `unordered_multiset`. This deduction guide does not participate unless the supplied allocator meets the requirements of a standard allocator.
`unordered_multiset<KEY, bsl::hash<KEY>, bsl::equal_to<KEY>, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the initializer_list supplied to the constructor of `unordered_multiset`. This deduction guide does not participate unless the supplied allocator meets the requirements of a standard allocator.
`unordered_multiset<KEY, bsl::hash<KEY>, bsl::equal_to<KEY>, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `unordered_multiset`. This deduction guide does not participate unless the supplied allocator meets the requirements of a standard allocator.
`unordered_multiset<KEY, bsl::hash<KEY>, bsl::equal_to<KEY>, ALLOCATOR>`	Deduce the template parameter `KEY` from the `value_type` of the iterators supplied to the constructor of `unordered_multiset`. This deduction guide does not participate unless the supplied allocator meets the requirements of a standard allocator.

Friends

Name	Description
`bsl::operator==`	Return `true` if the specified `lhs` and `rhs` objects have the same value, and `false` otherwise.

Non-Member Functions

Name	Description
`erase_if`	Erase all the elements in the specified unordered_multiset `ms` that satisfy the specified predicate `predicate`. Return the number of elements erased.
`operator==`	Return `true` if the specified `lhs` and `rhs` objects have the same value, and `false` otherwise. Two `unordered_multiset` objects have the same value if they have the same number of value elements, and for each value-element that is contained in `lhs` there is a value-element contained in `rhs` having the same value, and vice-versa. Note that this method requires that the (template parameter) type `KEY` be `equality-comparable` (see {Requirements on `KEY`}).
`swap`	Exchange the values of the specified `a` and `b` objects.