From: Rob Browning Date: Sat, 18 Feb 2012 00:50:53 +0000 (-0600) Subject: lib/bup/bloom.py: fix minor documentation typos. X-Git-Tag: bup-0.25-rc2~153 X-Git-Url: https://arthur.barton.de/cgi-bin/gitweb.cgi?p=bup.git;a=commitdiff_plain;h=50382bfbb56ebbf2ee37e24bd85c94601d1e18e3 lib/bup/bloom.py: fix minor documentation typos. Signed-off-by: Rob Browning --- diff --git a/lib/bup/bloom.py b/lib/bup/bloom.py index 5444fd5..5974ee2 100644 --- a/lib/bup/bloom.py +++ b/lib/bup/bloom.py @@ -4,7 +4,7 @@ There are four basic things to consider when building a bloom filter: The size, in bits, of the filter The capacity, in entries, of the filter The probability of a false positive that is tolerable -The number of bits readily available to use for addresing filter bits +The number of bits readily available to use for addressing filter bits There is one major tunable that is not directly related to the above: k: the number of bits set in the filter per entry @@ -72,7 +72,7 @@ reasonable size. Based on these parameters, a combination of k=4 and k=5 provides the behavior that bup needs. As such, I've implemented bloom addressing, adding and checking functions in C for these two values. Because k=5 requires less space -and gives better overall pfalse_positive perofrmance, it is preferred if a +and gives better overall pfalse_positive performance, it is preferred if a table with k=5 can represent the repository. None of this tells us what max_pfalse_positive to choose.