@grafloria/element 0.3.19 → 0.3.21

package/src/libs/engine/src/layout/spectral-layout-adapter.js

@@ -1,379 +0,0 @@
-"use strict";
-/**
- * Spectral Layout Adapter
- *
- * Uses graph spectral theory (eigenvalues/eigenvectors) for optimal node placement.
- * Minimizes edge crossings and preserves graph symmetry mathematically.
- *
- * Best for:
- * - Circuit diagrams
- * - Network topology
- * - Symmetric graphs
- * - Mathematical optimization
- *
- * Algorithm: Graph Laplacian spectral decomposition
- *
- * @module layout/spectral-layout-adapter
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SpectralLayoutAdapter = void 0;
-const tslib_1 = require("tslib");
-const rng_1 = require("./rng");
-const layout_quality_metrics_1 = require("./layout-quality-metrics");
-/**
- * Matrix helper class
- */
-class Matrix {
-    constructor(rows, cols, fill = 0) {
-        this.rows = rows;
-        this.cols = cols;
-        this.data = Array(rows)
-            .fill(0)
-            .map(() => Array(cols).fill(fill));
-    }
-    get(i, j) {
-        return this.data[i][j];
-    }
-    set(i, j, value) {
-        this.data[i][j] = value;
-    }
-    add(other) {
-        const result = new Matrix(this.rows, this.cols);
-        for (let i = 0; i < this.rows; i++) {
-            for (let j = 0; j < this.cols; j++) {
-                result.set(i, j, this.get(i, j) + other.get(i, j));
-            }
-        }
-        return result;
-    }
-    subtract(other) {
-        const result = new Matrix(this.rows, this.cols);
-        for (let i = 0; i < this.rows; i++) {
-            for (let j = 0; j < this.cols; j++) {
-                result.set(i, j, this.get(i, j) - other.get(i, j));
-            }
-        }
-        return result;
-    }
-    multiply(scalar) {
-        const result = new Matrix(this.rows, this.cols);
-        for (let i = 0; i < this.rows; i++) {
-            for (let j = 0; j < this.cols; j++) {
-                result.set(i, j, this.get(i, j) * scalar);
-            }
-        }
-        return result;
-    }
-    multiplyVector(v) {
-        const result = new Array(this.rows).fill(0);
-        for (let i = 0; i < this.rows; i++) {
-            for (let j = 0; j < this.cols; j++) {
-                result[i] += this.get(i, j) * v[j];
-            }
-        }
-        return result;
-    }
-    transpose() {
-        const result = new Matrix(this.cols, this.rows);
-        for (let i = 0; i < this.rows; i++) {
-            for (let j = 0; j < this.cols; j++) {
-                result.set(j, i, this.get(i, j));
-            }
-        }
-        return result;
-    }
-}
-/**
- * Vector operations
- */
-class VectorOps {
-    static dot(a, b) {
-        let sum = 0;
-        for (let i = 0; i < a.length; i++) {
-            sum += a[i] * b[i];
-        }
-        return sum;
-    }
-    static norm(v) {
-        return Math.sqrt(this.dot(v, v));
-    }
-    static normalize(v) {
-        const n = this.norm(v);
-        return v.map(x => x / (n + 1e-10));
-    }
-    static subtract(a, b) {
-        return a.map((x, i) => x - b[i]);
-    }
-    static add(a, b) {
-        return a.map((x, i) => x + b[i]);
-    }
-    static multiply(v, scalar) {
-        return v.map(x => x * scalar);
-    }
-}
-/**
- * Spectral Layout Adapter
- *
- * Uses eigendecomposition of graph Laplacian for optimal layout.
- */
-class SpectralLayoutAdapter {
-    constructor() {
-        this.name = 'spectral';
-        /**
-         * Card 0: the run's seeded generator. Established once per apply() so every
-         * helper below draws from the SAME reproducible stream — the seed alone is not
-         * enough if each helper mints its own generator.
-         */
-        this.rng = (0, rng_1.createLayoutRng)();
-    }
-    /**
-     * Apply spectral layout
-     */
-    apply(nodes_1, links_1) {
-        return tslib_1.__awaiter(this, arguments, void 0, function* (nodes, links, options = {}) {
-            var _a, _b, _c, _d, _e, _f;
-            this.rng = (0, rng_1.createLayoutRng)(options === null || options === void 0 ? void 0 : options.seed);
-            const startTime = performance.now();
-            // Merge with defaults
-            const opts = Object.assign({ normalized: (_a = options.normalized) !== null && _a !== void 0 ? _a : true, dimensions: (_b = options.dimensions) !== null && _b !== void 0 ? _b : 2, scale: (_c = options.scale) !== null && _c !== void 0 ? _c : 500, center: (_d = options.center) !== null && _d !== void 0 ? _d : true, convergenceThreshold: (_e = options.convergenceThreshold) !== null && _e !== void 0 ? _e : 1e-6, maxIterations: (_f = options.maxIterations) !== null && _f !== void 0 ? _f : 1000 }, options);
-            const n = nodes.length;
-            if (n === 0) {
-                return {
-                    nodePositions: new Map(),
-                    bounds: { x: 0, y: 0, width: 0, height: 0 },
-                    metadata: {
-                        algorithm: 'spectral',
-                        executionTime: performance.now() - startTime,
-                        nodeCount: 0,
-                        linkCount: 0,
-                    },
-                };
-            }
-            // Build node index map
-            const nodeIndexMap = new Map(nodes.map((node, i) => [node.id, i]));
-            // Build adjacency matrix
-            const adjacency = new Matrix(n, n, 0);
-            const validLinks = links.filter(link => link.sourceNodeId && link.targetNodeId);
-            for (const link of validLinks) {
-                const i = nodeIndexMap.get(link.sourceNodeId);
-                const j = nodeIndexMap.get(link.targetNodeId);
-                if (i !== undefined && j !== undefined) {
-                    adjacency.set(i, j, 1);
-                    adjacency.set(j, i, 1); // Undirected
-                }
-            }
-            // Build degree matrix
-            const degree = new Matrix(n, n, 0);
-            for (let i = 0; i < n; i++) {
-                let deg = 0;
-                for (let j = 0; j < n; j++) {
-                    deg += adjacency.get(i, j);
-                }
-                degree.set(i, i, deg);
-            }
-            // Build Laplacian matrix: L = D - A
-            const laplacian = degree.subtract(adjacency);
-            // For normalized Laplacian: L_norm = D^(-1/2) * L * D^(-1/2)
-            let L = laplacian;
-            if (opts.normalized) {
-                const D_inv_sqrt = new Matrix(n, n, 0);
-                for (let i = 0; i < n; i++) {
-                    const deg = degree.get(i, i);
-                    D_inv_sqrt.set(i, i, deg > 0 ? 1 / Math.sqrt(deg) : 0);
-                }
-                // L_norm = D^(-1/2) * L * D^(-1/2)
-                const temp = new Matrix(n, n, 0);
-                for (let i = 0; i < n; i++) {
-                    for (let j = 0; j < n; j++) {
-                        let sum = 0;
-                        for (let k = 0; k < n; k++) {
-                            sum += D_inv_sqrt.get(i, k) * laplacian.get(k, j);
-                        }
-                        temp.set(i, j, sum);
-                    }
-                }
-                L = new Matrix(n, n, 0);
-                for (let i = 0; i < n; i++) {
-                    for (let j = 0; j < n; j++) {
-                        let sum = 0;
-                        for (let k = 0; k < n; k++) {
-                            sum += temp.get(i, k) * D_inv_sqrt.get(k, j);
-                        }
-                        L.set(i, j, sum);
-                    }
-                }
-            }
-            // Compute smallest non-zero eigenvectors using power iteration
-            // For spectral layout, we want eigenvectors 2 and 3 (after trivial eigenvector)
-            const eigenvectors = [];
-            for (let dim = 0; dim < Math.min(opts.dimensions, n - 1); dim++) {
-                const eigenvector = this.computeEigenvector(L, eigenvectors, opts.maxIterations, opts.convergenceThreshold);
-                eigenvectors.push(eigenvector);
-            }
-            // If we have fewer eigenvectors than dimensions, pad with random
-            while (eigenvectors.length < opts.dimensions) {
-                eigenvectors.push(Array(n)
-                    .fill(0)
-                    .map(() => this.rng.next() - 0.5) // Card 0: seeded, was Math.random()
-                );
-            }
-            // Build positions from eigenvectors
-            const nodePositions = new Map();
-            for (let i = 0; i < n; i++) {
-                const node = nodes[i];
-                const x = eigenvectors[0][i] * opts.scale;
-                const y = eigenvectors[1][i] * opts.scale;
-                nodePositions.set(node.id, { x, y });
-            }
-            // Center the layout
-            if (opts.center) {
-                let cx = 0, cy = 0;
-                nodePositions.forEach(pos => {
-                    cx += pos.x;
-                    cy += pos.y;
-                });
-                cx /= nodePositions.size;
-                cy /= nodePositions.size;
-                nodePositions.forEach((pos, id) => {
-                    nodePositions.set(id, {
-                        x: pos.x - cx,
-                        y: pos.y - cy,
-                    });
-                });
-            }
-            // Apply positions to nodes
-            nodes.forEach(node => {
-                const position = nodePositions.get(node.id);
-                if (position) {
-                    node.setPosition(position.x, position.y);
-                }
-            });
-            // Calculate bounds
-            const bounds = this.calculateBounds(nodePositions);
-            const endTime = performance.now();
-            // Calculate quality metrics if requested
-            let quality = undefined;
-            if (options.calculateQuality) {
-                quality = layout_quality_metrics_1.LayoutQualityMetrics.assess(nodes, links, {
-                    includeSuggestions: true,
-                    canvasDimensions: options.canvasDimensions,
-                });
-            }
-            return {
-                nodePositions,
-                bounds,
-                metadata: {
-                    algorithm: 'spectral',
-                    normalized: opts.normalized,
-                    dimensions: opts.dimensions,
-                    executionTime: endTime - startTime,
-                    nodeCount: nodes.length,
-                    linkCount: links.length,
-                },
-                quality,
-            };
-        });
-    }
-    /**
-     * Compute eigenvector using power iteration
-     */
-    computeEigenvector(matrix, previousEigenvectors, maxIterations, threshold) {
-        const n = matrix.rows;
-        // Initialize with random vector
-        let v = Array(n)
-            .fill(0)
-            .map(() => this.rng.next() - 0.5); // Card 0: seeded, was Math.random()
-        v = VectorOps.normalize(v);
-        // Orthogonalize against previous eigenvectors
-        for (const prev of previousEigenvectors) {
-            const dot = VectorOps.dot(v, prev);
-            v = VectorOps.subtract(v, VectorOps.multiply(prev, dot));
-        }
-        v = VectorOps.normalize(v);
-        let converged = false;
-        let iteration = 0;
-        while (!converged && iteration < maxIterations) {
-            // v_new = L * v
-            const v_new_raw = matrix.multiplyVector(v);
-            // Orthogonalize
-            let v_new = v_new_raw;
-            for (const prev of previousEigenvectors) {
-                const dot = VectorOps.dot(v_new, prev);
-                v_new = VectorOps.subtract(v_new, VectorOps.multiply(prev, dot));
-            }
-            // Normalize
-            v_new = VectorOps.normalize(v_new);
-            // Check convergence
-            const diff = VectorOps.subtract(v_new, v);
-            const change = VectorOps.norm(diff);
-            if (change < threshold) {
-                converged = true;
-            }
-            v = v_new;
-            iteration++;
-        }
-        return v;
-    }
-    /**
-     * Calculate bounding box
-     */
-    calculateBounds(positions) {
-        if (positions.size === 0) {
-            return { x: 0, y: 0, width: 0, height: 0 };
-        }
-        let minX = Infinity, minY = Infinity;
-        let maxX = -Infinity, maxY = -Infinity;
-        positions.forEach(pos => {
-            minX = Math.min(minX, pos.x);
-            minY = Math.min(minY, pos.y);
-            maxX = Math.max(maxX, pos.x);
-            maxY = Math.max(maxY, pos.y);
-        });
-        // Add padding
-        const padding = 50;
-        minX -= padding;
-        minY -= padding;
-        maxX += padding;
-        maxY += padding;
-        return {
-            x: minX,
-            y: minY,
-            width: maxX - minX,
-            height: maxY - minY,
-        };
-    }
-    /**
-     * Apply incremental layout (Phase 1 compatibility)
-     */
-    applyIncremental(nodes, links, incrementalOptions, layoutOptions) {
-        return tslib_1.__awaiter(this, void 0, void 0, function* () {
-            // Spectral layout doesn't support true incremental layout
-            // Just apply full layout
-            const result = yield this.apply(nodes, links, layoutOptions);
-            return Object.assign(Object.assign({}, result), { incremental: {
-                    newNodeIds: incrementalOptions.newNodeIds || [],
-                    pinnedNodeIds: [],
-                    movedNodeIds: nodes.map(n => n.id),
-                    strategy: 'full-relayout',
-                    constraintsApplied: 0,
-                } });
-        });
-    }
-    /**
-     * Validate options
-     */
-    validateOptions(options) {
-        if (options.dimensions !== undefined && options.dimensions < 1) {
-            return false;
-        }
-        if (options.scale !== undefined && options.scale <= 0) {
-            return false;
-        }
-        if (options.maxIterations !== undefined && options.maxIterations < 1) {
-            return false;
-        }
-        return true;
-    }
-}
-exports.SpectralLayoutAdapter = SpectralLayoutAdapter;
-//# sourceMappingURL=spectral-layout-adapter.js.map

