Home
last modified time | relevance | path

Searched refs:walker (Results 1 – 25 of 70) sorted by relevance

123

/external/webkit/LayoutTests/fast/dom/TreeWalker/
Dtraversal-skip-expected.txt8 PASS walker.nextNode(); walker.currentNode.id is 'A1'
9 PASS walker.nextNode(); walker.currentNode.id is 'C1'
10 PASS walker.nextNode(); walker.currentNode.id is 'B2'
11 PASS walker.nextNode(); walker.currentNode.id is 'B3'
14 PASS walker.firstChild(); walker.currentNode.id is 'A1'
15 PASS walker.firstChild(); walker.currentNode.id is 'C1'
18 PASS walker.firstChild(); walker.currentNode.id is 'A1'
19 PASS walker.firstChild(); walker.currentNode.id is 'B1'
20 PASS walker.nextSibling(); walker.currentNode.id is 'B3'
23 PASS walker.parentNode(); walker.currentNode.id is 'A1'
[all …]
Dtraversal-reject-expected.txt8 PASS walker.nextNode(); walker.currentNode.id is 'A1'
9 PASS walker.nextNode(); walker.currentNode.id is 'B2'
10 PASS walker.nextNode(); walker.currentNode.id is 'B3'
13 PASS walker.firstChild(); walker.currentNode.id is 'A1'
14 PASS walker.firstChild(); walker.currentNode.id is 'B2'
17 PASS walker.firstChild(); walker.currentNode.id is 'A1'
18 PASS walker.firstChild(); walker.currentNode.id is 'B1'
19 PASS walker.nextSibling(); walker.currentNode.id is 'B3'
22 PASS walker.parentNode(); walker.currentNode.id is 'A1'
25 PASS walker.previousSibling(); walker.currentNode.id is 'B1'
[all …]
DacceptNode-filter-expected.txt8 PASS walker.firstChild(); walker.currentNode.id is 'A1'
11 PASS walker.nextNode(); walker.currentNode.id is 'B2'
15 PASS walker.firstChild(); walker.currentNode.id is 'A1'
18 PASS walker.nextNode(); walker.currentNode.id is 'B2'
21 PASS walker.firstChild(); walker.currentNode.id is 'A1'
22 PASS walker.nextNode(); walker.currentNode.id is 'B1'
25 PASS walker.firstChild(); walker.currentNode.id is 'A1'
26 PASS walker.nextNode(); walker.currentNode.id is 'B1'
29 PASS walker.firstChild(); threw exception TypeError: NodeFilter object does not have an acceptNode …
30 PASS walker.currentNode.id; is 'root'
[all …]
DpreviousSiblingLastChildSkip-expected.txt6 PASS walker.firstChild(); walker.currentNode.id is 'A1'
7 PASS walker.nextNode(); walker.currentNode.id is 'C1'
8 PASS walker.nextNode(); walker.currentNode.id is 'C2'
9 PASS walker.nextNode(); walker.currentNode.id is 'D1'
10 PASS walker.nextNode(); walker.currentNode.id is 'D2'
11 PASS walker.nextNode(); walker.currentNode.id is 'B2'
12 PASS walker.previousSibling(); walker.currentNode.id is 'C2'
DpreviousNodeLastChildReject-expected.txt6 PASS walker.firstChild(); walker.currentNode.id is 'A1'
7 PASS walker.nextNode(); walker.currentNode.id is 'B1'
8 PASS walker.nextNode(); walker.currentNode.id is 'C1'
9 PASS walker.nextNode(); walker.currentNode.id is 'B2'
10 PASS walker.previousNode(); walker.currentNode.id is 'C1'
Dfilter-throw-expected.txt8 PASS walker.firstChild(); threw exception filter exception.
9 PASS walker.currentNode.id is 'root'
10 PASS walker.nextNode();walker.currentNode.id threw exception filter exception.
11 PASS walker.currentNode.id is 'root'
14 PASS walker.firstChild(); threw exception filter exception.
15 PASS walker.currentNode.id is 'root'
16 PASS walker.nextNode();walker.currentNode.id threw exception filter exception.
17 PASS walker.currentNode.id is 'root'
Dtraversal-skip-most-expected.txt8 PASS walker.firstChild(); walker.currentNode.id is 'B1'
9 PASS walker.nextSibling(); walker.currentNode.id is 'B3'
12 PASS walker.previousSibling(); walker.currentNode.id is 'B1'
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/
Dbasic.rb39 walker = FlatListWalker::TreeParser.new( nodes )
40 walker.a
41 walker.output.should == "abc, 34"
75 walker = SimpleTreeWalker::TreeParser.new( nodes )
76 walker.a
77 walker.output.should == "abc, 34"
114 walker = FlatVsTreeDecisionWalker::TreeParser.new( nodes )
115 walker.a
116 walker.output.should == "^(a 1)b 2\n"
152 walker = FlatVsTreeDecision2Walker::TreeParser.new( nodes )
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/
Dtree-rewrite.rb1012 walker = FlatListWalker::TreeParser.new( nodes )
1013 result = walker.a
1026 walker = SimpleTreeWalker::TreeParser.new( nodes )
1027 result = walker.a
1040 walker = CombinedRewriteAndAutoWalker::TreeParser.new( nodes )
1041 result = walker.a.tree
1050 walker = CombinedRewriteAndAutoWalker::TreeParser.new( nodes )
1051 result = walker.a.tree
1063 walker = AvoidDupWalker::TreeParser.new( nodes )
1064 result = walker.a
[all …]
/external/apache-xml/src/main/java/org/apache/xpath/axes/
DAxesWalker.java261 public void setNextWalker(AxesWalker walker) in setNextWalker() argument
263 m_nextWalker = walker; in setNextWalker()
284 public void setPrevWalker(AxesWalker walker) in setPrevWalker() argument
286 m_prevWalker = walker; in setPrevWalker()
356 AxesWalker walker = wi().getLastUsedWalker(); in nextNode() local
360 if (null == walker) in nextNode()
363 nextNode = walker.getNextNode(); in nextNode()
368 walker = walker.m_prevWalker; in nextNode()
372 if (walker.acceptNode(nextNode) != DTMIterator.FILTER_ACCEPT) in nextNode()
377 if (null == walker.m_nextWalker) in nextNode()
[all …]
DWalkingIterator.java91 AxesWalker walker = m_firstWalker; in getAnalysisBits() local
93 while (null != walker) in getAnalysisBits()
95 int bit = walker.getAnalysisBits(); in getAnalysisBits()
97 walker = walker.getNextWalker(); in getAnalysisBits()
223 public final void setFirstWalker(AxesWalker walker) in setFirstWalker() argument
225 m_firstWalker = walker; in setFirstWalker()
235 public final void setLastUsedWalker(AxesWalker walker) in setLastUsedWalker() argument
237 m_lastUsedWalker = walker; in setLastUsedWalker()
262 AxesWalker walker = m_firstWalker; in detach() local
263 while (null != walker) in detach()
[all …]
DWalkingIteratorSorted.java98 AxesWalker walker = m_firstWalker; in canBeWalkedInNaturalDocOrderStatic() local
102 for(int i = 0; null != walker; i++) in canBeWalkedInNaturalDocOrderStatic()
104 int axis = walker.getAxis(); in canBeWalkedInNaturalDocOrderStatic()
106 if(walker.isDocOrdered()) in canBeWalkedInNaturalDocOrderStatic()
114 walker = walker.getNextWalker(); in canBeWalkedInNaturalDocOrderStatic()
117 boolean isLastWalker = (null == walker.getNextWalker()); in canBeWalkedInNaturalDocOrderStatic()
120 if(walker.isDocOrdered() && (axis == Axis.DESCENDANT || in canBeWalkedInNaturalDocOrderStatic()
/external/webkit/LayoutTests/fast/dom/TreeWalker/script-tests/
Dtraversal-reject.js3 var walker; variable
26 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
32 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
37 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB2Filter, false);
43 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
44 walker.currentNode = testElement.querySelectorAll('#C1')[0];
48 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB2Filter, false);
49 walker.currentNode = testElement.querySelectorAll('#B3')[0];
53 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
54 walker.currentNode = testElement.querySelectorAll('#B3')[0];
Dtraversal-skip.js3 var walker; variable
26 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false);
33 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false);
38 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB2Filter, false);
44 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false);
45 walker.currentNode = testElement.querySelectorAll('#C1')[0];
49 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB2Filter, false);
50 walker.currentNode = testElement.querySelectorAll('#B3')[0];
54 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false);
55 walker.currentNode = testElement.querySelectorAll('#B3')[0];
DacceptNode-filter.js3 var walker; variable
17 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
22 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, {
35 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, null, false);
41 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, undefined, false);
47 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, {}, false);
55 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, { acceptNode: "foo" }, fal…
65 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
77 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
Dtraversal-skip-most.js3 var walker; variable
17 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
22 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
23 walker.currentNode = testElement.querySelectorAll('#B3')[0];
Dfilter-throw.js3 var walker; variable
8 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, function(node) {
19 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, {
/external/webkit/Source/WebCore/platform/graphics/android/fonts/
DFontAndroid.cpp970 TextRunWalker walker(run, 0, 0, this); in selectionRectForComplexText() local
971 walker.setWordAndLetterSpacing(wordSpacing(), letterSpacing()); in selectionRectForComplexText()
975 int base = walker.rtl() ? walker.widthOfFullRun() : 0; in selectionRectForComplexText()
980 walker.setBackwardsIteration(false); in selectionRectForComplexText()
986 while (walker.nextScriptRun() && (fromX == -1 || toX == -1)) { in selectionRectForComplexText()
990 walker.setXOffsetToZero(); in selectionRectForComplexText()
992 if (walker.rtl()) in selectionRectForComplexText()
993 base -= walker.width(); in selectionRectForComplexText()
995 int numCodePoints = static_cast<int>(walker.numCodePoints()); in selectionRectForComplexText()
1000 int glyph = walker.logClusters()[from]; in selectionRectForComplexText()
[all …]
/external/antlr/antlr-3.4/runtime/Python/tests/
Dt047treeparser.py66 walker = self.getWalker(nodes)
67 walker.program()
73 walker.traces,
115 walker = self.getWalker(nodes)
116 r = walker.variable()
/external/apache-xml/src/main/java/org/apache/xalan/templates/
DElemTemplateElement.java1342 Node walker = getParentNode(), prev = null; in getPreviousSibling() local
1344 if (walker != null) in getPreviousSibling()
1345 for (walker = walker.getFirstChild(); walker != null; in getPreviousSibling()
1346 prev = walker, walker = walker.getNextSibling()) in getPreviousSibling()
1348 if (walker == this) in getPreviousSibling()
1367 ElemTemplateElement walker = getParentNodeElem(); in getPreviousSiblingElem() local
1370 if (walker != null) in getPreviousSiblingElem()
1371 for (walker = walker.getFirstChildElem(); walker != null; in getPreviousSiblingElem()
1372 prev = walker, walker = walker.getNextSiblingElem()) in getPreviousSiblingElem()
1374 if (walker == this) in getPreviousSiblingElem()
DRedundentExprEliminator.java453 AxesWalker walker = wi.getFirstWalker(); in changePartToRef() local
456 assertion(null != walker, "Walker should not be null!"); in changePartToRef()
457 walker = walker.getNextWalker(); in changePartToRef()
460 if(null != walker) in changePartToRef()
466 few.setNextWalker(walker); in changePartToRef()
467 walker.setPrevWalker(few); in changePartToRef()
492 AxesWalker walker = (AxesWalker)wi.getFirstWalker().clone(); in createIteratorFromSteps() local
493 newIter.setFirstWalker(walker); in createIteratorFromSteps()
494 walker.setLocPathIterator(newIter); in createIteratorFromSteps()
497 AxesWalker next = (AxesWalker)walker.getNextWalker().clone(); in createIteratorFromSteps()
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/
Dmain.m26 LangDumpDecl walker = new LangDumpDecl(nodes);
27 walker.decl();
50 LangDumpDecl *walker = [LangDumpDecl newLangDumpDecl:nodes];
51 [walker decl];
DMain.java17 LangDumpDecl walker = new LangDumpDecl(nodes); in main() local
18 walker.decl(); in main()
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/
Dmain.m24 // SimpleCTP *walker = [[SimpleCTP alloc] initWithTreeNodeStream:treeStream];
25 // [walker program];
32 // [walker release];
/external/clang/lib/StaticAnalyzer/Checkers/
DVirtualCallChecker.cpp218 WalkAST walker(BR, mgr.getAnalysisDeclContext(RD)); in checkASTDecl() local
225 walker.Visit(Body); in checkASTDecl()
226 walker.Execute(); in checkASTDecl()
233 walker.Visit(Body); in checkASTDecl()
234 walker.Execute(); in checkASTDecl()

123