fastbloom
Membership tester
A high-performance probabilistic data structure for efficient membership testing
A fast bloom filter implemented by Rust for Python! 10x faster than pybloom!
88 stars
2 watching
16 forks
Language: Rust
last commit: almost 3 years agobloom-filterbloomfiltercounting-bloom-filtercounting-bloom-filtersmurmur3pyo3pythonrust
Related projects:
| Repository | Description | Stars |
|---|---|---|
 hexops/fastfilter | Probabilistic data structures for quickly checking membership in a set. | 260 |
 yourbasic/bloom | A probabilistic data structure for testing membership in a set with high false positive rates. | 86 |
 oldpanda/bloomfilter | An implementation of a probabilistic data structure used to test membership in a set | 17 |
 igrigorik/bloomfilter-rb | An implementation of Bloom filters in Ruby, allowing for efficient probabilistic membership testing with options for native counting and Redis-backed implementations. | 473 |
 tylertreat/boomfilters | Probabilistic data structures for processing continuous, unbounded streams | 1,596 |
 zentures/bloom | A collection of high-performance set membership tests using hash tables and bit manipulation techniques. | 146 |
 mpope9/exor_filter | An Erlang Nif implementation of a probabilistic data structure used for fast set lookups and filtering | 31 |
 tylerwince/flake8-bandit | Automated security testing tool | 110 |
 tannerryan/ring | A high-performance bloom filter implementation | 138 |
 mgunlogson/cuckoofilter4j | Implementation of a data structure for efficient set membership queries with optional deletion and dynamic updates | 175 |
 sekoialab/fastir_collector_linux | A tool for gathering and recording information from live Linux systems for forensic analysis | 173 |
 peterc/whatlanguage | Language detection library using Bloom filters for speed and memory efficiency. | 685 |
 nvzqz/divan | A tool for measuring performance in Rust applications | 988 |
 jmcarp/nplusone | Detects and prevents performance issues in ORM applications by monitoring lazy loading of relationships | 1,012 |
 0xdewy/quicksort-huff | An implementation of the Quicksort sorting algorithm using a custom data structure called Huff. | 10 |