libstdc++
|
Public Types | |
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 | |
unordered_multiset (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) | |
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 unordered_multiset &)=default | |
unordered_multiset (unordered_multiset &&)=default | |
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 (const allocator_type &__a) | |
unordered_multiset (const unordered_multiset &__umset, const allocator_type &__a) | |
unordered_multiset (unordered_multiset &&__umset, const allocator_type &__a) | |
unordered_multiset (size_type __n, const allocator_type &__a) | |
unordered_multiset (size_type __n, const hasher &__hf, 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) | |
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) | |
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 |
size_type | count (const key_type &__x) const |
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= (unordered_multiset &&)=default |
unordered_multiset & | operator= (initializer_list< value_type > __l) |
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) |
const_iterator | find (const key_type &__x) const |
std::pair< iterator, iterator > | equal_range (const key_type &__x) |
std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
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 > &) |
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 69 of file unordered_set.h.
typedef _Hashtable::allocator_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::allocator_type |
Public typedefs.
Definition at line 843 of file unordered_set.h.
typedef _Hashtable::const_iterator std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::const_iterator |
Iterator-related typedefs.
Definition at line 853 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 855 of file unordered_set.h.
typedef _Hashtable::const_pointer std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::const_pointer |
Iterator-related typedefs.
Definition at line 849 of file unordered_set.h.
typedef _Hashtable::const_reference std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::const_reference |
Iterator-related typedefs.
Definition at line 851 of file unordered_set.h.
typedef _Hashtable::difference_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::difference_type |
Iterator-related typedefs.
Definition at line 857 of file unordered_set.h.
typedef _Hashtable::hasher std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::hasher |
Public typedefs.
Definition at line 841 of file unordered_set.h.
typedef _Hashtable::iterator std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::iterator |
Iterator-related typedefs.
Definition at line 852 of file unordered_set.h.
typedef _Hashtable::key_equal std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::key_equal |
Public typedefs.
Definition at line 842 of file unordered_set.h.
typedef _Hashtable::key_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::key_type |
Public typedefs.
Definition at line 839 of file unordered_set.h.
typedef _Hashtable::local_iterator std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::local_iterator |
Iterator-related typedefs.
Definition at line 854 of file unordered_set.h.
typedef _Hashtable::pointer std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::pointer |
Iterator-related typedefs.
Definition at line 848 of file unordered_set.h.
typedef _Hashtable::reference std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::reference |
Iterator-related typedefs.
Definition at line 850 of file unordered_set.h.
typedef _Hashtable::size_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::size_type |
Iterator-related typedefs.
Definition at line 856 of file unordered_set.h.
typedef _Hashtable::value_type std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::value_type |
Public typedefs.
Definition at line 840 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 877 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 898 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 923 of file unordered_set.h.
References std::unordered_set< _Value, _Hash, _Pred, _Alloc >::operator=().
|
inlineexplicit |
Creates an unordered_multiset with no elements.
__a | An allocator object. |
Definition at line 944 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 1051 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 1055 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 1437 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 1441 of file unordered_set.h.
|
inlinenoexcept |
Returns the number of buckets of the unordered_multiset.
Definition at line 1403 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 1078 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 1445 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 1086 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 1465 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 1287 of file unordered_set.h.
|
inline |
Finds the number of elements.
__x | Element to located. |
Definition at line 1380 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 1100 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 1122 of file unordered_set.h.
|
inlinenoexcept |
Returns true if the unordered_multiset is empty.
Definition at line 1030 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 1065 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 1069 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 1457 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 1461 of file unordered_set.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1391 of file unordered_set.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1395 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 1233 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 1238 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 1256 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 1276 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 1366 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 1370 of file unordered_set.h.
|
inlinenoexcept |
Returns the allocator object used by the unordered_multiset.
Definition at line 1023 of file unordered_set.h.
|
inline |
Returns the hash functor object with which the unordered_multiset was constructed.
Definition at line 1342 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 1134 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 1138 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 1160 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 1164 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 1178 of file unordered_set.h.
|
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 1189 of file unordered_set.h.
References std::unordered_set< _Value, _Hash, _Pred, _Alloc >::cend(), std::unordered_set< _Value, _Hash, _Pred, _Alloc >::end(), and std::unordered_set< _Value, _Hash, _Pred, _Alloc >::insert().
|
inline |
Returns the key comparison object with which the unordered_multiset was constructed.
Definition at line 1348 of file unordered_set.h.
|
inlinenoexcept |
Returns the average number of elements per bucket.
Definition at line 1473 of file unordered_set.h.
|
inlinenoexcept |
Returns the maximum number of buckets of the unordered_multiset.
Definition at line 1408 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 1479 of file unordered_set.h.
|
inline |
Change the unordered_multiset maximum load factor.
__z | The new maximum load factor. |
Definition at line 1487 of file unordered_set.h.
|
inlinenoexcept |
Returns the maximum size of the unordered_multiset.
Definition at line 1040 of file unordered_set.h.
|
default |
Copy assignment operator.
|
default |
Move 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 1015 of file unordered_set.h.
|
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 1498 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 1509 of file unordered_set.h.
References std::unordered_set< _Value, _Hash, _Pred, _Alloc >::swap(), and std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::swap().
|
inlinenoexcept |
Returns the size of the unordered_multiset.
Definition at line 1035 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 1300 of file unordered_set.h.
Referenced by std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >::reserve().