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,
94 template<
class _Key,
class _Tp,
110 typedef typename _Hashtable::hasher
hasher;
146 : _M_h(__n, __hf, __eql, __a)
162 template<
typename _InputIterator>
168 : _M_h(__first, __last, __n, __hf, __eql, __a)
193 : _M_h(__umap._M_h, __a)
203 : _M_h(std::move(__umap._M_h), __a)
222 : _M_h(__l, __n, __hf, __eql, __a)
234 template<
typename _InputIterator>
241 template<
typename _InputIterator>
290 {
return _M_h.get_allocator(); }
297 {
return _M_h.empty(); }
302 {
return _M_h.size(); }
307 {
return _M_h.max_size(); }
317 {
return _M_h.begin(); }
326 {
return _M_h.begin(); }
330 {
return _M_h.begin(); }
339 {
return _M_h.end(); }
348 {
return _M_h.end(); }
352 {
return _M_h.end(); }
377 template<
typename... _Args>
380 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
408 template<
typename... _Args>
411 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
414 #if __cplusplus > 201402L
415 #define __cpp_lib_unordered_map_try_emplace 201411
438 template <
typename... _Args>
440 try_emplace(
const key_type& __k, _Args&&... __args)
446 std::forward_as_tuple(__k),
447 std::forward_as_tuple(
448 std::forward<_Args>(__args)...))
456 template <
typename... _Args>
458 try_emplace(
key_type&& __k, _Args&&... __args)
464 std::forward_as_tuple(std::move(__k)),
465 std::forward_as_tuple(
466 std::forward<_Args>(__args)...))
501 template <
typename... _Args>
509 std::forward_as_tuple(__k),
510 std::forward_as_tuple(
511 std::forward<_Args>(__args)...));
516 template <
typename... _Args>
523 std::forward_as_tuple(std::move(__k)),
524 std::forward_as_tuple(
525 std::forward<_Args>(__args)...));
550 {
return _M_h.insert(__x); }
552 template<
typename _Pair,
typename =
typename
553 std::enable_if<std::is_constructible<
value_type,
554 _Pair&&>::value>::type>
557 {
return _M_h.insert(std::forward<_Pair>(__x)); }
584 {
return _M_h.insert(__hint, __x); }
586 template<
typename _Pair,
typename =
typename
587 std::enable_if<std::is_constructible<
value_type,
588 _Pair&&>::value>::type>
591 {
return _M_h.insert(__hint, std::forward<_Pair>(__x)); }
603 template<
typename _InputIterator>
605 insert(_InputIterator __first, _InputIterator __last)
606 { _M_h.insert(__first, __last); }
617 { _M_h.insert(__l); }
620 #if __cplusplus > 201402L
621 #define __cpp_lib_unordered_map_insertion 201411
642 template <
typename _Obj>
644 insert_or_assign(
const key_type& __k, _Obj&& __obj)
650 std::forward_as_tuple(__k),
651 std::forward_as_tuple(std::forward<_Obj>(__obj)))
655 (*__i).second = std::forward<_Obj>(__obj);
660 template <
typename _Obj>
662 insert_or_assign(
key_type&& __k, _Obj&& __obj)
668 std::forward_as_tuple(std::move(__k)),
669 std::forward_as_tuple(std::forward<_Obj>(__obj)))
673 (*__i).second = std::forward<_Obj>(__obj);
703 template <
typename _Obj>
712 std::forward_as_tuple(__k),
713 std::forward_as_tuple(
714 std::forward<_Obj>(__obj)));
716 (*__i).second = std::forward<_Obj>(__obj);
721 template <
typename _Obj>
729 std::forward_as_tuple(std::move(__k)),
730 std::forward_as_tuple(
731 std::forward<_Obj>(__obj)));
733 (*__i).second = std::forward<_Obj>(__obj);
754 {
return _M_h.erase(__position); }
759 {
return _M_h.erase(__position); }
776 {
return _M_h.erase(__x); }
794 {
return _M_h.erase(__first, __last); }
819 { _M_h.swap(__x._M_h); }
827 {
return _M_h.hash_function(); }
833 {
return _M_h.key_eq(); }
851 {
return _M_h.find(__x); }
855 {
return _M_h.find(__x); }
869 {
return _M_h.count(__x); }
882 {
return _M_h.equal_range(__x); }
886 {
return _M_h.equal_range(__x); }
904 {
return _M_h[__k]; }
908 {
return _M_h[std::move(__k)]; }
921 {
return _M_h.at(__k); }
925 {
return _M_h.at(__k); }
933 {
return _M_h.bucket_count(); }
938 {
return _M_h.max_bucket_count(); }
947 {
return _M_h.bucket_size(__n); }
956 {
return _M_h.bucket(__key); }
966 {
return _M_h.begin(__n); }
977 {
return _M_h.begin(__n); }
981 {
return _M_h.cbegin(__n); }
992 {
return _M_h.end(__n); }
1003 {
return _M_h.end(__n); }
1007 {
return _M_h.cend(__n); }
1015 {
return _M_h.load_factor(); }
1021 {
return _M_h.max_load_factor(); }
1029 { _M_h.max_load_factor(__z); }
1040 { _M_h.rehash(__n); }
1051 { _M_h.reserve(__n); }
1053 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1083 template<
class _Key,
class _Tp,
1084 class _Hash = hash<_Key>,
1135 : _M_h(__n, __hf, __eql, __a)
1151 template<
typename _InputIterator>
1157 : _M_h(__first, __last, __n, __hf, __eql, __a)
1182 : _M_h(__ummap._M_h, __a)
1192 : _M_h(std::move(__ummap._M_h), __a)
1211 : _M_h(__l, __n, __hf, __eql, __a)
1223 template<
typename _InputIterator>
1230 template<
typename _InputIterator>
1279 {
return _M_h.get_allocator(); }
1286 {
return _M_h.empty(); }
1291 {
return _M_h.size(); }
1296 {
return _M_h.max_size(); }
1306 {
return _M_h.begin(); }
1315 {
return _M_h.begin(); }
1319 {
return _M_h.begin(); }
1328 {
return _M_h.end(); }
1337 {
return _M_h.end(); }
1341 {
return _M_h.end(); }
1361 template<
typename... _Args>
1364 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
1388 template<
typename... _Args>
1391 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
1405 {
return _M_h.insert(__x); }
1407 template<
typename _Pair,
typename =
typename
1408 std::enable_if<std::is_constructible<
value_type,
1409 _Pair&&>::value>::type>
1412 {
return _M_h.insert(std::forward<_Pair>(__x)); }
1437 {
return _M_h.insert(__hint, __x); }
1439 template<
typename _Pair,
typename =
typename
1440 std::enable_if<std::is_constructible<
value_type,
1441 _Pair&&>::value>::type>
1444 {
return _M_h.insert(__hint, std::forward<_Pair>(__x)); }
1456 template<
typename _InputIterator>
1458 insert(_InputIterator __first, _InputIterator __last)
1459 { _M_h.insert(__first, __last); }
1471 { _M_h.insert(__l); }
1489 {
return _M_h.erase(__position); }
1494 {
return _M_h.erase(__position); }
1510 {
return _M_h.erase(__x); }
1529 {
return _M_h.erase(__first, __last); }
1554 { _M_h.swap(__x._M_h); }
1562 {
return _M_h.hash_function(); }
1568 {
return _M_h.key_eq(); }
1586 {
return _M_h.find(__x); }
1590 {
return _M_h.find(__x); }
1600 {
return _M_h.count(__x); }
1611 {
return _M_h.equal_range(__x); }
1615 {
return _M_h.equal_range(__x); }
1623 {
return _M_h.bucket_count(); }
1628 {
return _M_h.max_bucket_count(); }
1637 {
return _M_h.bucket_size(__n); }
1645 bucket(
const key_type& __key)
const
1646 {
return _M_h.bucket(__key); }
1656 {
return _M_h.begin(__n); }
1667 {
return _M_h.begin(__n); }
1671 {
return _M_h.cbegin(__n); }
1682 {
return _M_h.end(__n); }
1693 {
return _M_h.end(__n); }
1697 {
return _M_h.cend(__n); }
1705 {
return _M_h.load_factor(); }
1711 {
return _M_h.max_load_factor(); }
1719 { _M_h.max_load_factor(__z); }
1730 { _M_h.rehash(__n); }
1741 { _M_h.reserve(__n); }
1743 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1747 _Hash1, _Pred1, _Alloc1>&,
1749 _Hash1, _Pred1, _Alloc1>&);
1752 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1754 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1755 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1756 noexcept(noexcept(__x.swap(__y)))
1759 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1761 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1762 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1763 noexcept(noexcept(__x.swap(__y)))
1766 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1768 operator==(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1769 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1770 {
return __x._M_h._M_equal(__y._M_h); }
1772 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1774 operator!=(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1775 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1776 {
return !(__x == __y); }
1778 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1780 operator==(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1781 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1782 {
return __x._M_h._M_equal(__y._M_h); }
1784 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1786 operator!=(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1787 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1788 {
return !(__x == __y); }
1790 _GLIBCXX_END_NAMESPACE_CONTAINER
unordered_multimap()=default
Default constructor.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_multimap.
unordered_multimap & operator=(initializer_list< value_type > __l)
Unordered_multimap list assignment operator.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_multimap.
float load_factor() const noexcept
Returns the average number of elements per bucket.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
iterator insert(const_iterator __hint, _Pair &&__x)
Inserts a std::pair into the unordered_multimap.
iterator insert(const_iterator __hint, _Pair &&__x)
Attempts to insert a std::pair into the unordered_map.
_Hashtable::value_type value_type
Public typedefs.
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...
unordered_map & operator=(const unordered_map &)=default
Copy assignment operator.
const mapped_type & at(const key_type &__k) const
Access to unordered_map data.
void reserve(size_type __n)
Prepare the unordered_map for a specified number of elements.
unordered_multimap & operator=(const unordered_multimap &)=default
Copy assignment operator.
iterator erase(const_iterator __position)
Erases an element from an unordered_multimap.
unordered_map()=default
Default constructor.
iterator emplace_hint(const_iterator __pos, _Args &&...__args)
Attempts to build and insert a std::pair into the unordered_multimap.
unordered_map & operator=(initializer_list< value_type > __l)
Unordered_map list assignment operator.
iterator emplace_hint(const_iterator __pos, _Args &&...__args)
Attempts to build and insert a std::pair into the unordered_map.
hasher hash_function() const
Returns the hash functor object with which the unordered_map was constructed.
const_iterator cend() const noexcept
Default ranged hash function H. In principle it should be a function object composed from objects of ...
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.
_Hashtable::allocator_type allocator_type
Public typedefs.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
hasher hash_function() const
Returns the hash functor object with which the unordered_multimap was constructed.
key_equal key_eq() const
Returns the key comparison object with which the unordered_multimap was constructed.
_Hashtable::key_equal key_equal
Public typedefs.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_map.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...
void noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_multimap.
void max_load_factor(float __z)
Change the unordered_multimap maximum load factor.
mapped_type & operator[](key_type &&__k)
Subscript ( [] ) access to unordered_map data.
_Hashtable::iterator iterator
Iterator-related typedefs.
allocator_type get_allocator() const noexcept
Returns the allocator object with which the unordered_map was constructed.
Primary class template hash.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_multimap.
mapped_type & at(const key_type &__k)
Access to unordered_map data.
size_type count(const key_type &__x) const
Finds the number of elements.
size_type size() const noexcept
Returns the size of the unordered_multimap.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
size_type size() const noexcept
Returns the size of the unordered_map.
_Hashtable::size_type size_type
Iterator-related typedefs.
const_local_iterator cbegin(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_multimap.
iterator emplace(_Args &&...__args)
Attempts to build and insert a std::pair into the unordered_multimap.
The standard allocator, as per [20.4].
iterator insert(const_iterator __hint, const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
void swap(basic_filebuf< _CharT, _Traits > &__x, basic_filebuf< _CharT, _Traits > &__y)
Swap specialization for filebufs.
_Hashtable::iterator iterator
Iterator-related typedefs.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_multimap.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
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.
_Hashtable::hasher hasher
Public typedefs.
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.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
bool empty() const noexcept
Returns true if the unordered_map is empty.
iterator erase(iterator __position)
Erases an element from an unordered_map.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_map.
const_iterator begin() const noexcept
size_type erase(const key_type &__x)
Erases elements according to the provided key.
float load_factor() const noexcept
Returns the average number of elements per bucket.
void max_load_factor(float __z)
Change the unordered_map maximum load factor.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_multimap.
iterator insert(const value_type &__x)
Inserts a std::pair into the unordered_multimap.
const_iterator end() const noexcept
std::pair< iterator, bool > insert(_Pair &&__x)
Attempts to insert a std::pair into the unordered_map.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_map.
void rehash(size_type __n)
May rehash the unordered_multimap.
float max_load_factor() const noexcept
Returns a positive number that the unordered_multimap tries to keep the load factor less than or equa...
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_map.
void noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_map.
const_iterator cbegin() const noexcept
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
_Hashtable::pointer pointer
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(const allocator_type &__a)
Creates an unordered_map with no elements.
iterator insert(_Pair &&__x)
Inserts a std::pair into the unordered_multimap.
size_type max_size() const noexcept
Returns the maximum size of the unordered_map.
_Hashtable::mapped_type mapped_type
Public typedefs.
iterator begin() noexcept
_Hashtable::hasher hasher
Public typedefs.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
A standard container composed of unique keys (containing at most one of each key value) that associat...
_Hashtable::value_type value_type
Public typedefs.
Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load fact...
One of the comparison functors.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
_Hashtable::key_equal key_equal
Public typedefs.
iterator erase(const_iterator __position)
Erases an element from an unordered_map.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
_Hashtable::key_type key_type
Public typedefs.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_map.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
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.
void reserve(size_type __n)
Prepare the unordered_multimap for a specified number of elements.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
allocator_type get_allocator() const noexcept
Returns the allocator object with which the unordered_multimap was constructed.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
unordered_multimap(const allocator_type &__a)
Creates an unordered_multimap with no elements.
std::pair< iterator, bool > emplace(_Args &&...__args)
Attempts to build and insert a std::pair into the unordered_map.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
_Hashtable::size_type size_type
Iterator-related typedefs.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
_Hashtable::const_reference const_reference
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...
mapped_type & operator[](const key_type &__k)
Subscript ( [] ) access to unordered_map data.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
size_type count(const key_type &__x) const
Finds the number of elements.
bool empty() const noexcept
Returns true if the unordered_multimap is empty.
key_equal key_eq() const
Returns the key comparison object with which the unordered_map was constructed.
Struct holding two objects of arbitrary type.
_Hashtable::mapped_type mapped_type
Public typedefs.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
const_iterator end() const noexcept
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
_Hashtable::pointer pointer
Iterator-related typedefs.
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.
const_iterator begin() const noexcept
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_map.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_multimap.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
size_type max_size() const noexcept
Returns the maximum size of the unordered_multimap.
void rehash(size_type __n)
May rehash the unordered_map.
iterator insert(const_iterator __hint, const value_type &__x)
Inserts a std::pair into the unordered_multimap.
const_iterator cend() const noexcept
constexpr piecewise_construct_t piecewise_construct
piecewise_construct
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
_Hashtable::reference reference
Iterator-related typedefs.
iterator begin() noexcept
_Hashtable::allocator_type allocator_type
Public typedefs.
const_iterator cbegin() const noexcept
_Hashtable::key_type key_type
Public typedefs.
_Hashtable::reference reference
Iterator-related typedefs.