Searched defs:nextNode (Results 1 – 10 of 10) sorted by relevance
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
1363 private Node<E> nextNode; field in ConcurrentLinkedDeque.AbstractItr1380 abstract Node<E> nextNode(Node<E> p); in nextNode() method in ConcurrentLinkedDeque.AbstractItr1434 Node<E> nextNode(Node<E> p) { return succ(p); } in nextNode() method in ConcurrentLinkedDeque.Itr1441 Node<E> nextNode(Node<E> p) { return pred(p); } in nextNode() method in ConcurrentLinkedDeque.DescendingItr
1062 abstract Node<E> nextNode(Node<E> n); in nextNode() method in LinkedBlockingDeque.AbstractItr1166 Node<E> nextNode(Node<E> n) { return n.next; } in nextNode() method in LinkedBlockingDeque.Itr1173 Node<E> nextNode(Node<E> n) { return n.prev; } in nextNode() method in LinkedBlockingDeque.DescendingItr
736 private Node<E> nextNode; field in ConcurrentLinkedQueue.Itr
866 private Node nextNode; // next node to return item for field in LinkedTransferQueue.Itr
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
1058 final LinkedHashMap.Entry<K,V> nextNode() { in nextNode() method in LinkedHashMap.LinkedHashIterator
1599 final Node<K,V> nextNode() { in nextNode() method in HashMap.HashIterator