@adobe/data 0.8.6 → 0.9.1

package/dist/math/mat4x4/mat4x4.js

@@ -1,45 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-/**
- * 4x4 Matrix operations using column-major order (WebGPU standard).
- *
- * Matrix Layout:
- * Matrices are stored in column-major order as flat arrays of 16 elements.
- * This matches WebGPU's memory layout and shader expectations.
- *
- * Layout: [m0, m1, m2, m3, m4, m5, m6, m7, m8, m9, m10, m11, m12, m13, m14, m15]
- *
- * Which represents:
- * ┌                    ┐
- * │ m0  m4  m8   m12  │  (Column 0, 1, 2, 3)
- * │ m1  m5  m9   m13  │
- * │ m2  m6  m10  m14  │
- * │ m3  m7  m11  m15  │
- * └                    ┘
- *
- * For transformation matrices (position, rotation, scale):
- * - Columns 0-2 (m0-m2, m4-m6, m8-m10): Rotation/scale basis vectors (right, up, forward)
- * - Column 3 (m12, m13, m14): Translation (x, y, z)
- * - Row 3 (m3, m7, m11, m15): Perspective (usually 0, 0, 0, 1)
- */
-export * as Mat4x4 from "./constants/index.js";
-//# sourceMappingURL=mat4x4.js.map

package/dist/math/mat4x4/mat4x4.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mat4x4.js","sourceRoot":"","sources":["../../../src/math/mat4x4/mat4x4.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAOX;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,KAAK,MAAM,MAAM,sBAAsB,CAAC"}

package/dist/math/picking/face.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=face.js.map

package/dist/math/picking/face.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"face.js","sourceRoot":"","sources":["../../../src/math/picking/face.ts"],"names":[],"mappings":""}

package/dist/math/picking/get-closest-entity-to-line.d.ts

@@ -1,4 +0,0 @@
-import { Entity } from "../../ecs/index.js";
-import { Aabb, Line3 } from "../index.js";
-import { PickResult } from "./pick-result.js";
-export declare function getClosestEntityToLine(rows: Map<Entity, Aabb>, line: Line3): PickResult | null;

package/dist/math/picking/get-closest-entity-to-line.js

@@ -1,30 +0,0 @@
-import { Aabb, Line3, Vec3 } from "../index.js";
-export function getClosestEntityToLine(rows, line) {
-    let closestEntity = null;
-    let closestDistanceSquared = Infinity;
-    let closestAlpha = Infinity;
-    let pickedPosition = null;
-    for (const [id, aabb] of rows) {
-        const aabbCenter = Aabb.center(aabb);
-        const alpha = Line3.closestPointOnLine(line, aabbCenter);
-        const closestPointOnLineSegment = Line3.interpolate(line, alpha);
-        const distSquared = Vec3.distanceSquared(aabbCenter, closestPointOnLineSegment);
-        if (distSquared < closestDistanceSquared ||
-            (distSquared === closestDistanceSquared && alpha < closestAlpha)) {
-            closestDistanceSquared = distSquared;
-            closestAlpha = alpha;
-            closestEntity = id;
-            pickedPosition = closestPointOnLineSegment;
-        }
-    }
-    if (closestEntity !== null && pickedPosition) {
-        return {
-            entity: closestEntity,
-            lineAlpha: closestAlpha,
-            worldPosition: pickedPosition,
-            // face: AabbFace.fromPosition(pickedPosition, rows.get(closestEntity)!),
-        };
-    }
-    return null;
-}
-//# sourceMappingURL=get-closest-entity-to-line.js.map

