The-Bloom-filter
Gagniuc
This example implements a Bloom filter in Python, a probabilistic data structure for fast membership testing. Items are added using multiple hash functions that set bits in a fixed-size array. Membership checks return definitely not present or possibly present, with false positives possible. The source code is part of the 127 algorithms collection.
Growth over time
1 data points · 2026-04-07 → 2026-04-07How do you feel about this project?
Ask AI about The-Bloom-filter
Question copied to clipboardWhat is the Gagniuc/The-Bloom-filter GitHub project? Description: "This example implements a Bloom filter in Python, a probabilistic data structure for fast membership testing. Items are added using multiple hash functions that set bits in a fixed-size array. Membership checks return definitely not present or possibly present, with false positives possible. The source code is part of the 127 algorithms collection.". Written in Python. 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 The-Bloom-filter
Clone via HTTPS
Clone via SSH
Download ZIP
Download master.zipFound an issue?
Report bugs or request features on the The-Bloom-filter issue tracker:
Open GitHub Issues