Lines Matching defs:next
114 * self-link implicitly means to advance to head.next.
126 * - this Node, meaning the successor is head.next
129 Node<E> next;
148 * Invariant: last.next == null
198 // assert last.next == null;
199 last = last.next = node;
211 Node<E> first = h.next;
212 h.next = h; // help GC
510 Node<E> first = head.next;
525 // p.next is not changed, to allow iterators that are
528 trail.next = p.next;
550 for (Node<E> trail = head, p = trail.next;
552 trail = p, p = p.next) {
576 for (Node<E> p = head.next; p != null; p = p.next)
604 for (Node<E> p = head.next; p != null; p = p.next)
658 for (Node<E> p = head.next; p != null; p = p.next)
671 Node<E> p = head.next;
680 p = p.next;
697 for (Node<E> p, h = head; (p = h.next) != null; h = p) {
698 h.next = h;
702 // assert head.item == null && head.next == null;
741 Node<E> p = h.next;
744 h.next = h;
783 * Basic weakly-consistent iterator. At all times hold the next
794 current = head.next;
807 * Returns the next live successor of p, or null if no such.
810 * - dequeued nodes (p.next == p)
815 Node<E> s = p.next;
817 return head.next;
824 public E next() {
846 for (Node<E> trail = head, p = trail.next;
848 trail = p, p = p.next) {
877 for (Node<E> p = head.next; p != null; p = p.next)