79   _Base_ptr _M_right;  member
89     while (__x->_M_right != 0) __x = __x->_M_right;  in _S_maximum()
111     if (_M_node->_M_right != 0) {  in _M_increment()
112       _M_node = _M_node->_M_right;  in _M_increment()
118       while (_M_node == __y->_M_right) {  in _M_increment()
122       if (_M_node->_M_right != __y)  in _M_increment()
131       _M_node = _M_node->_M_right;  in _M_decrement()
134       while (__y->_M_right != 0)  in _M_decrement()
135         __y = __y->_M_right;  in _M_decrement()
219   _Rb_tree_node_base* __y = __x->_M_right;  in _Rb_tree_rotate_left()
220   __x->_M_right = __y->_M_left;  in _Rb_tree_rotate_left()
230     __x->_M_parent->_M_right = __y;  in _Rb_tree_rotate_left()
239   __x->_M_left = __y->_M_right;  in _Rb_tree_rotate_right()
240   if (__y->_M_right != 0)  in _Rb_tree_rotate_right()
241     __y->_M_right->_M_parent = __x;  in _Rb_tree_rotate_right()
246   else if (__x == __x->_M_parent->_M_right)  in _Rb_tree_rotate_right()
247     __x->_M_parent->_M_right = __y;  in _Rb_tree_rotate_right()
250   __y->_M_right = __x;  in _Rb_tree_rotate_right()
260       _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right;  in _Rb_tree_rebalance()
268         if (__x == __x->_M_parent->_M_right) {  in _Rb_tree_rebalance()
309     __x = __y->_M_right;     // __x might be null.  in _Rb_tree_rebalance_for_erase()
311     if (__y->_M_right == 0)  // __z has exactly one non-null child. y == z.  in _Rb_tree_rebalance_for_erase()
314       __y = __y->_M_right;   //   __z's successor.  __x might be null.  in _Rb_tree_rebalance_for_erase()
317       __x = __y->_M_right;  in _Rb_tree_rebalance_for_erase()
322     if (__y != __z->_M_right) {  in _Rb_tree_rebalance_for_erase()
326       __y->_M_right = __z->_M_right;  in _Rb_tree_rebalance_for_erase()
327       __z->_M_right->_M_parent = __y;  in _Rb_tree_rebalance_for_erase()
336       __z->_M_parent->_M_right = __y;  in _Rb_tree_rebalance_for_erase()
351         __z->_M_parent->_M_right = __x;  in _Rb_tree_rebalance_for_erase()
353       if (__z->_M_right == 0)        // __z->_M_left must be null also  in _Rb_tree_rebalance_for_erase()
368         _Rb_tree_node_base* __w = __x_parent->_M_right;  in _Rb_tree_rebalance_for_erase()
373           __w = __x_parent->_M_right;  in _Rb_tree_rebalance_for_erase()
377             (__w->_M_right == 0 ||   in _Rb_tree_rebalance_for_erase()
378              __w->_M_right->_M_color == _S_rb_tree_black)) {  in _Rb_tree_rebalance_for_erase()
383           if (__w->_M_right == 0 ||   in _Rb_tree_rebalance_for_erase()
384               __w->_M_right->_M_color == _S_rb_tree_black) {  in _Rb_tree_rebalance_for_erase()
388             __w = __x_parent->_M_right;  in _Rb_tree_rebalance_for_erase()
392           if (__w->_M_right) __w->_M_right->_M_color = _S_rb_tree_black;  in _Rb_tree_rebalance_for_erase()
404         if ((__w->_M_right == 0 ||   in _Rb_tree_rebalance_for_erase()
405              __w->_M_right->_M_color == _S_rb_tree_black) &&  in _Rb_tree_rebalance_for_erase()
414             if (__w->_M_right) __w->_M_right->_M_color = _S_rb_tree_black;  in _Rb_tree_rebalance_for_erase()
567     __tmp->_M_right = 0;  in _M_clone_node()
586     { return (_Link_type&) _M_header->_M_right; }  in _M_rightmost()
591     { return (_Link_type&)(__x->_M_right); }  in _S_right()
604     { return (_Link_type&)(__x->_M_right); }  in _S_right()
1032                                               _M_header->_M_right);  in erase()
1059     if (__x->_M_right)  in _M_copy()
1060       __top->_M_right = _M_copy(_S_right(__x), __top);  in _M_copy()
1068       if (__x->_M_right)  in _M_copy()
1069         __y->_M_right = _M_copy(_S_right(__x), __y);  in _M_copy()
1276       _M_header->_M_left == _M_header && _M_header->_M_right == _M_header;  in __rb_verify()