HexTree
HexTree copied to clipboard
Trees for fast location-to-value lookup.
Add ability to merge res0 nodes from several disktrees.
For completeness sake, might as well implement IntoIterator which consumes the inner nodes and returns owned values.
Sometimes you don't want to compact a tree until all nodes have been inserted. w
Major goal: it would be awesome it we could both construct a compacted tree and drain it to a vec faster than calling libh3's `compact()` function. My gut feeling is...