Lines Matching refs:_M_left

68         while (__x->_M_left != 0)
69 __x = __x->_M_left;
97 else if (__x->_M_left != 0)
99 _Rb_tree_node_base* __y = __x->_M_left;
107 while (__x == __y->_M_left)
129 __x->_M_right = __y->_M_left;
130 if (__y->_M_left !=0)
131 __y->_M_left->_M_parent = __x;
136 else if (__x == __x->_M_parent->_M_left)
137 __x->_M_parent->_M_left = __y;
140 __y->_M_left = __x;
148 _Rb_tree_node_base* const __y = __x->_M_left;
150 __x->_M_left = __y->_M_right;
160 __x->_M_parent->_M_left = __y;
175 __x->_M_left = 0;
185 __p->_M_left = __x; // also makes leftmost = __x when __p == &__header
192 else if (__p == __header._M_left)
193 __header._M_left = __x; // maintain leftmost pointing to min node
208 if (__x->_M_parent == __xpp->_M_left)
232 _Rb_tree_node_base* const __y = __xpp->_M_left;
242 if (__x == __x->_M_parent->_M_left)
261 _Rb_tree_node_base *& __leftmost = __header._M_left;
267 if (__y->_M_left == 0) // __z has at most one non-null child. y == z.
271 __x = __y->_M_left; // __x is not null.
276 while (__y->_M_left != 0)
277 __y = __y->_M_left;
283 __z->_M_left->_M_parent = __y;
284 __y->_M_left = __z->_M_left;
289 __y->_M_parent->_M_left = __x; // __y must be a child of _M_left
297 else if (__z->_M_parent->_M_left == __z)
298 __z->_M_parent->_M_left = __y;
314 if (__z->_M_parent->_M_left == __z)
315 __z->_M_parent->_M_left = __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
331 else // __x == __z->_M_left
338 if (__x == __x_parent->_M_left)
348 if ((__w->_M_left == 0 ||
349 __w->_M_left->_M_color == _S_black) &&
362 __w->_M_left->_M_color = _S_black;
377 // same as above, with _M_right <-> _M_left.
378 _Rb_tree_node_base* __w = __x_parent->_M_left;
384 __w = __x_parent->_M_left;
388 (__w->_M_left == 0 ||
389 __w->_M_left->_M_color == _S_black))
397 if (__w->_M_left == 0 || __w->_M_left->_M_color == _S_black)
402 __w = __x_parent->_M_left;
406 if (__w->_M_left)
407 __w->_M_left->_M_color = _S_black;