300 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* __z,  in _Rb_tree_rebalance_for_erase()  argument
305   _Rb_tree_node_base* __y = __z;  in _Rb_tree_rebalance_for_erase()
319   if (__y != __z) {          // relink y in place of z.  y is z's successor  in _Rb_tree_rebalance_for_erase()
320     __z->_M_left->_M_parent = __y;   in _Rb_tree_rebalance_for_erase()
321     __y->_M_left = __z->_M_left;  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()
331     if (__root == __z)  in _Rb_tree_rebalance_for_erase()
333     else if (__z->_M_parent->_M_left == __z)  in _Rb_tree_rebalance_for_erase()
334       __z->_M_parent->_M_left = __y;  in _Rb_tree_rebalance_for_erase()
336       __z->_M_parent->_M_right = __y;  in _Rb_tree_rebalance_for_erase()
337     __y->_M_parent = __z->_M_parent;  in _Rb_tree_rebalance_for_erase()
338     __STD::swap(__y->_M_color, __z->_M_color);  in _Rb_tree_rebalance_for_erase()
339     __y = __z;  in _Rb_tree_rebalance_for_erase()
345     if (__root == __z)  in _Rb_tree_rebalance_for_erase()
348       if (__z->_M_parent->_M_left == __z)  in _Rb_tree_rebalance_for_erase()
349         __z->_M_parent->_M_left = __x;  in _Rb_tree_rebalance_for_erase()
351         __z->_M_parent->_M_right = __x;  in _Rb_tree_rebalance_for_erase()
352     if (__leftmost == __z)   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()
354         __leftmost = __z->_M_parent;  in _Rb_tree_rebalance_for_erase()
358     if (__rightmost == __z)    in _Rb_tree_rebalance_for_erase()
359       if (__z->_M_left == 0)         // __z->_M_right must be null also  in _Rb_tree_rebalance_for_erase()
360         __rightmost = __z->_M_parent;    in _Rb_tree_rebalance_for_erase()
827   _Link_type __z;  in _M_insert()  local
831     __z = _M_create_node(__v);  in _M_insert()
832     _S_left(__y) = __z;               // also makes _M_leftmost() = __z   in _M_insert()
835       _M_root() = __z;  in _M_insert()
836       _M_rightmost() = __z;  in _M_insert()
839       _M_leftmost() = __z;   // maintain _M_leftmost() pointing to min node  in _M_insert()
842     __z = _M_create_node(__v);  in _M_insert()
843     _S_right(__y) = __z;  in _M_insert()
845       _M_rightmost() = __z;  // maintain _M_rightmost() pointing to max node  in _M_insert()
847   _S_parent(__z) = __y;  in _M_insert()
848   _S_left(__z) = 0;  in _M_insert()
849   _S_right(__z) = 0;  in _M_insert()
850   _Rb_tree_rebalance(__z, _M_header->_M_parent);  in _M_insert()
852   return iterator(__z);  in _M_insert()