Lines Matching defs:set
81 * The private tree data is declared exactly the same way for set and
87 class set
112 _Rep_type _M_t; // Red-black tree representing set.
122 // DR 103. set::iterator is required to be modifiable,
136 set()
140 * @brief Creates a %set with no elements.
145 set(const _Compare& __comp,
150 * @brief Builds a %set from a range.
154 * Create a %set consisting of copies of the elements from [first,last).
159 set(_InputIterator __first, _InputIterator __last)
164 * @brief Builds a %set from a range.
170 * Create a %set consisting of copies of the elements from [first,last).
175 set(_InputIterator __first, _InputIterator __last,
183 * @param x A %set of identical element and allocator types.
185 * The newly-created %set uses a copy of the allocation object used
188 set(const set& __x)
194 * @param x A %set of identical element and allocator types.
196 * The newly-created %set contains the exact contents of @a x.
197 * The contents of @a x are a valid, but unspecified %set.
199 set(set&& __x)
203 * @brief Builds a %set from an initializer_list.
208 * Create a %set consisting of copies of the elements in the list.
212 set(initializer_list<value_type> __l,
221 * @param x A %set of identical element and allocator types.
226 set&
227 operator=(const set& __x)
236 * @param x A %set of identical element and allocator types.
238 * The contents of @a x are moved into this %set (without copying).
239 * @a x is a valid, but unspecified %set.
241 set&
242 operator=(set&& __x)
255 * This function fills a %set with copies of the elements in the
258 * Note that the assignment completely changes the %set and
259 * that the resulting %set's size is the same as the number
262 set&
273 /// Returns the comparison object with which the %set was constructed.
277 /// Returns the comparison object with which the %set was constructed.
281 /// Returns the allocator object with which the %set was constructed.
288 * element in the %set. Iteration is done in ascending order according
297 * element in the %set. Iteration is done in ascending order according
306 * element in the %set. Iteration is done in descending order according
315 * last pair in the %set. Iteration is done in descending order
325 * element in the %set. Iteration is done in ascending order according
334 * element in the %set. Iteration is done in ascending order according
343 * element in the %set. Iteration is done in descending order according
352 * last pair in the %set. Iteration is done in descending order
360 /// Returns true if the %set is empty.
365 /// Returns the size of the %set.
370 /// Returns the maximum size of the %set.
376 * @brief Swaps data with another %set.
377 * @param x A %set of the same element and allocator types.
387 swap(set& __x)
392 * @brief Attempts to insert an element into the %set.
398 * This function attempts to insert an element into the %set. A %set
400 * not already present in the %set.
413 * @brief Attempts to insert an element into the %set.
451 * @brief Attempts to insert a list of elements into the %set.
466 * @brief Erases an element from a %set.
473 * from a %set. Note that this function only erases the element, and
482 * @brief Erases an element from a %set.
486 * from a %set. Note that this function only erases the element, and
501 * a %set.
514 * @brief Erases a [first,last) range of elements from a %set.
520 * This function erases a sequence of elements from a %set.
530 * @brief Erases a [first,last) range of elements from a %set.
535 * This function erases a sequence of elements from a %set.
546 * Erases all elements in a %set. Note that this function only erases
555 // set operations:
562 * This function only makes sense for multisets; for set the result will
570 // 214. set::find() missing const overload
573 * @brief Tries to locate an element in a %set.
656 operator==(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
660 operator<(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
666 * @param x A %set.
667 * @param y A %set of the same type as @a x.
676 operator==(const set<_Key, _Compare, _Alloc>& __x,
677 const set<_Key, _Compare, _Alloc>& __y)
682 * @param x A %set.
683 * @param y A %set of the same type as @a x.
693 operator<(const set<_Key, _Compare, _Alloc>& __x,
694 const set<_Key, _Compare, _Alloc>& __y)
700 operator!=(const set<_Key, _Compare, _Alloc>& __x,
701 const set<_Key, _Compare, _Alloc>& __y)
707 operator>(const set<_Key, _Compare, _Alloc>& __x,
708 const set<_Key, _Compare, _Alloc>& __y)
714 operator<=(const set<_Key, _Compare, _Alloc>& __x,
715 const set<_Key, _Compare, _Alloc>& __y)
721 operator>=(const set<_Key, _Compare, _Alloc>& __x,
722 const set<_Key, _Compare, _Alloc>& __y)
725 /// See std::set::swap().
728 swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)