private final transient ClassSanityTester tester;

    SerializableDummyProxy(ClassSanityTester tester) {
      this.tester = tester;
    }

    @Override
    <R> R dummyReturnValue(TypeToken<R> returnType) {
      return tester.getDummyValue(returnType);
    }

    @Override
    public boolean equals(@Nullable Object obj) {

  }

  /**
   * Returns a view of a slice of this byte source that is at most {@code length} bytes long
   * starting at the given {@code offset}. If {@code offset} is greater than the size of this
   * source, the returned source will be empty. If {@code offset + length} is greater than the size
   * of this source, the returned source will contain the slice starting at {@code offset} and
   * ending at the end of this source.
   *

    protected boolean port139FailoverEnabled = false;
    /** Whether to use NT SMB operations */
    protected boolean useNTSmbs = true;
    /** Whether to use large read/write operations for better performance */
    protected boolean useLargeReadWrite = true;
    /** LAN Manager compatibility level for authentication */
    protected int lanmanCompatibility = 3;

  @J2ktIncompatible
  @GwtIncompatible // NullPointerTester
  public void testStaticNullPointers() throws Exception {
    NullPointerTester tester = new NullPointerTester();
    tester.testAllPublicStaticMethods(CharMatcher.class);
    tester.testAllPublicInstanceMethods(CharMatcher.any());
    tester.testAllPublicInstanceMethods(CharMatcher.anyOf("abc"));
  }

  private static final CharMatcher WHATEVER =
      new CharMatcher() {

  }

  /**
   * Returns a new builder with a hint for how many distinct keys are expected to be added. The
   * generated builder is equivalent to that returned by {@link #builder}, but may perform better if
   * {@code expectedKeys} is a good estimate.
   *
   * @throws IllegalArgumentException if {@code expectedKeys} is negative
   * @since 33.3.0
   */

        return address != null && !address.isLoopbackAddress() 
            && !address.isLinkLocalAddress();
    }
    
    public int getScore() {
        // Score interface for selection (higher is better)
        int score = linkSpeed;  // Base score is link speed
        
        if (rssCapable) score += 1000;   // Prefer RSS-capable
        if (rdmaCapable) score += 2000;  // Prefer RDMA-capable

  }

  /**
   * Returns a new builder with a hint for how many distinct keys are expected to be added. The
   * generated builder is equivalent to that returned by {@link #builder}, but may perform better if
   * {@code expectedKeys} is a good estimate.
   *
   * @throws IllegalArgumentException if {@code expectedKeys} is negative
   * @since 33.3.0
   */

    // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about
    // twice as many reads and writes. But benchmarking shows that they usually perform better than
    // Dolphin. Reversal is about as good as Successive on average, and it is much simpler,
    // especially since we already have a `reverse` method.
    checkNotNull(array);

   * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note
   * that we choose not to make this volatile, so we do less of a "best effort" to track such
   * errors, for better performance.
   *
   * <p>For a new instance, where the arrays above have not yet been allocated, the value of {@code
   * metadata} is the size that the arrays should be allocated with. Once the arrays have been

        FacetResponse facetResponse = null;

        QueryResponseList qrList = new QueryResponseList(documentList, 100L, "gte", 500L, true, facetResponse, 20, 10, 5);

        // Test getters
        assertEquals(20, qrList.getStart());
        assertEquals(5, qrList.getOffset());
        assertEquals(10, qrList.getPageSize());
        assertEquals(100L, qrList.getAllRecordCount());