/Engine/Source/Runtime/Experimental/Chaos/Public/Chaos/AABBTree.h
Buffers for calculating the best candidate for tree insertion, reset per-calculation to avoid over allocation Tuple of Node/Index/Cost here avoids cache miss when accessing the node and its cost.
typedef [TTuple](API\Runtime\Core\Misc\TTuple)< [FNode](API\Runtime\Chaos\Chaos\TAABBTreeNode) &, int32, [FReal](API\Runtime\ChaosCore\Chaos\FReal) > FNodeIndexAndCost