New: succinct counting blocked Bloom filter

Author: thomasmueller

src/main/java/org/fastfilter/FilterType.java

@@ -1,6 +1,7 @@
 package org.fastfilter;
 
 import org.fastfilter.bloom.BlockedBloom;
+import org.fastfilter.bloom.SuccinctCountingBlockedBloom;
 import org.fastfilter.bloom.Bloom;
 import org.fastfilter.bloom.CountingBloom;
 import org.fastfilter.bloom.SuccinctCountingBloom;
@@ -21,10 +22,10 @@
  * The list of supported approximate membership implementations.
  */
 public enum FilterType {
-    SUCCINCT_COUNTING_BLOOM {
+    BLOOM {
         @Override
         public Filter construct(long[] keys, int setting) {
-            return SuccinctCountingBloom.construct(keys, setting);
+            return Bloom.construct(keys, setting);
         }
     },
     COUNTING_BLOOM {
@@ -33,10 +34,10 @@ public Filter construct(long[] keys, int setting) {
             return CountingBloom.construct(keys, setting);
         }
     },
-    BLOOM {
+    SUCCINCT_COUNTING_BLOOM {
         @Override
         public Filter construct(long[] keys, int setting) {
-            return Bloom.construct(keys, setting);
+            return SuccinctCountingBloom.construct(keys, setting);
         }
     },
     BLOCKED_BLOOM {
@@ -45,6 +46,12 @@ public Filter construct(long[] keys, int setting) {
             return BlockedBloom.construct(keys, setting);
         }
     },
+    SUCCINCT_COUNTING_BLOCKED_BLOOM {
+        @Override
+        public Filter construct(long[] keys, int setting) {
+            return SuccinctCountingBlockedBloom.construct(keys, setting);
+        }
+    },
     XOR_SIMPLE {
         @Override
         public Filter construct(long[] keys, int setting) {

src/main/java/org/fastfilter/bloom/BlockedBloom.java

@@ -4,8 +4,9 @@
 import org.fastfilter.utils.Hash;
 
 /**
- * A blocked bloom filter. I little bit faster, but needs more space. Not that
- * useful beyond about 20 bits per key, as fpp doesn't decreased further.
+ * A blocked Bloom filter. Compared to a regular Bloom filter, it is little bit
+ * faster, but needs more space. Not that useful beyond about 20 bits per key,
+ * as fpp doesn't decreased further.
  */
 public class BlockedBloom implements Filter {