14 lines
306 B
Plaintext
14 lines
306 B
Plaintext
= 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
|
|
*
|