1 // RB tree implementation -*- C++ -*-
3 // Copyright (C) 2001, 2002, 2003, 2004, 2005 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, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
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;
168 _Rb_tree_iterator(_Link_type __x)
173 { return static_cast<_Link_type>(_M_node)->_M_value_field; }
177 { return &static_cast<_Link_type>(_M_node)->_M_value_field; }
182 _M_node = _Rb_tree_increment(_M_node);
190 _M_node = _Rb_tree_increment(_M_node);
197 _M_node = _Rb_tree_decrement(_M_node);
205 _M_node = _Rb_tree_decrement(_M_node);
210 operator==(const _Self& __x) const
211 { return _M_node == __x._M_node; }
214 operator!=(const _Self& __x) const
215 { return _M_node != __x._M_node; }
220 template<typename _Tp>
221 struct _Rb_tree_const_iterator
223 typedef _Tp value_type;
224 typedef const _Tp& reference;
225 typedef const _Tp* pointer;
227 typedef _Rb_tree_iterator<_Tp> iterator;
229 typedef bidirectional_iterator_tag iterator_category;
230 typedef ptrdiff_t difference_type;
232 typedef _Rb_tree_const_iterator<_Tp> _Self;
233 typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
234 typedef const _Rb_tree_node<_Tp>* _Link_type;
236 _Rb_tree_const_iterator()
240 _Rb_tree_const_iterator(_Link_type __x)
243 _Rb_tree_const_iterator(const iterator& __it)
244 : _M_node(__it._M_node) { }
248 { return static_cast<_Link_type>(_M_node)->_M_value_field; }
252 { return &static_cast<_Link_type>(_M_node)->_M_value_field; }
257 _M_node = _Rb_tree_increment(_M_node);
265 _M_node = _Rb_tree_increment(_M_node);
272 _M_node = _Rb_tree_decrement(_M_node);
280 _M_node = _Rb_tree_decrement(_M_node);
285 operator==(const _Self& __x) const
286 { return _M_node == __x._M_node; }
289 operator!=(const _Self& __x) const
290 { return _M_node != __x._M_node; }
295 template<typename _Val>
297 operator==(const _Rb_tree_iterator<_Val>& __x,
298 const _Rb_tree_const_iterator<_Val>& __y)
299 { return __x._M_node == __y._M_node; }
301 template<typename _Val>
303 operator!=(const _Rb_tree_iterator<_Val>& __x,
304 const _Rb_tree_const_iterator<_Val>& __y)
305 { return __x._M_node != __y._M_node; }
308 _Rb_tree_rotate_left(_Rb_tree_node_base* const __x,
309 _Rb_tree_node_base*& __root);
312 _Rb_tree_rotate_right(_Rb_tree_node_base* const __x,
313 _Rb_tree_node_base*& __root);
316 _Rb_tree_insert_and_rebalance(const bool __insert_left,
317 _Rb_tree_node_base* __x,
318 _Rb_tree_node_base* __p,
319 _Rb_tree_node_base& __header);
322 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
323 _Rb_tree_node_base& __header);
326 template<typename _Key, typename _Val, typename _KeyOfValue,
327 typename _Compare, typename _Alloc = allocator<_Val> >
330 typedef typename _Alloc::template rebind<_Rb_tree_node<_Val> >::other
334 typedef _Rb_tree_node_base* _Base_ptr;
335 typedef const _Rb_tree_node_base* _Const_Base_ptr;
336 typedef _Rb_tree_node<_Val> _Rb_tree_node;
339 typedef _Key key_type;
340 typedef _Val value_type;
341 typedef value_type* pointer;
342 typedef const value_type* const_pointer;
343 typedef value_type& reference;
344 typedef const value_type& const_reference;
345 typedef _Rb_tree_node* _Link_type;
346 typedef const _Rb_tree_node* _Const_Link_type;
347 typedef size_t size_type;
348 typedef ptrdiff_t difference_type;
349 typedef _Alloc allocator_type;
352 get_allocator() const
353 { return *static_cast<const _Node_allocator*>(&this->_M_impl); }
358 { return _M_impl._Node_allocator::allocate(1); }
361 _M_put_node(_Rb_tree_node* __p)
362 { _M_impl._Node_allocator::deallocate(__p, 1); }
365 _M_create_node(const value_type& __x)
367 _Link_type __tmp = _M_get_node();
369 { get_allocator().construct(&__tmp->_M_value_field, __x); }
373 __throw_exception_again;
379 _M_clone_node(_Const_Link_type __x)
381 _Link_type __tmp = _M_create_node(__x->_M_value_field);
382 __tmp->_M_color = __x->_M_color;
389 destroy_node(_Link_type __p)
391 get_allocator().destroy(&__p->_M_value_field);
396 template<typename _Key_compare,
397 bool _Is_pod_comparator = std::__is_pod<_Key_compare>::__value>
398 struct _Rb_tree_impl : public _Node_allocator
400 _Key_compare _M_key_compare;
401 _Rb_tree_node_base _M_header;
402 size_type _M_node_count; // Keeps track of size of tree.
404 _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(),
405 const _Key_compare& __comp = _Key_compare())
406 : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
409 this->_M_header._M_color = _S_red;
410 this->_M_header._M_parent = 0;
411 this->_M_header._M_left = &this->_M_header;
412 this->_M_header._M_right = &this->_M_header;
416 // Specialization for _Comparison types that are not capable of
417 // being base classes / super classes.
418 template<typename _Key_compare>
419 struct _Rb_tree_impl<_Key_compare, true> : public _Node_allocator
421 _Key_compare _M_key_compare;
422 _Rb_tree_node_base _M_header;
423 size_type _M_node_count; // Keeps track of size of tree.
425 _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(),
426 const _Key_compare& __comp = _Key_compare())
427 : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
430 this->_M_header._M_color = _S_red;
431 this->_M_header._M_parent = 0;
432 this->_M_header._M_left = &this->_M_header;
433 this->_M_header._M_right = &this->_M_header;
437 _Rb_tree_impl<_Compare> _M_impl;
442 { return this->_M_impl._M_header._M_parent; }
446 { return this->_M_impl._M_header._M_parent; }
450 { return this->_M_impl._M_header._M_left; }
454 { return this->_M_impl._M_header._M_left; }
458 { return this->_M_impl._M_header._M_right; }
462 { return this->_M_impl._M_header._M_right; }
466 { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
471 return static_cast<_Const_Link_type>
472 (this->_M_impl._M_header._M_parent);
477 { return static_cast<_Link_type>(&this->_M_impl._M_header); }
481 { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); }
483 static const_reference
484 _S_value(_Const_Link_type __x)
485 { return __x->_M_value_field; }
488 _S_key(_Const_Link_type __x)
489 { return _KeyOfValue()(_S_value(__x)); }
492 _S_left(_Base_ptr __x)
493 { return static_cast<_Link_type>(__x->_M_left); }
495 static _Const_Link_type
496 _S_left(_Const_Base_ptr __x)
497 { return static_cast<_Const_Link_type>(__x->_M_left); }
500 _S_right(_Base_ptr __x)
501 { return static_cast<_Link_type>(__x->_M_right); }
503 static _Const_Link_type
504 _S_right(_Const_Base_ptr __x)
505 { return static_cast<_Const_Link_type>(__x->_M_right); }
507 static const_reference
508 _S_value(_Const_Base_ptr __x)
509 { return static_cast<_Const_Link_type>(__x)->_M_value_field; }
512 _S_key(_Const_Base_ptr __x)
513 { return _KeyOfValue()(_S_value(__x)); }
516 _S_minimum(_Base_ptr __x)
517 { return _Rb_tree_node_base::_S_minimum(__x); }
519 static _Const_Base_ptr
520 _S_minimum(_Const_Base_ptr __x)
521 { return _Rb_tree_node_base::_S_minimum(__x); }
524 _S_maximum(_Base_ptr __x)
525 { return _Rb_tree_node_base::_S_maximum(__x); }
527 static _Const_Base_ptr
528 _S_maximum(_Const_Base_ptr __x)
529 { return _Rb_tree_node_base::_S_maximum(__x); }
532 typedef _Rb_tree_iterator<value_type> iterator;
533 typedef _Rb_tree_const_iterator<value_type> const_iterator;
535 typedef std::reverse_iterator<iterator> reverse_iterator;
536 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
540 _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
543 _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __y,
544 const value_type& __v);
547 _M_copy(_Const_Link_type __x, _Link_type __p);
550 _M_erase(_Link_type __x);
553 // allocation/deallocation
557 _Rb_tree(const _Compare& __comp)
558 : _M_impl(allocator_type(), __comp)
561 _Rb_tree(const _Compare& __comp, const allocator_type& __a)
562 : _M_impl(__a, __comp)
565 _Rb_tree(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)
566 : _M_impl(__x.get_allocator(), __x._M_impl._M_key_compare)
568 if (__x._M_root() != 0)
570 _M_root() = _M_copy(__x._M_begin(), _M_end());
571 _M_leftmost() = _S_minimum(_M_root());
572 _M_rightmost() = _S_maximum(_M_root());
573 _M_impl._M_node_count = __x._M_impl._M_node_count;
578 { _M_erase(_M_begin()); }
580 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
581 operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x);
586 { return _M_impl._M_key_compare; }
591 return iterator(static_cast<_Link_type>
592 (this->_M_impl._M_header._M_left));
598 return const_iterator(static_cast<_Const_Link_type>
599 (this->_M_impl._M_header._M_left));
604 { return iterator(static_cast<_Link_type>(&this->_M_impl._M_header)); }
609 return const_iterator(static_cast<_Const_Link_type>
610 (&this->_M_impl._M_header));
615 { return reverse_iterator(end()); }
617 const_reverse_iterator
619 { return const_reverse_iterator(end()); }
623 { return reverse_iterator(begin()); }
625 const_reverse_iterator
627 { return const_reverse_iterator(begin()); }
631 { return _M_impl._M_node_count == 0; }
635 { return _M_impl._M_node_count; }
639 { return size_type(-1); }
642 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t);
646 insert_unique(const value_type& __x);
649 insert_equal(const value_type& __x);
652 insert_unique(iterator __position, const value_type& __x);
655 insert_unique(const_iterator __position, const value_type& __x);
658 insert_equal(iterator __position, const value_type& __x);
661 insert_equal(const_iterator __position, const value_type& __x);
663 template<typename _InputIterator>
665 insert_unique(_InputIterator __first, _InputIterator __last);
667 template<typename _InputIterator>
669 insert_equal(_InputIterator __first, _InputIterator __last);
672 erase(iterator __position);
675 erase(const_iterator __position);
678 erase(const key_type& __x);
681 erase(iterator __first, iterator __last);
684 erase(const_iterator __first, const_iterator __last);
687 erase(const key_type* __first, const key_type* __last);
692 _M_erase(_M_begin());
693 _M_leftmost() = _M_end();
695 _M_rightmost() = _M_end();
696 _M_impl._M_node_count = 0;
701 find(const key_type& __x);
704 find(const key_type& __x) const;
707 count(const key_type& __x) const;
710 lower_bound(const key_type& __x);
713 lower_bound(const key_type& __x) const;
716 upper_bound(const key_type& __x);
719 upper_bound(const key_type& __x) const;
721 pair<iterator,iterator>
722 equal_range(const key_type& __x);
724 pair<const_iterator, const_iterator>
725 equal_range(const key_type& __x) const;
732 template<typename _Key, typename _Val, typename _KeyOfValue,
733 typename _Compare, typename _Alloc>
735 operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
736 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
738 return __x.size() == __y.size()
739 && std::equal(__x.begin(), __x.end(), __y.begin());
742 template<typename _Key, typename _Val, typename _KeyOfValue,
743 typename _Compare, typename _Alloc>
745 operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
746 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
748 return std::lexicographical_compare(__x.begin(), __x.end(),
749 __y.begin(), __y.end());
752 template<typename _Key, typename _Val, typename _KeyOfValue,
753 typename _Compare, typename _Alloc>
755 operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
756 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
757 { return !(__x == __y); }
759 template<typename _Key, typename _Val, typename _KeyOfValue,
760 typename _Compare, typename _Alloc>
762 operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
763 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
764 { return __y < __x; }
766 template<typename _Key, typename _Val, typename _KeyOfValue,
767 typename _Compare, typename _Alloc>
769 operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
770 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
771 { return !(__y < __x); }
773 template<typename _Key, typename _Val, typename _KeyOfValue,
774 typename _Compare, typename _Alloc>
776 operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
777 const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
778 { return !(__x < __y); }
780 template<typename _Key, typename _Val, typename _KeyOfValue,
781 typename _Compare, typename _Alloc>
783 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
784 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
787 template<typename _Key, typename _Val, typename _KeyOfValue,
788 typename _Compare, typename _Alloc>
789 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
790 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
791 operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)
795 // Note that _Key may be a constant type.
797 _M_impl._M_key_compare = __x._M_impl._M_key_compare;
798 if (__x._M_root() != 0)
800 _M_root() = _M_copy(__x._M_begin(), _M_end());
801 _M_leftmost() = _S_minimum(_M_root());
802 _M_rightmost() = _S_maximum(_M_root());
803 _M_impl._M_node_count = __x._M_impl._M_node_count;
809 template<typename _Key, typename _Val, typename _KeyOfValue,
810 typename _Compare, typename _Alloc>
811 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
812 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
813 _M_insert(_Base_ptr __x, _Base_ptr __p, const _Val& __v)
815 bool __insert_left = (__x != 0 || __p == _M_end()
816 || _M_impl._M_key_compare(_KeyOfValue()(__v),
819 _Link_type __z = _M_create_node(__v);
821 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
822 this->_M_impl._M_header);
823 ++_M_impl._M_node_count;
824 return iterator(__z);
827 template<typename _Key, typename _Val, typename _KeyOfValue,
828 typename _Compare, typename _Alloc>
829 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
830 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
831 _M_insert(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v)
833 bool __insert_left = (__x != 0 || __p == _M_end()
834 || _M_impl._M_key_compare(_KeyOfValue()(__v),
837 _Link_type __z = _M_create_node(__v);
839 _Rb_tree_insert_and_rebalance(__insert_left, __z,
840 const_cast<_Base_ptr>(__p),
841 this->_M_impl._M_header);
842 ++_M_impl._M_node_count;
843 return const_iterator(__z);
846 template<typename _Key, typename _Val, typename _KeyOfValue,
847 typename _Compare, typename _Alloc>
848 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
849 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
850 insert_equal(const _Val& __v)
852 _Link_type __x = _M_begin();
853 _Link_type __y = _M_end();
857 __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ?
858 _S_left(__x) : _S_right(__x);
860 return _M_insert(__x, __y, __v);
863 template<typename _Key, typename _Val, typename _KeyOfValue,
864 typename _Compare, typename _Alloc>
866 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
867 swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)
871 if (__t._M_root() != 0)
873 _M_root() = __t._M_root();
874 _M_leftmost() = __t._M_leftmost();
875 _M_rightmost() = __t._M_rightmost();
876 _M_root()->_M_parent = _M_end();
879 __t._M_leftmost() = __t._M_end();
880 __t._M_rightmost() = __t._M_end();
883 else if (__t._M_root() == 0)
885 __t._M_root() = _M_root();
886 __t._M_leftmost() = _M_leftmost();
887 __t._M_rightmost() = _M_rightmost();
888 __t._M_root()->_M_parent = __t._M_end();
891 _M_leftmost() = _M_end();
892 _M_rightmost() = _M_end();
896 std::swap(_M_root(),__t._M_root());
897 std::swap(_M_leftmost(),__t._M_leftmost());
898 std::swap(_M_rightmost(),__t._M_rightmost());
900 _M_root()->_M_parent = _M_end();
901 __t._M_root()->_M_parent = __t._M_end();
903 // No need to swap header's color as it does not change.
904 std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
905 std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);
908 template<typename _Key, typename _Val, typename _KeyOfValue,
909 typename _Compare, typename _Alloc>
910 pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
911 _Compare, _Alloc>::iterator, bool>
912 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
913 insert_unique(const _Val& __v)
915 _Link_type __x = _M_begin();
916 _Link_type __y = _M_end();
921 __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x));
922 __x = __comp ? _S_left(__x) : _S_right(__x);
924 iterator __j = iterator(__y);
927 return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
930 if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
931 return pair<iterator, bool>(_M_insert(__x, __y, __v), true);
932 return pair<iterator, bool>(__j, false);
935 template<typename _Key, typename _Val, typename _KeyOfValue,
936 typename _Compare, typename _Alloc>
937 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
938 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
939 insert_unique(iterator __position, const _Val& __v)
942 if (__position._M_node == _M_end())
945 && _M_impl._M_key_compare(_S_key(_M_rightmost()),
947 return _M_insert(0, _M_rightmost(), __v);
949 return insert_unique(__v).first;
951 else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
952 _S_key(__position._M_node)))
954 // First, try before...
955 iterator __before = __position;
956 if (__position._M_node == _M_leftmost()) // begin()
957 return _M_insert(_M_leftmost(), _M_leftmost(), __v);
958 else if (_M_impl._M_key_compare(_S_key((--__before)._M_node),
961 if (_S_right(__before._M_node) == 0)
962 return _M_insert(0, __before._M_node, __v);
964 return _M_insert(__position._M_node,
965 __position._M_node, __v);
968 return insert_unique(__v).first;
970 else if (_M_impl._M_key_compare(_S_key(__position._M_node),
973 // ... then try after.
974 iterator __after = __position;
975 if (__position._M_node == _M_rightmost())
976 return _M_insert(0, _M_rightmost(), __v);
977 else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
978 _S_key((++__after)._M_node)))
980 if (_S_right(__position._M_node) == 0)
981 return _M_insert(0, __position._M_node, __v);
983 return _M_insert(__after._M_node, __after._M_node, __v);
986 return insert_unique(__v).first;
989 return __position; // Equivalent keys.
992 template<typename _Key, typename _Val, typename _KeyOfValue,
993 typename _Compare, typename _Alloc>
994 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
995 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
996 insert_unique(const_iterator __position, const _Val& __v)
999 if (__position._M_node == _M_end())
1002 && _M_impl._M_key_compare(_S_key(_M_rightmost()),
1003 _KeyOfValue()(__v)))
1004 return _M_insert(0, _M_rightmost(), __v);
1006 return const_iterator(insert_unique(__v).first);
1008 else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
1009 _S_key(__position._M_node)))
1011 // First, try before...
1012 const_iterator __before = __position;
1013 if (__position._M_node == _M_leftmost()) // begin()
1014 return _M_insert(_M_leftmost(), _M_leftmost(), __v);
1015 else if (_M_impl._M_key_compare(_S_key((--__before)._M_node),
1016 _KeyOfValue()(__v)))
1018 if (_S_right(__before._M_node) == 0)
1019 return _M_insert(0, __before._M_node, __v);
1021 return _M_insert(__position._M_node,
1022 __position._M_node, __v);
1025 return const_iterator(insert_unique(__v).first);
1027 else if (_M_impl._M_key_compare(_S_key(__position._M_node),
1028 _KeyOfValue()(__v)))
1030 // ... then try after.
1031 const_iterator __after = __position;
1032 if (__position._M_node == _M_rightmost())
1033 return _M_insert(0, _M_rightmost(), __v);
1034 else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
1035 _S_key((++__after)._M_node)))
1037 if (_S_right(__position._M_node) == 0)
1038 return _M_insert(0, __position._M_node, __v);
1040 return _M_insert(__after._M_node, __after._M_node, __v);
1043 return const_iterator(insert_unique(__v).first);
1046 return __position; // Equivalent keys.
1049 template<typename _Key, typename _Val, typename _KeyOfValue,
1050 typename _Compare, typename _Alloc>
1051 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1052 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1053 insert_equal(iterator __position, const _Val& __v)
1056 if (__position._M_node == _M_end())
1059 && !_M_impl._M_key_compare(_KeyOfValue()(__v),
1060 _S_key(_M_rightmost())))
1061 return _M_insert(0, _M_rightmost(), __v);
1063 return insert_equal(__v);
1065 else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
1066 _KeyOfValue()(__v)))
1068 // First, try before...
1069 iterator __before = __position;
1070 if (__position._M_node == _M_leftmost()) // begin()
1071 return _M_insert(_M_leftmost(), _M_leftmost(), __v);
1072 else if (!_M_impl._M_key_compare(_KeyOfValue()(__v),
1073 _S_key((--__before)._M_node)))
1075 if (_S_right(__before._M_node) == 0)
1076 return _M_insert(0, __before._M_node, __v);
1078 return _M_insert(__position._M_node,
1079 __position._M_node, __v);
1082 return insert_equal(__v);
1086 // ... then try after.
1087 iterator __after = __position;
1088 if (__position._M_node == _M_rightmost())
1089 return _M_insert(0, _M_rightmost(), __v);
1090 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1091 _KeyOfValue()(__v)))
1093 if (_S_right(__position._M_node) == 0)
1094 return _M_insert(0, __position._M_node, __v);
1096 return _M_insert(__after._M_node, __after._M_node, __v);
1099 return insert_equal(__v);
1103 template<typename _Key, typename _Val, typename _KeyOfValue,
1104 typename _Compare, typename _Alloc>
1105 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
1106 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1107 insert_equal(const_iterator __position, const _Val& __v)
1110 if (__position._M_node == _M_end())
1113 && !_M_impl._M_key_compare(_KeyOfValue()(__v),
1114 _S_key(_M_rightmost())))
1115 return _M_insert(0, _M_rightmost(), __v);
1117 return const_iterator(insert_equal(__v));
1119 else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
1120 _KeyOfValue()(__v)))
1122 // First, try before...
1123 const_iterator __before = __position;
1124 if (__position._M_node == _M_leftmost()) // begin()
1125 return _M_insert(_M_leftmost(), _M_leftmost(), __v);
1126 else if (!_M_impl._M_key_compare(_KeyOfValue()(__v),
1127 _S_key((--__before)._M_node)))
1129 if (_S_right(__before._M_node) == 0)
1130 return _M_insert(0, __before._M_node, __v);
1132 return _M_insert(__position._M_node,
1133 __position._M_node, __v);
1136 return const_iterator(insert_equal(__v));
1140 // ... then try after.
1141 const_iterator __after = __position;
1142 if (__position._M_node == _M_rightmost())
1143 return _M_insert(0, _M_rightmost(), __v);
1144 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1145 _KeyOfValue()(__v)))
1147 if (_S_right(__position._M_node) == 0)
1148 return _M_insert(0, __position._M_node, __v);
1150 return _M_insert(__after._M_node, __after._M_node, __v);
1153 return const_iterator(insert_equal(__v));
1157 template<typename _Key, typename _Val, typename _KoV,
1158 typename _Cmp, typename _Alloc>
1161 _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
1162 insert_equal(_II __first, _II __last)
1164 for (; __first != __last; ++__first)
1165 insert_equal(end(), *__first);
1168 template<typename _Key, typename _Val, typename _KoV,
1169 typename _Cmp, typename _Alloc>
1172 _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
1173 insert_unique(_II __first, _II __last)
1175 for (; __first != __last; ++__first)
1176 insert_unique(end(), *__first);
1179 template<typename _Key, typename _Val, typename _KeyOfValue,
1180 typename _Compare, typename _Alloc>
1182 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1183 erase(iterator __position)
1186 static_cast<_Link_type>(_Rb_tree_rebalance_for_erase
1187 (__position._M_node,
1188 this->_M_impl._M_header));
1190 --_M_impl._M_node_count;
1193 template<typename _Key, typename _Val, typename _KeyOfValue,
1194 typename _Compare, typename _Alloc>
1196 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1197 erase(const_iterator __position)
1200 static_cast<_Link_type>(_Rb_tree_rebalance_for_erase
1201 (const_cast<_Base_ptr>(__position._M_node),
1202 this->_M_impl._M_header));
1204 --_M_impl._M_node_count;
1207 template<typename _Key, typename _Val, typename _KeyOfValue,
1208 typename _Compare, typename _Alloc>
1209 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
1210 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1211 erase(const _Key& __x)
1213 pair<iterator,iterator> __p = equal_range(__x);
1214 size_type __n = std::distance(__p.first, __p.second);
1215 erase(__p.first, __p.second);
1219 template<typename _Key, typename _Val, typename _KoV,
1220 typename _Compare, typename _Alloc>
1221 typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
1222 _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
1223 _M_copy(_Const_Link_type __x, _Link_type __p)
1225 // Structural copy. __x and __p must be non-null.
1226 _Link_type __top = _M_clone_node(__x);
1227 __top->_M_parent = __p;
1232 __top->_M_right = _M_copy(_S_right(__x), __top);
1238 _Link_type __y = _M_clone_node(__x);
1240 __y->_M_parent = __p;
1242 __y->_M_right = _M_copy(_S_right(__x), __y);
1250 __throw_exception_again;
1255 template<typename _Key, typename _Val, typename _KeyOfValue,
1256 typename _Compare, typename _Alloc>
1258 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1259 _M_erase(_Link_type __x)
1261 // Erase without rebalancing.
1264 _M_erase(_S_right(__x));
1265 _Link_type __y = _S_left(__x);
1271 template<typename _Key, typename _Val, typename _KeyOfValue,
1272 typename _Compare, typename _Alloc>
1274 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1275 erase(iterator __first, iterator __last)
1277 if (__first == begin() && __last == end())
1280 while (__first != __last)
1284 template<typename _Key, typename _Val, typename _KeyOfValue,
1285 typename _Compare, typename _Alloc>
1287 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1288 erase(const_iterator __first, const_iterator __last)
1290 if (__first == begin() && __last == end())
1293 while (__first != __last)
1297 template<typename _Key, typename _Val, typename _KeyOfValue,
1298 typename _Compare, typename _Alloc>
1300 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1301 erase(const _Key* __first, const _Key* __last)
1303 while (__first != __last)
1307 template<typename _Key, typename _Val, typename _KeyOfValue,
1308 typename _Compare, typename _Alloc>
1309 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1310 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1311 find(const _Key& __k)
1313 _Link_type __x = _M_begin(); // Current node.
1314 _Link_type __y = _M_end(); // Last node which is not less than __k.
1317 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1318 __y = __x, __x = _S_left(__x);
1320 __x = _S_right(__x);
1322 iterator __j = iterator(__y);
1323 return (__j == end()
1324 || _M_impl._M_key_compare(__k,
1325 _S_key(__j._M_node))) ? end() : __j;
1328 template<typename _Key, typename _Val, typename _KeyOfValue,
1329 typename _Compare, typename _Alloc>
1330 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
1331 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1332 find(const _Key& __k) const
1334 _Const_Link_type __x = _M_begin(); // Current node.
1335 _Const_Link_type __y = _M_end(); // Last node which is not less than __k.
1339 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1340 __y = __x, __x = _S_left(__x);
1342 __x = _S_right(__x);
1344 const_iterator __j = const_iterator(__y);
1345 return (__j == end()
1346 || _M_impl._M_key_compare(__k,
1347 _S_key(__j._M_node))) ? end() : __j;
1350 template<typename _Key, typename _Val, typename _KeyOfValue,
1351 typename _Compare, typename _Alloc>
1352 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
1353 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1354 count(const _Key& __k) const
1356 pair<const_iterator, const_iterator> __p = equal_range(__k);
1357 const size_type __n = std::distance(__p.first, __p.second);
1361 template<typename _Key, typename _Val, typename _KeyOfValue,
1362 typename _Compare, typename _Alloc>
1363 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1364 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1365 lower_bound(const _Key& __k)
1367 _Link_type __x = _M_begin(); // Current node.
1368 _Link_type __y = _M_end(); // Last node which is not less than __k.
1371 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1372 __y = __x, __x = _S_left(__x);
1374 __x = _S_right(__x);
1376 return iterator(__y);
1379 template<typename _Key, typename _Val, typename _KeyOfValue,
1380 typename _Compare, typename _Alloc>
1381 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
1382 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1383 lower_bound(const _Key& __k) const
1385 _Const_Link_type __x = _M_begin(); // Current node.
1386 _Const_Link_type __y = _M_end(); // Last node which is not less than __k.
1389 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1390 __y = __x, __x = _S_left(__x);
1392 __x = _S_right(__x);
1394 return const_iterator(__y);
1397 template<typename _Key, typename _Val, typename _KeyOfValue,
1398 typename _Compare, typename _Alloc>
1399 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
1400 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1401 upper_bound(const _Key& __k)
1403 _Link_type __x = _M_begin(); // Current node.
1404 _Link_type __y = _M_end(); // Last node which is greater than __k.
1407 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1408 __y = __x, __x = _S_left(__x);
1410 __x = _S_right(__x);
1412 return iterator(__y);
1415 template<typename _Key, typename _Val, typename _KeyOfValue,
1416 typename _Compare, typename _Alloc>
1417 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
1418 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1419 upper_bound(const _Key& __k) const
1421 _Const_Link_type __x = _M_begin(); // Current node.
1422 _Const_Link_type __y = _M_end(); // Last node which is greater than __k.
1425 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1426 __y = __x, __x = _S_left(__x);
1428 __x = _S_right(__x);
1430 return const_iterator(__y);
1433 template<typename _Key, typename _Val, typename _KeyOfValue,
1434 typename _Compare, typename _Alloc>
1436 pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
1437 _Compare, _Alloc>::iterator,
1438 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator>
1439 _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
1440 equal_range(const _Key& __k)
1441 { return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k)); }
1443 template<typename _Key, typename _Val, typename _KoV,
1444 typename _Compare, typename _Alloc>
1446 pair<typename _Rb_tree<_Key, _Val, _KoV,
1447 _Compare, _Alloc>::const_iterator,
1448 typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::const_iterator>
1449 _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
1450 equal_range(const _Key& __k) const
1451 { return pair<const_iterator, const_iterator>(lower_bound(__k),
1452 upper_bound(__k)); }
1455 _Rb_tree_black_count(const _Rb_tree_node_base* __node,
1456 const _Rb_tree_node_base* __root);
1458 template<typename _Key, typename _Val, typename _KeyOfValue,
1459 typename _Compare, typename _Alloc>
1461 _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const
1463 if (_M_impl._M_node_count == 0 || begin() == end())
1464 return _M_impl._M_node_count == 0 && begin() == end()
1465 && this->_M_impl._M_header._M_left == _M_end()
1466 && this->_M_impl._M_header._M_right == _M_end();
1468 unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
1469 for (const_iterator __it = begin(); __it != end(); ++__it)
1471 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node);
1472 _Const_Link_type __L = _S_left(__x);
1473 _Const_Link_type __R = _S_right(__x);
1475 if (__x->_M_color == _S_red)
1476 if ((__L && __L->_M_color == _S_red)
1477 || (__R && __R->_M_color == _S_red))
1480 if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
1482 if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
1485 if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)
1489 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
1491 if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))