Searched refs:node_to_be_replaced (Results 1 – 6 of 6) sorted by relevance
| /third_party/boost/boost/intrusive/ |
| D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
232 if(node_to_be_replaced == new_node) in replace_node()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
241 NodeTraits::set_color(new_node, NodeTraits::get_color(node_to_be_replaced)); in replace_node()
|
| D | avltree_algorithms.hpp | 206 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() argument
208 if(node_to_be_replaced == new_node) in replace_node()
210 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
214 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
216 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
217 NodeTraits::set_balance(new_node, NodeTraits::get_balance(node_to_be_replaced)); in replace_node()
|
| D | bstree_algorithms.hpp | 451 …BOOST_INTRUSIVE_FORCEINLINE static void replace_node(node_ptr node_to_be_replaced, node_ptr new_no… in replace_node() argument
453 if(node_to_be_replaced == new_node) in replace_node()
455 replace_node(node_to_be_replaced, base_type::get_header(node_to_be_replaced), new_node); in replace_node()
472 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() argument
474 if(node_to_be_replaced == new_node) in replace_node()
478 if(node_to_be_replaced == NodeTraits::get_left(header)){ in replace_node()
482 if(node_to_be_replaced == NodeTraits::get_right(header)){ in replace_node()
486 if(node_to_be_replaced == NodeTraits::get_parent(header)){ in replace_node()
492 NodeTraits::set_left(new_node, NodeTraits::get_left(node_to_be_replaced)); in replace_node()
493 NodeTraits::set_right(new_node, NodeTraits::get_right(node_to_be_replaced)); in replace_node()
[all …]
|
| D | sgtree_algorithms.hpp | 107 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node);
110 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|
| D | treap_algorithms.hpp | 202 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node);
205 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|
| D | splaytree_algorithms.hpp | 197 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node);
200 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|