| /external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/ |
| split_handler_ops_test.py | 86 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.vecto
[all...] |
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/batch/ |
| ordinal_split_handler_test.py | 144 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
[all...] |
| categorical_split_handler_test.py | 130 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
[all...] |
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator_unittest.cc | 38 ASSERT_TRUE(NULL != root->right_child());
40 EXPECT_EQ(2u, root->right_child()->this_size());
41 EXPECT_EQ(11, root->right_child()->Cost(kPenalty));
43 EXPECT_TRUE(root->right_child()->packet_start());
73 EXPECT_TRUE(opt == root->left_child()->right_child()->left_child()->
74 right_child()->left_child()->right_child()->left_child());
|
| vp8_partition_aggregator.h | 59 PartitionTreeNode* right_child() const { return children_[kRightChild]; } function in class:webrtc::PartitionTreeNode
|
| /external/grpc-grpc/src/core/lib/iomgr/ |
| timer_heap.cc | 56 uint32_t right_child = left_child + 1; local
57 uint32_t next_i = right_child < length && first[left_child]->deadline >
58 first[right_child]->deadline
59 ? right_child
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/hybrid/core/ops/ |
| stochastic_hard_routing_function_op.cc | 157 int32 right_child = left_child + 1; variable
174 CHECK_LT(right_child, num_nodes);
177 out_path(i, j + 1) = right_child;
178 node = right_child;
|
| hard_routing_function_op.cc | 150 int32 right_child = left_child + 1; variable
162 out_path(i, j + 1) = right_child;
163 node = right_child;
|
| routing_function_op.cc | 124 int32 right_child = left_child + 1; variable
132 out_probs(i, right_child) = prob * (1.0 - left_prob);
|
| routing_gradient_op.cc | 126 int32 right_child = left_child + 1; variable
134 left_prob * routes(i, right_child));
|
| k_feature_gradient_op.cc | 162 int32 right_child = left_child + 1; variable
171 left_prob * routes(i, right_child));
|
| k_feature_routing_function_op.cc | 144 int32 right_child = left_child + 1; variable
152 out_probs(i, right_child) = prob * (1.0f - left_prob);
|
| /external/grpc-grpc/test/core/iomgr/ |
| timer_heap_test.cc | 56 size_t right_child = left_child + 1u; local
60 if (right_child < pq->timer_count) {
61 GPR_ASSERT(pq->timers[i]->deadline <= pq->timers[right_child]->deadline);
|
| /external/deqp-deps/SPIRV-Tools/source/comp/ |
| move_to_front.cpp | 248 bool right_child = true; local
255 right_child = TimestampOf(iter) > TimestampOf(node);
256 iter = right_child ? RightOf(iter) : LeftOf(iter);
263 if (right_child)
|
| /external/swiftshader/third_party/SPIRV-Tools/source/comp/ |
| move_to_front.cpp | 248 bool right_child = true; local
255 right_child = TimestampOf(iter) > TimestampOf(node);
256 iter = right_child ? RightOf(iter) : LeftOf(iter);
263 if (right_child)
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/kernels/ |
| split_handler_ops.cc | 292 auto* right_child = split_info.mutable_right_child(); local
295 state->FillLeaf(best_right_node_stats, right_child);
405 auto* right_child = oblivious_split_info.add_children(); local
408 state->FillLeaf(best_right_node_stats[root_idx], right_child);
674 auto* right_child = split_info.mutable_right_child();
676 state.FillLeaf(best_right_node_stats, right_child);
873 auto* right_child = split_info.mutable_right_child(); local
986 auto* right_child = oblivious_split_info.add_children(); local
[all...] |
| training_ops.cc | 82 if (!(IsLeafWellFormed(split->split_info.right_child()) &&
[all...] |
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| constant_folding.cc | 2832 NodeDef* right_child = node_map_->GetNode(node->input(1)); local
[all...] |
