private static IFilter createFilter(int hash, long numElements, int bucketsPer, int maxPageCount) {
    long numBits = (numElements * bucketsPer) + BITSET_EXCESS;
    IBitSet bitset = new OpenBitSet(numBits, maxPageCount);
    return new Murmur3BloomFilter(hash, bitset);
  }
@return The smallest BloomFilter that can provide the given false
        positive probability rate for the given number of elements.

        Asserts that the given probability can be satisfied using this
        filter.
ambry-utils/src/main/java/com/github/ambry/utils/FilterFactory.java