public void testOptimalNumOfHashFunctionsRounding() {
    assertEquals(5, BloomFilter.optimalNumOfHashFunctions(0.03));
  }

  /** Tests that we always get a non-negative optimal size. */
  public void testOptimalSize() {
    for (int n = 1; n < 1000; n++) {
      for (double fpp = Double.MIN_VALUE; fpp < 1.0; fpp += 0.001) {
        assertThat(BloomFilter.optimalNumOfBits(n, fpp)).isAtLeast(0);
      }
    }