A Bloom filter is a data structure that may report it contains an item that it does not (a false positive), but is guaranteed to report correctly if it contains the item ("no false negatives"). The opposite of a Bloom filter is a data structure that may report a false negative, but can never report a false positive. That is, it may claim that it has not seen an item when it has, but will never claim to have seen an item it has not.
This repository contains thread-safe implementations of "the opposite of a Bloom filter" in Java and Go.
The Java implementation uses maven and may be packaged up with the usual
The Go implementation may be built or installed with the
go get github.com/jmhodges/opposite_of_a_bloom_filter/go/oppobloom