libstdc++
|
#include <unordered_set>
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 |
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 |
A standard container composed of equivalent keys (possibly containing multiple of each key value) in which the elements' keys are the elements themselves.
_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 967 of file unordered_set.h.
typedef _Hashtable::allocator_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::allocator_type |
Public typedefs.
Definition at line 980 of file unordered_set.h.
typedef _Hashtable::const_iterator std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::const_iterator |
Iterator-related typedefs.
Definition at line 990 of file unordered_set.h.
typedef _Hashtable::const_local_iterator std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::const_local_iterator |
Iterator-related typedefs.
Definition at line 992 of file unordered_set.h.
typedef _Hashtable::const_pointer std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::const_pointer |
Iterator-related typedefs.
Definition at line 986 of file unordered_set.h.
typedef _Hashtable::const_reference std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::const_reference |
Iterator-related typedefs.
Definition at line 988 of file unordered_set.h.
typedef _Hashtable::difference_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::difference_type |
Iterator-related typedefs.
Definition at line 994 of file unordered_set.h.
typedef _Hashtable::hasher std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::hasher |
Public typedefs.
Definition at line 978 of file unordered_set.h.
typedef _Hashtable::iterator std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::iterator |
Iterator-related typedefs.
Definition at line 989 of file unordered_set.h.
typedef _Hashtable::key_equal std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::key_equal |
Public typedefs.
Definition at line 979 of file unordered_set.h.
typedef _Hashtable::key_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::key_type |
Public typedefs.
Definition at line 976 of file unordered_set.h.
typedef _Hashtable::local_iterator std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::local_iterator |
Iterator-related typedefs.
Definition at line 991 of file unordered_set.h.
using std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::node_type = typename _Hashtable::node_type |
Definition at line 998 of file unordered_set.h.
typedef _Hashtable::pointer std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::pointer |
Iterator-related typedefs.
Definition at line 985 of file unordered_set.h.
typedef _Hashtable::reference std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::reference |
Iterator-related typedefs.
Definition at line 987 of file unordered_set.h.
typedef _Hashtable::size_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::size_type |
Iterator-related typedefs.
Definition at line 993 of file unordered_set.h.
typedef _Hashtable::value_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::value_type |
Public typedefs.
Definition at line 977 of file unordered_set.h.
|
default |
Default constructor.
|
inlineexplicit |
Default constructor creates no elements.
__n | Minimal initial number of buckets. |
__hf | A hash functor. |
__eql | A key equality functor. |
__a | An allocator object. |
Definition at line 1014 of file unordered_set.h.
|
inline |
Builds an unordered_multiset from a range.
__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 1035 of file unordered_set.h.
|
default |
Copy constructor.
|
default |
Move constructor.
|
inline |
Builds an unordered_multiset from an initializer_list.
__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 1060 of file unordered_set.h.
|
inlineexplicit |
Creates an unordered_multiset with no elements.
__a | An allocator object. |
Definition at line 1081 of file unordered_set.h.
|
inline |
Definition at line 1090 of file unordered_set.h.
|
inlinenoexcept |
Definition at line 1100 of file unordered_set.h.
|
inline |
Definition at line 1106 of file unordered_set.h.
|
inline |
Definition at line 1110 of file unordered_set.h.
|
inline |
Definition at line 1116 of file unordered_set.h.
|
inline |
Definition at line 1123 of file unordered_set.h.
|
inline |
Definition at line 1129 of file unordered_set.h.
|
inline |
Definition at line 1135 of file unordered_set.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.
Definition at line 1193 of file unordered_set.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.
Definition at line 1189 of file unordered_set.h.
|
inline |
Returns a read-only (constant) iterator pointing to the first bucket element.
__n | The bucket index. |
Definition at line 1635 of file unordered_set.h.
|
inline |
Returns a read-only (constant) iterator pointing to the first bucket element.
__n | The bucket index. |
Definition at line 1639 of file unordered_set.h.
|
inline |
Definition at line 1624 of file unordered_set.h.
|
inlinenoexcept |
Returns the number of buckets of the unordered_multiset.
Definition at line 1601 of file unordered_set.h.
|
inline |
Definition at line 1615 of file unordered_set.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the unordered_multiset.
Definition at line 1216 of file unordered_set.h.
|
inline |
Returns a read-only (constant) iterator pointing to the first bucket element.
__n | The bucket index. |
Definition at line 1643 of file unordered_set.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the unordered_multiset.
Definition at line 1224 of file unordered_set.h.
Referenced by std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::insert().
|
inline |
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
__n | The bucket index. |
Definition at line 1663 of file unordered_set.h.
|
inlinenoexcept |
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 1425 of file unordered_set.h.
|
inline |
Finds whether an element with the given key exists.
__x | Key of elements to be located. |
Definition at line 1559 of file unordered_set.h.
|
inline |
Finds whether an element with the given key exists.
__x | Key of elements to be located. |
Definition at line 1554 of file unordered_set.h.
|
inline |
Finds the number of elements.
__x | Element to located. |
Definition at line 1541 of file unordered_set.h.
|
inline |
Finds the number of elements.
__x | Element to located. |
Definition at line 1535 of file unordered_set.h.
|
inline |
Builds and insert an element into the unordered_multiset.
__args | Arguments used to generate an element. |
Insertion requires amortized constant time.
Definition at line 1238 of file unordered_set.h.
|
inline |
Inserts an element into the unordered_multiset.
__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. |
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 1260 of file unordered_set.h.
|
inlinenoexcept |
Returns true if the unordered_multiset is empty.
Definition at line 1168 of file unordered_set.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the unordered_multiset.
Definition at line 1207 of file unordered_set.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the unordered_multiset.
Definition at line 1203 of file unordered_set.h.
Referenced by std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::extract().
|
inline |
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
__n | The bucket index. |
Definition at line 1655 of file unordered_set.h.
|
inline |
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
__n | The bucket index. |
Definition at line 1659 of file unordered_set.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1579 of file unordered_set.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1591 of file unordered_set.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1573 of file unordered_set.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1585 of file unordered_set.h.
|
inline |
Erases elements according to the provided key.
__x | Key of element to be 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 1394 of file unordered_set.h.
|
inline |
Erases a [__first,__last) range of elements from an unordered_multiset.
__first | Iterator pointing to the start of the range to be erased. |
__last | Iterator pointing to the end of the range to be erased. |
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 1414 of file unordered_set.h.
|
inline |
Erases an element from an unordered_multiset.
__position | An iterator pointing to the element to be erased. |
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 1371 of file unordered_set.h.
|
inline |
Erases an element from an unordered_multiset.
__position | An iterator pointing to the element to be erased. |
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.
|
inline |
Extract a node.
Definition at line 1341 of file unordered_set.h.
|
inline |
Extract a node.
Definition at line 1333 of file unordered_set.h.
References std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::end().
|
inline |
Tries to locate an element in an unordered_multiset.
__x | Element to be located. |
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 1510 of file unordered_set.h.
|
inline |
Tries to locate an element in an unordered_multiset.
__x | Element to be located. |
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 1522 of file unordered_set.h.
|
inline |
Tries to locate an element in an unordered_multiset.
__x | Element to be located. |
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 1504 of file unordered_set.h.
|
inline |
Tries to locate an element in an unordered_multiset.
__x | Element to be located. |
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 1516 of file unordered_set.h.
|
inlinenoexcept |
Returns the allocator object used by the unordered_multiset.
Definition at line 1161 of file unordered_set.h.
|
inline |
Returns the hash functor object with which the unordered_multiset was constructed.
Definition at line 1480 of file unordered_set.h.
|
inline |
A template function that inserts a range of elements.
__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 1316 of file unordered_set.h.
|
inline |
Inserts an element into the unordered_multiset.
__x | Element to be inserted. |
Insertion requires amortized constant time.
Definition at line 1272 of file unordered_set.h.
|
inline |
Inserts an element into the unordered_multiset.
__hint | An iterator that serves as a hint as to where the element should be inserted. |
__x | Element to be inserted. |
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 1298 of file unordered_set.h.
|
inline |
Re-insert an extracted node.
Definition at line 1351 of file unordered_set.h.
References std::move().
|
inline |
Inserts an element into the unordered_multiset.
__hint | An iterator that serves as a hint as to where the element should be inserted. |
__x | Element to be inserted. |
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 1302 of file unordered_set.h.
References std::move().
|
inline |
Inserts a list of elements into the unordered_multiset.
__l | A std::initializer_list<value_type> of elements to be inserted. |
Complexity similar to that of the range constructor.
Definition at line 1327 of file unordered_set.h.
|
inline |
Re-insert an extracted node.
Definition at line 1346 of file unordered_set.h.
References std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::cend(), and std::move().
|
inline |
Inserts an element into the unordered_multiset.
__x | Element to be inserted. |
Insertion requires amortized constant time.
Definition at line 1276 of file unordered_set.h.
References std::move().
|
inline |
Returns the key comparison object with which the unordered_multiset was constructed.
Definition at line 1486 of file unordered_set.h.
|
inlinenoexcept |
Returns the average number of elements per bucket.
Definition at line 1671 of file unordered_set.h.
|
inlinenoexcept |
Returns the maximum number of buckets of the unordered_multiset.
Definition at line 1606 of file unordered_set.h.
|
inlinenoexcept |
Returns a positive number that the unordered_multiset tries to keep the load factor less than or equal to.
Definition at line 1677 of file unordered_set.h.
|
inline |
Change the unordered_multiset maximum load factor.
__z | The new maximum load factor. |
Definition at line 1685 of file unordered_set.h.
|
inlinenoexcept |
Returns the maximum size of the unordered_multiset.
Definition at line 1178 of file unordered_set.h.
|
inline |
Definition at line 1457 of file unordered_set.h.
|
inline |
Definition at line 1448 of file unordered_set.h.
|
inline |
Definition at line 1471 of file unordered_set.h.
|
inline |
Definition at line 1462 of file unordered_set.h.
|
default |
Copy assignment operator.
|
inline |
Unordered_multiset list assignment operator.
__l | An initializer_list. |
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 1153 of file unordered_set.h.
|
default |
Move assignment operator.
|
inline |
May rehash the unordered_multiset.
__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 1696 of file unordered_set.h.
|
inline |
Prepare the unordered_multiset for a specified number of elements.
__n | Number of elements required. |
Same as rehash(ceil(n / max_load_factor())).
Definition at line 1707 of file unordered_set.h.
|
inlinenoexcept |
Returns the size of the unordered_multiset.
Definition at line 1173 of file unordered_set.h.
|
inlinenoexcept |
Swaps data with another unordered_multiset.
__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 1438 of file unordered_set.h.
|
friend |
Definition at line 1444 of file unordered_set.h.