imagine-hussain

How would you consolidate this with the `try_insert` that already exists on `HashMap` that does: > Tries to insert a key-value pair into the map, and returns a mutable reference...

Is this method sufficient? https://docs.rs/dashmap/latest/dashmap/struct.DashMap.html#method.with_shard_amount Given that #shards needs to be a power of 2 according to the docs, I'm doubtful that having *exactly* one shard per key is possible...