Lines Matching refs:_M_right

65     if (__x->_M_right != 0) 
67 __x = __x->_M_right;
74 while (__x == __y->_M_right)
79 if (__x->_M_right != __y)
96 __x = __x->_M_right;
100 while (__y->_M_right != 0)
101 __y = __y->_M_right;
127 _Rb_tree_node_base* const __y = __x->_M_right;
129 __x->_M_right = __y->_M_left;
139 __x->_M_parent->_M_right = __y;
150 __x->_M_left = __y->_M_right;
151 if (__y->_M_right != 0)
152 __y->_M_right->_M_parent = __x;
157 else if (__x == __x->_M_parent->_M_right)
158 __x->_M_parent->_M_right = __y;
161 __y->_M_right = __x;
176 __x->_M_right = 0;
190 __header._M_right = __x;
197 __p->_M_right = __x;
199 if (__p == __header._M_right)
200 __header._M_right = __x; // maintain rightmost pointing to max node
210 _Rb_tree_node_base* const __y = __xpp->_M_right;
220 if (__x == __x->_M_parent->_M_right)
262 _Rb_tree_node_base *& __rightmost = __header._M_right;
268 __x = __y->_M_right; // __x might be null.
270 if (__y->_M_right == 0) // __z has exactly one non-null child. y == z.
275 __y = __y->_M_right; // __z's successor. __x might be null.
278 __x = __y->_M_right;
285 if (__y != __z->_M_right)
290 __y->_M_right = __z->_M_right;
291 __z->_M_right->_M_parent = __y;
300 __z->_M_parent->_M_right = __y;
317 __z->_M_parent->_M_right = __x;
320 if (__z->_M_right == 0) // __z->_M_left must be null also
328 if (__z->_M_left == 0) // __z->_M_right must be null also
340 _Rb_tree_node_base* __w = __x_parent->_M_right;
346 __w = __x_parent->_M_right;
350 (__w->_M_right == 0 ||
351 __w->_M_right->_M_color == _S_black))
359 if (__w->_M_right == 0
360 || __w->_M_right->_M_color == _S_black)
365 __w = __x_parent->_M_right;
369 if (__w->_M_right)
370 __w->_M_right->_M_color = _S_black;
377 // same as above, with _M_right <-> _M_left.
386 if ((__w->_M_right == 0 ||
387 __w->_M_right->_M_color == _S_black) &&
399 __w->_M_right->_M_color = _S_black;