void testCodesArrayExistence() {
        assertNotNull(DosError.DOS_ERROR_CODES, "DOS_ERROR_CODES should be non‑null");
        assertTrue(DosError.DOS_ERROR_CODES.length > 0, "DOS_ERROR_CODES should contain at least one mapping");
    }

    @Test
    @DisplayName("Each error code mapping contains exactly two ints")
    void testEachPairLength() {
        for (int i = 0; i < DosError.DOS_ERROR_CODES.length; i++) {

      dispatcher = dispatcherA
    }

  private val dispatcherB = ClosableDispatcher()

  @StartStop val serverB =
    MockWebServer().apply {
      dispatcher = dispatcherB
    }

  /** This one won't start because it isn't annotated. */
  private val dispatcherC = ClosableDispatcher()
  val serverC =
    MockWebServer().apply {
      dispatcher = dispatcherC
    }

  @Test
  fun happyPath() {

import java.util.concurrent.ConcurrentMap;
import org.jspecify.annotations.Nullable;

/**
 * A concurrent map which forwards all its method calls to another concurrent map. Subclasses should
 * override one or more methods to modify the behavior of the backing map as desired per the <a
 * href="http://en.wikipedia.org/wiki/Decorator_pattern">decorator pattern</a>.
 *

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

/**
 * A list iterator which forwards all its method calls to another list iterator. Subclasses should
 * override one or more methods to modify the behavior of the backing iterator as desired per the <a
 * href="http://en.wikipedia.org/wiki/Decorator_pattern">decorator pattern</a>.
 *

        assertTrue(cos.isInMemory());
        assertFalse(cos.done);
        cos.close();
    }

    @Test
    public void testSingleByteWrites() throws IOException {
        // Writing one byte at a time
        ContentOutputStream cos = new ContentOutputStream(5, Curl.tmpDir);
        for (int i = 0; i < 3; i++) {
            cos.write(i);
        }
        assertTrue(cos.isInMemory());

    // of the values gets evicted. With weak keys, we use identity equality, which means using
    // System.identityHashCode, which means the assignment of keys to segments is nondeterministic,
    // so more than (maximumSize / #segments) keys could get assigned to the same segment, which
    // would cause one to be evicted.
    return new CacheBuilderFactory()

  /**
   * Returns the specified comparator if not null; otherwise returns {@code Ordering.natural()}.
   * This method is an abomination of generics; the only purpose of this method is to contain the
   * ugly type-casting in one place.
   */
  @SuppressWarnings("unchecked")
  static <E extends @Nullable Object> Comparator<? super E> orNaturalOrder(
      @Nullable Comparator<? super E> comparator) {

  /**
   * Returns the specified comparator if not null; otherwise returns {@code Ordering.natural()}.
   * This method is an abomination of generics; the only purpose of this method is to contain the
   * ugly type-casting in one place.
   */
  @SuppressWarnings("unchecked")
  static <E extends @Nullable Object> Comparator<? super E> orNaturalOrder(
      @Nullable Comparator<? super E> comparator) {

  }

  @Override
  protected Map<String, Integer> makePopulatedMap() {
    Table<Character, String, Integer> table = HashBasedTable.create();
    table.put('a', "one", 2);
    table.put('a', "two", 4);
    table.put('a', "three", 6);
    table.put('b', "four", 8);
    return transformValues(table, TableCollectionTest.DIVIDE_BY_2).row('a');
  }

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

/**
 * A {@link BlockingQueue} which forwards all its method calls to another {@link BlockingQueue}.
 * Subclasses should override one or more methods to modify the behavior of the backing collection
 * as desired per the <a href="http://en.wikipedia.org/wiki/Decorator_pattern">decorator
 * pattern</a>.
 *