| /external/tensorflow/tensorflow/contrib/boosted_trees/proto/ |
| split_info.proto | 15 tensorflow.boosted_trees.trees.Leaf left_child = 2;
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/ |
| split_handler_ops_test.py | 82 left_child = split_info.left_child.vector
88 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
99 left_child = split_info.left_child.vector
104 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
140 left_child = split_info.left_child.vector
145 self.assertEqual(2, len(left_child.value))
231 left_child = split_info.left_child.vecto
[all...] |
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator_unittest.cc | 37 ASSERT_TRUE(NULL != root->left_child());
39 EXPECT_EQ(3u, root->left_child()->this_size());
42 EXPECT_FALSE(root->left_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 | 58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; } function in class:webrtc::PartitionTreeNode
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/batch/ |
| categorical_split_handler_test.py | 119 left_child = split_info.left_child.vector
131 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
149 left_child = split_info.left_child.vector
154 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
224 left_child = split_info.left_child.vector
228 self.assertEqual(2, len(left_child.value))
233 left_child = split_info.left_child.vecto
[all...] |
| ordinal_split_handler_test.py | 139 left_child = split_info.left_child.vector
146 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
168 left_child = split_info.left_child.vector
173 self.assertAllClose([expected_left_weight], left_child.value, 0.00001)
257 left_child = split_info.left_child.vector
262 self.assertEqual(2, len(left_child.value))
343 left_child = split_info.left_child.vecto
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/ |
| debug_fn_imps.hpp | 60 if (left_child(i) < m_size)
61 PB_DS_DEBUG_VERIFY(!entry_cmp::operator()(m_a_entries[i], m_a_entries[left_child(i)]));
63 PB_DS_DEBUG_VERIFY(parent(left_child(i)) == i);
|
| find_fn_imps.hpp | 66 left_child(size_type i) function in class:PB_DS_CLASS_C_DEC
|
| insert_fn_imps.hpp | 132 const size_type lchild_i = left_child(i);
|
| binary_heap_.hpp | 248 left_child(size_type);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binary_heap_/ |
| debug_fn_imps.hpp | 60 if (left_child(i) < m_size)
61 PB_DS_DEBUG_VERIFY(!entry_cmp::operator()(m_a_entries[i], m_a_entries[left_child(i)]));
63 PB_DS_DEBUG_VERIFY(parent(left_child(i)) == i);
|
| find_fn_imps.hpp | 66 left_child(size_type i) function in class:PB_DS_CLASS_C_DEC
|
| insert_fn_imps.hpp | 132 const size_type lchild_i = left_child(i);
|
| binary_heap_.hpp | 248 left_child(size_type);
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/hybrid/core/ops/ |
| hard_routing_function_op.cc | 149 int32 left_child = 2 * node + 1; variable
150 int32 right_child = left_child + 1;
158 out_path(i, j + 1) = left_child;
159 node = left_child;
|
| stochastic_hard_routing_function_op.cc | 156 int32 left_child = 2 * node + 1; variable
157 int32 right_child = left_child + 1;
166 CHECK_LT(left_child, num_nodes);
169 out_path(i, j + 1) = left_child;
170 node = left_child;
|
| k_feature_routing_function_op.cc | 143 int32 left_child = 2 * j + 1; variable
144 int32 right_child = left_child + 1;
151 out_probs(i, left_child) = prob * left_prob;
|
| routing_function_op.cc | 123 int32 left_child = 2 * j + 1; variable
124 int32 right_child = left_child + 1;
131 out_probs(i, left_child) = prob * left_prob;
|
| routing_gradient_op.cc | 125 int32 left_child = 2 * j + 1; variable
126 int32 right_child = left_child + 1;
133 out(i, j) = (right_prob * routes(i, left_child) +
|
| k_feature_gradient_op.cc | 161 int32 left_child = 2 * j + 1; variable
162 int32 right_child = left_child + 1;
170 routes_grad(i, j) = (right_prob * routes(i, left_child) +
|
| stochastic_hard_routing_gradient_op.cc | 201 int32 left_child = 2 * j + 1; variable
210 if (path(i, j - 1) == left_child) {
|
| /toolchain/binutils/binutils-2.27/gas/config/ |
| bfin-defs.h | 313 Expr_Node *Left_Child;
321 Expr_Node *Left_Child,
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/kernels/ |
| split_handler_ops.cc | 227 auto* left_child = split_info.mutable_left_child(); variable
230 FillLeaf(class_id, best_left_node_stats, left_child);
499 auto* left_child = split_info.mutable_left_child();
501 FillLeaf(class_id, best_left_node_stats, left_child);
635 auto* left_child = split_info.mutable_left_child(); variable
637 FillLeaf(class_id, best_left_node_stats, left_child);
|
| /toolchain/binutils/binutils-2.27/gprof/ |
| cg_print.c | 229 Sym *left_child = left->child;
238 print_name (left_child);
240 left->count, left_child->ncalls);
250 if (left_parent == left_child)
256 if (left_parent->cg.cyc.num != 0 && left_child->cg.cyc.num != 0
257 && left_parent->cg.cyc.num == left_child->cg.cyc.num)
228 Sym *left_child = left->child; local
[all...] |
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| constant_folding.cc | 1610 NodeDef* left_child = node_map_->GetNode(node->input(0)); local
[all...] |