package/dist/math/picking/get-closest-entity-to-line.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-closest-entity-to-line.js","sourceRoot":"","sources":["../../../src/math/picking/get-closest-entity-to-line.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAGhD,MAAM,UAAU,sBAAsB,CAAC,IAAuB,EAAE,IAAW;IACvE,IAAI,aAAa,GAAkB,IAAI,CAAC;IACxC,IAAI,sBAAsB,GAAG,QAAQ,CAAC;IACtC,IAAI,YAAY,GAAG,QAAQ,CAAC;IAC5B,IAAI,cAAc,GAAgB,IAAI,CAAC;IACvC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACzD,MAAM,yBAAyB,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACjE,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,yBAAyB,CAAC,CAAC;QAChF,IAAI,WAAW,GAAG,sBAAsB;YACpC,CAAC,WAAW,KAAK,sBAAsB,IAAI,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC;YACnE,sBAAsB,GAAG,WAAW,CAAC;YACrC,YAAY,GAAG,KAAK,CAAC;YACrB,aAAa,GAAG,EAAE,CAAC;YACnB,cAAc,GAAG,yBAAyB,CAAC;QAC/C,CAAC;IACL,CAAC;IACD,IAAI,aAAa,KAAK,IAAI,IAAI,cAAc,EAAE,CAAC;QAC3C,OAAO;YACH,MAAM,EAAE,aAAa;YACrB,SAAS,EAAE,YAAY;YACvB,aAAa,EAAE,cAAc;YAC7B,yEAAyE;SAC5E,CAAC;IACN,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/math/picking/get-closest-entity-to-point.d.ts

@@ -1,4 +0,0 @@
-import { Entity } from "../../ecs/index.js";
-import { Aabb, Vec3 } from "../index.js";
-import { PickResult } from "./pick-result.js";
-export declare function getClosestEntityToPoint(rows: Map<Entity, Aabb>, point: Vec3): PickResult | null;

package/dist/math/picking/get-closest-entity-to-point.js

@@ -1,27 +0,0 @@
-import { Aabb, Vec3 } from "../index.js";
-export function getClosestEntityToPoint(rows, point) {
-    let closestRow = -1;
-    let closestDistanceSquared = Infinity;
-    let closestAabb = null;
-    for (const [row, aabb] of rows) {
-        const distSquared = Vec3.distanceSquared(point, Aabb.center(aabb));
-        if (distSquared < closestDistanceSquared) {
-            closestDistanceSquared = distSquared;
-            closestRow = row;
-            closestAabb = aabb;
-        }
-    }
-    if (closestRow !== -1 && closestAabb) {
-        // For point-based picking, we need to calculate the alpha along the line
-        // that would put us at the closest point to the AABB center
-        // Since this function is called with a point (line.a), alpha should be 0
-        return {
-            entity: closestRow,
-            lineAlpha: 0,
-            worldPosition: point,
-            // face: AabbFace.fromPosition(point, closestAabb),
-        };
-    }
-    return null;
-}
-//# sourceMappingURL=get-closest-entity-to-point.js.map

package/dist/math/picking/get-closest-entity-to-point.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-closest-entity-to-point.js","sourceRoot":"","sources":["../../../src/math/picking/get-closest-entity-to-point.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAGzC,MAAM,UAAU,uBAAuB,CAAC,IAAuB,EAAE,KAAW;IACxE,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,sBAAsB,GAAG,QAAQ,CAAC;IACtC,IAAI,WAAW,GAAgB,IAAI,CAAC;IACpC,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACnE,IAAI,WAAW,GAAG,sBAAsB,EAAE,CAAC;YACvC,sBAAsB,GAAG,WAAW,CAAC;YACrC,UAAU,GAAG,GAAG,CAAC;YACjB,WAAW,GAAG,IAAI,CAAC;QACvB,CAAC;IACL,CAAC;IACD,IAAI,UAAU,KAAK,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC;QACnC,yEAAyE;QACzE,4DAA4D;QAC5D,yEAAyE;QACzE,OAAO;YACH,MAAM,EAAE,UAAU;YAClB,SAAS,EAAE,CAAC;YACZ,aAAa,EAAE,KAAK;YACpB,mDAAmD;SACtD,CAAC;IACN,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/math/picking/get-intersecting-entities.d.ts

@@ -1,12 +0,0 @@
-import { Entity } from "../../ecs/index.js";
-import { Table } from "../../table/table.js";
-import { Aabb, Line3 } from "../index.js";
-export declare function getIntersectingEntities<T extends Table<{
-    id: Entity;
-    boundingBox: Aabb;
-}>>(options: {
-    tables: readonly T[];
-    line: Line3;
-    radius?: number;
-    predicate?: (table: T, row: number) => boolean;
-}): Map<Entity, Aabb>;

