Mirror of xacrimon/dashmap on GitHub.
Go to file
2024-06-18 16:30:20 +02:00
.github/workflows cache-align the shards to improve throughput (#303) 2024-06-18 00:36:51 +02:00
src Merge branch 'arthurprs-small-optimizations' 2024-06-18 01:07:21 +02:00
.gitignore commit lockfile 2023-08-22 02:05:50 +02:00
Cargo.lock v6.0.0 2024-06-18 16:30:20 +02:00
Cargo.toml v6.0.0 2024-06-18 16:30:20 +02:00
LICENSE Add LICENSE 2019-08-25 17:53:42 +00:00
README.md bump msrv to 1.65 (#279) 2023-08-29 23:12:11 +02:00
rust-toolchain.toml bump msrv to 1.65 (#279) 2023-08-29 23:12:11 +02:00


Blazingly fast concurrent map in Rust.

DashMap is an implementation of a concurrent associative array/hashmap in Rust.

DashMap tries to implement an easy to use API similar to std::collections::HashMap with some slight changes to handle concurrency.

DashMap tries to be very simple to use and to be a direct replacement for RwLock<HashMap<K, V>>. To accomplish these goals, all methods take &self instead of modifying methods taking &mut self. This allows you to put a DashMap in an Arc<T> and share it between threads while still being able to modify it.

DashMap puts great effort into performance and aims to be as fast as possible. If you have any suggestions or tips do not hesitate to open an issue or a PR.




minimum rustc version

Cargo features

  • serde - Enables serde support.

  • raw-api - Enables the unstable raw-shard api.

  • rayon - Enables rayon support.

  • inline - Enables inline-more feature from the hashbrown crate. Can lead to better performance, but with the cost of longer compile-time.

  • arbitrary - Enables support for the arbitrary crate.


DashMap gladly accepts contributions! Do not hesitate to open issues or PR's.

I will take a look as soon as I have time for it.

That said I do not get paid (yet) to work on open-source. This means that my time is limited and my work here comes after my personal life.


A comprehensive benchmark suite including DashMap can be found here.

Special thanks


This project is licensed under MIT.