@zephyr3d/scene 0.8.0 → 0.8.2

package/dist/src/utility/aabbtree.js

@@ -1,400 +0,0 @@
-import { Vector3, AABB } from '@zephyr3d/base';
-
-const tmpTriangle = [
-    0,
-    0,
-    0
-];
-/**
- * Axis-Aligned Bounding Box Tree
- * @public
- */ class AABBTree {
-    /** @internal */ _primitivesInfo;
-    /** @internal */ _nodes;
-    constructor(other){
-        this._primitivesInfo = null;
-        this._nodes = null;
-        if (other) {
-            this._primitivesInfo = other._primitivesInfo ? {
-                vertices: other._primitivesInfo.vertices?.map((value)=>new Vector3(value)),
-                indices: other._primitivesInfo.indices?.map((value)=>value),
-                primitiveType: other._primitivesInfo.primitiveType
-            } : null;
-            this._nodes = other._nodes ? other._nodes.map((value)=>{
-                return {
-                    box: new AABB(value.box),
-                    triangles: value.triangles?.map((val)=>val),
-                    axis: value.axis,
-                    left: value.left,
-                    right: value.right
-                };
-            }) : null;
-        }
-    }
-    /**
-   * Build the AABB tree from a polygon soup
-   * @param vertices - Vertices of the polygon soup
-   * @param indices - indices of the polygon soup
-   * @param primitiveType - Prmitive type of the polygon soup
-   */ buildFromPrimitives(vertices, indices, primitiveType) {
-        this._primitivesInfo = {
-            vertices: [],
-            indices: null,
-            primitiveType: primitiveType
-        };
-        for(let i = 0; i < vertices.length; i += 3){
-            this._primitivesInfo.vertices.push(new Vector3(vertices[i], vertices[i + 1], vertices[i + 2]));
-        }
-        if (indices) {
-            this._primitivesInfo.indices = [];
-            for (const index of indices){
-                this._primitivesInfo.indices.push(index);
-            }
-        }
-        this._buildSubNodes();
-    }
-    /**
-   * Checks for intersection between a ray and the AABB tree without calculating the intersection point
-   * @param ray - The ray being traced
-   * @returns true if the ray hits the AABB tree, false otherwise
-   */ rayIntersectionTest(ray) {
-        return this._nodes.length > 0 ? this._rayIntersectionTest(0, ray) : false;
-    }
-    /**
-   * Checks for intersection between a ray and the AABB tree
-   * @param ray - The ray being traced
-   * @returns The distance between the ray origin and the hit point if the ray hits the AABB tree, null otherwise
-   */ rayIntersectionDistance(ray) {
-        return this._nodes.length > 0 ? this._rayIntersectionDistance(0, ray) : null;
-    }
-    /**
-   * Gets the top level bounding box of the tree
-   * @returns The top level bounding box
-   */ getTopLevelAABB() {
-        return this._nodes.length > 0 ? this._nodes[0].box : null;
-    }
-    /**
-   * Transform the tree by a matrix
-   * @param matrix - The transform matrix
-   */ transform(matrix) {
-        if (matrix && this._primitivesInfo && this._primitivesInfo.vertices) {
-            for (const vert of this._primitivesInfo.vertices){
-                matrix.transformPointAffine(vert, vert);
-            }
-            this._buildSubNodes();
-        }
-    }
-    /** @internal */ verify() {
-        const numTris = this._verifyNode(0);
-        const n = this._getNumTriangles();
-        if (numTris !== n) {
-            throw new Error(`AABB tree verification failed: triangle count mismatch, got ${numTris}, expect ${n}`);
-        }
-    }
-    /** @internal */ _verifyNode(nodeIndex) {
-        const node = this._nodes[nodeIndex];
-        if (!node) {
-            throw new Error(`AABB tree verification failed: invalid node index: ${nodeIndex}`);
-        }
-        let numTris = 0;
-        const extents = node.box.extents[node.axis];
-        const tmpTri = [
-            0,
-            0,
-            0
-        ];
-        for (const tri of node.triangles){
-            this._getTriangle(tri, tmpTri);
-            let max = Number.MIN_VALUE;
-            let min = Number.MAX_VALUE;
-            for (const v of tmpTri){
-                const p = this._primitivesInfo.vertices[v];
-                if (!node.box.containsPoint(p)) {
-                    throw new Error(`AABB tree verification failed: triangle not inside AABB`);
-                }
-                const t = p[node.axis];
-                if (t < min) {
-                    min = t;
-                }
-                if (t > max) {
-                    max = t;
-                }
-                if (max - min <= extents) {
-                    throw new Error(`AABB tree verification failed: extents test failed`);
-                }
-            }
-        }
-        numTris += node.triangles.length;
-        if (node.left >= 0) {
-            numTris += this._verifyNode(node.left);
-        }
-        if (node.right >= 0) {
-            numTris += this._verifyNode(node.right);
-        }
-        return numTris;
-    }
-    /** @internal */ _buildNode(nodeIndex, triangles, triangleMin, triangleMax) {
-        const node = this._nodes[nodeIndex];
-        if (triangles.length === 1) {
-            node.triangles.push(triangles[0]);
-        } else {
-            const splitAxis = node.axis = this._selectBestSplitAxis(node.box.extents, triangles, triangleMin, triangleMax);
-            const sizeMax = node.box.extents[splitAxis];
-            const sizeCenter = node.box.center[splitAxis];
-            const sizeLeft = sizeCenter - node.box.extents[splitAxis] * 0.5;
-            const leftTriangles = [];
-            const rightTriangles = [];
-            const leftbox = new AABB();
-            leftbox.beginExtend();
-            const rightbox = new AABB();
-            rightbox.beginExtend();
-            for (const tri of triangles){
-                const min = triangleMin[tri];
-                const max = triangleMax[tri];
-                const size = max[splitAxis] - min[splitAxis];
-                if (size >= sizeMax) {
-                    node.triangles.push(tri);
-                } else if (max[splitAxis] <= sizeCenter || min[splitAxis] <= sizeLeft) {
-                    leftTriangles.push(tri);
-                    leftbox.extend3(min[0], min[1], min[2]);
-                    leftbox.extend3(max[0], max[1], max[2]);
-                } else {
-                    rightTriangles.push(tri);
-                    rightbox.extend3(min[0], min[1], min[2]);
-                    rightbox.extend3(max[0], max[1], max[2]);
-                }
-            }
-            if (leftTriangles.length) {
-                this._nodes.push({
-                    box: leftbox,
-                    triangles: [],
-                    axis: -1,
-                    left: -1,
-                    right: -1
-                });
-                node.left = this._nodes.length - 1;
-                this._buildNode(this._nodes.length - 1, leftTriangles, triangleMin, triangleMax);
-            }
-            if (rightTriangles.length) {
-                this._nodes.push({
-                    box: rightbox,
-                    triangles: [],
-                    axis: -1,
-                    left: -1,
-                    right: -1
-                });
-                node.right = this._nodes.length - 1;
-                this._buildNode(this._nodes.length - 1, rightTriangles, triangleMin, triangleMax);
-            }
-        }
-    }
-    /** @internal */ _selectBestSplitAxis(extents, triangles, triangleMin, triangleMax) {
-        const dx = extents.x, dy = extents.y, dz = extents.z;
-        let nx = 0, ny = 0, nz = 0;
-        for (const tri of triangles){
-            const max = triangleMax[tri];
-            const min = triangleMin[tri];
-            if (max[0] - min[0] >= dx) {
-                nx++;
-            }
-            if (max[1] - min[1] >= dy) {
-                ny++;
-            }
-            if (max[2] - min[2] >= dz) {
-                nz++;
-            }
-        }
-        if (nx < ny) {
-            if (nx < nz) {
-                return 0;
-            } else {
-                return nx === nz ? dx > dz ? 0 : 2 : 2;
-            }
-        } else if (nx == ny) {
-            if (nz < nx) {
-                return 2;
-            } else if (nz > nx) {
-                return dx > dy ? 0 : 1;
-            } else {
-                if (dx < dy) {
-                    return dy > dz ? 1 : 2;
-                } else {
-                    return dx > dz ? 0 : 2;
-                }
-            }
-        } else {
-            if (ny < nz) {
-                return 1;
-            } else {
-                return ny === nz ? dy > dz ? 1 : 2 : 2;
-            }
-        }
-    }
-    /** @internal */ _getNumTriangles() {
-        const numIndices = this._primitivesInfo.indices ? this._primitivesInfo.indices.length : this._primitivesInfo.vertices.length;
-        switch(this._primitivesInfo.primitiveType){
-            case 'triangle-list':
-                return Math.floor(numIndices / 3);
-            case 'triangle-strip':
-                return numIndices - 2;
-            case 'triangle-fan':
-                return numIndices - 2;
-            default:
-                return 0;
-        }
-    }
-    /** @internal */ _rayIntersectionDistance(nodeIndex, ray) {
-        const node = this._nodes[nodeIndex];
-        if (!ray.bboxIntersectionTest(node.box)) {
-            return null;
-        }
-        let minDist = Number.MAX_VALUE;
-        for (const tri of node.triangles){
-            this._getTriangle(tri, tmpTriangle);
-            const v0 = this._primitivesInfo.vertices[tmpTriangle[0]];
-            const v1 = this._primitivesInfo.vertices[tmpTriangle[1]];
-            const v2 = this._primitivesInfo.vertices[tmpTriangle[2]];
-            const dist = ray.intersectionTestTriangle(v0, v1, v2, false);
-            if (dist !== null && dist >= 0 && dist < minDist) {
-                minDist = dist;
-            }
-        }
-        let a, b;
-        if (node.axis >= 0) {
-            if (ray.direction[node.axis] < 0) {
-                a = node.right;
-                b = node.left;
-            } else {
-                a = node.left;
-                b = node.right;
-            }
-            if (a >= 0) {
-                const dist = this._rayIntersectionDistance(a, ray);
-                if (dist !== null && dist >= 0 && dist < minDist) {
-                    minDist = dist;
-                }
-            }
-            if (b >= 0) {
-                const dist = this._rayIntersectionDistance(b, ray);
-                if (dist !== null && dist >= 0 && dist < minDist) {
-                    minDist = dist;
-                }
-            }
-        }
-        return minDist === Number.MAX_VALUE ? null : minDist;
-    }
-    /** @internal */ _rayIntersectionTest(nodeIndex, ray) {
-        const node = this._nodes[nodeIndex];
-        if (!ray.bboxIntersectionTest(node.box)) {
-            return false;
-        }
-        for (const tri of node.triangles){
-            this._getTriangle(tri, tmpTriangle);
-            const v0 = this._primitivesInfo.vertices[tmpTriangle[0]];
-            const v1 = this._primitivesInfo.vertices[tmpTriangle[1]];
-            const v2 = this._primitivesInfo.vertices[tmpTriangle[2]];
-            const dist = ray.intersectionTestTriangle(v0, v1, v2, false);
-            if (dist !== null && dist > 0) {
-                return true;
-            }
-        }
-        let a, b;
-        if (node.axis >= 0) {
-            if (ray.direction[node.axis] < 0) {
-                a = node.right;
-                b = node.left;
-            } else {
-                a = node.left;
-                b = node.right;
-            }
-            if (a >= 0 && this._rayIntersectionTest(a, ray)) {
-                return true;
-            }
-            if (b >= 0 && this._rayIntersectionTest(b, ray)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    /** @internal */ _getTriangle(n, out) {
-        const indices = this._primitivesInfo.indices;
-        let v0, v1, v2;
-        out = out || [
-            0,
-            0,
-            0
-        ];
-        switch(this._primitivesInfo.primitiveType){
-            case 'triangle-list':
-                v0 = n * 3;
-                v1 = v0 + 1;
-                v2 = v0 + 2;
-                break;
-            case 'triangle-strip':
-                {
-                    const r = n % 2;
-                    v0 = n + r;
-                    v1 = n - r + 1;
-                    v2 = n + 2;
-                    break;
-                }
-            case 'triangle-fan':
-                v0 = 0;
-                v1 = n + 1;
-                v2 = n + 2;
-                break;
-            default:
-                return null;
-        }
-        out[0] = indices ? indices[v0] : v0;
-        out[1] = indices ? indices[v1] : v1;
-        out[2] = indices ? indices[v2] : v2;
-        return out;
-    }
-    /** @internal */ _buildSubNodes() {
-        const triangleMin = [];
-        const triangleMax = [];
-        const triangles = [];
-        const numTriangles = this._getNumTriangles();
-        const rootNode = {
-            box: new AABB(),
-            triangles: [],
-            axis: -1,
-            left: -1,
-            right: -1
-        };
-        rootNode.box.beginExtend();
-        for(let i = 0; i < numTriangles; i++){
-            triangles.push(i);
-            this._getTriangle(i, tmpTriangle);
-            const v0 = this._primitivesInfo.vertices[tmpTriangle[0]];
-            const v1 = this._primitivesInfo.vertices[tmpTriangle[1]];
-            const v2 = this._primitivesInfo.vertices[tmpTriangle[2]];
-            const min = [
-                Math.min(Math.min(v0.x, v1.x), v2.x),
-                Math.min(Math.min(v0.y, v1.y), v2.y),
-                Math.min(Math.min(v0.z, v1.z), v2.z)
-            ];
-            rootNode.box.extend3(min[0], min[1], min[2]);
-            triangleMin.push(min);
-            const max = [
-                Math.max(Math.max(v0.x, v1.x), v2.x),
-                Math.max(Math.max(v0.y, v1.y), v2.y),
-                Math.max(Math.max(v0.z, v1.z), v2.z)
-            ];
-            rootNode.box.extend3(max[0], max[1], max[2]);
-            triangleMax.push(max);
-        }
-        if (rootNode.box.isValid()) {
-            this._nodes = [
-                rootNode
-            ];
-            this._buildNode(0, triangles, triangleMin, triangleMax);
-        } else {
-            this._nodes = [];
-        }
-    }
-}
-
-export { AABBTree };
-//# sourceMappingURL=aabbtree.js.map

package/dist/src/utility/aabbtree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"aabbtree.js","sources":["../../../src/utility/aabbtree.ts"],"sourcesContent":["import type { TypedArray, Matrix4x4, Ray } from '@zephyr3d/base';\r\nimport { AABB, Vector3 } from '@zephyr3d/base';\r\nimport type { PrimitiveType } from '@zephyr3d/device';\r\n\r\ninterface PrimitivesInfo {\r\n  vertices: Vector3[];\r\n  indices: number[];\r\n  primitiveType: PrimitiveType;\r\n}\r\n\r\ninterface AABBTreeNode {\r\n  box: AABB;\r\n  triangles: number[];\r\n  axis: number;\r\n  left: number;\r\n  right: number;\r\n}\r\n\r\nconst tmpTriangle: [number, number, number] = [0, 0, 0];\r\n\r\n/**\r\n * Axis-Aligned Bounding Box Tree\r\n * @public\r\n */\r\nexport class AABBTree {\r\n  /** @internal */\r\n  private _primitivesInfo: PrimitivesInfo;\r\n  /** @internal */\r\n  private _nodes: AABBTreeNode[];\r\n  /** Creates an empty AABB tree */\r\n  constructor();\r\n  /** Creates an AABB tree by copying from another AABB tree */\r\n  constructor(rhs: AABBTree);\r\n  constructor(other?: AABBTree) {\r\n    this._primitivesInfo = null;\r\n    this._nodes = null;\r\n    if (other) {\r\n      this._primitivesInfo = other._primitivesInfo\r\n        ? {\r\n            vertices: other._primitivesInfo.vertices?.map((value) => new Vector3(value)),\r\n            indices: other._primitivesInfo.indices?.map((value) => value),\r\n            primitiveType: other._primitivesInfo.primitiveType\r\n          }\r\n        : null;\r\n      this._nodes = other._nodes\r\n        ? other._nodes.map((value) => {\r\n            return {\r\n              box: new AABB(value.box),\r\n              triangles: value.triangles?.map((val) => val),\r\n              axis: value.axis,\r\n              left: value.left,\r\n              right: value.right\r\n            };\r\n          })\r\n        : null;\r\n    }\r\n  }\r\n  /**\r\n   * Build the AABB tree from a polygon soup\r\n   * @param vertices - Vertices of the polygon soup\r\n   * @param indices - indices of the polygon soup\r\n   * @param primitiveType - Prmitive type of the polygon soup\r\n   */\r\n  buildFromPrimitives(\r\n    vertices: number[] | TypedArray,\r\n    indices: number[] | TypedArray,\r\n    primitiveType: PrimitiveType\r\n  ): void {\r\n    this._primitivesInfo = {\r\n      vertices: [],\r\n      indices: null,\r\n      primitiveType: primitiveType\r\n    };\r\n    for (let i = 0; i < vertices.length; i += 3) {\r\n      this._primitivesInfo.vertices.push(\r\n        new Vector3(vertices[i] as number, vertices[i + 1] as number, vertices[i + 2] as number)\r\n      );\r\n    }\r\n    if (indices) {\r\n      this._primitivesInfo.indices = [];\r\n      for (const index of indices) {\r\n        this._primitivesInfo.indices.push(index as number);\r\n      }\r\n    }\r\n    this._buildSubNodes();\r\n  }\r\n  /**\r\n   * Checks for intersection between a ray and the AABB tree without calculating the intersection point\r\n   * @param ray - The ray being traced\r\n   * @returns true if the ray hits the AABB tree, false otherwise\r\n   */\r\n  rayIntersectionTest(ray: Ray): boolean {\r\n    return this._nodes.length > 0 ? this._rayIntersectionTest(0, ray) : false;\r\n  }\r\n  /**\r\n   * Checks for intersection between a ray and the AABB tree\r\n   * @param ray - The ray being traced\r\n   * @returns The distance between the ray origin and the hit point if the ray hits the AABB tree, null otherwise\r\n   */\r\n  rayIntersectionDistance(ray: Ray): number {\r\n    return this._nodes.length > 0 ? this._rayIntersectionDistance(0, ray) : null;\r\n  }\r\n  /**\r\n   * Gets the top level bounding box of the tree\r\n   * @returns The top level bounding box\r\n   */\r\n  getTopLevelAABB(): AABB {\r\n    return this._nodes.length > 0 ? this._nodes[0].box : null;\r\n  }\r\n  /**\r\n   * Transform the tree by a matrix\r\n   * @param matrix - The transform matrix\r\n   */\r\n  transform(matrix: Matrix4x4): void {\r\n    if (matrix && this._primitivesInfo && this._primitivesInfo.vertices) {\r\n      for (const vert of this._primitivesInfo.vertices) {\r\n        matrix.transformPointAffine(vert, vert);\r\n      }\r\n      this._buildSubNodes();\r\n    }\r\n  }\r\n  /** @internal */\r\n  verify() {\r\n    const numTris = this._verifyNode(0);\r\n    const n = this._getNumTriangles();\r\n    if (numTris !== n) {\r\n      throw new Error(`AABB tree verification failed: triangle count mismatch, got ${numTris}, expect ${n}`);\r\n    }\r\n  }\r\n  /** @internal */\r\n  private _verifyNode(nodeIndex: number): number {\r\n    const node = this._nodes[nodeIndex];\r\n    if (!node) {\r\n      throw new Error(`AABB tree verification failed: invalid node index: ${nodeIndex}`);\r\n    }\r\n    let numTris = 0;\r\n    const extents = node.box.extents[node.axis];\r\n    const tmpTri: [number, number, number] = [0, 0, 0];\r\n    for (const tri of node.triangles) {\r\n      this._getTriangle(tri, tmpTri);\r\n      let max = Number.MIN_VALUE;\r\n      let min = Number.MAX_VALUE;\r\n      for (const v of tmpTri) {\r\n        const p = this._primitivesInfo.vertices[v];\r\n        if (!node.box.containsPoint(p)) {\r\n          throw new Error(`AABB tree verification failed: triangle not inside AABB`);\r\n        }\r\n        const t = p[node.axis];\r\n        if (t < min) {\r\n          min = t;\r\n        }\r\n        if (t > max) {\r\n          max = t;\r\n        }\r\n        if (max - min <= extents) {\r\n          throw new Error(`AABB tree verification failed: extents test failed`);\r\n        }\r\n      }\r\n    }\r\n    numTris += node.triangles.length;\r\n    if (node.left >= 0) {\r\n      numTris += this._verifyNode(node.left);\r\n    }\r\n    if (node.right >= 0) {\r\n      numTris += this._verifyNode(node.right);\r\n    }\r\n    return numTris;\r\n  }\r\n  /** @internal */\r\n  private _buildNode(\r\n    nodeIndex: number,\r\n    triangles: number[],\r\n    triangleMin: [number, number, number][],\r\n    triangleMax: [number, number, number][]\r\n  ) {\r\n    const node = this._nodes[nodeIndex];\r\n    if (triangles.length === 1) {\r\n      node.triangles.push(triangles[0]);\r\n    } else {\r\n      const splitAxis = (node.axis = this._selectBestSplitAxis(\r\n        node.box.extents,\r\n        triangles,\r\n        triangleMin,\r\n        triangleMax\r\n      ));\r\n      const sizeMax = node.box.extents[splitAxis];\r\n      const sizeCenter = node.box.center[splitAxis];\r\n      const sizeLeft = sizeCenter - node.box.extents[splitAxis] * 0.5;\r\n      const leftTriangles: number[] = [];\r\n      const rightTriangles: number[] = [];\r\n      const leftbox = new AABB();\r\n      leftbox.beginExtend();\r\n      const rightbox = new AABB();\r\n      rightbox.beginExtend();\r\n      for (const tri of triangles) {\r\n        const min = triangleMin[tri];\r\n        const max = triangleMax[tri];\r\n        const size = max[splitAxis] - min[splitAxis];\r\n        if (size >= sizeMax) {\r\n          node.triangles.push(tri);\r\n        } else if (max[splitAxis] <= sizeCenter || min[splitAxis] <= sizeLeft) {\r\n          leftTriangles.push(tri);\r\n          leftbox.extend3(min[0], min[1], min[2]);\r\n          leftbox.extend3(max[0], max[1], max[2]);\r\n        } else {\r\n          rightTriangles.push(tri);\r\n          rightbox.extend3(min[0], min[1], min[2]);\r\n          rightbox.extend3(max[0], max[1], max[2]);\r\n        }\r\n      }\r\n      if (leftTriangles.length) {\r\n        this._nodes.push({\r\n          box: leftbox,\r\n          triangles: [],\r\n          axis: -1,\r\n          left: -1,\r\n          right: -1\r\n        });\r\n        node.left = this._nodes.length - 1;\r\n        this._buildNode(this._nodes.length - 1, leftTriangles, triangleMin, triangleMax);\r\n      }\r\n      if (rightTriangles.length) {\r\n        this._nodes.push({\r\n          box: rightbox,\r\n          triangles: [],\r\n          axis: -1,\r\n          left: -1,\r\n          right: -1\r\n        });\r\n        node.right = this._nodes.length - 1;\r\n        this._buildNode(this._nodes.length - 1, rightTriangles, triangleMin, triangleMax);\r\n      }\r\n    }\r\n  }\r\n  /** @internal */\r\n  private _selectBestSplitAxis(\r\n    extents: Vector3,\r\n    triangles: number[],\r\n    triangleMin: [number, number, number][],\r\n    triangleMax: [number, number, number][]\r\n  ): number {\r\n    const dx = extents.x,\r\n      dy = extents.y,\r\n      dz = extents.z;\r\n    let nx = 0,\r\n      ny = 0,\r\n      nz = 0;\r\n    for (const tri of triangles) {\r\n      const max = triangleMax[tri];\r\n      const min = triangleMin[tri];\r\n      if (max[0] - min[0] >= dx) {\r\n        nx++;\r\n      }\r\n      if (max[1] - min[1] >= dy) {\r\n        ny++;\r\n      }\r\n      if (max[2] - min[2] >= dz) {\r\n        nz++;\r\n      }\r\n    }\r\n    if (nx < ny) {\r\n      if (nx < nz) {\r\n        return 0;\r\n      } else {\r\n        return nx === nz ? (dx > dz ? 0 : 2) : 2;\r\n      }\r\n    } else if (nx == ny) {\r\n      if (nz < nx) {\r\n        return 2;\r\n      } else if (nz > nx) {\r\n        return dx > dy ? 0 : 1;\r\n      } else {\r\n        if (dx < dy) {\r\n          return dy > dz ? 1 : 2;\r\n        } else {\r\n          return dx > dz ? 0 : 2;\r\n        }\r\n      }\r\n    } else {\r\n      if (ny < nz) {\r\n        return 1;\r\n      } else {\r\n        return ny === nz ? (dy > dz ? 1 : 2) : 2;\r\n      }\r\n    }\r\n  }\r\n  /** @internal */\r\n  private _getNumTriangles() {\r\n    const numIndices = this._primitivesInfo.indices\r\n      ? this._primitivesInfo.indices.length\r\n      : this._primitivesInfo.vertices.length;\r\n    switch (this._primitivesInfo.primitiveType) {\r\n      case 'triangle-list':\r\n        return Math.floor(numIndices / 3);\r\n      case 'triangle-strip':\r\n        return numIndices - 2;\r\n      case 'triangle-fan':\r\n        return numIndices - 2;\r\n      default:\r\n        return 0;\r\n    }\r\n  }\r\n  /** @internal */\r\n  private _rayIntersectionDistance(nodeIndex: number, ray: Ray): number {\r\n    const node = this._nodes[nodeIndex];\r\n    if (!ray.bboxIntersectionTest(node.box)) {\r\n      return null;\r\n    }\r\n    let minDist = Number.MAX_VALUE;\r\n    for (const tri of node.triangles) {\r\n      this._getTriangle(tri, tmpTriangle);\r\n      const v0 = this._primitivesInfo.vertices[tmpTriangle[0]];\r\n      const v1 = this._primitivesInfo.vertices[tmpTriangle[1]];\r\n      const v2 = this._primitivesInfo.vertices[tmpTriangle[2]];\r\n      const dist = ray.intersectionTestTriangle(v0, v1, v2, false);\r\n      if (dist !== null && dist >= 0 && dist < minDist) {\r\n        minDist = dist;\r\n      }\r\n    }\r\n    let a: number, b: number;\r\n    if (node.axis >= 0) {\r\n      if (ray.direction[node.axis] < 0) {\r\n        a = node.right;\r\n        b = node.left;\r\n      } else {\r\n        a = node.left;\r\n        b = node.right;\r\n      }\r\n      if (a >= 0) {\r\n        const dist = this._rayIntersectionDistance(a, ray);\r\n        if (dist !== null && dist >= 0 && dist < minDist) {\r\n          minDist = dist;\r\n        }\r\n      }\r\n      if (b >= 0) {\r\n        const dist = this._rayIntersectionDistance(b, ray);\r\n        if (dist !== null && dist >= 0 && dist < minDist) {\r\n          minDist = dist;\r\n        }\r\n      }\r\n    }\r\n    return minDist === Number.MAX_VALUE ? null : minDist;\r\n  }\r\n  /** @internal */\r\n  private _rayIntersectionTest(nodeIndex: number, ray: Ray): boolean {\r\n    const node = this._nodes[nodeIndex];\r\n    if (!ray.bboxIntersectionTest(node.box)) {\r\n      return false;\r\n    }\r\n    for (const tri of node.triangles) {\r\n      this._getTriangle(tri, tmpTriangle);\r\n      const v0 = this._primitivesInfo.vertices[tmpTriangle[0]];\r\n      const v1 = this._primitivesInfo.vertices[tmpTriangle[1]];\r\n      const v2 = this._primitivesInfo.vertices[tmpTriangle[2]];\r\n      const dist = ray.intersectionTestTriangle(v0, v1, v2, false);\r\n      if (dist !== null && dist > 0) {\r\n        return true;\r\n      }\r\n    }\r\n    let a: number, b: number;\r\n    if (node.axis >= 0) {\r\n      if (ray.direction[node.axis] < 0) {\r\n        a = node.right;\r\n        b = node.left;\r\n      } else {\r\n        a = node.left;\r\n        b = node.right;\r\n      }\r\n      if (a >= 0 && this._rayIntersectionTest(a, ray)) {\r\n        return true;\r\n      }\r\n      if (b >= 0 && this._rayIntersectionTest(b, ray)) {\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** @internal */\r\n  private _getTriangle(n: number, out: [number, number, number]): [number, number, number] {\r\n    const indices = this._primitivesInfo.indices;\r\n    let v0: number, v1: number, v2: number;\r\n    out = out || [0, 0, 0];\r\n    switch (this._primitivesInfo.primitiveType) {\r\n      case 'triangle-list':\r\n        v0 = n * 3;\r\n        v1 = v0 + 1;\r\n        v2 = v0 + 2;\r\n        break;\r\n      case 'triangle-strip': {\r\n        const r = n % 2;\r\n        v0 = n + r;\r\n        v1 = n - r + 1;\r\n        v2 = n + 2;\r\n        break;\r\n      }\r\n      case 'triangle-fan':\r\n        v0 = 0;\r\n        v1 = n + 1;\r\n        v2 = n + 2;\r\n        break;\r\n      default:\r\n        return null;\r\n    }\r\n    out[0] = indices ? indices[v0] : v0;\r\n    out[1] = indices ? indices[v1] : v1;\r\n    out[2] = indices ? indices[v2] : v2;\r\n    return out;\r\n  }\r\n  /** @internal */\r\n  _buildSubNodes() {\r\n    const triangleMin: [number, number, number][] = [];\r\n    const triangleMax: [number, number, number][] = [];\r\n    const triangles: number[] = [];\r\n    const numTriangles = this._getNumTriangles();\r\n    const rootNode = {\r\n      box: new AABB(),\r\n      triangles: [],\r\n      axis: -1,\r\n      left: -1,\r\n      right: -1\r\n    };\r\n    rootNode.box.beginExtend();\r\n    for (let i = 0; i < numTriangles; i++) {\r\n      triangles.push(i);\r\n      this._getTriangle(i, tmpTriangle);\r\n      const v0 = this._primitivesInfo.vertices[tmpTriangle[0]];\r\n      const v1 = this._primitivesInfo.vertices[tmpTriangle[1]];\r\n      const v2 = this._primitivesInfo.vertices[tmpTriangle[2]];\r\n      const min: [number, number, number] = [\r\n        Math.min(Math.min(v0.x, v1.x), v2.x),\r\n        Math.min(Math.min(v0.y, v1.y), v2.y),\r\n        Math.min(Math.min(v0.z, v1.z), v2.z)\r\n      ];\r\n      rootNode.box.extend3(min[0], min[1], min[2]);\r\n      triangleMin.push(min);\r\n      const max: [number, number, number] = [\r\n        Math.max(Math.max(v0.x, v1.x), v2.x),\r\n        Math.max(Math.max(v0.y, v1.y), v2.y),\r\n        Math.max(Math.max(v0.z, v1.z), v2.z)\r\n      ];\r\n      rootNode.box.extend3(max[0], max[1], max[2]);\r\n      triangleMax.push(max);\r\n    }\r\n    if (rootNode.box.isValid()) {\r\n      this._nodes = [rootNode];\r\n      this._buildNode(0, triangles, triangleMin, triangleMax);\r\n    } else {\r\n      this._nodes = [];\r\n    }\r\n  }\r\n}\r\n"],"names":["tmpTriangle","AABBTree","other","_primitivesInfo","_nodes","vertices","map","value","Vector3","indices","primitiveType","box","AABB","triangles","val","axis","left","right","buildFromPrimitives","i","length","push","index","_buildSubNodes","rayIntersectionTest","ray","_rayIntersectionTest","rayIntersectionDistance","_rayIntersectionDistance","getTopLevelAABB","transform","matrix","vert","transformPointAffine","verify","numTris","_verifyNode","n","_getNumTriangles","Error","nodeIndex","node","extents","tmpTri","tri","_getTriangle","max","Number","MIN_VALUE","min","MAX_VALUE","v","p","containsPoint","t","_buildNode","triangleMin","triangleMax","splitAxis","_selectBestSplitAxis","sizeMax","sizeCenter","center","sizeLeft","leftTriangles","rightTriangles","leftbox","beginExtend","rightbox","size","extend3","dx","x","dy","y","dz","z","nx","ny","nz","numIndices","Math","floor","bboxIntersectionTest","minDist","v0","v1","v2","dist","intersectionTestTriangle","a","b","direction","out","r","numTriangles","rootNode","isValid"],"mappings":";;AAkBA,MAAMA,WAAwC,GAAA;AAAC,IAAA,CAAA;AAAG,IAAA,CAAA;AAAG,IAAA;AAAE,CAAA;AAEvD;;;AAGC,IACM,MAAMC,QAAAA,CAAAA;qBAEX,eAAwC;qBAExC,MAA+B;AAK/B,IAAA,WAAA,CAAYC,KAAgB,CAAE;QAC5B,IAAI,CAACC,eAAe,GAAG,IAAA;QACvB,IAAI,CAACC,MAAM,GAAG,IAAA;AACd,QAAA,IAAIF,KAAO,EAAA;AACT,YAAA,IAAI,CAACC,eAAe,GAAGD,KAAAA,CAAMC,eAAe,GACxC;gBACEE,QAAUH,EAAAA,KAAAA,CAAMC,eAAe,CAACE,QAAQ,EAAEC,GAAI,CAAA,CAACC,KAAU,GAAA,IAAIC,OAAQD,CAAAA,KAAAA,CAAAA,CAAAA;AACrEE,gBAAAA,OAAAA,EAASP,MAAMC,eAAe,CAACM,OAAO,EAAEH,GAAAA,CAAI,CAACC,KAAUA,GAAAA,KAAAA,CAAAA;gBACvDG,aAAeR,EAAAA,KAAAA,CAAMC,eAAe,CAACO;aAEvC,GAAA,IAAA;YACJ,IAAI,CAACN,MAAM,GAAGF,KAAME,CAAAA,MAAM,GACtBF,KAAAA,CAAME,MAAM,CAACE,GAAG,CAAC,CAACC,KAAAA,GAAAA;gBAChB,OAAO;oBACLI,GAAK,EAAA,IAAIC,IAAKL,CAAAA,KAAAA,CAAMI,GAAG,CAAA;AACvBE,oBAAAA,SAAAA,EAAWN,KAAMM,CAAAA,SAAS,EAAEP,GAAAA,CAAI,CAACQ,GAAQA,GAAAA,GAAAA,CAAAA;AACzCC,oBAAAA,IAAAA,EAAMR,MAAMQ,IAAI;AAChBC,oBAAAA,IAAAA,EAAMT,MAAMS,IAAI;AAChBC,oBAAAA,KAAAA,EAAOV,MAAMU;AACf,iBAAA;aAEF,CAAA,GAAA,IAAA;AACN;AACF;AACA;;;;;AAKC,MACDC,oBACEb,QAA+B,EAC/BI,OAA8B,EAC9BC,aAA4B,EACtB;QACN,IAAI,CAACP,eAAe,GAAG;AACrBE,YAAAA,QAAAA,EAAU,EAAE;YACZI,OAAS,EAAA,IAAA;YACTC,aAAeA,EAAAA;AACjB,SAAA;QACA,IAAK,IAAIS,IAAI,CAAGA,EAAAA,CAAAA,GAAId,SAASe,MAAM,EAAED,KAAK,CAAG,CAAA;YAC3C,IAAI,CAAChB,eAAe,CAACE,QAAQ,CAACgB,IAAI,CAChC,IAAIb,OAAQH,CAAAA,QAAQ,CAACc,CAAE,CAAA,EAAYd,QAAQ,CAACc,CAAAA,GAAI,EAAE,EAAYd,QAAQ,CAACc,CAAAA,GAAI,CAAE,CAAA,CAAA,CAAA;AAEjF;AACA,QAAA,IAAIV,OAAS,EAAA;AACX,YAAA,IAAI,CAACN,eAAe,CAACM,OAAO,GAAG,EAAE;YACjC,KAAK,MAAMa,SAASb,OAAS,CAAA;AAC3B,gBAAA,IAAI,CAACN,eAAe,CAACM,OAAO,CAACY,IAAI,CAACC,KAAAA,CAAAA;AACpC;AACF;AACA,QAAA,IAAI,CAACC,cAAc,EAAA;AACrB;AACA;;;;MAKAC,mBAAAA,CAAoBC,GAAQ,EAAW;AACrC,QAAA,OAAO,IAAI,CAACrB,MAAM,CAACgB,MAAM,GAAG,CAAI,GAAA,IAAI,CAACM,oBAAoB,CAAC,CAAA,EAAGD,GAAO,CAAA,GAAA,KAAA;AACtE;AACA;;;;MAKAE,uBAAAA,CAAwBF,GAAQ,EAAU;AACxC,QAAA,OAAO,IAAI,CAACrB,MAAM,CAACgB,MAAM,GAAG,CAAI,GAAA,IAAI,CAACQ,wBAAwB,CAAC,CAAA,EAAGH,GAAO,CAAA,GAAA,IAAA;AAC1E;AACA;;;AAGC,MACDI,eAAwB,GAAA;AACtB,QAAA,OAAO,IAAI,CAACzB,MAAM,CAACgB,MAAM,GAAG,CAAA,GAAI,IAAI,CAAChB,MAAM,CAAC,CAAE,CAAA,CAACO,GAAG,GAAG,IAAA;AACvD;AACA;;;MAIAmB,SAAAA,CAAUC,MAAiB,EAAQ;QACjC,IAAIA,MAAAA,IAAU,IAAI,CAAC5B,eAAe,IAAI,IAAI,CAACA,eAAe,CAACE,QAAQ,EAAE;AACnE,YAAA,KAAK,MAAM2B,IAAQ,IAAA,IAAI,CAAC7B,eAAe,CAACE,QAAQ,CAAE;gBAChD0B,MAAOE,CAAAA,oBAAoB,CAACD,IAAMA,EAAAA,IAAAA,CAAAA;AACpC;AACA,YAAA,IAAI,CAACT,cAAc,EAAA;AACrB;AACF;AACA,qBACAW,MAAS,GAAA;AACP,QAAA,MAAMC,OAAU,GAAA,IAAI,CAACC,WAAW,CAAC,CAAA,CAAA;QACjC,MAAMC,CAAAA,GAAI,IAAI,CAACC,gBAAgB,EAAA;AAC/B,QAAA,IAAIH,YAAYE,CAAG,EAAA;YACjB,MAAM,IAAIE,MAAM,CAAC,4DAA4D,EAAEJ,OAAQ,CAAA,SAAS,EAAEE,CAAG,CAAA,CAAA,CAAA;AACvG;AACF;AACA,qBACQD,WAAYI,CAAAA,SAAiB,EAAU;AAC7C,QAAA,MAAMC,IAAO,GAAA,IAAI,CAACrC,MAAM,CAACoC,SAAU,CAAA;AACnC,QAAA,IAAI,CAACC,IAAM,EAAA;AACT,YAAA,MAAM,IAAIF,KAAAA,CAAM,CAAC,mDAAmD,EAAEC,SAAW,CAAA,CAAA,CAAA;AACnF;AACA,QAAA,IAAIL,OAAU,GAAA,CAAA;QACd,MAAMO,OAAAA,GAAUD,KAAK9B,GAAG,CAAC+B,OAAO,CAACD,IAAAA,CAAK1B,IAAI,CAAC;AAC3C,QAAA,MAAM4B,MAAmC,GAAA;AAAC,YAAA,CAAA;AAAG,YAAA,CAAA;AAAG,YAAA;AAAE,SAAA;AAClD,QAAA,KAAK,MAAMC,GAAAA,IAAOH,IAAK5B,CAAAA,SAAS,CAAE;YAChC,IAAI,CAACgC,YAAY,CAACD,GAAKD,EAAAA,MAAAA,CAAAA;YACvB,IAAIG,GAAAA,GAAMC,OAAOC,SAAS;YAC1B,IAAIC,GAAAA,GAAMF,OAAOG,SAAS;YAC1B,KAAK,MAAMC,KAAKR,MAAQ,CAAA;AACtB,gBAAA,MAAMS,IAAI,IAAI,CAACjD,eAAe,CAACE,QAAQ,CAAC8C,CAAE,CAAA;AAC1C,gBAAA,IAAI,CAACV,IAAK9B,CAAAA,GAAG,CAAC0C,aAAa,CAACD,CAAI,CAAA,EAAA;AAC9B,oBAAA,MAAM,IAAIb,KAAAA,CAAM,CAAC,uDAAuD,CAAC,CAAA;AAC3E;AACA,gBAAA,MAAMe,CAAIF,GAAAA,CAAC,CAACX,IAAAA,CAAK1B,IAAI,CAAC;AACtB,gBAAA,IAAIuC,IAAIL,GAAK,EAAA;oBACXA,GAAMK,GAAAA,CAAAA;AACR;AACA,gBAAA,IAAIA,IAAIR,GAAK,EAAA;oBACXA,GAAMQ,GAAAA,CAAAA;AACR;gBACA,IAAIR,GAAAA,GAAMG,OAAOP,OAAS,EAAA;AACxB,oBAAA,MAAM,IAAIH,KAAAA,CAAM,CAAC,kDAAkD,CAAC,CAAA;AACtE;AACF;AACF;QACAJ,OAAWM,IAAAA,IAAAA,CAAK5B,SAAS,CAACO,MAAM;QAChC,IAAIqB,IAAAA,CAAKzB,IAAI,IAAI,CAAG,EAAA;AAClBmB,YAAAA,OAAAA,IAAW,IAAI,CAACC,WAAW,CAACK,KAAKzB,IAAI,CAAA;AACvC;QACA,IAAIyB,IAAAA,CAAKxB,KAAK,IAAI,CAAG,EAAA;AACnBkB,YAAAA,OAAAA,IAAW,IAAI,CAACC,WAAW,CAACK,KAAKxB,KAAK,CAAA;AACxC;QACA,OAAOkB,OAAAA;AACT;qBAEA,UAAQoB,CACNf,SAAiB,EACjB3B,SAAmB,EACnB2C,WAAuC,EACvCC,WAAuC,EACvC;AACA,QAAA,MAAMhB,IAAO,GAAA,IAAI,CAACrC,MAAM,CAACoC,SAAU,CAAA;QACnC,IAAI3B,SAAAA,CAAUO,MAAM,KAAK,CAAG,EAAA;AAC1BqB,YAAAA,IAAAA,CAAK5B,SAAS,CAACQ,IAAI,CAACR,SAAS,CAAC,CAAE,CAAA,CAAA;SAC3B,MAAA;AACL,YAAA,MAAM6C,SAAajB,GAAAA,IAAAA,CAAK1B,IAAI,GAAG,IAAI,CAAC4C,oBAAoB,CACtDlB,IAAAA,CAAK9B,GAAG,CAAC+B,OAAO,EAChB7B,WACA2C,WACAC,EAAAA,WAAAA,CAAAA;AAEF,YAAA,MAAMG,UAAUnB,IAAK9B,CAAAA,GAAG,CAAC+B,OAAO,CAACgB,SAAU,CAAA;AAC3C,YAAA,MAAMG,aAAapB,IAAK9B,CAAAA,GAAG,CAACmD,MAAM,CAACJ,SAAU,CAAA;YAC7C,MAAMK,QAAAA,GAAWF,aAAapB,IAAK9B,CAAAA,GAAG,CAAC+B,OAAO,CAACgB,UAAU,GAAG,GAAA;AAC5D,YAAA,MAAMM,gBAA0B,EAAE;AAClC,YAAA,MAAMC,iBAA2B,EAAE;AACnC,YAAA,MAAMC,UAAU,IAAItD,IAAAA,EAAAA;AACpBsD,YAAAA,OAAAA,CAAQC,WAAW,EAAA;AACnB,YAAA,MAAMC,WAAW,IAAIxD,IAAAA,EAAAA;AACrBwD,YAAAA,QAAAA,CAASD,WAAW,EAAA;YACpB,KAAK,MAAMvB,OAAO/B,SAAW,CAAA;gBAC3B,MAAMoC,GAAAA,GAAMO,WAAW,CAACZ,GAAI,CAAA;gBAC5B,MAAME,GAAAA,GAAMW,WAAW,CAACb,GAAI,CAAA;AAC5B,gBAAA,MAAMyB,OAAOvB,GAAG,CAACY,UAAU,GAAGT,GAAG,CAACS,SAAU,CAAA;AAC5C,gBAAA,IAAIW,QAAQT,OAAS,EAAA;oBACnBnB,IAAK5B,CAAAA,SAAS,CAACQ,IAAI,CAACuB,GAAAA,CAAAA;iBACf,MAAA,IAAIE,GAAG,CAACY,SAAU,CAAA,IAAIG,cAAcZ,GAAG,CAACS,SAAU,CAAA,IAAIK,QAAU,EAAA;AACrEC,oBAAAA,aAAAA,CAAc3C,IAAI,CAACuB,GAAAA,CAAAA;AACnBsB,oBAAAA,OAAAA,CAAQI,OAAO,CAACrB,GAAG,CAAC,CAAE,CAAA,EAAEA,GAAG,CAAC,CAAE,CAAA,EAAEA,GAAG,CAAC,CAAE,CAAA,CAAA;AACtCiB,oBAAAA,OAAAA,CAAQI,OAAO,CAACxB,GAAG,CAAC,CAAE,CAAA,EAAEA,GAAG,CAAC,CAAE,CAAA,EAAEA,GAAG,CAAC,CAAE,CAAA,CAAA;iBACjC,MAAA;AACLmB,oBAAAA,cAAAA,CAAe5C,IAAI,CAACuB,GAAAA,CAAAA;AACpBwB,oBAAAA,QAAAA,CAASE,OAAO,CAACrB,GAAG,CAAC,CAAE,CAAA,EAAEA,GAAG,CAAC,CAAE,CAAA,EAAEA,GAAG,CAAC,CAAE,CAAA,CAAA;AACvCmB,oBAAAA,QAAAA,CAASE,OAAO,CAACxB,GAAG,CAAC,CAAE,CAAA,EAAEA,GAAG,CAAC,CAAE,CAAA,EAAEA,GAAG,CAAC,CAAE,CAAA,CAAA;AACzC;AACF;YACA,IAAIkB,aAAAA,CAAc5C,MAAM,EAAE;AACxB,gBAAA,IAAI,CAAChB,MAAM,CAACiB,IAAI,CAAC;oBACfV,GAAKuD,EAAAA,OAAAA;AACLrD,oBAAAA,SAAAA,EAAW,EAAE;AACbE,oBAAAA,IAAAA,EAAM,EAAC;AACPC,oBAAAA,IAAAA,EAAM,EAAC;AACPC,oBAAAA,KAAAA,EAAO;AACT,iBAAA,CAAA;AACAwB,gBAAAA,IAAAA,CAAKzB,IAAI,GAAG,IAAI,CAACZ,MAAM,CAACgB,MAAM,GAAG,CAAA;gBACjC,IAAI,CAACmC,UAAU,CAAC,IAAI,CAACnD,MAAM,CAACgB,MAAM,GAAG,CAAG4C,EAAAA,aAAAA,EAAeR,WAAaC,EAAAA,WAAAA,CAAAA;AACtE;YACA,IAAIQ,cAAAA,CAAe7C,MAAM,EAAE;AACzB,gBAAA,IAAI,CAAChB,MAAM,CAACiB,IAAI,CAAC;oBACfV,GAAKyD,EAAAA,QAAAA;AACLvD,oBAAAA,SAAAA,EAAW,EAAE;AACbE,oBAAAA,IAAAA,EAAM,EAAC;AACPC,oBAAAA,IAAAA,EAAM,EAAC;AACPC,oBAAAA,KAAAA,EAAO;AACT,iBAAA,CAAA;AACAwB,gBAAAA,IAAAA,CAAKxB,KAAK,GAAG,IAAI,CAACb,MAAM,CAACgB,MAAM,GAAG,CAAA;gBAClC,IAAI,CAACmC,UAAU,CAAC,IAAI,CAACnD,MAAM,CAACgB,MAAM,GAAG,CAAG6C,EAAAA,cAAAA,EAAgBT,WAAaC,EAAAA,WAAAA,CAAAA;AACvE;AACF;AACF;qBAEA,oBAAQE,CACNjB,OAAgB,EAChB7B,SAAmB,EACnB2C,WAAuC,EACvCC,WAAuC,EAC/B;QACR,MAAMc,EAAAA,GAAK7B,OAAQ8B,CAAAA,CAAC,EAClBC,EAAAA,GAAK/B,QAAQgC,CAAC,EACdC,EAAKjC,GAAAA,OAAAA,CAAQkC,CAAC;AAChB,QAAA,IAAIC,EAAK,GAAA,CAAA,EACPC,EAAK,GAAA,CAAA,EACLC,EAAK,GAAA,CAAA;QACP,KAAK,MAAMnC,OAAO/B,SAAW,CAAA;YAC3B,MAAMiC,GAAAA,GAAMW,WAAW,CAACb,GAAI,CAAA;YAC5B,MAAMK,GAAAA,GAAMO,WAAW,CAACZ,GAAI,CAAA;YAC5B,IAAIE,GAAG,CAAC,CAAE,CAAA,GAAGG,GAAG,CAAC,CAAA,CAAE,IAAIsB,EAAI,EAAA;AACzBM,gBAAAA,EAAAA,EAAAA;AACF;YACA,IAAI/B,GAAG,CAAC,CAAE,CAAA,GAAGG,GAAG,CAAC,CAAA,CAAE,IAAIwB,EAAI,EAAA;AACzBK,gBAAAA,EAAAA,EAAAA;AACF;YACA,IAAIhC,GAAG,CAAC,CAAE,CAAA,GAAGG,GAAG,CAAC,CAAA,CAAE,IAAI0B,EAAI,EAAA;AACzBI,gBAAAA,EAAAA,EAAAA;AACF;AACF;AACA,QAAA,IAAIF,KAAKC,EAAI,EAAA;AACX,YAAA,IAAID,KAAKE,EAAI,EAAA;gBACX,OAAO,CAAA;aACF,MAAA;AACL,gBAAA,OAAOF,EAAOE,KAAAA,EAAAA,GAAMR,EAAKI,GAAAA,EAAAA,GAAK,IAAI,CAAK,GAAA,CAAA;AACzC;SACK,MAAA,IAAIE,MAAMC,EAAI,EAAA;AACnB,YAAA,IAAIC,KAAKF,EAAI,EAAA;gBACX,OAAO,CAAA;aACF,MAAA,IAAIE,KAAKF,EAAI,EAAA;gBAClB,OAAON,EAAAA,GAAKE,KAAK,CAAI,GAAA,CAAA;aAChB,MAAA;AACL,gBAAA,IAAIF,KAAKE,EAAI,EAAA;oBACX,OAAOA,EAAAA,GAAKE,KAAK,CAAI,GAAA,CAAA;iBAChB,MAAA;oBACL,OAAOJ,EAAAA,GAAKI,KAAK,CAAI,GAAA,CAAA;AACvB;AACF;SACK,MAAA;AACL,YAAA,IAAIG,KAAKC,EAAI,EAAA;gBACX,OAAO,CAAA;aACF,MAAA;AACL,gBAAA,OAAOD,EAAOC,KAAAA,EAAAA,GAAMN,EAAKE,GAAAA,EAAAA,GAAK,IAAI,CAAK,GAAA,CAAA;AACzC;AACF;AACF;qBAEA,gBAA2B,GAAA;QACzB,MAAMK,UAAAA,GAAa,IAAI,CAAC7E,eAAe,CAACM,OAAO,GAC3C,IAAI,CAACN,eAAe,CAACM,OAAO,CAACW,MAAM,GACnC,IAAI,CAACjB,eAAe,CAACE,QAAQ,CAACe,MAAM;AACxC,QAAA,OAAQ,IAAI,CAACjB,eAAe,CAACO,aAAa;YACxC,KAAK,eAAA;gBACH,OAAOuE,IAAAA,CAAKC,KAAK,CAACF,UAAa,GAAA,CAAA,CAAA;YACjC,KAAK,gBAAA;AACH,gBAAA,OAAOA,UAAa,GAAA,CAAA;YACtB,KAAK,cAAA;AACH,gBAAA,OAAOA,UAAa,GAAA,CAAA;AACtB,YAAA;gBACE,OAAO,CAAA;AACX;AACF;AACA,qBACA,wBAAQpD,CAAyBY,SAAiB,EAAEf,GAAQ,EAAU;AACpE,QAAA,MAAMgB,IAAO,GAAA,IAAI,CAACrC,MAAM,CAACoC,SAAU,CAAA;AACnC,QAAA,IAAI,CAACf,GAAI0D,CAAAA,oBAAoB,CAAC1C,IAAAA,CAAK9B,GAAG,CAAG,EAAA;YACvC,OAAO,IAAA;AACT;QACA,IAAIyE,OAAAA,GAAUrC,OAAOG,SAAS;AAC9B,QAAA,KAAK,MAAMN,GAAAA,IAAOH,IAAK5B,CAAAA,SAAS,CAAE;YAChC,IAAI,CAACgC,YAAY,CAACD,GAAK5C,EAAAA,WAAAA,CAAAA;YACvB,MAAMqF,EAAAA,GAAK,IAAI,CAAClF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;YACxD,MAAMsF,EAAAA,GAAK,IAAI,CAACnF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;YACxD,MAAMuF,EAAAA,GAAK,IAAI,CAACpF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;AACxD,YAAA,MAAMwF,OAAO/D,GAAIgE,CAAAA,wBAAwB,CAACJ,EAAAA,EAAIC,IAAIC,EAAI,EAAA,KAAA,CAAA;AACtD,YAAA,IAAIC,IAAS,KAAA,IAAA,IAAQA,IAAQ,IAAA,CAAA,IAAKA,OAAOJ,OAAS,EAAA;gBAChDA,OAAUI,GAAAA,IAAAA;AACZ;AACF;AACA,QAAA,IAAIE,CAAWC,EAAAA,CAAAA;QACf,IAAIlD,IAAAA,CAAK1B,IAAI,IAAI,CAAG,EAAA;AAClB,YAAA,IAAIU,IAAImE,SAAS,CAACnD,KAAK1B,IAAI,CAAC,GAAG,CAAG,EAAA;AAChC2E,gBAAAA,CAAAA,GAAIjD,KAAKxB,KAAK;AACd0E,gBAAAA,CAAAA,GAAIlD,KAAKzB,IAAI;aACR,MAAA;AACL0E,gBAAAA,CAAAA,GAAIjD,KAAKzB,IAAI;AACb2E,gBAAAA,CAAAA,GAAIlD,KAAKxB,KAAK;AAChB;AACA,YAAA,IAAIyE,KAAK,CAAG,EAAA;AACV,gBAAA,MAAMF,IAAO,GAAA,IAAI,CAAC5D,wBAAwB,CAAC8D,CAAGjE,EAAAA,GAAAA,CAAAA;AAC9C,gBAAA,IAAI+D,IAAS,KAAA,IAAA,IAAQA,IAAQ,IAAA,CAAA,IAAKA,OAAOJ,OAAS,EAAA;oBAChDA,OAAUI,GAAAA,IAAAA;AACZ;AACF;AACA,YAAA,IAAIG,KAAK,CAAG,EAAA;AACV,gBAAA,MAAMH,IAAO,GAAA,IAAI,CAAC5D,wBAAwB,CAAC+D,CAAGlE,EAAAA,GAAAA,CAAAA;AAC9C,gBAAA,IAAI+D,IAAS,KAAA,IAAA,IAAQA,IAAQ,IAAA,CAAA,IAAKA,OAAOJ,OAAS,EAAA;oBAChDA,OAAUI,GAAAA,IAAAA;AACZ;AACF;AACF;AACA,QAAA,OAAOJ,OAAYrC,KAAAA,MAAAA,CAAOG,SAAS,GAAG,IAAOkC,GAAAA,OAAAA;AAC/C;AACA,qBACA,oBAAQ1D,CAAqBc,SAAiB,EAAEf,GAAQ,EAAW;AACjE,QAAA,MAAMgB,IAAO,GAAA,IAAI,CAACrC,MAAM,CAACoC,SAAU,CAAA;AACnC,QAAA,IAAI,CAACf,GAAI0D,CAAAA,oBAAoB,CAAC1C,IAAAA,CAAK9B,GAAG,CAAG,EAAA;YACvC,OAAO,KAAA;AACT;AACA,QAAA,KAAK,MAAMiC,GAAAA,IAAOH,IAAK5B,CAAAA,SAAS,CAAE;YAChC,IAAI,CAACgC,YAAY,CAACD,GAAK5C,EAAAA,WAAAA,CAAAA;YACvB,MAAMqF,EAAAA,GAAK,IAAI,CAAClF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;YACxD,MAAMsF,EAAAA,GAAK,IAAI,CAACnF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;YACxD,MAAMuF,EAAAA,GAAK,IAAI,CAACpF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;AACxD,YAAA,MAAMwF,OAAO/D,GAAIgE,CAAAA,wBAAwB,CAACJ,EAAAA,EAAIC,IAAIC,EAAI,EAAA,KAAA,CAAA;YACtD,IAAIC,IAAAA,KAAS,IAAQA,IAAAA,IAAAA,GAAO,CAAG,EAAA;gBAC7B,OAAO,IAAA;AACT;AACF;AACA,QAAA,IAAIE,CAAWC,EAAAA,CAAAA;QACf,IAAIlD,IAAAA,CAAK1B,IAAI,IAAI,CAAG,EAAA;AAClB,YAAA,IAAIU,IAAImE,SAAS,CAACnD,KAAK1B,IAAI,CAAC,GAAG,CAAG,EAAA;AAChC2E,gBAAAA,CAAAA,GAAIjD,KAAKxB,KAAK;AACd0E,gBAAAA,CAAAA,GAAIlD,KAAKzB,IAAI;aACR,MAAA;AACL0E,gBAAAA,CAAAA,GAAIjD,KAAKzB,IAAI;AACb2E,gBAAAA,CAAAA,GAAIlD,KAAKxB,KAAK;AAChB;AACA,YAAA,IAAIyE,KAAK,CAAK,IAAA,IAAI,CAAChE,oBAAoB,CAACgE,GAAGjE,GAAM,CAAA,EAAA;gBAC/C,OAAO,IAAA;AACT;AACA,YAAA,IAAIkE,KAAK,CAAK,IAAA,IAAI,CAACjE,oBAAoB,CAACiE,GAAGlE,GAAM,CAAA,EAAA;gBAC/C,OAAO,IAAA;AACT;AACF;QACA,OAAO,KAAA;AACT;AACA,qBACA,YAAQoB,CAAaR,CAAS,EAAEwD,GAA6B,EAA4B;AACvF,QAAA,MAAMpF,OAAU,GAAA,IAAI,CAACN,eAAe,CAACM,OAAO;AAC5C,QAAA,IAAI4E,IAAYC,EAAYC,EAAAA,EAAAA;AAC5BM,QAAAA,GAAAA,GAAMA,GAAO,IAAA;AAAC,YAAA,CAAA;AAAG,YAAA,CAAA;AAAG,YAAA;AAAE,SAAA;AACtB,QAAA,OAAQ,IAAI,CAAC1F,eAAe,CAACO,aAAa;YACxC,KAAK,eAAA;AACH2E,gBAAAA,EAAAA,GAAKhD,CAAI,GAAA,CAAA;AACTiD,gBAAAA,EAAAA,GAAKD,EAAK,GAAA,CAAA;AACVE,gBAAAA,EAAAA,GAAKF,EAAK,GAAA,CAAA;AACV,gBAAA;YACF,KAAK,gBAAA;AAAkB,gBAAA;AACrB,oBAAA,MAAMS,IAAIzD,CAAI,GAAA,CAAA;AACdgD,oBAAAA,EAAAA,GAAKhD,CAAIyD,GAAAA,CAAAA;AACTR,oBAAAA,EAAAA,GAAKjD,IAAIyD,CAAI,GAAA,CAAA;AACbP,oBAAAA,EAAAA,GAAKlD,CAAI,GAAA,CAAA;AACT,oBAAA;AACF;YACA,KAAK,cAAA;gBACHgD,EAAK,GAAA,CAAA;AACLC,gBAAAA,EAAAA,GAAKjD,CAAI,GAAA,CAAA;AACTkD,gBAAAA,EAAAA,GAAKlD,CAAI,GAAA,CAAA;AACT,gBAAA;AACF,YAAA;gBACE,OAAO,IAAA;AACX;AACAwD,QAAAA,GAAG,CAAC,CAAE,CAAA,GAAGpF,UAAUA,OAAO,CAAC4E,GAAG,GAAGA,EAAAA;AACjCQ,QAAAA,GAAG,CAAC,CAAE,CAAA,GAAGpF,UAAUA,OAAO,CAAC6E,GAAG,GAAGA,EAAAA;AACjCO,QAAAA,GAAG,CAAC,CAAE,CAAA,GAAGpF,UAAUA,OAAO,CAAC8E,GAAG,GAAGA,EAAAA;QACjC,OAAOM,GAAAA;AACT;AACA,qBACAtE,cAAiB,GAAA;AACf,QAAA,MAAMiC,cAA0C,EAAE;AAClD,QAAA,MAAMC,cAA0C,EAAE;AAClD,QAAA,MAAM5C,YAAsB,EAAE;QAC9B,MAAMkF,YAAAA,GAAe,IAAI,CAACzD,gBAAgB,EAAA;AAC1C,QAAA,MAAM0D,QAAW,GAAA;AACfrF,YAAAA,GAAAA,EAAK,IAAIC,IAAAA,EAAAA;AACTC,YAAAA,SAAAA,EAAW,EAAE;AACbE,YAAAA,IAAAA,EAAM,EAAC;AACPC,YAAAA,IAAAA,EAAM,EAAC;AACPC,YAAAA,KAAAA,EAAO;AACT,SAAA;QACA+E,QAASrF,CAAAA,GAAG,CAACwD,WAAW,EAAA;AACxB,QAAA,IAAK,IAAIhD,CAAAA,GAAI,CAAGA,EAAAA,CAAAA,GAAI4E,cAAc5E,CAAK,EAAA,CAAA;AACrCN,YAAAA,SAAAA,CAAUQ,IAAI,CAACF,CAAAA,CAAAA;YACf,IAAI,CAAC0B,YAAY,CAAC1B,CAAGnB,EAAAA,WAAAA,CAAAA;YACrB,MAAMqF,EAAAA,GAAK,IAAI,CAAClF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;YACxD,MAAMsF,EAAAA,GAAK,IAAI,CAACnF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;YACxD,MAAMuF,EAAAA,GAAK,IAAI,CAACpF,eAAe,CAACE,QAAQ,CAACL,WAAW,CAAC,CAAA,CAAE,CAAC;AACxD,YAAA,MAAMiD,GAAgC,GAAA;AACpCgC,gBAAAA,IAAAA,CAAKhC,GAAG,CAACgC,IAAKhC,CAAAA,GAAG,CAACoC,EAAAA,CAAGb,CAAC,EAAEc,EAAGd,CAAAA,CAAC,CAAGe,EAAAA,EAAAA,CAAGf,CAAC,CAAA;AACnCS,gBAAAA,IAAAA,CAAKhC,GAAG,CAACgC,IAAKhC,CAAAA,GAAG,CAACoC,EAAAA,CAAGX,CAAC,EAAEY,EAAGZ,CAAAA,CAAC,CAAGa,EAAAA,EAAAA,CAAGb,CAAC,CAAA;AACnCO,gBAAAA,IAAAA,CAAKhC,GAAG,CAACgC,IAAKhC,CAAAA,GAAG,CAACoC,EAAAA,CAAGT,CAAC,EAAEU,EAAGV,CAAAA,CAAC,CAAGW,EAAAA,EAAAA,CAAGX,CAAC;AACpC,aAAA;AACDoB,YAAAA,QAAAA,CAASrF,GAAG,CAAC2D,OAAO,CAACrB,GAAG,CAAC,CAAA,CAAE,EAAEA,GAAG,CAAC,CAAA,CAAE,EAAEA,GAAG,CAAC,CAAE,CAAA,CAAA;AAC3CO,YAAAA,WAAAA,CAAYnC,IAAI,CAAC4B,GAAAA,CAAAA;AACjB,YAAA,MAAMH,GAAgC,GAAA;AACpCmC,gBAAAA,IAAAA,CAAKnC,GAAG,CAACmC,IAAKnC,CAAAA,GAAG,CAACuC,EAAAA,CAAGb,CAAC,EAAEc,EAAGd,CAAAA,CAAC,CAAGe,EAAAA,EAAAA,CAAGf,CAAC,CAAA;AACnCS,gBAAAA,IAAAA,CAAKnC,GAAG,CAACmC,IAAKnC,CAAAA,GAAG,CAACuC,EAAAA,CAAGX,CAAC,EAAEY,EAAGZ,CAAAA,CAAC,CAAGa,EAAAA,EAAAA,CAAGb,CAAC,CAAA;AACnCO,gBAAAA,IAAAA,CAAKnC,GAAG,CAACmC,IAAKnC,CAAAA,GAAG,CAACuC,EAAAA,CAAGT,CAAC,EAAEU,EAAGV,CAAAA,CAAC,CAAGW,EAAAA,EAAAA,CAAGX,CAAC;AACpC,aAAA;AACDoB,YAAAA,QAAAA,CAASrF,GAAG,CAAC2D,OAAO,CAACxB,GAAG,CAAC,CAAA,CAAE,EAAEA,GAAG,CAAC,CAAA,CAAE,EAAEA,GAAG,CAAC,CAAE,CAAA,CAAA;AAC3CW,YAAAA,WAAAA,CAAYpC,IAAI,CAACyB,GAAAA,CAAAA;AACnB;AACA,QAAA,IAAIkD,QAASrF,CAAAA,GAAG,CAACsF,OAAO,EAAI,EAAA;YAC1B,IAAI,CAAC7F,MAAM,GAAG;AAAC4F,gBAAAA;AAAS,aAAA;AACxB,YAAA,IAAI,CAACzC,UAAU,CAAC,CAAA,EAAG1C,WAAW2C,WAAaC,EAAAA,WAAAA,CAAAA;SACtC,MAAA;YACL,IAAI,CAACrD,MAAM,GAAG,EAAE;AAClB;AACF;AACF;;;;"}

package/dist/src/utility/bounding_volume.js

@@ -1,29 +0,0 @@
-import { AABB, Frustum, ClipState } from '@zephyr3d/base';
-
-/**
- * The bounding box class
- * @public
- */ class BoundingBox extends AABB {
-    constructor(arg0, arg1){
-        // eslint-disable-next-line @typescript-eslint/no-explicit-any
-        super(arg0, arg1);
-    }
-    /** {@inheritDoc BoundingVolume.behindPlane} */ behindPlane(plane) {
-        return this.toAABB().behindPlane(plane);
-    }
-    /** {@inheritDoc BoundingVolume.clone} */ clone() {
-        return new BoundingBox(this);
-    }
-    /** {@inheritDoc BoundingVolume.transform} */ transform(matrix) {
-        return new BoundingBox(AABB.transform(this, matrix));
-    }
-    /** {@inheritDoc BoundingVolume.outsideFrustum} */ outsideFrustum(frustum) {
-        return (frustum instanceof Frustum ? this.getClipStateWithFrustum(frustum) : this.getClipState(frustum)) === ClipState.NOT_CLIPPED;
-    }
-    /** {@inheritDoc BoundingVolume.toAABB} */ toAABB() {
-        return this;
-    }
-}
-
-export { BoundingBox };
-//# sourceMappingURL=bounding_volume.js.map

package/dist/src/utility/bounding_volume.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bounding_volume.js","sources":["../../../src/utility/bounding_volume.ts"],"sourcesContent":["import type { Vector3, Matrix4x4, Plane } from '@zephyr3d/base';\r\nimport { Frustum, AABB, ClipState } from '@zephyr3d/base';\r\n\r\n/**\r\n * Base interface for any kind of bounding volumes\r\n * @public\r\n */\r\nexport interface BoundingVolume {\r\n  /**\r\n   * Creates a new bounding volume by copying from this bounding volume\r\n   */\r\n  clone(): BoundingVolume;\r\n  /**\r\n   * Creates a new bounding volume by tranforming this bounding volume by a matrix\r\n   * @param matrix - The transform matrix\r\n   * @returns The created bounding volume\r\n   */\r\n  transform(matrix: Matrix4x4): BoundingVolume;\r\n  /**\r\n   * Check if this bounding volume is behind a plane\r\n   * @param plane - The plane to check\r\n   * @returns true if the bounding volume behinds the plane, false otherwise\r\n   */\r\n  behindPlane(plane: Plane): boolean;\r\n  /**\r\n   * Check if this bounding volume is outside a frustum\r\n   * @param frustum - The frustum to check\r\n   * @returns true if the bounding volume outsides the frustum, false otherwise\r\n   */\r\n  outsideFrustum(frustum: Frustum | Matrix4x4): boolean;\r\n  /**\r\n   * Gets the minimum AABB that contains the bounding volume\r\n   * @returns The mimimum AABB that contains the bounding volume\r\n   */\r\n  toAABB(): AABB;\r\n}\r\n\r\n/**\r\n * The bounding box class\r\n * @public\r\n */\r\nexport class BoundingBox extends AABB implements BoundingVolume {\r\n  /**\r\n   * Creates an empty bounding box\r\n   */\r\n  constructor();\r\n  /**\r\n   * Creates a bounding box from an AABB\r\n   * @param box - The AABB\r\n   */\r\n  constructor(box: AABB);\r\n  /**\r\n   * Creates a bounding box from the min point and the max point\r\n   * @param minPoint - Min point of the box\r\n   * @param maxPoint - Max point of the box\r\n   */\r\n  constructor(minPoint: Vector3, maxPoint: Vector3);\r\n  constructor(arg0?: Vector3 | AABB, arg1?: Vector3) {\r\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\r\n    super(arg0 as any, arg1);\r\n  }\r\n  /** {@inheritDoc BoundingVolume.behindPlane} */\r\n  behindPlane(plane: Plane): boolean {\r\n    return this.toAABB().behindPlane(plane);\r\n  }\r\n  /** {@inheritDoc BoundingVolume.clone} */\r\n  clone(): BoundingVolume {\r\n    return new BoundingBox(this);\r\n  }\r\n  /** {@inheritDoc BoundingVolume.transform} */\r\n  transform(matrix: Matrix4x4): BoundingVolume {\r\n    return new BoundingBox(AABB.transform(this, matrix));\r\n  }\r\n  /** {@inheritDoc BoundingVolume.outsideFrustum} */\r\n  outsideFrustum(frustum: Frustum | Matrix4x4): boolean {\r\n    return (\r\n      (frustum instanceof Frustum ? this.getClipStateWithFrustum(frustum) : this.getClipState(frustum)) ===\r\n      ClipState.NOT_CLIPPED\r\n    );\r\n  }\r\n  /** {@inheritDoc BoundingVolume.toAABB} */\r\n  toAABB(): AABB {\r\n    return this;\r\n  }\r\n}\r\n"],"names":["BoundingBox","AABB","arg0","arg1","behindPlane","plane","toAABB","clone","transform","matrix","outsideFrustum","frustum","Frustum","getClipStateWithFrustum","getClipState","ClipState","NOT_CLIPPED"],"mappings":";;AAqCA;;;IAIO,MAAMA,WAAoBC,SAAAA,IAAAA,CAAAA;IAgB/B,WAAYC,CAAAA,IAAqB,EAAEC,IAAc,CAAE;;AAEjD,QAAA,KAAK,CAACD,IAAaC,EAAAA,IAAAA,CAAAA;AACrB;oDAEAC,WAAYC,CAAAA,KAAY,EAAW;AACjC,QAAA,OAAO,IAAI,CAACC,MAAM,EAAA,CAAGF,WAAW,CAACC,KAAAA,CAAAA;AACnC;AACA,8CACAE,KAAwB,GAAA;QACtB,OAAO,IAAIP,YAAY,IAAI,CAAA;AAC7B;kDAEAQ,SAAUC,CAAAA,MAAiB,EAAkB;AAC3C,QAAA,OAAO,IAAIT,WAAYC,CAAAA,IAAAA,CAAKO,SAAS,CAAC,IAAI,EAAEC,MAAAA,CAAAA,CAAAA;AAC9C;uDAEAC,cAAeC,CAAAA,OAA4B,EAAW;AACpD,QAAA,OACE,CAACA,OAAAA,YAAmBC,OAAU,GAAA,IAAI,CAACC,uBAAuB,CAACF,OAAW,CAAA,GAAA,IAAI,CAACG,YAAY,CAACH,OAAO,CAAA,MAC/FI,UAAUC,WAAW;AAEzB;AACA,+CACAV,MAAe,GAAA;AACb,QAAA,OAAO,IAAI;AACb;AACF;;;;"}

package/dist/src/utility/debug.js

@@ -1,28 +0,0 @@
-import { copyTexture, fetchSampler } from './misc.js';
-
-const debugFrameBuffer = {};
-/**
- * Copies texture to an intermidate texture for debugging with inspector
- * @param tex - The texture to debug
- * @param label - Label for the intermidate texture
- * @internal
- */ function debugTexture(tex, label) {
-    let fb = debugFrameBuffer[label];
-    if (!fb || fb.getWidth() !== tex.width || fb.getHeight() !== tex.height) {
-        fb?.getColorAttachments()[0]?.dispose();
-        fb?.dispose();
-        fb = tex.device.createFrameBuffer([
-            tex.device.createTexture2D(tex.format, tex.width, tex.height, {
-                samplerOptions: {
-                    mipFilter: 'none'
-                }
-            })
-        ], null);
-        fb.getColorAttachments()[0].name = label ?? 'Debug';
-        debugFrameBuffer[label] = fb;
-    }
-    copyTexture(tex, fb, fetchSampler('clamp_nearest_nomip'));
-}
-
-export { debugTexture };
-//# sourceMappingURL=debug.js.map

package/dist/src/utility/debug.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"debug.js","sources":["../../../src/utility/debug.ts"],"sourcesContent":["import type { BaseTexture, FrameBuffer } from '@zephyr3d/device';\r\nimport { copyTexture, fetchSampler } from './misc';\r\n\r\nconst debugFrameBuffer: Record<string, FrameBuffer> = {};\r\n\r\n/**\r\n * Copies texture to an intermidate texture for debugging with inspector\r\n * @param tex - The texture to debug\r\n * @param label - Label for the intermidate texture\r\n * @internal\r\n */\r\nexport function debugTexture(tex: BaseTexture, label: string) {\r\n  let fb = debugFrameBuffer[label];\r\n  if (!fb || fb.getWidth() !== tex.width || fb.getHeight() !== tex.height) {\r\n    fb?.getColorAttachments()[0]?.dispose();\r\n    fb?.dispose();\r\n    fb = tex.device.createFrameBuffer(\r\n      [\r\n        tex.device.createTexture2D(tex.format, tex.width, tex.height, {\r\n          samplerOptions: {\r\n            mipFilter: 'none'\r\n          }\r\n        })\r\n      ],\r\n      null\r\n    );\r\n    fb.getColorAttachments()[0].name = label ?? 'Debug';\r\n    debugFrameBuffer[label] = fb;\r\n  }\r\n  copyTexture(tex, fb, fetchSampler('clamp_nearest_nomip'));\r\n}\r\n"],"names":["debugFrameBuffer","debugTexture","tex","label","fb","getWidth","width","getHeight","height","getColorAttachments","dispose","device","createFrameBuffer","createTexture2D","format","samplerOptions","mipFilter","name","copyTexture","fetchSampler"],"mappings":";;AAGA,MAAMA,mBAAgD,EAAC;AAEvD;;;;;AAKC,IACM,SAASC,YAAaC,CAAAA,GAAgB,EAAEC,KAAa,EAAA;IAC1D,IAAIC,EAAAA,GAAKJ,gBAAgB,CAACG,KAAM,CAAA;AAChC,IAAA,IAAI,CAACC,EAAAA,IAAMA,EAAGC,CAAAA,QAAQ,EAAOH,KAAAA,GAAAA,CAAII,KAAK,IAAIF,EAAGG,CAAAA,SAAS,EAAOL,KAAAA,GAAAA,CAAIM,MAAM,EAAE;QACvEJ,EAAIK,EAAAA,mBAAAA,EAAqB,CAAC,CAAA,CAAE,EAAEC,OAAAA,EAAAA;QAC9BN,EAAIM,EAAAA,OAAAA,EAAAA;AACJN,QAAAA,EAAAA,GAAKF,GAAIS,CAAAA,MAAM,CAACC,iBAAiB,CAC/B;AACEV,YAAAA,GAAAA,CAAIS,MAAM,CAACE,eAAe,CAACX,GAAIY,CAAAA,MAAM,EAAEZ,GAAAA,CAAII,KAAK,EAAEJ,GAAIM,CAAAA,MAAM,EAAE;gBAC5DO,cAAgB,EAAA;oBACdC,SAAW,EAAA;AACb;AACF,aAAA;SACD,EACD,IAAA,CAAA;AAEFZ,QAAAA,EAAAA,CAAGK,mBAAmB,EAAE,CAAC,EAAE,CAACQ,IAAI,GAAGd,KAAS,IAAA,OAAA;QAC5CH,gBAAgB,CAACG,MAAM,GAAGC,EAAAA;AAC5B;IACAc,WAAYhB,CAAAA,GAAAA,EAAKE,IAAIe,YAAa,CAAA,qBAAA,CAAA,CAAA;AACpC;;;;"}

package/dist/src/utility/draco/decoder.js

@@ -1,116 +0,0 @@
-class DracoMeshDecoder {
-    _module;
-    _decoder;
-    _mesh;
-    constructor(data, decoderModule){
-        this._module = decoderModule;
-        this._decoder = new this._module.Decoder();
-        const buffer = new this._module.DecoderBuffer();
-        buffer.Init(data, data.byteLength);
-        const geometryType = this._decoder.GetEncodedGeometryType(buffer);
-        if (geometryType !== this._module.TRIANGULAR_MESH) {
-            this._module.destroy(buffer);
-            this._module.destroy(this._decoder);
-            this._decoder = null;
-            throw new Error(`Unsupported geometry type: ${geometryType}`);
-        }
-        this._mesh = new this._module.Mesh();
-        const status = this._decoder.DecodeBufferToMesh(buffer, this._mesh);
-        this._module.destroy(buffer);
-        if (!status.ok() || this._mesh.ptr === 0) {
-            this._module.destroy(this._decoder);
-            this._decoder = null;
-            this._module.destroy(this._mesh);
-            this._mesh = null;
-            throw new Error(status.error_msg());
-        }
-    }
-    getIndexBuffer() {
-        if (!this._decoder || !this._mesh) {
-            return null;
-        }
-        const numFaces = this._mesh.num_faces();
-        const numIndices = numFaces * 3;
-        // Uint32
-        const indexBuffer = new Uint32Array(numIndices);
-        const ptr = this._module._malloc(indexBuffer.byteLength);
-        this._decoder.GetTrianglesUInt32Array(this._mesh, indexBuffer.byteLength, ptr);
-        const tmpBuffer = new Uint32Array(this._module.HEAPU32.buffer, ptr, numIndices);
-        indexBuffer.set(tmpBuffer);
-        this._module._free(ptr);
-        return indexBuffer;
-    }
-    getAttributeBuffer(id, buffer) {
-        if (!this._decoder || !this._mesh) {
-            return null;
-        }
-        const attribute = this._decoder.GetAttributeByUniqueId(this._mesh, id);
-        if (!attribute) {
-            return null;
-        }
-        const numComponents = attribute.num_components();
-        const numPoints = this._mesh.num_points();
-        const numValues = numPoints * numComponents;
-        if (buffer.length !== numValues) {
-            console.error(`getAttributeBuffer(): buffer length must be ${numValues}`);
-            return null;
-        }
-        const ptr = this._module._malloc(buffer.byteLength);
-        this._decoder.GetAttributeDataArrayForAllPoints(this._mesh, attribute, this.getDracoDataType(buffer), buffer.byteLength, ptr);
-        const tmpBuffer = new buffer.constructor(this.getDracoHeap(buffer).buffer, ptr, numValues);
-        buffer.set(tmpBuffer);
-        this._module._free(ptr);
-        return buffer;
-    }
-    getDracoDataType(buffer) {
-        if (buffer instanceof Float32Array) {
-            return this._module.DT_FLOAT32;
-        }
-        if (buffer instanceof Int8Array) {
-            return this._module.DT_INT8;
-        }
-        if (buffer instanceof Int16Array) {
-            return this._module.DT_INT16;
-        }
-        if (buffer instanceof Int32Array) {
-            return this._module.DT_INT32;
-        }
-        if (buffer instanceof Uint8Array) {
-            return this._module.DT_UINT8;
-        }
-        if (buffer instanceof Uint16Array) {
-            return this._module.DT_UINT16;
-        }
-        if (buffer instanceof Uint32Array) {
-            return this._module.DT_UINT32;
-        }
-        throw new Error(`getDracoDataType(): invalid buffer type`);
-    }
-    getDracoHeap(buffer) {
-        if (buffer instanceof Float32Array) {
-            return this._module.HEAPF32;
-        }
-        if (buffer instanceof Int8Array) {
-            return this._module.HEAP8;
-        }
-        if (buffer instanceof Int16Array) {
-            return this._module.HEAP16;
-        }
-        if (buffer instanceof Int32Array) {
-            return this._module.HEAP32;
-        }
-        if (buffer instanceof Uint8Array) {
-            return this._module.HEAPU8;
-        }
-        if (buffer instanceof Uint16Array) {
-            return this._module.HEAPU16;
-        }
-        if (buffer instanceof Uint32Array) {
-            return this._module.HEAPU32;
-        }
-        throw new Error(`getDracoHeap(): invalid buffer type`);
-    }
-}
-
-export { DracoMeshDecoder };
-//# sourceMappingURL=decoder.js.map