fix OOBE in SuccinctCountingBlockedBloom

Author: richardstartin

fastfilter/src/main/java/org/fastfilter/bloom/count/SuccinctCountingBlockedBloom.java

@@ -61,7 +61,7 @@ public long getBitCount() {
         this.seed = Hash.randomSeed();
         long bits = (long) entryCount * bitsPerKey;
         this.buckets = (int) bits / 64;
-        int arrayLength = (int) (buckets + 16);
+        int arrayLength = (buckets + 16);
         data = new long[arrayLength];
         counts = new long[arrayLength];
         overflow = new long[100 + arrayLength * 10 / 100];
@@ -87,7 +87,7 @@ public void add(long key) {
         if (a2 != a1) {
             increment(start, a2);
         }
-        int second = start + 1 + (int) (hash >>> 60);
+        int second = start + (int) (hash >>> 60);
         int a3 = (int) ((hash >> 12) & 63);
         int a4 = (int) ((hash >> 18) & 63);
         increment(second, a3);
@@ -112,7 +112,7 @@ public void remove(long key) {
         if (a2 != a1) {
             decrement(start, a2);
         }
-        int second = start + 1 + (int) (hash >>> 60);
+        int second = start + (int) (hash >>> 60);
         int a3 = (int) ((hash >> 12) & 63);
         int a4 = (int) ((hash >> 18) & 63);
         decrement(second, a3);
@@ -142,7 +142,7 @@ public boolean mayContain(long key) {
         int start = Hash.reduce((int) hash, buckets);
         hash = hash ^ Long.rotateLeft(hash, 32);
         long a = data[start];
-        long b = data[start + 1 + (int) (hash >>> 60)];
+        long b = data[start + (int) (hash >>> 60)];
         long m1 = (1L << hash) | (1L << (hash >> 6));
         long m2 = (1L << (hash >> 12)) | (1L << (hash >> 18));
         return ((m1 & a) == m1) && ((m2 & b) == m2);