Home
last modified time | relevance | path

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

/third_party/boost/libs/ptr_container/test/
Dptr_array.cpp42 void set_child( this_type* r ) { tree. BOOST_NESTED_TEMPLATE replace<idx>(r); } in set_child() function in n_ary_tree
79 tree.set_child<0>( new binary_tree( "left subtree" ) ); in test_array()
80 tree.set_child<1>( new binary_tree( "right subtree" ) ); in test_array()
82 left.set_child<0>( new binary_tree( "left left subtree" ) ); in test_array()
83 left.set_child<1>( new binary_tree( "left right subtree" ) ); in test_array()
85 right.set_child<0>( new binary_tree( "right left subtree" ) ); in test_array()
86 right.set_child<1>( new binary_tree( "right right subtree" ) ); in test_array()
/third_party/grpc/src/core/ext/filters/client_channel/lb_policy/
Dchild_policy_handler.cc100 void set_child(LoadBalancingPolicy* child) { child_ = child; } in set_child() function in grpc_core::ChildPolicyHandler::Helper
273 helper->set_child(lb_policy.get()); in CreateChildPolicy()
/third_party/python/Lib/lib2to3/tests/
Dtest_pytree.py275 n1.set_child(0, l2)
281 n2.set_child(0, n1)
287 self.assertRaises(IndexError, n1.set_child, 4, l2)
289 self.assertRaises(Exception, n1.set_child, 0, list)
/third_party/boost/boost/intrusive/
Dbstree_algorithms.hpp1546 this_type::set_child(header, y, z_parent, z_is_leftchild); in erase()
1553 this_type::set_child(header, x, z_parent, z_is_leftchild); in erase()
1788 …static void set_child(node_ptr header, node_ptr new_child, node_ptr new_parent, const bool link_le… in set_child() function in boost::intrusive::bstree_algorithms
1816 set_child(header, p_right, p_parent, p_was_left); in rotate_left()
1837 set_child(header, p_left, p_parent, p_was_left); in rotate_right()
/third_party/python/Lib/lib2to3/fixes/
Dfix_metaclass.py176 node.set_child(3, arglist)
/third_party/python/Lib/lib2to3/
Dpytree.py288 def set_child(self, i, child): member in Node
/third_party/abseil-cpp/absl/container/internal/
Dbtree.h624 void set_child(int i, btree_node *c) {
630 set_child(i, c);
1547 set_child(j, child(j - 1));
1570 set_child(j - to_erase, child(j));
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
Dbtree.h700 void set_child(int i, btree_node *c) {
706 set_child(i, c);
1601 set_child(j, child(j - 1));
1624 set_child(j - to_erase, child(j));