Home
last modified time | relevance | path

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

/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/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/opencv/cv/src/
Dcvmatchcontours.cpp223 cvMatchContourTrees( const CvContourTree* tree1, const CvContourTree* tree2, in cvMatchContourTrees() argument
241 if( !tree1 || !tree2 ) in cvMatchContourTrees()
250 if( !CV_IS_SEQ_POLYGON_TREE( tree2 )) in cvMatchContourTrees()
254 lpt2 = tree2->total; in cvMatchContourTrees()
265 cvStartReadSeq( (CvSeq *) tree2, &reader2, 0 ); in cvMatchContourTrees()
/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/opencv/cv/include/
Dcv.h775 const CvContourTree* tree2, in LOAD_CHDL()
/external/chromium_org/third_party/libxml/src/
DChangeLog5271 * doc/examples/tree2.c, doc/examples/xpath1.c, doc/examples/xpath2.c:
8415 * doc/examples/*: added tree2 example from Lucas Brasilino
/external/chromium_org/third_party/WebKit/PerformanceTests/Parser/resources/
Dfinal-url-en15024 http://rmhh.co.uk/tree2/individual.php?pid=ID.288