package/dist/math/picking/get-intersecting-entities.js

@@ -1,15 +0,0 @@
-import { Aabb } from "../index.js";
-export function getIntersectingEntities(options) {
-    const { tables, line, radius = 0, predicate } = options;
-    const rows = new Map();
-    for (const table of tables) {
-        for (let row = 0; row < table.rowCount; row++) {
-            const boundingBox = table.columns.boundingBox.get(row);
-            if (Aabb.lineIntersection(boundingBox, line, radius) !== -1 && (predicate?.(table, row) ?? true)) {
-                rows.set(table.columns.id.get(row), boundingBox);
-            }
-        }
-    }
-    return rows;
-}
-//# sourceMappingURL=get-intersecting-entities.js.map

package/dist/math/picking/get-intersecting-entities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-intersecting-entities.js","sourceRoot":"","sources":["../../../src/math/picking/get-intersecting-entities.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAS,MAAM,aAAa,CAAC;AAE1C,MAAM,UAAU,uBAAuB,CAAsD,OAK5F;IACG,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IACxD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAC;IACrC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QACzB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC;YAC5C,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvD,IAAI,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;gBAC/F,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;YACrD,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/math/picking/getClosestEntityToLine.d.ts

@@ -1,4 +0,0 @@
-import { Entity } from "../../ecs/index.js";
-import { Aabb, Line3 } from "../index.js";
-import { PickResult } from "./pick-result.js";
-export declare function getClosestEntityToLine(rows: Map<Entity, Aabb>, line: Line3): PickResult | null;

package/dist/math/picking/getClosestEntityToLine.js

@@ -1,29 +0,0 @@
-import { Aabb, Line3, Vec3, AabbFace } from "../index.js";
-export function getClosestEntityToLine(rows, line) {
-    let closestEntity = null;
-    let closestDistanceSquared = Infinity;
-    let closestAlpha = Infinity;
-    let pickedPosition = null;
-    for (const [id, aabb] of rows) {
-        const aabbCenter = Aabb.center(aabb);
-        const alpha = Line3.closestPointOnLine(line, aabbCenter);
-        const closestPointOnLineSegment = Line3.interpolate(line, alpha);
-        const distSquared = Vec3.distanceSquared(aabbCenter, closestPointOnLineSegment);
-        if (distSquared < closestDistanceSquared ||
-            (distSquared === closestDistanceSquared && alpha < closestAlpha)) {
-            closestDistanceSquared = distSquared;
-            closestAlpha = alpha;
-            closestEntity = id;
-            pickedPosition = closestPointOnLineSegment;
-        }
-    }
-    if (closestEntity !== null && pickedPosition) {
-        return {
-            entity: closestEntity,
-            position: pickedPosition,
-            face: AabbFace.fromPosition(pickedPosition, rows.get(closestEntity)),
-        };
-    }
-    return null;
-}
-//# sourceMappingURL=getClosestEntityToLine.js.map

package/dist/math/picking/getClosestEntityToLine.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getClosestEntityToLine.js","sourceRoot":"","sources":["../../../src/math/picking/getClosestEntityToLine.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAG1D,MAAM,UAAU,sBAAsB,CAAC,IAAuB,EAAE,IAAW;IACvE,IAAI,aAAa,GAAkB,IAAI,CAAC;IACxC,IAAI,sBAAsB,GAAG,QAAQ,CAAC;IACtC,IAAI,YAAY,GAAG,QAAQ,CAAC;IAC5B,IAAI,cAAc,GAAgB,IAAI,CAAC;IACvC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACzD,MAAM,yBAAyB,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACjE,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,yBAAyB,CAAC,CAAC;QAChF,IAAI,WAAW,GAAG,sBAAsB;YACpC,CAAC,WAAW,KAAK,sBAAsB,IAAI,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC;YACnE,sBAAsB,GAAG,WAAW,CAAC;YACrC,YAAY,GAAG,KAAK,CAAC;YACrB,aAAa,GAAG,EAAE,CAAC;YACnB,cAAc,GAAG,yBAAyB,CAAC;QAC/C,CAAC;IACL,CAAC;IACD,IAAI,aAAa,KAAK,IAAI,IAAI,cAAc,EAAE,CAAC;QAC3C,OAAO;YACH,MAAM,EAAE,aAAa;YACrB,QAAQ,EAAE,cAAc;YACxB,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,CAAE,CAAC;SACxE,CAAC;IACN,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/math/picking/getClosestEntityToPoint.d.ts

