// -log(p) / log(2), ensuring the result is rounded to avoid truncation.
    return max(1, (int) Math.round(-Math.log(p) / LOG_TWO));
  }

  /**
   * Computes m (total bits of Bloom filter) which is expected to achieve, for the specified
   * expected insertions, the required false positive probability.
   *
   * <p>See http://en.wikipedia.org/wiki/Bloom_filter#Probability_of_false_positives for the
   * formula.
   *

special circumstances.

  For example, on rare occasions, there may be a special need to
encourage the widest possible use of a certain library, so that it becomes
a de-facto standard.  To achieve this, non-free programs must be
allowed to use the library.  A more frequent case is that a free
library does the same job as widely used non-free libraries.  In this
case, there is little to gain by limiting the free library to free

            How to Apply These Terms to Your New Programs

  If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.

  To do so, attach the following notices to the program.  It is safest

   * </ul>
   *
   * <p>Note that if your only goal is to turn a well-distributed {@code int} (such as a random
   * number or hash code) into a well-distributed nonnegative number, the most even distribution is
   * achieved not by this method or other absolute value methods, but by {@code x &
   * Integer.MAX_VALUE}.
   *
   * @since 33.5.0
   */
  public static int saturatedAbs(int x) {

     * <p>
     * Effective properties are computed from system, user and optionally project properties, layered with
     * defined precedence onto each other to achieve proper precedence. Precedence is defined as:
     * <ul>
     *     <li>System properties (lowest precedence)</li>
     *     <li>Project properties (optional)</li>
     *     <li>User properties (highest precedence)</li>

   * required by the selected eviction algorithm. As such, when writing unit tests it is not
   * uncommon to specify {@code concurrencyLevel(1)} in order to achieve more deterministic eviction
   * behavior.
   *
   * <p>Note that future implementations may abandon segment locking in favor of more advanced
   * concurrency controls.
   *

To see how to achieve this parallelism in production see the section about [Deployment](deployment/index.md).

## `async` and `await` { #async-and-await }

   * </ul>
   *
   * <p>Note that if your only goal is to turn a well-distributed {@code long} (such as a random
   * number) into a well-distributed nonnegative number, the most even distribution is achieved not
   * by this method or other absolute value methods, but by {@code x & Long.MAX_VALUE}.
   *
   * @since 33.5.0
   */
  public static long saturatedAbs(long x) {

  /**
   * <a href="http://www.opengeospatial.org/standards/kml/">OGC KML (Keyhole Markup Language)</a>,
   * compressed using the ZIP format into KMZ archives.
   */
  public static final MediaType KMZ = createConstant(APPLICATION_TYPE, "vnd.google-earth.kmz");

  /**
   * The <a href="https://tools.ietf.org/html/rfc4155">mbox database format</a>.
   *

END OF TERMS AND CONDITIONS

How to Apply These Terms to Your New Programs

If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.

To do so, attach the following notices to the program. It is safest to