HomeSort by relevance Sort by last modified time
    Searched full:tree1 (Results 1 - 10 of 10) sorted by null

  /external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/TestRewriteRuleTokenStream/
TestRewriteRuleTokenStream.m 111 ANTLRCommonTree *tree1, *tree2;
112 STAssertNoThrow(tree1 = [stream nextNode],
118 STAssertEqualObjects([tree1 getToken], [tree2 getToken],
120 STAssertFalse(tree1 == tree2,
129 ANTLRCommonTree *tree1, *tree2, *tree3, *tree4;
130 STAssertNoThrow(tree1 = [stream nextNode],
133 STAssertEqualObjects([tree1 getToken], token1,
134 @"[tree1 token] should be equal to token1"
158 ANTLRCommonTree *tree1, *tree2, *tree3;
161 STAssertNoThrow(tree1 = [stream nextNode]
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/test/unit/
test-tree-wizard.rb 450 tree1 = @wizard.create("(A B C)")
452 assert @wizard.equals(tree1, tree2)
457 tree1 = @wizard.create("(A B[foo] C)")
459 assert @wizard.equals(tree1, tree2)
464 tree1 = @wizard.create("(A B[foo] C)")
466 assert( !(@wizard.equals(tree1, tree2)) )
471 tree1 = @wizard.create("(A B C)")
473 assert( !(@wizard.equals(tree1, tree2)) )
477 tree1 = @wizard.create("(A B C)")
479 assert( !(@wizard.equals(tree1, tree2))
    [all...]
  /external/eigen/unsupported/Eigen/src/BVH/
BVAlgorithms.h 93 void BVIntersect(const BVH1 &tree1, const BVH2 &tree2, Intersector &intersector) //TODO: tandem descent when it makes sense
109 std::vector<std::pair<Index1, Index2> > todo(1, std::make_pair(tree1.getRootIndex(), tree2.getRootIndex()));
112 tree1.getChildren(todo.back().first, vBegin1, vEnd1, oBegin1, oEnd1);
117 const typename BVH1::Volume &vol1 = tree1.getVolume(*vBegin1);
125 if(internal::intersect_helper(tree1, helper, *vBegin1))
235 typename Minimizer::Scalar BVMinimize(const BVH1 &tree1, const BVH2 &tree2, Minimizer &minimizer)
255 todo.push(std::make_pair(Scalar(), std::make_pair(tree1.getRootIndex(), tree2.getRootIndex())));
258 tree1.getChildren(todo.top().second.first, vBegin1, vEnd1, oBegin1, oEnd1);
274 const typename BVH1::Volume &vol1 = tree1.getVolume(*vBegin1);
278 minimum = (std::min)(minimum, internal::minimize_helper(tree1, helper, *vBegin1, minimum))
    [all...]
  /external/opencv/cv/src/
cvmatchcontours.cpp 215 // tree1 - pointer to the first input contour tree object.
223 cvMatchContourTrees( const CvContourTree* tree1, const CvContourTree* tree2,
241 if( !tree1 || !tree2 )
247 if( !CV_IS_SEQ_POLYGON_TREE( tree1 ))
253 lpt1 = tree1->total;
264 cvStartReadSeq( (CvSeq *) tree1, &reader1, 0 );
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
RewriteRuleXxxxStreamFixture.cs 260 ITree tree1 = CreateTree(token1);
263 subtreeTest.Add(tree1);
268 Assert.AreEqual(tree1, (ITree) subtreeTest.NextNode(),
314 ITree tree1 = CreateTree(token1);
317 nodeTest.Add(tree1);
323 Assert.AreEqual(tree1.Type, returnedTree.Type,
  /external/chromium/chrome/browser/accessibility/
browser_accessibility_manager_unittest.cc 200 // Construct a BrowserAccessibilityManager with tree1.
403 // Construct a BrowserAccessibilityManager with tree1.
524 // Construct a BrowserAccessibilityManager with tree1.
  /external/chromium_org/content/browser/accessibility/
browser_accessibility_manager_unittest.cc 221 // Construct a BrowserAccessibilityManager with tree1.
392 // Construct a BrowserAccessibilityManager with tree1.
523 // Construct a BrowserAccessibilityManager with tree1.
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
Antlr.Runtime.Tree.Tests.pas     [all...]
  /ndk/sources/host-tools/sed-4.2.1/lib/
regcomp.c 1325 bin_tree_t *op, *cls, *tree1, *tree; local
    [all...]
  /external/opencv/cv/include/
cv.h     [all...]

Completed in 289 milliseconds