Diggsey / lockless
Composable, lock-free, allocation-light data structures
☆60Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for lockless
- Utility for reusing memory☆52Updated 4 years ago
- Rust library providing `Zc` for self-referential zero-copy structures☆41Updated 3 years ago
- Hazard pointer based concurrent memory reclamation for Rust.☆29Updated 4 years ago
- A growable bit-vector for Rust, optimized for size☆39Updated 7 months ago
- ☆54Updated 5 years ago
- The simd optimized escape code☆53Updated last week
- ☆40Updated 5 years ago
- ☆46Updated 4 years ago
- An experimental asynchronous runtime based on `io-uring`.☆76Updated 3 years ago
- A lightweight, no-std, object-safe, serialization-only framework for Rust☆93Updated 3 weeks ago
- Cache & In-Memory optimizations for Rust, revived from the slabs of Sumer.☆30Updated 4 years ago
- Concurrent hash trie☆51Updated 4 years ago
- lonely is a no_std+alloc+no TLS task executor for the Rust async/await ecosystem, focused on minimizing cross-core synchronization overhe…☆18Updated 4 years ago
- A reader-writer lock that provides extremely fast read access without starving writers☆74Updated last year
- liburing bindings☆33Updated 2 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆51Updated last year
- Rust crate to use process file descriptors (pidfd) for Linux☆45Updated 7 months ago
- Trying to create Sync bump allocator☆28Updated last year
- bluss/IndexMap with amortized resizes☆14Updated 3 years ago
- Fast json encoder in rust, that encodes the structure of JSON values in their types☆83Updated 2 years ago
- Lockfree resizeable concurrent hash table.☆53Updated 2 years ago
- To futures-lite as futures-lite is to futures: smaller.☆53Updated 6 months ago
- An I/O-oriented tokio runtime thread pool☆48Updated 4 years ago
- Nudging the compiler to auto-vectorize things☆72Updated last year
- Epoch-based garbage collection☆78Updated 6 years ago
- Work-stealing thread pool for executiong futures☆42Updated 7 years ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated 2 years ago