| /external/webkit/LayoutTests/fast/dom/TreeWalker/ |
| previousSiblingLastChildSkip-expected.txt | 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'
|
| previousNodeLastChildReject-expected.txt | 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'
|
| acceptNode-filter-expected.txt | 11 PASS walker.nextNode(); walker.currentNode.id is 'B2'
18 PASS walker.nextNode(); walker.currentNode.id is 'B2'
22 PASS walker.nextNode(); walker.currentNode.id is 'B1'
26 PASS walker.nextNode(); walker.currentNode.id is 'B1'
31 PASS walker.nextNode(); threw exception TypeError: NodeFilter object does not have an acceptNode function.
37 PASS walker.nextNode(); threw exception TypeError: NodeFilter object does not have an acceptNode function.
42 PASS walker.nextNode(); walker.currentNode.id is 'B1'
|
| traversal-skip-expected.txt | 7 Testing nextNode
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'
|
| traversal-reject-expected.txt | 7 Testing nextNode
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'
|
| filter-throw-expected.txt | 10 PASS walker.nextNode();walker.currentNode.id threw exception filter exception.
16 PASS walker.nextNode();walker.currentNode.id threw exception filter exception.
|
| TreeWalker-currentNode-expected.txt | 16 PASS w.nextNode() is document.documentElement.firstChild
31 PASS w.nextNode() is subTree
|
| /external/webkit/LayoutTests/fast/dom/TreeWalker/script-tests/ |
| previousSiblingLastChildSkip.js | 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'");
20 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
|
| previousNodeLastChildReject.js | 16 shouldBe("walker.nextNode(); walker.currentNode.id", "'B1'");
17 shouldBe("walker.nextNode(); walker.currentNode.id", "'C1'");
18 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
|
| acceptNode-filter.js | 19 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
32 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
38 shouldBe("walker.nextNode(); walker.currentNode.id", "'B1'");
44 shouldBe("walker.nextNode(); walker.currentNode.id", "'B1'");
51 shouldThrow("walker.nextNode();");
59 shouldThrow("walker.nextNode();");
68 shouldBe("walker.nextNode(); walker.currentNode.id", "'B1'");
|
| filter-throw.js | 16 shouldThrow("walker.nextNode();walker.currentNode.id");
29 shouldThrow("walker.nextNode();walker.currentNode.id");
|
| traversal-reject.js | 25 debug("<br>Testing nextNode")
27 shouldBe("walker.nextNode(); walker.currentNode.id", "'A1'");
28 shouldBe("walker.nextNode(); walker.currentNode.id", "'B2'");
29 shouldBe("walker.nextNode(); walker.currentNode.id", "'B3'");
|
| traversal-skip.js | 25 debug("<br>Testing nextNode")
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'");
|
| /packages/apps/Email/emailcommon/src/org/apache/james/mime4j/field/address/ |
| Builder.java | 69 Node n = it.nextNode();
78 Node n2 = it.nextNode();
101 Node n = it.nextNode();
112 Node n = it.nextNode();
129 Node n = it.nextNode();
138 n = it.nextNode();
151 Node n = it.nextNode();
154 n = it.nextNode();
171 Node n = it.nextNode();
185 String localPart = buildString((ASTlocal_part)it.nextNode(), true);
[all...] |
| /external/webkit/Source/JavaScriptCore/profiler/ |
| Profile.cpp | 55 for (ProfileNode* nextNode = currentNode; nextNode; nextNode = nextNode->firstChild())
56 currentNode = nextNode;
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMTreeWalker.java | 115 int nextNode = m_dtm.getFirstChild(pos);
116 while (DTM.NULL == nextNode)
123 nextNode = m_dtm.getNextSibling(pos);
125 if (DTM.NULL == nextNode)
136 nextNode = DTM.NULL;
143 pos = nextNode;
168 int nextNode = m_dtm.getFirstChild(pos);
169 while (DTM.NULL == nextNode)
176 nextNode = m_dtm.getNextSibling(pos);
178 if (DTM.NULL == nextNode)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| TreeWalker.java | 179 Node nextNode = pos.getFirstChild();
181 while (null == nextNode)
188 nextNode = pos.getNextSibling();
190 if (null == nextNode)
199 nextNode = null;
206 pos = nextNode;
232 Node nextNode = pos.getFirstChild();
234 while (null == nextNode)
241 nextNode = pos.getNextSibling();
243 if (null == nextNode)
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| NodeIterator.h | 45 PassRefPtr<Node> nextNode(ScriptState*, ExceptionCode&);
57 PassRefPtr<Node> nextNode(ExceptionCode& ec) { return nextNode(scriptStateFromNode(mainThreadNormalWorld(), referenceNode()), ec); }
|
| TreeWalker.h | 53 Node* nextNode(ScriptState*);
63 Node* nextNode() { return nextNode(scriptStateFromNode(mainThreadNormalWorld(), m_current.get())); }
|
| NodeIterator.idl | 34 [CallWith=ScriptState] Node nextNode()
|
| /external/icu4c/tools/ctestfw/ |
| ctest.c | 220 TestNode *nextNode, *curNode;
232 nextNode = curNode->child;
238 /* if nextNode is already null, then curNode has no children
240 if( nextNode == NULL )
260 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 )
262 curNode = nextNode;
263 nextNode = nextNode -> sibling;
265 if ( nextNode == NULL )
268 nextNode = createTestNode(name, nameLen)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| TreeWalker.java | 147 Node nextNode = pos.getFirstChild();
149 while (null == nextNode)
156 nextNode = pos.getNextSibling();
158 if (null == nextNode)
167 nextNode = null;
174 pos = nextNode;
201 Node nextNode = pos.getFirstChild();
203 while (null == nextNode)
210 nextNode = pos.getNextSibling();
212 if (null == nextNode)
[all...] |
| /external/webkit/LayoutTests/fast/dom/TreeWalker/resources/ |
| TreeWalker-currentNode.js | 25 shouldBe("w.nextNode()", "document.documentElement.firstChild");
48 shouldBe("w.nextNode()", "subTree");
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| AxesWalker.java | 347 * current node has no next node, or if the search for nextNode attempts
353 public int nextNode()
355 int nextNode = DTM.NULL;
363 nextNode = walker.getNextNode();
365 if (DTM.NULL == nextNode)
372 if (walker.acceptNode(nextNode) != DTMIterator.FILTER_ACCEPT)
381 // return walker.returnNextNode(nextNode);
390 walker.setRoot(nextNode);
396 } // if(null != nextNode)
399 return nextNode;
[all...] |
| LocPathIterator.java | 43 * as each node is iterated via nextNode(), the node is also stored
241 int node = clone.nextNode();
302 int next = iter.nextNode();
396 * the next nextNode() call will retrieve. i.e. if
556 while (DTM.NULL != (next = clone.nextNode()))
569 * the first nextNode() that is called will return the
572 * @return true of nextNode has not been called.
673 * <code>nextNode</code> or<code>previousNode</code> will raise the
747 * to nextNode() returns the first node in the set.
751 public abstract int nextNode();
[all...] |
