Cleanup

Author: thomasmueller

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

@@ -4,7 +4,7 @@
 import org.fastfilter.utils.Hash;
 
 /**
- * The Xor Filter, a new algorithm that can replace a Bloom filter.
+ * The xor filter, a new algorithm that can replace a Bloom filter.
  *
  * It needs 1.23 log(1/fpp) bits per key. It is related to the BDZ algorithm [1]
  * (a minimal perfect hash function algorithm).

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

@@ -6,7 +6,7 @@
 import org.fastfilter.utils.Hash;
 
 /**
- * The Xor Filter, a new algorithm that can replace a Bloom filter.
+ * The xor filter, a new algorithm that can replace a Bloom filter.
  *
  * It needs 1.23 log(1/fpp) bits per key. It is related to the BDZ algorithm [1]
  * (a minimal perfect hash function algorithm).

fastfilter/src/test/java/org/fastfilter/SimpleFuzzer.java

@@ -1,16 +1,13 @@
 package org.fastfilter;
 
+import static junit.framework.TestCase.assertTrue;
+
 import java.util.Arrays;
-import java.util.EnumSet;
 import java.util.concurrent.ThreadLocalRandom;
 import java.util.stream.LongStream;
 
-import org.fastfilter.Filter;
 import org.fastfilter.utils.Hash;
 
-import static junit.framework.TestCase.assertTrue;
-import static org.fastfilter.TestFilterType.*;
-
 public class SimpleFuzzer {
 
     public static void main(String... args) {