asynchronics / st3Links
Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
☆80Updated 10 months ago
Alternatives and similar repositories for st3
Users that are interested in st3 are comparing it to the libraries listed below
Sorting:
- A reader-writer lock that provides extremely fast read access without starving writers☆81Updated last year
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆72Updated last year
- Lending iterators on stable Rust☆83Updated last year
- ☆49Updated 6 months ago
- A low-level MVCC file format for storing blobs.☆63Updated last year
- Thread-safe clone-on-write container for fast concurrent writing and reading.☆49Updated 2 years ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆115Updated 4 months ago
- rust bindings of snmalloc☆136Updated 3 months ago
- A lock-free, append-only atomic pool.☆67Updated 3 years ago
- A benchmarking harness for concurrent key-value collections☆119Updated 2 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 4 months ago
- Trying to create Sync bump allocator☆37Updated 7 months ago
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- A bit vector with the Rust standard library's portable SIMD API.☆41Updated 2 years ago
- Asynchronously speed-limiting multiple byte streams☆62Updated 9 months ago
- A `VecDeque` (and `Vec`) variant that spreads resize load across pushes.☆107Updated 6 months ago
- An LRU cache implementation with constant time operations and weighted semantic.☆46Updated 6 months ago
- A high-performance SPSC bounded circular buffer of bytes☆47Updated last week
- A Rust implementation of two segment trees and a fenwick tree.☆66Updated 6 years ago
- (lifetime) GATs on stable Rust☆59Updated last year
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.☆57Updated last year
- A cross-platform library for fast and safe memory-mapped IO in Rust☆71Updated last year
- Queue futures to run concurrently, in the order they're spawned, and with global and group limits.☆64Updated this week
- This is a Rust implementation for popular caches (support no_std).☆111Updated 5 months ago
- Linked Atomic Random Insert Vector: a thread-safe, self-memory-managed vector with no guaranteed sequential insert.☆58Updated last year
- A low-level I/O ownership and borrowing library☆102Updated 7 months ago
- A simple concurrent caching library that might fit to many use cases☆131Updated 5 months ago
- Rust interface for Linux futexes, the fast user-space locking primitive.☆87Updated last year
- scan-resistant concurrent lazy LRU☆61Updated last year