| /external/webkit/LayoutTests/fast/dom/TreeWalker/ |
| previousSiblingLastChildSkip-expected.txt | 6 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
[all...] |
| traversal-skip-expected.txt | 8 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
[all...] |
| traversal-reject-expected.txt | 8 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
[all...] |
| traversal-skip-most-expected.txt | 8 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'
|
| acceptNode-filter-expected.txt | 8 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
[all...] |
| previousNodeLastChildReject-expected.txt | 6 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
[all...] |
| filter-throw-expected.txt | 8 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
[all...] |
| /external/webkit/LayoutTests/fast/dom/TreeWalker/script-tests/ |
| traversal-reject.js | 3 var walker; variable
26 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
27 shouldBe("walker.nextNode(); walker.currentNode.id", "'A1'");
28 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
29 shouldBe("walker.nextNode(); walker.currentNode.id", "'B3'");
32 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
33 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'")
[all...] |
| acceptNode-filter.js | 3 var walker; variable
17 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
18 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
19 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
22 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, {
31 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
32 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'")
[all...] |
| traversal-skip.js | 3 var walker; variable
26 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false);
27 shouldBe("walker.nextNode(); walker.currentNode.id", "'A1'");
28 shouldBe("walker.nextNode(); walker.currentNode.id", "'C1'");
29 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
30 shouldBe("walker.nextNode(); walker.currentNode.id", "'B3'")
[all...] |
| filter-throw.js | 3 var walker; variable
8 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, function(node) {
14 shouldThrow("walker.firstChild();");
15 shouldBe("walker.currentNode.id", "'root'")
16 shouldThrow("walker.nextNode();walker.currentNode.id");
17 shouldBe("walker.currentNode.id", "'root'")
19 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, {
27 shouldThrow("walker.firstChild();");
28 shouldBe("walker.currentNode.id", "'root'"
[all...] |
| previousNodeLastChildReject.js | 13 var walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false); variable
15 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
16 shouldBe("walker.nextNode(); walker.currentNode.id", "'B1'");
17 shouldBe("walker.nextNode(); walker.currentNode.id", "'C1'");
18 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
19 shouldBe("walker.previousNode(); walker.currentNode.id", "'C1'")
[all...] |
| traversal-skip-most.js | 3 var walker; variable
17 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
18 shouldBe("walker.firstChild(); walker.currentNode.id", "'B1'");
19 shouldBe("walker.nextSibling(); walker.currentNode.id", "'B3'");
22 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
23 walker.currentNode = testElement.querySelectorAll('#B3')[0];
24 shouldBe("walker.previousSibling(); walker.currentNode.id", "'B1'")
[all...] |
| previousSiblingLastChildSkip.js | 13 var walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false); variable
15 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
16 shouldBe("walker.nextNode(); walker.currentNode.id", "'C1'");
17 shouldBe("walker.nextNode(); walker.currentNode.id", "'C2'");
18 shouldBe("walker.nextNode(); walker.currentNode.id", "'D1'");
19 shouldBe("walker.nextNode(); walker.currentNode.id", "'D2'")
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| WalkingIterator.java | 83 * Get the analysis bits for this walker, as defined in the WalkerFactory.
91 AxesWalker walker = m_firstWalker; local
93 while (null != walker)
95 int bit = walker.getAnalysisBits();
97 walker = walker.getNextWalker();
206 * Get the head of the walker list.
208 * @return The head of the walker list, or null
218 * Set the head of the walker list.
220 * @param walker Should be a valid AxesWalker
262 AxesWalker walker = m_firstWalker; local
290 AxesWalker walker = m_firstWalker; local
[all...] |
| AxesWalker.java | 65 * walker in the op map.
101 * Do a deep clone of this walker, including next and previous walkers.
173 * Detaches the walker from the set which it iterated over, releasing
200 * Get the analysis bits for this walker, as defined in the WalkerFactory.
230 XSLMessages.createXPATHMessage(XPATHErrorResources.ER_SETTING_WALKER_ROOT_TO_NULL, null)); //"\n !!!! Error! Setting the root of a walker to null!!!");
256 * Set the next walker in the location step chain.
259 * @param walker Reference to AxesWalker derivative, or may be null.
261 public void setNextWalker(AxesWalker walker)
263 m_nextWalker = walker;
267 * Get the next walker in the location step chain
356 AxesWalker walker = wi().getLastUsedWalker(); local
417 AxesWalker walker; local
[all...] |
| WalkingIteratorSorted.java | 98 AxesWalker walker = m_firstWalker; local
102 for(int i = 0; null != walker; i++)
104 int axis = walker.getAxis();
106 if(walker.isDocOrdered())
114 walker = walker.getNextWalker();
117 boolean isLastWalker = (null == walker.getNextWalker());
120 if(walker.isDocOrdered() && (axis == Axis.DESCENDANT ||
148 // AxesWalker walker = m_firstWalker;
152 // for(int i = 0; null != walker; i++
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
| main.m | 24 // SimpleCTP *walker = [[SimpleCTP alloc] initWithTreeNodeStream:treeStream];
25 // [walker program];
32 // [walker release];
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
| Main.java | 17 LangDumpDecl walker = new LangDumpDecl(nodes); local
18 walker.decl();
|
| main.m | 26 LangDumpDecl walker = new LangDumpDecl(nodes);
27 walker.decl();
50 LangDumpDecl *walker = [LangDumpDecl newLangDumpDecl:nodes];
51 [walker decl];
|
| /external/regex-re2/re2/testing/ |
| null_walker.cc | 7 #include "re2/walker-inl.h"
11 // Null walker. For benchmarking the walker itself.
13 class NullWalker : public Regexp::Walker<bool> {
|
| /external/valgrind/main/memcheck/tests/ |
| vcpu_fbench.stdout.exp | 1 Ready to begin John Walker's floating point accuracy
|
| /external/libusb/ |
| AUTHORS | 17 Rob Walker
|
| /external/regex-re2/re2/ |
| walker-inl.h | 22 template<typename T> class Regexp::Walker {
24 Walker();
25 virtual ~Walker();
95 DISALLOW_EVIL_CONSTRUCTORS(Walker);
98 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re,
104 template<typename T> T Regexp::Walker<T>::PostVisit(Regexp* re,
112 template<typename T> T Regexp::Walker<T>::Copy(T arg) {
132 template<typename T> Regexp::Walker<T>::Walker() {
137 template<typename T> Regexp::Walker<T>::~Walker()
[all...] |
| /external/webkit/Source/WebKit/chromium/public/android/ |
| WebDOMTextContentWalker.h | 46 // Creates a new text content walker centered in the position described by the hit test.
47 // The maximum length of the contents retrieved by the walker is defined by maxLength.
50 // Creates a new text content walker centered in the selected offset of the given text node.
51 // The maximum length of the contents retrieved by the walker is defined by maxLength.
54 // Text content retrieved by the walker.
|
