|
| | unordered_multiset ()=default |
| |
| template<typename _InputIterator> |
| | unordered_multiset (_InputIterator __first, _InputIterator __last, const allocator_type &__a) |
| |
| 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, 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) |
| |
| allocator_type | get_allocator () const noexcept |
| |
| hasher | hash_function () const |
| |
| template<typename _InputIterator> |
| void | insert (_InputIterator __first, _InputIterator __last) |
| |
| void | insert (initializer_list< value_type > __l) |
| |
| 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 |
| |
| 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 |
| |
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 1114 of file unordered_set.h.
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 1182 of file unordered_set.h.
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 1658 of file unordered_set.h.
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 1445 of file unordered_set.h.
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 1467 of file unordered_set.h.
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 1627 of file unordered_set.h.
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 1647 of file unordered_set.h.
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 1604 of file unordered_set.h.
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 1609 of file unordered_set.h.
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 1751 of file unordered_set.h.
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 1763 of file unordered_set.h.
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 1745 of file unordered_set.h.
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 1757 of file unordered_set.h.
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 1523 of file unordered_set.h.
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 1505 of file unordered_set.h.
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 1509 of file unordered_set.h.
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 1360 of file unordered_set.h.
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 1671 of file unordered_set.h.
1.13.2