mirror of https://github.com/xacrimon/dashmap
Minor README update
While reading the README I got a bit confused about this paragraph. I hope this makes it more clear to readers.
This commit is contained in:
parent
1a31f4f598
commit
3c84dafe46
|
@ -8,8 +8,8 @@ DashMap tries to implement an easy to use API similar to `std::collections::Hash
|
|||
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.
|
||||
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.
|
||||
|
|
Loading…
Reference in New Issue