| /external/chromium_org/ui/accessibility/ |
| ax_generated_tree_unittest.cc | 111 // Build the second tree, tree1.
112 AXSerializableTree tree1; local
113 generator.BuildUniqueTree(j, &tree1);
114 SCOPED_TRACE("tree1 is " + TreeToString(tree0));
136 // Next, pretend that tree0 turned into tree1, and serialize
139 tree1.CreateTreeSource());
145 serializer.SerializeChanges(tree1.GetFromId(id), &update);
150 // identical to |tree1|.
151 EXPECT_EQ(TreeToString(tree1), TreeToString(dst_tree));
|
| /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/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/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_org/chrome/browser/extensions/api/automation/ |
| automation_apitest.cc | 270 // Reset tree1 to a new generated tree based on tree1_version, reset
273 tree1.reset(new ui::AXSerializableTree);
274 tree1_source.reset(tree1->CreateTreeSource());
275 generator.BuildUniqueTree(tree1_version, tree1.get());
280 // Reset tree1, set up serializer1, send down the initial tree data to create
286 SendDataForTree(tree1.get(), serializer1.get(), kTab1Rid, browser_context);
299 // Tree infrastructure; tree0 and tree1 need to be regenerated whenever
302 scoped_ptr<ui::AXSerializableTree> tree0, tree1; member in class:extensions::TreeSerializationState
316 // the requested tab - tab 1 always has tree1, and tab 0 starts with tree0
317 // and then has a series of updates intended to translate tree0 to tree1
[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...] |
