61#pragma GCC system_header
68#if __cplusplus >= 201103L
71#if __cplusplus > 201402L
75namespace 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(); }
281 operator->() const _GLIBCXX_NOEXCEPT
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; }
319 operator!=(
const _Self& __x,
const _Self& __y) _GLIBCXX_NOEXCEPT
320 {
return __x._M_node != __y._M_node; }
325 template<
typename _Tp>
326 struct _Rb_tree_const_iterator
328 typedef _Tp value_type;
329 typedef const _Tp& reference;
330 typedef const _Tp* pointer;
332 typedef _Rb_tree_iterator<_Tp> iterator;
334 typedef bidirectional_iterator_tag iterator_category;
335 typedef ptrdiff_t difference_type;
337 typedef _Rb_tree_const_iterator<_Tp> _Self;
338 typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
339 typedef const _Rb_tree_node<_Tp>* _Link_type;
341 _Rb_tree_const_iterator() _GLIBCXX_NOEXCEPT
345 _Rb_tree_const_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
348 _Rb_tree_const_iterator(
const iterator& __it) _GLIBCXX_NOEXCEPT
349 : _M_node(__it._M_node) { }
352 _M_const_cast() const _GLIBCXX_NOEXCEPT
353 {
return iterator(
const_cast<typename iterator::_Base_ptr
>(_M_node)); }
357 {
return *
static_cast<_Link_type
>(_M_node)->_M_valptr(); }
360 operator->() const _GLIBCXX_NOEXCEPT
361 {
return static_cast<_Link_type
>(_M_node)->_M_valptr(); }
364 operator++() _GLIBCXX_NOEXCEPT
366 _M_node = _Rb_tree_increment(_M_node);
371 operator++(
int) _GLIBCXX_NOEXCEPT
374 _M_node = _Rb_tree_increment(_M_node);
379 operator--() _GLIBCXX_NOEXCEPT
381 _M_node = _Rb_tree_decrement(_M_node);
386 operator--(
int) _GLIBCXX_NOEXCEPT
389 _M_node = _Rb_tree_decrement(_M_node);
394 operator==(
const _Self& __x,
const _Self& __y) _GLIBCXX_NOEXCEPT
395 {
return __x._M_node == __y._M_node; }
398 operator!=(
const _Self& __x,
const _Self& __y) _GLIBCXX_NOEXCEPT
399 {
return __x._M_node != __y._M_node; }
405 _Rb_tree_insert_and_rebalance(
const bool __insert_left,
406 _Rb_tree_node_base* __x,
407 _Rb_tree_node_base* __p,
408 _Rb_tree_node_base& __header)
throw ();
411 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base*
const __z,
412 _Rb_tree_node_base& __header)
throw ();
414#if __cplusplus >= 201402L
415 template<
typename _Cmp,
typename _SfinaeType,
typename = __
void_t<>>
416 struct __has_is_transparent
419 template<
typename _Cmp,
typename _SfinaeType>
420 struct __has_is_transparent<_Cmp, _SfinaeType,
421 __void_t<typename _Cmp::is_transparent>>
422 {
typedef void type; };
424 template<
typename _Cmp,
typename _SfinaeType>
425 using __has_is_transparent_t
426 =
typename __has_is_transparent<_Cmp, _SfinaeType>::type;
429#if __cplusplus > 201402L
430 template<
typename _Tree1,
typename _Cmp2>
431 struct _Rb_tree_merge_helper { };
434 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
435 typename _Compare,
typename _Alloc = allocator<_Val> >
439 rebind<_Rb_tree_node<_Val> >::other _Node_allocator;
444 typedef _Rb_tree_node_base* _Base_ptr;
445 typedef const _Rb_tree_node_base* _Const_Base_ptr;
446 typedef _Rb_tree_node<_Val>* _Link_type;
447 typedef const _Rb_tree_node<_Val>* _Const_Link_type;
452 struct _Reuse_or_alloc_node
454 _Reuse_or_alloc_node(_Rb_tree& __t)
455 : _M_root(__t._M_root()), _M_nodes(__t._M_rightmost()), _M_t(__t)
459 _M_root->_M_parent = 0;
461 if (_M_nodes->_M_left)
462 _M_nodes = _M_nodes->_M_left;
468#if __cplusplus >= 201103L
469 _Reuse_or_alloc_node(
const _Reuse_or_alloc_node&) =
delete;
472 ~_Reuse_or_alloc_node()
473 { _M_t._M_erase(
static_cast<_Link_type
>(_M_root)); }
475 template<
typename _Arg>
477#if __cplusplus < 201103L
478 operator()(
const _Arg& __arg)
480 operator()(_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#if __cplusplus < 201103L
544 operator()(
const _Arg& __arg)
const
546 operator()(_Arg&& __arg)
const
548 {
return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg)); }
555 typedef _Key key_type;
556 typedef _Val value_type;
557 typedef value_type* pointer;
558 typedef const value_type* const_pointer;
559 typedef value_type& reference;
560 typedef const value_type& const_reference;
561 typedef size_t size_type;
562 typedef ptrdiff_t difference_type;
563 typedef _Alloc allocator_type;
566 _M_get_Node_allocator() _GLIBCXX_NOEXCEPT
567 {
return this->_M_impl; }
569 const _Node_allocator&
570 _M_get_Node_allocator() const _GLIBCXX_NOEXCEPT
571 {
return this->_M_impl; }
574 get_allocator() const _GLIBCXX_NOEXCEPT
575 {
return allocator_type(_M_get_Node_allocator()); }
583 _M_put_node(_Link_type __p) _GLIBCXX_NOEXCEPT
586#if __cplusplus < 201103L
588 _M_construct_node(_Link_type __node,
const value_type& __x)
591 { get_allocator().construct(__node->_M_valptr(), __x); }
595 __throw_exception_again;
600 _M_create_node(
const value_type& __x)
602 _Link_type __tmp = _M_get_node();
603 _M_construct_node(__tmp, __x);
607 template<
typename... _Args>
609 _M_construct_node(_Link_type __node, _Args&&... __args)
613 ::new(__node) _Rb_tree_node<_Val>;
614 _Alloc_traits::construct(_M_get_Node_allocator(),
616 std::forward<_Args>(__args)...);
620 __node->~_Rb_tree_node<_Val>();
622 __throw_exception_again;
626 template<
typename... _Args>
628 _M_create_node(_Args&&... __args)
630 _Link_type __tmp = _M_get_node();
631 _M_construct_node(__tmp, std::forward<_Args>(__args)...);
637 _M_destroy_node(_Link_type __p) _GLIBCXX_NOEXCEPT
639#if __cplusplus < 201103L
640 get_allocator().destroy(__p->_M_valptr());
642 _Alloc_traits::destroy(_M_get_Node_allocator(), __p->_M_valptr());
643 __p->~_Rb_tree_node<_Val>();
648 _M_drop_node(_Link_type __p) _GLIBCXX_NOEXCEPT
650 _M_destroy_node(__p);
654 template<
typename _NodeGen>
656 _M_clone_node(_Const_Link_type __x, _NodeGen& __node_gen)
658 _Link_type __tmp = __node_gen(*__x->_M_valptr());
659 __tmp->_M_color = __x->_M_color;
666#if _GLIBCXX_INLINE_VERSION
667 template<
typename _Key_compare>
670 template<
typename _Key_compare,
671 bool = __is_pod(_Key_compare)>
674 :
public _Node_allocator
675 ,
public _Rb_tree_key_compare<_Key_compare>
676 ,
public _Rb_tree_header
678 typedef _Rb_tree_key_compare<_Key_compare> _Base_key_compare;
681 _GLIBCXX_NOEXCEPT_IF(
682 is_nothrow_default_constructible<_Node_allocator>::value
683 && is_nothrow_default_constructible<_Base_key_compare>::value )
687 _Rb_tree_impl(
const _Rb_tree_impl& __x)
688 : _Node_allocator(_Alloc_traits::_S_select_on_copy(__x))
689 , _Base_key_compare(__x._M_key_compare)
692#if __cplusplus < 201103L
693 _Rb_tree_impl(
const _Key_compare& __comp,
const _Node_allocator& __a)
694 : _Node_allocator(__a), _Base_key_compare(__comp)
697 _Rb_tree_impl(_Rb_tree_impl&& __x)
698 noexcept( is_nothrow_move_constructible<_Base_key_compare>::value )
699 : _Node_allocator(std::move(__x)),
700 _Base_key_compare(std::move(__x)),
701 _Rb_tree_header(std::move(__x))
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_begin() _GLIBCXX_NOEXCEPT
750 {
return static_cast<_Link_type
>(this->_M_impl._M_header._M_parent); }
753 _M_begin() const _GLIBCXX_NOEXCEPT
755 return static_cast<_Const_Link_type
>
756 (this->_M_impl._M_header._M_parent);
760 _M_end() _GLIBCXX_NOEXCEPT
761 {
return &this->_M_impl._M_header; }
764 _M_end() const _GLIBCXX_NOEXCEPT
765 {
return &this->_M_impl._M_header; }
767 static const_reference
768 _S_value(_Const_Link_type __x)
769 {
return *__x->_M_valptr(); }
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); }
809 static const_reference
810 _S_value(_Const_Base_ptr __x)
811 {
return *
static_cast<_Const_Link_type
>(__x)->_M_valptr(); }
814 _S_key(_Const_Base_ptr __x)
815 {
return _S_key(
static_cast<_Const_Link_type
>(__x)); }
818 _S_minimum(_Base_ptr __x) _GLIBCXX_NOEXCEPT
819 {
return _Rb_tree_node_base::_S_minimum(__x); }
821 static _Const_Base_ptr
822 _S_minimum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
823 {
return _Rb_tree_node_base::_S_minimum(__x); }
826 _S_maximum(_Base_ptr __x) _GLIBCXX_NOEXCEPT
827 {
return _Rb_tree_node_base::_S_maximum(__x); }
829 static _Const_Base_ptr
830 _S_maximum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
831 {
return _Rb_tree_node_base::_S_maximum(__x); }
834 typedef _Rb_tree_iterator<value_type> iterator;
835 typedef _Rb_tree_const_iterator<value_type> const_iterator;
840#if __cplusplus > 201402L
841 using node_type = _Node_handle<_Key, _Val, _Node_allocator>;
842 using insert_return_type = _Node_insert_return<
843 conditional_t<is_same_v<_Key, _Val>, const_iterator, iterator>,
847 pair<_Base_ptr, _Base_ptr>
848 _M_get_insert_unique_pos(
const key_type& __k);
850 pair<_Base_ptr, _Base_ptr>
851 _M_get_insert_equal_pos(
const key_type& __k);
853 pair<_Base_ptr, _Base_ptr>
854 _M_get_insert_hint_unique_pos(const_iterator __pos,
855 const key_type& __k);
857 pair<_Base_ptr, _Base_ptr>
858 _M_get_insert_hint_equal_pos(const_iterator __pos,
859 const key_type& __k);
862#if __cplusplus >= 201103L
863 template<
typename _Arg,
typename _NodeGen>
865 _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v, _NodeGen&);
868 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);
870 template<
typename _Arg>
872 _M_insert_lower(_Base_ptr __y, _Arg&& __v);
874 template<
typename _Arg>
876 _M_insert_equal_lower(_Arg&& __x);
879 _M_insert_lower_node(_Base_ptr __p, _Link_type __z);
882 _M_insert_equal_lower_node(_Link_type __z);
884 template<
typename _NodeGen>
886 _M_insert_(_Base_ptr __x, _Base_ptr __y,
887 const value_type& __v, _NodeGen&);
892 _M_insert_lower(_Base_ptr __y,
const value_type& __v);
895 _M_insert_equal_lower(
const value_type& __x);
898 template<
typename _NodeGen>
900 _M_copy(_Const_Link_type __x, _Base_ptr __p, _NodeGen&);
902 template<
typename _NodeGen>
904 _M_copy(
const _Rb_tree& __x, _NodeGen& __gen)
906 _Link_type __root = _M_copy(__x._M_begin(), _M_end(), __gen);
907 _M_leftmost() = _S_minimum(__root);
908 _M_rightmost() = _S_maximum(__root);
909 _M_impl._M_node_count = __x._M_impl._M_node_count;
914 _M_copy(
const _Rb_tree& __x)
916 _Alloc_node __an(*
this);
917 return _M_copy(__x, __an);
921 _M_erase(_Link_type __x);
924 _M_lower_bound(_Link_type __x, _Base_ptr __y,
928 _M_lower_bound(_Const_Link_type __x, _Const_Base_ptr __y,
929 const _Key& __k)
const;
932 _M_upper_bound(_Link_type __x, _Base_ptr __y,
936 _M_upper_bound(_Const_Link_type __x, _Const_Base_ptr __y,
937 const _Key& __k)
const;
941#if __cplusplus < 201103L
944 _Rb_tree() =
default;
947 _Rb_tree(
const _Compare& __comp,
948 const allocator_type& __a = allocator_type())
949 : _M_impl(__comp, _Node_allocator(__a)) { }
951 _Rb_tree(
const _Rb_tree& __x)
952 : _M_impl(__x._M_impl)
954 if (__x._M_root() != 0)
955 _M_root() = _M_copy(__x);
958#if __cplusplus >= 201103L
959 _Rb_tree(
const allocator_type& __a)
960 : _M_impl(_Node_allocator(__a))
963 _Rb_tree(
const _Rb_tree& __x,
const allocator_type& __a)
964 : _M_impl(__x._M_impl._M_key_compare, _Node_allocator(__a))
966 if (__x._M_root() !=
nullptr)
967 _M_root() = _M_copy(__x);
970 _Rb_tree(_Rb_tree&&) =
default;
972 _Rb_tree(_Rb_tree&& __x,
const allocator_type& __a)
973 : _Rb_tree(
std::move(__x), _Node_allocator(__a))
977 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a,
true_type)
978 noexcept(is_nothrow_default_constructible<_Compare>::value)
979 : _M_impl(std::move(__x._M_impl), std::move(__a))
982 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a,
false_type)
983 : _M_impl(__x._M_impl._M_key_compare,
std::move(__a))
985 if (__x._M_root() !=
nullptr)
990 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a)
992 _Rb_tree(std::declval<_Rb_tree&&>(), std::declval<_Node_allocator&&>(),
993 std::declval<typename _Alloc_traits::is_always_equal>())) )
994 : _Rb_tree(std::move(__x), std::move(__a),
999 ~_Rb_tree() _GLIBCXX_NOEXCEPT
1000 { _M_erase(_M_begin()); }
1003 operator=(
const _Rb_tree& __x);
1008 {
return _M_impl._M_key_compare; }
1011 begin() _GLIBCXX_NOEXCEPT
1012 {
return iterator(this->_M_impl._M_header._M_left); }
1015 begin() const _GLIBCXX_NOEXCEPT
1016 {
return const_iterator(this->_M_impl._M_header._M_left); }
1019 end() _GLIBCXX_NOEXCEPT
1020 {
return iterator(&this->_M_impl._M_header); }
1023 end() const _GLIBCXX_NOEXCEPT
1024 {
return const_iterator(&this->_M_impl._M_header); }
1027 rbegin() _GLIBCXX_NOEXCEPT
1028 {
return reverse_iterator(
end()); }
1030 const_reverse_iterator
1031 rbegin() const _GLIBCXX_NOEXCEPT
1032 {
return const_reverse_iterator(
end()); }
1035 rend() _GLIBCXX_NOEXCEPT
1036 {
return reverse_iterator(
begin()); }
1038 const_reverse_iterator
1039 rend() const _GLIBCXX_NOEXCEPT
1040 {
return const_reverse_iterator(
begin()); }
1042 _GLIBCXX_NODISCARD
bool
1043 empty() const _GLIBCXX_NOEXCEPT
1044 {
return _M_impl._M_node_count == 0; }
1047 size() const _GLIBCXX_NOEXCEPT
1048 {
return _M_impl._M_node_count; }
1051 max_size() const _GLIBCXX_NOEXCEPT
1056 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value);
1059#if __cplusplus >= 201103L
1060 template<
typename _Arg>
1061 pair<iterator, bool>
1062 _M_insert_unique(_Arg&& __x);
1064 template<
typename _Arg>
1066 _M_insert_equal(_Arg&& __x);
1068 template<
typename _Arg,
typename _NodeGen>
1070 _M_insert_unique_(const_iterator __pos, _Arg&& __x, _NodeGen&);
1072 template<
typename _Arg>
1074 _M_insert_unique_(const_iterator __pos, _Arg&& __x)
1076 _Alloc_node __an(*
this);
1077 return _M_insert_unique_(__pos, std::forward<_Arg>(__x), __an);
1080 template<
typename _Arg,
typename _NodeGen>
1082 _M_insert_equal_(const_iterator __pos, _Arg&& __x, _NodeGen&);
1084 template<
typename _Arg>
1086 _M_insert_equal_(const_iterator __pos, _Arg&& __x)
1088 _Alloc_node __an(*
this);
1089 return _M_insert_equal_(__pos, std::forward<_Arg>(__x), __an);
1092 template<
typename... _Args>
1093 pair<iterator, bool>
1094 _M_emplace_unique(_Args&&... __args);
1096 template<
typename... _Args>
1098 _M_emplace_equal(_Args&&... __args);
1100 template<
typename... _Args>
1102 _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args);
1104 template<
typename... _Args>
1106 _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args);
1108 template<
typename _Iter>
1109 using __same_value_type
1110 = is_same<value_type, typename iterator_traits<_Iter>::value_type>;
1112 template<
typename _InputIterator>
1113 __enable_if_t<__same_value_type<_InputIterator>::value>
1114 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1116 _Alloc_node __an(*
this);
1117 for (; __first != __last; ++__first)
1118 _M_insert_unique_(
end(), *__first, __an);
1121 template<
typename _InputIterator>
1122 __enable_if_t<!__same_value_type<_InputIterator>::value>
1123 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1125 for (; __first != __last; ++__first)
1126 _M_emplace_unique(*__first);
1129 template<
typename _InputIterator>
1130 __enable_if_t<__same_value_type<_InputIterator>::value>
1131 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1133 _Alloc_node __an(*
this);
1134 for (; __first != __last; ++__first)
1135 _M_insert_equal_(
end(), *__first, __an);
1138 template<
typename _InputIterator>
1139 __enable_if_t<!__same_value_type<_InputIterator>::value>
1140 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1142 _Alloc_node __an(*
this);
1143 for (; __first != __last; ++__first)
1144 _M_emplace_equal(*__first);
1147 pair<iterator, bool>
1148 _M_insert_unique(
const value_type& __x);
1151 _M_insert_equal(
const value_type& __x);
1153 template<
typename _NodeGen>
1155 _M_insert_unique_(const_iterator __pos,
const value_type& __x,
1159 _M_insert_unique_(const_iterator __pos,
const value_type& __x)
1161 _Alloc_node __an(*
this);
1162 return _M_insert_unique_(__pos, __x, __an);
1165 template<
typename _NodeGen>
1167 _M_insert_equal_(const_iterator __pos,
const value_type& __x,
1170 _M_insert_equal_(const_iterator __pos,
const value_type& __x)
1172 _Alloc_node __an(*
this);
1173 return _M_insert_equal_(__pos, __x, __an);
1176 template<
typename _InputIterator>
1178 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1180 _Alloc_node __an(*
this);
1181 for (; __first != __last; ++__first)
1182 _M_insert_unique_(
end(), *__first, __an);
1185 template<
typename _InputIterator>
1187 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1189 _Alloc_node __an(*
this);
1190 for (; __first != __last; ++__first)
1191 _M_insert_equal_(
end(), *__first, __an);
1197 _M_erase_aux(const_iterator __position);
1200 _M_erase_aux(const_iterator __first, const_iterator __last);
1203#if __cplusplus >= 201103L
1206 _GLIBCXX_ABI_TAG_CXX11
1208 erase(const_iterator __position)
1210 __glibcxx_assert(__position !=
end());
1211 const_iterator __result = __position;
1213 _M_erase_aux(__position);
1214 return __result._M_const_cast();
1218 _GLIBCXX_ABI_TAG_CXX11
1220 erase(iterator __position)
1222 __glibcxx_assert(__position !=
end());
1223 iterator __result = __position;
1225 _M_erase_aux(__position);
1230 erase(iterator __position)
1232 __glibcxx_assert(__position !=
end());
1233 _M_erase_aux(__position);
1237 erase(const_iterator __position)
1239 __glibcxx_assert(__position !=
end());
1240 _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); }
1266 erase(
const key_type* __first,
const key_type* __last);
1269 clear() _GLIBCXX_NOEXCEPT
1271 _M_erase(_M_begin());
1277 find(
const key_type& __k);
1280 find(
const key_type& __k)
const;
1283 count(
const key_type& __k)
const;
1286 lower_bound(
const key_type& __k)
1287 {
return _M_lower_bound(_M_begin(), _M_end(), __k); }
1290 lower_bound(
const key_type& __k)
const
1291 {
return _M_lower_bound(_M_begin(), _M_end(), __k); }
1294 upper_bound(
const key_type& __k)
1295 {
return _M_upper_bound(_M_begin(), _M_end(), __k); }
1298 upper_bound(
const key_type& __k)
const
1299 {
return _M_upper_bound(_M_begin(), _M_end(), __k); }
1301 pair<iterator, iterator>
1302 equal_range(
const key_type& __k);
1304 pair<const_iterator, const_iterator>
1305 equal_range(
const key_type& __k)
const;
1307#if __cplusplus >= 201402L
1308 template<
typename _Kt,
1309 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1311 _M_find_tr(
const _Kt& __k)
1313 const _Rb_tree* __const_this =
this;
1314 return __const_this->_M_find_tr(__k)._M_const_cast();
1317 template<
typename _Kt,
1318 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1320 _M_find_tr(
const _Kt& __k)
const
1322 auto __j = _M_lower_bound_tr(__k);
1323 if (__j !=
end() && _M_impl._M_key_compare(__k, _S_key(__j._M_node)))
1328 template<
typename _Kt,
1329 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1331 _M_count_tr(
const _Kt& __k)
const
1333 auto __p = _M_equal_range_tr(__k);
1337 template<
typename _Kt,
1338 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1340 _M_lower_bound_tr(
const _Kt& __k)
1342 const _Rb_tree* __const_this =
this;
1343 return __const_this->_M_lower_bound_tr(__k)._M_const_cast();
1346 template<
typename _Kt,
1347 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1349 _M_lower_bound_tr(
const _Kt& __k)
const
1351 auto __x = _M_begin();
1352 auto __y = _M_end();
1354 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1360 __x = _S_right(__x);
1361 return const_iterator(__y);
1364 template<
typename _Kt,
1365 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1367 _M_upper_bound_tr(
const _Kt& __k)
1369 const _Rb_tree* __const_this =
this;
1370 return __const_this->_M_upper_bound_tr(__k)._M_const_cast();
1373 template<
typename _Kt,
1374 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1376 _M_upper_bound_tr(
const _Kt& __k)
const
1378 auto __x = _M_begin();
1379 auto __y = _M_end();
1381 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1387 __x = _S_right(__x);
1388 return const_iterator(__y);
1391 template<
typename _Kt,
1392 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1393 pair<iterator, iterator>
1394 _M_equal_range_tr(
const _Kt& __k)
1396 const _Rb_tree* __const_this =
this;
1397 auto __ret = __const_this->_M_equal_range_tr(__k);
1398 return { __ret.first._M_const_cast(), __ret.second._M_const_cast() };
1401 template<
typename _Kt,
1402 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1403 pair<const_iterator, const_iterator>
1404 _M_equal_range_tr(
const _Kt& __k)
const
1406 auto __low = _M_lower_bound_tr(__k);
1407 auto __high = __low;
1408 auto& __cmp = _M_impl._M_key_compare;
1409 while (__high !=
end() && !__cmp(__k, _S_key(__high._M_node)))
1411 return { __low, __high };
1417 __rb_verify()
const;
1419#if __cplusplus >= 201103L
1421 operator=(_Rb_tree&&)
1422 noexcept(_Alloc_traits::_S_nothrow_move()
1423 && is_nothrow_move_assignable<_Compare>::value);
1425 template<typename _Iterator>
1427 _M_assign_unique(_Iterator, _Iterator);
1429 template<typename _Iterator>
1431 _M_assign_equal(_Iterator, _Iterator);
1437 { _M_impl._M_move_data(__x._M_impl); }
1454#if __cplusplus > 201402L
1458 _M_reinsert_node_unique(node_type&& __nh)
1460 insert_return_type __ret;
1462 __ret.position =
end();
1465 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1467 auto __res = _M_get_insert_unique_pos(__nh._M_key());
1471 = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1472 __nh._M_ptr =
nullptr;
1473 __ret.inserted =
true;
1477 __ret.node = std::move(__nh);
1478 __ret.position = iterator(__res.first);
1479 __ret.inserted =
false;
1487 _M_reinsert_node_equal(node_type&& __nh)
1494 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1495 auto __res = _M_get_insert_equal_pos(__nh._M_key());
1497 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1499 __ret = _M_insert_equal_lower_node(__nh._M_ptr);
1500 __nh._M_ptr =
nullptr;
1507 _M_reinsert_node_hint_unique(const_iterator __hint, node_type&& __nh)
1514 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1515 auto __res = _M_get_insert_hint_unique_pos(__hint, __nh._M_key());
1518 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1519 __nh._M_ptr =
nullptr;
1522 __ret = iterator(__res.first);
1529 _M_reinsert_node_hint_equal(const_iterator __hint, node_type&& __nh)
1536 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1537 auto __res = _M_get_insert_hint_equal_pos(__hint, __nh._M_key());
1539 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1541 __ret = _M_insert_equal_lower_node(__nh._M_ptr);
1542 __nh._M_ptr =
nullptr;
1549 extract(const_iterator __pos)
1551 auto __ptr = _Rb_tree_rebalance_for_erase(
1552 __pos._M_const_cast()._M_node, _M_impl._M_header);
1553 --_M_impl._M_node_count;
1554 return {
static_cast<_Link_type
>(__ptr), _M_get_Node_allocator() };
1559 extract(
const key_type& __k)
1562 auto __pos = find(__k);
1564 __nh = extract(const_iterator(__pos));
1568 template<
typename _Compare2>
1569 using _Compatible_tree
1570 = _Rb_tree<_Key, _Val, _KeyOfValue, _Compare2, _Alloc>;
1572 template<
typename,
typename>
1573 friend class _Rb_tree_merge_helper;
1576 template<
typename _Compare2>
1578 _M_merge_unique(_Compatible_tree<_Compare2>& __src)
noexcept
1580 using _Merge_helper = _Rb_tree_merge_helper<_Rb_tree, _Compare2>;
1581 for (
auto __i = __src.begin(), __end = __src.end(); __i != __end;)
1584 auto __res = _M_get_insert_unique_pos(_KeyOfValue()(*__pos));
1587 auto& __src_impl = _Merge_helper::_S_get_impl(__src);
1588 auto __ptr = _Rb_tree_rebalance_for_erase(
1589 __pos._M_node, __src_impl._M_header);
1590 --__src_impl._M_node_count;
1591 _M_insert_node(__res.first, __res.second,
1592 static_cast<_Link_type
>(__ptr));
1598 template<
typename _Compare2>
1600 _M_merge_equal(_Compatible_tree<_Compare2>& __src)
noexcept
1602 using _Merge_helper = _Rb_tree_merge_helper<_Rb_tree, _Compare2>;
1603 for (
auto __i = __src.begin(), __end = __src.end(); __i != __end;)
1606 auto __res = _M_get_insert_equal_pos(_KeyOfValue()(*__pos));
1609 auto& __src_impl = _Merge_helper::_S_get_impl(__src);
1610 auto __ptr = _Rb_tree_rebalance_for_erase(
1611 __pos._M_node, __src_impl._M_header);
1612 --__src_impl._M_node_count;
1613 _M_insert_node(__res.first, __res.second,
1614 static_cast<_Link_type
>(__ptr));
1621 operator==(
const _Rb_tree& __x,
const _Rb_tree& __y)
1623 return __x.size() == __y.size()
1624 && std::equal(__x.begin(), __x.end(), __y.begin());
1628 operator<(
const _Rb_tree& __x,
const _Rb_tree& __y)
1630 return std::lexicographical_compare(__x.begin(), __x.end(),
1631 __y.begin(), __y.end());
1634 friend bool _GLIBCXX_DEPRECATED
1635 operator!=(
const _Rb_tree& __x,
const _Rb_tree& __y)
1636 {
return !(__x == __y); }
1638 friend bool _GLIBCXX_DEPRECATED
1639 operator>(
const _Rb_tree& __x,
const _Rb_tree& __y)
1640 {
return __y < __x; }
1642 friend bool _GLIBCXX_DEPRECATED
1643 operator<=(
const _Rb_tree& __x,
const _Rb_tree& __y)
1644 {
return !(__y < __x); }
1646 friend bool _GLIBCXX_DEPRECATED
1647 operator>=(
const _Rb_tree& __x,
const _Rb_tree& __y)
1648 {
return !(__x < __y); }
1651 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1652 typename _Compare,
typename _Alloc>
1654 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
1655 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
1658#if __cplusplus >= 201103L
1659 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1660 typename _Compare,
typename _Alloc>
1662 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1665 if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
1669 _Alloc_node __an(*
this);
1671 [&__an](
const value_type& __cval)
1673 auto& __val =
const_cast<value_type&
>(__cval);
1676 _M_root() = _M_copy(__x, __lbd);
1680 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1681 typename _Compare,
typename _Alloc>
1683 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1684 _M_move_assign(_Rb_tree& __x,
true_type)
1687 if (__x._M_root() !=
nullptr)
1689 std::__alloc_on_move(_M_get_Node_allocator(),
1690 __x._M_get_Node_allocator());
1693 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1694 typename _Compare,
typename _Alloc>
1696 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1699 if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
1700 return _M_move_assign(__x,
true_type{});
1704 _Reuse_or_alloc_node __roan(*
this);
1706 if (__x._M_root() !=
nullptr)
1709 [&__roan](
const value_type& __cval)
1711 auto& __val =
const_cast<value_type&
>(__cval);
1714 _M_root() = _M_copy(__x, __lbd);
1719 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1720 typename _Compare,
typename _Alloc>
1721 inline _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
1722 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1723 operator=(_Rb_tree&& __x)
1724 noexcept(_Alloc_traits::_S_nothrow_move()
1725 && is_nothrow_move_assignable<_Compare>::value)
1727 _M_impl._M_key_compare = std::move(__x._M_impl._M_key_compare);
1728 _M_move_assign(__x, __bool_constant<_Alloc_traits::_S_nothrow_move()>());
1732 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1733 typename _Compare,
typename _Alloc>
1734 template<
typename _Iterator>
1736 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1737 _M_assign_unique(_Iterator __first, _Iterator __last)
1739 _Reuse_or_alloc_node __roan(*
this);
1741 for (; __first != __last; ++__first)
1742 _M_insert_unique_(
end(), *__first, __roan);
1745 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1746 typename _Compare,
typename _Alloc>
1747 template<
typename _Iterator>
1749 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1750 _M_assign_equal(_Iterator __first, _Iterator __last)
1752 _Reuse_or_alloc_node __roan(*
this);
1754 for (; __first != __last; ++__first)
1755 _M_insert_equal_(
end(), *__first, __roan);
1759 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1760 typename _Compare,
typename _Alloc>
1761 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
1762 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1763 operator=(
const _Rb_tree& __x)
1768#if __cplusplus >= 201103L
1769 if (_Alloc_traits::_S_propagate_on_copy_assign())
1771 auto& __this_alloc = this->_M_get_Node_allocator();
1772 auto& __that_alloc = __x._M_get_Node_allocator();
1773 if (!_Alloc_traits::_S_always_equal()
1774 && __this_alloc != __that_alloc)
1779 std::__alloc_on_copy(__this_alloc, __that_alloc);
1784 _Reuse_or_alloc_node __roan(*
this);
1786 _M_impl._M_key_compare = __x._M_impl._M_key_compare;
1787 if (__x._M_root() != 0)
1788 _M_root() = _M_copy(__x, __roan);
1794 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1795 typename _Compare,
typename _Alloc>
1796#if __cplusplus >= 201103L
1797 template<
typename _Arg,
typename _NodeGen>
1799 template<
typename _NodeGen>
1801 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1802 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1803 _M_insert_(_Base_ptr __x, _Base_ptr __p,
1804#
if __cplusplus >= 201103L
1809 _NodeGen& __node_gen)
1811 bool __insert_left = (__x != 0 || __p == _M_end()
1812 || _M_impl._M_key_compare(_KeyOfValue()(__v),
1815 _Link_type __z = __node_gen(_GLIBCXX_FORWARD(_Arg, __v));
1817 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1818 this->_M_impl._M_header);
1819 ++_M_impl._M_node_count;
1820 return iterator(__z);
1823 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1824 typename _Compare,
typename _Alloc>
1825#if __cplusplus >= 201103L
1826 template<
typename _Arg>
1828 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1829 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1830#if __cplusplus >= 201103L
1831 _M_insert_lower(_Base_ptr __p, _Arg&& __v)
1833 _M_insert_lower(_Base_ptr __p,
const _Val& __v)
1836 bool __insert_left = (__p == _M_end()
1837 || !_M_impl._M_key_compare(_S_key(__p),
1838 _KeyOfValue()(__v)));
1840 _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v));
1842 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1843 this->_M_impl._M_header);
1844 ++_M_impl._M_node_count;
1845 return iterator(__z);
1848 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1849 typename _Compare,
typename _Alloc>
1850#if __cplusplus >= 201103L
1851 template<
typename _Arg>
1853 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1854 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1855#if __cplusplus >= 201103L
1856 _M_insert_equal_lower(_Arg&& __v)
1858 _M_insert_equal_lower(
const _Val& __v)
1861 _Link_type __x = _M_begin();
1862 _Base_ptr __y = _M_end();
1866 __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?
1867 _S_left(__x) : _S_right(__x);
1869 return _M_insert_lower(__y, _GLIBCXX_FORWARD(_Arg, __v));
1872 template<
typename _Key,
typename _Val,
typename _KoV,
1873 typename _Compare,
typename _Alloc>
1874 template<
typename _NodeGen>
1875 typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
1876 _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
1877 _M_copy(_Const_Link_type __x, _Base_ptr __p, _NodeGen& __node_gen)
1880 _Link_type __top = _M_clone_node(__x, __node_gen);
1881 __top->_M_parent = __p;
1886 __top->_M_right = _M_copy(_S_right(__x), __top, __node_gen);
1892 _Link_type __y = _M_clone_node(__x, __node_gen);
1894 __y->_M_parent = __p;
1896 __y->_M_right = _M_copy(_S_right(__x), __y, __node_gen);
1904 __throw_exception_again;
1909 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1910 typename _Compare,
typename _Alloc>
1912 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1913 _M_erase(_Link_type __x)
1918 _M_erase(_S_right(__x));
1919 _Link_type __y = _S_left(__x);
1925 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1926 typename _Compare,
typename _Alloc>
1927 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1928 _Compare, _Alloc>::iterator
1929 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1930 _M_lower_bound(_Link_type __x, _Base_ptr __y,
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 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>::const_iterator
1945 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1946 _M_lower_bound(_Const_Link_type __x, _Const_Base_ptr __y,
1947 const _Key& __k)
const
1950 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1951 __y = __x, __x = _S_left(__x);
1953 __x = _S_right(__x);
1954 return const_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>::iterator
1961 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1962 _M_upper_bound(_Link_type __x, _Base_ptr __y,
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 iterator(__y);
1973 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1974 typename _Compare,
typename _Alloc>
1975 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1976 _Compare, _Alloc>::const_iterator
1977 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1978 _M_upper_bound(_Const_Link_type __x, _Const_Base_ptr __y,
1979 const _Key& __k)
const
1982 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1983 __y = __x, __x = _S_left(__x);
1985 __x = _S_right(__x);
1986 return const_iterator(__y);
1989 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1990 typename _Compare,
typename _Alloc>
1991 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
1992 _Compare, _Alloc>::iterator,
1993 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1994 _Compare, _Alloc>::iterator>
1995 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1996 equal_range(
const _Key& __k)
1998 _Link_type __x = _M_begin();
1999 _Base_ptr __y = _M_end();
2002 if (_M_impl._M_key_compare(_S_key(__x), __k))
2003 __x = _S_right(__x);
2004 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
2005 __y = __x, __x = _S_left(__x);
2008 _Link_type __xu(__x);
2009 _Base_ptr __yu(__y);
2010 __y = __x, __x = _S_left(__x);
2011 __xu = _S_right(__xu);
2012 return pair<iterator,
2013 iterator>(_M_lower_bound(__x, __y, __k),
2014 _M_upper_bound(__xu, __yu, __k));
2017 return pair<iterator, iterator>(iterator(__y),
2021 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2022 typename _Compare,
typename _Alloc>
2023 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2024 _Compare, _Alloc>::const_iterator,
2025 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2026 _Compare, _Alloc>::const_iterator>
2027 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2028 equal_range(
const _Key& __k)
const
2030 _Const_Link_type __x = _M_begin();
2031 _Const_Base_ptr __y = _M_end();
2034 if (_M_impl._M_key_compare(_S_key(__x), __k))
2035 __x = _S_right(__x);
2036 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
2037 __y = __x, __x = _S_left(__x);
2040 _Const_Link_type __xu(__x);
2041 _Const_Base_ptr __yu(__y);
2042 __y = __x, __x = _S_left(__x);
2043 __xu = _S_right(__xu);
2044 return pair<const_iterator,
2045 const_iterator>(_M_lower_bound(__x, __y, __k),
2046 _M_upper_bound(__xu, __yu, __k));
2049 return pair<const_iterator, const_iterator>(const_iterator(__y),
2050 const_iterator(__y));
2053 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2054 typename _Compare,
typename _Alloc>
2056 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2058 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value)
2062 if (__t._M_root() != 0)
2063 _M_impl._M_move_data(__t._M_impl);
2065 else if (__t._M_root() == 0)
2066 __t._M_impl._M_move_data(_M_impl);
2069 std::swap(_M_root(),__t._M_root());
2070 std::swap(_M_leftmost(),__t._M_leftmost());
2071 std::swap(_M_rightmost(),__t._M_rightmost());
2073 _M_root()->_M_parent = _M_end();
2074 __t._M_root()->_M_parent = __t._M_end();
2075 std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
2078 std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);
2080 _Alloc_traits::_S_on_swap(_M_get_Node_allocator(),
2081 __t._M_get_Node_allocator());
2084 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2085 typename _Compare,
typename _Alloc>
2086 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2087 _Compare, _Alloc>::_Base_ptr,
2088 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2089 _Compare, _Alloc>::_Base_ptr>
2090 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2091 _M_get_insert_unique_pos(
const key_type& __k)
2093 typedef pair<_Base_ptr, _Base_ptr> _Res;
2094 _Link_type __x = _M_begin();
2095 _Base_ptr __y = _M_end();
2100 __comp = _M_impl._M_key_compare(__k, _S_key(__x));
2101 __x = __comp ? _S_left(__x) : _S_right(__x);
2103 iterator __j = iterator(__y);
2107 return _Res(__x, __y);
2111 if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
2112 return _Res(__x, __y);
2113 return _Res(__j._M_node, 0);
2116 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2117 typename _Compare,
typename _Alloc>
2118 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2119 _Compare, _Alloc>::_Base_ptr,
2120 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2121 _Compare, _Alloc>::_Base_ptr>
2122 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2123 _M_get_insert_equal_pos(
const key_type& __k)
2125 typedef pair<_Base_ptr, _Base_ptr> _Res;
2126 _Link_type __x = _M_begin();
2127 _Base_ptr __y = _M_end();
2131 __x = _M_impl._M_key_compare(__k, _S_key(__x)) ?
2132 _S_left(__x) : _S_right(__x);
2134 return _Res(__x, __y);
2137 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2138 typename _Compare,
typename _Alloc>
2139#if __cplusplus >= 201103L
2140 template<
typename _Arg>
2142 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2143 _Compare, _Alloc>::iterator,
bool>
2144 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2145#if __cplusplus >= 201103L
2146 _M_insert_unique(_Arg&& __v)
2148 _M_insert_unique(
const _Val& __v)
2151 typedef pair<iterator, bool> _Res;
2152 pair<_Base_ptr, _Base_ptr> __res
2153 = _M_get_insert_unique_pos(_KeyOfValue()(__v));
2157 _Alloc_node __an(*
this);
2158 return _Res(_M_insert_(__res.first, __res.second,
2159 _GLIBCXX_FORWARD(_Arg, __v), __an),
2163 return _Res(iterator(__res.first),
false);
2166 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2167 typename _Compare,
typename _Alloc>
2168#if __cplusplus >= 201103L
2169 template<
typename _Arg>
2171 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2172 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2173#if __cplusplus >= 201103L
2174 _M_insert_equal(_Arg&& __v)
2176 _M_insert_equal(
const _Val& __v)
2179 pair<_Base_ptr, _Base_ptr> __res
2180 = _M_get_insert_equal_pos(_KeyOfValue()(__v));
2181 _Alloc_node __an(*
this);
2182 return _M_insert_(__res.first, __res.second,
2183 _GLIBCXX_FORWARD(_Arg, __v), __an);
2186 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2187 typename _Compare,
typename _Alloc>
2188 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2189 _Compare, _Alloc>::_Base_ptr,
2190 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2191 _Compare, _Alloc>::_Base_ptr>
2192 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2193 _M_get_insert_hint_unique_pos(const_iterator __position,
2194 const key_type& __k)
2196 iterator __pos = __position._M_const_cast();
2197 typedef pair<_Base_ptr, _Base_ptr> _Res;
2200 if (__pos._M_node == _M_end())
2203 && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))
2204 return _Res(0, _M_rightmost());
2206 return _M_get_insert_unique_pos(__k);
2208 else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node)))
2211 iterator __before = __pos;
2212 if (__pos._M_node == _M_leftmost())
2213 return _Res(_M_leftmost(), _M_leftmost());
2214 else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))
2216 if (_S_right(__before._M_node) == 0)
2217 return _Res(0, __before._M_node);
2219 return _Res(__pos._M_node, __pos._M_node);
2222 return _M_get_insert_unique_pos(__k);
2224 else if (_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
2227 iterator __after = __pos;
2228 if (__pos._M_node == _M_rightmost())
2229 return _Res(0, _M_rightmost());
2230 else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))
2232 if (_S_right(__pos._M_node) == 0)
2233 return _Res(0, __pos._M_node);
2235 return _Res(__after._M_node, __after._M_node);
2238 return _M_get_insert_unique_pos(__k);
2242 return _Res(__pos._M_node, 0);
2245 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2246 typename _Compare,
typename _Alloc>
2247#if __cplusplus >= 201103L
2248 template<
typename _Arg,
typename _NodeGen>
2250 template<
typename _NodeGen>
2252 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2253 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2254 _M_insert_unique_(const_iterator __position,
2255#
if __cplusplus >= 201103L
2260 _NodeGen& __node_gen)
2262 pair<_Base_ptr, _Base_ptr> __res
2263 = _M_get_insert_hint_unique_pos(__position, _KeyOfValue()(__v));
2266 return _M_insert_(__res.first, __res.second,
2267 _GLIBCXX_FORWARD(_Arg, __v),
2269 return iterator(__res.first);
2272 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2273 typename _Compare,
typename _Alloc>
2274 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2275 _Compare, _Alloc>::_Base_ptr,
2276 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2277 _Compare, _Alloc>::_Base_ptr>
2278 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2279 _M_get_insert_hint_equal_pos(const_iterator __position,
const key_type& __k)
2281 iterator __pos = __position._M_const_cast();
2282 typedef pair<_Base_ptr, _Base_ptr> _Res;
2285 if (__pos._M_node == _M_end())
2288 && !_M_impl._M_key_compare(__k, _S_key(_M_rightmost())))
2289 return _Res(0, _M_rightmost());
2291 return _M_get_insert_equal_pos(__k);
2293 else if (!_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
2296 iterator __before = __pos;
2297 if (__pos._M_node == _M_leftmost())
2298 return _Res(_M_leftmost(), _M_leftmost());
2299 else if (!_M_impl._M_key_compare(__k, _S_key((--__before)._M_node)))
2301 if (_S_right(__before._M_node) == 0)
2302 return _Res(0, __before._M_node);
2304 return _Res(__pos._M_node, __pos._M_node);
2307 return _M_get_insert_equal_pos(__k);
2312 iterator __after = __pos;
2313 if (__pos._M_node == _M_rightmost())
2314 return _Res(0, _M_rightmost());
2315 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), __k))
2317 if (_S_right(__pos._M_node) == 0)
2318 return _Res(0, __pos._M_node);
2320 return _Res(__after._M_node, __after._M_node);
2327 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2328 typename _Compare,
typename _Alloc>
2329#if __cplusplus >= 201103L
2330 template<
typename _Arg,
typename _NodeGen>
2332 template<
typename _NodeGen>
2334 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2335 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2336 _M_insert_equal_(const_iterator __position,
2337#
if __cplusplus >= 201103L
2342 _NodeGen& __node_gen)
2344 pair<_Base_ptr, _Base_ptr> __res
2345 = _M_get_insert_hint_equal_pos(__position, _KeyOfValue()(__v));
2348 return _M_insert_(__res.first, __res.second,
2349 _GLIBCXX_FORWARD(_Arg, __v),
2352 return _M_insert_equal_lower(_GLIBCXX_FORWARD(_Arg, __v));
2355#if __cplusplus >= 201103L
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_node(_Base_ptr __x, _Base_ptr __p, _Link_type __z)
2362 bool __insert_left = (__x != 0 || __p == _M_end()
2363 || _M_impl._M_key_compare(_S_key(__z),
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_lower_node(_Base_ptr __p, _Link_type __z)
2378 bool __insert_left = (__p == _M_end()
2379 || !_M_impl._M_key_compare(_S_key(__p),
2382 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
2383 this->_M_impl._M_header);
2384 ++_M_impl._M_node_count;
2385 return iterator(__z);
2388 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2389 typename _Compare,
typename _Alloc>
2390 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2391 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2392 _M_insert_equal_lower_node(_Link_type __z)
2394 _Link_type __x = _M_begin();
2395 _Base_ptr __y = _M_end();
2399 __x = !_M_impl._M_key_compare(_S_key(__x), _S_key(__z)) ?
2400 _S_left(__x) : _S_right(__x);
2402 return _M_insert_lower_node(__y, __z);
2405 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2406 typename _Compare,
typename _Alloc>
2407 template<
typename... _Args>
2408 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2409 _Compare, _Alloc>::iterator,
bool>
2410 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2411 _M_emplace_unique(_Args&&... __args)
2413 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2417 typedef pair<iterator, bool> _Res;
2418 auto __res = _M_get_insert_unique_pos(_S_key(__z));
2420 return _Res(_M_insert_node(__res.first, __res.second, __z),
true);
2423 return _Res(iterator(__res.first),
false);
2428 __throw_exception_again;
2432 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2433 typename _Compare,
typename _Alloc>
2434 template<
typename... _Args>
2435 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2436 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2437 _M_emplace_equal(_Args&&... __args)
2439 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2443 auto __res = _M_get_insert_equal_pos(_S_key(__z));
2444 return _M_insert_node(__res.first, __res.second, __z);
2449 __throw_exception_again;
2453 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2454 typename _Compare,
typename _Alloc>
2455 template<
typename... _Args>
2456 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2457 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2458 _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args)
2460 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2464 auto __res = _M_get_insert_hint_unique_pos(__pos, _S_key(__z));
2467 return _M_insert_node(__res.first, __res.second, __z);
2470 return iterator(__res.first);
2475 __throw_exception_again;
2479 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2480 typename _Compare,
typename _Alloc>
2481 template<
typename... _Args>
2482 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2483 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2484 _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args)
2486 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2490 auto __res = _M_get_insert_hint_equal_pos(__pos, _S_key(__z));
2493 return _M_insert_node(__res.first, __res.second, __z);
2495 return _M_insert_equal_lower_node(__z);
2500 __throw_exception_again;
2506 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2507 typename _Compare,
typename _Alloc>
2509 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2510 _M_erase_aux(const_iterator __position)
2513 static_cast<_Link_type
>(_Rb_tree_rebalance_for_erase
2514 (
const_cast<_Base_ptr
>(__position._M_node),
2515 this->_M_impl._M_header));
2517 --_M_impl._M_node_count;
2520 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2521 typename _Compare,
typename _Alloc>
2523 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2524 _M_erase_aux(const_iterator __first, const_iterator __last)
2526 if (__first ==
begin() && __last ==
end())
2529 while (__first != __last)
2530 _M_erase_aux(__first++);
2533 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2534 typename _Compare,
typename _Alloc>
2535 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
2536 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2537 erase(
const _Key& __x)
2539 pair<iterator, iterator> __p = equal_range(__x);
2540 const size_type __old_size = size();
2541 _M_erase_aux(__p.first, __p.second);
2542 return __old_size - size();
2545 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2546 typename _Compare,
typename _Alloc>
2548 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2549 erase(
const _Key* __first,
const _Key* __last)
2551 while (__first != __last)
2555 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2556 typename _Compare,
typename _Alloc>
2557 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2558 _Compare, _Alloc>::iterator
2559 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2560 find(
const _Key& __k)
2562 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
2563 return (__j ==
end()
2564 || _M_impl._M_key_compare(__k,
2565 _S_key(__j._M_node))) ?
end() : __j;
2568 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2569 typename _Compare,
typename _Alloc>
2570 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2571 _Compare, _Alloc>::const_iterator
2572 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2573 find(
const _Key& __k)
const
2575 const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
2576 return (__j ==
end()
2577 || _M_impl._M_key_compare(__k,
2578 _S_key(__j._M_node))) ?
end() : __j;
2581 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2582 typename _Compare,
typename _Alloc>
2583 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
2584 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2585 count(
const _Key& __k)
const
2587 pair<const_iterator, const_iterator> __p = equal_range(__k);
2592 _GLIBCXX_PURE
unsigned int
2593 _Rb_tree_black_count(
const _Rb_tree_node_base* __node,
2594 const _Rb_tree_node_base* __root)
throw ();
2596 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2597 typename _Compare,
typename _Alloc>
2599 _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify()
const
2601 if (_M_impl._M_node_count == 0 ||
begin() ==
end())
2602 return _M_impl._M_node_count == 0 &&
begin() ==
end()
2603 && this->_M_impl._M_header._M_left == _M_end()
2604 && this->_M_impl._M_header._M_right == _M_end();
2606 unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
2607 for (const_iterator __it =
begin(); __it !=
end(); ++__it)
2609 _Const_Link_type __x =
static_cast<_Const_Link_type
>(__it._M_node);
2610 _Const_Link_type __L = _S_left(__x);
2611 _Const_Link_type __R = _S_right(__x);
2613 if (__x->_M_color == _S_red)
2614 if ((__L && __L->_M_color == _S_red)
2615 || (__R && __R->_M_color == _S_red))
2618 if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
2620 if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
2623 if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)
2627 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
2629 if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
2634#if __cplusplus > 201402L
2636 template<
typename _Key,
typename _Val,
typename _Sel,
typename _Cmp1,
2637 typename _Alloc,
typename _Cmp2>
2638 struct _Rb_tree_merge_helper<_Rb_tree<_Key, _Val, _Sel, _Cmp1, _Alloc>,
2642 friend class _Rb_tree<_Key, _Val, _Sel, _Cmp1, _Alloc>;
2645 _S_get_impl(_Rb_tree<_Key, _Val, _Sel, _Cmp2, _Alloc>& __tree)
2646 {
return __tree._M_impl; }
2650_GLIBCXX_END_NAMESPACE_VERSION
_GLIBCXX20_CONSTEXPR complex< _Tp > operator*(const complex< _Tp > &__x, const complex< _Tp > &__y)
Return new complex value x times y.
integral_constant< bool, true > true_type
The type used as a compile-time boolean with true value.
integral_constant< bool, false > false_type
The type used as a compile-time boolean with false value.
constexpr conditional< __move_if_noexcept_cond< _Tp >::value, const_Tp &, _Tp && >::type move_if_noexcept(_Tp &__x) noexcept
Conditionally convert a value to an rvalue.
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
ISO C++ entities toplevel namespace is std.
constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to the first element of the initializer_list.
_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to one past the last element of the initializer_list.
_GLIBCXX17_CONSTEXPR auto rend(_Container &__cont) -> decltype(__cont.rend())
Return a reverse iterator pointing one past the first element of the container.
_GLIBCXX17_CONSTEXPR auto rbegin(_Container &__cont) -> decltype(__cont.rbegin())
Return a reverse iterator pointing to the last element of the container.
__detected_or_t< typename is_empty< _Alloc >::type, __equal, _Alloc > is_always_equal
Whether all instances of the allocator type compare equal.
Uniform interface to C++98 and C++11 allocators.
static size_type max_size(const _Alloc &__a) noexcept
The maximum supported allocation size.
static void deallocate(_Alloc &__a, pointer __p, size_type __n)
Deallocate memory.
static _GLIBCXX_NODISCARD pointer allocate(_Alloc &__a, size_type __n)
Allocate memory.