Bloom filters untested for large (500M) inputs #22

Author: thomasmueller

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

@@ -50,21 +50,21 @@ public boolean supportsAdd() {
     @Override
     public void add(long key) {
         long hash = Hash.hash64(key, seed);
-        int a = (int) (hash >>> 32);
-        int b = (int) hash;
+        long a = (hash >>> 32) | (hash << 32);
+        long b = hash;
         for (int i = 0; i < k; i++) {
-            data[Hash.reduce(a, arraySize)] |= 1L << a;
+            data[Hash.reduce((int) (a >>> 32), arraySize)] |= 1L << a;
             a += b;
         }
     }
 
     @Override
     public boolean mayContain(long key) {
         long hash = Hash.hash64(key, seed);
-        int a = (int) (hash >>> 32);
-        int b = (int) hash;
+        long a = (hash >>> 32) | (hash << 32);
+        long b = hash;
         for (int i = 0; i < k; i++) {
-            if ((data[Hash.reduce(a, arraySize)] & 1L << a) == 0) {
+            if ((data[Hash.reduce((int) (a >>> 32), arraySize)] & 1L << a) == 0) {
                 return false;
             }
             a += b;