A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
Why do you think that https://github.com/plar/go-adaptive-radix-tree is a good alternative to blooming-bella
A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
Why do you think that https://github.com/plar/go-adaptive-radix-tree is a good alternative to blooming-bella