Searched refs:nextNode (Results 1 - 5 of 5) sorted by relevance

/libcore/luni/src/main/java/org/w3c/dom/traversal/
H A DNodeIterator.java79 * <code>nextNode()</code> returns the first node in the set.
86 public Node nextNode() method in interface:NodeIterator
105 * <code>detach</code> has been invoked, calls to <code>nextNode</code>
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedDeque.java1331 private Node<E> nextNode; field in class:ConcurrentLinkedDeque.AbstractItr
1348 abstract Node<E> nextNode(Node<E> p); method in class:ConcurrentLinkedDeque.AbstractItr
1355 * Sets nextNode and nextItem to next valid node, or to null
1359 lastRet = nextNode;
1361 Node<E> p = (nextNode == null) ? startNode() : nextNode(nextNode);
1362 for (;; p = nextNode(p)) {
1365 nextNode = null;
1371 nextNode
1401 Node<E> nextNode(Node<E> p) { return succ(p); } method in class:ConcurrentLinkedDeque.Itr
1407 Node<E> nextNode(Node<E> p) { return pred(p); } method in class:ConcurrentLinkedDeque.DescendingItr
[all...]
H A DConcurrentLinkedQueue.java663 private Node<E> nextNode; field in class:ConcurrentLinkedQueue.Itr
684 nextNode = p;
703 final Node<E> pred = nextNode;
711 nextNode = p;
H A DLinkedTransferQueue.java898 private Node nextNode; // next node to return item for field in class:LinkedTransferQueue.Itr
945 nextNode = s;
961 nextNode = null;
970 return nextNode != null;
974 Node p = nextNode;
H A DLinkedBlockingDeque.java1010 abstract Node<E> nextNode(Node<E> n); method in class:LinkedBlockingDeque.AbstractItr
1032 Node<E> s = nextNode(n);
1091 Node<E> nextNode(Node<E> n) { return n.next; } method in class:LinkedBlockingDeque.Itr
1097 Node<E> nextNode(Node<E> n) { return n.prev; } method in class:LinkedBlockingDeque.DescendingItr

Completed in 87 milliseconds