hamt-sync

HAMT implementation whose sub-trees can be shared over threads.

Hash-Array Mapped Trie (HAMT) is a data structure popular as a map (a.k.a. associative array or dictionary) or set. Its immutable variant is adopted widely by functional programming languages like Scala and Clojure to implement immutable and memory-efficient associative arrays and sets.

Technical notes

The implementation canonicalizes tree structures of HAMTs by eliminating intermediate nodes during delete operations as described in the CHAMP paper.

References

• Ideal Hash Trees
• Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections

License

MIT