status: experimental
An array of k hash functions on values of type 'a. Never ever modify such an array after use!
val default_hash_funs : int -> 'a hash_funsUse Hashtbl.seeded_hash on k seeds
the number of hash functions required
create ?hash size creates a filter with given size, and functions. By default it uses default_hash_funs
a hint for size
val create_default : ?hash_len:int -> int -> 'a tcreate_default ?hash_len size is the same as create ~hash:(default_hash_funs hash_len) size. It uses the given number of default hash functions.
a hint for size
val size : _ t -> intLength of the underlying array. Do not confuse with a cardinal function, which is impossible to write for bloom filters
val load : _ t -> floatRatio of 1 bits in the underlying array. The closer to 1., the less accurate mem is
val mem : 'a t -> 'a -> boolmem f x tests whether x (probably) belongs in f
val add : 'a t -> 'a -> unitadd f x adds x into f
union_mut ~into f changes into into the union of into and f. into and f MUST have the same set of hash functions
Invalid_argument if the two sets do not have the same size
the sets MUST have the same set of hash functions
Invalid_argument if the two sets do not have the same size
inter_mut ~into f changes into into the intersection of into and f into and f MUST have the same set of hash functions
Invalid_argument if the two sets do not have the same size
the sets MUST have the same set of hash functions
Invalid_argument if the two sets do not have the same size
val add_list : 'a t -> 'a list -> unit