1 // RB tree implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
32 * Copyright (c) 1996,1997
33 * Silicon Graphics Computer Systems, Inc.
35 * Permission to use, copy, modify, distribute and sell this software
36 * and its documentation for any purpose is hereby granted without fee,
37 * provided that the above copyright notice appear in all copies and
38 * that both that copyright notice and this permission notice appear
39 * in supporting documentation. Silicon Graphics makes no
40 * representations about the suitability of this software for any
41 * purpose. It is provided "as is" without express or implied warranty.
45 * Hewlett-Packard Company
47 * Permission to use, copy, modify, distribute and sell this software
48 * and its documentation for any purpose is hereby granted without fee,
49 * provided that the above copyright notice appear in all copies and
50 * that both that copyright notice and this permission notice appear
51 * in supporting documentation. Hewlett-Packard Company makes no
52 * representations about the suitability of this software for any
53 * purpose. It is provided "as is" without express or implied warranty.
59 * This is an internal header file, included by other library headers.
60 * You should not attempt to use it directly.
66 #include <bits/stl_algobase.h>
67 #include <bits/allocator.h>
68 #include <bits/stl_construct.h>
69 #include <bits/stl_function.h>
70 #include <bits/cpp_type_traits.h>
74 // Red-black tree class, designed for use in implementing STL
75 // associative containers (set, multiset, map, and multimap). The
76 // insertion and deletion algorithms are based on those in Cormen,
77 // Leiserson, and Rivest, Introduction to Algorithms (MIT Press,
80 // (1) the header cell is maintained with links not only to the root
81 // but also to the leftmost node of the tree, to enable constant
82 // time begin(), and to the rightmost node of the tree, to enable
83 // linear time performance when used with the generic set algorithms
86 // (2) when a node being deleted has two children its successor node
87 // is relinked into its place, rather than copied, so that the only
88 // iterators invalidated are those referring to the deleted node.
90 enum _Rb_tree_color
{ _S_red
= false, _S_black
= true };
92 struct _Rb_tree_node_base
94 typedef _Rb_tree_node_base
* _Base_ptr
;
95 typedef const _Rb_tree_node_base
* _Const_Base_ptr
;
97 _Rb_tree_color _M_color
;
103 _S_minimum(_Base_ptr __x
)
105 while (__x
->_M_left
!= 0) __x
= __x
->_M_left
;
109 static _Const_Base_ptr
110 _S_minimum(_Const_Base_ptr __x
)
112 while (__x
->_M_left
!= 0) __x
= __x
->_M_left
;
117 _S_maximum(_Base_ptr __x
)
119 while (__x
->_M_right
!= 0) __x
= __x
->_M_right
;
123 static _Const_Base_ptr
124 _S_maximum(_Const_Base_ptr __x
)
126 while (__x
->_M_right
!= 0) __x
= __x
->_M_right
;
131 template<typename _Val
>
132 struct _Rb_tree_node
: public _Rb_tree_node_base
134 typedef _Rb_tree_node
<_Val
>* _Link_type
;
139 _Rb_tree_increment(_Rb_tree_node_base
* __x
);
141 const _Rb_tree_node_base
*
142 _Rb_tree_increment(const _Rb_tree_node_base
* __x
);
145 _Rb_tree_decrement(_Rb_tree_node_base
* __x
);
147 const _Rb_tree_node_base
*
148 _Rb_tree_decrement(const _Rb_tree_node_base
* __x
);
150 template<typename _Tp
>
151 struct _Rb_tree_iterator
153 typedef _Tp value_type
;
154 typedef _Tp
& reference
;
155 typedef _Tp
* pointer
;
157 typedef bidirectional_iterator_tag iterator_category
;
158 typedef ptrdiff_t difference_type
;
160 typedef _Rb_tree_iterator
<_Tp
> _Self
;
161 typedef _Rb_tree_node_base::_Base_ptr _Base_ptr
;
162 typedef _Rb_tree_node
<_Tp
>* _Link_type
;
164 _Rb_tree_iterator() { }
166 _Rb_tree_iterator(_Link_type __x
)
171 { return static_cast<_Link_type
>(_M_node
)->_M_value_field
; }
175 { return &static_cast<_Link_type
>(_M_node
)->_M_value_field
; }
180 _M_node
= _Rb_tree_increment(_M_node
);
188 _M_node
= _Rb_tree_increment(_M_node
);
195 _M_node
= _Rb_tree_decrement(_M_node
);
203 _M_node
= _Rb_tree_decrement(_M_node
);
208 operator==(const _Self
& __x
) const
209 { return _M_node
== __x
._M_node
; }
212 operator!=(const _Self
& __x
) const
213 { return _M_node
!= __x
._M_node
; }
218 template<typename _Tp
>
219 struct _Rb_tree_const_iterator
221 typedef _Tp value_type
;
222 typedef const _Tp
& reference
;
223 typedef const _Tp
* pointer
;
225 typedef _Rb_tree_iterator
<_Tp
> iterator
;
227 typedef bidirectional_iterator_tag iterator_category
;
228 typedef ptrdiff_t difference_type
;
230 typedef _Rb_tree_const_iterator
<_Tp
> _Self
;
231 typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr
;
232 typedef const _Rb_tree_node
<_Tp
>* _Link_type
;
234 _Rb_tree_const_iterator() { }
236 _Rb_tree_const_iterator(_Link_type __x
)
239 _Rb_tree_const_iterator(const iterator
& __it
)
240 : _M_node(__it
._M_node
) { }
244 { return static_cast<_Link_type
>(_M_node
)->_M_value_field
; }
248 { return &static_cast<_Link_type
>(_M_node
)->_M_value_field
; }
253 _M_node
= _Rb_tree_increment(_M_node
);
261 _M_node
= _Rb_tree_increment(_M_node
);
268 _M_node
= _Rb_tree_decrement(_M_node
);
276 _M_node
= _Rb_tree_decrement(_M_node
);
281 operator==(const _Self
& __x
) const
282 { return _M_node
== __x
._M_node
; }
285 operator!=(const _Self
& __x
) const
286 { return _M_node
!= __x
._M_node
; }
291 template<typename _Val
>
293 operator==(const _Rb_tree_iterator
<_Val
>& __x
,
294 const _Rb_tree_const_iterator
<_Val
>& __y
)
295 { return __x
._M_node
== __y
._M_node
; }
297 template<typename _Val
>
299 operator!=(const _Rb_tree_iterator
<_Val
>& __x
,
300 const _Rb_tree_const_iterator
<_Val
>& __y
)
301 { return __x
._M_node
!= __y
._M_node
; }
304 _Rb_tree_rotate_left(_Rb_tree_node_base
* const __x
,
305 _Rb_tree_node_base
*& __root
);
308 _Rb_tree_rotate_right(_Rb_tree_node_base
* const __x
,
309 _Rb_tree_node_base
*& __root
);
312 _Rb_tree_insert_and_rebalance(const bool __insert_left
,
313 _Rb_tree_node_base
* __x
,
314 _Rb_tree_node_base
* __p
,
315 _Rb_tree_node_base
& __header
);
318 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base
* const __z
,
319 _Rb_tree_node_base
& __header
);
322 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
323 typename _Compare
, typename _Alloc
= allocator
<_Val
> >
326 typedef typename
_Alloc::template rebind
<_Rb_tree_node
<_Val
> >::other
330 typedef _Rb_tree_node_base
* _Base_ptr
;
331 typedef const _Rb_tree_node_base
* _Const_Base_ptr
;
332 typedef _Rb_tree_node
<_Val
> _Rb_tree_node
;
335 typedef _Key key_type
;
336 typedef _Val value_type
;
337 typedef value_type
* pointer
;
338 typedef const value_type
* const_pointer
;
339 typedef value_type
& reference
;
340 typedef const value_type
& const_reference
;
341 typedef _Rb_tree_node
* _Link_type
;
342 typedef const _Rb_tree_node
* _Const_Link_type
;
343 typedef size_t size_type
;
344 typedef ptrdiff_t difference_type
;
345 typedef _Alloc allocator_type
;
348 get_allocator() const
349 { return *static_cast<const _Node_allocator
*>(&this->_M_impl
); }
354 { return _M_impl
._Node_allocator::allocate(1); }
357 _M_put_node(_Rb_tree_node
* __p
)
358 { _M_impl
._Node_allocator::deallocate(__p
, 1); }
361 _M_create_node(const value_type
& __x
)
363 _Link_type __tmp
= _M_get_node();
365 { std::_Construct(&__tmp
->_M_value_field
, __x
); }
369 __throw_exception_again
;
375 _M_clone_node(_Const_Link_type __x
)
377 _Link_type __tmp
= _M_create_node(__x
->_M_value_field
);
378 __tmp
->_M_color
= __x
->_M_color
;
385 destroy_node(_Link_type __p
)
387 std::_Destroy(&__p
->_M_value_field
);
392 template<typename _Key_compare
,
393 bool _Is_pod_comparator
= std::__is_pod
<_Key_compare
>::_M_type
>
394 struct _Rb_tree_impl
: public _Node_allocator
396 _Key_compare _M_key_compare
;
397 _Rb_tree_node_base _M_header
;
398 size_type _M_node_count
; // Keeps track of size of tree.
400 _Rb_tree_impl(const _Node_allocator
& __a
= _Node_allocator(),
401 const _Key_compare
& __comp
= _Key_compare())
402 : _Node_allocator(__a
), _M_key_compare(__comp
), _M_node_count(0)
404 this->_M_header
._M_color
= _S_red
;
405 this->_M_header
._M_parent
= 0;
406 this->_M_header
._M_left
= &this->_M_header
;
407 this->_M_header
._M_right
= &this->_M_header
;
411 // Specialization for _Comparison types that are not capable of
412 // being base classes / super classes.
413 template<typename _Key_compare
>
414 struct _Rb_tree_impl
<_Key_compare
, true> : public _Node_allocator
416 _Key_compare _M_key_compare
;
417 _Rb_tree_node_base _M_header
;
418 size_type _M_node_count
; // Keeps track of size of tree.
420 _Rb_tree_impl(const _Node_allocator
& __a
= _Node_allocator(),
421 const _Key_compare
& __comp
= _Key_compare())
422 : _Node_allocator(__a
), _M_key_compare(__comp
), _M_node_count(0)
424 this->_M_header
._M_color
= _S_red
;
425 this->_M_header
._M_parent
= 0;
426 this->_M_header
._M_left
= &this->_M_header
;
427 this->_M_header
._M_right
= &this->_M_header
;
431 _Rb_tree_impl
<_Compare
> _M_impl
;
436 { return this->_M_impl
._M_header
._M_parent
; }
440 { return this->_M_impl
._M_header
._M_parent
; }
444 { return this->_M_impl
._M_header
._M_left
; }
448 { return this->_M_impl
._M_header
._M_left
; }
452 { return this->_M_impl
._M_header
._M_right
; }
456 { return this->_M_impl
._M_header
._M_right
; }
460 { return static_cast<_Link_type
>(this->_M_impl
._M_header
._M_parent
); }
464 { return static_cast<
465 _Const_Link_type
>(this->_M_impl
._M_header
._M_parent
); }
469 { return static_cast<_Link_type
>(&this->_M_impl
._M_header
); }
473 { return static_cast<_Const_Link_type
>(&this->_M_impl
._M_header
); }
475 static const_reference
476 _S_value(_Const_Link_type __x
)
477 { return __x
->_M_value_field
; }
480 _S_key(_Const_Link_type __x
)
481 { return _KeyOfValue()(_S_value(__x
)); }
484 _S_left(_Base_ptr __x
)
485 { return static_cast<_Link_type
>(__x
->_M_left
); }
487 static _Const_Link_type
488 _S_left(_Const_Base_ptr __x
)
489 { return static_cast<_Const_Link_type
>(__x
->_M_left
); }
492 _S_right(_Base_ptr __x
)
493 { return static_cast<_Link_type
>(__x
->_M_right
); }
495 static _Const_Link_type
496 _S_right(_Const_Base_ptr __x
)
497 { return static_cast<_Const_Link_type
>(__x
->_M_right
); }
499 static const_reference
500 _S_value(_Const_Base_ptr __x
)
501 { return static_cast<_Const_Link_type
>(__x
)->_M_value_field
; }
504 _S_key(_Const_Base_ptr __x
)
505 { return _KeyOfValue()(_S_value(__x
)); }
508 _S_minimum(_Base_ptr __x
)
509 { return _Rb_tree_node_base::_S_minimum(__x
); }
511 static _Const_Base_ptr
512 _S_minimum(_Const_Base_ptr __x
)
513 { return _Rb_tree_node_base::_S_minimum(__x
); }
516 _S_maximum(_Base_ptr __x
)
517 { return _Rb_tree_node_base::_S_maximum(__x
); }
519 static _Const_Base_ptr
520 _S_maximum(_Const_Base_ptr __x
)
521 { return _Rb_tree_node_base::_S_maximum(__x
); }
524 typedef _Rb_tree_iterator
<value_type
> iterator
;
525 typedef _Rb_tree_const_iterator
<value_type
> const_iterator
;
527 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
528 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
532 _M_insert(_Base_ptr __x
, _Base_ptr __y
, const value_type
& __v
);
535 _M_copy(_Const_Link_type __x
, _Link_type __p
);
538 _M_erase(_Link_type __x
);
541 // allocation/deallocation
545 _Rb_tree(const _Compare
& __comp
)
546 : _M_impl(allocator_type(), __comp
)
549 _Rb_tree(const _Compare
& __comp
, const allocator_type
& __a
)
550 : _M_impl(__a
, __comp
)
553 _Rb_tree(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
)
554 : _M_impl(__x
.get_allocator(), __x
._M_impl
._M_key_compare
)
556 if (__x
._M_root() != 0)
558 _M_root() = _M_copy(__x
._M_begin(), _M_end());
559 _M_leftmost() = _S_minimum(_M_root());
560 _M_rightmost() = _S_maximum(_M_root());
561 _M_impl
._M_node_count
= __x
._M_impl
._M_node_count
;
566 { _M_erase(_M_begin()); }
568 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>&
569 operator=(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
);
574 { return _M_impl
._M_key_compare
; }
578 { return static_cast<_Link_type
>(this->_M_impl
._M_header
._M_left
); }
582 { return static_cast<_Const_Link_type
>(this->_M_impl
._M_header
._M_left
); }
586 { return static_cast<_Link_type
>(&this->_M_impl
._M_header
); }
590 { return static_cast<_Const_Link_type
>(&this->_M_impl
._M_header
); }
594 { return reverse_iterator(end()); }
596 const_reverse_iterator
598 { return const_reverse_iterator(end()); }
602 { return reverse_iterator(begin()); }
604 const_reverse_iterator
606 { return const_reverse_iterator(begin()); }
610 { return _M_impl
._M_node_count
== 0; }
614 { return _M_impl
._M_node_count
; }
618 { return size_type(-1); }
621 swap(_Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __t
);
625 insert_unique(const value_type
& __x
);
628 insert_equal(const value_type
& __x
);
631 insert_unique(iterator __position
, const value_type
& __x
);
634 insert_equal(iterator __position
, const value_type
& __x
);
636 template<typename _InputIterator
>
638 insert_unique(_InputIterator __first
, _InputIterator __last
);
640 template<typename _InputIterator
>
642 insert_equal(_InputIterator __first
, _InputIterator __last
);
645 erase(iterator __position
);
648 erase(const key_type
& __x
);
651 erase(iterator __first
, iterator __last
);
654 erase(const key_type
* __first
, const key_type
* __last
);
659 _M_erase(_M_begin());
660 _M_leftmost() = _M_end();
662 _M_rightmost() = _M_end();
663 _M_impl
._M_node_count
= 0;
668 find(const key_type
& __x
);
671 find(const key_type
& __x
) const;
674 count(const key_type
& __x
) const;
677 lower_bound(const key_type
& __x
);
680 lower_bound(const key_type
& __x
) const;
683 upper_bound(const key_type
& __x
);
686 upper_bound(const key_type
& __x
) const;
688 pair
<iterator
,iterator
>
689 equal_range(const key_type
& __x
);
691 pair
<const_iterator
, const_iterator
>
692 equal_range(const key_type
& __x
) const;
699 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
700 typename _Compare
, typename _Alloc
>
702 operator==(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
,
703 const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __y
)
705 return __x
.size() == __y
.size()
706 && equal(__x
.begin(), __x
.end(), __y
.begin());
709 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
710 typename _Compare
, typename _Alloc
>
712 operator<(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
,
713 const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __y
)
715 return lexicographical_compare(__x
.begin(), __x
.end(),
716 __y
.begin(), __y
.end());
719 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
720 typename _Compare
, typename _Alloc
>
722 operator!=(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
,
723 const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __y
)
724 { return !(__x
== __y
); }
726 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
727 typename _Compare
, typename _Alloc
>
729 operator>(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
,
730 const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __y
)
731 { return __y
< __x
; }
733 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
734 typename _Compare
, typename _Alloc
>
736 operator<=(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
,
737 const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __y
)
738 { return !(__y
< __x
); }
740 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
741 typename _Compare
, typename _Alloc
>
743 operator>=(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
,
744 const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __y
)
745 { return !(__x
< __y
); }
747 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
748 typename _Compare
, typename _Alloc
>
750 swap(_Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
,
751 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __y
)
754 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
755 typename _Compare
, typename _Alloc
>
756 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>&
757 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
758 operator=(const _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __x
)
762 // Note that _Key may be a constant type.
764 _M_impl
._M_key_compare
= __x
._M_impl
._M_key_compare
;
765 if (__x
._M_root() != 0)
767 _M_root() = _M_copy(__x
._M_begin(), _M_end());
768 _M_leftmost() = _S_minimum(_M_root());
769 _M_rightmost() = _S_maximum(_M_root());
770 _M_impl
._M_node_count
= __x
._M_impl
._M_node_count
;
776 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
777 typename _Compare
, typename _Alloc
>
778 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::iterator
779 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
780 _M_insert(_Base_ptr __x
, _Base_ptr __p
, const _Val
& __v
)
782 _Link_type __z
= _M_create_node(__v
);
785 __insert_left
= __x
!= 0 || __p
== _M_end()
786 || _M_impl
._M_key_compare(_KeyOfValue()(__v
),
789 _Rb_tree_insert_and_rebalance(__insert_left
, __z
, __p
,
790 this->_M_impl
._M_header
);
791 ++_M_impl
._M_node_count
;
792 return iterator(__z
);
795 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
796 typename _Compare
, typename _Alloc
>
797 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::iterator
798 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
799 insert_equal(const _Val
& __v
)
801 _Link_type __x
= _M_begin();
802 _Link_type __y
= _M_end();
806 __x
= _M_impl
._M_key_compare(_KeyOfValue()(__v
), _S_key(__x
)) ?
807 _S_left(__x
) : _S_right(__x
);
809 return _M_insert(__x
, __y
, __v
);
812 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
813 typename _Compare
, typename _Alloc
>
815 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
816 swap(_Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>& __t
)
820 if (__t
._M_root() != 0)
822 _M_root() = __t
._M_root();
823 _M_leftmost() = __t
._M_leftmost();
824 _M_rightmost() = __t
._M_rightmost();
825 _M_root()->_M_parent
= _M_end();
828 __t
._M_leftmost() = __t
._M_end();
829 __t
._M_rightmost() = __t
._M_end();
832 else if (__t
._M_root() == 0)
834 __t
._M_root() = _M_root();
835 __t
._M_leftmost() = _M_leftmost();
836 __t
._M_rightmost() = _M_rightmost();
837 __t
._M_root()->_M_parent
= __t
._M_end();
840 _M_leftmost() = _M_end();
841 _M_rightmost() = _M_end();
845 std::swap(_M_root(),__t
._M_root());
846 std::swap(_M_leftmost(),__t
._M_leftmost());
847 std::swap(_M_rightmost(),__t
._M_rightmost());
849 _M_root()->_M_parent
= _M_end();
850 __t
._M_root()->_M_parent
= __t
._M_end();
852 // No need to swap header's color as it does not change.
853 std::swap(this->_M_impl
._M_node_count
, __t
._M_impl
._M_node_count
);
854 std::swap(this->_M_impl
._M_key_compare
, __t
._M_impl
._M_key_compare
);
857 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
858 typename _Compare
, typename _Alloc
>
859 pair
<typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::iterator
,
861 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
862 insert_unique(const _Val
& __v
)
864 _Link_type __x
= _M_begin();
865 _Link_type __y
= _M_end();
870 __comp
= _M_impl
._M_key_compare(_KeyOfValue()(__v
), _S_key(__x
));
871 __x
= __comp
? _S_left(__x
) : _S_right(__x
);
873 iterator __j
= iterator(__y
);
876 return pair
<iterator
,bool>(_M_insert(__x
, __y
, __v
), true);
879 if (_M_impl
._M_key_compare(_S_key(__j
._M_node
), _KeyOfValue()(__v
)))
880 return pair
<iterator
,bool>(_M_insert(__x
, __y
, __v
), true);
881 return pair
<iterator
,bool>(__j
, false);
884 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
885 typename _Compare
, typename _Alloc
>
886 typename _Rb_tree
<_Key
, _Val
, _KeyOfValue
, _Compare
, _Alloc
>::iterator
887 _Rb_tree
<_Key
, _Val
, _KeyOfValue
, _Compare
, _Alloc
>::
888 insert_unique(iterator __position
, const _Val
& __v
)
890 if (__position
._M_node
== _M_leftmost())
894 && _M_impl
._M_key_compare(_KeyOfValue()(__v
),
895 _S_key(__position
._M_node
)))
896 return _M_insert(__position
._M_node
, __position
._M_node
, __v
);
897 // First argument just needs to be non-null.
899 return insert_unique(__v
).first
;
901 else if (__position
._M_node
== _M_end())
904 if (_M_impl
._M_key_compare(_S_key(_M_rightmost()),
906 return _M_insert(0, _M_rightmost(), __v
);
908 return insert_unique(__v
).first
;
912 iterator __before
= __position
;
914 if (_M_impl
._M_key_compare(_S_key(__before
._M_node
),
916 && _M_impl
._M_key_compare(_KeyOfValue()(__v
),
917 _S_key(__position
._M_node
)))
919 if (_S_right(__before
._M_node
) == 0)
920 return _M_insert(0, __before
._M_node
, __v
);
922 return _M_insert(__position
._M_node
, __position
._M_node
, __v
);
923 // First argument just needs to be non-null.
926 return insert_unique(__v
).first
;
930 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
931 typename _Compare
, typename _Alloc
>
932 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::iterator
933 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
934 insert_equal(iterator __position
, const _Val
& __v
)
936 if (__position
._M_node
== _M_leftmost())
940 && !_M_impl
._M_key_compare(_S_key(__position
._M_node
),
942 return _M_insert(__position
._M_node
, __position
._M_node
, __v
);
943 // first argument just needs to be non-null
945 return insert_equal(__v
);
947 else if (__position
._M_node
== _M_end())
950 if (!_M_impl
._M_key_compare(_KeyOfValue()(__v
),
951 _S_key(_M_rightmost())))
952 return _M_insert(0, _M_rightmost(), __v
);
954 return insert_equal(__v
);
958 iterator __before
= __position
;
960 if (!_M_impl
._M_key_compare(_KeyOfValue()(__v
),
961 _S_key(__before
._M_node
))
962 && !_M_impl
._M_key_compare(_S_key(__position
._M_node
),
965 if (_S_right(__before
._M_node
) == 0)
966 return _M_insert(0, __before
._M_node
, __v
);
968 return _M_insert(__position
._M_node
, __position
._M_node
, __v
);
969 // First argument just needs to be non-null.
972 return insert_equal(__v
);
976 template<typename _Key
, typename _Val
, typename _KoV
,
977 typename _Cmp
, typename _Alloc
>
980 _Rb_tree
<_Key
,_Val
,_KoV
,_Cmp
,_Alloc
>::
981 insert_equal(_II __first
, _II __last
)
983 for ( ; __first
!= __last
; ++__first
)
984 insert_equal(*__first
);
987 template<typename _Key
, typename _Val
, typename _KoV
,
988 typename _Cmp
, typename _Alloc
>
991 _Rb_tree
<_Key
,_Val
,_KoV
,_Cmp
,_Alloc
>::
992 insert_unique(_II __first
, _II __last
)
994 for ( ; __first
!= __last
; ++__first
)
995 insert_unique(*__first
);
998 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
999 typename _Compare
, typename _Alloc
>
1001 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::erase(iterator __position
)
1003 _Link_type __y
= static_cast<
1004 _Link_type
>(_Rb_tree_rebalance_for_erase(__position
._M_node
,
1005 this->_M_impl
._M_header
));
1007 --_M_impl
._M_node_count
;
1010 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1011 typename _Compare
, typename _Alloc
>
1012 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::size_type
1013 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::erase(const _Key
& __x
)
1015 pair
<iterator
,iterator
> __p
= equal_range(__x
);
1016 size_type __n
= std::distance(__p
.first
, __p
.second
);
1017 erase(__p
.first
, __p
.second
);
1021 template<typename _Key
, typename _Val
, typename _KoV
,
1022 typename _Compare
, typename _Alloc
>
1023 typename _Rb_tree
<_Key
, _Val
, _KoV
, _Compare
, _Alloc
>::_Link_type
1024 _Rb_tree
<_Key
,_Val
,_KoV
,_Compare
,_Alloc
>::
1025 _M_copy(_Const_Link_type __x
, _Link_type __p
)
1027 // Structural copy. __x and __p must be non-null.
1028 _Link_type __top
= _M_clone_node(__x
);
1029 __top
->_M_parent
= __p
;
1034 __top
->_M_right
= _M_copy(_S_right(__x
), __top
);
1040 _Link_type __y
= _M_clone_node(__x
);
1042 __y
->_M_parent
= __p
;
1044 __y
->_M_right
= _M_copy(_S_right(__x
), __y
);
1052 __throw_exception_again
;
1057 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1058 typename _Compare
, typename _Alloc
>
1060 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::_M_erase(_Link_type __x
)
1062 // Erase without rebalancing.
1065 _M_erase(_S_right(__x
));
1066 _Link_type __y
= _S_left(__x
);
1072 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1073 typename _Compare
, typename _Alloc
>
1075 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1076 erase(iterator __first
, iterator __last
)
1078 if (__first
== begin() && __last
== end())
1081 while (__first
!= __last
) erase(__first
++);
1084 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1085 typename _Compare
, typename _Alloc
>
1087 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1088 erase(const _Key
* __first
, const _Key
* __last
)
1090 while (__first
!= __last
)
1094 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1095 typename _Compare
, typename _Alloc
>
1096 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::iterator
1097 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::find(const _Key
& __k
)
1099 _Link_type __x
= _M_begin(); // Current node.
1100 _Link_type __y
= _M_end(); // Last node which is not less than __k.
1103 if (!_M_impl
._M_key_compare(_S_key(__x
), __k
))
1104 __y
= __x
, __x
= _S_left(__x
);
1106 __x
= _S_right(__x
);
1108 iterator __j
= iterator(__y
);
1109 return (__j
== end()
1110 || _M_impl
._M_key_compare(__k
, _S_key(__j
._M_node
))) ? end() : __j
;
1113 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1114 typename _Compare
, typename _Alloc
>
1115 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::const_iterator
1116 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1117 find(const _Key
& __k
) const
1119 _Const_Link_type __x
= _M_begin(); // Current node.
1120 _Const_Link_type __y
= _M_end(); // Last node which is not less than __k.
1124 if (!_M_impl
._M_key_compare(_S_key(__x
), __k
))
1125 __y
= __x
, __x
= _S_left(__x
);
1127 __x
= _S_right(__x
);
1129 const_iterator __j
= const_iterator(__y
);
1130 return (__j
== end()
1131 || _M_impl
._M_key_compare(__k
, _S_key(__j
._M_node
))) ? end() : __j
;
1134 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1135 typename _Compare
, typename _Alloc
>
1136 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::size_type
1137 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1138 count(const _Key
& __k
) const
1140 pair
<const_iterator
, const_iterator
> __p
= equal_range(__k
);
1141 const size_type __n
= std::distance(__p
.first
, __p
.second
);
1145 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1146 typename _Compare
, typename _Alloc
>
1147 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::iterator
1148 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1149 lower_bound(const _Key
& __k
)
1151 _Link_type __x
= _M_begin(); // Current node.
1152 _Link_type __y
= _M_end(); // Last node which is not less than __k.
1155 if (!_M_impl
._M_key_compare(_S_key(__x
), __k
))
1156 __y
= __x
, __x
= _S_left(__x
);
1158 __x
= _S_right(__x
);
1160 return iterator(__y
);
1163 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1164 typename _Compare
, typename _Alloc
>
1165 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::const_iterator
1166 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1167 lower_bound(const _Key
& __k
) const
1169 _Const_Link_type __x
= _M_begin(); // Current node.
1170 _Const_Link_type __y
= _M_end(); // Last node which is not less than __k.
1173 if (!_M_impl
._M_key_compare(_S_key(__x
), __k
))
1174 __y
= __x
, __x
= _S_left(__x
);
1176 __x
= _S_right(__x
);
1178 return const_iterator(__y
);
1181 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1182 typename _Compare
, typename _Alloc
>
1183 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::iterator
1184 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1185 upper_bound(const _Key
& __k
)
1187 _Link_type __x
= _M_begin(); // Current node.
1188 _Link_type __y
= _M_end(); // Last node which is greater than __k.
1191 if (_M_impl
._M_key_compare(__k
, _S_key(__x
)))
1192 __y
= __x
, __x
= _S_left(__x
);
1194 __x
= _S_right(__x
);
1196 return iterator(__y
);
1199 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1200 typename _Compare
, typename _Alloc
>
1201 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::const_iterator
1202 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1203 upper_bound(const _Key
& __k
) const
1205 _Const_Link_type __x
= _M_begin(); // Current node.
1206 _Const_Link_type __y
= _M_end(); // Last node which is greater than __k.
1209 if (_M_impl
._M_key_compare(__k
, _S_key(__x
)))
1210 __y
= __x
, __x
= _S_left(__x
);
1212 __x
= _S_right(__x
);
1214 return const_iterator(__y
);
1217 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1218 typename _Compare
, typename _Alloc
>
1220 pair
<typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,
1221 _Compare
,_Alloc
>::iterator
,
1222 typename _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::iterator
>
1223 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::
1224 equal_range(const _Key
& __k
)
1225 { return pair
<iterator
, iterator
>(lower_bound(__k
), upper_bound(__k
)); }
1227 template<typename _Key
, typename _Val
, typename _KoV
,
1228 typename _Compare
, typename _Alloc
>
1230 pair
<typename _Rb_tree
<_Key
, _Val
, _KoV
,
1231 _Compare
, _Alloc
>::const_iterator
,
1232 typename _Rb_tree
<_Key
, _Val
, _KoV
, _Compare
, _Alloc
>::const_iterator
>
1233 _Rb_tree
<_Key
, _Val
, _KoV
, _Compare
, _Alloc
>::
1234 equal_range(const _Key
& __k
) const
1235 { return pair
<const_iterator
, const_iterator
>(lower_bound(__k
),
1236 upper_bound(__k
)); }
1239 _Rb_tree_black_count(const _Rb_tree_node_base
* __node
,
1240 const _Rb_tree_node_base
* __root
);
1242 template<typename _Key
, typename _Val
, typename _KeyOfValue
,
1243 typename _Compare
, typename _Alloc
>
1245 _Rb_tree
<_Key
,_Val
,_KeyOfValue
,_Compare
,_Alloc
>::__rb_verify() const
1247 if (_M_impl
._M_node_count
== 0 || begin() == end())
1248 return _M_impl
._M_node_count
== 0 && begin() == end()
1249 && this->_M_impl
._M_header
._M_left
== _M_end()
1250 && this->_M_impl
._M_header
._M_right
== _M_end();
1252 unsigned int __len
= _Rb_tree_black_count(_M_leftmost(), _M_root());
1253 for (const_iterator __it
= begin(); __it
!= end(); ++__it
)
1255 _Const_Link_type __x
= static_cast<_Const_Link_type
>(__it
._M_node
);
1256 _Const_Link_type __L
= _S_left(__x
);
1257 _Const_Link_type __R
= _S_right(__x
);
1259 if (__x
->_M_color
== _S_red
)
1260 if ((__L
&& __L
->_M_color
== _S_red
)
1261 || (__R
&& __R
->_M_color
== _S_red
))
1264 if (__L
&& _M_impl
._M_key_compare(_S_key(__x
), _S_key(__L
)))
1266 if (__R
&& _M_impl
._M_key_compare(_S_key(__R
), _S_key(__x
)))
1269 if (!__L
&& !__R
&& _Rb_tree_black_count(__x
, _M_root()) != __len
)
1273 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
1275 if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))