* @param expectedInsertions the number of expected insertions to the constructed {@code
   *     BloomFilter}; must be positive
   * @param fpp the desired false positive probability (must be positive and less than 1.0)
   * @return a {@code BloomFilter}
   */
  public static <T extends @Nullable Object> BloomFilter<T> create(

        .addEqualityGroup(BloomFilter.create(byteArrayFunnel(), 200, 0.01))
        .addEqualityGroup(BloomFilter.create(byteArrayFunnel(), 200, 0.02))
        .addEqualityGroup(BloomFilter.create(unencodedCharsFunnel(), 100, 0.01))
        .addEqualityGroup(BloomFilter.create(unencodedCharsFunnel(), 100, 0.02))
        .addEqualityGroup(BloomFilter.create(unencodedCharsFunnel(), 200, 0.01))

 * to a BloomFilter of M bits and k hash functions. These strategies are part of the serialized form
 * of the Bloom filters that use them, thus they must be preserved as is (no updates allowed, only
 * introduction of new versions).
 *
 * <p>Important: the order of the constants cannot change, and they cannot be deleted - we depend on
 * their ordinal for BloomFilter serialization.
 *
 * @author Dimitris Andreou