Add an element to the filter
The element to add
Create an optimal bloom filter providing the maximum of elements stored and the error rate desired
The maximum number of item to store
The error rate desired for a maximum of items inserted
A new BloomFilter
Check if another Bloom Filter is equal to this one
The filter to compare to this one
True if they are equal, false otherwise
Build a new Bloom Filter from an existing iterable with a fixed error rate
The iterable used to populate the filter
The error rate, i.e. 'false positive' rate, targeted by the filter
The random number seed (optional)
A new Bloom Filter filled with the iterable's elements
Load an Object from a provided JSON object
the JSON object to load
Return the Object loaded from the provided JSON object
Test an element for membership
The element to look for in the filter
False if the element is definitively not in the filter, True is the element might be in the filter
Return a next random seeded int32 integer
Get the current false positive rate (or error rate) of the filter
The current false positive rate of the filter
Save the current structure as a JSON
Constructor
The number of cells
The number of hash functions used
Get the number of bits currently set in the filter
The filter length
Get a function used to draw random number
A factory function used to draw random integer
Get the seed used in this structure
Set the seed for this structure
the new seed that will be used in this structure
Get the optimal size of the filter
The size of the filter
Generated using TypeDoc
A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not.
Reference: Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7), 422-426.
http://crystal.uta.edu/~mcguigan/cse6350/papers/Bloom.pdf for more details about classic Bloom Filters.
Thomas Minier
Arnaud Grall