@@ -1,4 +0,0 @@
-import { Entity } from "../../ecs/index.js";
-import { Aabb, Vec3 } from "../index.js";
-import { PickResult } from "./pick-result.js";
-export declare function getClosestEntityToPoint(rows: Map<Entity, Aabb>, point: Vec3): PickResult | null;

package/dist/math/picking/getClosestEntityToPoint.js

@@ -1,27 +0,0 @@
-import { Aabb, Vec3, AabbFace } from "../index.js";
-export function getClosestEntityToPoint(rows, point) {
-    let closestRow = -1;
-    let closestDistanceSquared = Infinity;
-    let closestAabb = null;
-    for (const [row, aabb] of rows) {
-        const distSquared = Vec3.distanceSquared(point, Aabb.center(aabb));
-        if (distSquared < closestDistanceSquared) {
-            closestDistanceSquared = distSquared;
-            closestRow = row;
-            closestAabb = aabb;
-        }
-    }
-    if (closestRow !== -1 && closestAabb) {
-        // For direct intersection, use the intersection point if possible
-        // We'll use the intersection alpha from Aabb.lineIntersection
-        // If the line starts inside, alpha=0, so position is line.a
-        // Otherwise, Line3.interpolate at alpha
-        return {
-            entity: closestRow,
-            position: point,
-            face: AabbFace.fromPosition(point, closestAabb),
-        };
-    }
-    return null;
-}
-//# sourceMappingURL=getClosestEntityToPoint.js.map

package/dist/math/picking/getClosestEntityToPoint.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getClosestEntityToPoint.js","sourceRoot":"","sources":["../../../src/math/picking/getClosestEntityToPoint.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGnD,MAAM,UAAU,uBAAuB,CAAC,IAAuB,EAAE,KAAW;IACxE,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,sBAAsB,GAAG,QAAQ,CAAC;IACtC,IAAI,WAAW,GAAgB,IAAI,CAAC;IACpC,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACnE,IAAI,WAAW,GAAG,sBAAsB,EAAE,CAAC;YACvC,sBAAsB,GAAG,WAAW,CAAC;YACrC,UAAU,GAAG,GAAG,CAAC;YACjB,WAAW,GAAG,IAAI,CAAC;QACvB,CAAC;IACL,CAAC;IACD,IAAI,UAAU,KAAK,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC;QACnC,kEAAkE;QAClE,8DAA8D;QAC9D,4DAA4D;QAC5D,wCAAwC;QACxC,OAAO;YACH,MAAM,EAAE,UAAU;YAClB,QAAQ,EAAE,KAAK;YACf,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,KAAK,EAAE,WAAW,CAAC;SAClD,CAAC;IACN,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/math/picking/getIntersectingEntities.d.ts

@@ -1,12 +0,0 @@
-import { Entity } from "../../ecs/index.js";
-import { Table } from "../../table/table.js";
-import { Aabb, Line3 } from "../index.js";
-export declare function getIntersectingEntities<T extends Table<{
-    id: Entity;
-    boundingBox: Aabb;
-}>>(options: {
-    tables: readonly T[];
-    line: Line3;
-    radius?: number;
-    predicate?: (table: T, row: number) => boolean;
-}): Map<Entity, Aabb>;

package/dist/math/picking/getIntersectingEntities.js

