Updated abstract class to reflect changes in previous commit

common/sketch/src/main/java/org/apache/spark/util/sketch/BloomFilter.java

@@ -152,6 +152,20 @@ int getVersionNumber() {
    */
   public abstract boolean mightContainBinary(byte[] item);
 
+  /**
+   * Returns a new Bloom filter of the union of two Bloom filters.
+   * Unlike mergeInplace, this will not cause a mutation.
+   * Callers must ensure the bloom filters are appropriately sized to avoid saturating them.
+   *
+   * @throws IncompatibleUnionException if either are null, different classes, or different size or number of hash functions
+   */
+  public abstract BloomFilterImpl createUnionBloomFilter(BloomFilter other) throws IncompatibleUnionException;
+
+  /**
+   * Swamidass & Baldi (2007) approximation for number of items in the intersection of two Bloom filters
+   */
+  public abstract double approxItemsInIntersection(BloomFilter that) throws IncompatibleUnionException;
+
   /**
    * Writes out this {@link BloomFilter} to an output stream in binary format. It is the caller's
    * responsibility to close the stream.

common/sketch/src/main/java/org/apache/spark/util/sketch/BloomFilterImpl.java

@@ -226,13 +226,7 @@ public double approxItems() {
     return (m / numHashFunctions) * Math.log(1 - (bits.cardinality() / m));
   }
 
-  /**
-   * Returns a new Bloom filter of the union of two Bloom filters.
-   * Unlike mergeInplace, this will not cause a mutation.
-   * Callers must ensure the bloom filters are appropriately sized to avoid saturating them.
-   *
-   * @throws IncompatibleUnionException if either are null, different classes, or different size or number of hash functions
-   */
+  @Override
   public BloomFilterImpl createUnionBloomFilter(BloomFilter other) throws IncompatibleUnionException {
     // Duplicates the logic of `isCompatible` here to provide better error message.
     if (other == null) {
@@ -262,9 +256,7 @@ public BloomFilterImpl createUnionBloomFilter(BloomFilter other) throws Incompat
     return bfUnion;
   }
 
-  /**
-   * Swamidass & Baldi (2007) approximation for number of items in the intersection of two Bloom filters
-   */
+  @Override
   public double approxItemsInIntersection(BloomFilter that) throws IncompatibleUnionException {
     BloomFilterImpl union = createUnionBloomFilter(that);