return DoubleMath.roundToLong(
        -Math.log1p(-fractionOfBitsSet) * bitSize / numHashFunctions, RoundingMode.HALF_UP);
  }

  /** Returns the number of bits in the underlying bit array. */
  @VisibleForTesting
  long bitSize() {
    return bits.bitSize();
  }

  /**
   * Determines whether a given Bloom filter is compatible with this Bloom filter. For two Bloom

    return try {
      session.requestedServerNames.mapNotNull { (it as? SNIHostName)?.asciiName }
    } catch (uoe: UnsupportedOperationException) {
      // UnsupportedOperationException – if the underlying provider does not implement the operation
      // https://github.com/bcgit/bc-java/issues/1773
      listOf()
    }
  }

  @Throws(IOException::class)
  open fun connectSocket(
    socket: Socket,

/**
 * A query parser that processes search queries and converts them to Lucene Query objects.
 * This class provides a flexible architecture using a chain of filters to process and transform
 * queries before they are parsed by the underlying Lucene query parser.
 *
 * <p>The parser supports configuration of default field, analyzer, wildcard settings,
 * and default operator. It also allows adding custom filters to modify query behavior.</p>
 *
 */

      }
      /*
       * If some other exception happened, we just propagate the wrapper
       * UncheckedExecutionException, which has the stack trace from this thread and which has its
       * cause set to the underlying exception (which may be from another thread). If we someday
       * learn that some other exception besides IllegalArgumentException is common, then we could
       * add another special case to throw an instance of it, too.

    }

    public void test_constructor_withNullMessageCode() {
        // Setup
        final String message = "Invalid query with null message code";
        final Exception cause = new RuntimeException("Underlying error");

        // Execute
        final InvalidQueryException exception = new InvalidQueryException(null, message, cause);

        // Verify
        assertNotNull(exception);

    checkArgument(bits > 0, "Number of bits must be positive");
    return (bits + 31) & ~31;
  }

  /**
   * Returns a hash function which computes its hash code by concatenating the hash codes of the
   * underlying hash functions together. This can be useful if you need to generate hash codes of a
   * specific length.
   *
   * <p>For example, if you need 1024-bit hash codes, you could join two {@link Hashing#sha512} hash

   * <p>{@code addListener} guarantees execution ordering across calls to a given listener but not
   * across calls to multiple listeners. Specifically, a given listener will have its callbacks
   * invoked in the same order as the underlying service enters those states. Additionally, at most
   * one of the listener's callbacks will execute at once. However, multiple listeners' callbacks

      iterator.next();
      iterator.remove();
      assertEquals(initialSize - 1, map.size());
      // (We can't assert that the values collection no longer contains the
      // removed value, because the underlying map can have multiple mappings
      // to the same value.)
      assertInvariants(map);
      assertThrows(IllegalStateException.class, iterator::remove);
    } else {
      iterator.next();

          parentBuilder) {
    // TODO: Once invariant support is added, supply invariants to each of the
    // derived suites, to check that mutations to the derived collections are
    // reflected in the underlying map.

    List<TestSuite> derivedSuites = super.createDerivedSuites(parentBuilder);

    if (parentBuilder.getFeatures().contains(CollectionFeature.SERIALIZABLE)) {
      derivedSuites.add(

   *     Executor)}.
   * @param closingExecutor the future's result will be closed on this executor
   * @deprecated Creating {@link Future}s of closeable types is dangerous in general because the
   *     underlying value may never be closed if the {@link Future} is canceled after its operation
   *     begins. Consider replacing code that creates {@link ListenableFuture}s of closeable types,