Module Bloomf
Bloom filters
bloomf is an implementation of Bloom filters in OCaml.
Bloom filters are memory and time efficient data structures allowing probabilistic membership queries in a set. A query negative result ensures that the element is not present in the set, while a positive result might be a false positive, i.e. the element might not be present and the BF membership query can return true anyway. Internal parameters of the BF allow to control its false positive rate depending on the expected number of elements in it.
Generic interface
val create : ?error_rate:float -> int -> 'a tcreate ~error_rate sizecreates a fresh BF for which expected false positive rate when filled withsizeelements iserror_rate.- raises Invalid_argument
if
error_rateis not in ]0, 1[, orsizeis negative.
val add : 'a t -> 'a -> unitadd t eaddsetot.
val mem : 'a t -> 'a -> boolmem t eistrueifeis int.
val clear : 'a t -> unitclear tclears the contents oft.
val union : 'a t -> 'a t -> 'a tunion t1 t2computes the union of the two inputs. This operation is lossless in the sense that the resulting Bloom filter is the same as the Bloom filter created from scratch using the union of the two sets.Raises
Invalid_argumentif the two bloom filters were created with different parameters
val inter : 'a t -> 'a t -> 'a tinter t1 t2computes the intersection of the two inputs. The false positive probability in the resulting Bloom filter is at most the false-positive probability in one of the constituent Bloom filters, but may be larger than the false positive probability in the Bloom filter created from scratch using the intersection of the two sets.Raises
Invalid_argumentif the two bloom filters were created with different parameters
val size_estimate : 'a t -> intsize_estimate tis an approximation of the number of elements stored in the bloom filter. Please note that this operation is costly (see benchmarks).
Serializers/Deserializers
Functorial interface
module type Hashable = sig ... endThe input interface for
Bloomf.Make.