Lines Matching refs:map
0 // Map implementation -*- C++ -*-
54 * Do not attempt to use it directly. @headername{map}
77 * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the
82 * The private tree data is declared exactly the same way for map and
88 class map
109 friend class map<_Key, _Tp, _Compare, _Alloc>;
122 /// This turns a red-black tree into a [multi]map.
152 map()
156 * @brief Creates a %map with no elements.
161 map(const _Compare& __comp,
166 * @brief %Map copy constructor.
167 * @param x A %map of identical element and allocator types.
169 * The newly-created %map uses a copy of the allocation object
172 map(const map& __x)
177 * @brief %Map move constructor.
178 * @param x A %map of identical element and allocator types.
180 * The newly-created %map contains the exact contents of @a x.
181 * The contents of @a x are a valid, but unspecified %map.
183 map(map&& __x)
187 * @brief Builds a %map from an initializer_list.
192 * Create a %map consisting of copies of the elements in the
197 map(initializer_list<value_type> __l,
205 * @brief Builds a %map from a range.
209 * Create a %map consisting of copies of the elements from [first,last).
214 map(_InputIterator __first, _InputIterator __last)
219 * @brief Builds a %map from a range.
225 * Create a %map consisting of copies of the elements from [first,last).
230 map(_InputIterator __first, _InputIterator __last,
246 * @brief %Map assignment operator.
247 * @param x A %map of identical element and allocator types.
252 map&
253 operator=(const map& __x)
261 * @brief %Map move assignment operator.
262 * @param x A %map of identical element and allocator types.
264 * The contents of @a x are moved into this map (without copying).
265 * @a x is a valid, but unspecified %map.
267 map&
268 operator=(map&& __x)
278 * @brief %Map list assignment operator.
281 * This function fills a %map with copies of the elements in the
284 * Note that the assignment completely changes the %map and
285 * that the resulting %map's size is the same as the number
288 map&
305 * %map.
314 * in the %map. Iteration is done in ascending order according to the
323 * pair in the %map. Iteration is done in ascending order
332 * pair in the %map. Iteration is done in ascending order according to
341 * the %map. Iteration is done in descending order according to the
350 * last pair in the %map. Iteration is done in descending order
359 * first pair in the %map. Iteration is done in descending order
368 * before the first pair in the %map. Iteration is done in descending
378 * in the %map. Iteration is done in ascending order according to the
387 * pair in the %map. Iteration is done in ascending order according to
396 * last pair in the %map. Iteration is done in descending order
405 * before the first pair in the %map. Iteration is done in descending
414 /** Returns true if the %map is empty. (Thus begin() would equal
421 /** Returns the size of the %map. */
426 /** Returns the maximum size of the %map. */
433 * @brief Subscript ( @c [] ) access to %map data.
475 * @brief Access to %map data.
478 * such a data is present in the %map.
486 __throw_out_of_range(__N("map::at"));
495 __throw_out_of_range(__N("map::at"));
501 * @brief Attempts to insert a std::pair into the %map.
510 * This function attempts to insert a (key, value) %pair into the %map.
511 * A %map relies on unique keys and thus a %pair is only inserted if its
512 * first element (the key) is not already present in the %map.
531 * @brief Attempts to insert a list of std::pairs into the %map.
543 * @brief Attempts to insert a std::pair into the %map.
600 * @brief Erases an element from a %map.
607 * iterator, from a %map. Note that this function only erases
622 * @brief Erases an element from a %map.
626 * iterator, from a %map. Note that this function only erases
642 * a %map.
655 * @brief Erases a [first,last) range of elements from a %map.
661 * This function erases a sequence of elements from a %map.
671 * @brief Erases a [first,last) range of elements from a %map.
676 * This function erases a sequence of elements from a %map.
687 * @brief Swaps data with another %map.
688 * @param x A %map of the same element and allocator types.
698 swap(map& __x)
702 * Erases all elements in a %map. Note that this function only
713 * Returns the key comparison object out of which the %map was
722 * object out of which the %map was constructed.
728 // [23.3.1.3] map operations
730 * @brief Tries to locate an element in a %map.
745 * @brief Tries to locate an element in a %map.
764 * This function only makes sense for multimaps; for map the result will
861 operator==(const map<_K1, _T1, _C1, _A1>&,
862 const map<_K1, _T1, _C1, _A1>&);
866 operator<(const map<_K1, _T1, _C1, _A1>&,
867 const map<_K1, _T1, _C1, _A1>&);
871 * @brief Map equality comparison.
872 * @param x A %map.
873 * @param y A %map of the same type as @a x.
882 operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x,
883 const map<_Key, _Tp, _Compare, _Alloc>& __y)
887 * @brief Map ordering relation.
888 * @param x A %map.
889 * @param y A %map of the same type as @a x.
899 operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,
900 const map<_Key, _Tp, _Compare, _Alloc>& __y)
906 operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
907 const map<_Key, _Tp, _Compare, _Alloc>& __y)
913 operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x,
914 const map<_Key, _Tp, _Compare, _Alloc>& __y)
920 operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
921 const map<_Key, _Tp, _Compare, _Alloc>& __y)
927 operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
928 const map<_Key, _Tp, _Compare, _Alloc>& __y)
931 /// See std::map::swap().
934 swap(map<_Key, _Tp, _Compare, _Alloc>& __x,
935 map<_Key, _Tp, _Compare, _Alloc>& __y)
