Update documentation for new FCA implementation

This commit is contained in:
Christian Mazakas
2022-06-01 11:49:09 -07:00
parent 110c5dcf10
commit 18503e5eb8
52 changed files with 531 additions and 1 deletions
+4
View File
@@ -66,3 +66,7 @@ by using `(h * m) >> (w - k)`, where `h` is the hash value, `m` is the golden
ratio multiplied by `2^w`, `w` is the word size (32 or 64), and `2^k` is the
number of buckets. This provides a good compromise between speed and
distribution.
Since release 1.80.0, prime numbers are chosen for the number of buckets in
tandem with sophisticated modulo arithmetic. This removes the need for "mixing"
the result of the user's hash function as was used for release 1.79.0.