Lines Matching refs:map
0 // Map implementation -*- C++ -*-
54 * Do not attempt to use it directly. @headername{map}
79 * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the
84 * The private tree data is declared exactly the same way for map and
90 class map
111 friend class map<_Key, _Tp, _Compare, _Alloc>;
124 /// This turns a red-black tree into a [multi]map.
154 map()
158 * @brief Creates a %map with no elements.
163 map(const _Compare& __comp,
168 * @brief %Map copy constructor.
169 * @param __x A %map of identical element and allocator types.
171 * The newly-created %map uses a copy of the allocation object
174 map(const map& __x)
179 * @brief %Map move constructor.
180 * @param __x A %map of identical element and allocator types.
182 * The newly-created %map contains the exact contents of @a __x.
183 * The contents of @a __x are a valid, but unspecified %map.
185 map(map&& __x)
190 * @brief Builds a %map from an initializer_list.
195 * Create a %map consisting of copies of the elements in the
200 map(initializer_list<value_type> __l,
208 * @brief Builds a %map from a range.
212 * Create a %map consisting of copies of the elements from
218 map(_InputIterator __first, _InputIterator __last)
223 * @brief Builds a %map from a range.
229 * Create a %map consisting of copies of the elements from
235 map(_InputIterator __first, _InputIterator __last,
251 * @brief %Map assignment operator.
252 * @param __x A %map of identical element and allocator types.
257 map&
258 operator=(const map& __x)
266 * @brief %Map move assignment operator.
267 * @param __x A %map of identical element and allocator types.
269 * The contents of @a __x are moved into this map (without copying).
270 * @a __x is a valid, but unspecified %map.
272 map&
273 operator=(map&& __x)
283 * @brief %Map list assignment operator.
286 * This function fills a %map with copies of the elements in the
289 * Note that the assignment completely changes the %map and
290 * that the resulting %map's size is the same as the number
293 map&
310 * %map.
319 * in the %map. Iteration is done in ascending order according to the
328 * pair in the %map. Iteration is done in ascending order
337 * pair in the %map. Iteration is done in ascending order according to
346 * the %map. Iteration is done in descending order according to the
355 * last pair in the %map. Iteration is done in descending order
364 * first pair in the %map. Iteration is done in descending order
373 * before the first pair in the %map. Iteration is done in descending
383 * in the %map. Iteration is done in ascending order according to the
392 * pair in the %map. Iteration is done in ascending order according to
401 * last pair in the %map. Iteration is done in descending order
410 * before the first pair in the %map. Iteration is done in descending
419 /** Returns true if the %map is empty. (Thus begin() would equal
426 /** Returns the size of the %map. */
431 /** Returns the maximum size of the %map. */
438 * @brief Subscript ( @c [] ) access to %map data.
480 * @brief Access to %map data.
483 * such a data is present in the %map.
491 __throw_out_of_range(__N("map::at"));
500 __throw_out_of_range(__N("map::at"));
506 * @brief Attempts to insert a std::pair into the %map.
515 * This function attempts to insert a (key, value) %pair into the %map.
516 * A %map relies on unique keys and thus a %pair is only inserted if its
517 * first element (the key) is not already present in the %map.
536 * @brief Attempts to insert a list of std::pairs into the %map.
548 * @brief Attempts to insert a std::pair into the %map.
605 * @brief Erases an element from a %map.
612 * iterator, from a %map. Note that this function only erases
627 * @brief Erases an element from a %map.
631 * iterator, from a %map. Note that this function only erases
647 * a %map.
660 * @brief Erases a [first,last) range of elements from a %map.
667 * This function erases a sequence of elements from a %map.
677 * @brief Erases a [__first,__last) range of elements from a %map.
683 * This function erases a sequence of elements from a %map.
694 * @brief Swaps data with another %map.
695 * @param __x A %map of the same element and allocator types.
705 swap(map& __x)
709 * Erases all elements in a %map. Note that this function only
720 * Returns the key comparison object out of which the %map was
729 * object out of which the %map was constructed.
735 // [23.3.1.3] map operations
737 * @brief Tries to locate an element in a %map.
752 * @brief Tries to locate an element in a %map.
771 * This function only makes sense for multimaps; for map the result will
868 operator==(const map<_K1, _T1, _C1, _A1>&,
869 const map<_K1, _T1, _C1, _A1>&);
873 operator<(const map<_K1, _T1, _C1, _A1>&,
874 const map<_K1, _T1, _C1, _A1>&);
878 * @brief Map equality comparison.
879 * @param __x A %map.
880 * @param __y A %map of the same type as @a x.
889 operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x,
890 const map<_Key, _Tp, _Compare, _Alloc>& __y)
894 * @brief Map ordering relation.
895 * @param __x A %map.
896 * @param __y A %map of the same type as @a x.
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)
934 operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
935 const map<_Key, _Tp, _Compare, _Alloc>& __y)
938 /// See std::map::swap().
941 swap(map<_Key, _Tp, _Compare, _Alloc>& __x,
942 map<_Key, _Tp, _Compare, _Alloc>& __y)
