aboutsummaryrefslogtreecommitdiff
path: root/src/common/container.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/common/container.c')
-rw-r--r--src/common/container.c2
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