Gregory-Meyer / chtLinks
Lockfree resizeable concurrent hash table.
☆56Updated 4 years ago
Alternatives and similar repositories for cht
Users that are interested in cht are comparing it to the libraries listed below
Sorting:
- skiplist☆144Updated 4 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Async stream for Rust and the futures crate.☆192Updated this week
- Run closures in parallel☆115Updated 11 months ago
- A linked-list based, lock-free concurrent hashmap in Rust.☆164Updated 6 years ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆73Updated last month
- Concurrent hash trie☆58Updated 5 years ago
- A Rust implementation of two segment trees and a fenwick tree.☆65Updated 7 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆73Updated 10 months ago
- A benchmarking harness for concurrent key-value collections☆119Updated 2 years ago
- Async tracing capabilities for the log crate☆98Updated 5 years ago
- Pillars for Transactional Systems and Data Grids☆133Updated last year
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 4 years ago
- A futures abstraction that runs a set of futures which may complete in any order.☆92Updated 3 months ago
- A global executor built on top of async-executor and smol☆75Updated 5 months ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆117Updated 10 months ago
- Asynchronously speed-limiting multiple byte streams☆67Updated last year
- Async filesystem primitives☆142Updated 2 months ago
- An implementation of the `group_by` Haskell function for slice and strings☆54Updated 2 years ago
- Synchronization primitives for Futures and async/await based on intrusive collections☆186Updated last month
- ☆39Updated 5 years ago
- Copy-on-write string utilities for Rust☆160Updated last year
- This is a Rust implementation for popular caches (support no_std).☆113Updated 11 months ago
- Thread parking and unparking☆81Updated 11 months ago
- Simple probabilistic data structures☆147Updated last week
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆88Updated last year
- Utilities for pinning☆98Updated last year
- A lock-free, append-only atomic pool.☆68Updated 3 years ago
- A concurrent lock-free hash map for Rust.☆21Updated 4 years ago
- A sentinel-based, heapless, `Vec`-like type.☆70Updated 5 years ago