| /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>
|
| /packages/apps/Email/src/org/apache/james/mime4j/field/address/ |
| Builder.java | 70 Node n = it.nextNode();
79 Node n2 = it.nextNode();
102 Node n = it.nextNode();
113 Node n = it.nextNode();
130 Node n = it.nextNode();
139 n = it.nextNode();
152 Node n = it.nextNode();
155 n = it.nextNode();
172 Node n = it.nextNode();
186 String localPart = buildString((ASTlocal_part)it.nextNode(), true);
[all...] |
| /external/webkit/WebCore/bindings/js/ |
| JSNodeIteratorCustom.cpp | 40 JSValue JSNodeIterator::nextNode(ExecState* exec, const ArgList&)
43 RefPtr<Node> node = impl()->nextNode(exec, ec);
|
| JSTreeWalkerCustom.cpp | 88 JSValue JSTreeWalker::nextNode(ExecState* exec, const ArgList&)
90 Node* node = impl()->nextNode(exec);
|
| /external/webkit/WebCore/dom/ |
| NodeIterator.idl | 34 [Custom] 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 [Custom] Node nextNode();
|
| /libcore/luni/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/JavaScriptCore/profiler/ |
| Profile.cpp | 55 for (ProfileNode* nextNode = currentNode; nextNode; nextNode = nextNode->firstChild())
56 currentNode = nextNode;
|
| /libcore/luni/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...] |
| /libcore/luni/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...] |
| /libcore/luni/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/chromium/third_party/icu/source/tools/ctestfw/ |
| ctest.c | 183 TestNode *nextNode, *curNode;
195 nextNode = curNode->child;
201 /* if nextNode is already null, then curNode has no children
203 if( nextNode == NULL )
223 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 )
225 curNode = nextNode;
226 nextNode = nextNode -> sibling;
228 if ( nextNode == NULL )
231 nextNode = createTestNode(name, nameLen)
[all...] |
| /external/icu4c/tools/ctestfw/ |
| ctest.c | 183 TestNode *nextNode, *curNode;
195 nextNode = curNode->child;
201 /* if nextNode is already null, then curNode has no children
203 if( nextNode == NULL )
223 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 )
225 curNode = nextNode;
226 nextNode = nextNode -> sibling;
228 if ( nextNode == NULL )
231 nextNode = createTestNode(name, nameLen)
[all...] |
| /libcore/luni/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...] |
| SelfIteratorNoPredicate.java | 68 * to nextNode() returns the first node in the set.
73 public int nextNode()
|
| ReverseAxesWalker.java | 152 while (DTM.NULL != (next = clone.nextNode()))
215 while (DTM.NULL != (next = clone.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
|
| /libcore/luni/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/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();
|
| /libcore/luni/src/main/java/org/apache/xpath/functions/ |
| FuncSum.java | 53 while (DTM.NULL != (pos = nodes.nextNode()))
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 552 private Node<E> nextNode;
576 lastRet = nextNode;
580 if (nextNode == null) {
584 pred = nextNode;
585 p = succ(nextNode);
590 nextNode = null;
596 nextNode = p;
610 return nextNode != null;
614 if (nextNode == null) throw new NoSuchElementException();
|
