Expand description
HAMST - Hash Array Mapped Shareable Tries
Each key is hashed and store related to the hash value.
When cloning the data structure, the nodes are shared, so that the operation is is really cheap. When modifying the data structure, after an explicit thawing, the mutable structure share the unmodified node and only nodes requiring modification will be re-created from the node onwards to the leaf.
Macros§
- hamt
- Construct a HAMT from a sequence of key/value pairs using a hashtable like syntax.