HomeSort by relevance Sort by last modified time
    Searched full:right_child (Results 1 - 25 of 29) sorted by null

1 2

  /external/tensorflow/tensorflow/contrib/boosted_trees/proto/
split_info.proto 18 tensorflow.boosted_trees.trees.Leaf right_child = 3;
  /external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/
split_handler_ops_test.py 83 right_child = split_info.right_child.vector
89 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
100 right_child = split_info.right_child.vector
105 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
141 right_child = split_info.right_child.vector
146 self.assertEqual(2, len(right_child.value))
232 right_child = split_info.right_child.vecto
    [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/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/batch/
categorical_split_handler_test.py 120 right_child = split_info.right_child.vector
133 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
150 right_child = split_info.right_child.vector
156 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
225 right_child = split_info.right_child.vector
229 self.assertEqual(2, len(right_child.value))
234 right_child = split_info.right_child.vecto
    [all...]
ordinal_split_handler_test.py 140 right_child = split_info.right_child.vector
148 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
169 right_child = split_info.right_child.vector
175 self.assertAllClose([expected_right_weight], right_child.value, 0.00001)
258 right_child = split_info.right_child.vector
263 self.assertEqual(2, len(right_child.value))
344 right_child = split_info.right_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 65 if (right_child(i) < m_size)
66 PB_DS_DEBUG_VERIFY(!entry_cmp::operator()(m_a_entries[i], m_a_entries[right_child(i)]));
68 PB_DS_DEBUG_VERIFY(parent(right_child(i)) == i);
find_fn_imps.hpp 72 right_child(size_type i) function in class:PB_DS_CLASS_C_DEC
insert_fn_imps.hpp 133 const size_type rchild_i = right_child(i);
binary_heap_.hpp 251 right_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 65 if (right_child(i) < m_size)
66 PB_DS_DEBUG_VERIFY(!entry_cmp::operator()(m_a_entries[i], m_a_entries[right_child(i)]));
68 PB_DS_DEBUG_VERIFY(parent(right_child(i)) == i);
find_fn_imps.hpp 72 right_child(size_type i) function in class:PB_DS_CLASS_C_DEC
insert_fn_imps.hpp 133 const size_type rchild_i = right_child(i);
binary_heap_.hpp 251 right_child(size_type);
  /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;
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);
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));
  /toolchain/binutils/binutils-2.27/gas/config/
bfin-defs.h 314 Expr_Node *Right_Child;
322 Expr_Node *Right_Child);
  /external/tensorflow/tensorflow/contrib/boosted_trees/kernels/
split_handler_ops.cc 228 auto* right_child = split_info.mutable_right_child(); variable
231 FillLeaf(class_id, best_right_node_stats, right_child);
500 auto* right_child = split_info.mutable_right_child();
502 FillLeaf(class_id, best_right_node_stats, right_child);
636 auto* right_child = split_info.mutable_right_child(); variable
638 FillLeaf(class_id, best_right_node_stats, right_child);
  /toolchain/binutils/binutils-2.27/gprof/
cg_print.c 231 Sym *right_child = right->child;
244 print_name (right_child);
246 right->count, right_child->ncalls);
253 if (right_parent == right_child)
260 if (right_parent->cg.cyc.num != 0 && right_child->cg.cyc.num != 0
261 && right_parent->cg.cyc.num == right_child->cg.cyc.num)
281 if (right_parent->cg.cyc.num != 0 && right_child->cg.cyc.num != 0
282 && right_parent->cg.cyc.num == right_child->cg.cyc.num)
230 Sym *right_child = right->child; local
    [all...]
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/util/
move_to_front.h 617 bool right_child; local
624 right_child = TimestampOf(iter) > TimestampOf(node);
625 iter = right_child ? RightOf(iter) : LeftOf(iter);
632 if (right_child)
  /external/tensorflow/tensorflow/core/grappler/optimizers/
constant_folding.cc 1611 NodeDef* right_child = node_map_->GetNode(node->input(1)); local
    [all...]

Completed in 1431 milliseconds

1 2