libstdc++: std::unordered_multiset< _Value, _Hash, _Pred, _Alloc (original) (raw)
#include <[unordered_set](a00239%5Fsource.html)>
| Public Types | |
|---|---|
| using | node_type = typename _Hashtable::node_type |
| typedef _Hashtable::key_type | key_type |
| typedef _Hashtable::value_type | value_type |
| typedef _Hashtable::hasher | hasher |
| typedef _Hashtable::key_equal | key_equal |
| typedef _Hashtable::allocator_type | allocator_type |
| typedef _Hashtable::pointer | pointer |
| typedef _Hashtable::const_pointer | const_pointer |
| typedef _Hashtable::reference | reference |
| typedef _Hashtable::const_reference | const_reference |
| typedef _Hashtable::iterator | iterator |
| typedef _Hashtable::const_iterator | const_iterator |
| typedef _Hashtable::local_iterator | local_iterator |
| typedef _Hashtable::const_local_iterator | const_local_iterator |
| typedef _Hashtable::size_type | size_type |
| typedef _Hashtable::difference_type | difference_type |
| Public Member Functions | |
|---|---|
| unordered_multiset ()=default | |
| template<typename _InputIterator > | |
| unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a) | |
| template<typename _InputIterator > | |
| unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a) | |
| template<typename _InputIterator > | |
| unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) | |
| unordered_multiset (const allocator_type &__a) | |
| unordered_multiset (const unordered_multiset &)=default | |
| unordered_multiset (const unordered_multiset &__umset, const allocator_type &__a) | |
| unordered_multiset (initializer_list< value_type > __l, size_type __n, const allocator_type &__a) | |
| unordered_multiset (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a) | |
| unordered_multiset (initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) | |
| unordered_multiset (size_type __n, const allocator_type &__a) | |
| unordered_multiset (size_type __n, const hasher &__hf, const allocator_type &__a) | |
| unordered_multiset (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) | |
| unordered_multiset (unordered_multiset &&)=default | |
| unordered_multiset (unordered_multiset &&__umset, const allocator_type &__a) noexcept(noexcept(_Hashtable(std::move(__umset._M_h), __a))) | |
| size_type | bucket (const key_type &__key) const |
| size_type | bucket_count () const noexcept |
| size_type | bucket_size (size_type __n) const |
| const_iterator | cbegin () const noexcept |
| const_iterator | cend () const noexcept |
| void | clear () noexcept |
| template<typename... _Args> | |
| iterator | emplace (_Args &&... __args) |
| template<typename... _Args> | |
| iterator | emplace_hint (const_iterator __pos, _Args &&... __args) |
| bool | empty () const noexcept |
| size_type | erase (const key_type &__x) |
| iterator | erase (const_iterator __first, const_iterator __last) |
| node_type | extract (const key_type &__key) |
| node_type | extract (const_iterator __pos) |
| allocator_type | get_allocator () const noexcept |
| hasher | hash_function () const |
| template<typename _InputIterator > | |
| void | insert (_InputIterator __first, _InputIterator __last) |
| iterator | insert (const_iterator __hint, node_type &&__nh) |
| void | insert (initializer_list< value_type > __l) |
| iterator | insert (node_type &&__nh) |
| key_equal | key_eq () const |
| float | load_factor () const noexcept |
| size_type | max_bucket_count () const noexcept |
| float | max_load_factor () const noexcept |
| void | max_load_factor (float __z) |
| size_type | max_size () const noexcept |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_multiset< _Value, _H2, _P2, _Alloc > &&__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_multiset< _Value, _H2, _P2, _Alloc > &__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_set< _Value, _H2, _P2, _Alloc > &&__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_set< _Value, _H2, _P2, _Alloc > &__source) |
| unordered_multiset & | operator= (const unordered_multiset &)=default |
| unordered_multiset & | operator= (initializer_list< value_type > __l) |
| unordered_multiset & | operator= (unordered_multiset &&)=default |
| void | rehash (size_type __n) |
| void | reserve (size_type __n) |
| size_type | size () const noexcept |
| void | swap (unordered_multiset &__x) noexcept(noexcept(_M_h.swap(__x._M_h))) |
| iterator | begin () noexcept |
| const_iterator | begin () const noexcept |
| iterator | end () noexcept |
| const_iterator | end () const noexcept |
| iterator | insert (const value_type &__x) |
| iterator | insert (value_type &&__x) |
| iterator | insert (const_iterator __hint, const value_type &__x) |
| iterator | insert (const_iterator __hint, value_type &&__x) |
| iterator | erase (const_iterator __position) |
| iterator | erase (iterator __position) |
| iterator | find (const key_type &__x) |
| template<typename _Kt > | |
| auto | find (const _Kt &__x) -> decltype(_M_h._M_find_tr(__x)) |
| const_iterator | find (const key_type &__x) const |
| template<typename _Kt > | |
| auto | find (const _Kt &__x) const -> decltype(_M_h._M_find_tr(__x)) |
| size_type | count (const key_type &__x) const |
| template<typename _Kt > | |
| auto | count (const _Kt &__x) const -> decltype(_M_h._M_count_tr(__x)) |
| bool | contains (const key_type &__x) const |
| template<typename _Kt > | |
| auto | contains (const _Kt &__x) const -> decltype(_M_h._M_find_tr(__x), void(), true) |
| std::pair< iterator, iterator > | equal_range (const key_type &__x) |
| template<typename _Kt > | |
| auto | equal_range (const _Kt &__x) -> decltype(_M_h._M_equal_range_tr(__x)) |
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
| template<typename _Kt > | |
| auto | equal_range (const _Kt &__x) const -> decltype(_M_h._M_equal_range_tr(__x)) |
| local_iterator | begin (size_type __n) |
| const_local_iterator | begin (size_type __n) const |
| const_local_iterator | cbegin (size_type __n) const |
| local_iterator | end (size_type __n) |
| const_local_iterator | end (size_type __n) const |
| const_local_iterator | cend (size_type __n) const |
| Friends | |
|---|---|
| template<typename _Value1 , typename _Hash1 , typename _Pred1 , typename _Alloc1 > | |
| bool | operator== (const unordered_multiset< _Value1, _Hash1, _Pred1, _Alloc1 > &, const unordered_multiset< _Value1, _Hash1, _Pred1, _Alloc1 > &) |
| template<typename , typename , typename > | |
| class | std::_Hash_merge_helper |
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
class std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >
A standard container composed of equivalent keys (possibly containing multiple of each key value) in which the elements' keys are the elements themselves.
Since
C++11
Template Parameters
| _Value | Type of key objects. |
|---|---|
| _Hash | Hashing function object type, defaults to hash<_Value>. |
| _Pred | Predicate function object type, defaults to equal_to<_Value>. |
| _Alloc | Allocator type, defaults to allocator<_Key>. |
Meets the requirements of a container, and unordered associative container
Base is _Hashtable, dispatched at compile time via template alias __umset_hashtable.
Definition at line 972 of file unordered_set.h.
◆ allocator_type
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ const_iterator
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ const_local_iterator
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
typedef _Hashtable::const_local_iterator std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::const_local_iterator
◆ const_pointer
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ const_reference
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ difference_type
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ hasher
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ iterator
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ key_equal
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ key_type
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ local_iterator
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ node_type
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ pointer
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ reference
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ size_type
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ value_type
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Default constructor.
◆ unordered_multiset() [2/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Default constructor creates no elements.
Parameters
| __n | Minimal initial number of buckets. |
|---|---|
| __hf | A hash functor. |
| __eql | A key equality functor. |
| __a | An allocator object. |
Definition at line 1019 of file unordered_set.h.
◆ unordered_multiset() [3/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _InputIterator >
Builds an unordered_multiset from a range.
Parameters
| __first | An input iterator. |
|---|---|
| __last | An input iterator. |
| __n | Minimal initial number of buckets. |
| __hf | A hash functor. |
| __eql | A key equality functor. |
| __a | An allocator object. |
Create an unordered_multiset consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)).
Definition at line 1040 of file unordered_set.h.
◆ unordered_multiset() [4/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Copy constructor.
◆ unordered_multiset() [5/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Move constructor.
◆ unordered_multiset() [6/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Builds an unordered_multiset from an initializer_list.
Parameters
| __l | An initializer_list. |
|---|---|
| __n | Minimal initial number of buckets. |
| __hf | A hash functor. |
| __eql | A key equality functor. |
| __a | An allocator object. |
Create an unordered_multiset consisting of copies of the elements in the list. This is linear in N (where N is __l.size()).
Definition at line 1065 of file unordered_set.h.
◆ unordered_multiset() [7/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Creates an unordered_multiset with no elements.
Parameters
Definition at line 1086 of file unordered_set.h.
◆ unordered_multiset() [8/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ unordered_multiset() [9/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ unordered_multiset() [10/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ unordered_multiset() [11/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ unordered_multiset() [12/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _InputIterator >
◆ unordered_multiset() [13/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _InputIterator >
◆ unordered_multiset() [14/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ unordered_multiset() [15/15]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ begin() [1/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.
Definition at line 1198 of file unordered_set.h.
◆ begin() [2/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.
Definition at line 1194 of file unordered_set.h.
◆ begin() [3/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator pointing to the first bucket element.
Parameters
Returns
A read-only local iterator.
Definition at line 1640 of file unordered_set.h.
◆ begin() [4/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator pointing to the first bucket element.
Parameters
Returns
A read-only local iterator.
Definition at line 1644 of file unordered_set.h.
◆ bucket()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ bucket_count()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns the number of buckets of the unordered_multiset.
Definition at line 1606 of file unordered_set.h.
◆ bucket_size()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ cbegin() [1/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.
Definition at line 1221 of file unordered_set.h.
◆ cbegin() [2/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator pointing to the first bucket element.
Parameters
Returns
A read-only local iterator.
Definition at line 1648 of file unordered_set.h.
◆ cend() [1/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ cend() [2/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
Parameters
Returns
A read-only local iterator.
Definition at line 1668 of file unordered_set.h.
◆ clear()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Erases all elements in an unordered_multiset.
Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 1430 of file unordered_set.h.
◆ contains() [1/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _Kt >
| auto std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::contains ( const _Kt & __x) const -> decltype(_M_h._M_find_tr(__x), void(), true) | inline |
|---|
Finds whether an element with the given key exists.
Parameters
| __x | Key of elements to be located. |
|---|
Returns
True if there is any element with the specified key.
Definition at line 1564 of file unordered_set.h.
◆ contains() [2/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Finds whether an element with the given key exists.
Parameters
| __x | Key of elements to be located. |
|---|
Returns
True if there is any element with the specified key.
Definition at line 1559 of file unordered_set.h.
◆ count() [1/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _Kt >
| auto std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::count ( const _Kt & __x) const -> decltype(_M_h._M_count_tr(__x)) | inline |
|---|
Finds the number of elements.
Parameters
Returns
Number of elements with specified key.
Definition at line 1546 of file unordered_set.h.
◆ count() [2/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Finds the number of elements.
Parameters
Returns
Number of elements with specified key.
Definition at line 1540 of file unordered_set.h.
◆ emplace()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename... _Args>
Builds and insert an element into the unordered_multiset.
Parameters
| __args | Arguments used to generate an element. |
|---|
Returns
An iterator that points to the inserted element.
Insertion requires amortized constant time.
Definition at line 1243 of file unordered_set.h.
◆ emplace_hint()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename... _Args>
Inserts an element into the unordered_multiset.
Parameters
| __pos | An iterator that serves as a hint as to where the element should be inserted. |
|---|---|
| __args | Arguments used to generate the element to be inserted. |
Returns
An iterator that points to the inserted element.
Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.
For more on hinting, see: https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
Insertion requires amortized constant time.
Definition at line 1265 of file unordered_set.h.
◆ empty()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns true if the unordered_multiset is empty.
Definition at line 1173 of file unordered_set.h.
◆ end() [1/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator that points one past the last element in the unordered_multiset.
Definition at line 1212 of file unordered_set.h.
◆ end() [2/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ end() [3/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
Parameters
Returns
A read-only local iterator.
Definition at line 1660 of file unordered_set.h.
◆ end() [4/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
Parameters
Returns
A read-only local iterator.
Definition at line 1664 of file unordered_set.h.
◆ equal_range() [1/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _Kt >
| auto std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::equal_range ( const _Kt & __x) -> decltype(_M_h._M_equal_range_tr(__x)) | inline |
|---|
Finds a subsequence matching given key.
Parameters
Returns
Pair of iterators that possibly points to the subsequence matching given key.
Definition at line 1584 of file unordered_set.h.
◆ equal_range() [2/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _Kt >
| auto std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::equal_range ( const _Kt & __x) const -> decltype(_M_h._M_equal_range_tr(__x)) | inline |
|---|
Finds a subsequence matching given key.
Parameters
Returns
Pair of iterators that possibly points to the subsequence matching given key.
Definition at line 1596 of file unordered_set.h.
◆ equal_range() [3/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Finds a subsequence matching given key.
Parameters
Returns
Pair of iterators that possibly points to the subsequence matching given key.
Definition at line 1578 of file unordered_set.h.
◆ equal_range() [4/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Finds a subsequence matching given key.
Parameters
Returns
Pair of iterators that possibly points to the subsequence matching given key.
Definition at line 1590 of file unordered_set.h.
◆ erase() [1/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Erases elements according to the provided key.
Parameters
| __x | Key of element to be erased. |
|---|
Returns
The number of elements erased.
This function erases all the elements located by the given key from an unordered_multiset.
Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 1399 of file unordered_set.h.
◆ erase() [2/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Erases a [__first,__last) range of elements from an unordered_multiset.
Parameters
| __first | Iterator pointing to the start of the range to be erased. |
|---|---|
| __last | Iterator pointing to the end of the range to be erased. |
Returns
The iterator __last.
This function erases a sequence of elements from an unordered_multiset.
Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 1419 of file unordered_set.h.
◆ erase() [3/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Erases an element from an unordered_multiset.
Parameters
| __position | An iterator pointing to the element to be erased. |
|---|
Returns
An iterator pointing to the element immediately following __position prior to the element being erased. If no such element exists, end() is returned.
This function erases an element, pointed to by the given iterator, from an unordered_multiset.
Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 1376 of file unordered_set.h.
◆ erase() [4/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Erases an element from an unordered_multiset.
Parameters
| __position | An iterator pointing to the element to be erased. |
|---|
Returns
An iterator pointing to the element immediately following __position prior to the element being erased. If no such element exists, end() is returned.
This function erases an element, pointed to by the given iterator, from an unordered_multiset.
Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 1381 of file unordered_set.h.
◆ extract() [1/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ extract() [2/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ find() [1/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _Kt >
| auto std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::find ( const _Kt & __x) -> decltype(_M_h._M_find_tr(__x)) | inline |
|---|
Tries to locate an element in an unordered_multiset.
Parameters
| __x | Element to be located. |
|---|
Returns
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end() ) iterator.
Definition at line 1515 of file unordered_set.h.
◆ find() [2/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _Kt >
| auto std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::find ( const _Kt & __x) const -> decltype(_M_h._M_find_tr(__x)) | inline |
|---|
Tries to locate an element in an unordered_multiset.
Parameters
| __x | Element to be located. |
|---|
Returns
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end() ) iterator.
Definition at line 1527 of file unordered_set.h.
◆ find() [3/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Tries to locate an element in an unordered_multiset.
Parameters
| __x | Element to be located. |
|---|
Returns
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end() ) iterator.
Definition at line 1509 of file unordered_set.h.
◆ find() [4/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Tries to locate an element in an unordered_multiset.
Parameters
| __x | Element to be located. |
|---|
Returns
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-the-end ( end() ) iterator.
Definition at line 1521 of file unordered_set.h.
◆ get_allocator()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns the allocator object used by the unordered_multiset.
Definition at line 1166 of file unordered_set.h.
◆ hash_function()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns the hash functor object with which the unordered_multiset was constructed.
Definition at line 1485 of file unordered_set.h.
◆ insert() [1/8]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _InputIterator >
| void std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::insert ( _InputIterator __first, _InputIterator __last ) | inline |
|---|
A template function that inserts a range of elements.
Parameters
| __first | Iterator pointing to the start of the range to be inserted. |
|---|---|
| __last | Iterator pointing to the end of the range. |
Complexity similar to that of the range constructor.
Definition at line 1321 of file unordered_set.h.
◆ insert() [2/8]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Inserts an element into the unordered_multiset.
Parameters
| __x | Element to be inserted. |
|---|
Returns
An iterator that points to the inserted element.
Insertion requires amortized constant time.
Definition at line 1277 of file unordered_set.h.
◆ insert() [3/8]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Inserts an element into the unordered_multiset.
Parameters
| __hint | An iterator that serves as a hint as to where the element should be inserted. |
|---|---|
| __x | Element to be inserted. |
Returns
An iterator that points to the inserted element.
Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.
For more on hinting, see: https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
Insertion requires amortized constant.
Definition at line 1303 of file unordered_set.h.
◆ insert() [4/8]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ insert() [5/8]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ insert() [6/8]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Inserts a list of elements into the unordered_multiset.
Parameters
| __l | A std::initializer_list<value_type> of elements to be inserted. |
|---|
Complexity similar to that of the range constructor.
Definition at line 1332 of file unordered_set.h.
◆ insert() [7/8]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ insert() [8/8]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Inserts an element into the unordered_multiset.
Parameters
| __x | Element to be inserted. |
|---|
Returns
An iterator that points to the inserted element.
Insertion requires amortized constant time.
Definition at line 1281 of file unordered_set.h.
References std::move().
◆ key_eq()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns the key comparison object with which the unordered_multiset was constructed.
Definition at line 1491 of file unordered_set.h.
◆ load_factor()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns the average number of elements per bucket.
Definition at line 1676 of file unordered_set.h.
◆ max_bucket_count()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns the maximum number of buckets of the unordered_multiset.
Definition at line 1611 of file unordered_set.h.
◆ max_load_factor() [1/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns a positive number that the unordered_multiset tries to keep the load factor less than or equal to.
Definition at line 1682 of file unordered_set.h.
◆ max_load_factor() [2/2]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Change the unordered_multiset maximum load factor.
Parameters
| __z | The new maximum load factor. |
|---|
Definition at line 1690 of file unordered_set.h.
◆ max_size()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Returns the maximum size of the unordered_multiset.
Definition at line 1183 of file unordered_set.h.
◆ merge() [1/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _H2 , typename _P2 >
◆ merge() [2/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _H2 , typename _P2 >
◆ merge() [3/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _H2 , typename _P2 >
◆ merge() [4/4]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename _H2 , typename _P2 >
◆ operator=() [1/3]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Copy assignment operator.
◆ operator=() [2/3]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Unordered_multiset list assignment operator.
Parameters
This function fills an unordered_multiset with copies of the elements in the initializer list __l.
Note that the assignment completely changes the unordered_multiset and that the resulting unordered_multiset's size is the same as the number of elements assigned.
Definition at line 1158 of file unordered_set.h.
◆ operator=() [3/3]
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Move assignment operator.
◆ rehash()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
May rehash the unordered_multiset.
Parameters
| __n | The new number of buckets. |
|---|
Rehash will occur only if the new number of buckets respect the unordered_multiset maximum load factor.
Definition at line 1701 of file unordered_set.h.
◆ reserve()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Prepare the unordered_multiset for a specified number of elements.
Parameters
| __n | Number of elements required. |
|---|
Same as rehash(ceil(n / max_load_factor())).
Definition at line 1712 of file unordered_set.h.
◆ size()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
◆ swap()
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Swaps data with another unordered_multiset.
Parameters
| __x | An unordered_multiset of the same element and allocator types. |
|---|
This exchanges the elements between two sets in constant time. Note that the global std::swap() function is specialized such that std::swap(s1,s2) will feed to this function.
Definition at line 1443 of file unordered_set.h.
◆ std::_Hash_merge_helper
template<typename _Value , typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename , typename , typename >
| friend class std::_Hash_merge_helper | friend |
|---|
The documentation for this class was generated from the following file: