Maybe this is useful for real time memory management? 'arrays' for instance, if dynamically sized, can always cause fragmentation. It feels like you can get r

Maybe this is useful for real time memory management? 'arrays' for instance, if dynamically sized, can always cause fragmentation. It feels like you can get relatively efficient traversal and random access in these counted b-trees with fixed size blocks all the way down.