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 _Tree1,
typename _Cmp2>
420 struct _Rb_tree_merge_helper { };
423 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
424 typename _Compare,
typename _Alloc = allocator<_Val> >
428 rebind<_Rb_tree_node<_Val> >::other _Node_allocator;
433 typedef _Rb_tree_node_base* _Base_ptr;
434 typedef const _Rb_tree_node_base* _Const_Base_ptr;
435 typedef _Rb_tree_node<_Val>* _Link_type;
436 typedef const _Rb_tree_node<_Val>* _Const_Link_type;
441 struct _Reuse_or_alloc_node
443 _Reuse_or_alloc_node(_Rb_tree& __t)
444 : _M_root(__t._M_root()), _M_nodes(__t._M_rightmost()), _M_t(__t)
448 _M_root->_M_parent = 0;
450 if (_M_nodes->_M_left)
451 _M_nodes = _M_nodes->_M_left;
457 #if __cplusplus >= 201103L 458 _Reuse_or_alloc_node(
const _Reuse_or_alloc_node&) =
delete;
461 ~_Reuse_or_alloc_node()
462 { _M_t._M_erase(static_cast<_Link_type>(_M_root)); }
464 template<
typename _Arg>
466 operator()(_GLIBCXX_FWDREF(_Arg) __arg)
468 _Link_type __node =
static_cast<_Link_type
>(_M_extract());
471 _M_t._M_destroy_node(__node);
472 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg));
476 return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg));
486 _Base_ptr __node = _M_nodes;
487 _M_nodes = _M_nodes->_M_parent;
490 if (_M_nodes->_M_right == __node)
492 _M_nodes->_M_right = 0;
494 if (_M_nodes->_M_left)
496 _M_nodes = _M_nodes->_M_left;
498 while (_M_nodes->_M_right)
499 _M_nodes = _M_nodes->_M_right;
501 if (_M_nodes->_M_left)
502 _M_nodes = _M_nodes->_M_left;
506 _M_nodes->_M_left = 0;
523 _Alloc_node(_Rb_tree& __t)
526 template<
typename _Arg>
528 operator()(_GLIBCXX_FWDREF(_Arg) __arg)
const 529 {
return _M_t._M_create_node(_GLIBCXX_FORWARD(_Arg, __arg)); }
536 typedef _Key key_type;
537 typedef _Val value_type;
538 typedef value_type* pointer;
539 typedef const value_type* const_pointer;
540 typedef value_type& reference;
541 typedef const value_type& const_reference;
542 typedef size_t size_type;
543 typedef ptrdiff_t difference_type;
544 typedef _Alloc allocator_type;
547 _M_get_Node_allocator() _GLIBCXX_NOEXCEPT
548 {
return this->_M_impl; }
550 const _Node_allocator&
551 _M_get_Node_allocator() const _GLIBCXX_NOEXCEPT
552 {
return this->_M_impl; }
555 get_allocator() const _GLIBCXX_NOEXCEPT
556 {
return allocator_type(_M_get_Node_allocator()); }
564 _M_put_node(_Link_type __p) _GLIBCXX_NOEXCEPT
567 #if __cplusplus < 201103L 569 _M_construct_node(_Link_type __node,
const value_type& __x)
572 { get_allocator().construct(__node->_M_valptr(), __x); }
576 __throw_exception_again;
581 _M_create_node(
const value_type& __x)
583 _Link_type __tmp = _M_get_node();
584 _M_construct_node(__tmp, __x);
588 template<
typename... _Args>
590 _M_construct_node(_Link_type __node, _Args&&... __args)
594 ::new(__node) _Rb_tree_node<_Val>;
595 _Alloc_traits::construct(_M_get_Node_allocator(),
597 std::forward<_Args>(__args)...);
601 __node->~_Rb_tree_node<_Val>();
603 __throw_exception_again;
607 template<
typename... _Args>
609 _M_create_node(_Args&&... __args)
611 _Link_type __tmp = _M_get_node();
612 _M_construct_node(__tmp, std::forward<_Args>(__args)...);
618 _M_destroy_node(_Link_type __p) _GLIBCXX_NOEXCEPT
620 #if __cplusplus < 201103L 621 get_allocator().destroy(__p->_M_valptr());
623 _Alloc_traits::destroy(_M_get_Node_allocator(), __p->_M_valptr());
624 __p->~_Rb_tree_node<_Val>();
629 _M_drop_node(_Link_type __p) _GLIBCXX_NOEXCEPT
631 _M_destroy_node(__p);
635 template<
bool _MoveValue,
typename _NodeGen>
637 _M_clone_node(_Link_type __x, _NodeGen& __node_gen)
639 #if __cplusplus >= 201103L 640 using _Vp =
typename conditional<_MoveValue,
642 const value_type&>::type;
645 = __node_gen(_GLIBCXX_FORWARD(_Vp, *__x->_M_valptr()));
646 __tmp->_M_color = __x->_M_color;
653 #if _GLIBCXX_INLINE_VERSION 654 template<
typename _Key_compare>
657 template<
typename _Key_compare,
658 bool = __is_pod(_Key_compare)>
661 :
public _Node_allocator
662 ,
public _Rb_tree_key_compare<_Key_compare>
663 ,
public _Rb_tree_header
665 typedef _Rb_tree_key_compare<_Key_compare> _Base_key_compare;
668 _GLIBCXX_NOEXCEPT_IF(
669 is_nothrow_default_constructible<_Node_allocator>::value
670 && is_nothrow_default_constructible<_Base_key_compare>::value )
674 _Rb_tree_impl(
const _Rb_tree_impl& __x)
675 : _Node_allocator(_Alloc_traits::_S_select_on_copy(__x))
676 , _Base_key_compare(__x._M_key_compare)
680 #if __cplusplus < 201103L 681 _Rb_tree_impl(
const _Key_compare& __comp,
const _Node_allocator& __a)
682 : _Node_allocator(__a), _Base_key_compare(__comp)
685 _Rb_tree_impl(_Rb_tree_impl&&)
686 noexcept( is_nothrow_move_constructible<_Base_key_compare>::value )
690 _Rb_tree_impl(_Node_allocator&& __a)
691 : _Node_allocator(
std::
move(__a))
694 _Rb_tree_impl(_Rb_tree_impl&& __x, _Node_allocator&& __a)
695 : _Node_allocator(
std::
move(__a)),
696 _Base_key_compare(
std::
move(__x)),
697 _Rb_tree_header(
std::
move(__x))
700 _Rb_tree_impl(
const _Key_compare& __comp, _Node_allocator&& __a)
701 : _Node_allocator(
std::
move(__a)), _Base_key_compare(__comp)
706 _Rb_tree_impl<_Compare> _M_impl;
710 _M_root() _GLIBCXX_NOEXCEPT
711 {
return this->_M_impl._M_header._M_parent; }
714 _M_root() const _GLIBCXX_NOEXCEPT
715 {
return this->_M_impl._M_header._M_parent; }
718 _M_leftmost() _GLIBCXX_NOEXCEPT
719 {
return this->_M_impl._M_header._M_left; }
722 _M_leftmost() const _GLIBCXX_NOEXCEPT
723 {
return this->_M_impl._M_header._M_left; }
726 _M_rightmost() _GLIBCXX_NOEXCEPT
727 {
return this->_M_impl._M_header._M_right; }
730 _M_rightmost() const _GLIBCXX_NOEXCEPT
731 {
return this->_M_impl._M_header._M_right; }
734 _M_mbegin() const _GLIBCXX_NOEXCEPT
735 {
return static_cast<_Link_type
>(this->_M_impl._M_header._M_parent); }
738 _M_begin() _GLIBCXX_NOEXCEPT
739 {
return _M_mbegin(); }
742 _M_begin() const _GLIBCXX_NOEXCEPT
744 return static_cast<_Const_Link_type
> 745 (this->_M_impl._M_header._M_parent);
749 _M_end() _GLIBCXX_NOEXCEPT
750 {
return &this->_M_impl._M_header; }
753 _M_end() const _GLIBCXX_NOEXCEPT
754 {
return &this->_M_impl._M_header; }
757 _S_key(_Const_Link_type __x)
759 #if __cplusplus >= 201103L 762 static_assert(__is_invocable<_Compare&, const _Key&, const _Key&>{},
763 "comparison object must be invocable " 764 "with two arguments of key type");
765 # if __cplusplus >= 201703L 768 if constexpr (__is_invocable<_Compare&, const _Key&, const _Key&>{})
770 is_invocable_v<const _Compare&, const _Key&, const _Key&>,
771 "comparison object must be invocable as const");
775 return _KeyOfValue()(*__x->_M_valptr());
779 _S_left(_Base_ptr __x) _GLIBCXX_NOEXCEPT
780 {
return static_cast<_Link_type
>(__x->_M_left); }
782 static _Const_Link_type
783 _S_left(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
784 {
return static_cast<_Const_Link_type
>(__x->_M_left); }
787 _S_right(_Base_ptr __x) _GLIBCXX_NOEXCEPT
788 {
return static_cast<_Link_type
>(__x->_M_right); }
790 static _Const_Link_type
791 _S_right(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
792 {
return static_cast<_Const_Link_type
>(__x->_M_right); }
795 _S_key(_Const_Base_ptr __x)
796 {
return _S_key(static_cast<_Const_Link_type>(__x)); }
799 _S_minimum(_Base_ptr __x) _GLIBCXX_NOEXCEPT
800 {
return _Rb_tree_node_base::_S_minimum(__x); }
802 static _Const_Base_ptr
803 _S_minimum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
804 {
return _Rb_tree_node_base::_S_minimum(__x); }
807 _S_maximum(_Base_ptr __x) _GLIBCXX_NOEXCEPT
808 {
return _Rb_tree_node_base::_S_maximum(__x); }
810 static _Const_Base_ptr
811 _S_maximum(_Const_Base_ptr __x) _GLIBCXX_NOEXCEPT
812 {
return _Rb_tree_node_base::_S_maximum(__x); }
815 typedef _Rb_tree_iterator<value_type> iterator;
816 typedef _Rb_tree_const_iterator<value_type> const_iterator;
821 #if __cplusplus > 201402L 822 using node_type = _Node_handle<_Key, _Val, _Node_allocator>;
823 using insert_return_type = _Node_insert_return<
824 conditional_t<is_same_v<_Key, _Val>, const_iterator, iterator>,
828 pair<_Base_ptr, _Base_ptr>
829 _M_get_insert_unique_pos(
const key_type& __k);
831 pair<_Base_ptr, _Base_ptr>
832 _M_get_insert_equal_pos(
const key_type& __k);
834 pair<_Base_ptr, _Base_ptr>
835 _M_get_insert_hint_unique_pos(const_iterator __pos,
836 const key_type& __k);
838 pair<_Base_ptr, _Base_ptr>
839 _M_get_insert_hint_equal_pos(const_iterator __pos,
840 const key_type& __k);
843 #if __cplusplus >= 201103L 844 template<
typename _Arg,
typename _NodeGen>
846 _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v, _NodeGen&);
849 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);
851 template<
typename _Arg>
853 _M_insert_lower(_Base_ptr __y, _Arg&& __v);
855 template<
typename _Arg>
857 _M_insert_equal_lower(_Arg&& __x);
860 _M_insert_lower_node(_Base_ptr __p, _Link_type __z);
863 _M_insert_equal_lower_node(_Link_type __z);
865 template<
typename _NodeGen>
867 _M_insert_(_Base_ptr __x, _Base_ptr __y,
868 const value_type& __v, _NodeGen&);
873 _M_insert_lower(_Base_ptr __y,
const value_type& __v);
876 _M_insert_equal_lower(
const value_type& __x);
879 enum { __as_lvalue, __as_rvalue };
881 template<
bool _MoveValues,
typename _NodeGen>
883 _M_copy(_Link_type, _Base_ptr, _NodeGen&);
885 template<
bool _MoveValues,
typename _NodeGen>
887 _M_copy(
const _Rb_tree& __x, _NodeGen& __gen)
890 _M_copy<_MoveValues>(__x._M_mbegin(), _M_end(), __gen);
891 _M_leftmost() = _S_minimum(__root);
892 _M_rightmost() = _S_maximum(__root);
893 _M_impl._M_node_count = __x._M_impl._M_node_count;
898 _M_copy(
const _Rb_tree& __x)
900 _Alloc_node __an(*
this);
901 return _M_copy<__as_lvalue>(__x, __an);
905 _M_erase(_Link_type __x);
908 _M_lower_bound(_Link_type __x, _Base_ptr __y,
912 _M_lower_bound(_Const_Link_type __x, _Const_Base_ptr __y,
913 const _Key& __k)
const;
916 _M_upper_bound(_Link_type __x, _Base_ptr __y,
920 _M_upper_bound(_Const_Link_type __x, _Const_Base_ptr __y,
921 const _Key& __k)
const;
925 #if __cplusplus < 201103L 928 _Rb_tree() =
default;
931 _Rb_tree(
const _Compare& __comp,
932 const allocator_type& __a = allocator_type())
933 : _M_impl(__comp, _Node_allocator(__a)) { }
935 _Rb_tree(
const _Rb_tree& __x)
936 : _M_impl(__x._M_impl)
938 if (__x._M_root() != 0)
939 _M_root() = _M_copy(__x);
942 #if __cplusplus >= 201103L 943 _Rb_tree(
const allocator_type& __a)
944 : _M_impl(_Node_allocator(__a))
947 _Rb_tree(
const _Rb_tree& __x,
const allocator_type& __a)
948 : _M_impl(__x._M_impl._M_key_compare, _Node_allocator(__a))
950 if (__x._M_root() !=
nullptr)
951 _M_root() = _M_copy(__x);
954 _Rb_tree(_Rb_tree&&) =
default;
956 _Rb_tree(_Rb_tree&& __x,
const allocator_type& __a)
957 : _Rb_tree(
std::
move(__x), _Node_allocator(__a))
961 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a,
true_type)
962 noexcept(is_nothrow_default_constructible<_Compare>::value)
966 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a,
false_type)
967 : _M_impl(__x._M_impl._M_key_compare,
std::
move(__a))
969 if (__x._M_root() !=
nullptr)
974 _Rb_tree(_Rb_tree&& __x, _Node_allocator&& __a)
976 _Rb_tree(std::declval<_Rb_tree&&>(), std::declval<_Node_allocator&&>(),
977 std::declval<typename _Alloc_traits::is_always_equal>())) )
979 typename _Alloc_traits::is_always_equal{})
983 ~_Rb_tree() _GLIBCXX_NOEXCEPT
984 { _M_erase(_M_begin()); }
992 {
return _M_impl._M_key_compare; }
995 begin() _GLIBCXX_NOEXCEPT
996 {
return iterator(this->_M_impl._M_header._M_left); }
999 begin() const _GLIBCXX_NOEXCEPT
1000 {
return const_iterator(this->_M_impl._M_header._M_left); }
1003 end() _GLIBCXX_NOEXCEPT
1004 {
return iterator(&this->_M_impl._M_header); }
1007 end() const _GLIBCXX_NOEXCEPT
1008 {
return const_iterator(&this->_M_impl._M_header); }
1011 rbegin() _GLIBCXX_NOEXCEPT
1012 {
return reverse_iterator(
end()); }
1014 const_reverse_iterator
1015 rbegin() const _GLIBCXX_NOEXCEPT
1016 {
return const_reverse_iterator(
end()); }
1019 rend() _GLIBCXX_NOEXCEPT
1020 {
return reverse_iterator(
begin()); }
1022 const_reverse_iterator
1023 rend() const _GLIBCXX_NOEXCEPT
1024 {
return const_reverse_iterator(
begin()); }
1026 _GLIBCXX_NODISCARD
bool 1027 empty() const _GLIBCXX_NOEXCEPT
1028 {
return _M_impl._M_node_count == 0; }
1031 size() const _GLIBCXX_NOEXCEPT
1032 {
return _M_impl._M_node_count; }
1035 max_size() const _GLIBCXX_NOEXCEPT
1040 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value);
1043 #if __cplusplus >= 201103L 1044 template<
typename _Arg>
1045 pair<iterator, bool>
1046 _M_insert_unique(_Arg&& __x);
1048 template<
typename _Arg>
1050 _M_insert_equal(_Arg&& __x);
1052 template<
typename _Arg,
typename _NodeGen>
1054 _M_insert_unique_(const_iterator __pos, _Arg&& __x, _NodeGen&);
1056 template<
typename _Arg>
1058 _M_insert_unique_(const_iterator __pos, _Arg&& __x)
1060 _Alloc_node __an(*
this);
1061 return _M_insert_unique_(__pos, std::forward<_Arg>(__x), __an);
1064 template<
typename _Arg,
typename _NodeGen>
1066 _M_insert_equal_(const_iterator __pos, _Arg&& __x, _NodeGen&);
1068 template<
typename _Arg>
1070 _M_insert_equal_(const_iterator __pos, _Arg&& __x)
1072 _Alloc_node __an(*
this);
1073 return _M_insert_equal_(__pos, std::forward<_Arg>(__x), __an);
1076 template<
typename... _Args>
1077 pair<iterator, bool>
1078 _M_emplace_unique(_Args&&... __args);
1080 template<
typename... _Args>
1082 _M_emplace_equal(_Args&&... __args);
1084 template<
typename... _Args>
1086 _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args);
1088 template<
typename... _Args>
1090 _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args);
1092 template<
typename _Iter>
1093 using __same_value_type
1094 = is_same<value_type, typename iterator_traits<_Iter>::value_type>;
1096 template<
typename _InputIterator>
1097 __enable_if_t<__same_value_type<_InputIterator>::value>
1098 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1100 _Alloc_node __an(*
this);
1101 for (; __first != __last; ++__first)
1102 _M_insert_unique_(
end(), *__first, __an);
1105 template<
typename _InputIterator>
1106 __enable_if_t<!__same_value_type<_InputIterator>::value>
1107 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1109 for (; __first != __last; ++__first)
1110 _M_emplace_unique(*__first);
1113 template<
typename _InputIterator>
1114 __enable_if_t<__same_value_type<_InputIterator>::value>
1115 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1117 _Alloc_node __an(*
this);
1118 for (; __first != __last; ++__first)
1119 _M_insert_equal_(
end(), *__first, __an);
1122 template<
typename _InputIterator>
1123 __enable_if_t<!__same_value_type<_InputIterator>::value>
1124 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1126 _Alloc_node __an(*
this);
1127 for (; __first != __last; ++__first)
1128 _M_emplace_equal(*__first);
1131 pair<iterator, bool>
1132 _M_insert_unique(
const value_type& __x);
1135 _M_insert_equal(
const value_type& __x);
1137 template<
typename _NodeGen>
1139 _M_insert_unique_(const_iterator __pos,
const value_type& __x,
1143 _M_insert_unique_(const_iterator __pos,
const value_type& __x)
1145 _Alloc_node __an(*
this);
1146 return _M_insert_unique_(__pos, __x, __an);
1149 template<
typename _NodeGen>
1151 _M_insert_equal_(const_iterator __pos,
const value_type& __x,
1154 _M_insert_equal_(const_iterator __pos,
const value_type& __x)
1156 _Alloc_node __an(*
this);
1157 return _M_insert_equal_(__pos, __x, __an);
1160 template<
typename _InputIterator>
1162 _M_insert_range_unique(_InputIterator __first, _InputIterator __last)
1164 _Alloc_node __an(*
this);
1165 for (; __first != __last; ++__first)
1166 _M_insert_unique_(
end(), *__first, __an);
1169 template<
typename _InputIterator>
1171 _M_insert_range_equal(_InputIterator __first, _InputIterator __last)
1173 _Alloc_node __an(*
this);
1174 for (; __first != __last; ++__first)
1175 _M_insert_equal_(
end(), *__first, __an);
1181 _M_erase_aux(const_iterator __position);
1184 _M_erase_aux(const_iterator __first, const_iterator __last);
1187 #if __cplusplus >= 201103L 1190 _GLIBCXX_ABI_TAG_CXX11
1192 erase(const_iterator __position)
1194 __glibcxx_assert(__position !=
end());
1195 const_iterator __result = __position;
1197 _M_erase_aux(__position);
1198 return __result._M_const_cast();
1202 _GLIBCXX_ABI_TAG_CXX11
1204 erase(iterator __position)
1206 __glibcxx_assert(__position !=
end());
1207 iterator __result = __position;
1209 _M_erase_aux(__position);
1214 erase(iterator __position)
1216 __glibcxx_assert(__position !=
end());
1217 _M_erase_aux(__position);
1221 erase(const_iterator __position)
1223 __glibcxx_assert(__position !=
end());
1224 _M_erase_aux(__position);
1229 erase(
const key_type& __x);
1231 #if __cplusplus >= 201103L 1234 _GLIBCXX_ABI_TAG_CXX11
1236 erase(const_iterator __first, const_iterator __last)
1238 _M_erase_aux(__first, __last);
1239 return __last._M_const_cast();
1243 erase(iterator __first, iterator __last)
1244 { _M_erase_aux(__first, __last); }
1247 erase(const_iterator __first, const_iterator __last)
1248 { _M_erase_aux(__first, __last); }
1252 clear() _GLIBCXX_NOEXCEPT
1254 _M_erase(_M_begin());
1260 find(
const key_type& __k);
1263 find(
const key_type& __k)
const;
1266 count(
const key_type& __k)
const;
1269 lower_bound(
const key_type& __k)
1270 {
return _M_lower_bound(_M_begin(), _M_end(), __k); }
1273 lower_bound(
const key_type& __k)
const 1274 {
return _M_lower_bound(_M_begin(), _M_end(), __k); }
1277 upper_bound(
const key_type& __k)
1278 {
return _M_upper_bound(_M_begin(), _M_end(), __k); }
1281 upper_bound(
const key_type& __k)
const 1282 {
return _M_upper_bound(_M_begin(), _M_end(), __k); }
1284 pair<iterator, iterator>
1285 equal_range(
const key_type& __k);
1287 pair<const_iterator, const_iterator>
1288 equal_range(
const key_type& __k)
const;
1290 #if __cplusplus >= 201402L 1291 template<
typename _Kt,
1292 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1294 _M_find_tr(
const _Kt& __k)
1296 const _Rb_tree* __const_this =
this;
1297 return __const_this->_M_find_tr(__k)._M_const_cast();
1300 template<
typename _Kt,
1301 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1303 _M_find_tr(
const _Kt& __k)
const 1305 auto __j = _M_lower_bound_tr(__k);
1306 if (__j !=
end() && _M_impl._M_key_compare(__k, _S_key(__j._M_node)))
1311 template<
typename _Kt,
1312 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1314 _M_count_tr(
const _Kt& __k)
const 1316 auto __p = _M_equal_range_tr(__k);
1320 template<
typename _Kt,
1321 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1323 _M_lower_bound_tr(
const _Kt& __k)
1325 const _Rb_tree* __const_this =
this;
1326 return __const_this->_M_lower_bound_tr(__k)._M_const_cast();
1329 template<
typename _Kt,
1330 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1332 _M_lower_bound_tr(
const _Kt& __k)
const 1334 auto __x = _M_begin();
1335 auto __y = _M_end();
1337 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1343 __x = _S_right(__x);
1344 return const_iterator(__y);
1347 template<
typename _Kt,
1348 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1350 _M_upper_bound_tr(
const _Kt& __k)
1352 const _Rb_tree* __const_this =
this;
1353 return __const_this->_M_upper_bound_tr(__k)._M_const_cast();
1356 template<
typename _Kt,
1357 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1359 _M_upper_bound_tr(
const _Kt& __k)
const 1361 auto __x = _M_begin();
1362 auto __y = _M_end();
1364 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1370 __x = _S_right(__x);
1371 return const_iterator(__y);
1374 template<
typename _Kt,
1375 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1376 pair<iterator, iterator>
1377 _M_equal_range_tr(
const _Kt& __k)
1379 const _Rb_tree* __const_this =
this;
1380 auto __ret = __const_this->_M_equal_range_tr(__k);
1381 return { __ret.first._M_const_cast(), __ret.second._M_const_cast() };
1384 template<
typename _Kt,
1385 typename _Req = __has_is_transparent_t<_Compare, _Kt>>
1386 pair<const_iterator, const_iterator>
1387 _M_equal_range_tr(
const _Kt& __k)
const 1389 auto __low = _M_lower_bound_tr(__k);
1390 auto __high = __low;
1391 auto& __cmp = _M_impl._M_key_compare;
1392 while (__high !=
end() && !__cmp(__k, _S_key(__high._M_node)))
1394 return { __low, __high };
1400 __rb_verify()
const;
1402 #if __cplusplus >= 201103L 1405 noexcept(_Alloc_traits::_S_nothrow_move()
1406 && is_nothrow_move_assignable<_Compare>::value);
1408 template<typename _Iterator>
1410 _M_assign_unique(_Iterator, _Iterator);
1412 template<typename _Iterator>
1414 _M_assign_equal(_Iterator, _Iterator);
1420 { _M_impl._M_move_data(__x._M_impl); }
1437 #if __cplusplus > 201402L 1441 _M_reinsert_node_unique(node_type&& __nh)
1443 insert_return_type __ret;
1445 __ret.position =
end();
1448 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1450 auto __res = _M_get_insert_unique_pos(__nh._M_key());
1454 = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1455 __nh._M_ptr =
nullptr;
1456 __ret.inserted =
true;
1461 __ret.position = iterator(__res.first);
1462 __ret.inserted =
false;
1470 _M_reinsert_node_equal(node_type&& __nh)
1477 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1478 auto __res = _M_get_insert_equal_pos(__nh._M_key());
1480 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1482 __ret = _M_insert_equal_lower_node(__nh._M_ptr);
1483 __nh._M_ptr =
nullptr;
1490 _M_reinsert_node_hint_unique(const_iterator __hint, node_type&& __nh)
1497 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1498 auto __res = _M_get_insert_hint_unique_pos(__hint, __nh._M_key());
1501 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1502 __nh._M_ptr =
nullptr;
1505 __ret = iterator(__res.first);
1512 _M_reinsert_node_hint_equal(const_iterator __hint, node_type&& __nh)
1519 __glibcxx_assert(_M_get_Node_allocator() == *__nh._M_alloc);
1520 auto __res = _M_get_insert_hint_equal_pos(__hint, __nh._M_key());
1522 __ret = _M_insert_node(__res.first, __res.second, __nh._M_ptr);
1524 __ret = _M_insert_equal_lower_node(__nh._M_ptr);
1525 __nh._M_ptr =
nullptr;
1532 extract(const_iterator __pos)
1534 auto __ptr = _Rb_tree_rebalance_for_erase(
1535 __pos._M_const_cast()._M_node, _M_impl._M_header);
1536 --_M_impl._M_node_count;
1537 return {
static_cast<_Link_type
>(__ptr), _M_get_Node_allocator() };
1542 extract(
const key_type& __k)
1545 auto __pos = find(__k);
1547 __nh = extract(const_iterator(__pos));
1551 template<
typename _Compare2>
1552 using _Compatible_tree
1553 = _Rb_tree<_Key, _Val, _KeyOfValue, _Compare2, _Alloc>;
1555 template<
typename,
typename>
1556 friend class _Rb_tree_merge_helper;
1559 template<
typename _Compare2>
1561 _M_merge_unique(_Compatible_tree<_Compare2>& __src) noexcept
1563 using _Merge_helper = _Rb_tree_merge_helper<_Rb_tree, _Compare2>;
1564 for (
auto __i = __src.begin(), __end = __src.end(); __i != __end;)
1567 auto __res = _M_get_insert_unique_pos(_KeyOfValue()(*__pos));
1570 auto& __src_impl = _Merge_helper::_S_get_impl(__src);
1571 auto __ptr = _Rb_tree_rebalance_for_erase(
1572 __pos._M_node, __src_impl._M_header);
1573 --__src_impl._M_node_count;
1574 _M_insert_node(__res.first, __res.second,
1575 static_cast<_Link_type>(__ptr));
1581 template<
typename _Compare2>
1583 _M_merge_equal(_Compatible_tree<_Compare2>& __src) noexcept
1585 using _Merge_helper = _Rb_tree_merge_helper<_Rb_tree, _Compare2>;
1586 for (
auto __i = __src.begin(), __end = __src.end(); __i != __end;)
1589 auto __res = _M_get_insert_equal_pos(_KeyOfValue()(*__pos));
1592 auto& __src_impl = _Merge_helper::_S_get_impl(__src);
1593 auto __ptr = _Rb_tree_rebalance_for_erase(
1594 __pos._M_node, __src_impl._M_header);
1595 --__src_impl._M_node_count;
1596 _M_insert_node(__res.first, __res.second,
1597 static_cast<_Link_type>(__ptr));
1604 operator==(
const _Rb_tree& __x,
const _Rb_tree& __y)
1606 return __x.size() == __y.size()
1607 &&
std::equal(__x.begin(), __x.end(), __y.begin());
1610 #if __cpp_lib_three_way_comparison 1612 operator<=>(
const _Rb_tree& __x,
const _Rb_tree& __y)
1614 if constexpr (requires {
typename __detail::__synth3way_t<_Val>; })
1615 return std::lexicographical_compare_three_way(__x.begin(), __x.end(),
1616 __y.begin(), __y.end(),
1617 __detail::__synth3way);
1621 operator<(
const _Rb_tree& __x,
const _Rb_tree& __y)
1624 __y.begin(), __y.end());
1629 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1630 typename _Compare,
typename _Alloc>
1632 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
1633 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
1636 #if __cplusplus >= 201103L 1637 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1638 typename _Compare,
typename _Alloc>
1640 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1643 if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
1647 _Alloc_node __an(*
this);
1649 _M_copy<!__move_if_noexcept_cond<value_type>::value>(__x, __an);
1653 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1654 typename _Compare,
typename _Alloc>
1656 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1657 _M_move_assign(_Rb_tree& __x,
true_type)
1660 if (__x._M_root() !=
nullptr)
1662 std::__alloc_on_move(_M_get_Node_allocator(),
1663 __x._M_get_Node_allocator());
1666 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1667 typename _Compare,
typename _Alloc>
1669 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1672 if (_M_get_Node_allocator() == __x._M_get_Node_allocator())
1673 return _M_move_assign(__x,
true_type{});
1677 _Reuse_or_alloc_node __roan(*
this);
1679 if (__x._M_root() !=
nullptr)
1681 _M_root() = _M_copy<__as_rvalue>(__x, __roan);
1686 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1687 typename _Compare,
typename _Alloc>
1688 inline _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
1691 noexcept(_Alloc_traits::_S_nothrow_move()
1692 && is_nothrow_move_assignable<_Compare>::value)
1694 _M_impl._M_key_compare =
std::move(__x._M_impl._M_key_compare);
1695 _M_move_assign(__x, __bool_constant<_Alloc_traits::_S_nothrow_move()>());
1699 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1700 typename _Compare,
typename _Alloc>
1701 template<
typename _Iterator>
1703 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1704 _M_assign_unique(_Iterator __first, _Iterator __last)
1706 _Reuse_or_alloc_node __roan(*
this);
1708 for (; __first != __last; ++__first)
1709 _M_insert_unique_(
end(), *__first, __roan);
1712 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1713 typename _Compare,
typename _Alloc>
1714 template<
typename _Iterator>
1716 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1717 _M_assign_equal(_Iterator __first, _Iterator __last)
1719 _Reuse_or_alloc_node __roan(*
this);
1721 for (; __first != __last; ++__first)
1722 _M_insert_equal_(
end(), *__first, __roan);
1726 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1727 typename _Compare,
typename _Alloc>
1728 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
1735 #if __cplusplus >= 201103L 1736 if (_Alloc_traits::_S_propagate_on_copy_assign())
1738 auto& __this_alloc = this->_M_get_Node_allocator();
1739 auto& __that_alloc = __x._M_get_Node_allocator();
1740 if (!_Alloc_traits::_S_always_equal()
1741 && __this_alloc != __that_alloc)
1746 std::__alloc_on_copy(__this_alloc, __that_alloc);
1751 _Reuse_or_alloc_node __roan(*
this);
1753 _M_impl._M_key_compare = __x._M_impl._M_key_compare;
1754 if (__x._M_root() != 0)
1755 _M_root() = _M_copy<__as_lvalue>(__x, __roan);
1761 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1762 typename _Compare,
typename _Alloc>
1763 #if __cplusplus >= 201103L 1764 template<
typename _Arg,
typename _NodeGen>
1766 template<
typename _NodeGen>
1768 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1769 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1770 _M_insert_(_Base_ptr __x, _Base_ptr __p,
1771 #
if __cplusplus >= 201103L
1776 _NodeGen& __node_gen)
1778 bool __insert_left = (__x != 0 || __p == _M_end()
1779 || _M_impl._M_key_compare(_KeyOfValue()(__v),
1782 _Link_type __z = __node_gen(_GLIBCXX_FORWARD(_Arg, __v));
1784 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1785 this->_M_impl._M_header);
1786 ++_M_impl._M_node_count;
1787 return iterator(__z);
1790 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1791 typename _Compare,
typename _Alloc>
1792 #if __cplusplus >= 201103L 1793 template<
typename _Arg>
1795 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1796 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1797 #if __cplusplus >= 201103L 1798 _M_insert_lower(_Base_ptr __p, _Arg&& __v)
1800 _M_insert_lower(_Base_ptr __p,
const _Val& __v)
1803 bool __insert_left = (__p == _M_end()
1804 || !_M_impl._M_key_compare(_S_key(__p),
1805 _KeyOfValue()(__v)));
1807 _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v));
1809 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1810 this->_M_impl._M_header);
1811 ++_M_impl._M_node_count;
1812 return iterator(__z);
1815 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1816 typename _Compare,
typename _Alloc>
1817 #if __cplusplus >= 201103L 1818 template<
typename _Arg>
1820 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1821 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1822 #if __cplusplus >= 201103L 1823 _M_insert_equal_lower(_Arg&& __v)
1825 _M_insert_equal_lower(
const _Val& __v)
1828 _Link_type __x = _M_begin();
1829 _Base_ptr __y = _M_end();
1833 __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?
1834 _S_left(__x) : _S_right(__x);
1836 return _M_insert_lower(__y, _GLIBCXX_FORWARD(_Arg, __v));
1839 template<
typename _Key,
typename _Val,
typename _KoV,
1840 typename _Compare,
typename _Alloc>
1841 template<
bool _MoveValues,
typename _NodeGen>
1842 typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
1843 _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
1844 _M_copy(_Link_type __x, _Base_ptr __p, _NodeGen& __node_gen)
1847 _Link_type __top = _M_clone_node<_MoveValues>(__x, __node_gen);
1848 __top->_M_parent = __p;
1854 _M_copy<_MoveValues>(_S_right(__x), __top, __node_gen);
1860 _Link_type __y = _M_clone_node<_MoveValues>(__x, __node_gen);
1862 __y->_M_parent = __p;
1864 __y->_M_right = _M_copy<_MoveValues>(_S_right(__x),
1873 __throw_exception_again;
1878 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1879 typename _Compare,
typename _Alloc>
1881 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1882 _M_erase(_Link_type __x)
1887 _M_erase(_S_right(__x));
1888 _Link_type __y = _S_left(__x);
1894 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1895 typename _Compare,
typename _Alloc>
1896 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1897 _Compare, _Alloc>::iterator
1898 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1899 _M_lower_bound(_Link_type __x, _Base_ptr __y,
1903 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1904 __y = __x, __x = _S_left(__x);
1906 __x = _S_right(__x);
1907 return iterator(__y);
1910 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1911 typename _Compare,
typename _Alloc>
1912 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1913 _Compare, _Alloc>::const_iterator
1914 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1915 _M_lower_bound(_Const_Link_type __x, _Const_Base_ptr __y,
1916 const _Key& __k)
const 1919 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1920 __y = __x, __x = _S_left(__x);
1922 __x = _S_right(__x);
1923 return const_iterator(__y);
1926 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1927 typename _Compare,
typename _Alloc>
1928 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1929 _Compare, _Alloc>::iterator
1930 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1931 _M_upper_bound(_Link_type __x, _Base_ptr __y,
1935 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1936 __y = __x, __x = _S_left(__x);
1938 __x = _S_right(__x);
1939 return iterator(__y);
1942 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1943 typename _Compare,
typename _Alloc>
1944 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1945 _Compare, _Alloc>::const_iterator
1946 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1947 _M_upper_bound(_Const_Link_type __x, _Const_Base_ptr __y,
1948 const _Key& __k)
const 1951 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1952 __y = __x, __x = _S_left(__x);
1954 __x = _S_right(__x);
1955 return const_iterator(__y);
1958 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1959 typename _Compare,
typename _Alloc>
1960 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
1961 _Compare, _Alloc>::iterator,
1962 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1963 _Compare, _Alloc>::iterator>
1964 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1965 equal_range(
const _Key& __k)
1967 _Link_type __x = _M_begin();
1968 _Base_ptr __y = _M_end();
1971 if (_M_impl._M_key_compare(_S_key(__x), __k))
1972 __x = _S_right(__x);
1973 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
1974 __y = __x, __x = _S_left(__x);
1977 _Link_type __xu(__x);
1978 _Base_ptr __yu(__y);
1979 __y = __x, __x = _S_left(__x);
1980 __xu = _S_right(__xu);
1981 return pair<iterator,
1982 iterator>(_M_lower_bound(__x, __y, __k),
1983 _M_upper_bound(__xu, __yu, __k));
1986 return pair<iterator, iterator>(iterator(__y),
1990 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
1991 typename _Compare,
typename _Alloc>
1992 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
1993 _Compare, _Alloc>::const_iterator,
1994 typename _Rb_tree<_Key, _Val, _KeyOfValue,
1995 _Compare, _Alloc>::const_iterator>
1996 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1997 equal_range(
const _Key& __k)
const 1999 _Const_Link_type __x = _M_begin();
2000 _Const_Base_ptr __y = _M_end();
2003 if (_M_impl._M_key_compare(_S_key(__x), __k))
2004 __x = _S_right(__x);
2005 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
2006 __y = __x, __x = _S_left(__x);
2009 _Const_Link_type __xu(__x);
2010 _Const_Base_ptr __yu(__y);
2011 __y = __x, __x = _S_left(__x);
2012 __xu = _S_right(__xu);
2013 return pair<const_iterator,
2014 const_iterator>(_M_lower_bound(__x, __y, __k),
2015 _M_upper_bound(__xu, __yu, __k));
2018 return pair<const_iterator, const_iterator>(const_iterator(__y),
2019 const_iterator(__y));
2022 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2023 typename _Compare,
typename _Alloc>
2025 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2027 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value)
2031 if (__t._M_root() != 0)
2032 _M_impl._M_move_data(__t._M_impl);
2034 else if (__t._M_root() == 0)
2035 __t._M_impl._M_move_data(_M_impl);
2038 std::swap(_M_root(),__t._M_root());
2039 std::swap(_M_leftmost(),__t._M_leftmost());
2040 std::swap(_M_rightmost(),__t._M_rightmost());
2042 _M_root()->_M_parent = _M_end();
2043 __t._M_root()->_M_parent = __t._M_end();
2044 std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
2047 std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);
2049 _Alloc_traits::_S_on_swap(_M_get_Node_allocator(),
2050 __t._M_get_Node_allocator());
2053 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2054 typename _Compare,
typename _Alloc>
2055 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2056 _Compare, _Alloc>::_Base_ptr,
2057 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2058 _Compare, _Alloc>::_Base_ptr>
2059 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2060 _M_get_insert_unique_pos(
const key_type& __k)
2062 typedef pair<_Base_ptr, _Base_ptr> _Res;
2063 _Link_type __x = _M_begin();
2064 _Base_ptr __y = _M_end();
2069 __comp = _M_impl._M_key_compare(__k, _S_key(__x));
2070 __x = __comp ? _S_left(__x) : _S_right(__x);
2072 iterator __j = iterator(__y);
2076 return _Res(__x, __y);
2080 if (_M_impl._M_key_compare(_S_key(__j._M_node), __k))
2081 return _Res(__x, __y);
2082 return _Res(__j._M_node, 0);
2085 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2086 typename _Compare,
typename _Alloc>
2087 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2088 _Compare, _Alloc>::_Base_ptr,
2089 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2090 _Compare, _Alloc>::_Base_ptr>
2091 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2092 _M_get_insert_equal_pos(
const key_type& __k)
2094 typedef pair<_Base_ptr, _Base_ptr> _Res;
2095 _Link_type __x = _M_begin();
2096 _Base_ptr __y = _M_end();
2100 __x = _M_impl._M_key_compare(__k, _S_key(__x)) ?
2101 _S_left(__x) : _S_right(__x);
2103 return _Res(__x, __y);
2106 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2107 typename _Compare,
typename _Alloc>
2108 #if __cplusplus >= 201103L 2109 template<
typename _Arg>
2111 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2112 _Compare, _Alloc>::iterator,
bool>
2113 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2114 #if __cplusplus >= 201103L 2115 _M_insert_unique(_Arg&& __v)
2117 _M_insert_unique(
const _Val& __v)
2120 typedef pair<iterator, bool> _Res;
2121 pair<_Base_ptr, _Base_ptr> __res
2122 = _M_get_insert_unique_pos(_KeyOfValue()(__v));
2126 _Alloc_node __an(*
this);
2127 return _Res(_M_insert_(__res.first, __res.second,
2128 _GLIBCXX_FORWARD(_Arg, __v), __an),
2132 return _Res(iterator(__res.first),
false);
2135 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2136 typename _Compare,
typename _Alloc>
2137 #if __cplusplus >= 201103L 2138 template<
typename _Arg>
2140 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2141 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2142 #if __cplusplus >= 201103L 2143 _M_insert_equal(_Arg&& __v)
2145 _M_insert_equal(
const _Val& __v)
2148 pair<_Base_ptr, _Base_ptr> __res
2149 = _M_get_insert_equal_pos(_KeyOfValue()(__v));
2150 _Alloc_node __an(*
this);
2151 return _M_insert_(__res.first, __res.second,
2152 _GLIBCXX_FORWARD(_Arg, __v), __an);
2155 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2156 typename _Compare,
typename _Alloc>
2157 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2158 _Compare, _Alloc>::_Base_ptr,
2159 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2160 _Compare, _Alloc>::_Base_ptr>
2161 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2162 _M_get_insert_hint_unique_pos(const_iterator __position,
2163 const key_type& __k)
2165 iterator __pos = __position._M_const_cast();
2166 typedef pair<_Base_ptr, _Base_ptr> _Res;
2169 if (__pos._M_node == _M_end())
2172 && _M_impl._M_key_compare(_S_key(_M_rightmost()), __k))
2173 return _Res(0, _M_rightmost());
2175 return _M_get_insert_unique_pos(__k);
2177 else if (_M_impl._M_key_compare(__k, _S_key(__pos._M_node)))
2180 iterator __before = __pos;
2181 if (__pos._M_node == _M_leftmost())
2182 return _Res(_M_leftmost(), _M_leftmost());
2183 else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), __k))
2185 if (_S_right(__before._M_node) == 0)
2186 return _Res(0, __before._M_node);
2188 return _Res(__pos._M_node, __pos._M_node);
2191 return _M_get_insert_unique_pos(__k);
2193 else if (_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
2196 iterator __after = __pos;
2197 if (__pos._M_node == _M_rightmost())
2198 return _Res(0, _M_rightmost());
2199 else if (_M_impl._M_key_compare(__k, _S_key((++__after)._M_node)))
2201 if (_S_right(__pos._M_node) == 0)
2202 return _Res(0, __pos._M_node);
2204 return _Res(__after._M_node, __after._M_node);
2207 return _M_get_insert_unique_pos(__k);
2211 return _Res(__pos._M_node, 0);
2214 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2215 typename _Compare,
typename _Alloc>
2216 #if __cplusplus >= 201103L 2217 template<
typename _Arg,
typename _NodeGen>
2219 template<
typename _NodeGen>
2221 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2222 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2223 _M_insert_unique_(const_iterator __position,
2224 #
if __cplusplus >= 201103L
2229 _NodeGen& __node_gen)
2231 pair<_Base_ptr, _Base_ptr> __res
2232 = _M_get_insert_hint_unique_pos(__position, _KeyOfValue()(__v));
2235 return _M_insert_(__res.first, __res.second,
2236 _GLIBCXX_FORWARD(_Arg, __v),
2238 return iterator(__res.first);
2241 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2242 typename _Compare,
typename _Alloc>
2243 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2244 _Compare, _Alloc>::_Base_ptr,
2245 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2246 _Compare, _Alloc>::_Base_ptr>
2247 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2248 _M_get_insert_hint_equal_pos(const_iterator __position,
const key_type& __k)
2250 iterator __pos = __position._M_const_cast();
2251 typedef pair<_Base_ptr, _Base_ptr> _Res;
2254 if (__pos._M_node == _M_end())
2257 && !_M_impl._M_key_compare(__k, _S_key(_M_rightmost())))
2258 return _Res(0, _M_rightmost());
2260 return _M_get_insert_equal_pos(__k);
2262 else if (!_M_impl._M_key_compare(_S_key(__pos._M_node), __k))
2265 iterator __before = __pos;
2266 if (__pos._M_node == _M_leftmost())
2267 return _Res(_M_leftmost(), _M_leftmost());
2268 else if (!_M_impl._M_key_compare(__k, _S_key((--__before)._M_node)))
2270 if (_S_right(__before._M_node) == 0)
2271 return _Res(0, __before._M_node);
2273 return _Res(__pos._M_node, __pos._M_node);
2276 return _M_get_insert_equal_pos(__k);
2281 iterator __after = __pos;
2282 if (__pos._M_node == _M_rightmost())
2283 return _Res(0, _M_rightmost());
2284 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), __k))
2286 if (_S_right(__pos._M_node) == 0)
2287 return _Res(0, __pos._M_node);
2289 return _Res(__after._M_node, __after._M_node);
2296 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2297 typename _Compare,
typename _Alloc>
2298 #if __cplusplus >= 201103L 2299 template<
typename _Arg,
typename _NodeGen>
2301 template<
typename _NodeGen>
2303 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2304 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2305 _M_insert_equal_(const_iterator __position,
2306 #
if __cplusplus >= 201103L
2311 _NodeGen& __node_gen)
2313 pair<_Base_ptr, _Base_ptr> __res
2314 = _M_get_insert_hint_equal_pos(__position, _KeyOfValue()(__v));
2317 return _M_insert_(__res.first, __res.second,
2318 _GLIBCXX_FORWARD(_Arg, __v),
2321 return _M_insert_equal_lower(_GLIBCXX_FORWARD(_Arg, __v));
2324 #if __cplusplus >= 201103L 2325 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2326 typename _Compare,
typename _Alloc>
2327 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2328 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2329 _M_insert_node(_Base_ptr __x, _Base_ptr __p, _Link_type __z)
2331 bool __insert_left = (__x != 0 || __p == _M_end()
2332 || _M_impl._M_key_compare(_S_key(__z),
2335 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
2336 this->_M_impl._M_header);
2337 ++_M_impl._M_node_count;
2338 return iterator(__z);
2341 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2342 typename _Compare,
typename _Alloc>
2343 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2344 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2345 _M_insert_lower_node(_Base_ptr __p, _Link_type __z)
2347 bool __insert_left = (__p == _M_end()
2348 || !_M_impl._M_key_compare(_S_key(__p),
2351 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
2352 this->_M_impl._M_header);
2353 ++_M_impl._M_node_count;
2354 return iterator(__z);
2357 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2358 typename _Compare,
typename _Alloc>
2359 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2360 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2361 _M_insert_equal_lower_node(_Link_type __z)
2363 _Link_type __x = _M_begin();
2364 _Base_ptr __y = _M_end();
2368 __x = !_M_impl._M_key_compare(_S_key(__x), _S_key(__z)) ?
2369 _S_left(__x) : _S_right(__x);
2371 return _M_insert_lower_node(__y, __z);
2374 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2375 typename _Compare,
typename _Alloc>
2376 template<
typename... _Args>
2377 pair<
typename _Rb_tree<_Key, _Val, _KeyOfValue,
2378 _Compare, _Alloc>::iterator,
bool>
2379 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2380 _M_emplace_unique(_Args&&... __args)
2382 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2386 typedef pair<iterator, bool> _Res;
2387 auto __res = _M_get_insert_unique_pos(_S_key(__z));
2389 return _Res(_M_insert_node(__res.first, __res.second, __z),
true);
2392 return _Res(iterator(__res.first),
false);
2397 __throw_exception_again;
2401 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2402 typename _Compare,
typename _Alloc>
2403 template<
typename... _Args>
2404 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2405 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2406 _M_emplace_equal(_Args&&... __args)
2408 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2412 auto __res = _M_get_insert_equal_pos(_S_key(__z));
2413 return _M_insert_node(__res.first, __res.second, __z);
2418 __throw_exception_again;
2422 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2423 typename _Compare,
typename _Alloc>
2424 template<
typename... _Args>
2425 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2426 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2427 _M_emplace_hint_unique(const_iterator __pos, _Args&&... __args)
2429 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2433 auto __res = _M_get_insert_hint_unique_pos(__pos, _S_key(__z));
2436 return _M_insert_node(__res.first, __res.second, __z);
2439 return iterator(__res.first);
2444 __throw_exception_again;
2448 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2449 typename _Compare,
typename _Alloc>
2450 template<
typename... _Args>
2451 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
2452 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2453 _M_emplace_hint_equal(const_iterator __pos, _Args&&... __args)
2455 _Link_type __z = _M_create_node(std::forward<_Args>(__args)...);
2459 auto __res = _M_get_insert_hint_equal_pos(__pos, _S_key(__z));
2462 return _M_insert_node(__res.first, __res.second, __z);
2464 return _M_insert_equal_lower_node(__z);
2469 __throw_exception_again;
2475 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2476 typename _Compare,
typename _Alloc>
2478 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2479 _M_erase_aux(const_iterator __position)
2482 static_cast<_Link_type
>(_Rb_tree_rebalance_for_erase
2483 (const_cast<_Base_ptr>(__position._M_node),
2484 this->_M_impl._M_header));
2486 --_M_impl._M_node_count;
2489 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2490 typename _Compare,
typename _Alloc>
2492 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2493 _M_erase_aux(const_iterator __first, const_iterator __last)
2495 if (__first ==
begin() && __last ==
end())
2498 while (__first != __last)
2499 _M_erase_aux(__first++);
2502 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2503 typename _Compare,
typename _Alloc>
2504 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
2505 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2506 erase(
const _Key& __x)
2508 pair<iterator, iterator> __p = equal_range(__x);
2509 const size_type __old_size =
size();
2510 _M_erase_aux(__p.first, __p.second);
2511 return __old_size -
size();
2514 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2515 typename _Compare,
typename _Alloc>
2516 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2517 _Compare, _Alloc>::iterator
2518 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2519 find(
const _Key& __k)
2521 iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
2522 return (__j ==
end()
2523 || _M_impl._M_key_compare(__k,
2524 _S_key(__j._M_node))) ?
end() : __j;
2527 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2528 typename _Compare,
typename _Alloc>
2529 typename _Rb_tree<_Key, _Val, _KeyOfValue,
2530 _Compare, _Alloc>::const_iterator
2531 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2532 find(
const _Key& __k)
const 2534 const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
2535 return (__j ==
end()
2536 || _M_impl._M_key_compare(__k,
2537 _S_key(__j._M_node))) ?
end() : __j;
2540 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2541 typename _Compare,
typename _Alloc>
2542 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
2543 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
2544 count(
const _Key& __k)
const 2546 pair<const_iterator, const_iterator> __p = equal_range(__k);
2551 _GLIBCXX_PURE
unsigned int 2552 _Rb_tree_black_count(
const _Rb_tree_node_base* __node,
2553 const _Rb_tree_node_base* __root)
throw ();
2555 template<
typename _Key,
typename _Val,
typename _KeyOfValue,
2556 typename _Compare,
typename _Alloc>
2558 _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify()
const 2560 if (_M_impl._M_node_count == 0 ||
begin() ==
end())
2561 return _M_impl._M_node_count == 0 &&
begin() ==
end()
2562 && this->_M_impl._M_header._M_left == _M_end()
2563 && this->_M_impl._M_header._M_right == _M_end();
2565 unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
2566 for (const_iterator __it =
begin(); __it !=
end(); ++__it)
2568 _Const_Link_type __x =
static_cast<_Const_Link_type
>(__it._M_node);
2569 _Const_Link_type __L = _S_left(__x);
2570 _Const_Link_type __R = _S_right(__x);
2572 if (__x->_M_color == _S_red)
2573 if ((__L && __L->_M_color == _S_red)
2574 || (__R && __R->_M_color == _S_red))
2577 if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
2579 if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
2582 if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)
2586 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
2588 if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
2593 #if __cplusplus > 201402L 2595 template<
typename _Key,
typename _Val,
typename _Sel,
typename _Cmp1,
2596 typename _Alloc,
typename _Cmp2>
2597 struct _Rb_tree_merge_helper<_Rb_tree<_Key, _Val, _Sel, _Cmp1, _Alloc>,
2601 friend class _Rb_tree<_Key, _Val, _Sel, _Cmp1, _Alloc>;
2604 _S_get_impl(_Rb_tree<_Key, _Val, _Sel, _Cmp2, _Alloc>& __tree)
2605 {
return __tree._M_impl; }
2609 _GLIBCXX_END_NAMESPACE_VERSION
_Tp * begin(valarray< _Tp > &__va)
Return an iterator pointing to the first element of the valarray.
integral_constant< bool, false > false_type
The type used as a compile-time boolean with false value.
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
_Tp * end(valarray< _Tp > &__va)
Return an iterator pointing to one past the last element of the valarray.
element_type * operator->() const
Smart pointer dereferencing.
integral_constant< bool, true > true_type
The type used as a compile-time boolean with true value.
constexpr auto rbegin(_Container &__cont) -> decltype(__cont.rbegin())
Return a reverse iterator pointing to the last element of the container.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
static constexpr void deallocate(_Alloc &__a, pointer __p, size_type __n)
Deallocate memory.
static constexpr pointer allocate(_Alloc &__a, size_type __n)
Allocate memory.
constexpr auto empty(const _Container &__cont) noexcept(noexcept(__cont.empty())) -> decltype(__cont.empty())
Return whether a container is empty.
constexpr complex< _Tp > operator*(const complex< _Tp > &__x, const complex< _Tp > &__y)
Return new complex value x times y.
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
ISO C++ entities toplevel namespace is std.
auto_ptr & operator=(auto_ptr &__a)
auto_ptr assignment operator.
Uniform interface to C++98 and C++11 allocators.
constexpr bool lexicographical_compare(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, _Compare __comp)
Performs dictionary comparison on ranges.
constexpr auto rend(_Container &__cont) -> decltype(__cont.rend())
Return a reverse iterator pointing one past the first element of the container.
static constexpr size_type max_size(const _Alloc &__a) noexcept
The maximum supported allocation size.
constexpr bool equal(_IIter1 __first1, _IIter1 __last1, _IIter2 __first2, _IIter2 __last2, _BinaryPredicate __binary_pred)
Tests a range for element-wise equality.