NewBuckets creates a new Buckets with the provided number of buckets where each bucket is the specified number of bits.

NewCountingBloomFilter creates a new Counting Bloom Filter optimized to store n items with a specified target false-positive rate and bucket size.

NewDefaultCountingBloomFilter creates a new Counting Bloom Filter optimized to store n items with a specified target false-positive rate.

OptimalK calculates the optimal number of hash functions to use for a Bloom filter based on the desired rate of false positives.

OptimalM calculates the optimal Bloom filter size, m, based on the number of items and the desired rate of false positives.

Buckets is a fast, space-efficient array of buckets where each bucket can store up to a configured maximum value.

Filter is a probabilistic data structure which is used to test the membership of an element in a set.