fastbloom
by yankun1992
A fast bloom filter implemented by Rust for Python! 10x faster than pybloom!
AI summary
Membership tester
A high-performance probabilistic data structure for efficient membership testing
- stars
- 88
- forks
- 16
- watching
- 2
Similar projects
Found by comparing what the projects do, not just their names.
Membership testers
Probabilistic data structures for quickly checking membership in a set.
Membership tester
A probabilistic data structure for testing membership in a set with high false positive rates.
Membership tester
An implementation of a probabilistic data structure used to test membership in a set
Bloom filter library
An implementation of Bloom filters in Ruby, allowing for efficient probabilistic membership testing with options for native counting and Redis-backed implementations.
Data stream processors
Probabilistic data structures for processing continuous, unbounded streams
Membership tester
A collection of high-performance set membership tests using hash tables and bit manipulation techniques.
Filtering library
An Erlang Nif implementation of a probabilistic data structure used for fast set lookups and filtering
Security auditor
Automated security testing tool
bloom filter
A high-performance bloom filter implementation
Membership tester
Implementation of a data structure for efficient set membership queries with optional deletion and dynamic updates
System Auditor
A tool for gathering and recording information from live Linux systems for forensic analysis
Text analyzer
Language detection library using Bloom filters for speed and memory efficiency.
nvzqz/divan988
Benchmarking tool
A tool for measuring performance in Rust applications
Lazy loader detector
Detects and prevents performance issues in ORM applications by monitoring lazy loading of relationships
Sorting algorithm implementation
An implementation of the Quicksort sorting algorithm using a custom data structure called Huff.
