merkle-db.bloom — merkle-db/core 0.2.0

Bloom filters provide a probablistic way to test for membership in a set using a fixed amount of space. This is useful for reducing work when the test definitively rules out the existence of a record.

contains? clj

(contains? bf x)

True if the filter probably contains the given value.

create clj

(create expected-size)

(create expected-size error-rate)

Constructs a new bloom filter with the given expected population size and desired error (false positive) rate.

filter->form clj

(filter->form bf)

Build a serializable form for the bloom filter.

filter? clj

(filter? x)

Predicate which tests whether the value is a BloomFilter.

form->filter clj

(form->filter form)

Build a bloom filter from a serialized form.

insert clj

(insert bf & xs)

Insert the given elements into a bloom filter. Returns the updated filter.

into clj

(into bf coll)

Insert the collection of elements into a bloom filter. Returns the updated filter.

merge clj

(merge a b)

Merge the bloom filters together. Only works if bits and k match.

mergeable? clj

(mergeable? a b)

Returns true if the two bloom filters can be merged together.