A non-blocking concurrent map from hashable keys to values.
The implementation is based on
lock-free concurrent hash tries
(aka
Ctries) as described by:
- Aleksander Prokopec, Phil Bagwell, Martin Odersky, "Cache-Aware
Lock-Free Concurent Hash Tries"
- Aleksander Prokopec, Nathan G. Bronson, Phil Bagwell, Martin
Odersky "Concurrent Tries with Efficient Non-Blocking
Snapshots"
Operations have a worst-case complexity of
O(log n), with a
base equal to the size of the native
Word.