private final ReferenceEntry<K, V> next;

    public DummyEntry(K key, int hash, ReferenceEntry<K, V> next) {
      this.key = key;
      this.hash = hash;
      this.next = next;
    }

    public static <K, V> DummyEntry<K, V> create(
        K key, int hash, @Nullable ReferenceEntry<K, V> next) {
      return new DummyEntry<>(key, hash, next);
    }

    public void clearKey() {

        throw new ClUnsupportedOperationException("remove");
    }

    @Override
    public boolean hasNext() {
        return false;
    }

    @Override
    public T next() {
        throw new ClUnsupportedOperationException("next");
    }

        void testDecodeMisalignedCompound() {
            byte[] buffer = createMisalignedCompoundMessage();
            TestServerMessageBlock2 next = new TestServerMessageBlock2(mockConfig);
            testMessage.setNext(next);
            testMessage.setBytesRead(10);

            assertThrows(SMBProtocolDecodingException.class, () -> {
                testMessage.decode(buffer, 0);
            });

                        logger.debug("Maven encountered the following problems during initial POM interpolation:");

                        Object last = null;
                        for (Object next : feedback) {
                            if (next instanceof Throwable throwable) {
                                if (last == null) {
                                    logger.debug("", throwable);
                                } else {

        }

        @Override
        public ServerMessageBlock2 getNext() {
            return nextBlock;
        }

        @Override
        public void setNext(ServerMessageBlock2 next) {
            this.nextBlock = next;
        }

        // Helper methods to manipulate parent's private fields via reflection or protected methods
        public void setStatusForTest(int status) {

 * A utility for testing an Iterator implementation by comparing its behavior to that of a "known
 * good" reference implementation. In order to accomplish this, it's important to test a great
 * variety of sequences of the {@link Iterator#next}, {@link Iterator#hasNext} and {@link
 * Iterator#remove} operations. This utility takes the brute-force approach of trying <i>all</i>
 * possible sequences of these operations, up to a given number of steps. So, if the caller

  }

  ImmutableList<E> createAsList() {
    switch (size()) {
      case 0:
        return ImmutableList.of();
      case 1:
        return ImmutableList.of(iterator().next());
      default:
        return new RegularImmutableAsList<E>(this, toArray());
    }
  }

  /** If this collection is backed by an array of its elements in insertion order, returns it. */

        return this.lastAccessTime;
    }

    @Override
    public long length() {
        return this.endOfFile;
    }

    /**
     * Gets the offset to the next entry.
     *
     * @return the next entry offset in bytes
     */
    public int getNextEntryOffset() {
        return this.nextEntryOffset;
    }

    /**
     * {@inheritDoc}
     *

    assertThrows(
        ConcurrentModificationException.class,
        () -> {
          Iterator<Entry<K, V>> iterator = getMap().entrySet().iterator();
          put(e3());
          iterator.next();
        });
  }

  @MapFeature.Require({FAILS_FAST_ON_CONCURRENT_MODIFICATION, SUPPORTS_PUT})
  @CollectionSize.Require(absent = ZERO)
  public void testPutAbsentConcurrentWithKeySetIteration() {
    assertThrows(

      try {
        in.close();
      } finally {
        in = null;
      }
    }
  }

  /** Closes the current input stream and opens the next one, if any. */
  private void advance() throws IOException {
    close();
    if (it.hasNext()) {
      in = it.next().openStream();
    }
  }

  @Override
  public int available() throws IOException {
    if (in == null) {
      return 0;
    }