@@ -1,15 +0,0 @@
-import { Aabb } from "../index.js";
-export function getIntersectingEntities(options) {
-    const { tables, line, radius = 0, predicate } = options;
-    const rows = new Map();
-    for (const table of tables) {
-        for (let row = 0; row < table.rowCount; row++) {
-            const boundingBox = table.columns.boundingBox.get(row);
-            if (Aabb.lineIntersection(boundingBox, line, radius) !== -1 && (predicate?.(table, row) ?? true)) {
-                rows.set(table.columns.id.get(row), boundingBox);
-            }
-        }
-    }
-    return rows;
-}
-//# sourceMappingURL=getIntersectingEntities.js.map

package/dist/math/picking/getIntersectingEntities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getIntersectingEntities.js","sourceRoot":"","sources":["../../../src/math/picking/getIntersectingEntities.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAS,MAAM,aAAa,CAAC;AAE1C,MAAM,UAAU,uBAAuB,CAAsD,OAK5F;IACG,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IACxD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAC;IACrC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QACzB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC;YAC5C,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvD,IAAI,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;gBAC/F,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;YACrD,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/math/picking/index.d.ts

@@ -1,5 +0,0 @@
-export * from "./pick-from-tables.js";
-export * from "./pick-result.js";
-export * from "./get-closest-entity-to-point.js";
-export * from "./get-closest-entity-to-line.js";
-export * from "./get-intersecting-entities.js";

package/dist/math/picking/index.js

@@ -1,27 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-export * from "./pick-from-tables.js";
-export * from "./pick-result.js";
-export * from "./get-closest-entity-to-point.js";
-export * from "./get-closest-entity-to-line.js";
-export * from "./get-intersecting-entities.js";
-//# sourceMappingURL=index.js.map

package/dist/math/picking/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/math/picking/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAGX,cAAc,uBAAuB,CAAC;AACtC,cAAc,kBAAkB,CAAC;AACjC,cAAc,kCAAkC,CAAC;AACjD,cAAc,iCAAiC,CAAC;AAChD,cAAc,gCAAgC,CAAC"}

package/dist/math/picking/pick-from-tables.d.ts

@@ -1,19 +0,0 @@
-import { Table } from "../../table/index.js";
-import { Aabb } from "../index.js";
-import { Line3 } from "../index.js";
-import { Entity } from "../../ecs/index.js";
-import { PickResult } from "./pick-result.js";
-/**
- * Picks the closest intersecting row from a table.
- * This would be the broad phase picking step.
- * @returns The entity id and picked position, or null if no entity is found.
- */
-export declare function pickFromTables<T extends Table<{
-    id: Entity;
-    boundingBox: Aabb;
-}>>(options: {
-    tables: readonly T[];
-    line: Line3;
-    radius?: number;
-    predicate?: (table: T, row: number) => boolean;
-}): PickResult | null;

package/dist/math/picking/pick-from-tables.js

@@ -1,63 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-import { Aabb } from "../index.js";
-import { Line3 } from "../index.js";
-import { getIntersectingEntities } from "./get-intersecting-entities.js";
-import { getClosestEntityToPoint } from "./get-closest-entity-to-point.js";
-import { getClosestEntityToLine } from "./get-closest-entity-to-line.js";
-/**
- * Picks the closest intersecting row from a table.
- * This would be the broad phase picking step.
- * @returns The entity id and picked position, or null if no entity is found.
- */
-export function pickFromTables(options) {
-    const { tables, line, radius = 0, predicate } = options;
-    let rows = getIntersectingEntities({ tables, line, radius: 0, predicate });
-    if (rows.size > 0) {
-        // For direct intersection, find the alpha for the closest intersecting entity
-        let best = null;
-        for (const [id, aabb] of rows) {
-            const alpha = Aabb.lineIntersection(aabb, line, 0);
-            if (alpha !== -1 && (best === null || alpha < best.alpha)) {
-                best = { id, alpha };
-            }
-        }
-        if (best) {
-            return {
-                entity: best.id,
-                lineAlpha: best.alpha,
-                worldPosition: Line3.interpolate(line, best.alpha),
-                // face: AabbFace.fromPosition(Line3.interpolate(line, best.alpha), rows.get(best.id)!),
-            };
-        }
-        // fallback (should not happen):
-        return getClosestEntityToPoint(rows, line.a);
-    }
-    else if (radius > 0) {
-        rows = getIntersectingEntities({ tables, line, radius, predicate });
-        if (rows.size > 0) {
-            return getClosestEntityToLine(rows, line);
-        }
-    }
-    return null;
-}
-//# sourceMappingURL=pick-from-tables.js.map

