2
0
mirror of https://github.com/boostorg/bloom.git synced 2026-01-19 04:02:11 +00:00

editorial

This commit is contained in:
joaquintides
2025-06-27 09:19:05 +02:00
parent eb3c1a1727
commit 9c1ea91168

View File

@@ -31,7 +31,8 @@
* It's not hard to see that this algorithm implements a filter that remembers
* only the last s elements inserted, with w * (n-1) < s <= w * n. The
* resulting FPR oscillates between 1 - (1 - sub_fpr)^(n-1) and
* 1 - (1 - sub_fpr)^n, where sub_fpr is the FPR of an individual filter.
* 1 - (1 - sub_fpr)^n, where sub_fpr is the FPR of an individual filter
* after w insertions.
*/
template<