Searched refs:nextNode (Results 1 – 10 of 10) sorted by relevance
1360 private Node<E> nextNode; field in ConcurrentLinkedDeque.AbstractItr1377 abstract Node<E> nextNode(Node<E> p); in nextNode() method in ConcurrentLinkedDeque.AbstractItr1388 lastRet = nextNode; in advance()1390 Node<E> p = (nextNode == null) ? startNode() : nextNode(nextNode); in advance()1391 for (;; p = nextNode(p)) { in advance()1394 nextNode = null; in advance()1400 nextNode = p; in advance()1430 Node<E> nextNode(Node<E> p) { return succ(p); } in nextNode() method in ConcurrentLinkedDeque.Itr1436 Node<E> nextNode(Node<E> p) { return pred(p); } in nextNode() method in ConcurrentLinkedDeque.DescendingItr
692 private Node<E> nextNode; field in ConcurrentLinkedQueue.Itr713 nextNode = p; in Itr()732 final Node<E> pred = nextNode; in next()740 nextNode = p; in next()
927 private Node nextNode; // next node to return item for field in LinkedTransferQueue.Itr974 nextNode = s; in advance()990 nextNode = null; in advance()999 return nextNode != null; in hasNext()1003 Node p = nextNode; in next()
1039 abstract Node<E> nextNode(Node<E> n); in nextNode() method in LinkedBlockingDeque.AbstractItr1061 Node<E> s = nextNode(n); in succ()1120 Node<E> nextNode(Node<E> n) { return n.next; } in nextNode() method in LinkedBlockingDeque.Itr1126 Node<E> nextNode(Node<E> n) { return n.prev; } in nextNode() method in LinkedBlockingDeque.DescendingItr
89 public Node nextNode() in nextNode() method
322 abstract Node<E> nextNode( in nextNode() method in LinkedBlockingDeque.AbstractItr364 Node<E> nextNode( in nextNode() method in LinkedBlockingDeque.DescendingItr381 Node<E> nextNode( in nextNode() method in LinkedBlockingDeque.Itr
754 final LinkedHashMapEntry<K,V> nextNode() { in nextNode() method in LinkedHashMap.LinkedHashIterator780 public final K next() { return nextNode().getKey(); } in next()785 public final V next() { return nextNode().value; } in next()790 public final Map.Entry<K,V> next() { return nextNode(); } in next()
1437 final Node<K,V> nextNode() { in nextNode() method in HashMap.HashIterator1465 public final K next() { return nextNode().key; } in next()1470 public final V next() { return nextNode().value; } in next()1475 public final Map.Entry<K,V> next() { return nextNode(); } in next()
217 final java.util.LinkedHashMap.LinkedHashMapEntry<K, V> nextNode() { in nextNode() method in LinkedHashMap.LinkedHashIterator
375 final java.util.HashMap.Node<K, V> nextNode() { in nextNode() method in HashMap.HashIterator