assertTrue(queue.add("hi"));
    assertThat(queue.element()).isEqualTo("hi");
    assertThat(queue.peek()).isEqualTo("hi");
    assertEquals(1, queue.size());
    assertEquals(0, queue.remainingCapacity());

    assertTrue(queue.add("there"));
    assertThat(queue.element()).isEqualTo("there");
    assertThat(queue.peek()).isEqualTo("there");
    assertEquals(1, queue.size());
    assertEquals(0, queue.remainingCapacity());

            }
          }
        };

    assertEquals(0, (int) iter.peek());
    assertEquals(0, (int) iter.peek());
    assertTrue(iter.hasNext());
    assertEquals(0, (int) iter.peek());
    assertEquals(0, (int) iter.next());

    assertEquals(1, (int) iter.peek());
    assertEquals(1, (int) iter.next());

    /*
     * We test peek() after various calls to make sure that one bad call doesn't interfere with its

            }
          }
        };

    assertEquals(0, (int) iter.peek());
    assertEquals(0, (int) iter.peek());
    assertTrue(iter.hasNext());
    assertEquals(0, (int) iter.peek());
    assertEquals(0, (int) iter.next());

    assertEquals(1, (int) iter.peek());
    assertEquals(1, (int) iter.next());

    /*
     * We test peek() after various calls to make sure that one bad call doesn't interfere with its

    assertEquals(3, (int) mmHeap.pollLast());
    assertEquals(1, (int) mmHeap.peek());
    assertEquals(2, (int) mmHeap.peekLast());
    assertEquals(2, (int) mmHeap.pollLast());
    assertEquals(1, (int) mmHeap.peek());
    assertEquals(1, (int) mmHeap.peekLast());
    assertEquals(1, (int) mmHeap.pollLast());
    assertThat(mmHeap.peek()).isNull();
    assertThat(mmHeap.peekLast()).isNull();

    assertEquals(3, (int) mmHeap.pollLast());
    assertEquals(1, (int) mmHeap.peek());
    assertEquals(2, (int) mmHeap.peekLast());
    assertEquals(2, (int) mmHeap.pollLast());
    assertEquals(1, (int) mmHeap.peek());
    assertEquals(1, (int) mmHeap.peekLast());
    assertEquals(1, (int) mmHeap.pollLast());
    assertThat(mmHeap.peek()).isNull();
    assertThat(mmHeap.peekLast()).isNull();

    segment.count = 1;
    segment.totalWeight = 1;

    assertThat(table.get(0)).isSameInstanceAs(entry);
    assertThat(segment.accessQueue.peek()).isSameInstanceAs(entry);
    assertThat(segment.writeQueue.peek()).isSameInstanceAs(entry);

    segment.clear();
    assertThat(table.get(0)).isNull();
    assertThat(segment.accessQueue.isEmpty()).isTrue();

    segment.count = 1;
    segment.totalWeight = 1;

    assertThat(table.get(0)).isSameInstanceAs(entry);
    assertThat(segment.accessQueue.peek()).isSameInstanceAs(entry);
    assertThat(segment.writeQueue.peek()).isSameInstanceAs(entry);

    segment.clear();
    assertThat(table.get(0)).isNull();
    assertThat(segment.accessQueue.isEmpty()).isTrue();

 *     .maximumSize(1000)
 *     .create();
 * }
 *
 * <p>As a {@link Queue} it functions exactly as a {@link PriorityQueue}: its head element -- the
 * implicit target of the methods {@link #peek()}, {@link #poll()} and {@link #remove()} -- is
 * defined as the <i>least</i> element in the queue according to the queue's comparator. But unlike
 * a regular priority queue, the methods {@link #peekLast}, {@link #pollLast} and {@link

                    if (currentType == null) {
                        currentType = jar;
                    }
                }
                if (!stack.isEmpty()) {
                    ArtifactType parentType = stack.peek();
                    if (needsDerive.contains(parentType.getId())) {
                        Artifact artifact = node.getArtifact();
                        Map<String, String> props = new HashMap<>(artifact.getProperties());

    Iterator<String> nonpeek = Lists.newArrayList("a", "b", "c").iterator();
    PeekingIterator<String> peek = peekingIterator(nonpeek);
    assertThat(nonpeek).isNotSameInstanceAs(peek);
    assertThat(peekingIterator(peek)).isSameInstanceAs(peek);
    assertThat(peekingIterator((Iterator<String>) peek)).isSameInstanceAs(peek);
  }

  public void testMergeSorted_stable_issue5773Example() {