Lines Matching defs:unordered_map
0 // unordered_map implementation -*- C++ -*-
25 /** @file bits/unordered_map.h
27 * Do not attempt to use it directly. @headername{unordered_map}
37 /// Base types for unordered_map.
97 class unordered_map : __check_copy_constructible<_Alloc>
138 unordered_map(size_type __n = 10,
146 * @brief Builds an %unordered_map from a range.
154 * Create an %unordered_map consisting of copies of the elements from
159 unordered_map(_InputIterator __f, _InputIterator __l,
168 unordered_map(const unordered_map&) = default;
171 unordered_map(unordered_map&&) = default;
174 * @brief Builds an %unordered_map from an initializer_list.
181 * Create an %unordered_map consisting of copies of the elements in the
184 unordered_map(initializer_list<value_type> __l,
193 unordered_map&
194 operator=(const unordered_map&) = default;
197 unordered_map&
198 operator=(unordered_map&&) = default;
201 * @brief %Unordered_map list assignment operator.
204 * This function fills an %unordered_map with copies of the elements in
207 * Note that the assignment completely changes the %unordered_map and
208 * that the resulting %unordered_map's size is the same as the number
211 unordered_map&
218 /// Returns the allocator object with which the %unordered_map was
226 /// Returns true if the %unordered_map is empty.
231 /// Returns the size of the %unordered_map.
236 /// Returns the maximum size of the %unordered_map.
245 * %unordered_map.
254 * element in the %unordered_map.
267 * the %unordered_map.
276 * element in the %unordered_map.
290 * @brief Attempts to build and insert a std::pair into the %unordered_map.
301 * the %unordered_map.
302 * An %unordered_map relies on unique keys and thus a %pair is only
304 * %unordered_map.
314 * @brief Attempts to build and insert a std::pair into the %unordered_map.
345 * @brief Attempts to insert a std::pair into the %unordered_map.
355 * %unordered_map. An %unordered_map relies on unique keys and thus a
357 * present in the %unordered_map.
375 * @brief Attempts to insert a std::pair into the %unordered_map.
422 * @brief Attempts to insert a list of elements into the %unordered_map.
434 * @brief Erases an element from an %unordered_map.
441 * from an %unordered_map.
462 * an %unordered_map. For an %unordered_map the result of this function
474 * %unordered_map.
481 * This function erases a sequence of elements from an %unordered_map.
491 * Erases all elements in an %unordered_map.
501 * @brief Swaps data with another %unordered_map.
502 * @param __x An %unordered_map of the same element and allocator
505 * This exchanges the elements between two %unordered_map in constant time.
510 swap(unordered_map& __x)
515 /// Returns the hash functor object with which the %unordered_map was
521 /// Returns the key comparison object with which the %unordered_map was
531 * @brief Tries to locate an element in an %unordered_map.
556 * %unordered_map the result will either be 0 (not present) or 1
583 * @brief Subscript ( @c [] ) access to %unordered_map data.
605 * @brief Access to %unordered_map data.
608 * such a data is present in the %unordered_map.
622 /// Returns the number of buckets of the %unordered_map.
627 /// Returns the maximum number of buckets of the %unordered_map.
709 /// Returns a positive number that the %unordered_map tries to keep the
716 * @brief Change the %unordered_map maximum load factor.
724 * @brief May rehash the %unordered_map.
728 * %unordered_map maximum load factor.
735 * @brief Prepare the %unordered_map for a specified number of
748 operator==(const unordered_map<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1>&,
749 const unordered_map<_Key1, _Tp1, _Hash1, _Pred1, _Alloc1>&);
1376 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1377 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1388 operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1389 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1394 operator!=(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1395 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
