Lines Matching refs:head
57 * The <em>head</em> of the queue is that element that has been on the
62 * operations obtain elements at the head of the queue.
116 * self-link implicitly means to advance to head.next.
128 * - this Node, meaning the successor is head.next
144 * Invariant: head.item == null
146 transient Node<E> head;
205 * Removes a node from head of queue.
211 // assert head.item == null;
212 Node<E> h = head;
215 head = first;
263 last = head = new Node<E>(null);
510 return (count.get() > 0) ? head.next.item : null;
546 for (Node<E> trail = head, p = trail.next;
572 for (Node<E> p = head.next; p != null; p = p.next)
600 for (Node<E> p = head.next; p != null; p = p.next)
653 for (Node<E> p = head.next; p != null; p = p.next)
674 for (Node<E> p, h = head; (p = h.next) != null; h = p) {
678 head = last;
679 // assert head.item == null && head.next == null;
716 Node<E> h = head;
732 head = h;
745 * The elements will be returned in order from first (head) to last (tail).
770 current = head.next;
794 q = head.next;
814 for (Node<E> trail = head, p = trail.next;
849 ((h = current) != null || (h = q.head.next) != null) &&
856 if (p != null || (p = q.head.next) != null) {
893 p = q.head.next;
917 current = q.head.next;
981 for (Node<E> p = head.next; p != null; p = p.next)
1004 last = head = new Node<E>(null);