A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage
A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage
A simple Bloom Filter implementation in Go
A simple Bloom Filter implementation in Go
Cuckoo Filter: a Bloom filter replacement for approximated set-membership queries
Cuckoo Filter: a Bloom filter replacement for approximated set-membership queries
Package ring provides a high performance and thread safe Go implementation of a bloom filter
Package ring provides a high performance and thread safe Go implementation of a bloom filter
Cuckoo filter: a Bloom filter replacement for approximated set-membership queries
Cuckoo filter: a Bloom filter replacement for approximated set-membership queries
Bloomfilter written in Golang
Bloomfilter written in Golang
A program that implements the NIST 800-63-3b Banned Password Check using a bloom filter
A program that implements the NIST 800-63-3b Banned Password Check using a bloom filter
Go package implementing Bloom filter
A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set.