Gregory-Meyer / cht
Lockfree resizeable concurrent hash table.
☆54Updated 3 years ago
Alternatives and similar repositories for cht
Users that are interested in cht are comparing it to the libraries listed below
Sorting:
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Concurrent hash trie☆54Updated 4 years ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆70Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆69Updated 2 months ago
- A benchmarking harness for concurrent key-value collections☆118Updated 2 years ago
- Pillars for Transactional Systems and Data Grids☆132Updated last year
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- A reader-writer lock that provides extremely fast read access without starving writers☆78Updated last year
- Run closures in parallel☆113Updated 3 months ago
- skiplist☆142Updated 3 years ago
- Async tracing capabilities for the log crate☆99Updated 4 years ago
- Synchronization primitives for Futures and async/await based on intrusive collections☆179Updated last year
- Rust serializer library☆87Updated last year
- A collection of small utilities for working with pointer types in Rust.☆124Updated 3 months ago
- A concurrent lock-free hash map for Rust.☆21Updated 4 years ago
- Rust crate to use process file descriptors (pidfd) for Linux☆46Updated last year
- Asynchronously speed-limiting multiple byte streams☆61Updated 7 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated last month
- Copy-on-write string utilities for Rust☆158Updated last year
- Utilities for pinning☆97Updated last year
- Async fundamentals initiative: portable and interoperable☆76Updated 2 years ago
- Serialisable closures for Rust.☆64Updated 2 years ago
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆78Updated 8 months ago
- Async stream for Rust and the futures crate.☆183Updated last week
- Composable, lock-free, allocation-light data structures☆60Updated 7 years ago
- Simple probabilistic data structures☆145Updated last week
- A Rust implementation of two segment trees and a fenwick tree.☆65Updated 6 years ago
- A lock-free, append-only atomic pool.☆67Updated 2 years ago
- docs.rs as a publishing platform?☆68Updated 2 months ago
- Helper trait to create a boxed instance without going through stack☆36Updated 3 years ago