tiny.geometry.Storage

1/// Caller-owned memory for one tree. `centroids` is build scratch, and the2/// finished tree borrows the other three.3pub const Storage = struct {4    nodes: []Node,5    triangles: []Triangle,6    order: []u32,7    centroids: []Vec3,89    /// A tree has at most one leaf per triangle, so at most `2 n - 1` nodes.10    pub fn nodeCapacity(triangle_count: usize) usize {11        if (triangle_count == 0) return 1;12        return 2 * triangle_count - 1;13    }1415    pub fn alloc(gpa: Allocator, triangle_count: usize) Allocator.Error!Storage {16        assert(triangle_count <= triangle_mesh.max_triangles);17        const nodes = try gpa.alloc(Node, nodeCapacity(triangle_count));18        errdefer gpa.free(nodes);19        const triangles = try gpa.alloc(Triangle, triangle_count);20        errdefer gpa.free(triangles);21        const order = try gpa.alloc(u32, triangle_count);22        errdefer gpa.free(order);23        const centroids = try gpa.alloc(Vec3, triangle_count);24        return .{ .nodes = nodes, .triangles = triangles, .order = order, .centroids = centroids };25    }2627    pub fn free(storage: Storage, gpa: Allocator) void {28        gpa.free(storage.centroids);29        gpa.free(storage.order);30        gpa.free(storage.triangles);31        gpa.free(storage.nodes);32    }3334    pub fn fits(storage: Storage, triangle_count: usize) bool {35        return storage.nodes.len >= nodeCapacity(triangle_count) and36            storage.triangles.len >= triangle_count and37            storage.order.len >= triangle_count and38            storage.centroids.len >= triangle_count;39    }40};

1pub const Storage = bvh.Storage;