Blazing fast concurrent HashMap for Rust.
-
Updated
Jun 24, 2024 - Rust
Blazing fast concurrent HashMap for Rust.
The fastest hashing algorithm 📈
A fast and ergonomic concurrent hash-table for read-heavy workloads.
A lock-free, partially wait-free, eventually consistent, concurrent hashmap.
Lock-free concurrent and single-threaded hash map implementations using Leapfrog probing. Currently the highest performance concurrent HashMap in Rust for certain use cases.
📈 The fastest (for very small maps!) alternative of Rust HashMap, which doesn't use hashing and doesn't use heap
A simple in-memory search for collections and key-value stores.
RiteLinked - LinkedHashMap & LinkedHashSet in Rust
Non-blocking hash map in Rust
A defaultmap for rust
A concurrent lock-free hash map for Rust.
Declarative macros for statically initializing collections with ease
📈 The fastest map possible in Rust, where keys are integers and the capacity is fixed (faster than Vec!)
A structure for mapping multiple hash sets together
Add a description, image, and links to the hashmap topic page so that developers can more easily learn about it.
To associate your repository with the hashmap topic, visit your repo's landing page and select "manage topics."