Home
last modified time | relevance | path

Searched refs:left_id (Results 1 – 16 of 16) sorted by relevance

/external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/
Ddecision_tree.cc45 ? split.left_id() in Traverse()
61 ? split.left_id() in Traverse()
76 ? split.left_id() in Traverse()
87 : split.left_id(); in Traverse()
99 node_id = split.left_id(); in Traverse()
218 return {split.left_id(), split.right_id()}; in GetChildren()
222 return {split.left_id(), split.right_id()}; in GetChildren()
227 return {split.left_id(), split.right_id()}; in GetChildren()
231 return {split.left_id(), split.right_id()}; in GetChildren()
235 return {split.left_id(), split.right_id()}; in GetChildren()
Ddecision_tree_test.cc69 EXPECT_EQ(3, split->left_id()); in TestLinkChildrenBinary()
/external/tensorflow/tensorflow/core/kernels/boosted_trees/
Dresources.cc65 ? split.left_id() in next_node()
72 ? split.left_id() in next_node()
185 int32 BoostedTreesEnsembleResource::left_id(const int32 tree_id, in left_id() function in tensorflow::BoostedTreesEnsembleResource
189 return node.bucketized_split().left_id(); in left_id()
384 old_to_new_ids[node.bucketized_split().left_id()]); in PostPruneTree()
419 const int32 left_id = node.bucketized_split().left_id(); in IsTerminalSplitNode() local
421 return is_leaf(tree_id, left_id) && is_leaf(tree_id, right_id); in IsTerminalSplitNode()
454 RecursivelyDoPostPrunePreparation(tree_id, node->bucketized_split().left_id(), in RecursivelyDoPostPrunePreparation()
465 const int32 left_id = node->bucketized_split().left_id(); in RecursivelyDoPostPrunePreparation() local
469 nodes_to_delete->push_back(left_id); in RecursivelyDoPostPrunePreparation()
[all …]
Dboosted_trees.proto68 int32 left_id = 3; field
80 int32 left_id = 3; field
93 int32 left_id = 3; field
Dresources.h98 int32 left_id(const int32 tree_id, const int32 node_id) const;
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/testutil/
Drandom_tree_gen.cc100 const int left_id = split->left_id(); in Generate() local
102 GenerateSplit(&node, left_id, right_id); in Generate()
172 split->set_left_id(shift + split->left_id()); in ShiftNodeIndex()
178 void RandomTreeGen::GenerateSplit(TreeNode* node, int left_id, int right_id) { in GenerateSplit() argument
205 split->set_left_id(left_id); in GenerateSplit()
Drandom_tree_gen.h65 void GenerateSplit(boosted_trees::trees::TreeNode* node, int left_id,
/external/autotest/scheduler/
Dquery_managers.py237 left_id, right_id = int(row[0]), int(row[1])
239 left_id, right_id = right_id, left_id
240 result.setdefault(left_id, set()).add(right_id)
/external/tensorflow/tensorflow/contrib/boosted_trees/proto/
Dtree_config.proto68 int32 left_id = 3; field
91 int32 left_id = 3; field
105 int32 left_id = 3; field
/external/tensorflow/tensorflow/core/kernels/tensor_forest/
Dresources.cc54 current_id = split.left_id(); in TraverseTree()
/external/tensorflow/tensorflow/contrib/boosted_trees/estimator_batch/
Dcustom_export_strategy.py210 node.left_child_id.value = split.left_id
/external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/
Dmodel_ops_test.py71 split.left_id = l_id
Dprediction_ops_test.py93 split.left_id = l_id
127 split.left_id = l_id
/external/tensorflow/tensorflow/contrib/boosted_trees/kernels/
Dtraining_ops.cc735 int32 left_id = tree_config->nodes_size(); in SplitTreeNode() local
748 {left_id, right_id}, split->split_info.mutable_split_node()); in SplitTreeNode()
/external/python/cpython3/Modules/
D_ssl.c4897 const unsigned char *left_id, *right_id; in PySSLSession_richcompare() local
4899 left_id = SSL_SESSION_get_id(((PySSLSession *)left)->session, in PySSLSession_richcompare()
4904 result = memcmp(left_id, right_id, left_len); in PySSLSession_richcompare()
/external/tensorflow/tensorflow/contrib/boosted_trees/python/training/functions/
Dgbdt_batch_test.py78 split.left_id = l_id