Searched defs:nextNode (Results 1 - 7 of 7) 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/ojluni/src/main/java/java/util/
H A DLinkedHashMap.java754 final LinkedHashMapEntry<K,V> nextNode() { method in class:LinkedHashMap.LinkedHashIterator
780 public final K next() { return nextNode().getKey(); }
785 public final V next() { return nextNode().value; }
790 public final Map.Entry<K,V> next() { return nextNode(); }
H A DHashMap.java1437 final Node<K,V> nextNode() { method in class:HashMap.HashIterator
1465 public final K next() { return nextNode().key; }
1470 public final V next() { return nextNode().value; }
1475 public final Map.Entry<K,V> next() { return nextNode(); }
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DConcurrentLinkedQueue.java692 private Node<E> nextNode; field in class:ConcurrentLinkedQueue.Itr
713 nextNode = p;
732 final Node<E> pred = nextNode;
740 nextNode = p;
H A DConcurrentLinkedDeque.java1360 private Node<E> nextNode; field in class:ConcurrentLinkedDeque.AbstractItr
1377 abstract Node<E> nextNode(Node<E> p); method in class:ConcurrentLinkedDeque.AbstractItr
1384 * Sets nextNode and nextItem to next valid node, or to null
1388 lastRet = nextNode;
1390 Node<E> p = (nextNode == null) ? startNode() : nextNode(nextNode);
1391 for (;; p = nextNode(p)) {
1394 nextNode = null;
1400 nextNode
1430 Node<E> nextNode(Node<E> p) { return succ(p); } method in class:ConcurrentLinkedDeque.Itr
1436 Node<E> nextNode(Node<E> p) { return pred(p); } method in class:ConcurrentLinkedDeque.DescendingItr
[all...]
H A DLinkedBlockingDeque.java1039 abstract Node<E> nextNode(Node<E> n); method in class:LinkedBlockingDeque.AbstractItr
1061 Node<E> s = nextNode(n);
1120 Node<E> nextNode(Node<E> n) { return n.next; } method in class:LinkedBlockingDeque.Itr
1126 Node<E> nextNode(Node<E> n) { return n.prev; } method in class:LinkedBlockingDeque.DescendingItr
H A DLinkedTransferQueue.java927 private Node nextNode; // next node to return item for field in class:LinkedTransferQueue.Itr
974 nextNode = s;
990 nextNode = null;
999 return nextNode != null;
1003 Node p = nextNode;

Completed in 725 milliseconds