Description
The SegmentMK already uses the Hash Array Mapped Trie (HAMT) data structure for the child node entries of a node. This persistent data structure allows child node entries to be added, modified or changed in O(log n) added bytes of storage. However, we so far only have the code to write a new HAMT data structure from scratch, not the code to selectively update just parts of it. To properly support large, flat content we need to implement also the latter part.