2 ms·
HAMT are efficient for persistent data structures, compared to more usual trees. They’re slower and less efficient than a mutable hashmap, but way more so if y
by masklinn 6y ago
HAMT are efficient for persistent data structures, compared to more usual trees.
They’re slower and less efficient than a mutable hashmap, but way more so if you need to keep the “old revisions” around.