private void assertMinimumsAreEqual( java.util.PriorityQueue<Integer> oldQueue, PriorityQueue<Integer> newQueue) { assertThat(oldQueue.isEmpty()).isEqualTo(newQueue.isEmpty()); if (!newQueue.isEmpty()) { assertThat(oldQueue.peek()).isEqualTo(newQueue.head()); } }
@Override public E next() { h = (E) temp.head(); temp = temp.tail(); return h; }
@Override public PriorityQueue<E> dequeue() { if (this.length() == 0) { head = null; return EmptyLinkedList.getEmptyLinkedList(); } head = (E) tail.head(); tail = tail.dequeue(); return new LinkedList<>(head, tail.copy()); }