Categorygithub.com/holiman/bloomfilter/v2
modulepackage
2.0.3
Repository: https://github.com/holiman/bloomfilter.git
Documentation: pkg.go.dev

# Functions

CountBitsUint64s count 1's in b.
New Filter with CSPRNG keys m is the size of the Bloom filter, in bits, >= 2 k is the number of random keys, >= 1.
NewOptimal Bloom filter with random CSPRNG keys.
NewWithKeys creates a new Filter from user-supplied origKeys.
OptimalK calculates the optimal k value for creating a new Bloom filter maxn is the maximum anticipated number of elements.
OptimalM calculates the optimal m value for creating a new Bloom filter p is the desired false positive probability optimal m = ceiling( - n * ln(p) / ln(2)**2 ).
ReadFile from filename into a lossless-compressed Bloom Filter f Suggested file extension: .bf.gz.
ReadFrom Reader r into a lossless-compressed Bloom filter f.

# Constants

KMin is the minimum number of keys.
MMin is the minimum Bloom filter bits count.
Uint64Bytes is the number of bytes in type uint64.

# Structs

Filter is an opaque Bloom filter type.