Searched defs:nextNode (Results 1 - 25 of 37) sorted by relevance

12

/external/antlr/src/org/antlr/runtime/tree/
H A DRewriteRuleNodeStream.java57 public Object nextNode() { method in class:RewriteRuleNodeStream
H A DRewriteRuleSubtreeStream.java67 public Object nextNode() { method in class:RewriteRuleSubtreeStream
68 //System.out.println("nextNode: elements="+elements+", singleElement="+((Tree)singleElement).toStringTree());
H A DRewriteRuleTokenStream.java57 public Object nextNode() { method in class:RewriteRuleTokenStream
/external/apache-xml/src/main/java/org/apache/xpath/axes/
H A DBasicTestIterator.java128 * to nextNode() returns the first node in the set.
133 public int nextNode() method in class:BasicTestIterator
H A DChildIterator.java79 * to nextNode() returns the first node in the set.
84 public int nextNode() method in class:ChildIterator
H A DSelfIteratorNoPredicate.java68 * to nextNode() returns the first node in the set.
73 public int nextNode() method in class:SelfIteratorNoPredicate
H A DDescendantIterator.java163 * to nextNode() returns the first node in the set.
172 public int nextNode() method in class:DescendantIterator
330 * <code>nextNode</code> or<code>previousNode</code> will raise the
H A DMatchPatternIterator.java170 * <code>nextNode</code> or<code>previousNode</code> will raise the
199 * to nextNode() returns the first node in the set.
203 public int nextNode() method in class:MatchPatternIterator
H A DFilterExprIteratorSimple.java103 // 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() method in class:FilterExprIteratorSimple
157 m_lastFetched = next = m_exprObj.nextNode();
H A DUnionPathIterator.java37 * 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() method in class:UnionPathIterator
413 m_iterators[i].nextNode();
430 m_iterators[iteratorUsed].nextNode();
H A DWalkingIterator.java165 * to nextNode() returns the first node in the set.
169 public int nextNode() method in class:WalkingIterator
184 return returnNextNode(m_firstWalker.nextNode());
195 int n = returnNextNode(m_firstWalker.nextNode());
255 * <code>nextNode</code> or<code>previousNode</code> will raise the
H A DAxesWalker.java347 * current node has no next node, or if the search for nextNode attempts
353 public int nextNode() method in class:AxesWalker
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...]
H A DNodeSequence.java308 * @see DTMIterator#nextNode()
310 public int nextNode() method in class:NodeSequence
335 int next = m_iter.nextNode();
494 while (DTM.NULL != (n = nextNode()));
511 while ((m_next < index) && DTM.NULL != (n = nextNode()));
530 int n = nextNode();
848 * If ns3.nextNode() is called 3 times the the
853 * If ns2.nextNode() is called 2 times it will return
856 * If ns1.nextNode() is called 6 times it will return
862 * Should ns2 or ns3 have nextNode() calle
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DDTMNodeIterator.java158 public Node nextNode() throws DOMException method in class:DTMNodeIterator
163 int handle=dtm_iter.nextNode();
/external/webkit/Source/WebCore/dom/
H A DTreeWalker.cpp252 Node* TreeWalker::nextNode(ScriptState* state) function in class:WebCore::TreeWalker
H A DTreeWalker.h53 Node* nextNode(ScriptState*);
63 Node* nextNode() { return nextNode(scriptStateFromNode(mainThreadNormalWorld(), m_current.get())); } function in class:WebCore::TreeWalker
H A DNodeIterator.h45 PassRefPtr<Node> nextNode(ScriptState*, ExceptionCode&);
57 PassRefPtr<Node> nextNode(ExceptionCode& ec) { return nextNode(scriptStateFromNode(mainThreadNormalWorld(), referenceNode()), ec); } function in class:WebCore::NodeIterator
H A DNodeIterator.cpp91 PassRefPtr<Node> NodeIterator::nextNode(ScriptState* state, ExceptionCode& ec) function in class:WebCore::NodeIterator
/external/apache-xml/src/main/java/org/apache/xml/dtm/
H A DDTMIterator.java169 * the first call to <code>nextNode()</code> returns that root or (if it
175 public int nextNode(); method in interface:DTMIterator
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/xml/dtm/ref/dom2dtm/
H A DDOM2DTM.java134 // add its attributes. Adapted from nextNode().
327 protected boolean nextNode() method in class:DOM2DTM
638 if (!nextNode())
679 isMore = nextNode();
/external/webkit/Source/WebCore/editing/
H A DDeleteSelectionCommand.cpp497 RefPtr<Node> nextNode = node->traverseNextSibling(); local
506 node = nextNode.get();
H A DVisiblePosition.cpp502 Node* nextNode = next.deprecatedNode(); local
518 bool nextIsInSameEditableElement = nextNode && editableRootForPosition(next) == editingRoot;
530 bool nextIsOutsideOriginalBlock = !nextNode->isDescendantOf(originalBlock) && nextNode != originalBlock;
/external/webkit/Source/WebCore/inspector/front-end/
H A DDataGrid.js1411 var nextNode = null; variable
1414 var nextNode = previousNode.element.nextSibling;
1415 if (!nextNode)
1416 nextNode = this.dataGrid.dataTableBody.lastChild;
1417 this.dataGrid.dataTableBody.insertBefore(this.element, nextNode);
/external/apache-xml/src/main/java/org/apache/xpath/
H A DNodeSet.java40 * nextNode() is called, in order that nodes can be added
234 * to nextNode() returns the first node in the set.
241 public Node nextNode() throws DOMException method in class:NodeSet
288 * <code>nextNode</code> or<code>previousNode</code> will raise the
299 * the first nextNode() that is called will return the
302 * @return true if nextNode() would return the first node in the set,
498 while (null != (obj = iterator.nextNode()))
552 while (null != (node = iterator.nextNode()))
716 /** If this node is being used as an iterator, the next index that nextNode()
722 * the next nextNode() cal
[all...]
H A DNodeSetDTM.java41 * nextNode() is called, in order that nodes can be added
148 while (null != (node = iterator.nextNode()))
378 * to nextNode() returns the first node in the set.
385 public int nextNode() method in class:NodeSetDTM
432 * <code>nextNode</code> or<code>previousNode</code> will raise the
455 * the first nextNode() that is called will return the
458 * @return true if nextNode() would return the first node in the set,
656 while (DTM.NULL != (obj = iterator.nextNode()))
711 while (DTM.NULL != (node = iterator.nextNode()))
1101 /** If this node is being used as an iterator, the next index that nextNode()
[all...]

Completed in 229 milliseconds

12