assertThat(dnsEnd.inetAddressList.size).isEqualTo(1)
  }

  @Test
  fun noDnsLookupOnPooledConnection() {
    server.enqueue(MockResponse())
    server.enqueue(MockResponse())

    // Seed the pool.
    val call1 =
      client.newCall(
        Request
          .Builder()
          .url(server.url("/"))
          .build(),
      )
    val response1 = call1.execute()

    assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 5)).isEqualTo(4);
  }

  @GwtIncompatible // Too slow in GWT (~3min fully optimized)
  public void testDivideRemainderEuclideanProperty() {
    // Use a seed so that the test is deterministic:
    Random r = new Random(0L);
    for (int i = 0; i < 1000000; i++) {
      long dividend = r.nextLong();
      long divisor = r.nextLong();

        .build()
    assertThat(client.retryOnConnectionFailure).isTrue()
    executeSynchronously("/").assertBody("seed connection pool")
    executeSynchronously("/").assertBody("retry success")

    // The call that seeds the connection pool.
    listener.removeUpToEvent(CallEnd::class.java)

    // The ResponseFailed event is not necessarily fatal!

            final List<FunctionScoreQueryBuilder.FilterFunctionBuilder> flist = new ArrayList<>();
            flist.add(new FunctionScoreQueryBuilder.FilterFunctionBuilder(ScoreFunctionBuilders.randomFunction()
                    .seed(ComponentUtil.getSystemHelper().getCurrentTimeAsLong())
                    .setField(fessConfig.getIndexFieldDocId())));
            reader.setQuery(QueryBuilders

        },
        "alphanum_word_filter" : {
          "type" : "alphanum_word",
          "max_token_length" : 20
        },
        "minhash_filter" : {
          "type" : "minhash",
          "seed" : 1,
          "bit" : 2,
          "size" : 64
        },
        "synonym_filter" : {
          "type" : "synonym_graph",
          "synonyms_path": "${fess.dictionary.path}synonym.txt"
        }

  }

  /**
   * Tests equality of {@link Hashing#goodFastHash} instances. This test must be separate from
   * {@link #testSeededHashFunctionEquals} because the parameter to {@code goodFastHash} is a size,
   * not a seed, and because that size is rounded up. Thus, {@code goodFastHash} instances with
   * different parameters can be equal. That fact is a problem for {@code
   * testSeededHashFunctionEquals}.
   */

  }

  /**
   * Tests equality of {@link Hashing#goodFastHash} instances. This test must be separate from
   * {@link #testSeededHashFunctionEquals} because the parameter to {@code goodFastHash} is a size,
   * not a seed, and because that size is rounded up. Thus, {@code goodFastHash} instances with
   * different parameters can be equal. That fact is a problem for {@code
   * testSeededHashFunctionEquals}.
   */

 * randomly ordered data (the probability decreases faster than exponentially in N), but if you are
 * passing in unsanitized user data then a malicious user could force it. A light shuffle of the
 * data using an unpredictable seed should normally be enough to thwart this attack.
 *
 * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes

# ----------------------------------------------------------
#                                                    Suggest
#                                                     ------

# Seed value for popular word suggestion.
suggest.popular.word.seed=0
# Tags for popular word suggestion.
suggest.popular.word.tags=
# Fields for popular word suggestion.
suggest.popular.word.fields=
# Excluded words for popular word suggestion.

        .addHeader("Content-Encoding: gzip")
        .body(gzip("b"))
        .build(),
    )

    // Seed the pool with a bad connection.
    assertContent("a", getResponse(newRequest("/")))

    // Give the server time to disconnect.
    Thread.sleep(500)

    // This connection will need to be recovered. When it is, transparent gzip should still work!
    assertContent("b", getResponse(newRequest("/")))