assertEquals(0, ticker.read());
    assertEquals(10, ticker.read());
    assertEquals(20, ticker.read());

    for (TimeUnit timeUnit : TimeUnit.values()) {
      ticker.setAutoIncrementStep(0, timeUnit);
      assertEquals(
          "Expected no auto-increment when setting autoIncrementStep to 0 " + timeUnit,
          30,
          ticker.read());
    }
  }

    cache.initialize()
  }

  /**
   * Closes the cache and deletes all of its stored values. This will delete all files in the cache
   * directory including files that weren't created by the cache.
   */
  @Throws(IOException::class)
  fun delete() {
    cache.delete()
  }

  /**
   * Deletes all values stored in the cache. In-flight writes to the cache will complete normally,

        assertSame(handle, handle.unwrap(SmbPipeHandle.class), "unwrap should return same instance for interface type");
    }

    @ParameterizedTest
    @DisplayName("getPipeType echoes constructor input (edge values)")
    @ValueSource(ints = { 0, SmbPipeResource.PIPE_TYPE_RDONLY, SmbPipeResource.PIPE_TYPE_WRONLY, SmbPipeResource.PIPE_TYPE_DCE_TRANSACT })
    void getPipeTypeEchoesInput(int pipeType) throws Exception {

  override fun toString() = "{}"
}

/**
 * An invariant of this implementation is that [next] must not contain a mapping for [key].
 * Otherwise, we would have two values for the same key.
 */
private class LinkedTags<K : Any>(
  private val key: KClass<K>,
  private val value: K,
  private val next: Tags,
) : Tags() {
  override fun <T : Any> plus(
    key: KClass<T>,

    }
  }

  /**
   * Creates a suite whose map has some elements filtered out of view.
   *
   * <p>Because the map may be ascending or descending, this test must derive the relative order of
   * these extreme values rather than relying on their regular sort ordering.
   */
  final TestSuite createSubmapSuite(
      FeatureSpecificTestSuiteBuilder<
              ?, ? extends OneSizeTestContainerGenerator<Map<K, V>, Entry<K, V>>>

   * of their elements."
   *
   * </blockquote>
   */
  RESTRICTS_ELEMENTS,

  /**
   * Indicates that a collection has a well-defined ordering of its elements. The ordering may
   * depend on the element values, such as a {@link SortedSet}, or on the insertion ordering, such
   * as a {@link LinkedHashSet}. All list tests and sorted-collection tests automatically specify
   * this feature.
   */
  KNOWN_ORDER,

  /**

  @CollectionSize.Require(SEVERAL)
  public void testClearConcurrentWithValuesIteration() {
    assertThrows(
        ConcurrentModificationException.class,
        () -> {
          Iterator<V> iterator = getMap().values().iterator();
          getMap().clear();
          iterator.next();
        });
  }

  @MapFeature.Require(absent = SUPPORTS_REMOVE)
  @CollectionSize.Require(absent = ZERO)

  }

  private Multiset<N> adjacentNodesMultiset() {
    Multiset<N> adjacentNodes = getReference(adjacentNodesReference);
    if (adjacentNodes == null) {
      adjacentNodes = HashMultiset.create(incidentEdgeMap.values());
      adjacentNodesReference = new SoftReference<>(adjacentNodes);
    }
    return adjacentNodes;
  }

  @Override
  public Set<E> edgesConnecting(N node) {

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import java.io.Serializable;
import java.util.Iterator;

/** An ordering that uses the reverse of the natural order of the values. */
@GwtCompatible
final class ReverseNaturalOrdering extends Ordering<Comparable<?>> implements Serializable {
  static final ReverseNaturalOrdering INSTANCE = new ReverseNaturalOrdering();

  @Override

        @DisplayName("Should handle various offset values")
        @ValueSource(longs = { 0L, 1L, 512L, 1024L, 4096L, 1048576L, Long.MAX_VALUE })
        void testVariousOffsets(long offset) {
            assertDoesNotThrow(() -> request.setOffset(offset));
        }

        @ParameterizedTest
        @DisplayName("Should handle various remaining bytes values")