1 // Set implementation -*- C++ -*-
3 // Copyright (C) 2001-2016 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
28 * Hewlett-Packard Company
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Hewlett-Packard Company makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
39 * Copyright (c) 1996,1997
40 * Silicon Graphics Computer Systems, Inc.
42 * Permission to use, copy, modify, distribute and sell this software
43 * and its documentation for any purpose is hereby granted without fee,
44 * provided that the above copyright notice appear in all copies and
45 * that both that copyright notice and this permission notice appear
46 * in supporting documentation. Silicon Graphics makes no
47 * representations about the suitability of this software for any
48 * purpose. It is provided "as is" without express or implied warranty.
51 /** @file bits/stl_set.h
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{set}
59 #include <bits/concept_check.h>
60 #if __cplusplus >= 201103L
61 #include <initializer_list>
64 namespace std
_GLIBCXX_VISIBILITY(default)
66 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
68 template<typename _Key
, typename _Compare
, typename _Alloc
>
72 * @brief A standard container made up of unique keys, which can be
73 * retrieved in logarithmic time.
75 * @ingroup associative_containers
77 * @tparam _Key Type of key objects.
78 * @tparam _Compare Comparison function object type, defaults to less<_Key>.
79 * @tparam _Alloc Allocator type, defaults to allocator<_Key>.
81 * Meets the requirements of a <a href="tables.html#65">container</a>, a
82 * <a href="tables.html#66">reversible container</a>, and an
83 * <a href="tables.html#69">associative container</a> (using unique keys).
85 * Sets support bidirectional iterators.
87 * The private tree data is declared exactly the same way for set and
88 * multiset; the distinction is made entirely in how the tree functions are
89 * called (*_unique versus *_equal, same as the standard).
91 template<typename _Key
, typename _Compare
= std::less
<_Key
>,
92 typename _Alloc
= std::allocator
<_Key
> >
95 // concept requirements
96 typedef typename
_Alloc::value_type _Alloc_value_type
;
97 __glibcxx_class_requires(_Key
, _SGIAssignableConcept
)
98 __glibcxx_class_requires4(_Compare
, bool, _Key
, _Key
,
99 _BinaryFunctionConcept
)
100 __glibcxx_class_requires2(_Key
, _Alloc_value_type
, _SameTypeConcept
)
106 typedef _Key key_type
;
107 typedef _Key value_type
;
108 typedef _Compare key_compare
;
109 typedef _Compare value_compare
;
110 typedef _Alloc allocator_type
;
114 typedef typename
__gnu_cxx::__alloc_traits
<_Alloc
>::template
115 rebind
<_Key
>::other _Key_alloc_type
;
117 typedef _Rb_tree
<key_type
, value_type
, _Identity
<value_type
>,
118 key_compare
, _Key_alloc_type
> _Rep_type
;
119 _Rep_type _M_t
; // Red-black tree representing set.
121 typedef __gnu_cxx::__alloc_traits
<_Key_alloc_type
> _Alloc_traits
;
125 /// Iterator-related typedefs.
126 typedef typename
_Alloc_traits::pointer pointer
;
127 typedef typename
_Alloc_traits::const_pointer const_pointer
;
128 typedef typename
_Alloc_traits::reference reference
;
129 typedef typename
_Alloc_traits::const_reference const_reference
;
130 // _GLIBCXX_RESOLVE_LIB_DEFECTS
131 // DR 103. set::iterator is required to be modifiable,
132 // but this allows modification of keys.
133 typedef typename
_Rep_type::const_iterator iterator
;
134 typedef typename
_Rep_type::const_iterator const_iterator
;
135 typedef typename
_Rep_type::const_reverse_iterator reverse_iterator
;
136 typedef typename
_Rep_type::const_reverse_iterator const_reverse_iterator
;
137 typedef typename
_Rep_type::size_type size_type
;
138 typedef typename
_Rep_type::difference_type difference_type
;
141 #if __cplusplus > 201402L
142 using node_type
= typename
_Rep_type::node_type
;
143 using insert_return_type
= typename
_Rep_type::insert_return_type
;
146 // allocation/deallocation
148 * @brief Default constructor creates no elements.
150 #if __cplusplus < 201103L
157 * @brief Creates a %set with no elements.
158 * @param __comp Comparator to use.
159 * @param __a An allocator object.
162 set(const _Compare
& __comp
,
163 const allocator_type
& __a
= allocator_type())
164 : _M_t(__comp
, _Key_alloc_type(__a
)) { }
167 * @brief Builds a %set from a range.
168 * @param __first An input iterator.
169 * @param __last An input iterator.
171 * Create a %set consisting of copies of the elements from
172 * [__first,__last). This is linear in N if the range is
173 * already sorted, and NlogN otherwise (where N is
174 * distance(__first,__last)).
176 template<typename _InputIterator
>
177 set(_InputIterator __first
, _InputIterator __last
)
179 { _M_t
._M_insert_unique(__first
, __last
); }
182 * @brief Builds a %set from a range.
183 * @param __first An input iterator.
184 * @param __last An input iterator.
185 * @param __comp A comparison functor.
186 * @param __a An allocator object.
188 * Create a %set consisting of copies of the elements from
189 * [__first,__last). This is linear in N if the range is
190 * already sorted, and NlogN otherwise (where N is
191 * distance(__first,__last)).
193 template<typename _InputIterator
>
194 set(_InputIterator __first
, _InputIterator __last
,
195 const _Compare
& __comp
,
196 const allocator_type
& __a
= allocator_type())
197 : _M_t(__comp
, _Key_alloc_type(__a
))
198 { _M_t
._M_insert_unique(__first
, __last
); }
201 * @brief %Set copy constructor.
203 * Whether the allocator is copied depends on the allocator traits.
205 #if __cplusplus < 201103L
209 set(const set
&) = default;
212 * @brief %Set move constructor
214 * The newly-created %set contains the exact contents of the moved
215 * instance. The moved instance is a valid, but unspecified, %set.
217 set(set
&&) = default;
220 * @brief Builds a %set from an initializer_list.
221 * @param __l An initializer_list.
222 * @param __comp A comparison functor.
223 * @param __a An allocator object.
225 * Create a %set consisting of copies of the elements in the list.
226 * This is linear in N if the list is already sorted, and NlogN
227 * otherwise (where N is @a __l.size()).
229 set(initializer_list
<value_type
> __l
,
230 const _Compare
& __comp
= _Compare(),
231 const allocator_type
& __a
= allocator_type())
232 : _M_t(__comp
, _Key_alloc_type(__a
))
233 { _M_t
._M_insert_unique(__l
.begin(), __l
.end()); }
235 /// Allocator-extended default constructor.
237 set(const allocator_type
& __a
)
238 : _M_t(_Compare(), _Key_alloc_type(__a
)) { }
240 /// Allocator-extended copy constructor.
241 set(const set
& __x
, const allocator_type
& __a
)
242 : _M_t(__x
._M_t
, _Key_alloc_type(__a
)) { }
244 /// Allocator-extended move constructor.
245 set(set
&& __x
, const allocator_type
& __a
)
246 noexcept(is_nothrow_copy_constructible
<_Compare
>::value
247 && _Alloc_traits::_S_always_equal())
248 : _M_t(std::move(__x
._M_t
), _Key_alloc_type(__a
)) { }
250 /// Allocator-extended initialier-list constructor.
251 set(initializer_list
<value_type
> __l
, const allocator_type
& __a
)
252 : _M_t(_Compare(), _Key_alloc_type(__a
))
253 { _M_t
._M_insert_unique(__l
.begin(), __l
.end()); }
255 /// Allocator-extended range constructor.
256 template<typename _InputIterator
>
257 set(_InputIterator __first
, _InputIterator __last
,
258 const allocator_type
& __a
)
259 : _M_t(_Compare(), _Key_alloc_type(__a
))
260 { _M_t
._M_insert_unique(__first
, __last
); }
263 * The dtor only erases the elements, and note that if the elements
264 * themselves are pointers, the pointed-to memory is not touched in any
265 * way. Managing the pointer is the user's responsibility.
271 * @brief %Set assignment operator.
273 * Whether the allocator is copied depends on the allocator traits.
275 #if __cplusplus < 201103L
277 operator=(const set
& __x
)
284 operator=(const set
&) = default;
286 /// Move assignment operator.
288 operator=(set
&&) = default;
291 * @brief %Set list assignment operator.
292 * @param __l An initializer_list.
294 * This function fills a %set with copies of the elements in the
295 * initializer list @a __l.
297 * Note that the assignment completely changes the %set and
298 * that the resulting %set's size is the same as the number
299 * of elements assigned.
302 operator=(initializer_list
<value_type
> __l
)
304 _M_t
._M_assign_unique(__l
.begin(), __l
.end());
311 /// Returns the comparison object with which the %set was constructed.
314 { return _M_t
.key_comp(); }
315 /// Returns the comparison object with which the %set was constructed.
318 { return _M_t
.key_comp(); }
319 /// Returns the allocator object with which the %set was constructed.
321 get_allocator() const _GLIBCXX_NOEXCEPT
322 { return allocator_type(_M_t
.get_allocator()); }
325 * Returns a read-only (constant) iterator that points to the first
326 * element in the %set. Iteration is done in ascending order according
330 begin() const _GLIBCXX_NOEXCEPT
331 { return _M_t
.begin(); }
334 * Returns a read-only (constant) iterator that points one past the last
335 * element in the %set. Iteration is done in ascending order according
339 end() const _GLIBCXX_NOEXCEPT
340 { return _M_t
.end(); }
343 * Returns a read-only (constant) iterator that points to the last
344 * element in the %set. Iteration is done in descending order according
348 rbegin() const _GLIBCXX_NOEXCEPT
349 { return _M_t
.rbegin(); }
352 * Returns a read-only (constant) reverse iterator that points to the
353 * last pair in the %set. Iteration is done in descending order
354 * according to the keys.
357 rend() const _GLIBCXX_NOEXCEPT
358 { return _M_t
.rend(); }
360 #if __cplusplus >= 201103L
362 * Returns a read-only (constant) iterator that points to the first
363 * element in the %set. Iteration is done in ascending order according
367 cbegin() const noexcept
368 { return _M_t
.begin(); }
371 * Returns a read-only (constant) iterator that points one past the last
372 * element in the %set. Iteration is done in ascending order according
376 cend() const noexcept
377 { return _M_t
.end(); }
380 * Returns a read-only (constant) iterator that points to the last
381 * element in the %set. Iteration is done in descending order according
385 crbegin() const noexcept
386 { return _M_t
.rbegin(); }
389 * Returns a read-only (constant) reverse iterator that points to the
390 * last pair in the %set. Iteration is done in descending order
391 * according to the keys.
394 crend() const noexcept
395 { return _M_t
.rend(); }
398 /// Returns true if the %set is empty.
400 empty() const _GLIBCXX_NOEXCEPT
401 { return _M_t
.empty(); }
403 /// Returns the size of the %set.
405 size() const _GLIBCXX_NOEXCEPT
406 { return _M_t
.size(); }
408 /// Returns the maximum size of the %set.
410 max_size() const _GLIBCXX_NOEXCEPT
411 { return _M_t
.max_size(); }
414 * @brief Swaps data with another %set.
415 * @param __x A %set of the same element and allocator types.
417 * This exchanges the elements between two sets in constant
418 * time. (It is only swapping a pointer, an integer, and an
419 * instance of the @c Compare type (which itself is often
420 * stateless and empty), so it should be quite fast.) Note
421 * that the global std::swap() function is specialized such
422 * that std::swap(s1,s2) will feed to this function.
424 * Whether the allocators are swapped depends on the allocator traits.
428 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable
<_Compare
>::value
)
429 { _M_t
.swap(__x
._M_t
); }
432 #if __cplusplus >= 201103L
434 * @brief Attempts to build and insert an element into the %set.
435 * @param __args Arguments used to generate an element.
436 * @return A pair, of which the first element is an iterator that points
437 * to the possibly inserted element, and the second is a bool
438 * that is true if the element was actually inserted.
440 * This function attempts to build and insert an element into the %set.
441 * A %set relies on unique keys and thus an element is only inserted if
442 * it is not already present in the %set.
444 * Insertion requires logarithmic time.
446 template<typename
... _Args
>
447 std::pair
<iterator
, bool>
448 emplace(_Args
&&... __args
)
449 { return _M_t
._M_emplace_unique(std::forward
<_Args
>(__args
)...); }
452 * @brief Attempts to insert an element into the %set.
453 * @param __pos An iterator that serves as a hint as to where the
454 * element should be inserted.
455 * @param __args Arguments used to generate the element to be
457 * @return An iterator that points to the element with key equivalent to
458 * the one generated from @a __args (may or may not be the
461 * This function is not concerned about whether the insertion took place,
462 * and thus does not return a boolean like the single-argument emplace()
463 * does. Note that the first parameter is only a hint and can
464 * potentially improve the performance of the insertion process. A bad
465 * hint would cause no gains in efficiency.
467 * For more on @a hinting, see:
468 * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
470 * Insertion requires logarithmic time (if the hint is not taken).
472 template<typename
... _Args
>
474 emplace_hint(const_iterator __pos
, _Args
&&... __args
)
476 return _M_t
._M_emplace_hint_unique(__pos
,
477 std::forward
<_Args
>(__args
)...);
482 * @brief Attempts to insert an element into the %set.
483 * @param __x Element to be inserted.
484 * @return A pair, of which the first element is an iterator that points
485 * to the possibly inserted element, and the second is a bool
486 * that is true if the element was actually inserted.
488 * This function attempts to insert an element into the %set. A %set
489 * relies on unique keys and thus an element is only inserted if it is
490 * not already present in the %set.
492 * Insertion requires logarithmic time.
494 std::pair
<iterator
, bool>
495 insert(const value_type
& __x
)
497 std::pair
<typename
_Rep_type::iterator
, bool> __p
=
498 _M_t
._M_insert_unique(__x
);
499 return std::pair
<iterator
, bool>(__p
.first
, __p
.second
);
502 #if __cplusplus >= 201103L
503 std::pair
<iterator
, bool>
504 insert(value_type
&& __x
)
506 std::pair
<typename
_Rep_type::iterator
, bool> __p
=
507 _M_t
._M_insert_unique(std::move(__x
));
508 return std::pair
<iterator
, bool>(__p
.first
, __p
.second
);
513 * @brief Attempts to insert an element into the %set.
514 * @param __position An iterator that serves as a hint as to where the
515 * element should be inserted.
516 * @param __x Element to be inserted.
517 * @return An iterator that points to the element with key of
518 * @a __x (may or may not be the element passed in).
520 * This function is not concerned about whether the insertion took place,
521 * and thus does not return a boolean like the single-argument insert()
522 * does. Note that the first parameter is only a hint and can
523 * potentially improve the performance of the insertion process. A bad
524 * hint would cause no gains in efficiency.
526 * For more on @a hinting, see:
527 * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
529 * Insertion requires logarithmic time (if the hint is not taken).
532 insert(const_iterator __position
, const value_type
& __x
)
533 { return _M_t
._M_insert_unique_(__position
, __x
); }
535 #if __cplusplus >= 201103L
537 insert(const_iterator __position
, value_type
&& __x
)
538 { return _M_t
._M_insert_unique_(__position
, std::move(__x
)); }
542 * @brief A template function that attempts to insert a range
544 * @param __first Iterator pointing to the start of the range to be
546 * @param __last Iterator pointing to the end of the range.
548 * Complexity similar to that of the range constructor.
550 template<typename _InputIterator
>
552 insert(_InputIterator __first
, _InputIterator __last
)
553 { _M_t
._M_insert_unique(__first
, __last
); }
555 #if __cplusplus >= 201103L
557 * @brief Attempts to insert a list of elements into the %set.
558 * @param __l A std::initializer_list<value_type> of elements
561 * Complexity similar to that of the range constructor.
564 insert(initializer_list
<value_type
> __l
)
565 { this->insert(__l
.begin(), __l
.end()); }
568 #if __cplusplus > 201402L
571 extract(const_iterator __pos
)
573 __glibcxx_assert(__pos
!= end());
574 return _M_t
.extract(__pos
);
579 extract(const key_type
& __x
)
580 { return _M_t
.extract(__x
); }
582 /// Re-insert an extracted node.
584 insert(node_type
&& __nh
)
585 { return _M_t
._M_reinsert_node_unique(std::move(__nh
)); }
587 /// Re-insert an extracted node.
589 insert(const_iterator __hint
, node_type
&& __nh
)
590 { return _M_t
._M_reinsert_node_hint_unique(__hint
, std::move(__nh
)); }
592 template<typename
, typename
>
593 friend class _Rb_tree_merge_helper
;
595 template<typename _Compare1
>
597 merge(set
<_Key
, _Compare1
, _Alloc
>& __source
)
599 using _Merge_helper
= _Rb_tree_merge_helper
<set
, _Compare1
>;
600 _M_t
._M_merge_unique(_Merge_helper::_S_get_tree(__source
));
603 template<typename _Compare1
>
605 merge(set
<_Key
, _Compare1
, _Alloc
>&& __source
)
608 template<typename _Compare1
>
610 merge(multiset
<_Key
, _Compare1
, _Alloc
>& __source
)
612 using _Merge_helper
= _Rb_tree_merge_helper
<set
, _Compare1
>;
613 _M_t
._M_merge_unique(_Merge_helper::_S_get_tree(__source
));
616 template<typename _Compare1
>
618 merge(multiset
<_Key
, _Compare1
, _Alloc
>&& __source
)
622 #if __cplusplus >= 201103L
623 // _GLIBCXX_RESOLVE_LIB_DEFECTS
624 // DR 130. Associative erase should return an iterator.
626 * @brief Erases an element from a %set.
627 * @param __position An iterator pointing to the element to be erased.
628 * @return An iterator pointing to the element immediately following
629 * @a __position prior to the element being erased. If no such
630 * element exists, end() is returned.
632 * This function erases an element, pointed to by the given iterator,
633 * from a %set. Note that this function only erases the element, and
634 * that if the element is itself a pointer, the pointed-to memory is not
635 * touched in any way. Managing the pointer is the user's
638 _GLIBCXX_ABI_TAG_CXX11
640 erase(const_iterator __position
)
641 { return _M_t
.erase(__position
); }
644 * @brief Erases an element from a %set.
645 * @param position An iterator pointing to the element to be erased.
647 * This function erases an element, pointed to by the given iterator,
648 * from a %set. Note that this function only erases the element, and
649 * that if the element is itself a pointer, the pointed-to memory is not
650 * touched in any way. Managing the pointer is the user's
654 erase(iterator __position
)
655 { _M_t
.erase(__position
); }
659 * @brief Erases elements according to the provided key.
660 * @param __x Key of element to be erased.
661 * @return The number of elements erased.
663 * This function erases all the elements located by the given key from
665 * Note that this function only erases the element, and that if
666 * the element is itself a pointer, the pointed-to memory is not touched
667 * in any way. Managing the pointer is the user's responsibility.
670 erase(const key_type
& __x
)
671 { return _M_t
.erase(__x
); }
673 #if __cplusplus >= 201103L
674 // _GLIBCXX_RESOLVE_LIB_DEFECTS
675 // DR 130. Associative erase should return an iterator.
677 * @brief Erases a [__first,__last) range of elements from a %set.
678 * @param __first Iterator pointing to the start of the range to be
681 * @param __last Iterator pointing to the end of the range to
683 * @return The iterator @a __last.
685 * This function erases a sequence of elements from a %set.
686 * Note that this function only erases the element, and that if
687 * the element is itself a pointer, the pointed-to memory is not touched
688 * in any way. Managing the pointer is the user's responsibility.
690 _GLIBCXX_ABI_TAG_CXX11
692 erase(const_iterator __first
, const_iterator __last
)
693 { return _M_t
.erase(__first
, __last
); }
696 * @brief Erases a [first,last) range of elements from a %set.
697 * @param __first Iterator pointing to the start of the range to be
699 * @param __last Iterator pointing to the end of the range to
702 * This function erases a sequence of elements from a %set.
703 * Note that this function only erases the element, and that if
704 * the element is itself a pointer, the pointed-to memory is not touched
705 * in any way. Managing the pointer is the user's responsibility.
708 erase(iterator __first
, iterator __last
)
709 { _M_t
.erase(__first
, __last
); }
713 * Erases all elements in a %set. Note that this function only erases
714 * the elements, and that if the elements themselves are pointers, the
715 * pointed-to memory is not touched in any way. Managing the pointer is
716 * the user's responsibility.
719 clear() _GLIBCXX_NOEXCEPT
726 * @brief Finds the number of elements.
727 * @param __x Element to located.
728 * @return Number of elements with specified key.
730 * This function only makes sense for multisets; for set the result will
731 * either be 0 (not present) or 1 (present).
734 count(const key_type
& __x
) const
735 { return _M_t
.find(__x
) == _M_t
.end() ? 0 : 1; }
737 #if __cplusplus > 201103L
738 template<typename _Kt
>
740 count(const _Kt
& __x
) const
741 -> decltype(_M_t
._M_count_tr(__x
))
742 { return _M_t
._M_find_tr(__x
) == _M_t
.end() ? 0 : 1; }
746 // _GLIBCXX_RESOLVE_LIB_DEFECTS
747 // 214. set::find() missing const overload
750 * @brief Tries to locate an element in a %set.
751 * @param __x Element to be located.
752 * @return Iterator pointing to sought-after element, or end() if not
755 * This function takes a key and tries to locate the element with which
756 * the key matches. If successful the function returns an iterator
757 * pointing to the sought after element. If unsuccessful it returns the
758 * past-the-end ( @c end() ) iterator.
761 find(const key_type
& __x
)
762 { return _M_t
.find(__x
); }
765 find(const key_type
& __x
) const
766 { return _M_t
.find(__x
); }
768 #if __cplusplus > 201103L
769 template<typename _Kt
>
772 -> decltype(iterator
{_M_t
._M_find_tr(__x
)})
773 { return iterator
{_M_t
._M_find_tr(__x
)}; }
775 template<typename _Kt
>
777 find(const _Kt
& __x
) const
778 -> decltype(const_iterator
{_M_t
._M_find_tr(__x
)})
779 { return const_iterator
{_M_t
._M_find_tr(__x
)}; }
785 * @brief Finds the beginning of a subsequence matching given key.
786 * @param __x Key to be located.
787 * @return Iterator pointing to first element equal to or greater
788 * than key, or end().
790 * This function returns the first element of a subsequence of elements
791 * that matches the given key. If unsuccessful it returns an iterator
792 * pointing to the first element that has a greater value than given key
793 * or end() if no such element exists.
796 lower_bound(const key_type
& __x
)
797 { return _M_t
.lower_bound(__x
); }
800 lower_bound(const key_type
& __x
) const
801 { return _M_t
.lower_bound(__x
); }
803 #if __cplusplus > 201103L
804 template<typename _Kt
>
806 lower_bound(const _Kt
& __x
)
807 -> decltype(_M_t
._M_lower_bound_tr(__x
))
808 { return _M_t
._M_lower_bound_tr(__x
); }
810 template<typename _Kt
>
812 lower_bound(const _Kt
& __x
) const
813 -> decltype(_M_t
._M_lower_bound_tr(__x
))
814 { return _M_t
._M_lower_bound_tr(__x
); }
820 * @brief Finds the end of a subsequence matching given key.
821 * @param __x Key to be located.
822 * @return Iterator pointing to the first element
823 * greater than key, or end().
826 upper_bound(const key_type
& __x
)
827 { return _M_t
.upper_bound(__x
); }
830 upper_bound(const key_type
& __x
) const
831 { return _M_t
.upper_bound(__x
); }
833 #if __cplusplus > 201103L
834 template<typename _Kt
>
836 upper_bound(const _Kt
& __x
)
837 -> decltype(_M_t
._M_upper_bound_tr(__x
))
838 { return _M_t
._M_upper_bound_tr(__x
); }
840 template<typename _Kt
>
842 upper_bound(const _Kt
& __x
) const
843 -> decltype(_M_t
._M_upper_bound_tr(__x
))
844 { return _M_t
._M_upper_bound_tr(__x
); }
850 * @brief Finds a subsequence matching given key.
851 * @param __x Key to be located.
852 * @return Pair of iterators that possibly points to the subsequence
853 * matching given key.
855 * This function is equivalent to
857 * std::make_pair(c.lower_bound(val),
858 * c.upper_bound(val))
860 * (but is faster than making the calls separately).
862 * This function probably only makes sense for multisets.
864 std::pair
<iterator
, iterator
>
865 equal_range(const key_type
& __x
)
866 { return _M_t
.equal_range(__x
); }
868 std::pair
<const_iterator
, const_iterator
>
869 equal_range(const key_type
& __x
) const
870 { return _M_t
.equal_range(__x
); }
872 #if __cplusplus > 201103L
873 template<typename _Kt
>
875 equal_range(const _Kt
& __x
)
876 -> decltype(_M_t
._M_equal_range_tr(__x
))
877 { return _M_t
._M_equal_range_tr(__x
); }
879 template<typename _Kt
>
881 equal_range(const _Kt
& __x
) const
882 -> decltype(_M_t
._M_equal_range_tr(__x
))
883 { return _M_t
._M_equal_range_tr(__x
); }
887 template<typename _K1
, typename _C1
, typename _A1
>
889 operator==(const set
<_K1
, _C1
, _A1
>&, const set
<_K1
, _C1
, _A1
>&);
891 template<typename _K1
, typename _C1
, typename _A1
>
893 operator<(const set
<_K1
, _C1
, _A1
>&, const set
<_K1
, _C1
, _A1
>&);
898 * @brief Set equality comparison.
900 * @param __y A %set of the same type as @a x.
901 * @return True iff the size and elements of the sets are equal.
903 * This is an equivalence relation. It is linear in the size of the sets.
904 * Sets are considered equivalent if their sizes are equal, and if
905 * corresponding elements compare equal.
907 template<typename _Key
, typename _Compare
, typename _Alloc
>
909 operator==(const set
<_Key
, _Compare
, _Alloc
>& __x
,
910 const set
<_Key
, _Compare
, _Alloc
>& __y
)
911 { return __x
._M_t
== __y
._M_t
; }
914 * @brief Set ordering relation.
916 * @param __y A %set of the same type as @a x.
917 * @return True iff @a __x is lexicographically less than @a __y.
919 * This is a total ordering relation. It is linear in the size of the
920 * sets. The elements must be comparable with @c <.
922 * See std::lexicographical_compare() for how the determination is made.
924 template<typename _Key
, typename _Compare
, typename _Alloc
>
926 operator<(const set
<_Key
, _Compare
, _Alloc
>& __x
,
927 const set
<_Key
, _Compare
, _Alloc
>& __y
)
928 { return __x
._M_t
< __y
._M_t
; }
930 /// Returns !(x == y).
931 template<typename _Key
, typename _Compare
, typename _Alloc
>
933 operator!=(const set
<_Key
, _Compare
, _Alloc
>& __x
,
934 const set
<_Key
, _Compare
, _Alloc
>& __y
)
935 { return !(__x
== __y
); }
938 template<typename _Key
, typename _Compare
, typename _Alloc
>
940 operator>(const set
<_Key
, _Compare
, _Alloc
>& __x
,
941 const set
<_Key
, _Compare
, _Alloc
>& __y
)
942 { return __y
< __x
; }
945 template<typename _Key
, typename _Compare
, typename _Alloc
>
947 operator<=(const set
<_Key
, _Compare
, _Alloc
>& __x
,
948 const set
<_Key
, _Compare
, _Alloc
>& __y
)
949 { return !(__y
< __x
); }
952 template<typename _Key
, typename _Compare
, typename _Alloc
>
954 operator>=(const set
<_Key
, _Compare
, _Alloc
>& __x
,
955 const set
<_Key
, _Compare
, _Alloc
>& __y
)
956 { return !(__x
< __y
); }
958 /// See std::set::swap().
959 template<typename _Key
, typename _Compare
, typename _Alloc
>
961 swap(set
<_Key
, _Compare
, _Alloc
>& __x
, set
<_Key
, _Compare
, _Alloc
>& __y
)
962 _GLIBCXX_NOEXCEPT_IF(noexcept(__x
.swap(__y
)))
965 _GLIBCXX_END_NAMESPACE_CONTAINER
967 #if __cplusplus > 201402L
968 _GLIBCXX_BEGIN_NAMESPACE_VERSION
969 // Allow std::set access to internals of compatible sets.
970 template<typename _Val
, typename _Cmp1
, typename _Alloc
, typename _Cmp2
>
972 _Rb_tree_merge_helper
<_GLIBCXX_STD_C::set
<_Val
, _Cmp1
, _Alloc
>, _Cmp2
>
975 friend class _GLIBCXX_STD_C::set
<_Val
, _Cmp1
, _Alloc
>;
978 _S_get_tree(_GLIBCXX_STD_C::set
<_Val
, _Cmp2
, _Alloc
>& __set
)
979 { return __set
._M_t
; }
982 _S_get_tree(_GLIBCXX_STD_C::multiset
<_Val
, _Cmp2
, _Alloc
>& __set
)
983 { return __set
._M_t
; }
985 _GLIBCXX_END_NAMESPACE_VERSION
989 #endif /* _STL_SET_H */