|
| | unordered_set ()=default |
| template<typename _InputIterator> |
| | unordered_set (_InputIterator __first, _InputIterator __last, const allocator_type &__a) |
| template<typename _InputIterator> |
| | unordered_set (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a) |
| template<typename _InputIterator> |
| | unordered_set (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a) |
| template<typename _InputIterator> |
| | unordered_set (_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_set (const allocator_type &__a) |
| | unordered_set (const unordered_set &)=default |
| | unordered_set (const unordered_set &__uset, const allocator_type &__a) |
| | unordered_set (initializer_list< value_type > __l, const allocator_type &__a) |
| | unordered_set (initializer_list< value_type > __l, size_type __n, const allocator_type &__a) |
| | unordered_set (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a) |
| | unordered_set (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_set (size_type __n, const allocator_type &__a) |
| | unordered_set (size_type __n, const hasher &__hf, const allocator_type &__a) |
| | unordered_set (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
| | unordered_set (unordered_set &&)=default |
| | unordered_set (unordered_set &&__uset, const allocator_type &__a) noexcept(noexcept(_Hashtable(std::move(__uset._M_h), __a))) |
| 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> |
| std::pair< iterator, bool > | emplace (_Args &&... __args) |
| template<typename... _Args> |
| iterator | emplace_hint (const_iterator __pos, _Args &&... __args) |
| bool | empty () const noexcept |
| template<__heterogeneous_hash_key< unordered_set > _Kt> |
| size_type | erase (_Kt &&__x) |
| 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_set & | operator= (const unordered_set &)=default |
| unordered_set & | operator= (initializer_list< value_type > __l) |
| unordered_set & | operator= (unordered_set &&)=default |
| void | rehash (size_type __n) |
| void | reserve (size_type __n) |
| size_type | size () const noexcept |
| void | swap (unordered_set &__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 |
| std::pair< iterator, bool > | insert (const value_type &__x) |
| std::pair< iterator, bool > | insert (value_type &&__x) |
| template<__heterogeneous_hash_key< unordered_set > _Kt> |
| std::pair< iterator, bool > | insert (_Kt &&__x) |
| iterator | insert (const_iterator __hint, const value_type &__x) |
| iterator | insert (const_iterator __hint, value_type &&__x) |
| template<__heterogeneous_hash_key< unordered_set > _Kt> |
| iterator | insert (const_iterator, _Kt &&__x) |
| iterator | erase (const_iterator __position) |
| iterator | erase (iterator __position) |
| iterator | find (const key_type &__x) |
| const_iterator | find (const key_type &__x) const |
| size_type | count (const key_type &__x) const |
| 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) |
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
| size_type | bucket (const key_type &__key) const |
| template<__heterogeneous_hash_key< unordered_set > _Kt> |
| size_type | bucket (const _Kt &__key) 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 |
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
class std::unordered_set< _Value, _Hash, _Pred, _Alloc >
A standard container composed of unique keys (containing at most one 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 __uset_hashtable.
Definition at line 107 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_set 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_set consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)).
Definition at line 176 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename... _Args>
Attempts to build and insert an element into the unordered_set.
- Parameters
-
| __args | Arguments used to generate an element. |
- Returns
- A pair, of which the first element is an iterator that points to the possibly inserted element, and the second is a bool that is true if the element was actually inserted.
This function attempts to build and insert an element into the unordered_set. An unordered_set relies on unique keys and thus an element is only inserted if it is not already present in the unordered_set.
Insertion requires amortized constant time.
Definition at line 446 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
template<typename... _Args>
Attempts to insert an element into the unordered_set.
- 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 element with key equivalent to the one generated from __args (may or may not be the element itself).
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument emplace() does. 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 472 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_set. For an unordered_set the result of this function can only be 0 (not present) or 1 (present). 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 653 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_set.
- 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_set. 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 678 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_set.
- 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_set. 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 631 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_set.
- 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_set. 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 636 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_set< _Value, _Hash, _Pred, _Alloc >::insert |
( |
_InputIterator | __first, |
|
|
_InputIterator | __last ) |
|
inline |
A template function that attempts to insert 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 552 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Attempts to insert an element into the unordered_set.
- Parameters
-
| __x | Element to be inserted. |
- Returns
- A pair, of which the first element is an iterator that points to the possibly inserted element, and the second is a bool that is true if the element was actually inserted.
This function attempts to insert an element into the unordered_set. An unordered_set relies on unique keys and thus an element is only inserted if it is not already present in the unordered_set.
Insertion requires amortized constant time.
Definition at line 500 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Attempts to insert an element into the unordered_set.
- Parameters
-
| __x | Element to be inserted. |
- Returns
- A pair, of which the first element is an iterator that points to the possibly inserted element, and the second is a bool that is true if the element was actually inserted.
This function attempts to insert an element into the unordered_set. An unordered_set relies on unique keys and thus an element is only inserted if it is not already present in the unordered_set.
Insertion requires amortized constant time.
Definition at line 490 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Attempts to insert an element into the unordered_set.
- 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 element with key of __x (may or may not be the element passed in).
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does. 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 526 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Attempts to insert an element into the unordered_set.
- 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 element with key of __x (may or may not be the element passed in).
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does. 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 530 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Attempts to insert an element into the unordered_set.
- 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 element with key of __x (may or may not be the element passed in).
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does. 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 536 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Attempts to insert an element into the unordered_set.
- Parameters
-
| __x | Element to be inserted. |
- Returns
- A pair, of which the first element is an iterator that points to the possibly inserted element, and the second is a bool that is true if the element was actually inserted.
This function attempts to insert an element into the unordered_set. An unordered_set relies on unique keys and thus an element is only inserted if it is not already present in the unordered_set.
Insertion requires amortized constant time.
Definition at line 494 of file unordered_set.h.
template<typename _Value, typename _Hash = hash<_Value>, typename _Pred = equal_to<_Value>, typename _Alloc = allocator<_Value>>
Unordered_set list assignment operator.
- Parameters
-
This function fills an unordered_set with copies of the elements in the initializer list __l.
Note that the assignment completely changes the unordered_set and that the resulting unordered_set's size is the same as the number of elements assigned.
Definition at line 353 of file unordered_set.h.
1.15.0