@adobe/data 0.7.2 → 0.7.3

package/dist/lit/elements/service-application.js

@@ -1,55 +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.*/
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
-    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
-    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
-    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
-    return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-import { html, LitElement } from "lit";
-import { property } from "lit/decorators.js";
-import { provide } from "@lit/context";
-import { serviceContext } from "./service-context.js";
-import { isDisposable } from "../../service/disposable.js";
-export class ServiceApplication extends LitElement {
-    async updated(changedProperties) {
-        super.updated(changedProperties);
-        this.service ??= await this.createService();
-    }
-    disconnectedCallback() {
-        super.disconnectedCallback();
-        if (isDisposable(this.service)) {
-            this.service.dispose();
-        }
-        this.service = null;
-    }
-    render() {
-        return html `
-            <div>Service Application Should Be Overridden</div>
-        `;
-    }
-}
-__decorate([
-    provide({ context: serviceContext }),
-    property({ type: Object })
-], ServiceApplication.prototype, "service", void 0);
-//# sourceMappingURL=service-application.js.map

package/dist/lit/elements/service-application.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"service-application.js","sourceRoot":"","sources":["../../../src/lit/elements/service-application.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;;;;;;;AAEX,OAAO,EAAE,IAAI,EAAE,UAAU,EAAkB,MAAM,KAAK,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAE3D,MAAM,OAAgB,kBAAsC,SAAQ,UAAU;IAQjE,KAAK,CAAC,OAAO,CAAC,iBAAiC;QACpD,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;QACjC,IAAI,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;IAChD,CAAC;IAEQ,oBAAoB;QACzB,KAAK,CAAC,oBAAoB,EAAE,CAAC;QAC7B,IAAI,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,IAAW,CAAC;IAC/B,CAAC;IAEQ,MAAM;QACX,OAAO,IAAI,CAAA;;SAEV,CAAC;IACN,CAAC;CACJ;AAtBa;IAFT,OAAO,CAAC,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC;IACpC,QAAQ,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;mDACL"}

package/dist/lit/elements/service-context.d.ts

@@ -1 +0,0 @@
-export declare const serviceContext: import("@lit/context").Context<symbol, unknown>;

package/dist/lit/elements/service-context.js

@@ -1,24 +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 { createContext } from "@lit/context";
-export const serviceContext = createContext(Symbol("service"));
-//# sourceMappingURL=service-context.js.map

package/dist/lit/elements/service-context.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"service-context.js","sourceRoot":"","sources":["../../../src/lit/elements/service-context.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAEX,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAE7C,MAAM,CAAC,MAAM,cAAc,GAAG,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC"}

package/dist/lit/elements/service-element.d.ts

@@ -1,6 +0,0 @@
-import { LitElement } from "lit";
-import { Service } from "../../service/index.js";
-export declare class ServiceElement<S extends Service> extends LitElement {
-    protected service: S;
-    constructor();
-}

package/dist/lit/elements/service-element.js

@@ -1,43 +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.*/
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
-    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
-    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
-    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
-    return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-import { LitElement } from "lit";
-import { serviceContext } from "./service-context.js";
-import { property } from "lit/decorators.js";
-import { consume } from "@lit/context";
-import { applyServiceDecorators } from "../decorators/apply-service-decorators.js";
-export class ServiceElement extends LitElement {
-    constructor() {
-        super();
-        applyServiceDecorators(this);
-    }
-}
-__decorate([
-    consume({ context: serviceContext }),
-    property({ type: Object })
-], ServiceElement.prototype, "service", void 0);
-//# sourceMappingURL=service-element.js.map

