bool _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>::__rb_verify() const {
if (_M_node_count == 0 || begin() == end())
return ((_M_node_count == 0) &&
(begin() == end()) &&
(this->_M_header._M_data._M_left == &this->_M_header._M_data) &&
(this->_M_header._M_data._M_right == &this->_M_header._M_data));
int __len = __black_count(_M_leftmost(), _M_root());
for (const_iterator __it = begin(); __it != end(); ++__it) {
_Base_ptr __x = __it._M_node;
_Base_ptr __L = _S_left(__x);
_Base_ptr __R = _S_right(__x);
if (__x->_M_color == _S_rb_tree_red)
if ((__L && __L->_M_color == _S_rb_tree_red) ||
(__R && __R->_M_color == _S_rb_tree_red))
return false;
if (__L && _M_key_compare(_S_key(__x), _S_key(__L)))
return false;
if (__R && _M_key_compare(_S_key(__R), _S_key(__x)))
return false;
if (!__L && !__R && __black_count(__x, _M_root()) != __len)
return false;
}
if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
return false;
if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
return false;
return true;
}
__iterator__
_Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent,
const _Value& __val,
_Rb_tree_node_base * __on_left,
_Rb_tree_node_base * __on_right) {
// We do not create the node here as, depending on tests, we might call
// _M_key_compare that can throw an exception.
_Base_ptr __new_node;
if ( __parent == &this->_M_header._M_data ) {
__new_node = _M_create_node(__val);
_S_left(__parent) = __new_node; // also makes _M_leftmost() = __new_node
_M_root() = __new_node;
_M_rightmost() = __new_node;
}
else if ( __on_right == 0 && // If __on_right != 0, the remainder fails to false
( __on_left != 0 || // If __on_left != 0, the remainder succeeds to true
_M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
__new_node = _M_create_node(__val);
_S_left(__parent) = __new_node;
if (__parent == _M_leftmost())
_M_leftmost() = __new_node; // maintain _M_leftmost() pointing to min node
}
else {
__new_node = _M_create_node(__val);
_S_right(__parent) = __new_node;
if (__parent == _M_rightmost())
_M_rightmost() = __new_node; // maintain _M_rightmost() pointing to max node
}
_S_parent(__new_node) = __parent;
_Rb_global_inst::_Rebalance(__new_node, this->_M_header._M_data._M_parent);
++_M_node_count;
return iterator(__new_node);
}
class _Compare, class _Alloc> __iterator__
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc> ::insert_equal(const _Value& __v)
{
_Link_type __y = this->_M_header._M_data;
_Link_type __x = _M_root();
while (__x != 0) {
__y = __x;
__x = _M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ?
_S_left(__x) : _S_right(__x);
}
return _M_insert(__x, __y, __v);
}
class _Compare, class _Alloc> _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc> ::operator=(const _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>& __x)
{
if (this != &__x) {
// Note that _Key may be a constant type.
clear();
_M_node_count = 0;
_M_key_compare = __x._M_key_compare;
if (__x._M_root() == 0) {
_M_root() = 0;
_M_leftmost() = this->_M_header._M_data;
_M_rightmost() = this->_M_header._M_data;
}
else {
_M_root() = _M_copy(__x._M_root(), this->_M_header._M_data);
_M_leftmost() = _S_minimum(_M_root());
_M_rightmost() = _S_maximum(_M_root());
_M_node_count = __x._M_node_count;
}
}
return *this;
}
__iterator__
_Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
_Base_ptr __y = &this->_M_header._M_data;
_Base_ptr __x = _M_root();
while (__x != 0) {
__y = __x;
if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
__x = _S_left(__x);
}
else
__x = _S_right(__x);
}
return _M_insert(__y, __val, __x);
}
class _Compare, class _Alloc> pair< _Rb_tree_iterator<_Value, _Nonconst_traits<_Value> >, bool> _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc> ::insert_unique(const _Value& __v)
{
_Link_type __y = this->_M_header._M_data;
_Link_type __x = _M_root();
bool __comp = true;
while (__x != 0) {
__y = __x;
__comp = _M_key_compare(_KeyOfValue()(__v), _S_key(__x));
__x = __comp ? _S_left(__x) : _S_right(__x);
}
iterator __j = iterator(__y);
if (__comp)
if (__j == begin())
return pair<iterator,bool>(_M_insert(/* __x*/ __y, __y, __v), true);
else
--__j;
if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
return pair<iterator,bool>(__j, false);
}
pair<__iterator__, bool>
_Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
_Base_ptr __y = &this->_M_header._M_data;
_Base_ptr __x = _M_root();
bool __comp = true;
while (__x != 0) {
__y = __x;
__comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x));
__x = __comp ? _S_left(__x) : _S_right(__x);
}
iterator __j = iterator(__y);
if (__comp) {
if (__j == begin())
return pair<iterator,bool>(_M_insert(__y, __val, /* __x*/ __y), true);
else
--__j;
}
if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
return pair<iterator,bool>(_M_insert(__y, __val, __x), true);
}
return pair<iterator,bool>(__j, false);
}
class _Compare, class _Alloc> __iterator__
_Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc> ::_M_insert(_Rb_tree_node_base* __x_, _Rb_tree_node_base* __y_, const _Value& __v,
_Rb_tree_node_base* __w_)
{
_Link_type __w = (_Link_type) __w_;
_Link_type __x = (_Link_type) __x_;
_Link_type __y = (_Link_type) __y_;
_Link_type __z;
if ( __y == this->_M_header._M_data ||
( __w == 0 && // If w != 0, the remainder fails to false
( __x != 0 || // If x != 0, the remainder succeeds to true
_M_key_compare( _KeyOfValue()(__v), _S_key(__y) ) )
)
) {
__z = _M_create_node(__v);
_S_left(__y) = __z; // also makes _M_leftmost() = __z
// when __y == _M_header
if (__y == this->_M_header._M_data) {
_M_root() = __z;
_M_rightmost() = __z;
}
else if (__y == _M_leftmost())
_M_leftmost() = __z; // maintain _M_leftmost() pointing to min node
}
else {
__z = _M_create_node(__v);
_S_right(__y) = __z;
if (__y == _M_rightmost())
_M_rightmost() = __z; // maintain _M_rightmost() pointing to max node
}
_S_parent(__z) = __y;
_S_left(__z) = 0;
_S_right(__z) = 0;
_Rb_global_inst::_Rebalance(__z, this->_M_header._M_data->_M_parent);
++_M_node_count;
return iterator(__z);
}
