| /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/antlr/antlr-3.4/runtime/C/src/ |
| antlr3rewritestreams.c | 52 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 = nextNode
[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...] |
| 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
|
| 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();
|
| 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();
|
| /external/webkit/Source/WebCore/dom/ |
| NodeIterator.idl | 34 [CallWith=ScriptState] Node nextNode()
|
| TreeWalker.idl | 40 [CallWith=ScriptState] Node nextNode();
|
| /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/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
| RewriteRuleXxxxStreamFixture.cs | 108 tokenTest.NextNode();
127 subtreeTest.NextNode();
145 nodeTest.NextNode();
201 // Test NextNode()
202 CommonTree tree = (CommonTree) tokenTest.NextNode();
267 // Test NextNode()
268 Assert.AreEqual(tree1, (ITree) subtreeTest.NextNode(),
321 // Test NextNode()
322 CommonTree returnedTree = (CommonTree) nodeTest.NextNode();
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| RewriteRuleSubtreeStream.cs | 69 public virtual object NextNode() {
70 //System.Console.WriteLine("nextNode: elements={0}, singleElement={1}", elements, ((ITree)singleElement).ToStringTree());
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| RewriteRuleSubtreeStream.cs | 74 public virtual object NextNode()
76 //System.Console.WriteLine("nextNode: elements={0}, singleElement={1}", elements, ((ITree)singleElement).ToStringTree());
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| RewriteRuleSubtreeStream.java | 67 public Object nextNode() {
68 //System.out.println("nextNode: elements="+elements+", singleElement="+((Tree)singleElement).toStringTree());
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleSubtreeStream.js | 21 nextNode: function() {
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRRewriteRuleNodeStream.m | 55 - (id) nextNode
|
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncCount.java | 53 // while (DTM.NULL != nl.nextNode())
|
| /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()))
|
| /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/xpath/ |
| NodeSetDTM.java | 41 * 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()
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...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
| ASTTreeParser.stg | 344 * change nextToken to nextNode.
349 <! new <terminalOptions.node>(stream_<token>.nextNode()) !>
350 [[[ANTLR<terminalOptions.node>(stream_<token> alloc] init] nextNode];
352 <! stream_<token>.nextNode() !>
353 [stream_<token> nextNode]
|
