dterracino/BloomFilter

A novel, space-efficient, probabilistic data structure for hashing a large number of values. It is similar to a hash table, but smaller because it does not need to store the entire value like HashTable and has better asymptotic performance, at the cost of possible false-positives, a likelihood that is configurable. False negatives are not possible. Best use case: Lightweight check if a value/query exists to reject needless/bogus call in place before performing a more latent or expensive request, such as a search for content or database call.

C#