Blazing fast concurrent HashMap for Rust.

The fastest hashing algorithm 📈

A fast and ergonomic concurrent hashmap for read-heavy workloads.

🌀 Ridiculously fast, fully asynchronous, sharded hashmap for Rust.

A simple, fast and easy to use self-contained single file storage for Rust

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 (aka "linear map")

An inline SIMD accelerated hashmap designed for small amount of data.

A simple in-memory search for collections and key-value stores.

Collection initialization macros for Rust

RiteLinked - LinkedHashMap & LinkedHashSet in Rust

Non-blocking hash map in Rust

An LRU cache implementation with constant time operations and weighted semantic.

A defaultmap for rust

Declarative macros for statically initializing collections with ease

A concurrent lock-free hash map for Rust.

A key-value store benchmark framework with customizable workloads

Learned SPatial Hashmap

📈 The fastest map possible in Rust, where keys are integers and the capacity is fixed (faster than Vec!)