Lines Matching refs:set
86 * The private tree data is declared exactly the same way for set and
93 class set
118 _Rep_type _M_t; // red-black tree representing set
128 // DR 103. set::iterator is required to be modifiable,
140 set()
150 set(const _Compare& __comp,
155 * @brief Builds a %set from a range.
159 * Create a %set consisting of copies of the elements from [first,last).
164 set(_InputIterator __first, _InputIterator __last)
169 * @brief Builds a %set from a range.
175 * Create a %set consisting of copies of the elements from [first,last).
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<_Key,_Compare,_Alloc>& __x)
198 * @param x A %set of identical element and allocator types.
203 set<_Key,_Compare,_Alloc>&
204 operator=(const set<_Key, _Compare, _Alloc>& __x)
212 /// Returns the comparison object with which the %set was constructed.
216 /// Returns the comparison object with which the %set was constructed.
220 /// Returns the allocator object with which the %set was constructed.
227 * %set. Iteration is done in ascending order according to the keys.
235 * the %set. Iteration is done in ascending order according to the keys.
243 * in the %set. Iteration is done in descending order according to the
259 /// Returns true if the %set is empty.
264 /// Returns the size of the %set.
269 /// Returns the maximum size of the %set.
275 * @brief Swaps data with another %set.
276 * @param x A %set of the same element and allocator types.
286 swap(set<_Key,_Compare,_Alloc>& __x)
291 * @brief Attempts to insert an element into the %set.
297 * This function attempts to insert an element into the %set. A %set
299 * not already present in the %set.
312 * @brief Attempts to insert an element into the %set.
348 * @brief Erases an element from a %set.
352 * from a %set. Note that this function only erases the element, and
366 * a %set.
376 * @brief Erases a [first,last) range of elements from a %set.
381 * This function erases a sequence of elements from a %set.
391 * Erases all elements in a %set. Note that this function only erases
400 // set operations:
407 * This function only makes sense for multisets; for set the result will
415 // 214. set::find() missing const overload
418 * @brief Tries to locate an element in a %set.
501 operator== (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
505 operator< (const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
511 * @param x A %set.
512 * @param y A %set of the same type as @a x.
521 operator==(const set<_Key, _Compare, _Alloc>& __x,
522 const set<_Key, _Compare, _Alloc>& __y)
527 * @param x A %set.
528 * @param y A %set of the same type as @a x.
538 operator<(const set<_Key, _Compare, _Alloc>& __x,
539 const set<_Key, _Compare, _Alloc>& __y)
545 operator!=(const set<_Key, _Compare, _Alloc>& __x,
546 const set<_Key, _Compare, _Alloc>& __y)
552 operator>(const set<_Key, _Compare, _Alloc>& __x,
553 const set<_Key, _Compare, _Alloc>& __y)
559 operator<=(const set<_Key, _Compare, _Alloc>& __x,
560 const set<_Key, _Compare, _Alloc>& __y)
566 operator>=(const set<_Key, _Compare, _Alloc>& __x,
567 const set<_Key, _Compare, _Alloc>& __y)
570 /// See std::set::swap().
573 swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)