reverting unrelated changes

Author: tinder-igorsokolov

fastfilter/src/main/java/org/fastfilter/utils/Hash.java

@@ -2,15 +2,10 @@
 
 import java.util.Random;
 
-public final class Hash {
-    private Hash() {
-
-    }
-
+public class Hash {
     private static final Random random = new Random();
 
     public static void setSeed(long seed) {
-        // shouldn't we use ThreadLocalRandom.current() instead?
         random.setSeed(seed);
     }
 
@@ -27,7 +22,7 @@ public static long randomSeed() {
     }
 
     /**
-     * Shrink the hash to value 0..n. Kind of like modulo, but using
+     * Shrink the hash to a value 0..n. Kind of like modulo, but using
      * multiplication and shift, which are faster to compute.
      *
      * @param hash the hash
@@ -41,7 +36,7 @@ public static int reduce(int hash, int n) {
 
     /**
      * Multiply two unsigned 64-bit values.
-     * See <a href="https://bugs.java.com/bugdatabase/view_bug.do?bug_id=8188044">JDK-8188044</a>
+     * See https://bugs.java.com/bugdatabase/view_bug.do?bug_id=8188044
      *
      * @param a the first value
      * @param b the second value

fastfilter/src/main/java/org/fastfilter/xor/XorBinaryFuse16.java

@@ -1,9 +1,7 @@
 package org.fastfilter.xor;
 
-import java.lang.reflect.Constructor;
 import java.nio.ByteBuffer;
 import java.util.Arrays;
-
 import org.fastfilter.Filter;
 import org.fastfilter.utils.Hash;
 
@@ -61,7 +59,7 @@ static int calculateSegmentLength(int arity, int size) {
     }
 
     static double calculateSizeFactor(int arity, int size) {
-        final double sizeFactor;
+        double sizeFactor;
         if (arity == 3) {
             sizeFactor = Math.max(1.125, 0.875 + 0.25 * Math.log(1000000) / Math.log(size));
         } else if (arity == 4) {
@@ -151,7 +149,8 @@ private void addAll(long[] keys) {
                     countMask |= t2count[index];
                 }
             }
-          if (countMask < 0) {
+            startPos = null;
+            if (countMask < 0) {
                 // we have a possible counter overflow
                 continue mainloop;
             }
@@ -216,7 +215,10 @@ private void addAll(long[] keys) {
             seed = Hash.randomSeed();
         }
 
-      for (int i = reverseOrderPos - 1; i >= 0; i--) {
+        alone = null;
+        t2count = null;
+        t2hash = null;
+        for (int i = reverseOrderPos - 1; i >= 0; i--) {
             long hash = reverseOrder[i];
             int found = reverseH[i];
             short xor2 = fingerprint(hash);