Lines Matching defs:set
54 * Do not attempt to use it directly. @headername{set}
83 * The private tree data is declared exactly the same way for set and
89 class set
114 _Rep_type _M_t; // Red-black tree representing set.
124 // DR 103. set::iterator is required to be modifiable,
138 set()
142 * @brief Creates a %set with no elements.
147 set(const _Compare& __comp,
152 * @brief Builds a %set from a range.
156 * Create a %set consisting of copies of the elements from [first,last).
161 set(_InputIterator __first, _InputIterator __last)
166 * @brief Builds a %set from a range.
172 * Create a %set consisting of copies of the elements from [first,last).
177 set(_InputIterator __first, _InputIterator __last,
185 * @param x A %set of identical element and allocator types.
187 * The newly-created %set uses a copy of the allocation object used
190 set(const set& __x)
196 * @param x A %set of identical element and allocator types.
198 * The newly-created %set contains the exact contents of @a x.
199 * The contents of @a x are a valid, but unspecified %set.
201 set(set&& __x)
205 * @brief Builds a %set from an initializer_list.
210 * Create a %set consisting of copies of the elements in the list.
214 set(initializer_list<value_type> __l,
223 * @param x A %set of identical element and allocator types.
228 set&
229 operator=(const set& __x)
238 * @param x A %set of identical element and allocator types.
240 * The contents of @a x are moved into this %set (without copying).
241 * @a x is a valid, but unspecified %set.
243 set&
244 operator=(set&& __x)
257 * This function fills a %set with copies of the elements in the
260 * Note that the assignment completely changes the %set and
261 * that the resulting %set's size is the same as the number
264 set&
275 /// Returns the comparison object with which the %set was constructed.
279 /// Returns the comparison object with which the %set was constructed.
283 /// Returns the allocator object with which the %set was constructed.
290 * element in the %set. Iteration is done in ascending order according
299 * element in the %set. Iteration is done in ascending order according
308 * element in the %set. Iteration is done in descending order according
317 * last pair in the %set. Iteration is done in descending order
327 * element in the %set. Iteration is done in ascending order according
336 * element in the %set. Iteration is done in ascending order according
345 * element in the %set. Iteration is done in descending order according
354 * last pair in the %set. Iteration is done in descending order
362 /// Returns true if the %set is empty.
367 /// Returns the size of the %set.
372 /// Returns the maximum size of the %set.
378 * @brief Swaps data with another %set.
379 * @param x A %set of the same element and allocator types.
389 swap(set& __x)
394 * @brief Attempts to insert an element into the %set.
400 * This function attempts to insert an element into the %set. A %set
402 * not already present in the %set.
425 * @brief Attempts to insert an element into the %set.
469 * @brief Attempts to insert a list of elements into the %set.
484 * @brief Erases an element from a %set.
491 * from a %set. Note that this function only erases the element, and
501 * @brief Erases an element from a %set.
505 * from a %set. Note that this function only erases the element, and
521 * a %set.
534 * @brief Erases a [first,last) range of elements from a %set.
540 * This function erases a sequence of elements from a %set.
550 * @brief Erases a [first,last) range of elements from a %set.
555 * This function erases a sequence of elements from a %set.
566 * Erases all elements in a %set. Note that this function only erases
575 // set operations:
582 * This function only makes sense for multisets; for set the result will
590 // 214. set::find() missing const overload
593 * @brief Tries to locate an element in a %set.
676 operator==(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
680 operator<(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
686 * @param x A %set.
687 * @param y A %set of the same type as @a x.
696 operator==(const set<_Key, _Compare, _Alloc>& __x,
697 const set<_Key, _Compare, _Alloc>& __y)
702 * @param x A %set.
703 * @param y A %set of the same type as @a x.
713 operator<(const set<_Key, _Compare, _Alloc>& __x,
714 const set<_Key, _Compare, _Alloc>& __y)
720 operator!=(const set<_Key, _Compare, _Alloc>& __x,
721 const set<_Key, _Compare, _Alloc>& __y)
727 operator>(const set<_Key, _Compare, _Alloc>& __x,
728 const set<_Key, _Compare, _Alloc>& __y)
734 operator<=(const set<_Key, _Compare, _Alloc>& __x,
735 const set<_Key, _Compare, _Alloc>& __y)
741 operator>=(const set<_Key, _Compare, _Alloc>& __x,
742 const set<_Key, _Compare, _Alloc>& __y)
745 /// See std::set::swap().
748 swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)