package/src/libs/engine/src/layout/spectral-layout-adapter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"spectral-layout-adapter.js","sourceRoot":"","sources":["../../../../../../engine/src/layout/spectral-layout-adapter.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;;;AAGH,+BAAwD;AAGxD,qEAAgE;AAyBhE;;GAEG;AACH,MAAM,MAAM;IAKV,YAAY,IAAY,EAAE,IAAY,EAAE,IAAI,GAAG,CAAC;QAC9C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;aACpB,IAAI,CAAC,CAAC,CAAC;aACP,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,GAAG,CAAC,CAAS,EAAE,CAAS;QACtB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAAa;QACrC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED,GAAG,CAAC,KAAa;QACf,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,QAAQ,CAAC,KAAa;QACpB,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,QAAQ,CAAC,MAAc;QACrB,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,cAAc,CAAC,CAAW;QACxB,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS;QACP,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,SAAS;IACb,MAAM,CAAC,GAAG,CAAC,CAAW,EAAE,CAAW;QACjC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAW;QACrB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,CAAC,SAAS,CAAC,CAAW;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,CAAW,EAAE,CAAW;QACtC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,CAAW,EAAE,CAAW;QACjC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,CAAW,EAAE,MAAc;QACzC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,CAAC;CACF;AAED;;;;GAIG;AACH,MAAa,qBAAqB;IAAlC;QACW,SAAI,GAAG,UAAU,CAAC;QAE3B;;;;WAIG;QACK,QAAG,GAAc,IAAA,qBAAe,GAAE,CAAC;IAyU7C,CAAC;IAvUC;;OAEG;IACG,KAAK;qEACT,KAAkB,EAClB,KAAkB,EAClB,UAA0C,EAAE;;YAE5C,IAAI,CAAC,GAAG,GAAG,IAAA,qBAAe,EAAE,OAAyC,aAAzC,OAAO,uBAAP,OAAO,CAAoC,IAAI,CAAC,CAAC;YAC7E,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAEpC,sBAAsB;YACtB,MAAM,IAAI,mBACR,UAAU,EAAE,MAAA,OAAO,CAAC,UAAU,mCAAI,IAAI,EACtC,UAAU,EAAE,MAAA,OAAO,CAAC,UAAU,mCAAI,CAAC,EACnC,KAAK,EAAE,MAAA,OAAO,CAAC,KAAK,mCAAI,GAAG,EAC3B,MAAM,EAAE,MAAA,OAAO,CAAC,MAAM,mCAAI,IAAI,EAC9B,oBAAoB,EAAE,MAAA,OAAO,CAAC,oBAAoB,mCAAI,IAAI,EAC1D,aAAa,EAAE,MAAA,OAAO,CAAC,aAAa,mCAAI,IAAI,IACzC,OAAO,CACX,CAAC;YAEF,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YAEvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,OAAO;oBACL,aAAa,EAAE,IAAI,GAAG,EAAE;oBACxB,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;oBAC3C,QAAQ,EAAE;wBACR,SAAS,EAAE,UAAU;wBACrB,aAAa,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS;wBAC5C,SAAS,EAAE,CAAC;wBACZ,SAAS,EAAE,CAAC;qBACb;iBACF,CAAC;YACJ,CAAC;YAED,uBAAuB;YACvB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAEnE,yBAAyB;YACzB,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAC7B,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAC/C,CAAC;YAEF,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;gBAC/C,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;gBAE/C,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;oBACvC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvB,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa;gBACvC,CAAC;YACH,CAAC;YAED,sBAAsB;YACtB,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7B,CAAC;gBACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YACxB,CAAC;YAED,oCAAoC;YACpC,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAE7C,6DAA6D;YAC7D,IAAI,CAAC,GAAG,SAAS,CAAC;YAClB,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACpB,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7B,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzD,CAAC;gBAED,mCAAmC;gBACnC,MAAM,IAAI,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;wBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC3B,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBACpD,CAAC;wBACD,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;oBACtB,CAAC;gBACH,CAAC;gBAED,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;wBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC3B,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC/C,CAAC;wBACD,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;oBACnB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,+DAA+D;YAC/D,gFAAgF;YAChF,MAAM,YAAY,GAAe,EAAE,CAAC;YAEpC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAW,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;gBACjE,MAAM,WAAW,GAAG,IAAI,CAAC,kBAAkB,CACzC,CAAC,EACD,YAAY,EACZ,IAAI,CAAC,aAAc,EACnB,IAAI,CAAC,oBAAqB,CAC3B,CAAC;gBACF,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,CAAC;YAED,iEAAiE;YACjE,OAAO,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,UAAW,EAAE,CAAC;gBAC9C,YAAY,CAAC,IAAI,CACf,KAAK,CAAC,CAAC,CAAC;qBACL,IAAI,CAAC,CAAC,CAAC;qBACP,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,oCAAoC;iBACzE,CAAC;YACJ,CAAC;YAED,oCAAoC;YACpC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoC,CAAC;YAElE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAM,CAAC;gBAC3C,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAM,CAAC;gBAE3C,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACvC,CAAC;YAED,oBAAoB;YACpB,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;gBACnB,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;oBAC1B,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;oBACZ,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;gBACd,CAAC,CAAC,CAAC;gBACH,EAAE,IAAI,aAAa,CAAC,IAAI,CAAC;gBACzB,EAAE,IAAI,aAAa,CAAC,IAAI,CAAC;gBAEzB,aAAa,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE;oBAChC,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE;wBACpB,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE;wBACb,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE;qBACd,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;YACL,CAAC;YAED,2BAA2B;YAC3B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACnB,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC5C,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,mBAAmB;YACnB,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;YAEnD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAElC,yCAAyC;YACzC,IAAI,OAAO,GAAG,SAAS,CAAC;YACxB,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;gBAC7B,OAAO,GAAG,6CAAoB,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE;oBAClD,kBAAkB,EAAE,IAAI;oBACxB,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;iBAC3C,CAAC,CAAC;YACL,CAAC;YAED,OAAO;gBACL,aAAa;gBACb,MAAM;gBACN,QAAQ,EAAE;oBACR,SAAS,EAAE,UAAU;oBACrB,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,aAAa,EAAE,OAAO,GAAG,SAAS;oBAClC,SAAS,EAAE,KAAK,CAAC,MAAM;oBACvB,SAAS,EAAE,KAAK,CAAC,MAAM;iBACxB;gBACD,OAAO;aACR,CAAC;QACJ,CAAC;KAAA;IAED;;OAEG;IACK,kBAAkB,CACxB,MAAc,EACd,oBAAgC,EAChC,aAAqB,EACrB,SAAiB;QAEjB,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC;QAEtB,gCAAgC;QAChC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;aACb,IAAI,CAAC,CAAC,CAAC;aACP,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,oCAAoC;QACzE,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAE3B,8CAA8C;QAC9C,KAAK,MAAM,IAAI,IAAI,oBAAoB,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACnC,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3D,CAAC;QACD,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAE3B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,OAAO,CAAC,SAAS,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;YAC/C,gBAAgB;YAChB,MAAM,SAAS,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YAE3C,gBAAgB;YAChB,IAAI,KAAK,GAAG,SAAS,CAAC;YACtB,KAAK,MAAM,IAAI,IAAI,oBAAoB,EAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBACvC,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;YACnE,CAAC;YAED,YAAY;YACZ,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAEnC,oBAAoB;YACpB,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEpC,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;gBACvB,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC;YAED,CAAC,GAAG,KAAK,CAAC;YACV,SAAS,EAAE,CAAC;QACd,CAAC;QAED,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,SAAgD;QAOhD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAC7C,CAAC;QAED,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,CAAC;QACrC,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC;QAEvC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YACtB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,cAAc;QACd,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,IAAI,IAAI,OAAO,CAAC;QAChB,IAAI,IAAI,OAAO,CAAC;QAChB,IAAI,IAAI,OAAO,CAAC;QAChB,IAAI,IAAI,OAAO,CAAC;QAEhB,OAAO;YACL,CAAC,EAAE,IAAI;YACP,CAAC,EAAE,IAAI;YACP,KAAK,EAAE,IAAI,GAAG,IAAI;YAClB,MAAM,EAAE,IAAI,GAAG,IAAI;SACpB,CAAC;IACJ,CAAC;IAED;;OAEG;IACG,gBAAgB,CACpB,KAAkB,EAClB,KAAkB,EAClB,kBAAuB,EACvB,aAA8C;;YAE9C,0DAA0D;YAC1D,yBAAyB;YACzB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;YAE7D,uCACK,MAAM,KACT,WAAW,EAAE;oBACX,UAAU,EAAE,kBAAkB,CAAC,UAAU,IAAI,EAAE;oBAC/C,aAAa,EAAE,EAAE;oBACjB,YAAY,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClC,QAAQ,EAAE,eAAe;oBACzB,kBAAkB,EAAE,CAAC;iBACtB,IACD;QACJ,CAAC;KAAA;IAED;;OAEG;IACH,eAAe,CAAC,OAAuC;QACrD,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC/D,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;YACtD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS,IAAI,OAAO,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC;YACrE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAjVD,sDAiVC"}

package/src/libs/engine/src/layout/steppable-layout.d.ts

@@ -1,40 +0,0 @@
-import { NodeModel } from '../models/NodeModel';
-import { LinkModel } from '../models/LinkModel';
-import { LayoutAdapter, LayoutOptions, LayoutResult } from './layout-adapter.interface';
-/**
- * An in-flight, pre-emptible layout computation.
- *
- * Pure and synchronous by construction: no DOM, no clock, no `Math.random()`.
- * That is what lets the identical object run on the main thread and inside a
- * Worker and produce byte-identical coordinates — the property Card 0 bought
- * and this card must not spend.
- */
-export interface LayoutRun {
-    /** Iterations completed so far. */
-    readonly iteration: number;
-    /** Iterations this run would do if left alone — the denominator for progress. */
-    readonly totalIterations: number;
-    /**
-     * Advance exactly one iteration.
-     *
-     * @returns true if there is more work to do, false once converged or done.
-     */
-    step(): boolean;
-    /**
-     * The best answer so far. Must be safe to call at ANY point — before the
-     * first step (returns the input positions), midway (returns the partial
-     * simulation), or after the last (returns the final layout).
-     */
-    snapshot(): LayoutResult;
-}
-/**
- * A layout adapter that can be driven a step at a time.
- *
- * Optional: `isSteppable()` is a type guard, and the host degrades gracefully
- * for adapters that are not.
- */
-export interface SteppableLayoutAdapter extends LayoutAdapter {
-    createRun(nodes: NodeModel[], links: LinkModel[], options?: Partial<LayoutOptions>): LayoutRun;
-}
-/** Can this adapter be pre-empted mid-run? */
-export declare function isSteppable(adapter: LayoutAdapter): adapter is SteppableLayoutAdapter;

package/src/libs/engine/src/layout/steppable-layout.js

@@ -1,34 +0,0 @@
-"use strict";
-// Wave 7 (Auto-layout) — Card 3: what it takes for a layout to be *interruptible*.
-//
-// "Cancellable" is the word people use for an algorithm that checks a flag once,
-// at the end, and then throws its work away. That is not cancellation, it is a
-// late apology. A force layout that has done 200 of its 300 iterations has a
-// perfectly usable picture; the difference between a tool that feels alive and
-// one that feels broken is whether you hand that picture back.
-//
-// So an interruptible layout is not one that can be *stopped*. It is one that
-// can be stopped AND ASKED WHAT IT HAS. Two obligations, and the second is the
-// one that gets forgotten:
-//
-//   step()      — advance a bounded, cheap slice of work; return false when done.
-//   snapshot()  — the best answer SO FAR, valid after *any* number of steps,
-//                 including zero.
-//
-// The host (layout-host.ts) drives step() and consults the cancel flag and the
-// time budget between steps, so pre-emption latency is one iteration, not one
-// layout. When it stops early it calls snapshot() and flags the result partial.
-//
-// An adapter that cannot offer this — dagre and ELK are single-shot calls into
-// third-party code, and there is no honest way to interrupt them mid-call —
-// simply does not implement it. The host detects that and runs them as one
-// opaque step. They still go off the main thread (which is the actual win: a
-// 500ms dagre pass no longer freezes input); they just cannot be pre-empted
-// half-way. Pretending otherwise would be the lie this file exists to avoid.
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.isSteppable = isSteppable;
-/** Can this adapter be pre-empted mid-run? */
-function isSteppable(adapter) {
-    return typeof adapter.createRun === 'function';
-}
-//# sourceMappingURL=steppable-layout.js.map

package/src/libs/engine/src/layout/steppable-layout.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"steppable-layout.js","sourceRoot":"","sources":["../../../../../../engine/src/layout/steppable-layout.ts"],"names":[],"mappings":";AAAA,mFAAmF;AACnF,EAAE;AACF,iFAAiF;AACjF,+EAA+E;AAC/E,6EAA6E;AAC7E,+EAA+E;AAC/E,+DAA+D;AAC/D,EAAE;AACF,8EAA8E;AAC9E,+EAA+E;AAC/E,2BAA2B;AAC3B,EAAE;AACF,kFAAkF;AAClF,6EAA6E;AAC7E,kCAAkC;AAClC,EAAE;AACF,+EAA+E;AAC/E,8EAA8E;AAC9E,gFAAgF;AAChF,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,2EAA2E;AAC3E,6EAA6E;AAC7E,4EAA4E;AAC5E,6EAA6E;;AAmD7E,kCAIC;AALD,8CAA8C;AAC9C,SAAgB,WAAW,CACzB,OAAsB;IAEtB,OAAO,OAAQ,OAAkC,CAAC,SAAS,KAAK,UAAU,CAAC;AAC7E,CAAC"}