include/bits/unordered_map.h

55   /// Base types for unordered_multimap.
73     class unordered_multimap;
879 	merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
887 	merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
933        *  This function only makes sense for %unordered_multimap; for
959        *  This function probably only makes sense for %unordered_multimap.
1250     class unordered_multimap
1288       unordered_multimap() = default;
1298       unordered_multimap(size_type __n,
1306        *  @brief  Builds an %unordered_multimap from a range.
1314        *  Create an %unordered_multimap consisting of copies of the elements
1319 	unordered_multimap(_InputIterator __first, _InputIterator __last,
1328       unordered_multimap(const unordered_multimap&) = default;
1331       unordered_multimap(unordered_multimap&&) = default;
1334        *  @brief Creates an %unordered_multimap with no elements.
1338       unordered_multimap(const allocator_type& __a)
1344        * @param  __uset  Input %unordered_multimap to copy.
1347       unordered_multimap(const unordered_multimap& __ummap,
1354        *  @param  __uset Input %unordered_multimap to move.
1357       unordered_multimap(unordered_multimap&& __ummap,
1364        *  @brief  Builds an %unordered_multimap from an initializer_list.
1371        *  Create an %unordered_multimap consisting of copies of the elements in
1374       unordered_multimap(initializer_list<value_type> __l,
1382       unordered_multimap(size_type __n, const allocator_type& __a)
1383       : unordered_multimap(__n, hasher(), key_equal(), __a)
1386       unordered_multimap(size_type __n, const hasher& __hf,
1388       : unordered_multimap(__n, __hf, key_equal(), __a)
1392 	unordered_multimap(_InputIterator __first, _InputIterator __last,
1395 	: unordered_multimap(__first, __last, __n, hasher(), key_equal(), __a)
1399 	unordered_multimap(_InputIterator __first, _InputIterator __last,
1402 	: unordered_multimap(__first, __last, __n, __hf, key_equal(), __a)
1405       unordered_multimap(initializer_list<value_type> __l,
1408       : unordered_multimap(__l, __n, hasher(), key_equal(), __a)
1411       unordered_multimap(initializer_list<value_type> __l,
1414       : unordered_multimap(__l, __n, __hf, key_equal(), __a)
1418       unordered_multimap&
1419       operator=(const unordered_multimap&) = default;
1422       unordered_multimap&
1423       operator=(unordered_multimap&&) = default;
1429        *  This function fills an %unordered_multimap with copies of the
1432        *  Note that the assignment completely changes the %unordered_multimap
1433        *  and that the resulting %unordered_multimap's size is the same as the
1436       unordered_multimap&
1443       ///  Returns the allocator object used by the %unordered_multimap.
1450       ///  Returns true if the %unordered_multimap is empty.
1455       ///  Returns the size of the %unordered_multimap.
1460       ///  Returns the maximum size of the %unordered_multimap.
1469        *  %unordered_multimap.
1478        *  element in the %unordered_multimap.
1491        *  the %unordered_multimap.
1500        *  element in the %unordered_multimap.
1515        *  %unordered_multimap.
1524        *  the %unordered_multimap.
1535        *  %unordered_multimap.
1562        *  @brief Inserts a std::pair into the %unordered_multimap.
1586        *  @brief Inserts a std::pair into the %unordered_multimap.
1636        *  %unordered_multimap.
1673        *  @brief Erases an element from an %unordered_multimap.
1680        *  from an %unordered_multimap.
1701        *  an %unordered_multimap.
1712        *  %unordered_multimap.
1720        *  %unordered_multimap.
1730        *  Erases all elements in an %unordered_multimap.
1740        *  @brief  Swaps data with another %unordered_multimap.
1741        *  @param  __x  An %unordered_multimap of the same element and allocator
1744        *  This exchanges the elements between two %unordered_multimap in
1750       swap(unordered_multimap& __x)
1760 	merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
1763 	    = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1769 	merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1777 	    = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1789       ///  Returns the hash functor object with which the %unordered_multimap
1795       ///  Returns the key comparison object with which the %unordered_multimap
1805        *  @brief Tries to locate an element in an %unordered_multimap.
1862       /// Returns the number of buckets of the %unordered_multimap.
1867       /// Returns the maximum number of buckets of the %unordered_multimap.
1949       /// Returns a positive number that the %unordered_multimap tries to keep
1956        *  @brief  Change the %unordered_multimap maximum load factor.
1964        *  @brief  May rehash the %unordered_multimap.
1968        *  %unordered_multimap maximum load factor.
1975        *  @brief  Prepare the %unordered_multimap for a specified number of
1988 	operator==(const unordered_multimap<_Key1, _Tp1,
1990 		   const unordered_multimap<_Key1, _Tp1,
2004     unordered_multimap(_InputIterator, _InputIterator,
2005 		       unordered_multimap<int, int>::size_type = {},
2008     -> unordered_multimap<__iter_key_t<_InputIterator>,
2018     unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2019 		       unordered_multimap<int, int>::size_type = {},
2022     -> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Allocator>;
2027     unordered_multimap(_InputIterator, _InputIterator,
2028 		       unordered_multimap<int, int>::size_type, _Allocator)
2029     -> unordered_multimap<__iter_key_t<_InputIterator>,
2037     unordered_multimap(_InputIterator, _InputIterator, _Allocator)
2038     -> unordered_multimap<__iter_key_t<_InputIterator>,
2047     unordered_multimap(_InputIterator, _InputIterator,
2048 		       unordered_multimap<int, int>::size_type, _Hash,
2050     -> unordered_multimap<__iter_key_t<_InputIterator>,
2056     unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2057 		       unordered_multimap<int, int>::size_type,
2059     -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
2063     unordered_multimap(initializer_list<pair<_Key, _Tp>>, _Allocator)
2064     -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
2069     unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2070 		       unordered_multimap<int, int>::size_type,
2072     -> unordered_multimap<_Key, _Tp, _Hash, equal_to<_Key>, _Allocator>;
2085     swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2086 	 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2106     operator==(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2107 	       const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2113     operator!=(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2114 	       const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2132 	using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
2141       _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2145   // Allow std::unordered_multimap access to internals of compatible maps.
2149       _GLIBCXX_STD_C::unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>,
2156 	using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
2158       friend unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>;
2165       _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)