/libcore/luni/src/main/java/org/w3c/dom/traversal/ |
NodeIterator.java | 79 * <code>nextNode()</code> returns the first node in the set. 86 public Node nextNode() 105 * <code>detach</code> has been invoked, calls to <code>nextNode</code>
|
/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'");
|
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'");
|
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'");
|
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'");
|
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'");
|
/packages/apps/Email/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/WebCore/dom/ |
NodeIterator.idl | 34 [CallWith=ScriptState] Node nextNode()
|
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())); }
|
TreeWalker.idl | 40 [CallWith=ScriptState] Node 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...] |
DTMNodeIterator.java | 158 public Node nextNode() throws DOMException 163 int handle=dtm_iter.nextNode();
|
/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/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/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/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
RewriteRuleSubtreeStream.as | 49 public function nextNode():Object {
|
RewriteRuleTokenStream.as | 39 public function nextNode():Object {
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
RewriteRuleNodeStream.java | 57 public Object nextNode() {
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
RewriteRuleNodeStream.js | 11 nextNode: function() {
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ |
DTMIterator.java | 169 * the first call to <code>nextNode()</code> returns that root or (if it 175 public int nextNode(); 189 * calls to <code>nextNode</code> or <code>previousNode</code> will 213 * the first nextNode() that is called will return the 243 * less than the next nextNode() call will retrieve. i.e. if you
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
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...] |
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...] |
/external/icu4c/common/unicode/ |
stringtriebuilder.h | 267 IntermediateValueNode(int32_t v, Node *nextNode) 268 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); } 279 LinearMatchNode(int32_t len, Node *nextNode) 280 : ValueNode((0x333333*37+len)*37+hashCode(nextNode)), 281 length(len), next(nextNode) {} 360 Node *nextNode) const = 0;
|
/external/apache-xml/src/main/java/org/apache/xpath/patterns/ |
FunctionPattern.java | 113 while (DTM.NULL != (n = nl.nextNode())) 157 while (DTM.NULL != (n = nl.nextNode())) 200 while (DTM.NULL != (n = nl.nextNode()))
|