Bloom - Golang Bloom filter implementation

Your basic Bloom filter

Golang probabilistic set data structure

A Bloom filter is a fast and space-efficient probabilistic data structure used to test set membership. A membership test returns either ”likely member” or ”definitely not a member”.

Neutral density filter

Image by Robert Emperley, CC BY-SA 2.0.


Once you have installed Go, run this command to install the bloom package:

go get


There is an online reference for the package at


The only accepted reason to modify the API of this package is to handle issues that can’t be resolved in any other reasonable way.


Thanks to Sébastien Paolacci for his excellent MurmurHash implementation.

Stefan Nilsson – korthaj

Nguồn : GitHub