*
     * @return The model name.
     */
    public String modelName() {
        return modelName;
    }

    /**
     * Sets the name of the LTR model.
     *
     * @param modelName The model name.
     * @return This query builder.
     */
    public StoredLtrQueryBuilder modelName(final String modelName) {
        this.modelName = Objects.requireNonNull(modelName);
        return this;

import com.google.caliper.BeforeExperiment;
import com.google.caliper.Benchmark;
import com.google.caliper.Param;
import java.util.Set;
import org.jspecify.annotations.NullUnmarked;

/**
 * Very simple powerSet iteration benchmark.
 *
 * @author Kevin Bourrillion
 */
@NullUnmarked
public class PowerSetBenchmark {
  @Param({"2", "4", "8", "16"})
  int elements;

  Set<Set<Integer>> powerSet;

  @BeforeExperiment

@GwtIncompatible
public abstract class FinalizableWeakReference<T> extends WeakReference<T>
    implements FinalizableReference {
  /**
   * Constructs a new finalizable weak reference.
   *
   * @param referent to weakly reference
   * @param queue that should finalize the referent
   */
  protected FinalizableWeakReference(@Nullable T referent, FinalizableReferenceQueue queue) {
    super(referent, queue.queue);
    queue.cleanUp();
  }

  private RemovalListeners() {}

  /**
   * Returns a {@code RemovalListener} which processes all eviction notifications using {@code
   * executor}.
   *
   * @param listener the backing listener
   * @param executor the executor with which removal notifications are asynchronously executed
   */
  public static <K, V> RemovalListener<K, V> asynchronous(
      RemovalListener<K, V> listener, Executor executor) {

@GwtIncompatible
public abstract class FinalizableWeakReference<T> extends WeakReference<T>
    implements FinalizableReference {
  /**
   * Constructs a new finalizable weak reference.
   *
   * @param referent to weakly reference
   * @param queue that should finalize the referent
   */
  protected FinalizableWeakReference(@Nullable T referent, FinalizableReferenceQueue queue) {
    super(referent, queue.queue);
    queue.cleanUp();
  }

   * put(rowKeyList().get(rowIndex), columnKeyList().get(columnIndex), value)} has the same
   * behavior, but this method runs more quickly.
   *
   * @param rowIndex position of the row key in {@link #rowKeyList()}
   * @param columnIndex position of the row key in {@link #columnKeyList()}
   * @param value value to store in the table
   * @return the previous value with the specified row and column

    private boolean ipv6;
    private boolean rssCapable; // Receive Side Scaling
    private boolean rdmaCapable;

    /**
     * Create network interface info
     *
     * @param address interface address
     * @param linkSpeed link speed in Mbps
     */
    public NetworkInterfaceInfo(InetAddress address, int linkSpeed) {
        this.address = address;
        this.linkSpeed = linkSpeed;

     */
    private final String propertyName;

    /**
     * Creates a {@link IllegalPropertyRuntimeException}.
     *
     * @param targetClass
     *            Target class
     * @param propertyName
     *            Property name
     * @param cause
     *            The cause of the exception
     */

/**
 * Adapter to convert an {@link Iterator} to an {@link Enumeration}.
 *
 * @author higa
 * @param <T> the element type
 */
public class IteratorEnumeration<T> implements Enumeration<T> {

    /** 反復子 */
    protected final Iterator<T> iterator;

    /**
     * Creates an {@link IteratorEnumeration}.
     *
     * @param iterator the iterator (must not be {@literal null})
     */

    /**
     * Transform Graph into a Collection of metadata objects that
     * could serve as a classpath for a particular scope
     *
     * @param dirtyGraph - dependency graph
     * @param scope - which classpath to extract
     * @param resolve - whether to resolve artifacts.
     * @return Collection of metadata objects in the linked subgraph of the graph which
     *             contains the graph.getEntry() vertice