import java.util.SortedSet;
import org.jspecify.annotations.Nullable;

/**
 * This class provides a skeletal implementation of the {@link SortedMultiset} interface.
 *
 * <p>The {@link #count} and {@link #size} implementations all iterate across the set returned by
 * {@link Multiset#entrySet()}, as do many methods acting on the set returned by {@link
 * #elementSet()}. Override those methods for better performance.
 *
 * @author Louis Wasserman
 */

    /**
     * Replaces the entry with key in the cache map with this referral
     */
    void replaceCache();

    /**
     * Not exactly sure what that is all about, certainly legacy stuff
     *
     * @return resolveHashes
     */
    boolean isResolveHashes();

    /**
     * Check if this referral needs to be resolved further
     *

        // When & Then - verify interface methods exist and can be called
        assertDoesNotThrow(() -> {
            cache.getBuffer();
            cache.releaseBuffer(new byte[1024]);
        }, "All BufferCache interface methods should be callable");
    }

    @Test
    @DisplayName("getBuffer should return non-null byte array")
    void testGetBufferContract() {
        // Given

        val testNameParameterName = "testName"
        val testTaskOptionsParameterName = "testTaskOptions"
        applyDefaultSettings(os, arch, buildJvm = BuildToolBuildJvm, timeout = 0)

        // Show all failed tests here, since that is what we are interested in
        failureConditions.supportTestRetry = false

        val extraParameters =
            functionalTestExtraParameters(
                listOf("RerunFlakyTest"),

    assertFalse(
        "after removeAll(e), a collection should not contain e even "
            + "if it initially contained e more than once.",
        getList().contains(duplicate));
  }

  // All other cases are covered by CollectionRemoveAllTester.

    }

    // test that there are no empty ranges
    for (Range<C> range : asRanges) {
      assertFalse(range.isEmpty());
    }

    // test that the RangeSet's span is the span of all the ranges
    Iterator<Range<C>> itr = rangeSet.asRanges().iterator();
    Range<C> expectedSpan = null;
    if (itr.hasNext()) {
      expectedSpan = itr.next();
      while (itr.hasNext()) {

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import org.jspecify.annotations.Nullable;

/**
 * This class provides default values for all Java types, as defined by the JLS.
 *
 * @author Ben Yu
 * @since 1.0
 */
@J2ktIncompatible
@GwtIncompatible
public final class Defaults {
  private Defaults() {}

    assertThat(replacementArray).hasLength(65536);
    // The final element should always be non-null.
    assertThat(replacementArray[replacementArray.length - 1]).isNotNull();
    // Exhaustively check all mappings (an int index avoids wrapping).
    for (int n = 0; n < replacementArray.length; n++) {
      char c = (char) n;
      String expected = map.get(c);
      if (expected == null) {

import java.util.concurrent.Executor;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.TimeoutException;
import org.jspecify.annotations.Nullable;

/**
 * {@link FluentFuture} that forwards all calls to a delegate.
 *
 * <h3>Extension</h3>
 *
 * If you want a class like {@code FluentFuture} but with extra methods, we recommend declaring your

    assertFalse(
        "after removeAll(e), a collection should not contain e even "
            + "if it initially contained e more than once.",
        getList().contains(duplicate));
  }

  // All other cases are covered by CollectionRemoveAllTester.