Lines Matching refs:head
50 * The <em>head</em> of the queue is that element that has been on the
55 * operations obtain elements at the head of the queue.
114 * self-link implicitly means to advance to head.next.
126 * - this Node, meaning the successor is head.next
142 * Invariant: head.item == null
144 private transient Node<E> head;
203 * Removes a node from head of queue.
209 // assert head.item == null;
210 Node<E> h = head;
213 head = first;
261 last = head = new Node<E>(null);
510 Node<E> first = head.next;
550 for (Node<E> trail = head, p = trail.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;
697 for (Node<E> p, h = head; (p = h.next) != null; h = p) {
701 head = last;
702 // assert head.item == null && head.next == null;
737 Node<E> h = head;
753 head = h;
766 * The elements will be returned in order from first (head) to last (tail).
794 current = head.next;
817 return head.next;
846 for (Node<E> trail = head, p = trail.next;
877 for (Node<E> p = head.next; p != null; p = p.next)
899 last = head = new Node<E>(null);