30 #ifndef _UNORDERED_MAP_H
31 #define _UNORDERED_MAP_H
33 namespace std _GLIBCXX_VISIBILITY(default)
35 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
41 template<
typename _Key,
48 _Alloc, __detail::_Select1st,
58 template<
typename _Key,
65 _Alloc, __detail::_Select1st,
67 __detail::_Mod_range_hashing,
68 __detail::_Default_ranged_hash,
69 __detail::_Prime_rehash_policy, _Tr>;
94 template<
class _Key,
class _Tp,
110 typedef typename _Hashtable::hasher
hasher;
143 const hasher& __hf =
hasher(),
146 : _M_h(__n, __hf, __eql, __a)
162 template<
typename _InputIterator>
165 const hasher& __hf =
hasher(),
168 : _M_h(__first, __last, __n, __hf, __eql, __a)
192 const allocator_type& __a)
193 : _M_h(__umap._M_h, __a)
202 const allocator_type& __a)
203 : _M_h(
std::
move(__umap._M_h), __a)
219 const hasher& __hf =
hasher(),
222 : _M_h(__l, __n, __hf, __eql, __a)
255 {
return _M_h.get_allocator(); }
262 {
return _M_h.empty(); }
267 {
return _M_h.size(); }
272 {
return _M_h.max_size(); }
282 {
return _M_h.begin(); }
291 {
return _M_h.begin(); }
295 {
return _M_h.begin(); }
304 {
return _M_h.end(); }
313 {
return _M_h.end(); }
317 {
return _M_h.end(); }
341 template<
typename... _Args>
344 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
371 template<
typename... _Args>
374 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
396 {
return _M_h.insert(__x); }
398 template<
typename _Pair,
typename =
typename
399 std::enable_if<std::is_constructible<
value_type,
400 _Pair&&>::value>::type>
403 {
return _M_h.insert(std::forward<_Pair>(__x)); }
429 insert(const_iterator __hint,
const value_type& __x)
430 {
return _M_h.insert(__hint, __x); }
432 template<
typename _Pair,
typename =
typename
433 std::enable_if<std::is_constructible<
value_type,
434 _Pair&&>::value>::type>
436 insert(const_iterator __hint, _Pair&& __x)
437 {
return _M_h.insert(__hint, std::forward<_Pair>(__x)); }
449 template<
typename _InputIterator>
451 insert(_InputIterator __first, _InputIterator __last)
452 { _M_h.insert(__first, __last); }
463 { _M_h.insert(__l); }
481 {
return _M_h.erase(__position); }
486 {
return _M_h.erase(__position); }
503 {
return _M_h.erase(__x); }
520 erase(const_iterator __first, const_iterator __last)
521 {
return _M_h.erase(__first, __last); }
544 noexcept( noexcept(_M_h.swap(__x._M_h)) )
545 { _M_h.swap(__x._M_h); }
553 {
return _M_h.hash_function(); }
559 {
return _M_h.key_eq(); }
577 {
return _M_h.find(__x); }
580 find(
const key_type& __x)
const
581 {
return _M_h.find(__x); }
595 {
return _M_h.count(__x); }
608 {
return _M_h.equal_range(__x); }
612 {
return _M_h.equal_range(__x); }
630 {
return _M_h[__k]; }
646 at(
const key_type& __k)
647 {
return _M_h.at(__k); }
650 at(
const key_type& __k)
const
651 {
return _M_h.at(__k); }
659 {
return _M_h.bucket_count(); }
664 {
return _M_h.max_bucket_count(); }
672 bucket_size(size_type __n)
const
673 {
return _M_h.bucket_size(__n); }
681 bucket(
const key_type& __key)
const
682 {
return _M_h.bucket(__key); }
692 {
return _M_h.begin(__n); }
703 {
return _M_h.begin(__n); }
707 {
return _M_h.cbegin(__n); }
718 {
return _M_h.end(__n); }
729 {
return _M_h.end(__n); }
733 {
return _M_h.cend(__n); }
741 {
return _M_h.load_factor(); }
747 {
return _M_h.max_load_factor(); }
755 { _M_h.max_load_factor(__z); }
766 { _M_h.rehash(__n); }
777 { _M_h.reserve(__n); }
779 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
809 template<
class _Key,
class _Tp,
810 class _Hash = hash<_Key>,
825 typedef typename _Hashtable::hasher
hasher;
858 const hasher& __hf =
hasher(),
861 : _M_h(__n, __hf, __eql, __a)
877 template<
typename _InputIterator>
880 const hasher& __hf =
hasher(),
883 : _M_h(__first, __last, __n, __hf, __eql, __a)
907 const allocator_type& __a)
908 : _M_h(__ummap._M_h, __a)
917 const allocator_type& __a)
918 : _M_h(
std::
move(__ummap._M_h), __a)
934 const hasher& __hf =
hasher(),
937 : _M_h(__l, __n, __hf, __eql, __a)
970 {
return _M_h.get_allocator(); }
977 {
return _M_h.empty(); }
982 {
return _M_h.size(); }
987 {
return _M_h.max_size(); }
997 {
return _M_h.begin(); }
1006 {
return _M_h.begin(); }
1010 {
return _M_h.begin(); }
1019 {
return _M_h.end(); }
1028 {
return _M_h.end(); }
1032 {
return _M_h.end(); }
1052 template<
typename... _Args>
1055 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
1078 template<
typename... _Args>
1081 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
1095 {
return _M_h.insert(__x); }
1097 template<
typename _Pair,
typename =
typename
1098 std::enable_if<std::is_constructible<
value_type,
1099 _Pair&&>::value>::type>
1102 {
return _M_h.insert(std::forward<_Pair>(__x)); }
1126 insert(const_iterator __hint,
const value_type& __x)
1127 {
return _M_h.insert(__hint, __x); }
1129 template<
typename _Pair,
typename =
typename
1130 std::enable_if<std::is_constructible<
value_type,
1131 _Pair&&>::value>::type>
1134 {
return _M_h.insert(__hint, std::forward<_Pair>(__x)); }
1146 template<
typename _InputIterator>
1148 insert(_InputIterator __first, _InputIterator __last)
1149 { _M_h.insert(__first, __last); }
1161 { _M_h.insert(__l); }
1179 {
return _M_h.erase(__position); }
1184 {
return _M_h.erase(__position); }
1200 {
return _M_h.erase(__x); }
1218 erase(const_iterator __first, const_iterator __last)
1219 {
return _M_h.erase(__first, __last); }
1243 noexcept( noexcept(_M_h.swap(__x._M_h)) )
1244 { _M_h.swap(__x._M_h); }
1252 {
return _M_h.hash_function(); }
1258 {
return _M_h.key_eq(); }
1276 {
return _M_h.find(__x); }
1280 {
return _M_h.find(__x); }
1290 {
return _M_h.count(__x); }
1301 {
return _M_h.equal_range(__x); }
1305 {
return _M_h.equal_range(__x); }
1313 {
return _M_h.bucket_count(); }
1318 {
return _M_h.max_bucket_count(); }
1326 bucket_size(size_type __n)
const
1327 {
return _M_h.bucket_size(__n); }
1335 bucket(
const key_type& __key)
const
1336 {
return _M_h.bucket(__key); }
1346 {
return _M_h.begin(__n); }
1355 const_local_iterator
1357 {
return _M_h.begin(__n); }
1359 const_local_iterator
1361 {
return _M_h.cbegin(__n); }
1372 {
return _M_h.end(__n); }
1381 const_local_iterator
1383 {
return _M_h.end(__n); }
1385 const_local_iterator
1387 {
return _M_h.cend(__n); }
1395 {
return _M_h.load_factor(); }
1401 {
return _M_h.max_load_factor(); }
1409 { _M_h.max_load_factor(__z); }
1420 { _M_h.rehash(__n); }
1431 { _M_h.reserve(__n); }
1433 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1437 _Hash1, _Pred1, _Alloc1>&,
1439 _Hash1, _Pred1, _Alloc1>&);
1442 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1444 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1445 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1448 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1450 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1451 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1454 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1456 operator==(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1457 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1458 {
return __x._M_h._M_equal(__y._M_h); }
1460 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1462 operator!=(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1463 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1464 {
return !(__x == __y); }
1466 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1468 operator==(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1469 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1470 {
return __x._M_h._M_equal(__y._M_h); }
1472 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1474 operator!=(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1475 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1476 {
return !(__x == __y); }
1478 _GLIBCXX_END_NAMESPACE_CONTAINER
void swap(_Tp &, _Tp &) noexcept(__and_< is_nothrow_move_constructible< _Tp >, is_nothrow_move_assignable< _Tp >>::value)
Swaps two values.
_Hashtable::key_type key_type
Public typedefs.
size_type max_size() const noexcept
Returns the maximum size of the unordered_multimap.
float load_factor() const noexcept
Returns the average number of elements per bucket.
hasher hash_function() const
Returns the hash functor object with which the unordered_multimap was constructed.
unordered_multimap & operator=(const unordered_multimap &)=default
Copy assignment operator.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
void max_load_factor(float __z)
Change the unordered_map maximum load factor.
unordered_multimap(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_multimap from an initializer_list.
size_type size() const noexcept
Returns the size of the unordered_map.
unordered_multimap(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 max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_map.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
A standard container composed of unique keys (containing at most one of each key value) that associat...
_Hashtable::iterator iterator
Iterator-related typedefs.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_multimap.
void swap(unordered_multimap &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_multimap.
_Hashtable::hasher hasher
Public typedefs.
_Hashtable::pointer pointer
Iterator-related typedefs.
const_iterator begin() const noexcept
_Hashtable::reference reference
Iterator-related typedefs.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
unordered_map()=default
Default constructor.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
unordered_map(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_map from an initializer_list.
const_iterator begin() const noexcept
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
_Hashtable::allocator_type allocator_type
Public typedefs.
iterator insert(const_iterator __hint, _Pair &&__x)
Inserts a std::pair into the unordered_multimap.
iterator begin() noexcept
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_map.
const_iterator end() const noexcept
float max_load_factor() const noexcept
Returns a positive number that the unordered_multimap tries to keep the load factor less than or equa...
size_type count(const key_type &__x) const
Finds the number of elements.
void rehash(size_type __n)
May rehash the unordered_map.
const_iterator cend() const noexcept
size_type erase(const key_type &__x)
Erases elements according to the provided key.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_multimap.
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.
void max_load_factor(float __z)
Change the unordered_multimap maximum load factor.
_Hashtable::value_type value_type
Public typedefs.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
_Hashtable::pointer pointer
Iterator-related typedefs.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
unordered_map(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 erase(const key_type &__x)
Erases elements according to the provided key.
float max_load_factor() const noexcept
Returns a positive number that the unordered_map tries to keep the load factor less than or equal to...
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_multimap.
unordered_multimap()=default
Default constructor.
_Hashtable::size_type size_type
Iterator-related typedefs.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
iterator insert(const_iterator __hint, const value_type &__x)
Inserts a std::pair into the unordered_multimap.
key_equal key_eq() const
Returns the key comparison object with which the unordered_map was constructed.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
void swap(unordered_map &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_map.
iterator emplace(_Args &&...__args)
Attempts to build and insert a std::pair into the unordered_multimap.
Primary class template hash.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
allocator_type get_allocator() const noexcept
Returns the allocator object with which the unordered_map was constructed.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_map.
const_iterator cbegin() const noexcept
std::pair< iterator, bool > emplace(_Args &&...__args)
Attempts to build and insert a std::pair into the unordered_map.
size_type size() const noexcept
Returns the size of the unordered_multimap.
_Hashtable::allocator_type allocator_type
Public typedefs.
_Hashtable::key_equal key_equal
Public typedefs.
mapped_type & operator[](const key_type &__k)
Subscript ( [] ) access to unordered_map data.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
void rehash(size_type __n)
May rehash the unordered_multimap.
iterator insert(_Pair &&__x)
Inserts a std::pair into the unordered_multimap.
unordered_map & operator=(initializer_list< value_type > __l)
Unordered_map list assignment operator.
Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load fact...
size_type count(const key_type &__x) const
Finds the number of elements.
_Hashtable::value_type value_type
Public typedefs.
iterator insert(const value_type &__x)
Inserts a std::pair into the unordered_multimap.
mapped_type & operator[](key_type &&__k)
Subscript ( [] ) access to unordered_map data.
const_iterator end() const noexcept
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
unordered_multimap(const allocator_type &__a)
Creates an unordered_multimap with no elements.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_multimap.
_Hashtable::mapped_type mapped_type
Public typedefs.
const_iterator cbegin() const noexcept
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_map.
The standard allocator, as per [20.4].
Default range hashing function: use division to fold a large number into the range [0...
iterator insert(const_iterator __hint, _Pair &&__x)
Attempts to insert a std::pair into the unordered_map.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
void reserve(size_type __n)
Prepare the unordered_multimap for a specified number of elements.
iterator erase(const_iterator __position)
Erases an element from an unordered_map.
_Hashtable::size_type size_type
Iterator-related typedefs.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
unordered_map(_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_map from a range.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_map.
iterator insert(const_iterator __hint, const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
_Hashtable::hasher hasher
Public typedefs.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
_Hashtable::reference reference
Iterator-related typedefs.
A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
iterator begin() noexcept
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
bool empty() const noexcept
Returns true if the unordered_map is empty.
const_iterator cend() const noexcept
One of the comparison functors.
_Hashtable::mapped_type mapped_type
Public typedefs.
iterator erase(iterator __position)
Erases an element from an unordered_map.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
iterator emplace_hint(const_iterator __pos, _Args &&...__args)
Attempts to build and insert a std::pair into the unordered_map.
_Hashtable::key_equal key_equal
Public typedefs.
Struct holding two objects of arbitrary type.
bool empty() const noexcept
Returns true if the unordered_multimap is empty.
unordered_map(const allocator_type &__a)
Creates an unordered_map with no elements.
iterator erase(iterator __position)
Erases an element from an unordered_multimap.
_Hashtable::key_type key_type
Public typedefs.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
hasher hash_function() const
Returns the hash functor object with which the unordered_map was constructed.
unordered_map & operator=(const unordered_map &)=default
Copy assignment operator.
std::pair< iterator, bool > insert(_Pair &&__x)
Attempts to insert a std::pair into the unordered_map.
const mapped_type & at(const key_type &__k) const
Access to unordered_map data.
key_equal key_eq() const
Returns the key comparison object with which the unordered_multimap was constructed.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_map.
float load_factor() const noexcept
Returns the average number of elements per bucket.
iterator emplace_hint(const_iterator __pos, _Args &&...__args)
Attempts to build and insert a std::pair into the unordered_multimap.
unordered_multimap & operator=(initializer_list< value_type > __l)
Unordered_multimap list assignment operator.
iterator erase(const_iterator __position)
Erases an element from an unordered_multimap.
size_type max_size() const noexcept
Returns the maximum size of the unordered_map.
allocator_type get_allocator() const noexcept
Returns the allocator object with which the unordered_multimap was constructed.
unordered_multimap(_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_multimap from a range.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_multimap.
void reserve(size_type __n)
Prepare the unordered_map for a specified number of elements.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
ISO C++ entities toplevel namespace is std.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
Default ranged hash function H. In principle it should be a function object composed from objects of ...
iterator find(const key_type &__x)
Tries to locate an element in an unordered_multimap.
_Hashtable::iterator iterator
Iterator-related typedefs.
mapped_type & at(const key_type &__k)
Access to unordered_map data.