61 #pragma GCC system_header
68 #if __cplusplus >= 201103L
71 #if __cplusplus > 201402L
75 namespace std _GLIBCXX_VISIBILITY(default)
77 _GLIBCXX_BEGIN_NAMESPACE_VERSION
79 #if __cplusplus > 201103L
80 # define __cpp_lib_generic_associative_lookup 201304
99 enum _Rb_tree_color { _S_red =
false, _S_black =
true };
101 struct _Rb_tree_node_base
103 typedef _Rb_tree_node_base* _Base_ptr;
104 typedef const _Rb_tree_node_base* _Const_Base_ptr;
106 _Rb_tree_color _M_color;
112 _S_minimum(_Base_ptr __x) _GLIBCXX_NOEXCEPT
114 while (__x->_M_left != 0) __x = __x->_M_left;
118 static _Const_Base_ptr
119 _S_minimum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
121 while (__x->_M_left != 0) __x = __x->_M_left;
126 _S_maximum(_Base_ptr __x) _GLIBCXX_NOEXCEPT
128 while (__x->_M_right != 0) __x = __x->_M_right;
132 static _Const_Base_ptr
133 _S_maximum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
135 while (__x->_M_right != 0) __x = __x->_M_right;
141 template<
typename _Key_compare>
142 struct _Rb_tree_key_compare
144 _Key_compare _M_key_compare;
146 _Rb_tree_key_compare()
147 _GLIBCXX_NOEXCEPT_IF(
148 is_nothrow_default_constructible<_Key_compare>::value)
152 _Rb_tree_key_compare(
const _Key_compare& __comp)
153 : _M_key_compare(__comp)
156 #if __cplusplus >= 201103L
158 _Rb_tree_key_compare(
const _Rb_tree_key_compare&) =
default;
160 _Rb_tree_key_compare(_Rb_tree_key_compare&& __x)
161 noexcept(is_nothrow_copy_constructible<_Key_compare>::value)
162 : _M_key_compare(__x._M_key_compare)
168 struct _Rb_tree_header
170 _Rb_tree_node_base _M_header;
171 size_t _M_node_count;
173 _Rb_tree_header() _GLIBCXX_NOEXCEPT
175 _M_header._M_color = _S_red;
179 #if __cplusplus >= 201103L
180 _Rb_tree_header(_Rb_tree_header&& __x) noexcept
182 if (__x._M_header._M_parent !=
nullptr)
186 _M_header._M_color = _S_red;
193 _M_move_data(_Rb_tree_header& __from)
195 _M_header._M_color = __from._M_header._M_color;
196 _M_header._M_parent = __from._M_header._M_parent;
197 _M_header._M_left = __from._M_header._M_left;
198 _M_header._M_right = __from._M_header._M_right;
199 _M_header._M_parent->_M_parent = &_M_header;
200 _M_node_count = __from._M_node_count;
208 _M_header._M_parent = 0;
209 _M_header._M_left = &_M_header;
210 _M_header._M_right = &_M_header;
215 template<
typename _Val>
216 struct _Rb_tree_node :
public _Rb_tree_node_base
218 typedef _Rb_tree_node<_Val>* _Link_type;
220 #if __cplusplus < 201103L
231 __gnu_cxx::__aligned_membuf<_Val> _M_storage;
235 {
return _M_storage._M_ptr(); }
239 {
return _M_storage._M_ptr(); }
243 _GLIBCXX_PURE _Rb_tree_node_base*
244 _Rb_tree_increment(_Rb_tree_node_base* __x)
throw ();
246 _GLIBCXX_PURE
const _Rb_tree_node_base*
247 _Rb_tree_increment(
const _Rb_tree_node_base* __x)
throw ();
249 _GLIBCXX_PURE _Rb_tree_node_base*
250 _Rb_tree_decrement(_Rb_tree_node_base* __x)
throw ();
252 _GLIBCXX_PURE
const _Rb_tree_node_base*
253 _Rb_tree_decrement(
const _Rb_tree_node_base* __x)
throw ();
255 template<
typename _Tp>
256 struct _Rb_tree_iterator
258 typedef _Tp value_type;
259 typedef _Tp& reference;
260 typedef _Tp* pointer;
262 typedef bidirectional_iterator_tag iterator_category;
263 typedef ptrdiff_t difference_type;
265 typedef _Rb_tree_iterator<_Tp> _Self;
266 typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
267 typedef _Rb_tree_node<_Tp>* _Link_type;
269 _Rb_tree_iterator() _GLIBCXX_NOEXCEPT
273 _Rb_tree_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
278 {
return *
static_cast<_Link_type
>(_M_node)->_M_valptr(); }
282 {
return static_cast<_Link_type
> (_M_node)->_M_valptr(); }
285 operator++() _GLIBCXX_NOEXCEPT
287 _M_node = _Rb_tree_increment(_M_node);
292 operator++(
int) _GLIBCXX_NOEXCEPT
295 _M_node = _Rb_tree_increment(_M_node);
300 operator--() _GLIBCXX_NOEXCEPT
302 _M_node = _Rb_tree_decrement(_M_node);
307 operator--(
int) _GLIBCXX_NOEXCEPT
310 _M_node = _Rb_tree_decrement(_M_node);
315 operator==(
const _Self& __x,
const _Self& __y) _GLIBCXX_NOEXCEPT
316 {
return __x._M_node == __y._M_node; }
318 #if ! __cpp_lib_three_way_comparison
320 operator!=(
const _Self& __x,
const _Self& __y) _GLIBCXX_NOEXCEPT
321 {
return __x._M_node != __y._M_node; }
327 template<
typename _Tp>
328 struct _Rb_tree_const_iterator
330 typedef _Tp value_type;
331 typedef const _Tp& reference;
332 typedef const _Tp* pointer;
334 typedef _Rb_tree_iterator<_Tp> iterator;
336 typedef bidirectional_iterator_tag iterator_category;
337 typedef ptrdiff_t difference_type;
339 typedef _Rb_tree_const_iterator<_Tp> _Self;
340 typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
341 typedef const _Rb_tree_node<_Tp>* _Link_type;
343 _Rb_tree_const_iterator() _GLIBCXX_NOEXCEPT
347 _Rb_tree_const_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
350 _Rb_tree_const_iterator(
const iterator& __it) _GLIBCXX_NOEXCEPT
351 : _M_node(__it._M_node) { }
354 _M_const_cast() const _GLIBCXX_NOEXCEPT
355 {
return iterator(
const_cast<typename iterator::_Base_ptr
>(_M_node)); }
359 {
return *
static_cast<_Link_type
>(_M_node)->_M_valptr(); }
363 {
return static_cast<_Link_type
>(_M_node)->_M_valptr(); }
366 operator++() _GLIBCXX_NOEXCEPT
368 _M_node = _Rb_tree_increment(_M_node);
373 operator++(
int) _GLIBCXX_NOEXCEPT
376 _M_node = _Rb_tree_increment(_M_node);
381 operator--() _GLIBCXX_NOEXCEPT
383 _M_node = _Rb_tree_decrement(_M_node);
388 operator--(
int) _GLIBCXX_NOEXCEPT
391 _M_node = _Rb_tree_decrement(_M_node);
396 operator==(
const _Self& __x,
const _Self& __y) _GLIBCXX_NOEXCEPT
397 {
return __x._M_node == __y._M_node; }
399 #if ! __cpp_lib_three_way_comparison
401 operator!=(
const _Self& __x,
const _Self& __y) _GLIBCXX_NOEXCEPT
402 {
return __x._M_node != __y._M_node; }
409 _Rb_tree_insert_and_rebalance(
const bool __insert_left,
410 _Rb_tree_node_base* __x,
411 _Rb_tree_node_base* __p,
412 _Rb_tree_node_base& __header)
throw ();
415 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base*
const __z,
416 _Rb_tree_node_base& __header)
throw ();
418 #if __cplusplus >= 201402L
419 template<
typename _Cmp,
typename _SfinaeType,
typename = __
void_t<>>
420 struct __has_is_transparent
423 template<
typename _Cmp,
typename _SfinaeType>
424 struct __has_is_transparent<_Cmp, _SfinaeType,
425 __void_t<typename _Cmp::is_transparent>>
426 {
typedef void type; };
428 template<
typename _Cmp,
typename _SfinaeType>
429 using __has_is_transparent_t
430 =
typename __has_is_transparent<_Cmp, _SfinaeType>::type;
433 #if __cplusplus > 201402L
434 template<
typename _Tree1,
typename _Cmp2>
435 struct _Rb_tree_merge_helper { };
438 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
439 typename _Compare,
typename _Alloc = allocator<_Val> >
443 rebind<_Rb_tree_node<_Val> >::other _Node_allocator;
448 typedef _Rb_tree_node_base* _Base_ptr;
449 typedef const _Rb_tree_node_base* _Const_Base_ptr;
450 typedef _Rb_tree_node<_Val>* _Link_type;
451 typedef const _Rb_tree_node<_Val>* _Const_Link_type;
456 struct _Reuse_or_alloc_node
458 _Reuse_or_alloc_node(_Rb_tree& __t)
459 : _M_root(__t._M_root()), _M_nodes(__t._M_rightmost()), _M_t(__t)
463 _M_root->_M_parent = 0;
465 if (_M_nodes->_M_left)
466 _M_nodes = _M_nodes->_M_left;
472 #if __cplusplus >= 201103L
473 _Reuse_or_alloc_node(
const _Reuse_or_alloc_node&) =
delete;
476 ~_Reuse_or_alloc_node()
477 { _M_t._M_erase(
static_cast<_Link_type
>(_M_root)); }
479 template<
typename _Arg>
481 operator()(_GLIBCXX_FWDREF(_Arg) __arg)
483 _Link_type __node =
static_cast<_Link_type
>(_M_extract());
486 _M_t._M_destroy_node(__node);
487 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg));
491 return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg));
501 _Base_ptr __node = _M_nodes;
502 _M_nodes = _M_nodes->_M_parent;
505 if (_M_nodes->_M_right == __node)
507 _M_nodes->_M_right = 0;
509 if (_M_nodes->_M_left)
511 _M_nodes = _M_nodes->_M_left;
513 while (_M_nodes->_M_right)
514 _M_nodes = _M_nodes->_M_right;
516 if (_M_nodes->_M_left)
517 _M_nodes = _M_nodes->_M_left;
521 _M_nodes->_M_left = 0;
538 _Alloc_node(_Rb_tree& __t)
541 template<
typename _Arg>
543 operator()(_GLIBCXX_FWDREF(_Arg) __arg)
const
544 {
return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg)); }
551 typedef _Key key_type;
552 typedef _Val value_type;
553 typedef value_type* pointer;
554 typedef const value_type* const_pointer;
555 typedef value_type& reference;
556 typedef const value_type& const_reference;
557 typedef size_t size_type;
558 typedef ptrdiff_t difference_type;
559 typedef _Alloc allocator_type;
562 _M_get_Node_allocator() _GLIBCXX_NOEXCEPT
563 {
return this->_M_impl; }
565 const _Node_allocator&
566 _M_get_Node_allocator() const _GLIBCXX_NOEXCEPT
567 {
return this->_M_impl; }
570 get_allocator() const _GLIBCXX_NOEXCEPT
571 {
return allocator_type(_M_get_Node_allocator()); }
579 _M_put_node(_Link_type __p) _GLIBCXX_NOEXCEPT
582 #if __cplusplus < 201103L
584 _M_construct_node(_Link_type __node,
const value_type& __x)
587 { get_allocator().construct(__node->_M_valptr(), __x); }
591 __throw_exception_again;
596 _M_create_node(
const value_type& __x)
598 _Link_type __tmp = _M_get_node();
599 _M_construct_node(__tmp, __x);
603 template<
typename... _Args>
605 _M_construct_node(_Link_type __node, _Args&&... __args)
609 ::new(__node) _Rb_tree_node<_Val>;
610 _Alloc_traits::construct(_M_get_Node_allocator(),
612 std::forward<_Args>(__args)...);
616 __node->~_Rb_tree_node<_Val>();
618 __throw_exception_again;
622 template<
typename... _Args>
624 _M_create_node(_Args&&... __args)
626 _Link_type __tmp = _M_get_node();
627 _M_construct_node(__tmp, std::forward<_Args>(__args)...);
633 _M_destroy_node(_Link_type __p) _GLIBCXX_NOEXCEPT
635 #if __cplusplus < 201103L
636 get_allocator().destroy(__p->_M_valptr());
638 _Alloc_traits::destroy(_M_get_Node_allocator(), __p->_M_valptr());
639 __p->~_Rb_tree_node<_Val>();
644 _M_drop_node(_Link_type __p) _GLIBCXX_NOEXCEPT
646 _M_destroy_node(__p);
650 template<
bool _MoveValue,
typename _NodeGen>
652 _M_clone_node(_Link_type __x, _NodeGen& __node_gen)
654 #if __cplusplus >= 201103L
655 using _Vp =
typename conditional<_MoveValue,
657 const value_type&>::type;
660 = __node_gen(_GLIBCXX_FORWARD(_Vp, *__x->_M_valptr()));
661 __tmp->_M_color = __x->_M_color;
668 #if _GLIBCXX_INLINE_VERSION
669 template<
typename _Key_compare>
672 template<
typename _Key_compare,
673 bool = __is_pod(_Key_compare)>
676 :
public _Node_allocator
677 ,
public _Rb_tree_key_compare<_Key_compare>
678 ,
public _Rb_tree_header
680 typedef _Rb_tree_key_compare<_Key_compare> _Base_key_compare;
683 _GLIBCXX_NOEXCEPT_IF(
684 is_nothrow_default_constructible<_Node_allocator>::value
685 && is_nothrow_default_constructible<_Base_key_compare>::value )
689 _Rb_tree_impl(
const _Rb_tree_impl& __x)
690 : _Node_allocator(_Alloc_traits::_S_select_on_copy(__x))
691 , _Base_key_compare(__x._M_key_compare)
695 #if __cplusplus < 201103L
696 _Rb_tree_impl(
const _Key_compare& __comp,
const _Node_allocator& __a)
697 : _Node_allocator(__a), _Base_key_compare(__comp)
700 _Rb_tree_impl(_Rb_tree_impl&&)
701 noexcept( is_nothrow_move_constructible<_Base_key_compare>::value )
705 _Rb_tree_impl(_Node_allocator&& __a)
706 : _Node_allocator(
std::
move(__a))
709 _Rb_tree_impl(_Rb_tree_impl&& __x, _Node_allocator&& __a)
710 : _Node_allocator(
std::
move(__a)),
711 _Base_key_compare(
std::
move(__x)),
712 _Rb_tree_header(
std::
move(__x))
715 _Rb_tree_impl(
const _Key_compare& __comp, _Node_allocator&& __a)
716 : _Node_allocator(
std::
move(__a)), _Base_key_compare(__comp)
721 _Rb_tree_impl<_Compare> _M_impl;
725 _M_root() _GLIBCXX_NOEXCEPT
726 {
return this->_M_impl._M_header._M_parent; }
729 _M_root() const _GLIBCXX_NOEXCEPT
730 {
return this->_M_impl._M_header._M_parent; }
733 _M_leftmost() _GLIBCXX_NOEXCEPT
734 {
return this->_M_impl._M_header._M_left; }
737 _M_leftmost() const _GLIBCXX_NOEXCEPT
738 {
return this->_M_impl._M_header._M_left; }
741 _M_rightmost() _GLIBCXX_NOEXCEPT
742 {
return this->_M_impl._M_header._M_right; }
745 _M_rightmost() const _GLIBCXX_NOEXCEPT
746 {
return this->_M_impl._M_header._M_right; }
749 _M_mbegin() const _GLIBCXX_NOEXCEPT
750 {
return static_cast<_Link_type
>(this->_M_impl._M_header._M_parent); }
753 _M_begin() _GLIBCXX_NOEXCEPT
754 {
return _M_mbegin(); }
757 _M_begin() const _GLIBCXX_NOEXCEPT
759 return static_cast<_Const_Link_type
>
760 (this->_M_impl._M_header._M_parent);
764 _M_end() _GLIBCXX_NOEXCEPT
765 {
return &this->_M_impl._M_header; }
768 _M_end() const _GLIBCXX_NOEXCEPT
769 {
return &this->_M_impl._M_header; }
772 _S_key(_Const_Link_type __x)
774 #if __cplusplus >= 201103L
777 static_assert(__is_invocable<_Compare&, const _Key&, const _Key&>{},
778 "comparison object must be invocable "
779 "with two arguments of key type");
780 # if __cplusplus >= 201703L
783 if constexpr (__is_invocable<_Compare&, const _Key&, const _Key&>{})
785 is_invocable_v<const _Compare&, const _Key&, const _Key&>,
786 "comparison object must be invocable as const");
790 return _KeyOfValue()(*__x->_M_valptr());
794 _S_left(_Base_ptr __x) _GLIBCXX_NOEXCEPT
795 {
return static_cast<_Link_type
>(__x->_M_left); }
797 static _Const_Link_type
798 _S_left(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
799 {
return static_cast<_Const_Link_type
>(__x->_M_left); }
802 _S_right(_Base_ptr __x) _GLIBCXX_NOEXCEPT
803 {
return static_cast<_Link_type
>(__x->_M_right); }
805 static _Const_Link_type
806 _S_right(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
807 {
return static_cast<_Const_Link_type
>(__x->_M_right); }
810 _S_key(_Const_Base_ptr __x)
811 {
return _S_key(
static_cast<_Const_Link_type
>(__x)); }
814 _S_minimum(_Base_ptr __x) _GLIBCXX_NOEXCEPT
815 {
return _Rb_tree_node_base::_S_minimum(__x); }
817 static _Const_Base_ptr
818 _S_minimum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
819 {
return _Rb_tree_node_base::_S_minimum(__x); }
822 _S_maximum(_Base_ptr __x) _GLIBCXX_NOEXCEPT
823 {
return _Rb_tree_node_base::_S_maximum(__x); }
825 static _Const_Base_ptr
826 _S_maximum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
827 {
return _Rb_tree_node_base::_S_maximum(__x); }
830 typedef _Rb_tree_iterator<value_type> iterator;
831 typedef _Rb_tree_const_iterator<value_type> const_iterator;
836 #if __cplusplus > 201402L
837 using node_type = _Node_handle<_Key, _Val, _Node_allocator>;
838 using insert_return_type = _Node_insert_return<
839 conditional_t<is_same_v<_Key, _Val>, const_iterator, iterator>,
843 pair<_Base_ptr, _Base_ptr>
844 _M_get_insert_unique_pos(
const key_type& __k);
846 pair<_Base_ptr, _Base_ptr>
847 _M_get_insert_equal_pos(
const key_type& __k);
849 pair<_Base_ptr, _Base_ptr>
850 _M_get_insert_hint_unique_pos(const_iterator __pos,
851 const key_type& __k);
853 pair<_Base_ptr, _Base_ptr>
854 _M_get_insert_hint_equal_pos(const_iterator __pos,
855 const key_type& __k);
858 #if __cplusplus >= 201103L
859 template<
typename _Arg,
typename _NodeGen>
861 _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v, _NodeGen&);
864 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);
866 template<
typename _Arg>
868 _M_insert_lower(_Base_ptr __y, _Arg&& __v);
870 template<
typename _Arg>
872 _M_insert_equal_lower(_Arg&& __x);
875 _M_insert_lower_node(_Base_ptr __p, _Link_type __z);
878 _M_insert_equal_lower_node(_Link_type __z);
880 template<
typename _NodeGen>
882 _M_insert_(_Base_ptr __x, _Base_ptr __y,
883 const value_type& __v, _NodeGen&);
888 _M_insert_lower(_Base_ptr __y,
const value_type& __v);
891 _M_insert_equal_lower(
const value_type& __x);
894 enum { __as_lvalue, __as_rvalue };
896 template<
bool _MoveValues,
typename _NodeGen>
898 _M_copy(_Link_type, _Base_ptr, _NodeGen&);
900 template<
bool _MoveValues,
typename _NodeGen>
902 _M_copy(
const _Rb_tree& __x, _NodeGen& __gen)
905 _M_copy<_MoveValues>(__x._M_mbegin(), _M_end(), __gen);
906 _M_leftmost() = _S_minimum(__root);
907 _M_rightmost() = _S_maximum(__root);
908 _M_impl._M_node_count = __x._M_impl._M_node_count;
913 _M_copy(
const _Rb_tree& __x)
915 _Alloc_node __an(*
this);
916 return _M_copy<__as_lvalue>(__x, __an);
920 _M_erase(_Link_type __x);
923 _M_lower_bound(_Link_type __x, _Base_ptr __y,
927 _M_lower_bound(_Const_Link_type __x, _Const_Base_ptr __y,
928 const _Key& __k)
const;
931 _M_upper_bound(_Link_type __x, _Base_ptr __y,
935 _M_upper_bound(_Const_Link_type __x, _Const_Base_ptr __y,
936 const _Key& __k)
const;
940 #if __cplusplus < 201103L
943 _Rb_tree() =
default;
946 _Rb_tree(
const _Compare& __comp,
947 const allocator_type& __a = allocator_type())
948 : _M_impl(__comp, _Node_allocator(__a)) { }
950 _Rb_tree(
const _Rb_tree& __x)
951 : _M_impl(__x._M_impl)
953 if (__x._M_root() != 0)
954 _M_root() = _M_copy(__x);
957 #if __cplusplus >= 201103L
958 _Rb_tree(
const allocator_type& __a)
959 : _M_impl(_Node_allocator(__a))
962 _Rb_tree(
const _Rb_tree& __x,
const allocator_type& __a)
963 : _M_impl(__x._M_impl._M_key_compare, _Node_allocator(__a))
965 if (__x._M_root() !=
nullptr)
966 _M_root() = _M_copy(__x);
969 _Rb_tree(_Rb_tree&&) =
default;
971 _Rb_tree(_Rb_tree&& __x,
const allocator_type& __a)
972 : _Rb_tree(
std::
move(__x), _Node_allocator(__a))
976 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a,
true_type)
977 noexcept(is_nothrow_default_constructible<_Compare>::value)
981 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a,
false_type)
982 : _M_impl(__x._M_impl._M_key_compare,
std::
move(__a))
984 if (__x._M_root() !=
nullptr)
989 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a)
991 _Rb_tree(std::declval<_Rb_tree&&>(), std::declval<_Node_allocator&&>(),
992 std::declval<typename _Alloc_traits::is_always_equal>())) )
994 typename _Alloc_traits::is_always_equal{})
998 ~_Rb_tree() _GLIBCXX_NOEXCEPT
999 { _M_erase(_M_begin()); }
1007 {
return _M_impl._M_key_compare; }
1010 begin() _GLIBCXX_NOEXCEPT
1011 {
return iterator(this->_M_impl._M_header._M_left); }
1014 begin() const _GLIBCXX_NOEXCEPT
1015 {
return const_iterator(this->_M_impl._M_header._M_left); }
1018 end() _GLIBCXX_NOEXCEPT
1019 {
return iterator(&this->_M_impl._M_header); }
1022 end() const _GLIBCXX_NOEXCEPT
1023 {
return const_iterator(&this->_M_impl._M_header); }
1026 rbegin() _GLIBCXX_NOEXCEPT
1027 {
return reverse_iterator(
end()); }
1029 const_reverse_iterator
1030 rbegin() const _GLIBCXX_NOEXCEPT
1031 {
return const_reverse_iterator(
end()); }
1034 rend() _GLIBCXX_NOEXCEPT
1035 {
return reverse_iterator(
begin()); }
1037 const_reverse_iterator
1038 rend() const _GLIBCXX_NOEXCEPT
1039 {
return const_reverse_iterator(
begin()); }
1041 _GLIBCXX_NODISCARD
bool
1042 empty() const _GLIBCXX_NOEXCEPT
1043 {
return _M_impl._M_node_count == 0; }
1046 size() const _GLIBCXX_NOEXCEPT
1047 {
return _M_impl._M_node_count; }
1050 max_size() const _GLIBCXX_NOEXCEPT
1055 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value);
1058 #if __cplusplus >= 201103L
1059 template<
typename _Arg>
1060 pair<iterator, bool>
1061 _M_insert_unique(_Arg&& __x);
1063 template<
typename _Arg>
1065 _M_insert_equal(_Arg&& __x);
1067 template<
typename _Arg,
typename _NodeGen>
1069 _M_insert_unique_(const_iterator __pos, _Arg&& __x, _NodeGen&);
1071 template<
typename _Arg>
1073 _M_insert_unique_(const_iterator __pos, _Arg&& __x)
1075 _Alloc_node __an(*
this);
1076 return _M_insert_unique_(__pos, std::forward<_Arg>(__x), __an);
1079 template<
typename _Arg,
typename _NodeGen>
1081 _M_insert_equal_(const_iterator __pos, _Arg&& __x, _NodeGen&);
1083 template<
typename _Arg>
1085 _M_insert_equal_(const_iterator __pos, _Arg&& __x)
1087 _Alloc_node __an(*
this);
1088 return _M_insert_equal_(__pos, std::forward<_Arg>(__x), __an);
1091 template<
typename... _Args>
1092 pair<iterator, bool>
1093 _M_emplace_unique(_Args&&... __args);
1095 template<
typename... _Args>
1097 _M_emplace_equal(_Args&&... __args);
1099 template<
typename... _Args>
1101 _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args);
1103 template<
typename... _Args>
1105 _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args);
1107 template<
typename _Iter>
1108 using __same_value_type
1109 = is_same<value_type, typename iterator_traits<_Iter>::value_type>;
1111 template<
typename _InputIterator>
1112 __enable_if_t<__same_value_type<_InputIterator>::value>
1113 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1115 _Alloc_node __an(*
this);
1116 for (; __first != __last; ++__first)
1117 _M_insert_unique_(
end(), *__first, __an);
1120 template<
typename _InputIterator>
1121 __enable_if_t<!__same_value_type<_InputIterator>::value>
1122 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1124 for (; __first != __last; ++__first)
1125 _M_emplace_unique(*__first);
1128 template<
typename _InputIterator>
1129 __enable_if_t<__same_value_type<_InputIterator>::value>
1130 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1132 _Alloc_node __an(*
this);
1133 for (; __first != __last; ++__first)
1134 _M_insert_equal_(
end(), *__first, __an);
1137 template<
typename _InputIterator>
1138 __enable_if_t<!__same_value_type<_InputIterator>::value>
1139 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1141 _Alloc_node __an(*
this);
1142 for (; __first != __last; ++__first)
1143 _M_emplace_equal(*__first);
1146 pair<iterator, bool>
1147 _M_insert_unique(
const value_type& __x);
1150 _M_insert_equal(
const value_type& __x);
1152 template<
typename _NodeGen>
1154 _M_insert_unique_(const_iterator __pos,
const value_type& __x,
1158 _M_insert_unique_(const_iterator __pos,
const value_type& __x)
1160 _Alloc_node __an(*
this);
1161 return _M_insert_unique_(__pos, __x, __an);
1164 template<
typename _NodeGen>
1166 _M_insert_equal_(const_iterator __pos,
const value_type& __x,
1169 _M_insert_equal_(const_iterator __pos,
const value_type& __x)
1171 _Alloc_node __an(*
this);
1172 return _M_insert_equal_(__pos, __x, __an);
1175 template<
typename _InputIterator>
1177 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1179 _Alloc_node __an(*
this);
1180 for (; __first != __last; ++__first)
1181 _M_insert_unique_(
end(), *__first, __an);
1184 template<
typename _InputIterator>
1186 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1188 _Alloc_node __an(*
this);
1189 for (; __first != __last; ++__first)
1190 _M_insert_equal_(
end(), *__first, __an);
1196 _M_erase_aux(const_iterator __position);
1199 _M_erase_aux(const_iterator __first, const_iterator __last);
1202 #if __cplusplus >= 201103L
1205 _GLIBCXX_ABI_TAG_CXX11
1207 erase(const_iterator __position)
1209 __glibcxx_assert(__position !=
end());
1210 const_iterator __result = __position;
1212 _M_erase_aux(__position);
1213 return __result._M_const_cast();
1217 _GLIBCXX_ABI_TAG_CXX11
1219 erase(iterator __position)
1221 __glibcxx_assert(__position !=
end());
1222 iterator __result = __position;
1224 _M_erase_aux(__position);
1229 erase(iterator __position)
1231 __glibcxx_assert(__position !=
end());
1232 _M_erase_aux(__position);
1236 erase(const_iterator __position)
1238 __glibcxx_assert(__position !=
end());
1239 _M_erase_aux(__position);
1244 erase(
const key_type& __x);
1246 #if __cplusplus >= 201103L
1249 _GLIBCXX_ABI_TAG_CXX11
1251 erase(const_iterator __first, const_iterator __last)
1253 _M_erase_aux(__first, __last);
1254 return __last._M_const_cast();
1258 erase(iterator __first, iterator __last)
1259 { _M_erase_aux(__first, __last); }
1262 erase(const_iterator __first, const_iterator __last)
1263 { _M_erase_aux(__first, __last); }
1267 clear() _GLIBCXX_NOEXCEPT
1269 _M_erase(_M_begin());
1275 find(
const key_type& __k);
1278 find(
const key_type& __k)
const;
1281 count(
const key_type& __k)
const;
1284 lower_bound(
const key_type& __k)
1285 {
return _M_lower_bound(_M_begin(), _M_end(), __k); }
1288 lower_bound(
const key_type& __k)
const
1289 {
return _M_lower_bound(_M_begin(), _M_end(), __k); }
1292 upper_bound(
const key_type& __k)
1293 {
return _M_upper_bound(_M_begin(), _M_end(), __k); }
1296 upper_bound(
const key_type& __k)
const
1297 {
return _M_upper_bound(_M_begin(), _M_end(), __k); }
1299 pair<iterator, iterator>
1300 equal_range(
const key_type& __k);
1302 pair<const_iterator, const_iterator>
1303 equal_range(
const key_type& __k)
const;
1305 #if __cplusplus >= 201402L
1306 template<
typename _Kt,
1307 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1309 _M_find_tr(
const _Kt& __k)
1311 const _Rb_tree* __const_this =
this;
1312 return __const_this->_M_find_tr(__k)._M_const_cast();
1315 template<
typename _Kt,
1316 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1318 _M_find_tr(
const _Kt& __k)
const
1320 auto __j = _M_lower_bound_tr(__k);
1321 if (__j !=
end() && _M_impl._M_key_compare(__k, _S_key(__j._M_node)))
1326 template<
typename _Kt,
1327 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1329 _M_count_tr(
const _Kt& __k)
const
1331 auto __p = _M_equal_range_tr(__k);
1335 template<
typename _Kt,
1336 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1338 _M_lower_bound_tr(
const _Kt& __k)
1340 const _Rb_tree* __const_this =
this;
1341 return __const_this->_M_lower_bound_tr(__k)._M_const_cast();
1344 template<
typename _Kt,
1345 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1347 _M_lower_bound_tr(
const _Kt& __k)
const
1349 auto __x = _M_begin();
1350 auto __y = _M_end();
1352 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1358 __x = _S_right(__x);
1359 return const_iterator(__y);
1362 template<
typename _Kt,
1363 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1365 _M_upper_bound_tr(
const _Kt& __k)
1367 const _Rb_tree* __const_this =
this;
1368 return __const_this->_M_upper_bound_tr(__k)._M_const_cast();
1371 template<
typename _Kt,
1372 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1374 _M_upper_bound_tr(
const _Kt& __k)
const
1376 auto __x = _M_begin();
1377 auto __y = _M_end();
1379 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1385 __x = _S_right(__x);
1386 return const_iterator(__y);
1389 template<
typename _Kt,
1390 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1391 pair<iterator, iterator>
1392 _M_equal_range_tr(
const _Kt& __k)
1394 const _Rb_tree* __const_this =
this;
1395 auto __ret = __const_this->_M_equal_range_tr(__k);
1396 return { __ret.first._M_const_cast(), __ret.second._M_const_cast() };
1399 template<
typename _Kt,
1400 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1401 pair<const_iterator, const_iterator>
1402 _M_equal_range_tr(
const _Kt& __k)
const
1404 auto __low = _M_lower_bound_tr(__k);
1405 auto __high = __low;
1406 auto& __cmp = _M_impl._M_key_compare;
1407 while (__high !=
end() && !__cmp(__k, _S_key(__high._M_node)))
1409 return { __low, __high };
1415 __rb_verify()
const;
1417 #if __cplusplus >= 201103L
1420 noexcept(_Alloc_traits::_S_nothrow_move()
1421 && is_nothrow_move_assignable<_Compare>::value);
1423 template<typename _Iterator>
1425 _M_assign_unique(_Iterator, _Iterator);
1427 template<typename _Iterator>
1429 _M_assign_equal(_Iterator, _Iterator);
1435 { _M_impl._M_move_data(__x._M_impl); }
1452 #if __cplusplus > 201402L
1456 _M_reinsert_node_unique(node_type&& __nh)
1458 insert_return_type __ret;
1460 __ret.position =
end();
1463 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1465 auto __res = _M_get_insert_unique_pos(__nh._M_key());
1469 = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1470 __nh._M_ptr =
nullptr;
1471 __ret.inserted =
true;
1476 __ret.position = iterator(__res.first);
1477 __ret.inserted =
false;
1485 _M_reinsert_node_equal(node_type&& __nh)
1492 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1493 auto __res = _M_get_insert_equal_pos(__nh._M_key());
1495 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1497 __ret = _M_insert_equal_lower_node(__nh._M_ptr);
1498 __nh._M_ptr =
nullptr;
1505 _M_reinsert_node_hint_unique(const_iterator __hint, node_type&& __nh)
1512 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1513 auto __res = _M_get_insert_hint_unique_pos(__hint, __nh._M_key());
1516 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1517 __nh._M_ptr =
nullptr;
1520 __ret = iterator(__res.first);
1527 _M_reinsert_node_hint_equal(const_iterator __hint, node_type&& __nh)
1534 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1535 auto __res = _M_get_insert_hint_equal_pos(__hint, __nh._M_key());
1537 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1539 __ret = _M_insert_equal_lower_node(__nh._M_ptr);
1540 __nh._M_ptr =
nullptr;
1547 extract(const_iterator __pos)
1549 auto __ptr = _Rb_tree_rebalance_for_erase(
1550 __pos._M_const_cast()._M_node, _M_impl._M_header);
1551 --_M_impl._M_node_count;
1552 return {
static_cast<_Link_type
>(__ptr), _M_get_Node_allocator() };
1557 extract(
const key_type& __k)
1560 auto __pos = find(__k);
1562 __nh = extract(const_iterator(__pos));
1566 template<
typename _Compare2>
1567 using _Compatible_tree
1568 = _Rb_tree<_Key, _Val, _KeyOfValue, _Compare2, _Alloc>;
1570 template<
typename,
typename>
1571 friend class _Rb_tree_merge_helper;
1574 template<
typename _Compare2>
1576 _M_merge_unique(_Compatible_tree<_Compare2>& __src) noexcept
1578 using _Merge_helper = _Rb_tree_merge_helper<_Rb_tree, _Compare2>;
1579 for (
auto __i = __src.begin(), __end = __src.end(); __i != __end;)
1582 auto __res = _M_get_insert_unique_pos(_KeyOfValue()(*__pos));
1585 auto& __src_impl = _Merge_helper::_S_get_impl(__src);
1586 auto __ptr = _Rb_tree_rebalance_for_erase(
1587 __pos._M_node, __src_impl._M_header);
1588 --__src_impl._M_node_count;
1589 _M_insert_node(__res.first, __res.second,
1590 static_cast<_Link_type
>(__ptr));
1596 template<
typename _Compare2>
1598 _M_merge_equal(_Compatible_tree<_Compare2>& __src) noexcept
1600 using _Merge_helper = _Rb_tree_merge_helper<_Rb_tree, _Compare2>;
1601 for (
auto __i = __src.begin(), __end = __src.end(); __i != __end;)
1604 auto __res = _M_get_insert_equal_pos(_KeyOfValue()(*__pos));
1607 auto& __src_impl = _Merge_helper::_S_get_impl(__src);
1608 auto __ptr = _Rb_tree_rebalance_for_erase(
1609 __pos._M_node, __src_impl._M_header);
1610 --__src_impl._M_node_count;
1611 _M_insert_node(__res.first, __res.second,
1612 static_cast<_Link_type
>(__ptr));
1619 operator==(
const _Rb_tree& __x,
const _Rb_tree& __y)
1621 return __x.size() == __y.size()
1622 &&
std::equal(__x.begin(), __x.end(), __y.begin());
1625 #if __cpp_lib_three_way_comparison
1627 operator<=>(
const _Rb_tree& __x,
const _Rb_tree& __y)
1629 if constexpr (requires {
typename __detail::__synth3way_t<_Val>; })
1630 return std::lexicographical_compare_three_way(__x.begin(), __x.end(),
1631 __y.begin(), __y.end(),
1632 __detail::__synth3way);
1636 operator<(
const _Rb_tree& __x,
const _Rb_tree& __y)
1639 __y.begin(), __y.end());
1644 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1645 typename _Compare,
typename _Alloc>
1647 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
1648 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
1651 #if __cplusplus >= 201103L
1652 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1653 typename _Compare,
typename _Alloc>
1655 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1658 if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
1662 _Alloc_node __an(*
this);
1664 _M_copy<!__move_if_noexcept_cond<value_type>::value>(__x, __an);
1668 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1669 typename _Compare,
typename _Alloc>
1671 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1672 _M_move_assign(_Rb_tree& __x,
true_type)
1675 if (__x._M_root() !=
nullptr)
1677 std::__alloc_on_move(_M_get_Node_allocator(),
1678 __x._M_get_Node_allocator());
1681 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1682 typename _Compare,
typename _Alloc>
1684 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1687 if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
1688 return _M_move_assign(__x,
true_type{});
1692 _Reuse_or_alloc_node __roan(*
this);
1694 if (__x._M_root() !=
nullptr)
1696 _M_root() = _M_copy<__as_rvalue>(__x, __roan);
1701 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1702 typename _Compare,
typename _Alloc>
1703 inline _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
1706 noexcept(_Alloc_traits::_S_nothrow_move()
1707 && is_nothrow_move_assignable<_Compare>::value)
1709 _M_impl._M_key_compare =
std::move(__x._M_impl._M_key_compare);
1710 _M_move_assign(__x, __bool_constant<_Alloc_traits::_S_nothrow_move()>());
1714 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1715 typename _Compare,
typename _Alloc>
1716 template<
typename _Iterator>
1718 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1719 _M_assign_unique(_Iterator __first, _Iterator __last)
1721 _Reuse_or_alloc_node __roan(*
this);
1723 for (; __first != __last; ++__first)
1724 _M_insert_unique_(
end(), *__first, __roan);
1727 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1728 typename _Compare,
typename _Alloc>
1729 template<
typename _Iterator>
1731 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1732 _M_assign_equal(_Iterator __first, _Iterator __last)
1734 _Reuse_or_alloc_node __roan(*
this);
1736 for (; __first != __last; ++__first)
1737 _M_insert_equal_(
end(), *__first, __roan);
1741 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1742 typename _Compare,
typename _Alloc>
1743 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
1750 #if __cplusplus >= 201103L
1751 if (_Alloc_traits::_S_propagate_on_copy_assign())
1753 auto& __this_alloc = this->_M_get_Node_allocator();
1754 auto& __that_alloc = __x._M_get_Node_allocator();
1755 if (!_Alloc_traits::_S_always_equal()
1756 && __this_alloc != __that_alloc)
1761 std::__alloc_on_copy(__this_alloc, __that_alloc);
1766 _Reuse_or_alloc_node __roan(*
this);
1768 _M_impl._M_key_compare = __x._M_impl._M_key_compare;
1769 if (__x._M_root() != 0)
1770 _M_root() = _M_copy<__as_lvalue>(__x, __roan);
1776 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1777 typename _Compare,
typename _Alloc>
1778 #if __cplusplus >= 201103L
1779 template<
typename _Arg,
typename _NodeGen>
1781 template<
typename _NodeGen>
1783 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1784 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1785 _M_insert_(_Base_ptr __x, _Base_ptr __p,
1786 #
if __cplusplus >= 201103L
1791 _NodeGen& __node_gen)
1793 bool __insert_left = (__x != 0 || __p == _M_end()
1794 || _M_impl._M_key_compare(_KeyOfValue()(__v),
1797 _Link_type __z = __node_gen(_GLIBCXX_FORWARD(_Arg, __v));
1799 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1800 this->_M_impl._M_header);
1801 ++_M_impl._M_node_count;
1802 return iterator(__z);
1805 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1806 typename _Compare,
typename _Alloc>
1807 #if __cplusplus >= 201103L
1808 template<
typename _Arg>
1810 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1811 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1812 #if __cplusplus >= 201103L
1813 _M_insert_lower(_Base_ptr __p, _Arg&& __v)
1815 _M_insert_lower(_Base_ptr __p,
const _Val& __v)
1818 bool __insert_left = (__p == _M_end()
1819 || !_M_impl._M_key_compare(_S_key(__p),
1820 _KeyOfValue()(__v)));
1822 _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v));
1824 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1825 this->_M_impl._M_header);
1826 ++_M_impl._M_node_count;
1827 return iterator(__z);
1830 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1831 typename _Compare,
typename _Alloc>
1832 #if __cplusplus >= 201103L
1833 template<
typename _Arg>
1835 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1836 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1837 #if __cplusplus >= 201103L
1838 _M_insert_equal_lower(_Arg&& __v)
1840 _M_insert_equal_lower(
const _Val& __v)
1843 _Link_type __x = _M_begin();
1844 _Base_ptr __y = _M_end();
1848 __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?
1849 _S_left(__x) : _S_right(__x);
1851 return _M_insert_lower(__y, _GLIBCXX_FORWARD(_Arg, __v));
1854 template<
typename _Key,
typename _Val,
typename _KoV,
1855 typename _Compare,
typename _Alloc>
1856 template<
bool _MoveValues,
typename _NodeGen>
1857 typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
1858 _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
1859 _M_copy(_Link_type __x, _Base_ptr __p, _NodeGen& __node_gen)
1862 _Link_type __top = _M_clone_node<_MoveValues>(__x, __node_gen);
1863 __top->_M_parent = __p;
1869 _M_copy<_MoveValues>(_S_right(__x), __top, __node_gen);
1875 _Link_type __y = _M_clone_node<_MoveValues>(__x, __node_gen);
1877 __y->_M_parent = __p;
1879 __y->_M_right = _M_copy<_MoveValues>(_S_right(__x),
1888 __throw_exception_again;
1893 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1894 typename _Compare,
typename _Alloc>
1896 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1897 _M_erase(_Link_type __x)
1902 _M_erase(_S_right(__x));
1903 _Link_type __y = _S_left(__x);
1909 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1910 typename _Compare,
typename _Alloc>
1911 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1912 _Compare, _Alloc>::iterator
1913 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1914 _M_lower_bound(_Link_type __x, _Base_ptr __y,
1918 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1919 __y = __x, __x = _S_left(__x);
1921 __x = _S_right(__x);
1922 return iterator(__y);
1925 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1926 typename _Compare,
typename _Alloc>
1927 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1928 _Compare, _Alloc>::const_iterator
1929 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1930 _M_lower_bound(_Const_Link_type __x, _Const_Base_ptr __y,
1931 const _Key& __k)
const
1934 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1935 __y = __x, __x = _S_left(__x);
1937 __x = _S_right(__x);
1938 return const_iterator(__y);
1941 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1942 typename _Compare,
typename _Alloc>
1943 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1944 _Compare, _Alloc>::iterator
1945 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1946 _M_upper_bound(_Link_type __x, _Base_ptr __y,
1950 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1951 __y = __x, __x = _S_left(__x);
1953 __x = _S_right(__x);
1954 return iterator(__y);
1957 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1958 typename _Compare,
typename _Alloc>
1959 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1960 _Compare, _Alloc>::const_iterator
1961 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1962 _M_upper_bound(_Const_Link_type __x, _Const_Base_ptr __y,
1963 const _Key& __k)
const
1966 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1967 __y = __x, __x = _S_left(__x);
1969 __x = _S_right(__x);
1970 return const_iterator(__y);
1973 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1974 typename _Compare,
typename _Alloc>
1975 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
1976 _Compare, _Alloc>::iterator,
1977 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1978 _Compare, _Alloc>::iterator>
1979 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1980 equal_range(
const _Key& __k)
1982 _Link_type __x = _M_begin();
1983 _Base_ptr __y = _M_end();
1986 if (_M_impl._M_key_compare(_S_key(__x), __k))
1987 __x = _S_right(__x);
1988 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
1989 __y = __x, __x = _S_left(__x);
1992 _Link_type __xu(__x);
1993 _Base_ptr __yu(__y);
1994 __y = __x, __x = _S_left(__x);
1995 __xu = _S_right(__xu);
1996 return pair<iterator,
1997 iterator>(_M_lower_bound(__x, __y, __k),
1998 _M_upper_bound(__xu, __yu, __k));
2001 return pair<iterator, iterator>(iterator(__y),
2005 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2006 typename _Compare,
typename _Alloc>
2007 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2008 _Compare, _Alloc>::const_iterator,
2009 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2010 _Compare, _Alloc>::const_iterator>
2011 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2012 equal_range(
const _Key& __k)
const
2014 _Const_Link_type __x = _M_begin();
2015 _Const_Base_ptr __y = _M_end();
2018 if (_M_impl._M_key_compare(_S_key(__x), __k))
2019 __x = _S_right(__x);
2020 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
2021 __y = __x, __x = _S_left(__x);
2024 _Const_Link_type __xu(__x);
2025 _Const_Base_ptr __yu(__y);
2026 __y = __x, __x = _S_left(__x);
2027 __xu = _S_right(__xu);
2028 return pair<const_iterator,
2029 const_iterator>(_M_lower_bound(__x, __y, __k),
2030 _M_upper_bound(__xu, __yu, __k));
2033 return pair<const_iterator, const_iterator>(const_iterator(__y),
2034 const_iterator(__y));
2037 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2038 typename _Compare,
typename _Alloc>
2040 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2042 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value)
2046 if (__t._M_root() != 0)
2047 _M_impl._M_move_data(__t._M_impl);
2049 else if (__t._M_root() == 0)
2050 __t._M_impl._M_move_data(_M_impl);
2054 std::swap(_M_leftmost(),__t._M_leftmost());
2055 std::swap(_M_rightmost(),__t._M_rightmost());
2057 _M_root()->_M_parent = _M_end();
2058 __t._M_root()->_M_parent = __t._M_end();
2059 std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
2062 std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);
2064 _Alloc_traits::_S_on_swap(_M_get_Node_allocator(),
2065 __t._M_get_Node_allocator());
2068 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2069 typename _Compare,
typename _Alloc>
2070 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2071 _Compare, _Alloc>::_Base_ptr,
2072 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2073 _Compare, _Alloc>::_Base_ptr>
2074 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2075 _M_get_insert_unique_pos(
const key_type& __k)
2077 typedef pair<_Base_ptr, _Base_ptr> _Res;
2078 _Link_type __x = _M_begin();
2079 _Base_ptr __y = _M_end();
2084 __comp = _M_impl._M_key_compare(__k, _S_key(__x));
2085 __x = __comp ? _S_left(__x) : _S_right(__x);
2087 iterator __j = iterator(__y);
2091 return _Res(__x, __y);
2095 if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
2096 return _Res(__x, __y);
2097 return _Res(__j._M_node, 0);
2100 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2101 typename _Compare,
typename _Alloc>
2102 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2103 _Compare, _Alloc>::_Base_ptr,
2104 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2105 _Compare, _Alloc>::_Base_ptr>
2106 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2107 _M_get_insert_equal_pos(
const key_type& __k)
2109 typedef pair<_Base_ptr, _Base_ptr> _Res;
2110 _Link_type __x = _M_begin();
2111 _Base_ptr __y = _M_end();
2115 __x = _M_impl._M_key_compare(__k, _S_key(__x)) ?
2116 _S_left(__x) : _S_right(__x);
2118 return _Res(__x, __y);
2121 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2122 typename _Compare,
typename _Alloc>
2123 #if __cplusplus >= 201103L
2124 template<
typename _Arg>
2126 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2127 _Compare, _Alloc>::iterator,
bool>
2128 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2129 #if __cplusplus >= 201103L
2130 _M_insert_unique(_Arg&& __v)
2132 _M_insert_unique(
const _Val& __v)
2135 typedef pair<iterator, bool> _Res;
2136 pair<_Base_ptr, _Base_ptr> __res
2137 = _M_get_insert_unique_pos(_KeyOfValue()(__v));
2141 _Alloc_node __an(*
this);
2142 return _Res(_M_insert_(__res.first, __res.second,
2143 _GLIBCXX_FORWARD(_Arg, __v), __an),
2147 return _Res(iterator(__res.first),
false);
2150 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2151 typename _Compare,
typename _Alloc>
2152 #if __cplusplus >= 201103L
2153 template<
typename _Arg>
2155 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2156 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2157 #if __cplusplus >= 201103L
2158 _M_insert_equal(_Arg&& __v)
2160 _M_insert_equal(
const _Val& __v)
2163 pair<_Base_ptr, _Base_ptr> __res
2164 = _M_get_insert_equal_pos(_KeyOfValue()(__v));
2165 _Alloc_node __an(*
this);
2166 return _M_insert_(__res.first, __res.second,
2167 _GLIBCXX_FORWARD(_Arg, __v), __an);
2170 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2171 typename _Compare,
typename _Alloc>
2172 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2173 _Compare, _Alloc>::_Base_ptr,
2174 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2175 _Compare, _Alloc>::_Base_ptr>
2176 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2177 _M_get_insert_hint_unique_pos(const_iterator __position,
2178 const key_type& __k)
2180 iterator __pos = __position._M_const_cast();
2181 typedef pair<_Base_ptr, _Base_ptr> _Res;
2184 if (__pos._M_node == _M_end())
2187 && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))
2188 return _Res(0, _M_rightmost());
2190 return _M_get_insert_unique_pos(__k);
2192 else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node)))
2195 iterator __before = __pos;
2196 if (__pos._M_node == _M_leftmost())
2197 return _Res(_M_leftmost(), _M_leftmost());
2198 else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))
2200 if (_S_right(__before._M_node) == 0)
2201 return _Res(0, __before._M_node);
2203 return _Res(__pos._M_node, __pos._M_node);
2206 return _M_get_insert_unique_pos(__k);
2208 else if (_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
2211 iterator __after = __pos;
2212 if (__pos._M_node == _M_rightmost())
2213 return _Res(0, _M_rightmost());
2214 else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))
2216 if (_S_right(__pos._M_node) == 0)
2217 return _Res(0, __pos._M_node);
2219 return _Res(__after._M_node, __after._M_node);
2222 return _M_get_insert_unique_pos(__k);
2226 return _Res(__pos._M_node, 0);
2229 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2230 typename _Compare,
typename _Alloc>
2231 #if __cplusplus >= 201103L
2232 template<
typename _Arg,
typename _NodeGen>
2234 template<
typename _NodeGen>
2236 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2237 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2238 _M_insert_unique_(const_iterator __position,
2239 #
if __cplusplus >= 201103L
2244 _NodeGen& __node_gen)
2246 pair<_Base_ptr, _Base_ptr> __res
2247 = _M_get_insert_hint_unique_pos(__position, _KeyOfValue()(__v));
2250 return _M_insert_(__res.first, __res.second,
2251 _GLIBCXX_FORWARD(_Arg, __v),
2253 return iterator(__res.first);
2256 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2257 typename _Compare,
typename _Alloc>
2258 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2259 _Compare, _Alloc>::_Base_ptr,
2260 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2261 _Compare, _Alloc>::_Base_ptr>
2262 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2263 _M_get_insert_hint_equal_pos(const_iterator __position,
const key_type& __k)
2265 iterator __pos = __position._M_const_cast();
2266 typedef pair<_Base_ptr, _Base_ptr> _Res;
2269 if (__pos._M_node == _M_end())
2272 && !_M_impl._M_key_compare(__k, _S_key(_M_rightmost())))
2273 return _Res(0, _M_rightmost());
2275 return _M_get_insert_equal_pos(__k);
2277 else if (!_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
2280 iterator __before = __pos;
2281 if (__pos._M_node == _M_leftmost())
2282 return _Res(_M_leftmost(), _M_leftmost());
2283 else if (!_M_impl._M_key_compare(__k, _S_key((--__before)._M_node)))
2285 if (_S_right(__before._M_node) == 0)
2286 return _Res(0, __before._M_node);
2288 return _Res(__pos._M_node, __pos._M_node);
2291 return _M_get_insert_equal_pos(__k);
2296 iterator __after = __pos;
2297 if (__pos._M_node == _M_rightmost())
2298 return _Res(0, _M_rightmost());
2299 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), __k))
2301 if (_S_right(__pos._M_node) == 0)
2302 return _Res(0, __pos._M_node);
2304 return _Res(__after._M_node, __after._M_node);
2311 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2312 typename _Compare,
typename _Alloc>
2313 #if __cplusplus >= 201103L
2314 template<
typename _Arg,
typename _NodeGen>
2316 template<
typename _NodeGen>
2318 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2319 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2320 _M_insert_equal_(const_iterator __position,
2321 #
if __cplusplus >= 201103L
2326 _NodeGen& __node_gen)
2328 pair<_Base_ptr, _Base_ptr> __res
2329 = _M_get_insert_hint_equal_pos(__position, _KeyOfValue()(__v));
2332 return _M_insert_(__res.first, __res.second,
2333 _GLIBCXX_FORWARD(_Arg, __v),
2336 return _M_insert_equal_lower(_GLIBCXX_FORWARD(_Arg, __v));
2339 #if __cplusplus >= 201103L
2340 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2341 typename _Compare,
typename _Alloc>
2342 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2343 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2344 _M_insert_node(_Base_ptr __x, _Base_ptr __p, _Link_type __z)
2346 bool __insert_left = (__x != 0 || __p == _M_end()
2347 || _M_impl._M_key_compare(_S_key(__z),
2350 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
2351 this->_M_impl._M_header);
2352 ++_M_impl._M_node_count;
2353 return iterator(__z);
2356 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2357 typename _Compare,
typename _Alloc>
2358 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2359 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2360 _M_insert_lower_node(_Base_ptr __p, _Link_type __z)
2362 bool __insert_left = (__p == _M_end()
2363 || !_M_impl._M_key_compare(_S_key(__p),
2366 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
2367 this->_M_impl._M_header);
2368 ++_M_impl._M_node_count;
2369 return iterator(__z);
2372 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2373 typename _Compare,
typename _Alloc>
2374 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2375 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2376 _M_insert_equal_lower_node(_Link_type __z)
2378 _Link_type __x = _M_begin();
2379 _Base_ptr __y = _M_end();
2383 __x = !_M_impl._M_key_compare(_S_key(__x), _S_key(__z)) ?
2384 _S_left(__x) : _S_right(__x);
2386 return _M_insert_lower_node(__y, __z);
2389 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2390 typename _Compare,
typename _Alloc>
2391 template<
typename... _Args>
2392 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2393 _Compare, _Alloc>::iterator,
bool>
2394 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2395 _M_emplace_unique(_Args&&... __args)
2397 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2401 typedef pair<iterator, bool> _Res;
2402 auto __res = _M_get_insert_unique_pos(_S_key(__z));
2404 return _Res(_M_insert_node(__res.first, __res.second, __z),
true);
2407 return _Res(iterator(__res.first),
false);
2412 __throw_exception_again;
2416 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2417 typename _Compare,
typename _Alloc>
2418 template<
typename... _Args>
2419 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2420 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2421 _M_emplace_equal(_Args&&... __args)
2423 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2427 auto __res = _M_get_insert_equal_pos(_S_key(__z));
2428 return _M_insert_node(__res.first, __res.second, __z);
2433 __throw_exception_again;
2437 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2438 typename _Compare,
typename _Alloc>
2439 template<
typename... _Args>
2440 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2441 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2442 _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args)
2444 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2448 auto __res = _M_get_insert_hint_unique_pos(__pos, _S_key(__z));
2451 return _M_insert_node(__res.first, __res.second, __z);
2454 return iterator(__res.first);
2459 __throw_exception_again;
2463 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2464 typename _Compare,
typename _Alloc>
2465 template<
typename... _Args>
2466 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2467 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2468 _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args)
2470 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2474 auto __res = _M_get_insert_hint_equal_pos(__pos, _S_key(__z));
2477 return _M_insert_node(__res.first, __res.second, __z);
2479 return _M_insert_equal_lower_node(__z);
2484 __throw_exception_again;
2490 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2491 typename _Compare,
typename _Alloc>
2493 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2494 _M_erase_aux(const_iterator __position)
2497 static_cast<_Link_type
>(_Rb_tree_rebalance_for_erase
2498 (
const_cast<_Base_ptr
>(__position._M_node),
2499 this->_M_impl._M_header));
2501 --_M_impl._M_node_count;
2504 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2505 typename _Compare,
typename _Alloc>
2507 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2508 _M_erase_aux(const_iterator __first, const_iterator __last)
2510 if (__first ==
begin() && __last ==
end())
2513 while (__first != __last)
2514 _M_erase_aux(__first++);
2517 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2518 typename _Compare,
typename _Alloc>
2519 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
2520 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2521 erase(
const _Key& __x)
2523 pair<iterator, iterator> __p = equal_range(__x);
2524 const size_type __old_size =
size();
2525 _M_erase_aux(__p.first, __p.second);
2526 return __old_size -
size();
2529 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2530 typename _Compare,
typename _Alloc>
2531 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2532 _Compare, _Alloc>::iterator
2533 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2534 find(
const _Key& __k)
2536 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
2537 return (__j ==
end()
2538 || _M_impl._M_key_compare(__k,
2539 _S_key(__j._M_node))) ?
end() : __j;
2542 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2543 typename _Compare,
typename _Alloc>
2544 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2545 _Compare, _Alloc>::const_iterator
2546 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2547 find(
const _Key& __k)
const
2549 const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
2550 return (__j ==
end()
2551 || _M_impl._M_key_compare(__k,
2552 _S_key(__j._M_node))) ?
end() : __j;
2555 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2556 typename _Compare,
typename _Alloc>
2557 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
2558 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2559 count(
const _Key& __k)
const
2561 pair<const_iterator, const_iterator> __p = equal_range(__k);
2566 _GLIBCXX_PURE
unsigned int
2567 _Rb_tree_black_count(
const _Rb_tree_node_base* __node,
2568 const _Rb_tree_node_base* __root)
throw ();
2570 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2571 typename _Compare,
typename _Alloc>
2573 _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify()
const
2575 if (_M_impl._M_node_count == 0 ||
begin() ==
end())
2576 return _M_impl._M_node_count == 0 &&
begin() ==
end()
2577 && this->_M_impl._M_header._M_left == _M_end()
2578 && this->_M_impl._M_header._M_right == _M_end();
2580 unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
2581 for (const_iterator __it =
begin(); __it !=
end(); ++__it)
2583 _Const_Link_type __x =
static_cast<_Const_Link_type
>(__it._M_node);
2584 _Const_Link_type __L = _S_left(__x);
2585 _Const_Link_type __R = _S_right(__x);
2587 if (__x->_M_color == _S_red)
2588 if ((__L && __L->_M_color == _S_red)
2589 || (__R && __R->_M_color == _S_red))
2592 if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
2594 if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
2597 if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)
2601 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
2603 if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
2608 #if __cplusplus > 201402L
2610 template<
typename _Key,
typename _Val,
typename _Sel,
typename _Cmp1,
2611 typename _Alloc,
typename _Cmp2>
2612 struct _Rb_tree_merge_helper<_Rb_tree<_Key, _Val, _Sel, _Cmp1, _Alloc>,
2616 friend class _Rb_tree<_Key, _Val, _Sel, _Cmp1, _Alloc>;
2619 _S_get_impl(_Rb_tree<_Key, _Val, _Sel, _Cmp2, _Alloc>& __tree)
2620 {
return __tree._M_impl; }
2624 _GLIBCXX_END_NAMESPACE_VERSION