Type for relative pointers to chunks in the tree. Kept 32bit for cache locality during lookups.
Encodes “None” variant as -1, and Some(idx) as positive numbers
This is not as fast as NonZeroU32, but close enough for our needs
Should you need > 2 billion chunks in the tree do let me know who sells you the RAM.
Tree node that encompasses multiple children at once. This just barely fits into one cache line for octree.
For each possible child, the node has two relative pointers:
Type for relative pointers to nodes in the tree. Kept 32bit for cache locality during lookups.
Should you need > 4 billion nodes in the tree do let me know who sells you the RAM.