include/bits/unordered_map.h

55   /// Base types for unordered_multimap.
73     class unordered_multimap;
829 	merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
837 	merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
898        *  This function only makes sense for %unordered_multimap; for
940        *  This function probably only makes sense for %unordered_multimap.
1249     class unordered_multimap
1287       unordered_multimap() = default;
1297       unordered_multimap(size_type __n,
1305        *  @brief  Builds an %unordered_multimap from a range.
1313        *  Create an %unordered_multimap consisting of copies of the elements
1318 	unordered_multimap(_InputIterator __first, _InputIterator __last,
1327       unordered_multimap(const unordered_multimap&) = default;
1330       unordered_multimap(unordered_multimap&&) = default;
1333        *  @brief Creates an %unordered_multimap with no elements.
1337       unordered_multimap(const allocator_type& __a)
1343        * @param  __uset  Input %unordered_multimap to copy.
1346       unordered_multimap(const unordered_multimap& __ummap,
1353        *  @param  __uset Input %unordered_multimap to move.
1356       unordered_multimap(unordered_multimap&& __ummap,
1363        *  @brief  Builds an %unordered_multimap from an initializer_list.
1370        *  Create an %unordered_multimap consisting of copies of the elements in
1373       unordered_multimap(initializer_list<value_type> __l,
1381       unordered_multimap(size_type __n, const allocator_type& __a)
1382       : unordered_multimap(__n, hasher(), key_equal(), __a)
1385       unordered_multimap(size_type __n, const hasher& __hf,
1387       : unordered_multimap(__n, __hf, key_equal(), __a)
1391 	unordered_multimap(_InputIterator __first, _InputIterator __last,
1394 	: unordered_multimap(__first, __last, __n, hasher(), key_equal(), __a)
1398 	unordered_multimap(_InputIterator __first, _InputIterator __last,
1401 	: unordered_multimap(__first, __last, __n, __hf, key_equal(), __a)
1404       unordered_multimap(initializer_list<value_type> __l,
1407       : unordered_multimap(__l, __n, hasher(), key_equal(), __a)
1410       unordered_multimap(initializer_list<value_type> __l,
1413       : unordered_multimap(__l, __n, __hf, key_equal(), __a)
1417       unordered_multimap&
1418       operator=(const unordered_multimap&) = default;
1421       unordered_multimap&
1422       operator=(unordered_multimap&&) = default;
1428        *  This function fills an %unordered_multimap with copies of the
1431        *  Note that the assignment completely changes the %unordered_multimap
1432        *  and that the resulting %unordered_multimap's size is the same as the
1435       unordered_multimap&
1442       ///  Returns the allocator object used by the %unordered_multimap.
1449       ///  Returns true if the %unordered_multimap is empty.
1454       ///  Returns the size of the %unordered_multimap.
1459       ///  Returns the maximum size of the %unordered_multimap.
1468        *  %unordered_multimap.
1477        *  element in the %unordered_multimap.
1490        *  the %unordered_multimap.
1499        *  element in the %unordered_multimap.
1514        *  %unordered_multimap.
1523        *  the %unordered_multimap.
1534        *  %unordered_multimap.
1561        *  @brief Inserts a std::pair into the %unordered_multimap.
1585        *  @brief Inserts a std::pair into the %unordered_multimap.
1635        *  %unordered_multimap.
1672        *  @brief Erases an element from an %unordered_multimap.
1679        *  from an %unordered_multimap.
1700        *  an %unordered_multimap.
1711        *  %unordered_multimap.
1719        *  %unordered_multimap.
1729        *  Erases all elements in an %unordered_multimap.
1739        *  @brief  Swaps data with another %unordered_multimap.
1740        *  @param  __x  An %unordered_multimap of the same element and allocator
1743        *  This exchanges the elements between two %unordered_multimap in
1749       swap(unordered_multimap& __x)
1759 	merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
1762 	    = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1768 	merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1776 	    = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1788       ///  Returns the hash functor object with which the %unordered_multimap
1794       ///  Returns the key comparison object with which the %unordered_multimap
1804        *  @brief Tries to locate an element in an %unordered_multimap.
1908       /// Returns the number of buckets of the %unordered_multimap.
1913       /// Returns the maximum number of buckets of the %unordered_multimap.
1995       /// Returns a positive number that the %unordered_multimap tries to keep
2002        *  @brief  Change the %unordered_multimap maximum load factor.
2010        *  @brief  May rehash the %unordered_multimap.
2014        *  %unordered_multimap maximum load factor.
2021        *  @brief  Prepare the %unordered_multimap for a specified number of
2034 	operator==(const unordered_multimap<_Key1, _Tp1,
2036 		   const unordered_multimap<_Key1, _Tp1,
2050     unordered_multimap(_InputIterator, _InputIterator,
2051 		       unordered_multimap<int, int>::size_type = {},
2054     -> unordered_multimap<__iter_key_t<_InputIterator>,
2064     unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2065 		       unordered_multimap<int, int>::size_type = {},
2068     -> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Allocator>;
2073     unordered_multimap(_InputIterator, _InputIterator,
2074 		       unordered_multimap<int, int>::size_type, _Allocator)
2075     -> unordered_multimap<__iter_key_t<_InputIterator>,
2083     unordered_multimap(_InputIterator, _InputIterator, _Allocator)
2084     -> unordered_multimap<__iter_key_t<_InputIterator>,
2093     unordered_multimap(_InputIterator, _InputIterator,
2094 		       unordered_multimap<int, int>::size_type, _Hash,
2096     -> unordered_multimap<__iter_key_t<_InputIterator>,
2102     unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2103 		       unordered_multimap<int, int>::size_type,
2105     -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
2109     unordered_multimap(initializer_list<pair<_Key, _Tp>>, _Allocator)
2110     -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
2115     unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2116 		       unordered_multimap<int, int>::size_type,
2118     -> unordered_multimap<_Key, _Tp, _Hash, equal_to<_Key>, _Allocator>;
2131     swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2132 	 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2152     operator==(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2153 	       const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2159     operator!=(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2160 	       const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2178 	using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
2187       _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2191   // Allow std::unordered_multimap access to internals of compatible maps.
2195       _GLIBCXX_STD_C::unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>,
2202 	using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
2204       friend unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>;
2211       _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)