raviqqe / hamt-rsLinks
HAMT implementation whose sub-trees can be shared over threads
☆11Updated 2 months ago
Alternatives and similar repositories for hamt-rs
Users that are interested in hamt-rs are comparing it to the libraries listed below
Sorting:
- BisetMap is a fast and thread-safe two-way hash map of sets for Rust.☆13Updated 7 years ago
- ☆22Updated 9 years ago
- A map backed by a vector☆25Updated last year
- Flexible, stand-alone benchmarking☆18Updated 7 years ago
- ☆27Updated 10 years ago
- A small crate to provide space-efficient Option<_> replacements☆37Updated 7 months ago
- Concurrent hash map for Rust☆17Updated 9 years ago
- Disjoint borrow of slices in Rust☆11Updated 6 years ago
- io_uring proof of concept in rust, integrated with tokio timers/executor (but not the reactor ofc)☆46Updated 6 years ago
- Inert lets you use non-Sync values in Sync context☆16Updated 6 years ago
- Rust crate to use process file descriptors (pidfd) for Linux☆50Updated 5 months ago
- An ordered map and set based on a trie.☆28Updated 5 years ago
- Light references to trait objects by embedding the virtual table pointer in the struct☆25Updated last year
- Run a process on a particular subset of the available hardware.☆36Updated 5 years ago
- An experimental columnar arena☆43Updated last year
- To futures-lite as futures-lite is to futures: smaller.☆54Updated 10 months ago
- [DEPRECATED] Prevent false sharing by padding and aligning to the length of a cache line☆52Updated 2 years ago
- A growable bit-vector for Rust, optimized for size☆45Updated 8 months ago
- The simd optimized escape code☆54Updated 3 weeks ago
- Named arguments for Rust☆38Updated 8 years ago
- A zero-allocation ring buffer for storing text logs, implemented in Rust☆51Updated 2 years ago
- Instrument Rust code using Rust☆64Updated 6 years ago
- Cache & In-Memory optimizations for Rust, revived from the slabs of Sumer.☆30Updated 5 years ago
- ☆47Updated 5 years ago
- Faster, more flexible and more correct alternative to core::fmt☆40Updated 5 years ago
- Predicator, a Rust crate for generating and running dynamic code☆16Updated 7 years ago
- An in-memory topological sort algorithm for trees based on Group Theory☆23Updated 4 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆52Updated 2 years ago
- ☆30Updated 4 years ago
- Don't use this any more. Use std::sort_unstable☆17Updated 7 years ago