kanidm / concreadLinks
Concurrently Readable Data Structures for Rust
☆359Updated last week
Alternatives and similar repositories for concread
Users that are interested in concread are comparing it to the libraries listed below
Sorting:
- The feature-rich, portable async channel library☆259Updated 2 years ago
- a lock-free concurrent slab (experimental)☆291Updated 6 months ago
- A thread pool for isolating blocking I/O in async programs☆361Updated this week
- Experiments with structured concurrency in Rust☆372Updated 11 months ago
- in-place allocation-reusing queues for Rust☆376Updated last year
- garbage-collecting on-disk object store, supporting higher level KV stores and databases.☆399Updated 4 months ago
- Fast, efficient, and robust memory reclamation for Rust.☆427Updated last month
- A Write Ahead Log (WAL) implementation in Rust☆228Updated last year
- high-speed timing library in Rust☆346Updated last month
- Task abstraction for building executors☆476Updated 5 months ago
- A lock-free, partially wait-free, eventually consistent, concurrent hashmap.☆254Updated 2 years ago
- A pure Rust database implementation using an append-only B-Tree file format.☆271Updated last year
- A fast and flexible LRU map.☆189Updated 6 months ago
- Stretto is a Rust implementation for Dgraph's ristretto (https://github.com/dgraph-io/ristretto). A high performance memory-bound Rust ca…☆422Updated last year
- Structured concurrency operations for async Rust☆459Updated 5 months ago
- Utilities for collecting metrics from a Tokio application☆360Updated last week
- Support crate for rustc's self-profiling feature☆360Updated this week
- Lightweight and high performance concurrent cache☆247Updated 2 weeks ago
- A HashMap variant that spreads resize load across inserts☆192Updated 5 months ago
- Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.☆262Updated 3 years ago
- A port of HdrHistogram to Rust☆321Updated last year
- Concurrent multi-producer multi-consumer queue☆283Updated last month
- Reflection via DWARF.☆297Updated 2 years ago
- ☆189Updated 4 months ago
- Lock-free concurrent and single-threaded hash map implementations using Leapfrog probing. Currently the highest performance concurrent Ha…☆237Updated 2 weeks ago
- A priority queue for Rust with efficient change function.☆196Updated 3 weeks ago
- Proactive IO & Runtime system☆274Updated last year
- A fast intrusive flamegraph☆236Updated 3 years ago
- A wrapper around Rust futures that stores the future in space provided by the caller.☆301Updated last year
- Stackless generators on stable Rust.☆464Updated 3 years ago