package/dist/math/picking/pick-from-tables.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pick-from-tables.js","sourceRoot":"","sources":["../../../src/math/picking/pick-from-tables.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAGX,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAGpC,OAAO,EAAE,uBAAuB,EAAE,MAAM,gCAAgC,CAAC;AACzE,OAAO,EAAE,uBAAuB,EAAE,MAAM,kCAAkC,CAAC;AAC3E,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAEzE;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAqD,OAKlF;IACG,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IACxD,IAAI,IAAI,GAAG,uBAAuB,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;IAC3E,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAChB,8EAA8E;QAC9E,IAAI,IAAI,GAAyC,IAAI,CAAC;QACtD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxD,IAAI,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;YACzB,CAAC;QACL,CAAC;QACD,IAAI,IAAI,EAAE,CAAC;YACP,OAAO;gBACH,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,SAAS,EAAE,IAAI,CAAC,KAAK;gBACrB,aAAa,EAAE,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;gBAClD,wFAAwF;aAC3F,CAAC;QACN,CAAC;QACD,gCAAgC;QAChC,OAAO,uBAAuB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;SAAM,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,IAAI,GAAG,uBAAuB,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;QACpE,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAChB,OAAO,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/math/picking/pick-result.d.ts

@@ -1,12 +0,0 @@
-import { Entity } from "../../ecs/index.js";
-import { Vec3 } from "../index.js";
-export interface PickResult {
-    /** The entity that was picked. */
-    entity: Entity;
-    /** Alpha value (0-1) along the picking line where the intersection/closest point occurs. */
-    lineAlpha: number;
-    /** World-space position of the picked entity. */
-    worldPosition: Vec3;
-    /** Model-space position on the picked entity. */
-    modelPosition?: Vec3;
-}

package/dist/math/picking/pick-result.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pick-result.js","sourceRoot":"","sources":["../../../src/math/picking/pick-result.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW"}

package/dist/math/plane/constants/functions.d.ts

@@ -1,16 +0,0 @@
-import type { Plane } from "../plane.js";
-import type { Vec3 } from "../../vec3/index.js";
-import type { Line3 } from "../../line3/line3.js";
-export declare function is(value: any): value is Plane;
-export declare const signedDistance: (plane: Plane, point: Vec3) => number;
-export declare const distance: (plane: Plane, point: Vec3) => number;
-export declare const containsPoint: (plane: Plane, point: Vec3) => boolean;
-export declare const isPointInFront: (plane: Plane, point: Vec3) => boolean;
-export declare const isPointBehind: (plane: Plane, point: Vec3) => boolean;
-/**
- * Find the intersection alpha between a line and a plane.
- * @param plane The plane to intersect with
- * @param line The line to intersect
- * @returns The alpha parameter (0-1 = within segment, <0 or >1 = outside segment), or null if line is parallel to plane
- */
-export declare const lineIntersection: (plane: Plane, line: Line3) => number | null;

package/dist/math/plane/constants/functions.js

@@ -1,54 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-import { Vec3 as Vec3Namespace, epsilon } from "../../index.js";
-export function is(value) {
-    return value && typeof value === 'object' && 'normal' in value && 'distance' in value;
-}
-// Plane utility functions
-export const signedDistance = (plane, point) => Vec3Namespace.dot(plane.normal, point) - plane.distance;
-export const distance = (plane, point) => Math.abs(signedDistance(plane, point));
-export const containsPoint = (plane, point) => Math.abs(signedDistance(plane, point)) < epsilon;
-export const isPointInFront = (plane, point) => signedDistance(plane, point) > 0;
-export const isPointBehind = (plane, point) => signedDistance(plane, point) < 0;
-/**
- * Find the intersection alpha between a line and a plane.
- * @param plane The plane to intersect with
- * @param line The line to intersect
- * @returns The alpha parameter (0-1 = within segment, <0 or >1 = outside segment), or null if line is parallel to plane
- */
-export const lineIntersection = (plane, line) => {
-    const { a, b } = line;
-    // Calculate line direction vector
-    const direction = Vec3Namespace.subtract(b, a);
-    // Calculate denominator: dot(normal, direction)
-    const denominator = Vec3Namespace.dot(plane.normal, direction);
-    // If denominator is close to zero, line is parallel to plane
-    if (Math.abs(denominator) < epsilon) {
-        return null;
-    }
-    // Calculate numerator: dot(normal, a) - distance
-    const numerator = Vec3Namespace.dot(plane.normal, a) - plane.distance;
-    // Calculate parameter t (alpha)
-    const alpha = -numerator / denominator;
-    return alpha;
-};
-//# sourceMappingURL=functions.js.map

