Home
last modified time | relevance | path

Searched refs:tree2 (Results 1 – 11 of 11) sorted by relevance

/external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/
Dprediction_ops_test.py258 tree2 = tree_ensemble_config.trees.add()
260 _set_float_split(tree2.nodes.add().dense_float_binary_split, 0, 9.0, 1, 2)
261 _set_float_split(tree2.nodes.add()
264 _append_to_leaf(tree2.nodes.add().leaf, 0, 0.5)
265 _append_to_leaf(tree2.nodes.add().leaf, 0, 1.2)
266 _set_categorical_id_split(tree2.nodes.add().categorical_id_binary_split,
268 _append_to_leaf(tree2.nodes.add().leaf, 0, -0.9)
269 _append_to_leaf(tree2.nodes.add().leaf, 0, 0.7)
307 tree2 = tree_ensemble_config.trees.add()
312 tree2.nodes.add().sparse_float_binary_split_default_right.split,
[all …]
Dmodel_ops_test.py145 tree2 = tree_ensemble_config.trees.add()
147 _set_float_split(tree2.nodes.add()
150 _set_float_split(tree2.nodes.add().dense_float_binary_split, 0, 9.0, 3,
152 _append_to_leaf(tree2.nodes.add().leaf, 0, 0.5)
153 _append_to_leaf(tree2.nodes.add().leaf, 1, 1.2)
154 _append_to_leaf(tree2.nodes.add().leaf, 0, -0.9)
234 tree2 = tree_ensemble_config.trees.add()
236 _append_to_leaf(tree2.nodes.add().leaf, 0, -1.0)
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/models/
Dmultiple_additive_trees_test.cc77 auto* tree2 = tree_ensemble_config.add_trees(); in TEST_F() local
78 auto* dense_split = tree2->add_nodes()->mutable_dense_float_binary_split(); in TEST_F()
83 auto* leaf1 = tree2->add_nodes()->mutable_leaf()->mutable_sparse_vector(); in TEST_F()
86 auto* leaf2 = tree2->add_nodes()->mutable_leaf()->mutable_sparse_vector(); in TEST_F()
150 auto* tree2 = tree_ensemble_config.add_trees(); in TEST_F() local
151 auto* dense_split = tree2->add_nodes()->mutable_dense_float_binary_split(); in TEST_F()
156 auto* leaf1 = tree2->add_nodes()->mutable_leaf()->mutable_sparse_vector(); in TEST_F()
159 auto* leaf2 = tree2->add_nodes()->mutable_leaf()->mutable_sparse_vector(); in TEST_F()
233 auto* tree2 = tree_ensemble_config.add_trees(); in TEST_F() local
234 auto* dense_split = tree2->add_nodes()->mutable_dense_float_binary_split(); in TEST_F()
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/TestRewriteRuleTokenStream/
DTestRewriteRuleTokenStream.m111 ANTLRCommonTree *tree1, *tree2;
115 STAssertNoThrow(tree2 = [stream nextNode],
118 STAssertEqualObjects([tree1 getToken], [tree2 getToken],
120 STAssertFalse(tree1 == tree2,
129 ANTLRCommonTree *tree1, *tree2, *tree3, *tree4;
136 STAssertNoThrow(tree2 = [stream nextNode],
139 STAssertEqualObjects([tree2 getToken], token2,
140 @"[tree2 token] should be equal to token2"
158 ANTLRCommonTree *tree1, *tree2, *tree3;
167 STAssertNoThrow(tree2 = [stream nextNode],
[all …]
/external/libxml2/doc/examples/
DMakefile.am46 tree2.res \
65 tree2 \ program
93 tree2_SOURCES = tree2.c
130 @$(CHECKER) ./tree2 > tree2.tmp && diff tree2.tmp $(srcdir)/tree2.res
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
Dtest-tree-wizard.rb451 tree2 = @wizard.create("(A B C)")
452 assert @wizard.equals(tree1, tree2)
458 tree2 = @wizard.create("(A B[foo] C)")
459 assert @wizard.equals(tree1, tree2)
465 tree2 = @wizard.create("(A B C)")
466 assert( !(@wizard.equals(tree1, tree2)) )
472 tree2 = @wizard.create("(A B A)")
473 assert( !(@wizard.equals(tree1, tree2)) )
478 tree2 = @wizard.create("(A B)")
479 assert( !(@wizard.equals(tree1, tree2)) )
/external/eigen/unsupported/Eigen/src/BVH/
DBVAlgorithms.h93 void BVIntersect(const BVH1 &tree1, const BVH2 &tree2, Intersector &intersector) //TODO: tandem des… in BVIntersect() argument
109 …std::vector<std::pair<Index1, Index2> > todo(1, std::make_pair(tree1.getRootIndex(), tree2.getRoot… in BVIntersect()
113 tree2.getChildren(todo.back().second, vBegin2, vEnd2, oBegin2, oEnd2); in BVIntersect()
119 if(intersector.intersectVolumeVolume(vol1, tree2.getVolume(*vCur2))) in BVIntersect()
133 if(internal::intersect_helper(tree2, helper, *vCur2)) in BVIntersect()
235 typename Minimizer::Scalar BVMinimize(const BVH1 &tree1, const BVH2 &tree2, Minimizer &minimizer) in BVMinimize() argument
255 todo.push(std::make_pair(Scalar(), std::make_pair(tree1.getRootIndex(), tree2.getRootIndex()))); in BVMinimize()
259 tree2.getChildren(todo.top().second.second, vBegin2, vEnd2, oBegin2, oEnd2); in BVMinimize()
269 minimum = (std::min)(minimum, internal::minimize_helper(tree2, helper, *vCur2, minimum)); in BVMinimize()
282 Scalar val = minimizer.minimumOnVolumeVolume(vol1, tree2.getVolume(*vCur2)); in BVMinimize()
/external/toybox/tests/
Ddiff.test26 mkdir -p tree1 tree2
28 echo food > tree2/file
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
DRewriteRuleXxxxStreamFixture.cs288 ITree tree2 = CreateTree(token2); in CheckRRSubtreeStreamBehaviourWithElements()
290 subtreeTest.Add(tree2); in CheckRRSubtreeStreamBehaviourWithElements()
343 ITree tree2 = CreateTree(token2); in CheckRRNodeStreamBehaviourWithElements()
345 nodeTest.Add(tree2); in CheckRRNodeStreamBehaviourWithElements()
/external/libxml2/
D.gitignore45 doc/examples/tree2
DChangeLog5271 * doc/examples/tree2.c, doc/examples/xpath1.c, doc/examples/xpath2.c:
8415 * doc/examples/*: added tree2 example from Lucas Brasilino