| /external/antlr/runtime/ObjC/Framework/test/runtime/TestRewriteRuleTokenStream/ |
| D | TestRewriteRuleTokenStream.m | 111 CommonTree *tree1, *tree2;
115 STAssertNoThrow(tree2 = [stream nextNode],
118 STAssertEqualObjects([tree1 getToken], [tree2 getToken],
120 STAssertFalse(tree1 == tree2,
129 CommonTree *tree1, *tree2, *tree3, *tree4;
136 STAssertNoThrow(tree2 = [stream nextNode],
139 STAssertEqualObjects([tree2 getToken], token2,
140 @"[tree2 token] should be equal to token2"
158 CommonTree *tree1, *tree2, *tree3;
167 STAssertNoThrow(tree2 = [stream nextNode],
[all …]
|
| /external/libxml2/doc/examples/ |
| D | Makefile.am | 46 tree2.res \
65 tree2 \ program
93 tree2_SOURCES = tree2.c
130 @$(CHECKER) ./tree2 > tree2.tmp && diff tree2.tmp $(srcdir)/tree2.res
|
| /external/antlr/runtime/Ruby/test/unit/ |
| D | test-tree-wizard.rb | 451 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/ |
| D | BVAlgorithms.h | 93 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/ |
| D | diff.test | 31 mkdir -p tree1 tree2
33 echo food > tree2/file
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_schedule_tree.c | 552 __isl_take isl_schedule_tree *tree2) in isl_schedule_tree_from_pair() argument
557 if (!tree1 || !tree2) in isl_schedule_tree_from_pair()
568 if (isl_schedule_tree_get_type(tree2) == type) { in isl_schedule_tree_from_pair()
571 children = isl_schedule_tree_list_copy(tree2->children); in isl_schedule_tree_from_pair()
573 isl_schedule_tree_free(tree2); in isl_schedule_tree_from_pair()
575 list = isl_schedule_tree_list_add(list, tree2); in isl_schedule_tree_from_pair()
581 isl_schedule_tree_free(tree2); in isl_schedule_tree_from_pair()
592 __isl_take isl_schedule_tree *tree2) in isl_schedule_tree_sequence_pair() argument
595 tree1, tree2); in isl_schedule_tree_sequence_pair()
605 __isl_take isl_schedule_tree *tree2) in isl_schedule_tree_set_pair() argument
[all …]
|
| D | isl_schedule_tree.h | 83 __isl_keep isl_schedule_tree *tree2);
110 __isl_take isl_schedule_tree *tree2);
113 __isl_take isl_schedule_tree *tree2);
116 __isl_take isl_schedule_tree *tree2);
221 __isl_take isl_schedule_tree *tree2);
|
| D | isl_schedule.c | 600 isl_schedule_tree *tree1, *tree2; in isl_schedule_pair() local
618 tree2 = isl_schedule_tree_copy(schedule2->root); in isl_schedule_pair()
619 filter2 = isl_schedule_tree_domain_get_domain(tree2); in isl_schedule_pair()
638 tree2 = insert_filter_in_child_of_type(tree2, filter2, type); in isl_schedule_pair()
640 tree1 = isl_schedule_tree_from_pair(type, tree1, tree2); in isl_schedule_pair()
|
| D | isl_schedule_node.c | 4549 isl_schedule_tree *tree1, *tree2; in isl_schedule_node_order_before_or_after() local
4589 tree2 = isl_schedule_node_get_tree(node2); in isl_schedule_node_order_before_or_after()
4591 tree2 = isl_schedule_tree_insert_filter(tree2, filter); in isl_schedule_node_order_before_or_after()
4595 tree1 = isl_schedule_tree_sequence_pair(tree2, tree1); in isl_schedule_node_order_before_or_after()
4598 tree1 = isl_schedule_tree_sequence_pair(tree1, tree2); in isl_schedule_node_order_before_or_after()
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
| D | RewriteRuleXxxxStreamFixture.cs | 288 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/fonttools/Tests/misc/ |
| D | plistlib_test.py | 433 tree2 = plistlib.totree(pl, use_builtin_types=use_builtin_types)
434 assert tree.tag == tree2.tag == "dict"
435 for (_, e1), (_, e2) in zip(etree.iterwalk(tree), etree.iterwalk(tree2)):
|
| /external/libxml2/ |
| D | .gitignore | 48 doc/examples/tree2
|
| D | ChangeLog | 5271 * doc/examples/tree2.c, doc/examples/xpath1.c, doc/examples/xpath2.c:
8415 * doc/examples/*: added tree2 example from Lucas Brasilino
|