*/
  private static final int MAX_HASH_BUCKET_LENGTH = 9;

  // The way the `table`, `entries`, `keys`, and `values` arrays work together is as follows.
  //
  // The `table` array always has a size that is a power of 2. The hashcode of a key in the map
  // is masked in order to correspond to the current table size. For example, if the table size
  // is 128 then the mask is 127 == 0x7f, keeping the bottom 7 bits of the hash value.

import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * Supplies an arbitrary "default" instance for a wide range of types, often useful in testing
 * utilities.
 *
 * <p>Covers arrays, enums and common types defined in {@code java.lang}, {@code java.lang.reflect},
 * {@code java.io}, {@code java.nio}, {@code java.math}, {@code java.util}, {@code

    }
  }

  /** Builds a configured certificate pinner. */
  class Builder {
    val pins = mutableListOf<Pin>()

    /**
     * Pins certificates for `pattern`.
     *
     * @param pattern lower-case host name or wildcard pattern such as `*.example.com`.
     * @param pins SHA-256 or SHA-1 hashes. Each pin is a hash of a certificate's Subject Public Key

/**
 * Tests for {@link Quantiles}.
 *
 * @author Pete Gillin
 */
@NullUnmarked
public class QuantilesTest extends TestCase {

  /*
   * Since Quantiles provides a fluent-style API, each test covers a chain of methods resulting in
   * the computation of one or more quantiles (or in an error) rather than individual methods. The
   * tests are divided into three sections:

/**
 * Tests for {@link Quantiles}.
 *
 * @author Pete Gillin
 */
@NullUnmarked
public class QuantilesTest extends TestCase {

  /*
   * Since Quantiles provides a fluent-style API, each test covers a chain of methods resulting in
   * the computation of one or more quantiles (or in an error) rather than individual methods. The
   * tests are divided into three sections:

        int uniqueBytes = countUniqueBytes(data);
        double entropy = (double) uniqueBytes / 256.0;

        // Estimate compression ratio based on entropy
        // Lower entropy = better compression
        return 0.3 + (entropy * 0.6); // Range from 30% to 90%
    }

    @Override
    public int getMinCompressionSize() {
        return MIN_COMPRESSION_SIZE;
    }

      if (oldCapacity >= MAXIMUM_CAPACITY) {
        return;
      }

      /*
       * Reclassify nodes in each list to new Map. Because we are using power-of-two expansion, the
       * elements from each bin must either stay at same index, or move with a power of two offset.
       * We eliminate unnecessary node creation by catching cases where old nodes can be reused

import org.codelibs.fess.crawler.container.StandardCrawlerContainer;
import org.dbflute.utflute.core.PlainTestCase;

/**
 * Test class for {@link Handler} and its inner class {@link Handler.StorageURLConnection}.
 * This test covers URL parsing, connection state management, and thread-safety.
 */
public class HandlerTest extends PlainTestCase {
    @Override
    protected void setUp() throws Exception {
        super.setUp();

        // Mock transports
        SmbTransportImpl trans1 = mock(SmbTransportImpl.class);
        SmbTransportImpl trans2 = mock(SmbTransportImpl.class);

        // trans2 fails first (lower fail count, tried first), trans1 succeeds
        when(trans2.unwrap(SmbTransportImpl.class)).thenReturn(trans2);
        when(trans2.ensureConnected()).thenThrow(new IOException("Connection failed"));

 *       array. This hashing API accepts an arbitrary sequence of byte and multibyte values (via
 *       {@link Hasher}), but this is merely a convenience; these are always translated into raw
 *       byte sequences under the covers.
 *   <li><b>hash code:</b> each hash function always yields hash codes of the same fixed bit length
 *       (given by {@link #bits}). For example, {@link Hashing#sha1} produces a 160-bit number,