package/dist/lit/elements/service-element.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"service-element.js","sourceRoot":"","sources":["../../../src/lit/elements/service-element.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;;;;;;;AAEX,OAAO,EAAE,UAAU,EAAE,MAAM,KAAK,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAE7C,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,sBAAsB,EAAE,MAAM,2CAA2C,CAAC;AAEnF,MAAM,OAAO,cAAkC,SAAQ,UAAU;IAM7D;QACI,KAAK,EAAE,CAAC;QACR,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;CAEJ;AAPa;IAFT,OAAO,CAAC,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC;IACpC,QAAQ,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;+CACL"}

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,
-            entityPosition: 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,cAAc,EAAE,cAAc;YAC9B,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,
-            entityPosition: 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,cAAc,EAAE,KAAK;YACrB,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/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,
-                entityPosition: 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,cAAc,EAAE,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;gBACnD,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,10 +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 entity or closest point on the AABB. */
-    entityPosition: Vec3;
-}

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

@@ -1,23 +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 {};
-//# sourceMappingURL=pick-result.js.map

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/old-ecs/privacy/helper-functions.d.ts

@@ -1,43 +0,0 @@
-import { Schema } from "../../schema/index.js";
-/**
- * Privacy options used in Schema
- */
-export type PrivacyOptions = {
-    [K in NonNullable<Schema["privacy"]>]?: boolean;
-};
-/**
- * Checks if a component should be included for serialization
- * @param schema
- * @param privacyOptions
- * @returns Whether the component should be included
- */
-export declare const shouldIncludeComponentForSerialization: (schema: Schema, privacyOptions?: PrivacyOptions) => boolean;
-/**
- * Filters a column for privacy by replacing its data with default values if it contains any data.
- * @param schema - The schema of the component
- * @param rows - The number of rows in the table
- * @param data - The data of the column
- * @returns The filtered column containing default values
- */
-export declare const filterColumnForPrivacy: (schema: Schema, rows: any, data: any) => any;
-/**
- * Gets a filtered column based on privacy options
- * @param name - The name of the component
- * @param privacyOptions
- * @param data - The data of the column
- * @param componentSchemas
- * @param rows - The number of rows in the table
- * @returns A tuple containing the name of the component and the filtered column data
- */
-export declare const getFilteredColumn: (name: string, privacyOptions: PrivacyOptions | undefined, data: any, componentSchemas: Record<string, Schema>, rows: number) => any[];
-/**
- * Filters a table for privacy based on the filtered components.
- * @param filteredComponents - The components to filter
- * @param table - The table to filter
- * @param options - The privacy options to use
- * @returns The filtered table
- */
-export declare const filterTableForPrivacy: (filteredComponents: Record<string, Schema>, table: any, options: any) => {
-    rows: any;
-    columns: any;
-};

package/dist/old-ecs/privacy/helper-functions.js

