Saving.

Author: lemire

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

@@ -47,6 +47,7 @@ public Xor16(long[] keys) {
         mainloop:
         do {
             seed = Hash.randomSeed();
+            reverseOrderPos = 0;
             byte[] t2count = new byte[arrayLength];
             long[] t2 = new long[arrayLength];
             for (long k : keys) {
@@ -62,7 +63,6 @@ public Xor16(long[] keys) {
             }
             int[] alone = new int[arrayLength];
             int alonePos = 0;
-            reverseOrderPos = 0;
             for (int nextAloneCheck = 0; nextAloneCheck < arrayLength; ) {
                 while (nextAloneCheck < arrayLength) {
                     if (t2count[nextAloneCheck] == 1) {

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

@@ -52,6 +52,7 @@ public Xor8(long[] keys) {
         mainloop:
         do {
             seed = Hash.randomSeed();
+            reverseOrderPos = 0;
             byte[] t2count = new byte[m];
             long[] t2 = new long[m];
             for (long k : keys) {
@@ -65,7 +66,6 @@ public Xor8(long[] keys) {
                     t2count[h]++;
                 }
             }
-            reverseOrderPos = 0;
             int[][] alone = new int[HASHES][blockLength];
             int[] alonePos = new int[HASHES];
             for (int nextAlone = 0; nextAlone < HASHES; nextAlone++) {