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

123

/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DRewriteRuleNodeStream.as13 public function nextNode():Object { function
H A DRewriteRuleSubtreeStream.as49 public function nextNode():Object { function
H A DRewriteRuleTokenStream.as39 public function nextNode():Object { function
/external/antlr/antlr-3.4/runtime/Java/src/main/java/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/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3rewritestreams.h146 pANTLR3_BASE_TREE (*nextNode) (struct ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct * stream); member in struct:ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct
/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/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3rewritestreams.c52 static pANTLR3_BASE_TREE nextNode (pANTLR3_REWRITE_RULE_ELEMENT_STREAM stream);
229 stream->nextNode = nextNode;
325 stream->nextNode = nextNodeToken;
327 // No nextNode implementation for a token rewrite stream
344 stream->nextNode = nextNodeToken;
346 // No nextNode implementation for a token rewrite stream
363 stream->nextNode = nextNodeToken;
365 // No nextNode implementation for a token rewrite stream
389 stream->nextNode
788 nextNode (pANTLR3_REWRITE_RULE_ELEMENT_STREAM stream) function
[all...]
/external/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h284 IntermediateValueNode(int32_t v, Node *nextNode) argument
285 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); }
298 LinearMatchNode(int32_t len, Node *nextNode) argument
299 : ValueNode((0x333333*37+len)*37+hashCode(nextNode)),
300 length(len), next(nextNode) {}
386 Node *nextNode) const = 0;
/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/icu/icu4c/source/common/
H A Dstringtriebuilder.cpp227 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode); local
234 node=createLinearMatchNode(start, lastUnitIndex, maxLinearMatchLength, nextNode);
235 nextNode=registerNode(node, errorCode);
237 node=createLinearMatchNode(start, unitIndex, length, nextNode);
H A Ducharstriebuilder.cpp286 UCharsTrieBuilder::UCTLinearMatchNode::UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode) argument
287 : LinearMatchNode(len, nextNode), s(units) {
313 Node *nextNode) const {
317 nextNode);
/external/libdrm/amdgpu/
H A Dutil_hash.c227 struct util_node **nextNode = util_hash_find_node(hash, key); local
228 struct util_node *node = util_hash_create_node(hash, key, data, nextNode);
285 struct util_node **nextNode = util_hash_find_node(hash, key); local
286 struct util_hash_iter iter = {hash, *nextNode};

Completed in 1848 milliseconds

123