Documentation

thomasmueller · thomasmueller · commit 84aba9277901 · 2020-02-13T07:55:41.000+01:00
diff --git a/fastfilter/src/main/java/org/fastfilter/xor/Xor16.java b/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).
diff --git a/fastfilter/src/main/java/org/fastfilter/xor/Xor8.java b/fastfilter/src/main/java/org/fastfilter/xor/Xor8.java
@@ -6,7 +6,7 @@
 import java.io.*;
 
 /**
- * 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).

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`	`import org.fastfilter.utils.Hash;`
`5`	`5`
`6`	`6`	`/**`
`7`		`- * The Xor Filter, a new algorithm that can replace a bloom filter.`
	`7`	`+ * The Xor Filter, a new algorithm that can replace a Bloom filter.`
`8`	`8`	`*`
`9`	`9`	`* It needs 1.23 log(1/fpp) bits per key. It is related to the BDZ algorithm [1]`
`10`	`10`	`* (a minimal perfect hash function algorithm).`
Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@`
`6`	`6`	`import java.io.*;`
`7`	`7`
`8`	`8`	`/**`
`9`		`- * The Xor Filter, a new algorithm that can replace a bloom filter.`
	`9`	`+ * The Xor Filter, a new algorithm that can replace a Bloom filter.`
`10`	`10`	`*`
`11`	`11`	`* It needs 1.23 log(1/fpp) bits per key. It is related to the BDZ algorithm [1]`
`12`	`12`	`* (a minimal perfect hash function algorithm).`