asajeffrey / shared-dataLinks
A Rust library for data structures living in shared memory.
☆12Updated 4 years ago
Alternatives and similar repositories for shared-data
Users that are interested in shared-data are comparing it to the libraries listed below
Sorting:
- A safe-guarded transmute for Rust☆38Updated last year
- ☆53Updated 5 years ago
- Crunchy unroller - deterministically unroll constant loops☆40Updated 4 months ago
- A sanity checker for global allocations in Rust☆51Updated 2 months ago
- A growable bit-vector for Rust, optimized for size☆40Updated 3 months ago
- Cast between dynamic trait objects☆32Updated 5 years ago
- ☆31Updated 5 years ago
- This crate demonstrates an approach to including KaTeX in Rust docs☆28Updated 6 years ago
- An implementation of Kensler's hashed permutation algorithm☆16Updated 4 months ago
- Composable, lock-free, allocation-light data structures☆60Updated 7 years ago
- Cache & In-Memory optimizations for Rust, revived from the slabs of Sumer.☆30Updated 5 years ago
- Arena allocator and a handful of useful data structures☆41Updated 5 years ago
- A splay tree implementation written in Rust☆26Updated 6 years ago
- Faster integer division and modulus operations☆87Updated 2 years ago
- Hazard pointer based concurrent memory reclamation for Rust.☆30Updated 5 years ago
- ☆40Updated 6 years ago
- Completion futures for Rust☆19Updated 2 years ago
- docs.rs as a publishing platform?☆68Updated 2 weeks ago
- A reader-writer lock that provides extremely fast read access without starving writers☆80Updated last year
- Rust library providing `Zc` for self-referential zero-copy structures☆41Updated 4 years ago
- A symbolic evaluator for MIR☆19Updated 5 years ago
- Overloadable functions in rust.☆43Updated 5 years ago
- ☆27Updated 2 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- ☆23Updated 5 years ago
- Dynamically query a type-erased object for any trait implementation☆65Updated 2 years ago
- A perf script for helping to answer queries about how much time a given function occupies, where it is called from, and so forth.☆38Updated 7 years ago
- ☆20Updated 8 years ago
- Atomically updatable Arc implementation using crossbeam-epoch for memory reclamation.☆42Updated 6 years ago
- A generic, fixed-size, associative cache☆40Updated 6 months ago