| /external/antlr/src/org/antlr/runtime/tree/ |
| RewriteRuleNodeStream.java | 57 public Object nextNode() {
|
| RewriteRuleSubtreeStream.java | 67 public Object nextNode() {
68 //System.out.println("nextNode: elements="+elements+", singleElement="+((Tree)singleElement).toStringTree());
|
| RewriteRuleTokenStream.java | 57 public Object nextNode() {
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ChildIterator.java | 79 * to nextNode() returns the first node in the set.
84 public int nextNode()
|
| SelfIteratorNoPredicate.java | 68 * to nextNode() returns the first node in the set.
73 public int nextNode()
|
| UnionPathIterator.java | 37 * As each node is iterated via nextNode(), the node is also stored
82 iter.nextNode();
119 expr.nextNode();
128 * <code>nextNode</code> or<code>previousNode</code> will raise the
378 * to nextNode() returns the first node in the set.
382 public int nextNode()
413 m_iterators[i].nextNode();
430 m_iterators[iteratorUsed].nextNode();
|
| BasicTestIterator.java | 128 * to nextNode() returns the first node in the set.
133 public int nextNode()
|
| MatchPatternIterator.java | 170 * <code>nextNode</code> or<code>previousNode</code> will raise the
199 * to nextNode() returns the first node in the set.
203 public int nextNode()
|
| 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...] |
| DescendantIterator.java | 163 * to nextNode() returns the first node in the set.
172 public int nextNode()
330 * <code>nextNode</code> or<code>previousNode</code> will raise the
|
| FilterExprIteratorSimple.java | 103 // and so we may not be in the context of LocPathIterator#nextNode,
143 * to nextNode() returns the first node in the set.
148 public int nextNode()
157 m_lastFetched = next = m_exprObj.nextNode();
|
| WalkingIterator.java | 165 * to nextNode() returns the first node in the set.
169 public int nextNode()
184 return returnNextNode(m_firstWalker.nextNode());
195 int n = returnNextNode(m_firstWalker.nextNode());
255 * <code>nextNode</code> or<code>previousNode</code> will raise the
|
| /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.cpp | 252 Node* TreeWalker::nextNode(ScriptState* state)
|
| TreeWalker.h | 53 Node* nextNode(ScriptState*);
63 Node* nextNode() { return nextNode(scriptStateFromNode(mainThreadNormalWorld(), m_current.get())); }
|
| NodeIterator.cpp | 91 PassRefPtr<Node> NodeIterator::nextNode(ScriptState* state, ExceptionCode& ec)
|
| /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/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeIterator.java | 158 public Node nextNode() throws DOMException
163 int handle=dtm_iter.nextNode();
|
| DTMDefaultBaseTraversers.java | 387 nextNode();
571 nextNode();
708 int type = _type(current); // may call nextNode()
744 int exptype = _exptype(current); // may call nextNode()
813 // running nextNode until the specified node has been loaded,
936 int type = _type(current); // may call nextNode()
967 int etype = _exptype(current); // may call nextNode()
[all...] |
| 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/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/xalan/transformer/ |
| KeyTable.java | 197 while (DTM.NULL != (currentNode = m_keyNodes.nextNode()))
216 while (DTM.NULL != (currentNodeInUseClause = i.nextNode())) {
245 nodes.nextNode();
252 // in each nodeset. We use nodes.nextNode after each entry so we can
256 nodes.nextNode();
|
| /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...] |
| /frameworks/base/telephony/java/com/android/internal/telephony/ |
| IntRangeManager.java | 514 IntRange nextNode = iterator.next();
516 if (nextNode.startId <= (end + 1)) {
517 if (nextNode.endId > end) {
518 end = nextNode.endId;
522 start = nextNode.startId;
523 end = nextNode.endId;
|
| /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...] |