@@ -1,76 +0,0 @@
-/**
- * Checks if a component should be included for serialization
- * @param schema
- * @param privacyOptions
- * @returns Whether the component should be included
- */
-export const shouldIncludeComponentForSerialization = (schema, privacyOptions) => {
-    // const schema = componentSchemas[component as keyof C];
-    // if the component has no privacy attribute, it is considered as necessary.
-    // this is to maintain backwards compatibility with existing schemas
-    if (!schema?.privacy) {
-        return true;
-    }
-    // Check the privacy attribute
-    return !schema.privacy || (privacyOptions?.[schema.privacy] ?? (schema.privacy === 'strictlyNecessary'));
-};
-/**
- * Filters a column for privacy by replacing its data with default values if it contains any data.
- * @param schema - The schema of the component
- * @param rows - The number of rows in the table
- * @param data - The data of the column
- * @returns The filtered column containing default values
- */
-export const filterColumnForPrivacy = (schema, rows, data) => {
-    let value = data;
-    // If the column has no data and the filtered component has a default, use the default
-    if (value !== undefined && value !== null && (Array.isArray(value) && value.length !== 0)) {
-        // Create array filled with default values for the number of rows
-        if (rows > 0) {
-            value = new Array(rows).fill(schema.default);
-        }
-        else {
-            value = [];
-        }
-    }
-    console.warn(`Updated column for schema ${JSON.stringify(schema)} with rows: ${rows}, original data: ${JSON.stringify(data)}, resulting value: ${JSON.stringify(value)} for privacy filter`);
-    return value;
-};
-/**
- * Gets a filtered column based on privacy options
- * @param name - The name of the component
- * @param privacyOptions
- * @param data - The data of the column
- * @param componentSchemas
- * @param rows - The number of rows in the table
- * @returns A tuple containing the name of the component and the filtered column data
- */
-export const getFilteredColumn = (name, privacyOptions, data, componentSchemas, rows) => {
-    const schema = componentSchemas[name];
-    if (shouldIncludeComponentForSerialization(schema, privacyOptions)) {
-        return [name, data];
-    }
-    else {
-        return [name, filterColumnForPrivacy(componentSchemas[name], rows, data)];
-    }
-};
-/**
- * Filters a table for privacy based on the filtered components.
- * @param filteredComponents - The components to filter
- * @param table - The table to filter
- * @param options - The privacy options to use
- * @returns The filtered table
- */
-export const filterTableForPrivacy = (filteredComponents, table, options) => {
-    // filter the tables for privacy based on the filtered components.
-    const { rows, columns } = table;
-    const filteredColumns = Object.fromEntries(Object.entries(columns)
-        .map(([name, data]) => {
-        return getFilteredColumn(name, options, data, filteredComponents, rows);
-    }));
-    return {
-        rows,
-        columns: filteredColumns,
-    };
-};
-//# sourceMappingURL=helper-functions.js.map

package/dist/old-ecs/privacy/helper-functions.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"helper-functions.js","sourceRoot":"","sources":["../../../src/old-ecs/privacy/helper-functions.ts"],"names":[],"mappings":"AA8BA;;;;;GAKG;AACH,MAAM,CAAC,MAAM,sCAAsC,GAAG,CAAC,MAAc,EAAE,cAA+B,EAAW,EAAE;IAC/G,yDAAyD;IACzD,4EAA4E;IAC5E,oEAAoE;IACpE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,8BAA8B;IAC9B,OAAO,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,mBAAmB,CAAC,CAAC,CAAC;AAC7G,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,MAAc,EAAE,IAAS,EAAE,IAAS,EAAE,EAAE;IAC3E,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,sFAAsF;IACtF,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QACxF,iEAAiE;QACjE,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACX,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACjD,CAAC;aAAM,CAAC;YACJ,KAAK,GAAG,EAAE,CAAC;QACf,CAAC;IACL,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,6BAA6B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,eAAe,IAAI,oBAAoB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,sBAAsB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAC7L,OAAO,KAAK,CAAC;AACjB,CAAC,CAAA;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,IAAY,EAAE,cAA0C,EAAE,IAAS,EAAE,gBAAwC,EAAE,IAAY,EAAE,EAAE;IAC7J,MAAM,MAAM,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,sCAAsC,CAAC,MAAM,EAAE,cAAc,CAAC,EAAE,CAAC;QACjE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;SAAM,CAAC;QACJ,OAAO,CAAC,IAAI,EAAE,sBAAsB,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9E,CAAC;AACL,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,kBAA0C,EAAE,KAAU,EAAE,OAAY,EAAE,EAAE;IAC1G,kEAAkE;IAClE,MAAM,EAAC,IAAI,EAAE,OAAO,EAAC,GAAG,KAAK,CAAC;IAC9B,MAAM,eAAe,GAAG,MAAM,CAAC,WAAW,CACtC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC;SAClB,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE;QAClB,OAAO,iBAAiB,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CACT,CAAC;IAEF,OAAO;QACH,IAAI;QACJ,OAAO,EAAE,eAAe;KAC3B,CAAC;AACN,CAAC,CAAA"}

package/dist/old-ecs/privacy/helper-functions.test.d.ts

@@ -1 +0,0 @@
-export {};