Searched refs:_S_minimum (Results 1 – 2 of 2) sorted by relevance
157 … __y = _Rb_tree_node_base::_S_minimum(__y->_M_right); // __z's successor. __x might be null. in _Rebalance_for_erase()202 __leftmost = _Rb_tree_node_base::_S_minimum(__x); in _Rebalance_for_erase()298 _M_node = _Rb_tree_node_base::_S_minimum(_M_node->_M_right); in _M_increment()335 _M_leftmost() = _S_minimum(_M_root());709 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root())) in __rb_verify()
93 static _Base_ptr _STLP_CALL _S_minimum(_Base_ptr __x) { in _S_minimum() function362 static _Base_ptr _STLP_CALL _S_minimum(_Base_ptr __x)363 { return _Rb_tree_node_base::_S_minimum(__x); }400 _M_leftmost() = _S_minimum(_M_root());