new RoundToDoubleTester(BigInteger.valueOf(1L << 53))
        .setExpectation(Math.pow(2, 53), values())
        .test();
  }

  @J2ktIncompatible
  @GwtIncompatible
  public void testRoundToDouble_maxPreciselyRepresentablePlusOne() {
    double twoToThe53 = Math.pow(2, 53);
    // the representable doubles are 2^53 and 2^53 + 2.
    // 2^53+1 is halfway between, so HALF_UP will go up and HALF_DOWN will go down.

    new RoundToDoubleTester(BigInteger.valueOf(1L << 53))
        .setExpectation(Math.pow(2, 53), values())
        .test();
  }

  @J2ktIncompatible
  @GwtIncompatible
  public void testRoundToDouble_maxPreciselyRepresentablePlusOne() {
    double twoToThe53 = Math.pow(2, 53);
    // the representable doubles are 2^53 and 2^53 + 2.
    // 2^53+1 is halfway between, so HALF_UP will go up and HALF_DOWN will go down.

    assertEquals(27, stats.evictionCount());
  }

  public void testMinus() {
    CacheStats one = new CacheStats(11, 13, 17, 19, 23, 27);
    CacheStats two = new CacheStats(53, 47, 43, 41, 37, 31);

    CacheStats diff = two.minus(one);
    assertEquals(76, diff.requestCount());
    assertEquals(42, diff.hitCount());
    assertEquals(42.0 / 76, diff.hitRate());

    new RoundToDoubleTester(BigDecimal.valueOf(1L << 53))
        .setExpectation(Math.pow(2, 53), values())
        .test();
  }

  public void testRoundToDouble_maxPreciselyRepresentablePlusOne() {
    double twoToThe53 = Math.pow(2, 53);
    // the representable doubles are 2^53 and 2^53 + 2.
    // 2^53+1 is halfway between, so HALF_UP will go up and HALF_DOWN will go down.

    new RoundToDoubleTester(BigDecimal.valueOf(1L << 53))
        .setExpectation(Math.pow(2, 53), values())
        .test();
  }

  public void testRoundToDouble_maxPreciselyRepresentablePlusOne() {
    double twoToThe53 = Math.pow(2, 53);
    // the representable doubles are 2^53 and 2^53 + 2.
    // 2^53+1 is halfway between, so HALF_UP will go up and HALF_DOWN will go down.

    } catch (IllegalArgumentException expected) {
    }
  }

  private static final long[] roundToDoubleTestCandidates = {
    0,
    16,
    1L << 53,
    (1L << 53) + 1,
    (1L << 53) + 2,
    (1L << 53) + 3,
    (1L << 53) + 4,
    1L << 54,
    (1L << 54) + 1,
    (1L << 54) + 2,
    (1L << 54) + 3,
    (1L << 54) + 4,
    0x7ffffffffffffe00L, // halfway between 2^63 and next-lower double

    assertEquals(27, stats.evictionCount());
  }

  public void testMinus() {
    CacheStats one = new CacheStats(11, 13, 17, 19, 23, 27);
    CacheStats two = new CacheStats(53, 47, 43, 41, 37, 31);

    CacheStats diff = two.minus(one);
    assertEquals(76, diff.requestCount());
    assertEquals(42, diff.hitCount());
    assertEquals(42.0 / 76, diff.hitRate());

    long signifRounded = increment ? signifFloor + 1 : signifFloor;
    long bits = (long) (exponent + EXPONENT_BIAS) << SIGNIFICAND_BITS;
    bits += signifRounded;
    /*
     * If signifRounded == 2^53, we'd need to set all of the significand bits to zero and add 1 to
     * the exponent. This is exactly the behavior we get from just adding signifRounded to bits

          .put(166, 0x4f7acff7703a635bL)
          .put(132, 0xa784bd0a1f22cc7fL)
          .put(105, 0xf19118e187456638L)
          .put(84, 0x3e2e58f9196abfe5L)
          .put(67, 0xd38ae3dec0107aeaL)
          .put(53, 0xea3033885868e10eL)
          .put(42, 0x1394a146d0d7e04bL)
          .put(33, 0x9962499315d2e8daL)
          .put(26, 0x0849f5cfa85489b5L)
          .put(20, 0x83b395ff19bf2171L)
          .put(16, 0x9d33dd141bd55d9aL)

          .put(166, 0x4f7acff7703a635bL)
          .put(132, 0xa784bd0a1f22cc7fL)
          .put(105, 0xf19118e187456638L)
          .put(84, 0x3e2e58f9196abfe5L)
          .put(67, 0xd38ae3dec0107aeaL)
          .put(53, 0xea3033885868e10eL)
          .put(42, 0x1394a146d0d7e04bL)
          .put(33, 0x9962499315d2e8daL)
          .put(26, 0x0849f5cfa85489b5L)
          .put(20, 0x83b395ff19bf2171L)
          .put(16, 0x9d33dd141bd55d9aL)