tomtomwombat / fastbloomLinks
The fastest Bloom filter in Rust. No accuracy compromises. Compatible with any hasher.
☆241Updated 3 weeks ago
Alternatives and similar repositories for fastbloom
Users that are interested in fastbloom are comparing it to the libraries listed below
Sorting:
- Atomically updatable variants of Arc and Weak for lock-free concurrency.☆182Updated 7 months ago
- A very fast Key-Value store in pure rust☆161Updated 3 months ago
- An ε-copy serialization/deserialization framework for Rust☆148Updated last week
- Lightweight and high performance concurrent cache☆239Updated 3 weeks ago
- ☆138Updated 2 months ago
- Perfect hashing for an imperfect world☆91Updated 4 months ago
- Succinct data structures using very efficient rank and select☆119Updated 3 weeks ago
- in-place allocation-reusing queues for Rust☆374Updated last year
- ☆257Updated last month
- A concurrent, append-only vector.☆165Updated 3 weeks ago
- a lock-free concurrent slab (experimental)☆284Updated 5 months ago
- Embedded Key-Value Storage Engine☆121Updated 2 weeks ago
- Structured concurrency operations for async Rust☆452Updated 4 months ago
- Fixed-size decimal numbers implemented in pure Rust☆188Updated this week
- ☆156Updated last week
- Parallelo Parallel Library (PPL) is a small parallel framework that brings Structured Parallel Programming in Rust.☆77Updated last month
- Faster implementations of standard library operations like find, filter, position etc.☆177Updated 3 months ago
- Maps where keys are borrowed from values.☆254Updated this week
- Pure-Rust implementation of Fast Static Symbol Tables string compression☆147Updated last week
- ergonomic and precise error handling built atop type-level set arithmetic☆232Updated last month
- A collection of different transport implementations and related tools focused primarily on web technologies.☆286Updated this week
- A fast, non-cryptographic, minimally DoS-resistant hashing algorithm for Rust.☆254Updated 2 months ago
- Benchmarking library for stable Rust☆38Updated last month
- K.I.S.S. LSM-tree implementation in safe Rust☆228Updated this week
- A token-based rate limiter based on the leaky bucket algorithm.☆109Updated 2 months ago
- High-precision and consistent benchmarking framework/harness for Rust☆141Updated this week
- An asynchronous, multi-producer, single-consumer (MPSC) bounded channel that operates at tachyonic speeds☆121Updated 8 months ago
- Deadlock free mutexes☆175Updated 2 months ago
- High-performance containers and utilities for concurrent and asynchronous programming☆414Updated last week
- A buffering MPSC queue.☆78Updated 10 months ago