Go to file
Acrimon 94c5a0d7c4
v2.0.2
2019-12-07 19:33:46 +01:00
assets Updated readme. 2019-12-06 22:57:19 +01:00
benches Added get benchmarks. 2019-12-06 22:57:19 +01:00
dashmap-shard Optimizations. 2019-12-06 22:57:07 +01:00
src Relax some bounds. 2019-12-07 19:33:28 +01:00
.gitignore Added extracted code from ccl. Hello new repo. 2019-08-26 20:08:21 +02:00
Cargo.toml v2.0.2 2019-12-07 19:33:46 +01:00
LICENSE Add LICENSE 2019-08-25 17:53:42 +00:00
README.md Remove pipeline badge and v2.0.1 2019-12-06 23:05:45 +01:00

README.md

dashmap

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 all methods take &self instead modifying methods taking &mut self. This allows you to put a DashMap in an Arc<T> and share it between threads while 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.

version

downloads

Contributing

DashMap is 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.

Performance

Benchmarks are currently not fantastic and can be improved and more can be created. Help is welcomed with open arms.

Insert Benchmark Get Benchmark

Google Doc

Special thanks

  • Karl Bergström

  • DPC

License

This project is licensed under MIT.