70         _Rb_tree_node_base* __y = __x->_M_parent;  in local_Rb_tree_increment()  local
71         while (__x == __y->_M_right)  in local_Rb_tree_increment()
73             __x = __y;  in local_Rb_tree_increment()
74             __y = __y->_M_parent;  in local_Rb_tree_increment()
76         if (__x->_M_right != __y)  in local_Rb_tree_increment()
77           __x = __y;  in local_Rb_tree_increment()
102         _Rb_tree_node_base* __y = __x->_M_left;  in local_Rb_tree_decrement()  local
103         while (__y->_M_right != 0)  in local_Rb_tree_decrement()
104           __y = __y->_M_right;  in local_Rb_tree_decrement()
105         __x = __y;  in local_Rb_tree_decrement()
109         _Rb_tree_node_base* __y = __x->_M_parent;  in local_Rb_tree_decrement()  local
110         while (__x == __y->_M_left)  in local_Rb_tree_decrement()
112             __x = __y;  in local_Rb_tree_decrement()
113             __y = __y->_M_parent;  in local_Rb_tree_decrement()
115         __x = __y;  in local_Rb_tree_decrement()
136     _Rb_tree_node_base* const __y = __x->_M_right;  in local_Rb_tree_rotate_left()  local
138     __x->_M_right = __y->_M_left;  in local_Rb_tree_rotate_left()
139     if (__y->_M_left !=0)  in local_Rb_tree_rotate_left()
140       __y->_M_left->_M_parent = __x;  in local_Rb_tree_rotate_left()
141     __y->_M_parent = __x->_M_parent;  in local_Rb_tree_rotate_left()
144       __root = __y;  in local_Rb_tree_rotate_left()
146       __x->_M_parent->_M_left = __y;  in local_Rb_tree_rotate_left()
148       __x->_M_parent->_M_right = __y;  in local_Rb_tree_rotate_left()
149     __y->_M_left = __x;  in local_Rb_tree_rotate_left()
150     __x->_M_parent = __y;  in local_Rb_tree_rotate_left()
167     _Rb_tree_node_base* const __y = __x->_M_left;  in local_Rb_tree_rotate_right()  local
169     __x->_M_left = __y->_M_right;  in local_Rb_tree_rotate_right()
170     if (__y->_M_right != 0)  in local_Rb_tree_rotate_right()
171       __y->_M_right->_M_parent = __x;  in local_Rb_tree_rotate_right()
172     __y->_M_parent = __x->_M_parent;  in local_Rb_tree_rotate_right()
175       __root = __y;  in local_Rb_tree_rotate_right()
177       __x->_M_parent->_M_right = __y;  in local_Rb_tree_rotate_right()
179       __x->_M_parent->_M_left = __y;  in local_Rb_tree_rotate_right()
180     __y->_M_right = __x;  in local_Rb_tree_rotate_right()
181     __x->_M_parent = __y;  in local_Rb_tree_rotate_right()
239 	    _Rb_tree_node_base* const __y = __xpp->_M_right;  in _Rb_tree_insert_and_rebalance()  local
240 	    if (__y && __y->_M_color == _S_red)  in _Rb_tree_insert_and_rebalance()
243 		__y->_M_color = _S_black;  in _Rb_tree_insert_and_rebalance()
261 	    _Rb_tree_node_base* const __y = __xpp->_M_left;  in _Rb_tree_insert_and_rebalance()  local
262 	    if (__y && __y->_M_color == _S_red)  in _Rb_tree_insert_and_rebalance()
265 		__y->_M_color = _S_black;  in _Rb_tree_insert_and_rebalance()
292     _Rb_tree_node_base* __y = __z;  in _Rb_tree_rebalance_for_erase()  local
296     if (__y->_M_left == 0)     // __z has at most one non-null child. y == z.  in _Rb_tree_rebalance_for_erase()
297       __x = __y->_M_right;     // __x might be null.  in _Rb_tree_rebalance_for_erase()
299       if (__y->_M_right == 0)  // __z has exactly one non-null child. y == z.  in _Rb_tree_rebalance_for_erase()
300 	__x = __y->_M_left;    // __x is not null.  in _Rb_tree_rebalance_for_erase()
304 	  __y = __y->_M_right;   //   __z's successor.  __x might be null.  in _Rb_tree_rebalance_for_erase()
305 	  while (__y->_M_left != 0)  in _Rb_tree_rebalance_for_erase()
306 	    __y = __y->_M_left;  in _Rb_tree_rebalance_for_erase()
307 	  __x = __y->_M_right;  in _Rb_tree_rebalance_for_erase()
309     if (__y != __z)  in _Rb_tree_rebalance_for_erase()
312 	__z->_M_left->_M_parent = __y;  in _Rb_tree_rebalance_for_erase()
313 	__y->_M_left = __z->_M_left;  in _Rb_tree_rebalance_for_erase()
314 	if (__y != __z->_M_right)  in _Rb_tree_rebalance_for_erase()
316 	    __x_parent = __y->_M_parent;  in _Rb_tree_rebalance_for_erase()
317 	    if (__x) __x->_M_parent = __y->_M_parent;  in _Rb_tree_rebalance_for_erase()
318 	    __y->_M_parent->_M_left = __x;   // __y must be a child of _M_left  in _Rb_tree_rebalance_for_erase()
319 	    __y->_M_right = __z->_M_right;  in _Rb_tree_rebalance_for_erase()
320 	    __z->_M_right->_M_parent = __y;  in _Rb_tree_rebalance_for_erase()
323 	  __x_parent = __y;  in _Rb_tree_rebalance_for_erase()
325 	  __root = __y;  in _Rb_tree_rebalance_for_erase()
327 	  __z->_M_parent->_M_left = __y;  in _Rb_tree_rebalance_for_erase()
329 	  __z->_M_parent->_M_right = __y;  in _Rb_tree_rebalance_for_erase()
330 	__y->_M_parent = __z->_M_parent;  in _Rb_tree_rebalance_for_erase()
331 	std::swap(__y->_M_color, __z->_M_color);  in _Rb_tree_rebalance_for_erase()
332 	__y = __z;  in _Rb_tree_rebalance_for_erase()
337 	__x_parent = __y->_M_parent;  in _Rb_tree_rebalance_for_erase()
339 	  __x->_M_parent = __y->_M_parent;  in _Rb_tree_rebalance_for_erase()
364     if (__y->_M_color != _S_red)  in _Rb_tree_rebalance_for_erase()
443     return __y;  in _Rb_tree_rebalance_for_erase()