buf.readShort() // authority record count
    buf.readShort() // additional record count

    for (i in 0 until questionCount) {
      skipName(buf) // name
      buf.readShort() // type
      buf.readShort() // class
    }

    for (i in 0 until answerCount) {
      skipName(buf) // name

      val type = buf.readShort().toInt() and 0xffff
      buf.readShort() // class
      @Suppress("UNUSED_VARIABLE")

          if (forgetMeNot == null || skipMe == null) {
            forgetMeNot = new ArrayDeque<>();
            skipMe = new ArrayList<>(3);
          }
          if (!foundAndRemovedExactReference(skipMe, moved.toTrickle)) {
            forgetMeNot.add(moved.toTrickle);
          }
          if (!foundAndRemovedExactReference(forgetMeNot, moved.replaced)) {
            skipMe.add(moved.replaced);
          }
        }

    void filterRejectsThenAccepts_nextYieldsAccepted() throws Exception {
        // Arrange: two entries; filter rejects first, accepts second
        setupParentForUrlCreation();
        StubFileEntry skip = new StubFileEntry("SKIPME", SmbConstants.TYPE_SERVER);
        StubFileEntry take = new StubFileEntry("TAKEME", SmbConstants.TYPE_SERVER);
        when(delegate.hasNext()).thenReturn(true, true, false);
        when(delegate.next()).thenReturn(skip, take);

  }

  /**
   * This tests a special case where removeAt has to trickle an element first down one level from a
   * min to a max level, then up one level above the index of the removed element. It also tests
   * that skipMe in the iterator plays nicely with forgetMeNot.
   */
  public void testIteratorInvalidatingIteratorRemove2() {
    MinMaxPriorityQueue<Integer> mmHeap = MinMaxPriorityQueue.create();
    mmHeap.addAll(