Awesome Go

bloom

CategoryData Structures and Algorithms
SubcategoryBloom and Cuckoo Filters
Stars0
GitHubhttps://github.com/yourbasic/bloom

Golang Bloom filter implementation

About bloom

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.

Installation

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

go get github.com/yourbasic/bloom

Documentation

There is an online reference for the package at godoc.org/github.com/yourbasic/bloom.

Roadmap

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

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

Stefan Nilsson – korthaj

Frequently Asked Questions

What is bloom?

bloom is a Data Structures and Algorithms library for the Go programming language. Golang Bloom filter implementation

How do I install bloom?

Install bloom with the Go module system using `go get yourbasic/bloom`. Check the repository for the current installation instructions.

What category does bloom belong to?

bloom is listed under Data Structures and Algorithms, specifically Bloom and Cuckoo Filters.

← Back to Bloom and Cuckoo Filters