= Bloom filter =

A bloom filter is a space efficient data structure that can test if an element
is part of a set *false positives are possible*, however false negatives are
not. Meaning it can return,

* Possibly in the set
* Definitly not in the set

== Implementation ==

* Simple [[hash_table]] set
  * but for some set of hash functions, ALL values of those hash functions are
    selected in the table (table of bits?)
* When entry is given, if ALL values that the set of hash functions give are
  filled, then value may exist
* If not, it defintily does not exist