Home
last modified time | relevance | path

Searched refs:left_child (Results 1 – 18 of 18) sorted by relevance

/external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/
Dsplit_handler_ops_test.py85 left_child = split_info.left_child.vector
91 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
102 left_child = split_info.left_child.vector
107 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
144 left_child = split_info.left_child.vector
149 self.assertEqual(2, len(left_child.value))
236 left_child = split_info.left_child.vector
242 self.assertAllClose([expected_left_weight], left_child.value)
259 left_child = split_info.left_child.vector
265 self.assertAllClose([expected_left_weight], left_child.value)
[all …]
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/batch/
Dcategorical_split_handler_test.py129 left_child = split_info.left_child.vector
141 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
159 left_child = split_info.left_child.vector
164 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
253 left_child = split_info.children[0].vector
259 self.assertAllClose([expected_left_weight1], left_child.value, 0.00001)
273 left_child = split_info.children[2].vector
275 self.assertAllClose([expected_left_weight2], left_child.value, 0.00001)
363 left_child = split_info.left_child.vector
375 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
[all …]
Dordinal_split_handler_test.py143 left_child = split_info.left_child.vector
150 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
172 left_child = split_info.left_child.vector
177 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
287 left_child = oblivious_split_info.children[0].vector
290 self.assertAllClose([expected_left_weight_1], left_child.value, 0.00001)
304 left_child = oblivious_split_info.children[2].vector
307 self.assertAllClose([expected_left_weight_2], left_child.value, 0.00001)
423 left_child = split_info.left_child.vector
430 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
[all …]
/external/grpc-grpc/src/core/lib/iomgr/
Dtimer_heap.cc54 uint32_t left_child = 1u + 2u * i; in adjust_downwards() local
55 if (left_child >= length) break; in adjust_downwards()
56 uint32_t right_child = left_child + 1; in adjust_downwards()
57 uint32_t next_i = right_child < length && first[left_child]->deadline > in adjust_downwards()
60 : left_child; in adjust_downwards()
/external/webrtc/webrtc/modules/rtp_rtcp/source/
Dvp8_partition_aggregator_unittest.cc37 ASSERT_TRUE(NULL != root->left_child()); in TEST()
39 EXPECT_EQ(3u, root->left_child()->this_size()); in TEST()
42 EXPECT_FALSE(root->left_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.h58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; } in left_child() function
/external/tensorflow/tensorflow/contrib/tensor_forest/hybrid/core/ops/
Dstochastic_hard_routing_function_op.cc156 int32 left_child = 2 * node + 1; in Compute() local
157 int32 right_child = left_child + 1; in Compute()
166 CHECK_LT(left_child, num_nodes); in Compute()
169 out_path(i, j + 1) = left_child; in Compute()
170 node = left_child; in Compute()
Dhard_routing_function_op.cc149 int32 left_child = 2 * node + 1; in Compute() local
150 int32 right_child = left_child + 1; in Compute()
158 out_path(i, j + 1) = left_child; in Compute()
159 node = left_child; in Compute()
Drouting_function_op.cc123 int32 left_child = 2 * j + 1; in Compute() local
124 int32 right_child = left_child + 1; in Compute()
131 out_probs(i, left_child) = prob * left_prob; in Compute()
Drouting_gradient_op.cc125 int32 left_child = 2 * j + 1; in Compute() local
126 int32 right_child = left_child + 1; in Compute()
133 out(i, j) = (right_prob * routes(i, left_child) + in Compute()
Dk_feature_routing_function_op.cc143 int32 left_child = 2 * j + 1; in Compute() local
144 int32 right_child = left_child + 1; in Compute()
151 out_probs(i, left_child) = prob * left_prob; in Compute()
Dk_feature_gradient_op.cc161 int32 left_child = 2 * j + 1; in Compute() local
162 int32 right_child = left_child + 1; in Compute()
170 routes_grad(i, j) = (right_prob * routes(i, left_child) + in Compute()
Dstochastic_hard_routing_gradient_op.cc201 int32 left_child = 2 * j + 1; in Compute() local
210 if (path(i, j - 1) == left_child) { in Compute()
/external/grpc-grpc/test/core/iomgr/
Dtimer_heap_test.cc55 size_t left_child = 1u + 2u * i; in check_valid() local
56 size_t right_child = left_child + 1u; in check_valid()
57 if (left_child < pq->timer_count) { in check_valid()
58 GPR_ASSERT(pq->timers[i]->deadline <= pq->timers[left_child]->deadline); in check_valid()
/external/tensorflow/tensorflow/contrib/boosted_trees/kernels/
Dsplit_handler_ops.cc291 auto* left_child = split_info.mutable_left_child(); in ComputeNormalDecisionTree() local
294 state->FillLeaf(best_left_node_stats, left_child); in ComputeNormalDecisionTree()
404 auto* left_child = oblivious_split_info.add_children(); in ComputeObliviousDecisionTree() local
407 state->FillLeaf(best_left_node_stats[root_idx], left_child); in ComputeObliviousDecisionTree()
673 auto* left_child = split_info.mutable_left_child(); in Compute() local
675 state.FillLeaf(best_left_node_stats, left_child); in Compute()
872 auto* left_child = split_info.mutable_left_child(); in ComputeNormalDecisionTree() local
874 state->FillLeaf(best_left_node_stats, left_child); in ComputeNormalDecisionTree()
985 auto* left_child = oblivious_split_info.add_children(); in ComputeObliviousDecisionTree() local
988 state->FillLeaf(best_left_node_stats[root_idx], left_child); in ComputeObliviousDecisionTree()
Dtraining_ops.cc83 IsLeafWellFormed(split->split_info.left_child()))) { in UpdateBestSplit()
/external/tensorflow/tensorflow/contrib/boosted_trees/proto/
Dsplit_info.proto15 tensorflow.boosted_trees.trees.Leaf left_child = 2; field
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dconstant_folding.cc2831 NodeDef* left_child = node_map_->GetNode(node->input(0)); in ConstantPushDown() local
2834 if (node->op() != left_child->op() && node->op() != right_child->op()) { in ConstantPushDown()
2837 const bool left_child_is_constant = IsReallyConstant(*left_child); in ConstantPushDown()
2842 if (node->device() != left_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()