Lines Matching defs:set
53 * Do not attempt to use it directly. @headername{set}
84 * The private tree data is declared exactly the same way for set and
90 class set
115 _Rep_type _M_t; // Red-black tree representing set.
125 // DR 103. set::iterator is required to be modifiable,
139 set()
143 * @brief Creates a %set with no elements.
148 set(const _Compare& __comp,
153 * @brief Builds a %set from a range.
157 * Create a %set consisting of copies of the elements from
163 set(_InputIterator __first, _InputIterator __last)
168 * @brief Builds a %set from a range.
174 * Create a %set consisting of copies of the elements from
180 set(_InputIterator __first, _InputIterator __last,
188 * @param __x A %set of identical element and allocator types.
190 * The newly-created %set uses a copy of the allocation object used
193 set(const set& __x)
199 * @param __x A %set of identical element and allocator types.
201 * The newly-created %set contains the exact contents of @a x.
202 * The contents of @a x are a valid, but unspecified %set.
204 set(set&& __x)
209 * @brief Builds a %set from an initializer_list.
214 * Create a %set consisting of copies of the elements in the list.
218 set(initializer_list<value_type> __l,
227 * @param __x A %set of identical element and allocator types.
232 set&
233 operator=(const set& __x)
242 * @param __x A %set of identical element and allocator types.
244 * The contents of @a __x are moved into this %set (without copying).
245 * @a __x is a valid, but unspecified %set.
247 set&
248 operator=(set&& __x)
261 * This function fills a %set with copies of the elements in the
264 * Note that the assignment completely changes the %set and
265 * that the resulting %set's size is the same as the number
268 set&
279 /// Returns the comparison object with which the %set was constructed.
283 /// Returns the comparison object with which the %set was constructed.
287 /// Returns the allocator object with which the %set was constructed.
294 * element in the %set. Iteration is done in ascending order according
303 * element in the %set. Iteration is done in ascending order according
312 * element in the %set. Iteration is done in descending order according
321 * last pair in the %set. Iteration is done in descending order
331 * element in the %set. Iteration is done in ascending order according
340 * element in the %set. Iteration is done in ascending order according
349 * element in the %set. Iteration is done in descending order according
358 * last pair in the %set. Iteration is done in descending order
366 /// Returns true if the %set is empty.
371 /// Returns the size of the %set.
376 /// Returns the maximum size of the %set.
382 * @brief Swaps data with another %set.
383 * @param __x A %set of the same element and allocator types.
393 swap(set& __x)
399 * @brief Attempts to build and insert an element into the %set.
405 * This function attempts to build and insert an element into the %set.
406 * A %set relies on unique keys and thus an element is only inserted if
407 * it is not already present in the %set.
417 * @brief Attempts to insert an element into the %set.
447 * @brief Attempts to insert an element into the %set.
453 * This function attempts to insert an element into the %set. A %set
455 * not already present in the %set.
478 * @brief Attempts to insert an element into the %set.
522 * @brief Attempts to insert a list of elements into the %set.
537 * @brief Erases an element from a %set.
544 * from a %set. Note that this function only erases the element, and
554 * @brief Erases an element from a %set.
558 * from a %set. Note that this function only erases the element, and
574 * a %set.
587 * @brief Erases a [__first,__last) range of elements from a %set.
595 * This function erases a sequence of elements from a %set.
605 * @brief Erases a [first,last) range of elements from a %set.
611 * This function erases a sequence of elements from a %set.
622 * Erases all elements in a %set. Note that this function only erases
631 // set operations:
638 * This function only makes sense for multisets; for set the result will
646 // 214. set::find() missing const overload
649 * @brief Tries to locate an element in a %set.
732 operator==(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
736 operator<(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
742 * @param __x A %set.
743 * @param __y A %set of the same type as @a x.
752 operator==(const set<_Key, _Compare, _Alloc>& __x,
753 const set<_Key, _Compare, _Alloc>& __y)
758 * @param __x A %set.
759 * @param __y A %set of the same type as @a x.
769 operator<(const set<_Key, _Compare, _Alloc>& __x,
770 const set<_Key, _Compare, _Alloc>& __y)
776 operator!=(const set<_Key, _Compare, _Alloc>& __x,
777 const set<_Key, _Compare, _Alloc>& __y)
783 operator>(const set<_Key, _Compare, _Alloc>& __x,
784 const set<_Key, _Compare, _Alloc>& __y)
790 operator<=(const set<_Key, _Compare, _Alloc>& __x,
791 const set<_Key, _Compare, _Alloc>& __y)
797 operator>=(const set<_Key, _Compare, _Alloc>& __x,
798 const set<_Key, _Compare, _Alloc>& __y)
801 /// See std::set::swap().
804 swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)