u2 / stable-bloom-filterLinks
A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.
☆42Updated 6 years ago
Alternatives and similar repositories for stable-bloom-filter
Users that are interested in stable-bloom-filter are comparing it to the libraries listed below
Sorting:
- super simple in-memory blocking LSM for constant-size keys and values☆72Updated 9 months ago
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- Asynchronously speed-limiting multiple byte streams☆67Updated last year
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- ☆39Updated 5 years ago
- scan-resistant concurrent lazy LRU☆63Updated 2 years ago
- Rust implementation of Paxos consensus algorithm☆115Updated 2 years ago
- An efficient runtime for asynchronous applications in Rust.☆43Updated 3 years ago
- Simple probabilistic data structures☆146Updated last week
- An eventually consistent LRU designed for lock-free concurrent reads☆22Updated 2 years ago
- Concurrent hash trie☆58Updated 5 years ago
- Another Async IO Framework based on io_uring☆63Updated 3 years ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆73Updated last year
- simple CASPaxos implementation written in rust on top of a simulator for finding bugs quickly☆142Updated 5 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 4 months ago
- A concurrent lock-free hash map for Rust.☆21Updated 4 years ago
- A lock-free async waitgroup implementation☆38Updated 3 years ago
- An implementation of the `group_by` Haskell function for slice and strings☆54Updated 2 years ago
- Framework for simulating distributed applications☆104Updated 5 years ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37Updated 3 years ago
- Rust FFI wrapper for CRoaring☆161Updated last month
- Rust library implementing xor-filters☆142Updated 2 years ago
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆85Updated last year
- A benchmarking harness for concurrent key-value collections☆118Updated 2 years ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆116Updated 9 months ago
- An LRU cache implementation with constant time operations and weighted semantic.☆47Updated 2 months ago
- Rust crate for accepting general reference-like values without proliferating generics.☆37Updated 8 years ago
- A global executor built on top of async-executor and smol☆75Updated 3 months ago
- TCP load testing tool, written in async Rust☆36Updated 4 years ago