A Java implementation of a map backed by a concurrent trie, as described by Prokopec, Bronson, Bagwell, and Odersky.
According to Wikipedia:
A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent map abstraction. It has particularly scalable concurrent insert and remove operations and is memory-efficient. It is the first known concurrent data-structure that supports O(1), atomic, lock-free snapshots.
This is work in progress.
- ✅ Map interface
- ✅ Lookup
- ✅ Insertion
- ✅ Removal
- ❌ Complex operations (computeIfAbsent, putIfPresent, etc.)
- ❌ Snapshots
- ❌ Performance tests
- ❌ Concurrency (integration) tests