concurrent-mtf

NewBloomFilterWithHasher creates a new Bloom filter with the given number of elements (n) and false positive rate (p).

static cache never evicts.

NewBloomSelfAdjustingFilter creates a new self-adjusting Bloom filter with the given number of elements (n) and false positive rate (p).

NewBloomFilterWithHasher creates a new Bloom filter with the given number of elements (n) and false positive rate (p) using weighted hashing.

NewWeightedBloomSelfAdjustingFilter creates a new self-adjusting Bloom filter with the given number of elements (n) and false positive rate (p) using weighted hashing.

BloomFilter represents a single Bloom filter structure.

POISSON.

UNIFORM.

//////////////// Weighted ////////////////.

WeightedBTree is a balanced tree with a somewhat heavier comparison operator.

WeightedSplay tree is a splay-tree implementation with a somewhat more heavy-weight less function for comparison.

ZIPF.