search

bits-and-blooms / bloom

Go package implementing Bloom filters, used by Milvus and Beego.
BSD 2-Clause "Simplified" License
2.44k stars 232 forks source link

This version should be concurrent. #18

Closed lemire closed 9 years ago

lemire commented 9 years ago

This is an alternative fix for the problem raised by @cenkalti

I have basically brought it back to the textbook description. Essentially, this should make the data structure concurrent. Note that I have rolled my own version of FNV hashing.

https://github.com/willf/bloom/pull/17

Note : There might be room for re-optimizing the hashing as this code hashes k times... well, that's the textbook description, isn't it?