30 #ifndef _UNORDERED_SET_H
31 #define _UNORDERED_SET_H
33 namespace std _GLIBCXX_VISIBILITY(default)
35 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
41 template<
typename _Value,
47 __detail::_Identity, _Pred, _Hash,
56 template<
typename _Value,
64 __detail::_Mod_range_hashing,
65 __detail::_Default_ranged_hash,
66 __detail::_Prime_rehash_policy, _Tr>;
89 template<
class _Value,
104 typedef typename _Hashtable::hasher
hasher;
137 const hasher& __hf =
hasher(),
140 : _M_h(__n, __hf, __eql, __a)
156 template<
typename _InputIterator>
159 const hasher& __hf =
hasher(),
162 : _M_h(__first, __last, __n, __hf, __eql, __a)
186 const allocator_type& __a)
187 : _M_h(__uset._M_h, __a)
196 const allocator_type& __a)
197 : _M_h(
std::
move(__uset._M_h), __a)
213 const hasher& __hf =
hasher(),
216 : _M_h(__l, __n, __hf, __eql, __a)
249 {
return _M_h.get_allocator(); }
256 {
return _M_h.empty(); }
261 {
return _M_h.size(); }
266 {
return _M_h.max_size(); }
277 {
return _M_h.begin(); }
281 {
return _M_h.begin(); }
291 {
return _M_h.end(); }
295 {
return _M_h.end(); }
304 {
return _M_h.begin(); }
312 {
return _M_h.end(); }
331 template<
typename... _Args>
334 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
357 template<
typename... _Args>
360 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
378 {
return _M_h.insert(__x); }
406 insert(const_iterator __hint,
const value_type& __x)
407 {
return _M_h.insert(__hint, __x); }
410 insert(const_iterator __hint, value_type&& __x)
411 {
return _M_h.insert(__hint,
std::move(__x)); }
423 template<
typename _InputIterator>
425 insert(_InputIterator __first, _InputIterator __last)
426 { _M_h.insert(__first, __last); }
437 { _M_h.insert(__l); }
455 {
return _M_h.erase(__position); }
460 {
return _M_h.erase(__position); }
477 {
return _M_h.erase(__x); }
494 erase(const_iterator __first, const_iterator __last)
495 {
return _M_h.erase(__first, __last); }
518 noexcept( noexcept(_M_h.swap(__x._M_h)) )
519 { _M_h.swap(__x._M_h); }
527 {
return _M_h.hash_function(); }
533 {
return _M_h.key_eq(); }
551 {
return _M_h.find(__x); }
554 find(
const key_type& __x)
const
555 {
return _M_h.find(__x); }
569 {
return _M_h.count(__x); }
582 {
return _M_h.equal_range(__x); }
586 {
return _M_h.equal_range(__x); }
594 {
return _M_h.bucket_count(); }
599 {
return _M_h.max_bucket_count(); }
607 bucket_size(size_type __n)
const
608 {
return _M_h.bucket_size(__n); }
616 bucket(
const key_type& __key)
const
617 {
return _M_h.bucket(__key); }
628 {
return _M_h.begin(__n); }
632 {
return _M_h.begin(__n); }
636 {
return _M_h.cbegin(__n); }
648 {
return _M_h.end(__n); }
652 {
return _M_h.end(__n); }
656 {
return _M_h.cend(__n); }
664 {
return _M_h.load_factor(); }
670 {
return _M_h.max_load_factor(); }
678 { _M_h.max_load_factor(__z); }
689 { _M_h.rehash(__n); }
700 { _M_h.reserve(__n); }
702 template<
typename _Value1,
typename _Hash1,
typename _Pred1,
728 template<
class _Value,
729 class _Hash = hash<_Value>,
743 typedef typename _Hashtable::hasher
hasher;
776 const hasher& __hf =
hasher(),
779 : _M_h(__n, __hf, __eql, __a)
795 template<
typename _InputIterator>
798 const hasher& __hf =
hasher(),
801 : _M_h(__first, __last, __n, __hf, __eql, __a)
823 const hasher& __hf =
hasher(),
826 : _M_h(__l, __n, __hf, __eql, __a)
852 const allocator_type& __a)
853 : _M_h(__umset._M_h, __a)
862 const allocator_type& __a)
863 : _M_h(
std::
move(__umset._M_h), __a)
888 {
return _M_h.get_allocator(); }
895 {
return _M_h.empty(); }
900 {
return _M_h.size(); }
905 {
return _M_h.max_size(); }
916 {
return _M_h.begin(); }
920 {
return _M_h.begin(); }
930 {
return _M_h.end(); }
934 {
return _M_h.end(); }
943 {
return _M_h.begin(); }
951 {
return _M_h.end(); }
962 template<
typename... _Args>
965 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
984 template<
typename... _Args>
987 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
999 {
return _M_h.insert(__x); }
1024 insert(const_iterator __hint,
const value_type& __x)
1025 {
return _M_h.insert(__hint, __x); }
1028 insert(const_iterator __hint, value_type&& __x)
1029 {
return _M_h.insert(__hint,
std::move(__x)); }
1040 template<
typename _InputIterator>
1042 insert(_InputIterator __first, _InputIterator __last)
1043 { _M_h.insert(__first, __last); }
1054 { _M_h.insert(__l); }
1073 {
return _M_h.erase(__position); }
1078 {
return _M_h.erase(__position); }
1096 {
return _M_h.erase(__x); }
1115 erase(const_iterator __first, const_iterator __last)
1116 {
return _M_h.erase(__first, __last); }
1140 noexcept( noexcept(_M_h.swap(__x._M_h)) )
1141 { _M_h.swap(__x._M_h); }
1149 {
return _M_h.hash_function(); }
1155 {
return _M_h.key_eq(); }
1173 {
return _M_h.find(__x); }
1177 {
return _M_h.find(__x); }
1187 {
return _M_h.count(__x); }
1198 {
return _M_h.equal_range(__x); }
1202 {
return _M_h.equal_range(__x); }
1210 {
return _M_h.bucket_count(); }
1215 {
return _M_h.max_bucket_count(); }
1223 bucket_size(size_type __n)
const
1224 {
return _M_h.bucket_size(__n); }
1232 bucket(
const key_type& __key)
const
1233 {
return _M_h.bucket(__key); }
1244 {
return _M_h.begin(__n); }
1246 const_local_iterator
1248 {
return _M_h.begin(__n); }
1250 const_local_iterator
1252 {
return _M_h.cbegin(__n); }
1264 {
return _M_h.end(__n); }
1266 const_local_iterator
1268 {
return _M_h.end(__n); }
1270 const_local_iterator
1272 {
return _M_h.cend(__n); }
1280 {
return _M_h.load_factor(); }
1286 {
return _M_h.max_load_factor(); }
1294 { _M_h.max_load_factor(__z); }
1305 { _M_h.rehash(__n); }
1316 { _M_h.reserve(__n); }
1318 template<
typename _Value1,
typename _Hash1,
typename _Pred1,
1325 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1327 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1328 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1331 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1333 swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1334 unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1337 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1339 operator==(
const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1340 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1341 {
return __x._M_h._M_equal(__y._M_h); }
1343 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1345 operator!=(
const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1346 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1347 {
return !(__x == __y); }
1349 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1351 operator==(
const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1352 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1353 {
return __x._M_h._M_equal(__y._M_h); }
1355 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1357 operator!=(
const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1358 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1359 {
return !(__x == __y); }
1361 _GLIBCXX_END_NAMESPACE_CONTAINER
void swap(_Tp &, _Tp &) noexcept(__and_< is_nothrow_move_constructible< _Tp >, is_nothrow_move_assignable< _Tp >>::value)
Swaps two values.
iterator insert(const value_type &__x)
Inserts an element into the unordered_multiset.
size_type max_size() const noexcept
Returns the maximum size of the unordered_multiset.
iterator insert(const_iterator __hint, value_type &&__x)
Attempts to insert an element into the unordered_set.
void max_load_factor(float __z)
Change the unordered_multiset maximum load factor.
iterator insert(const_iterator __hint, value_type &&__x)
Inserts an element into the unordered_multiset.
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())
Builds an unordered_multiset from a range.
_Hashtable::reference reference
Iterator-related typedefs.
size_type count(const key_type &__x) const
Finds the number of elements.
unordered_set()=default
Default constructor.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_set.
local_iterator begin(size_type __n)
Returns a read-only (constant) iterator pointing to the first bucket element.
iterator begin() noexcept
allocator_type get_allocator() const noexcept
Returns the allocator object with which the unordered_set was constructed.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_multiset.
_Hashtable::pointer pointer
Iterator-related typedefs.
_Hashtable::size_type size_type
Iterator-related typedefs.
const_iterator cbegin() const noexcept
unordered_multiset(const allocator_type &__a)
Creates an unordered_multiset with no elements.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_set.
const_iterator begin() const noexcept
iterator erase(iterator __position)
Erases an element from an unordered_multiset.
const_iterator cend() const noexcept
iterator insert(const_iterator __hint, const value_type &__x)
Attempts to insert an element into the unordered_set.
_Hashtable::hasher hasher
Public typedefs.
float load_factor() const noexcept
Returns the average number of elements per bucket.
bool empty() const noexcept
Returns true if the unordered_set is empty.
local_iterator end(size_type __n)
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
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())
Builds an unordered_multiset from an initializer_list.
local_iterator end(size_type __n)
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
_Hashtable::key_equal key_equal
Public typedefs.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
iterator erase(iterator __position)
Erases an element from an unordered_set.
_Hashtable::reference reference
Iterator-related typedefs.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_set.
const_iterator cend() const noexcept
local_iterator begin(size_type __n)
Returns a read-only (constant) iterator pointing to the first bucket element.
unordered_multiset(size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
Default constructor creates no elements.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
_Hashtable::hasher hasher
Public typedefs.
void insert(initializer_list< value_type > __l)
Inserts a list of elements into the unordered_multiset.
_Hashtable::pointer pointer
Iterator-related typedefs.
iterator emplace_hint(const_iterator __pos, _Args &&...__args)
Inserts an element into the unordered_multiset.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_set.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
_Hashtable::size_type size_type
Iterator-related typedefs.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_set.
_Hashtable::iterator iterator
Iterator-related typedefs.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
Primary class template hash.
std::pair< iterator, bool > insert(value_type &&__x)
Attempts to insert an element into the unordered_set.
_Hashtable::key_equal key_equal
Public typedefs.
void swap(unordered_set &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_set.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
size_type count(const key_type &__x) const
Finds the number of elements.
iterator emplace_hint(const_iterator __pos, _Args &&...__args)
Attempts to insert an element into the unordered_set.
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())
Builds an unordered_set from a range.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_multiset.
size_type size() const noexcept
Returns the size of the unordered_set.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_multiset.
float max_load_factor() const noexcept
Returns a positive number that the unordered_set tries to keep the load factor less than or equal to...
_Hashtable::key_type key_type
Public typedefs.
A standard container composed of equivalent keys (possibly containing multiple of each key value) in ...
size_type max_size() const noexcept
Returns the maximum size of the unordered_set.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
const_iterator end() const noexcept
Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load fact...
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
key_equal key_eq() const
Returns the key comparison object with which the unordered_set was constructed.
iterator insert(const_iterator __hint, const value_type &__x)
Inserts an element into the unordered_multiset.
std::pair< iterator, bool > emplace(_Args &&...__args)
Attempts to build and insert an element into the unordered_set.
unordered_set(size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
Default constructor creates no elements.
size_type size() const noexcept
Returns the size of the unordered_multiset.
void swap(unordered_multiset &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_multiset.
void reserve(size_type __n)
Prepare the unordered_set for a specified number of elements.
The standard allocator, as per [20.4].
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
Default range hashing function: use division to fold a large number into the range [0...
iterator erase(const_iterator __position)
Erases an element from an unordered_set.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
unordered_multiset & operator=(initializer_list< value_type > __l)
Unordered_multiset list assignment operator.
hasher hash_function() const
Returns the hash functor object with which the unordered_set was constructed.
const_iterator begin() const noexcept
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_set.
_Hashtable::iterator iterator
Iterator-related typedefs.
iterator erase(const_iterator __position)
Erases an element from an unordered_multiset.
float load_factor() const noexcept
Returns the average number of elements per bucket.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
A standard container composed of unique keys (containing at most one of each key value) in which the ...
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
_Hashtable::key_type key_type
Public typedefs.
const_iterator cbegin() const noexcept
_Hashtable::allocator_type allocator_type
Public typedefs.
unordered_set & operator=(initializer_list< value_type > __l)
Unordered_set list assignment operator.
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())
Builds an unordered_set from an initializer_list.
One of the comparison functors.
void reserve(size_type __n)
Prepare the unordered_multiset for a specified number of elements.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
key_equal key_eq() const
Returns the key comparison object with which the unordered_multiset was constructed.
Struct holding two objects of arbitrary type.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_multiset.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
unordered_set & operator=(const unordered_set &)=default
Copy assignment operator.
const_iterator end() const noexcept
allocator_type get_allocator() const noexcept
Returns the allocator object with which the unordered_multiset was constructed.
unordered_multiset()=default
Default constructor.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_multiset.
iterator begin() noexcept
iterator emplace(_Args &&...__args)
Builds and insert an element into the unordered_multiset.
unordered_multiset & operator=(const unordered_multiset &)=default
Copy assignment operator.
_Hashtable::value_type value_type
Public typedefs.
bool empty() const noexcept
Returns true if the unordered_multiset is empty.
_Hashtable::value_type value_type
Public typedefs.
void insert(_InputIterator __first, _InputIterator __last)
A template function that inserts a range of elements.
unordered_set(const allocator_type &__a)
Creates an unordered_set with no elements.
void rehash(size_type __n)
May rehash the unordered_multiset.
_Hashtable::allocator_type allocator_type
Public typedefs.
ISO C++ entities toplevel namespace is std.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
hasher hash_function() const
Returns the hash functor object with which the unordered_multiset was constructed.
Default ranged hash function H. In principle it should be a function object composed from objects of ...
void rehash(size_type __n)
May rehash the unordered_set.
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert an element into the unordered_set.
void max_load_factor(float __z)
Change the unordered_set maximum load factor.
float max_load_factor() const noexcept
Returns a positive number that the unordered_multiset tries to keep the load factor less than or equa...
iterator insert(value_type &&__x)
Inserts an element into the unordered_multiset.