Lines Matching refs:set
0 // Set implementation -*- C++ -*-
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,
182 * @brief %Set copy constructor.
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)
193 * @brief %Set move constructor
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,
220 * @brief %Set assignment operator.
221 * @param x A %set of identical element and allocator types.
226 set&
227 operator=(const set& __x)
235 * @brief %Set move assignment operator.
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)
251 * @brief %Set list assignment operator.
254 * This function fills a %set with copies of the elements in the
257 * Note that the assignment completely changes the %set and
258 * that the resulting %set's size is the same as the number
261 set&
272 /// Returns the comparison object with which the %set was constructed.
276 /// Returns the comparison object with which the %set was constructed.
280 /// Returns the allocator object with which the %set was constructed.
287 * element in the %set. Iteration is done in ascending order according
296 * element in the %set. Iteration is done in ascending order according
305 * element in the %set. Iteration is done in descending order according
314 * last pair in the %set. Iteration is done in descending order
324 * element in the %set. Iteration is done in ascending order according
333 * element in the %set. Iteration is done in ascending order according
342 * element in the %set. Iteration is done in descending order according
351 * last pair in the %set. Iteration is done in descending order
359 /// Returns true if the %set is empty.
364 /// Returns the size of the %set.
369 /// Returns the maximum size of the %set.
375 * @brief Swaps data with another %set.
376 * @param x A %set of the same element and allocator types.
387 swap(set&& __x)
389 swap(set& __x)
395 * @brief Attempts to insert an element into the %set.
401 * This function attempts to insert an element into the %set. A %set
403 * not already present in the %set.
416 * @brief Attempts to insert an element into the %set.
454 * @brief Attempts to insert a list of elements into the %set.
466 * @brief Erases an element from a %set.
470 * from a %set. Note that this function only erases the element, and
484 * a %set.
494 * @brief Erases a [first,last) range of elements from a %set.
499 * This function erases a sequence of elements from a %set.
509 * Erases all elements in a %set. Note that this function only erases
518 // set operations:
525 * This function only makes sense for multisets; for set the result will
533 // 214. set::find() missing const overload
536 * @brief Tries to locate an element in a %set.
619 operator==(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
623 operator<(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
628 * @brief Set equality comparison.
629 * @param x A %set.
630 * @param y A %set of the same type as @a x.
639 operator==(const set<_Key, _Compare, _Alloc>& __x,
640 const set<_Key, _Compare, _Alloc>& __y)
644 * @brief Set ordering relation.
645 * @param x A %set.
646 * @param y A %set of the same type as @a x.
656 operator<(const set<_Key, _Compare, _Alloc>& __x,
657 const set<_Key, _Compare, _Alloc>& __y)
663 operator!=(const set<_Key, _Compare, _Alloc>& __x,
664 const set<_Key, _Compare, _Alloc>& __y)
670 operator>(const set<_Key, _Compare, _Alloc>& __x,
671 const set<_Key, _Compare, _Alloc>& __y)
677 operator<=(const set<_Key, _Compare, _Alloc>& __x,
678 const set<_Key, _Compare, _Alloc>& __y)
684 operator>=(const set<_Key, _Compare, _Alloc>& __x,
685 const set<_Key, _Compare, _Alloc>& __y)
688 /// See std::set::swap().
691 swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)
697 swap(set<_Key, _Compare, _Alloc>&& __x, set<_Key, _Compare, _Alloc>& __y)
702 swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>&& __y)
