0.2.0

The new method *Filter.Cardinality estimates the number of distinct keys added to a Filter.

0.1.2

FPRate now correctly handles the case of an empty Bloom filter. Optimize and NewOptimized are more precise when selecting the optimal number of hash functions, leading to lower expected false positive rates.

0.1.1

The packages github.com/willf/{bitset,bloom} are no longer transitive dependencies of packages that depend on blobloom.

0.1.0

The API for adding and checking for keys is now fixed at Add(uint64), Add2(uint32, uint32), Has(uint64), Has2(uint32, uint32).