Home
last modified time | relevance | path

Searched refs:right_child (Results 1 – 20 of 20) sorted by relevance

/external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/
Dsplit_handler_ops_test.py86 right_child = split_info.right_child.vector
92 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
103 right_child = split_info.right_child.vector
108 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
145 right_child = split_info.right_child.vector
150 self.assertEqual(2, len(right_child.value))
237 right_child = split_info.right_child.vector
244 self.assertAllClose([expected_right_weight], right_child.value)
260 right_child = split_info.right_child.vector
267 self.assertAllClose([expected_right_weight], right_child.value)
[all …]
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/batch/
Dcategorical_split_handler_test.py130 right_child = split_info.right_child.vector
143 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
160 right_child = split_info.right_child.vector
166 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
254 right_child = split_info.children[1].vector
260 self.assertAllClose([expected_right_weight1], right_child.value, 0.00001)
274 right_child = split_info.children[3].vector
276 self.assertAllClose([expected_right_weight2], right_child.value, 0.00001)
364 right_child = split_info.right_child.vector
377 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
[all …]
Dordinal_split_handler_test.py144 right_child = split_info.right_child.vector
152 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
173 right_child = split_info.right_child.vector
179 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
288 right_child = oblivious_split_info.children[1].vector
292 self.assertAllClose([expected_right_weight_1], right_child.value, 0.00001)
305 right_child = oblivious_split_info.children[3].vector
309 self.assertAllClose([expected_right_weight_2], right_child.value, 0.00001)
424 right_child = split_info.right_child.vector
432 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
[all …]
/external/webrtc/webrtc/modules/rtp_rtcp/source/
Dvp8_partition_aggregator_unittest.cc38 ASSERT_TRUE(NULL != root->right_child()); in TEST()
40 EXPECT_EQ(2u, root->right_child()->this_size()); in TEST()
41 EXPECT_EQ(11, root->right_child()->Cost(kPenalty)); in TEST()
43 EXPECT_TRUE(root->right_child()->packet_start()); in TEST()
73 EXPECT_TRUE(opt == root->left_child()->right_child()->left_child()-> in TEST()
74 right_child()->left_child()->right_child()->left_child()); in TEST()
Dvp8_partition_aggregator.h59 PartitionTreeNode* right_child() const { return children_[kRightChild]; } in right_child() function
/external/grpc-grpc/src/core/lib/iomgr/
Dtimer_heap.cc56 uint32_t right_child = left_child + 1; in adjust_downwards() local
57 uint32_t next_i = right_child < length && first[left_child]->deadline > in adjust_downwards()
58 first[right_child]->deadline in adjust_downwards()
59 ? right_child in adjust_downwards()
/external/tensorflow/tensorflow/contrib/tensor_forest/hybrid/core/ops/
Dstochastic_hard_routing_function_op.cc157 int32 right_child = left_child + 1; in Compute() local
174 CHECK_LT(right_child, num_nodes); in Compute()
177 out_path(i, j + 1) = right_child; in Compute()
178 node = right_child; in Compute()
Dhard_routing_function_op.cc150 int32 right_child = left_child + 1; in Compute() local
162 out_path(i, j + 1) = right_child; in Compute()
163 node = right_child; in Compute()
Drouting_function_op.cc124 int32 right_child = left_child + 1; in Compute() local
132 out_probs(i, right_child) = prob * (1.0 - left_prob); in Compute()
Drouting_gradient_op.cc126 int32 right_child = left_child + 1; in Compute() local
134 left_prob * routes(i, right_child)); in Compute()
Dk_feature_routing_function_op.cc144 int32 right_child = left_child + 1; in Compute() local
152 out_probs(i, right_child) = prob * (1.0f - left_prob); in Compute()
Dk_feature_gradient_op.cc162 int32 right_child = left_child + 1; in Compute() local
171 left_prob * routes(i, right_child)); in Compute()
/external/tensorflow/tensorflow/contrib/boosted_trees/kernels/
Dsplit_handler_ops.cc292 auto* right_child = split_info.mutable_right_child(); in ComputeNormalDecisionTree() local
295 state->FillLeaf(best_right_node_stats, right_child); in ComputeNormalDecisionTree()
405 auto* right_child = oblivious_split_info.add_children(); in ComputeObliviousDecisionTree() local
408 state->FillLeaf(best_right_node_stats[root_idx], right_child); in ComputeObliviousDecisionTree()
674 auto* right_child = split_info.mutable_right_child(); in Compute() local
676 state.FillLeaf(best_right_node_stats, right_child); in Compute()
873 auto* right_child = split_info.mutable_right_child(); in ComputeNormalDecisionTree() local
875 state->FillLeaf(best_right_node_stats, right_child); in ComputeNormalDecisionTree()
986 auto* right_child = oblivious_split_info.add_children(); in ComputeObliviousDecisionTree() local
989 state->FillLeaf(best_right_node_stats[root_idx], right_child); in ComputeObliviousDecisionTree()
Dtraining_ops.cc82 if (!(IsLeafWellFormed(split->split_info.right_child()) && in UpdateBestSplit()
/external/deqp-deps/SPIRV-Tools/source/comp/
Dmove_to_front.cpp248 bool right_child = true; in InsertNode() local
255 right_child = TimestampOf(iter) > TimestampOf(node); in InsertNode()
256 iter = right_child ? RightOf(iter) : LeftOf(iter); in InsertNode()
263 if (right_child) in InsertNode()
/external/swiftshader/third_party/SPIRV-Tools/source/comp/
Dmove_to_front.cpp248 bool right_child = true; in InsertNode() local
255 right_child = TimestampOf(iter) > TimestampOf(node); in InsertNode()
256 iter = right_child ? RightOf(iter) : LeftOf(iter); in InsertNode()
263 if (right_child) in InsertNode()
/external/grpc-grpc/test/core/iomgr/
Dtimer_heap_test.cc56 size_t right_child = left_child + 1u; in check_valid() local
60 if (right_child < pq->timer_count) { in check_valid()
61 GPR_ASSERT(pq->timers[i]->deadline <= pq->timers[right_child]->deadline); in check_valid()
/external/tensorflow/tensorflow/contrib/boosted_trees/proto/
Dsplit_info.proto18 tensorflow.boosted_trees.trees.Leaf right_child = 3; field
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dconstant_folding.cc2832 NodeDef* right_child = node_map_->GetNode(node->input(1)); in ConstantPushDown() local
2834 if (node->op() != left_child->op() && node->op() != right_child->op()) { in ConstantPushDown()
2838 const bool right_child_is_constant = IsReallyConstant(*right_child); in ConstantPushDown()
2843 node->device() != right_child->device()) { in ConstantPushDown()
2846 NodeDef* op_child_node = left_child_is_constant ? right_child : left_child; in ConstantPushDown()
2848 left_child_is_constant ? left_child : right_child; in ConstantPushDown()
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/Inline/
Dinline-funclets.ll497 ; CHECK-NEXT: to label %[[unreach]] unwind label %[[right_child:.+]]
503 ; CHECK: [[right_child]]: