@grafloria/element 0.3.18 → 0.3.19

package/src/libs/engine/src/performance/SpatialIndex.d.ts

@@ -0,0 +1,157 @@
+import type { Rectangle } from '../types/geometry.types';
+/**
+ * Configuration for SpatialIndex
+ */
+export interface SpatialIndexConfig<T> {
+    /**
+     * Size of grid cells for spatial partitioning (default: 100)
+     */
+    cellSize?: number;
+    /**
+     * Function to extract bounds from entity
+     */
+    getBounds: (entity: T) => Rectangle;
+}
+/**
+ * Query options for spatial queries
+ */
+export interface QueryOptions<T> {
+    /**
+     * Filter function to exclude entities from results
+     */
+    filter?: (entity: T) => boolean;
+    /**
+     * Maximum number of entities to return
+     */
+    limit?: number;
+}
+/**
+ * Generic spatial index using grid-based partitioning
+ * Enables fast viewport queries for virtualization (O(visible) instead of O(all))
+ *
+ * Phase 5.1: Viewport Virtualization
+ *
+ * @example
+ * ```typescript
+ * const index = new SpatialIndex<NodeModel>({
+ *   cellSize: 100,
+ *   getBounds: (node) => ({
+ *     x: node.position.x,
+ *     y: node.position.y,
+ *     width: node.size.width,
+ *     height: node.size.height,
+ *   }),
+ * });
+ *
+ * index.add(node);
+ * const visible = index.queryRegion(viewport);
+ * ```
+ */
+export declare class SpatialIndex<T extends {
+    id: string;
+}> {
+    private readonly cellSize;
+    private readonly getBounds;
+    /**
+     * Map of entity ID to entity
+     */
+    private entities;
+    /**
+     * Grid cells: cellKey -> Set<entityId>
+     * cellKey format: "row,col"
+     */
+    private grid;
+    constructor(config: SpatialIndexConfig<T>);
+    /**
+     * Add entity to spatial index
+     */
+    add(entity: T): void;
+    /**
+     * Update entity position in spatial index
+     */
+    update(entity: T): void;
+    /**
+     * Remove entity from spatial index
+     */
+    remove(id: string): boolean;
+    /**
+     * Get entity by ID
+     */
+    get(id: string): T | undefined;
+    /**
+     * Get number of entities in index
+     */
+    size(): number;
+    /**
+     * Clear all entities from index
+     */
+    clear(): void;
+    /**
+     * Query entities in rectangular region (viewport).
+     * This is the key method for viewport virtualization.
+     *
+     * Cost: O(cells(region) + k), where k = entities the region touches — EXCEPT
+     * that the grid walk is skipped entirely when it would be the slower half (see
+     * `shouldScanLinearly`), so the true bound is O(min(cells, n) + k).
+     */
+    queryRegion(region: Rectangle, options?: QueryOptions<T>): T[];
+    /**
+     * All entities whose bounds fall within `radius` of `point`, nearest first.
+     *
+     * wave8/culling — Card 2. Exists so interactive hit-testing (the nearest PORT
+     * to a dragged link end, the node under the cursor) is served by the index
+     * instead of a linear scan of the scene: a drag is a per-pointermove query, so
+     * an O(n) answer is O(n) sixty times a second.
+     *
+     * Distance is measured to the entity's bounding box (0 when the point is
+     * inside it), which is the right metric for "what am I pointing at" and lets
+     * a big entity win over a small distant one.
+     */
+    queryNear(point: {
+        x: number;
+        y: number;
+    }, radius: number, options?: QueryOptions<T>): T[];
+    /**
+     * True when walking the region's cells would touch more cells than the index
+     * holds entities — i.e. when the grid has stopped paying for itself.
+     *
+     * Counted, never materialised: building the key array to measure it would be
+     * the very cost we are avoiding.
+     */
+    private shouldScanLinearly;
+    /** Distance from a point to a rectangle; 0 when the point is inside it. */
+    private distanceToBounds;
+    /**
+     * Add entity to grid cells
+     */
+    private addToGrid;
+    /**
+     * Remove entity from grid cells
+     */
+    private removeFromGrid;
+    /**
+     * Get all grid cells that overlap with rectangle
+     */
+    private getOverlappingCells;
+    /**
+     * Get cell key for grid map
+     */
+    private getCellKey;
+    /**
+     * Check if two rectangles intersect
+     */
+    private rectanglesIntersect;
+    /**
+     * Get all entities (for testing/debugging)
+     */
+    getAllEntities(): T[];
+    /**
+     * Get grid statistics (for performance monitoring)
+     */
+    getStats(): {
+        entities: number;
+        cells: number;
+        averageEntitiesPerCell: number;
+        maxEntitiesPerCell: number;
+    };
+}

package/src/libs/engine/src/performance/SpatialIndex.js

@@ -0,0 +1,306 @@
+"use strict";
+// SpatialIndex.ts - Generic spatial indexing for viewport virtualization (Phase 5.1)
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SpatialIndex = void 0;
+/**
+ * Generic spatial index using grid-based partitioning
+ * Enables fast viewport queries for virtualization (O(visible) instead of O(all))
+ *
+ * Phase 5.1: Viewport Virtualization
+ *
+ * @example
+ * ```typescript
+ * const index = new SpatialIndex<NodeModel>({
+ *   cellSize: 100,
+ *   getBounds: (node) => ({
+ *     x: node.position.x,
+ *     y: node.position.y,
+ *     width: node.size.width,
+ *     height: node.size.height,
+ *   }),
+ * });
+ *
+ * index.add(node);
+ * const visible = index.queryRegion(viewport);
+ * ```
+ */
+class SpatialIndex {
+    constructor(config) {
+        var _a;
+        /**
+         * Map of entity ID to entity
+         */
+        this.entities = new Map();
+        /**
+         * Grid cells: cellKey -> Set<entityId>
+         * cellKey format: "row,col"
+         */
+        this.grid = new Map();
+        this.cellSize = (_a = config.cellSize) !== null && _a !== void 0 ? _a : 100;
+        this.getBounds = config.getBounds;
+    }
+    /**
+     * Add entity to spatial index
+     */
+    add(entity) {
+        if (this.entities.has(entity.id)) {
+            // Update existing entity
+            this.update(entity);
+            return;
+        }
+        this.entities.set(entity.id, entity);
+        this.addToGrid(entity);
+    }
+    /**
+     * Update entity position in spatial index
+     */
+    update(entity) {
+        // Remove from old cells
+        if (this.entities.has(entity.id)) {
+            this.removeFromGrid(entity.id);
+        }
+        // Update entity
+        this.entities.set(entity.id, entity);
+        // Add to new cells
+        this.addToGrid(entity);
+    }
+    /**
+     * Remove entity from spatial index
+     */
+    remove(id) {
+        const entity = this.entities.get(id);
+        if (!entity) {
+            return false;
+        }
+        this.entities.delete(id);
+        this.removeFromGrid(id);
+        return true;
+    }
+    /**
+     * Get entity by ID
+     */
+    get(id) {
+        return this.entities.get(id);
+    }
+    /**
+     * Get number of entities in index
+     */
+    size() {
+        return this.entities.size;
+    }
+    /**
+     * Clear all entities from index
+     */
+    clear() {
+        this.entities.clear();
+        this.grid.clear();
+    }
+    /**
+     * Query entities in rectangular region (viewport).
+     * This is the key method for viewport virtualization.
+     *
+     * Cost: O(cells(region) + k), where k = entities the region touches — EXCEPT
+     * that the grid walk is skipped entirely when it would be the slower half (see
+     * `shouldScanLinearly`), so the true bound is O(min(cells, n) + k).
+     */
+    queryRegion(region, options) {
+        const results = [];
+        let count = 0;
+        // The one job of the grid is to answer without looking at every entity. When
+        // the region is big enough that walking its cells costs MORE than looking at
+        // every entity, the grid has stopped being an index and is just an expensive
+        // way to enumerate the scene — so don't walk it.
+        //
+        // wave8/culling: this is not hypothetical. A viewport at 0.25 zoom is 16x the
+        // world area, and at cellSize 100 a fit-to-content view of a 10k-node diagram
+        // enumerates ~37,000 cell keys (allocating a string for each) to return the
+        // 10,000 entities it was always going to return. A query that returns
+        // everything is not a query, and it must not cost more than the scan it
+        // replaced.
+        const emit = (entity) => {
+            const bounds = this.getBounds(entity);
+            if (!this.rectanglesIntersect(region, bounds))
+                return true;
+            if ((options === null || options === void 0 ? void 0 : options.filter) && !options.filter(entity))
+                return true;
+            results.push(entity);
+            count++;
+            return !((options === null || options === void 0 ? void 0 : options.limit) && count >= options.limit);
+        };
+        if (this.shouldScanLinearly(region)) {
+            for (const entity of this.entities.values()) {
+                if (!emit(entity))
+                    break;
+            }
+            return results;
+        }
+        const cells = this.getOverlappingCells(region);
+        const candidates = new Set();
+        // Collect all entity IDs in overlapping cells
+        for (const cellKey of cells) {
+            const cellEntities = this.grid.get(cellKey);
+            if (cellEntities) {
+                cellEntities.forEach((id) => candidates.add(id));
+            }
+        }
+        for (const id of candidates) {
+            const entity = this.entities.get(id);
+            if (!entity)
+                continue;
+            if (!emit(entity))
+                break;
+        }
+        return results;
+    }
+    /**
+     * All entities whose bounds fall within `radius` of `point`, nearest first.
+     *
+     * wave8/culling — Card 2. Exists so interactive hit-testing (the nearest PORT
+     * to a dragged link end, the node under the cursor) is served by the index
+     * instead of a linear scan of the scene: a drag is a per-pointermove query, so
+     * an O(n) answer is O(n) sixty times a second.
+     *
+     * Distance is measured to the entity's bounding box (0 when the point is
+     * inside it), which is the right metric for "what am I pointing at" and lets
+     * a big entity win over a small distant one.
+     */
+    queryNear(point, radius, options) {
+        var _a;
+        const region = {
+            x: point.x - radius,
+            y: point.y - radius,
+            width: radius * 2,
+            height: radius * 2,
+        };
+        const scored = [];
+        for (const entity of this.queryRegion(region, { filter: options === null || options === void 0 ? void 0 : options.filter })) {
+            const d = this.distanceToBounds(point, this.getBounds(entity));
+            if (d <= radius)
+                scored.push({ entity, d });
+        }
+        scored.sort((a, b) => a.d - b.d);
+        const limit = (_a = options === null || options === void 0 ? void 0 : options.limit) !== null && _a !== void 0 ? _a : scored.length;
+        return scored.slice(0, limit).map((s) => s.entity);
+    }
+    /**
+     * True when walking the region's cells would touch more cells than the index
+     * holds entities — i.e. when the grid has stopped paying for itself.
+     *
+     * Counted, never materialised: building the key array to measure it would be
+     * the very cost we are avoiding.
+     */
+    shouldScanLinearly(region) {
+        const n = this.entities.size;
+        if (n === 0)
+            return true;
+        const cols = Math.floor((region.x + region.width) / this.cellSize) -
+            Math.floor(region.x / this.cellSize) +
+            1;
+        const rows = Math.floor((region.y + region.height) / this.cellSize) -
+            Math.floor(region.y / this.cellSize) +
+            1;
+        // A degenerate/NaN region (an un-laid-out viewport) must not become a
+        // multi-million-cell walk; treat it as a scan.
+        if (!Number.isFinite(cols) || !Number.isFinite(rows))
+            return true;
+        return cols * rows > n;
+    }
+    /** Distance from a point to a rectangle; 0 when the point is inside it. */
+    distanceToBounds(point, b) {
+        const dx = Math.max(b.x - point.x, 0, point.x - (b.x + b.width));
+        const dy = Math.max(b.y - point.y, 0, point.y - (b.y + b.height));
+        return Math.sqrt(dx * dx + dy * dy);
+    }
+    /**
+     * Add entity to grid cells
+     */
+    addToGrid(entity) {
+        const bounds = this.getBounds(entity);
+        const cells = this.getOverlappingCells(bounds);
+        for (const cellKey of cells) {
+            let cellSet = this.grid.get(cellKey);
+            if (!cellSet) {
+                cellSet = new Set();
+                this.grid.set(cellKey, cellSet);
+            }
+            cellSet.add(entity.id);
+        }
+    }
+    /**
+     * Remove entity from grid cells
+     */
+    removeFromGrid(id) {
+        const entity = this.entities.get(id);
+        if (!entity)
+            return;
+        const bounds = this.getBounds(entity);
+        const cells = this.getOverlappingCells(bounds);
+        for (const cellKey of cells) {
+            const cellSet = this.grid.get(cellKey);
+            if (cellSet) {
+                cellSet.delete(id);
+                if (cellSet.size === 0) {
+                    this.grid.delete(cellKey);
+                }
+            }
+        }
+    }
+    /**
+     * Get all grid cells that overlap with rectangle
+     */
+    getOverlappingCells(rect) {
+        const cells = [];
+        const minCol = Math.floor(rect.x / this.cellSize);
+        const maxCol = Math.floor((rect.x + rect.width) / this.cellSize);
+        const minRow = Math.floor(rect.y / this.cellSize);
+        const maxRow = Math.floor((rect.y + rect.height) / this.cellSize);
+        for (let row = minRow; row <= maxRow; row++) {
+            for (let col = minCol; col <= maxCol; col++) {
+                cells.push(this.getCellKey(row, col));
+            }
+        }
+        return cells;
+    }
+    /**
+     * Get cell key for grid map
+     */
+    getCellKey(row, col) {
+        return `${row},${col}`;
+    }
+    /**
+     * Check if two rectangles intersect
+     */
+    rectanglesIntersect(a, b) {
+        return !(a.x + a.width < b.x ||
+            b.x + b.width < a.x ||
+            a.y + a.height < b.y ||
+            b.y + b.height < a.y);
+    }
+    /**
+     * Get all entities (for testing/debugging)
+     */
+    getAllEntities() {
+        return Array.from(this.entities.values());
+    }
+    /**
+     * Get grid statistics (for performance monitoring)
+     */
+    getStats() {
+        const cellSizes = [];
+        this.grid.forEach((cellSet) => {
+            cellSizes.push(cellSet.size);
+        });
+        const maxEntitiesPerCell = cellSizes.length > 0 ? Math.max(...cellSizes) : 0;
+        const averageEntitiesPerCell = cellSizes.length > 0
+            ? cellSizes.reduce((sum, size) => sum + size, 0) / cellSizes.length
+            : 0;
+        return {
+            entities: this.entities.size,
+            cells: this.grid.size,
+            averageEntitiesPerCell,
+            maxEntitiesPerCell,
+        };
+    }
+}
+exports.SpatialIndex = SpatialIndex;
+//# sourceMappingURL=SpatialIndex.js.map

package/src/libs/engine/src/performance/SpatialIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SpatialIndex.js","sourceRoot":"","sources":["../../../../../../engine/src/performance/SpatialIndex.ts"],"names":[],"mappings":";AAAA,qFAAqF;;;AA0CrF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,YAAY;IAevB,YAAY,MAA6B;;QAXzC;;WAEG;QACK,aAAQ,GAAG,IAAI,GAAG,EAAa,CAAC;QAExC;;;WAGG;QACK,SAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;QAG5C,IAAI,CAAC,QAAQ,GAAG,MAAA,MAAM,CAAC,QAAQ,mCAAI,GAAG,CAAC;QACvC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,MAAS;QACX,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACjC,yBAAyB;YACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACpB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,MAAS;QACd,wBAAwB;QACxB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;QAED,gBAAgB;QAChB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAErC,mBAAmB;QACnB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,EAAU;QACf,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;IAED;;;;;;;OAOG;IACH,WAAW,CAAC,MAAiB,EAAE,OAAyB;QACtD,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,6EAA6E;QAC7E,6EAA6E;QAC7E,6EAA6E;QAC7E,iDAAiD;QACjD,EAAE;QACF,8EAA8E;QAC9E,8EAA8E;QAC9E,4EAA4E;QAC5E,sEAAsE;QACtE,wEAAwE;QACxE,YAAY;QACZ,MAAM,IAAI,GAAG,CAAC,MAAS,EAAW,EAAE;YAClC,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3D,IAAI,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,KAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC5D,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,KAAK,EAAE,CAAC;YACR,OAAO,CAAC,CAAC,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,KAAI,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC;QACrD,CAAC,CAAC;QAEF,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;YACpC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;oBAAE,MAAM;YAC3B,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,8CAA8C;QAC9C,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,YAAY,EAAE,CAAC;gBACjB,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;gBAAE,MAAM;QAC3B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,SAAS,CAAC,KAA+B,EAAE,MAAc,EAAE,OAAyB;;QAClF,MAAM,MAAM,GAAc;YACxB,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,MAAM;YACnB,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,MAAM;YACnB,KAAK,EAAE,MAAM,GAAG,CAAC;YACjB,MAAM,EAAE,MAAM,GAAG,CAAC;SACnB,CAAC;QAEF,MAAM,MAAM,GAAoC,EAAE,CAAC;QACnD,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,EAAE,CAAC,EAAE,CAAC;YAC3E,MAAM,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;YAC/D,IAAI,CAAC,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9C,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,mCAAI,MAAM,CAAC,MAAM,CAAC;QAC9C,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;OAMG;IACK,kBAAkB,CAAC,MAAiB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEzB,MAAM,IAAI,GACR,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACpC,CAAC,CAAC;QACJ,MAAM,IAAI,GACR,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACtD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACpC,CAAC,CAAC;QAEJ,sEAAsE;QACtE,+CAA+C;QAC/C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAElE,OAAO,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,2EAA2E;IACnE,gBAAgB,CAAC,KAA+B,EAAE,CAAY;QACpE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACjE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,MAAS;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAE/C,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;gBACpB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAClC,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,EAAU;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM;YAAE,OAAO;QAEpB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAE/C,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACvC,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnB,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;oBACvB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,IAAe;QACzC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAElE,KAAK,IAAI,GAAG,GAAG,MAAM,EAAE,GAAG,IAAI,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,GAAG,GAAG,MAAM,EAAE,GAAG,IAAI,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC;gBAC5C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,GAAW,EAAE,GAAW;QACzC,OAAO,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,CAAY,EAAE,CAAY;QACpD,OAAO,CAAC,CACN,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACnB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACnB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,QAAQ;QAMN,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC5B,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,MAAM,kBAAkB,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,MAAM,sBAAsB,GAC1B,SAAS,CAAC,MAAM,GAAG,CAAC;YAClB,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM;YACnE,CAAC,CAAC,CAAC,CAAC;QAER,OAAO;YACL,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;YAC5B,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI;YACrB,sBAAsB;YACtB,kBAAkB;SACnB,CAAC;IACJ,CAAC;CACF;AAjUD,oCAiUC"}

package/src/libs/engine/src/performance/index.d.ts

@@ -0,0 +1,2 @@
+export * from './PerformanceMonitor';
+export * from '../lib/performance/mobile-performance.service';

package/src/libs/engine/src/performance/index.js

@@ -0,0 +1,7 @@
+"use strict";
+// Performance module exports
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./PerformanceMonitor"), exports);
+tslib_1.__exportStar(require("../lib/performance/mobile-performance.service"), exports);
+//# sourceMappingURL=index.js.map

package/src/libs/engine/src/performance/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../engine/src/performance/index.ts"],"names":[],"mappings":";AAAA,6BAA6B;;;AAE7B,+DAAqC;AACrC,wFAA8D"}

package/src/libs/engine/src/plugins/PluginManager.d.ts

@@ -0,0 +1,95 @@
+import type { Plugin, PluginMetadata } from '../types/plugin.types';
+export interface PluginState {
+    plugin: Plugin;
+    installed: boolean;
+    active: boolean;
+    config: Record<string, any>;
+    error?: Error;
+}
+export interface PluginManagerConfig {
+    autoActivate?: boolean;
+    strict?: boolean;
+}
+export declare class PluginManager {
+    private plugins;
+    private context;
+    private config;
+    private installationOrder;
+    constructor(engine: any, eventBus: any, config?: PluginManagerConfig);
+    /**
+     * Register a plugin (without installing)
+     */
+    register(plugin: Plugin, config?: Record<string, any>): void;
+    /**
+     * Install a plugin
+     */
+    install(pluginName: string): Promise<void>;
+    /**
+     * Uninstall a plugin
+     */
+    uninstall(pluginName: string): Promise<void>;
+    /**
+     * Activate a plugin
+     */
+    activate(pluginName: string): Promise<void>;
+    /**
+     * Deactivate a plugin
+     */
+    deactivate(pluginName: string): Promise<void>;
+    /**
+     * Get plugin by name
+     */
+    get(pluginName: string): Plugin | undefined;
+    /**
+     * Check if plugin is registered
+     */
+    has(pluginName: string): boolean;
+    /**
+     * Check if plugin is installed
+     */
+    isInstalled(pluginName: string): boolean;
+    /**
+     * Check if plugin is active
+     */
+    isActive(pluginName: string): boolean;
+    /**
+     * Get plugin state
+     */
+    getState(pluginName: string): PluginState | undefined;
+    /**
+     * List all registered plugins
+     */
+    list(): PluginMetadata[];
+    /**
+     * List installed plugins
+     */
+    listInstalled(): PluginMetadata[];
+    /**
+     * List active plugins
+     */
+    listActive(): PluginMetadata[];
+    /**
+     * Unregister a plugin (removes from registry)
+     */
+    unregister(pluginName: string): Promise<void>;
+    /**
+     * Install all registered plugins
+     */
+    installAll(): Promise<void>;
+    /**
+     * Uninstall all plugins
+     */
+    uninstallAll(): Promise<void>;
+    /**
+     * Clear all plugins (uninstall and unregister)
+     */
+    clear(): Promise<void>;
+    /**
+     * Check plugin dependencies
+     */
+    private checkDependencies;
+    /**
+     * Topological sort for dependency resolution
+     */
+    private topologicalSort;
+}