package/dist/math/plane/constants/functions.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"functions.js","sourceRoot":"","sources":["../../../../src/math/plane/constants/functions.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAKX,OAAO,EAAE,IAAI,IAAI,aAAa,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAEhE,MAAM,UAAU,EAAE,CAAC,KAAU;IACzB,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAI,KAAK,IAAI,UAAU,IAAI,KAAK,CAAC;AAC1F,CAAC;AAED,0BAA0B;AAC1B,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,KAAY,EAAE,KAAW,EAAU,EAAE,CAChE,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC;AAE5D,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAY,EAAE,KAAW,EAAU,EAAE,CAC1D,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;AAE3C,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAY,EAAE,KAAW,EAAW,EAAE,CAChE,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC;AAErD,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,KAAY,EAAE,KAAW,EAAW,EAAE,CACjE,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;AAErC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAY,EAAE,KAAW,EAAW,EAAE,CAChE,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;AAErC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,KAAY,EAAE,IAAW,EAAiB,EAAE;IACzE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;IAEtB,kCAAkC;IAClC,MAAM,SAAS,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE/C,gDAAgD;IAChD,MAAM,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAE/D,6DAA6D;IAC7D,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,OAAO,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,iDAAiD;IACjD,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC;IAEtE,gCAAgC;IAChC,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,WAAW,CAAC;IAEvC,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC"}

package/dist/math/plane/constants/index.d.ts

@@ -1,3 +0,0 @@
-export * from "./functions.js";
-export * from "./layout.js";
-export * from "./schema.js";

package/dist/math/plane/constants/index.js

@@ -1,25 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-export * from "./functions.js";
-export * from "./layout.js";
-export * from "./schema.js";
-//# sourceMappingURL=index.js.map

package/dist/math/plane/constants/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/math/plane/constants/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAEX,cAAc,gBAAgB,CAAC;AAC/B,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC"}

package/dist/math/plane/constants/layout.d.ts

@@ -1 +0,0 @@
-export declare const layout: import("../../../typed-buffer/index.js").StructLayout;

package/dist/math/plane/constants/layout.js

@@ -1,25 +0,0 @@
-/*MIT License
-
-© Copyright 2025 Adobe. All rights reserved.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.*/
-import { getStructLayout } from "../../../typed-buffer/index.js";
-import { schema } from "./schema.js";
-export const layout = getStructLayout(schema);
-//# sourceMappingURL=layout.js.map

package/dist/math/plane/constants/layout.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../../../src/math/plane/constants/layout.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAEX,OAAO,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AACjE,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,MAAM,CAAC,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC"}

package/dist/math/plane/constants/schema.d.ts

@@ -1,24 +0,0 @@
-export declare const schema: {
-    readonly type: "object";
-    readonly properties: {
-        readonly normal: {
-            readonly type: "array";
-            readonly items: {
-                readonly type: "number";
-                readonly precision: 1;
-                readonly default: number;
-            };
-            readonly minItems: 3;
-            readonly maxItems: 3;
-            readonly default: readonly [0, 0, 0];
-        };
-        readonly distance: {
-            readonly type: "number";
-            readonly precision: 1;
-            readonly default: number;
-        };
-    };
-    readonly layout: "std140";
-    readonly required: readonly ["normal", "distance"];
-    readonly additionalProperties: false;
-};