UNPKG

bloom-filters

Version:

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

github.com/Callidon/bloom-filters

Callidon/bloom-filters

22 lines (21 loc) • 785 B
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
/** * Various formulas used with Bloom Filters * @namespace Formulas * @private */ /** * Compute the optimal size of a Bloom Filter * @param length - The length of the set used to fill the filter * @param errorRate - The targeted false positive rate * @return The optimal size of a Bloom Filter * @memberof Formulas */ export declare function optimalFilterSize(length: number, errorRate: number): number; /** * Compute the optimal number of hash functions to be used by a Bloom Filter * @param size - The size of the filter * @param length - The length of the set used to fill the filter * @return The optimal number of hash functions to be used by a Bloom Filter * @memberof Formulas */ export declare function optimalHashes(size: number, length: number): number;