diff options
| author | Nick Mathewson <nickm@torproject.org> | 2009-05-27 17:55:51 -0400 |
|---|---|---|
| committer | Nick Mathewson <nickm@torproject.org> | 2009-05-27 17:55:51 -0400 |
| commit | ec7e0546681f57a1ba1769cca2b8339f9b0dc8b0 (patch) | |
| tree | ec878942a37b05ee542606c1ee6ebe42c6b43d15 /src/common/container.c | |
| parent | f0453c45c8c3963762b208cfe4f6fb2e1e96cc34 (diff) | |
| download | tor-ec7e0546681f57a1ba1769cca2b8339f9b0dc8b0.tar tor-ec7e0546681f57a1ba1769cca2b8339f9b0dc8b0.tar.gz | |
Spell-check Tor.
Diffstat (limited to 'src/common/container.c')
| -rw-r--r-- | src/common/container.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/common/container.c b/src/common/container.c index 1ef0044f1..c649787c0 100644 --- a/src/common/container.c +++ b/src/common/container.c @@ -1227,7 +1227,7 @@ IMPLEMENT_ORDER_FUNC(find_nth_long, long) digestset_t * digestset_new(int max_elements) { - /* The probability of false positivies is about P=(1 - exp(-kn/m))^k, where k + /* The probability of false positives is about P=(1 - exp(-kn/m))^k, where k * is the number of hash functions per entry, m is the bits in the array, * and n is the number of elements inserted. For us, k==4, n<=max_elements, * and m==n_bits= approximately max_elements*32. This gives |