*   <li>Each other step is derived from one or more input steps. At each step, zero or more objects
 *       can be captured for later closing.
 *   <li>There is one last step (the root of the tree), from which you can extract the final result
 *       of the computation. After that result is available (or the computation fails), all objects
 *       captured by any of the steps in the pipeline are closed.
 * </ol>
 *

    }
    CacheBuilderSpec that = (CacheBuilderSpec) obj;
    return Objects.equals(initialCapacity, that.initialCapacity)
        && Objects.equals(maximumSize, that.maximumSize)
        && Objects.equals(maximumWeight, that.maximumWeight)
        && Objects.equals(concurrencyLevel, that.concurrencyLevel)
        && Objects.equals(keyStrength, that.keyStrength)
        && Objects.equals(valueStrength, that.valueStrength)

    }
    CacheBuilderSpec that = (CacheBuilderSpec) obj;
    return Objects.equals(initialCapacity, that.initialCapacity)
        && Objects.equals(maximumSize, that.maximumSize)
        && Objects.equals(maximumWeight, that.maximumWeight)
        && Objects.equals(concurrencyLevel, that.concurrencyLevel)
        && Objects.equals(keyStrength, that.keyStrength)
        && Objects.equals(valueStrength, that.valueStrength)

- [ ] Write a pull request description that is detailed enough to understand what the pull request does, how, and why.
- [ ] Each commit in the pull request should have a meaningful subject line and body.
  Note that commits might be squashed by a maintainer on merge.
- [ ] Write unit tests that match behavioral changes, where the tests fail if the changes to the runtime are not applied.

      if (obj instanceof SupplierOfInstance) {
        SupplierOfInstance<?> that = (SupplierOfInstance<?>) obj;
        return Objects.equals(instance, that.instance);
      }
      return false;
    }

    @Override
    public int hashCode() {
      return Objects.hash(instance);
    }

    @Override
    public String toString() {
      return "Suppliers.ofInstance(" + instance + ")";
    }

      if (obj instanceof SupplierOfInstance) {
        SupplierOfInstance<?> that = (SupplierOfInstance<?>) obj;
        return Objects.equals(instance, that.instance);
      }
      return false;
    }

    @Override
    public int hashCode() {
      return Objects.hash(instance);
    }

    @Override
    public String toString() {
      return "Suppliers.ofInstance(" + instance + ")";
    }

import java.lang.reflect.Method;
import java.lang.reflect.Modifier;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Map.Entry;
import java.util.Objects;
import java.util.Set;
import junit.framework.Assert;
import junit.framework.AssertionFailedError;
import org.jspecify.annotations.NullUnmarked;
import org.jspecify.annotations.Nullable;

/**

import java.lang.reflect.Field;
import java.nio.ByteOrder;
import java.security.AccessController;
import java.security.PrivilegedActionException;
import java.security.PrivilegedExceptionAction;
import java.util.Objects;
import sun.misc.Unsafe;

/**
 * Utility functions for loading and storing values from a byte array.
 *
 * @author Kevin Damm
 * @author Kyle Maddison
 */
final class LittleEndianByteArray {

  /**

     *   <li>Its execution does not cause any observable side effects.
     *   <li>The computation is <i>consistent with equals</i>; that is, {@link Objects#equals
     *       Objects.equals}{@code (k1, k2) &&} {@link Objects#equals Objects.equals}{@code (v1,
     *       v2)} implies that {@code Objects.equals(transformer.transform(k1, v1),
     *       transformer.transform(k2, v2))}.
     * </ul>
     *

     *   <li>Its execution does not cause any observable side effects.
     *   <li>The computation is <i>consistent with equals</i>; that is, {@link Objects#equals
     *       Objects.equals}{@code (k1, k2) &&} {@link Objects#equals Objects.equals}{@code (v1,
     *       v2)} implies that {@code Objects.equals(transformer.transform(k1, v1),
     *       transformer.transform(k2, v2))}.
     * </ul>
     *