diff options
| author | Nick Mathewson <nickm@torproject.org> | 2009-05-27 18:12:18 -0400 |
|---|---|---|
| committer | Nick Mathewson <nickm@torproject.org> | 2009-05-27 18:12:18 -0400 |
| commit | cb18fc2190ce909a9256849f9b141148177d4dd4 (patch) | |
| tree | 42e2aca11768f5772128b9e504eacc10c779bc89 /src/common/container.c | |
| parent | e86ad6b7fb49a497fa75b79bc15d004b02ebd371 (diff) | |
| parent | d49711e52c22e77e95c30660f78b19d4f6025d04 (diff) | |
| download | tor-cb18fc2190ce909a9256849f9b141148177d4dd4.tar.gz tor-cb18fc2190ce909a9256849f9b141148177d4dd4.zip | |
Merge commit 'origin/maint-0.2.1'
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 1ef0044f1b..c649787c0f 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 |