kanidm / concread
Concurrently Readable Data Structures for Rust
☆355Updated this week
Alternatives and similar repositories for concread:
Users that are interested in concread are comparing it to the libraries listed below
- a lock-free concurrent slab (experimental)☆279Updated 3 months ago
- Experiments with structured concurrency in Rust☆358Updated 8 months ago
- The feature-rich, portable async channel library☆253Updated 2 years ago
- A thread pool for isolating blocking I/O in async programs☆354Updated 2 months ago
- in-place allocation-reusing queues for Rust☆364Updated 10 months ago
- Task abstraction for building executors☆462Updated 2 months ago
- Notify async tasks or threads☆462Updated 2 months ago
- safe bindings to io-uring☆665Updated 3 years ago
- Structured concurrency operations for async Rust☆442Updated 2 months ago
- Stackless generators on stable Rust.☆459Updated 2 years ago
- high-speed timing library in Rust☆335Updated 3 months ago
- garbage-collecting on-disk object store, supporting higher level KV stores and databases.☆384Updated last month
- Fast, efficient, and robust memory reclamation for Rust.☆410Updated last month
- A derive macro for implementing the display Trait via a doc comment and string interpolation☆331Updated 3 months ago
- Reflection via DWARF.☆297Updated 2 years ago
- Utilities for collecting metrics from a Tokio application☆331Updated 4 months ago
- A HashMap variant that spreads resize load across inserts☆191Updated 2 months ago
- Pillars for Transactional Systems and Data Grids☆132Updated 11 months ago
- Statically-checked alternatives to RefCell and RwLock☆368Updated 9 months ago
- Support crate for rustc's self-profiling feature☆346Updated last month
- Async I/O and timers☆497Updated last week
- Conditional compilation according to rustc compiler version☆351Updated last month
- Adaptors between compression crates and Rust's async IO types☆486Updated 2 weeks ago
- Rust interface to io_uring☆332Updated 10 months ago
- Concurrent multi-producer multi-consumer queue☆280Updated 2 months ago
- A lock-free, partially wait-free, eventually consistent, concurrent hashmap.☆242Updated 2 years ago
- A fast intrusive flamegraph☆234Updated 2 years ago
- Futures, streams, and async I/O combinators.☆500Updated last month
- generators☆205Updated last year
- Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.☆260Updated 3 years ago