arthurprs / quick-cacheLinks
Lightweight and high performance concurrent cache
☆242Updated last month
Alternatives and similar repositories for quick-cache
Users that are interested in quick-cache are comparing it to the libraries listed below
Sorting:
- Atomically updatable variants of Arc and Weak for lock-free concurrency.☆182Updated 8 months ago
- Concurrent multi-producer multi-consumer queue☆283Updated last month
- Structured concurrency operations for async Rust☆454Updated 4 months ago
- A fast and flexible LRU map.☆185Updated 5 months ago
- ☆195Updated last year
- High-performance containers and utilities for concurrent and asynchronous programming☆415Updated 3 weeks ago
- Experiments with structured concurrency in Rust☆367Updated 10 months ago
- Performant time measuring in Rust☆192Updated last year
- K.I.S.S. LSM-tree implementation in safe Rust☆231Updated this week
- Task abstraction for building executors☆471Updated 4 months ago
- a lock-free concurrent slab (experimental)☆285Updated 5 months ago
- in-place allocation-reusing queues for Rust☆373Updated last year
- Rust allocator using jemalloc as a backend☆424Updated last week
- ☆185Updated 3 months ago
- A lock-free, partially wait-free, eventually consistent, concurrent hashmap.☆251Updated 2 years ago
- Async synchronization primitives☆269Updated 2 months ago
- A simple concurrent caching library that might fit to many use cases☆131Updated 5 months ago
- Async executor☆374Updated last month
- Async broadcast channels☆179Updated 5 months ago
- A procedure macro to unify SYNC and ASYNC implementation for downstream application/crates☆156Updated last year
- Library and proc macro to analyze memory usage of data structures in rust.☆156Updated 3 weeks ago
- Support for json-path in Rust☆126Updated 3 weeks ago
- RcLite: small, fast, and memory-friendly reference counting for Rust☆183Updated 2 months ago
- Concurrently Readable Data Structures for Rust☆358Updated last week
- Adaptors between compression crates and Rust's async IO types☆523Updated this week
- Mix async code with CPU-heavy thread pools using Tokio + Rayon☆140Updated 2 years ago
- More efficient alternative to `serde_json::Value` which saves memory by interning primitive values and using tagged pointers.☆137Updated 6 months ago
- A concurrent, append-only vector.☆174Updated this week
- A token-based rate limiter based on the leaky bucket algorithm.☆109Updated 2 months ago
- ☆209Updated last month