_Rb_tree_node_base
typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
__black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root)
if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
_Rb_tree_rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)
_Rb_tree_node_base* __y = __x->_M_right;
_Rb_tree_rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)
_Rb_tree_node_base* __y = __x->_M_left;
_Rb_tree_rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)
_Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right;
_Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left;
inline _Rb_tree_node_base*
_Rb_tree_rebalance_for_erase(_Rb_tree_node_base* __z,
_Rb_tree_node_base*& __root,
_Rb_tree_node_base*& __leftmost,
_Rb_tree_node_base*& __rightmost)
_Rb_tree_node_base* __y = __z;
_Rb_tree_node_base* __x = 0;
_Rb_tree_node_base* __x_parent = 0;
__leftmost = _Rb_tree_node_base::_S_minimum(__x);
__rightmost = _Rb_tree_node_base::_S_maximum(__x);
_Rb_tree_node_base* __w = __x_parent->_M_right;
_Rb_tree_node_base* __w = __x_parent->_M_left;
typedef _Rb_tree_node_base* _Base_ptr;
{ return (_Link_type) _Rb_tree_node_base::_S_minimum(__x); }
{ return (_Link_type) _Rb_tree_node_base::_S_maximum(__x); }
typedef _Rb_tree_node_base* _Base_ptr;
struct _Rb_tree_node : public _Rb_tree_node_base