BloomFilter
AdamWhiteHat
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.
Growth over time
7 data points · 2021-08-01 → 2026-04-01How do you feel about this project?
Ask AI about BloomFilter
Question copied to clipboardWhat is the AdamWhiteHat/BloomFilter GitHub project? Description: "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.". Written in C#. Explain what it does, its main use cases, key features, and who would benefit from using it.
Question is copied to clipboard — paste it after the AI opens.
How to clone BloomFilter
Clone via HTTPS
Clone via SSH
Download ZIP
Download master.zipFound an issue?
Report bugs or request features on the BloomFilter issue tracker:
Open GitHub Issues