Home
last modified time | relevance | path

Searched refs:__rightmost (Results 1 – 8 of 8) sorted by relevance

/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/src/c++98/
A Dtree.cc291 _Rb_tree_node_base *& __rightmost = __header._M_right; in _Rb_tree_rebalance_for_erase() local
355 if (__rightmost == __z) in _Rb_tree_rebalance_for_erase()
358 __rightmost = __z->_M_parent; in _Rb_tree_rebalance_for_erase()
361 __rightmost = _Rb_tree_node_base::_S_maximum(__x); in _Rb_tree_rebalance_for_erase()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/src/c++98/
A Dtree.cc291 _Rb_tree_node_base *& __rightmost = __header._M_right; in _Rb_tree_rebalance_for_erase() local
355 if (__rightmost == __z) in _Rb_tree_rebalance_for_erase()
358 __rightmost = __z->_M_parent; in _Rb_tree_rebalance_for_erase()
361 __rightmost = _Rb_tree_node_base::_S_maximum(__x); in _Rb_tree_rebalance_for_erase()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/src/c++98/
A Dtree.cc291 _Rb_tree_node_base *& __rightmost = __header._M_right; in _Rb_tree_rebalance_for_erase() local
355 if (__rightmost == __z) in _Rb_tree_rebalance_for_erase()
358 __rightmost = __z->_M_parent; in _Rb_tree_rebalance_for_erase()
361 __rightmost = _Rb_tree_node_base::_S_maximum(__x); in _Rb_tree_rebalance_for_erase()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/src/c++98/
A Dtree.cc291 _Rb_tree_node_base *& __rightmost = __header._M_right; in _Rb_tree_rebalance_for_erase() local
355 if (__rightmost == __z) in _Rb_tree_rebalance_for_erase()
358 __rightmost = __z->_M_parent; in _Rb_tree_rebalance_for_erase()
361 __rightmost = _Rb_tree_node_base::_S_maximum(__x); in _Rb_tree_rebalance_for_erase()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/src/c++98/
A Dtree.cc291 _Rb_tree_node_base *& __rightmost = __header._M_right; in _Rb_tree_rebalance_for_erase() local
355 if (__rightmost == __z) in _Rb_tree_rebalance_for_erase()
358 __rightmost = __z->_M_parent; in _Rb_tree_rebalance_for_erase()
361 __rightmost = _Rb_tree_node_base::_S_maximum(__x); in _Rb_tree_rebalance_for_erase()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/src/c++98/
A Dtree.cc291 _Rb_tree_node_base *& __rightmost = __header._M_right; in _Rb_tree_rebalance_for_erase() local
355 if (__rightmost == __z) in _Rb_tree_rebalance_for_erase()
358 __rightmost = __z->_M_parent; in _Rb_tree_rebalance_for_erase()
361 __rightmost = _Rb_tree_node_base::_S_maximum(__x); in _Rb_tree_rebalance_for_erase()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/src/c++98/
A Dtree.cc291 _Rb_tree_node_base *& __rightmost = __header._M_right; in _Rb_tree_rebalance_for_erase() local
355 if (__rightmost == __z) in _Rb_tree_rebalance_for_erase()
358 __rightmost = __z->_M_parent; in _Rb_tree_rebalance_for_erase()
361 __rightmost = _Rb_tree_node_base::_S_maximum(__x); in _Rb_tree_rebalance_for_erase()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/src/c++98/
A Dtree.cc291 _Rb_tree_node_base *& __rightmost = __header._M_right; in _Rb_tree_rebalance_for_erase() local
355 if (__rightmost == __z) in _Rb_tree_rebalance_for_erase()
358 __rightmost = __z->_M_parent; in _Rb_tree_rebalance_for_erase()
361 __rightmost = _Rb_tree_node_base::_S_maximum(__x); in _Rb_tree_rebalance_for_erase()

Completed in 11 milliseconds