@grafloria/element 0.3.17 → 0.3.19

package/src/libs/engine/src/routing/global/GlobalRouteSolver.js

@@ -0,0 +1,334 @@
+"use strict";
+// Wave 5 (Edge routing) — Card 7: a global penalty-based solver.
+//
+// Everything before this card routes edges ONE AT A TIME: each edge sees nodes
+// as obstacles but not the other edges, so shared corridors, crossings and
+// congestion are patched afterwards (fan-out, nudging, jumps). A
+// libavoid/Adaptagrams-class solver inverts that: ALL edges route against one
+// shared penalty model, so an edge pays for crossing another edge or crowding a
+// corridor at ROUTING time and picks a different channel by itself.
+//
+// The model, deliberately small:
+//   - per-edge geometry: ManhattanRouter (jetty, U-turn ban, turn cost) with
+//     its obstacle set = the diagram's obstacles;
+//   - plus a shared PENALTY FIELD sampled per grid cell: occupancy laid down by
+//     every OTHER edge's current route (congestion), with crossings priced via
+//     perpendicular-occupancy (a horizontal step through a cell some other
+//     edge crossed vertically is what a crossing IS on a grid);
+//   - passes: edges route in deterministic order, each pass re-routing against
+//     the field the previous pass produced; the field converges quickly (2
+//     passes default) because the penalties are additive and static within a
+//     pass.
+//
+// INCREMENTAL: the solver keeps each edge's last route and the field; a change
+// re-routes only the changed edges plus the edges whose routes touch the cells
+// the change dirtied — the same dirty-set discipline the edge optimizer uses.
+//
+// The solver is PURE and synchronous — no DOM, no Date.now, no randomness —
+// which is what lets the worker host (see solver-host.ts) run the identical
+// code on either side of a postMessage boundary and lets tests prove
+// determinism by simple re-runs.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GlobalRouteSolver = void 0;
+const ManhattanRouter_1 = require("../algorithms/ManhattanRouter");
+const DEFAULTS = {
+    gridSize: 20,
+    obstacleMargin: 10,
+    congestionPenalty: 30,
+    crossingPenalty: 60,
+    passes: 2,
+    maxIterations: 20000,
+    bendCost: 10,
+};
+/** cell key for a world point on the solver grid */
+function cellKey(x, y, step) {
+    return `${Math.round(x / step)},${Math.round(y / step)}`;
+}
+class GlobalRouteSolver {
+    constructor(options = {}) {
+        this.router = new ManhattanRouter_1.ManhattanRouter();
+        // last solution + the field it produced
+        this.routes = new Map();
+        this.edges = new Map();
+        this.obstacles = [];
+        /** cell → per-axis occupancy laid down by each edge: id → 'h' | 'v' */
+        this.field = new Map();
+        this._stats = { edgesRouted: 0, edgesReused: 0 };
+        this.options = Object.assign(Object.assign({}, DEFAULTS), options);
+    }
+    get stats() {
+        return this._stats;
+    }
+    /** Full solve. Deterministic: edges route in id order, every pass. */
+    solve(edges, obstacles) {
+        this.edges = new Map(edges.map((e) => [e.id, e]));
+        this.obstacles = obstacles;
+        this.routes.clear();
+        this.field.clear();
+        this._stats = { edgesRouted: 0, edgesReused: 0 };
+        const order = [...edges].sort((a, b) => (a.id < b.id ? -1 : 1));
+        for (let pass = 0; pass < this.options.passes; pass++) {
+            for (const edge of order) {
+                this.routeEdge(edge);
+            }
+        }
+        return new Map(this.routes);
+    }
+    /**
+     * Re-solve after a change: `changed` edges re-route (removed ones pass with
+     * `removed: true`), and so does every edge whose current route touches a cell
+     * a changed edge occupied before or after. Everything else is served as-is.
+     */
+    solveIncremental(changed, obstacles) {
+        var _a, _b;
+        if (obstacles)
+            this.obstacles = obstacles;
+        this._stats = { edgesRouted: 0, edgesReused: 0 };
+        // cells dirtied by the change: old routes of changed edges
+        const dirtyCells = new Set();
+        for (const { edge } of changed) {
+            for (const [cell, byEdge] of this.field) {
+                if (byEdge.has(edge.id))
+                    dirtyCells.add(cell);
+            }
+        }
+        for (const { edge, removed } of changed) {
+            this.clearFromField(edge.id);
+            if (removed) {
+                this.routes.delete(edge.id);
+                this.edges.delete(edge.id);
+            }
+            else {
+                this.edges.set(edge.id, edge);
+            }
+        }
+        // route the changed (surviving) edges — collecting the cells they now hold
+        const toRoute = changed.filter((c) => !c.removed).map((c) => c.edge);
+        for (const edge of [...toRoute].sort((a, b) => (a.id < b.id ? -1 : 1))) {
+            this.routeEdge(edge);
+            for (const [cell, byEdge] of this.field) {
+                if (byEdge.has(edge.id))
+                    dirtyCells.add(cell);
+            }
+        }
+        // neighbourhood: edges whose route passes through any dirty cell
+        const neighbours = new Set();
+        for (const cell of dirtyCells) {
+            for (const id of (_b = (_a = this.field.get(cell)) === null || _a === void 0 ? void 0 : _a.keys()) !== null && _b !== void 0 ? _b : []) {
+                if (!changed.some((c) => c.edge.id === id))
+                    neighbours.add(id);
+            }
+        }
+        for (const id of [...neighbours].sort()) {
+            const edge = this.edges.get(id);
+            if (edge)
+                this.routeEdge(edge);
+        }
+        this._stats.edgesReused = this.edges.size - this._stats.edgesRouted;
+        return new Map(this.routes);
+    }
+    // -------------------------------------------------------------------------
+    routeEdge(edge) {
+        this.clearFromField(edge.id);
+        const step = this.options.gridSize;
+        // The penalty field enters through the ManhattanRouter's container hook? No —
+        // it needs per-cell costs, so the router is given a costFn via obstacles?
+        // Neither fits; the field is applied by wrapping the router's own search
+        // through a penalized obstacle expansion: we inflate the request with
+        // PSEUDO-obstacle costs by re-running Manhattan on a costed grid. To keep
+        // ManhattanRouter untouched (it is a shipped card), the solver runs its own
+        // copy of the same search with the extra per-cell term. See penalisedRoute.
+        const routed = this.penalisedRoute(edge, step);
+        if (!routed)
+            return;
+        this.routes.set(edge.id, routed.points);
+        this._stats.edgesRouted++;
+        // lay the route into the field
+        const pts = routed.points;
+        for (let i = 0; i < pts.length - 1; i++) {
+            const a = pts[i];
+            const b = pts[i + 1];
+            const horizontal = a.y === b.y;
+            const n = Math.max(Math.abs(b.x - a.x), Math.abs(b.y - a.y)) / step;
+            for (let k = 0; k <= n; k++) {
+                const x = a.x + (b.x - a.x) * (n === 0 ? 0 : k / n);
+                const y = a.y + (b.y - a.y) * (n === 0 ? 0 : k / n);
+                const cell = cellKey(x, y, step);
+                let byEdge = this.field.get(cell);
+                if (!byEdge) {
+                    byEdge = new Map();
+                    this.field.set(cell, byEdge);
+                }
+                byEdge.set(edge.id, horizontal ? 'h' : 'v');
+            }
+        }
+    }
+    /**
+     * Manhattan-style search with the shared penalty field added per step:
+     * congestion (any other edge in the cell) and crossing (another edge through
+     * the cell PERPENDICULAR to this step). Same moves, same U-turn ban, same
+     * jetty handling as ManhattanRouter — the field term is the only addition.
+     */
+    penalisedRoute(edge, step) {
+        var _a, _b, _c;
+        const { congestionPenalty, crossingPenalty } = this.options;
+        const self = this;
+        // Delegate the mechanical parts to ManhattanRouter by pre-charging the
+        // field into a transient obstacle-cost surface is not expressible via its
+        // public options — so the solver reuses the router for the BASE route and
+        // falls back to it when the field is empty (fast path), and otherwise runs
+        // the costed variant below.
+        const fieldEmpty = this.field.size === 0;
+        const base = () => {
+            var _a;
+            return this.router.route({
+                start: edge.start,
+                end: edge.end,
+                sourceDirection: edge.sourceDirection,
+                targetDirection: edge.targetDirection,
+                obstacles: this.obstacles,
+                options: {
+                    gridSize: step,
+                    obstacleMargin: this.options.obstacleMargin,
+                    maxIterations: this.options.maxIterations,
+                    costs: { bends: this.options.bendCost },
+                    jetty: (_a = edge.jetty) !== null && _a !== void 0 ? _a : step,
+                },
+            });
+        };
+        if (fieldEmpty)
+            return base();
+        // ---- costed grid search (the router's algorithm + the field term) -------
+        const jetty = (_a = edge.jetty) !== null && _a !== void 0 ? _a : step;
+        const DIR = {
+            left: { x: -1, y: 0 },
+            right: { x: 1, y: 0 },
+            top: { x: 0, y: -1 },
+            bottom: { x: 0, y: 1 },
+        };
+        const srcSide = (_b = edge.sourceDirection) !== null && _b !== void 0 ? _b : (Math.abs(edge.end.x - edge.start.x) >= Math.abs(edge.end.y - edge.start.y)
+            ? edge.end.x >= edge.start.x ? 'right' : 'left'
+            : edge.end.y >= edge.start.y ? 'bottom' : 'top');
+        const tgtSide = (_c = edge.targetDirection) !== null && _c !== void 0 ? _c : (Math.abs(edge.start.x - edge.end.x) >= Math.abs(edge.start.y - edge.end.y)
+            ? edge.start.x >= edge.end.x ? 'right' : 'left'
+            : edge.start.y >= edge.end.y ? 'bottom' : 'top');
+        const sv = DIR[srcSide];
+        const tv = DIR[tgtSide];
+        const sStub = { x: edge.start.x + sv.x * jetty, y: edge.start.y + sv.y * jetty };
+        const tStub = { x: edge.end.x + tv.x * jetty, y: edge.end.y + tv.y * jetty };
+        const margin = this.options.obstacleMargin;
+        const inflated = this.obstacles.map((o) => {
+            var _a, _b, _c, _d;
+            return ({
+                x: o.x - margin - ((_a = o.margin) !== null && _a !== void 0 ? _a : 0),
+                y: o.y - margin - ((_b = o.margin) !== null && _b !== void 0 ? _b : 0),
+                width: o.width + 2 * (margin + ((_c = o.margin) !== null && _c !== void 0 ? _c : 0)),
+                height: o.height + 2 * (margin + ((_d = o.margin) !== null && _d !== void 0 ? _d : 0)),
+            });
+        });
+        const blocked = (x, y) => inflated.some((o) => x >= o.x && x <= o.x + o.width && y >= o.y && y <= o.y + o.height);
+        const MOVES = [
+            { dx: 1, dy: 0, h: true },
+            { dx: 0, dy: 1, h: false },
+            { dx: -1, dy: 0, h: true },
+            { dx: 0, dy: -1, h: false },
+        ];
+        const sx = Math.round(sStub.x / step), sy = Math.round(sStub.y / step);
+        const tx = Math.round(tStub.x / step), ty = Math.round(tStub.y / step);
+        const startMove = MOVES.findIndex((m) => (srcSide === 'right' && m.dx === 1) || (srcSide === 'left' && m.dx === -1) ||
+            (srcSide === 'bottom' && m.dy === 1) || (srcSide === 'top' && m.dy === -1));
+        const h = (x, y) => (Math.abs(x - tx) + Math.abs(y - ty)) * step;
+        const open = [{ x: sx, y: sy, move: startMove, g: 0, f: h(sx, sy), parent: null }];
+        const best = new Map([[`${sx},${sy},${startMove}`, 0]]);
+        let expansions = 0;
+        const fieldCost = (x, y, moveHorizontal) => {
+            const byEdge = self.field.get(`${x},${y}`);
+            if (!byEdge)
+                return 0;
+            let cost = 0;
+            for (const [id, axis] of byEdge) {
+                if (id === edge.id)
+                    continue;
+                cost += congestionPenalty;
+                // perpendicular occupancy = a crossing on a grid
+                if ((axis === 'h') !== moveHorizontal)
+                    cost += crossingPenalty;
+            }
+            return cost;
+        };
+        while (open.length > 0) {
+            if (++expansions > this.options.maxIterations)
+                return base(); // budget: fall back, never spin
+            let bi = 0;
+            for (let i = 1; i < open.length; i++)
+                if (open[i].f < open[bi].f)
+                    bi = i;
+            const node = open.splice(bi, 1)[0];
+            if (node.x === tx && node.y === ty) {
+                const cells = [];
+                let cur = node;
+                while (cur) {
+                    cells.push({ x: cur.x * step, y: cur.y * step });
+                    cur = cur.parent;
+                }
+                cells.reverse();
+                const join = (a, b, horizFirst) => a.x === b.x || a.y === b.y ? [] : [horizFirst ? { x: b.x, y: a.y } : { x: a.x, y: b.y }];
+                const raw = [
+                    Object.assign({}, edge.start),
+                    sStub,
+                    ...join(sStub, cells[0], sv.x !== 0),
+                    ...cells,
+                    ...join(cells[cells.length - 1], tStub, true),
+                    tStub,
+                    Object.assign({}, edge.end),
+                ];
+                // dedupe + collinear merge
+                const pts = [];
+                for (const p of raw) {
+                    const last = pts[pts.length - 1];
+                    if (last && last.x === p.x && last.y === p.y)
+                        continue;
+                    while (pts.length >= 2) {
+                        const a2 = pts[pts.length - 2], b2 = pts[pts.length - 1];
+                        if ((a2.x === b2.x && b2.x === p.x) || (a2.y === b2.y && b2.y === p.y))
+                            pts.pop();
+                        else
+                            break;
+                    }
+                    pts.push(Object.assign({}, p));
+                }
+                let len = 0;
+                for (let i = 1; i < pts.length; i++)
+                    len += Math.abs(pts[i].x - pts[i - 1].x) + Math.abs(pts[i].y - pts[i - 1].y);
+                return { points: pts, totalLength: len, bendCount: Math.max(0, pts.length - 2) };
+            }
+            for (let mi = 0; mi < MOVES.length; mi++) {
+                if (node.move >= 0 && mi === (node.move + 2) % 4)
+                    continue; // no U-turns
+                const m = MOVES[mi];
+                const nx = node.x + m.dx, ny = node.y + m.dy;
+                const wx = nx * step, wy = ny * step;
+                if (!(nx === tx && ny === ty) && blocked(wx, wy))
+                    continue;
+                const turn = node.move >= 0 && mi !== node.move ? this.options.bendCost : 0;
+                const g = node.g + step + turn + fieldCost(nx, ny, m.h);
+                const key = `${nx},${ny},${mi}`;
+                const known = best.get(key);
+                if (known !== undefined && known <= g)
+                    continue;
+                best.set(key, g);
+                open.push({ x: nx, y: ny, move: mi, g, f: g + h(nx, ny), parent: node });
+            }
+        }
+        return base();
+    }
+    clearFromField(edgeId) {
+        for (const [cell, byEdge] of this.field) {
+            byEdge.delete(edgeId);
+            if (byEdge.size === 0)
+                this.field.delete(cell);
+        }
+    }
+}
+exports.GlobalRouteSolver = GlobalRouteSolver;
+//# sourceMappingURL=GlobalRouteSolver.js.map

package/src/libs/engine/src/routing/global/GlobalRouteSolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GlobalRouteSolver.js","sourceRoot":"","sources":["../../../../../../../engine/src/routing/global/GlobalRouteSolver.ts"],"names":[],"mappings":";AAAA,iEAAiE;AACjE,EAAE;AACF,+EAA+E;AAC/E,2EAA2E;AAC3E,iEAAiE;AACjE,8EAA8E;AAC9E,gFAAgF;AAChF,oEAAoE;AACpE,EAAE;AACF,iCAAiC;AACjC,6EAA6E;AAC7E,kDAAkD;AAClD,gFAAgF;AAChF,+EAA+E;AAC/E,2EAA2E;AAC3E,gEAAgE;AAChE,+EAA+E;AAC/E,2EAA2E;AAC3E,6EAA6E;AAC7E,YAAY;AACZ,EAAE;AACF,+EAA+E;AAC/E,+EAA+E;AAC/E,8EAA8E;AAC9E,EAAE;AACF,4EAA4E;AAC5E,4EAA4E;AAC5E,qEAAqE;AACrE,iCAAiC;;;AAEjC,mEAAgE;AAqChE,MAAM,QAAQ,GAA4B;IACxC,QAAQ,EAAE,EAAE;IACZ,cAAc,EAAE,EAAE;IAClB,iBAAiB,EAAE,EAAE;IACrB,eAAe,EAAE,EAAE;IACnB,MAAM,EAAE,CAAC;IACT,aAAa,EAAE,KAAK;IACpB,QAAQ,EAAE,EAAE;CACb,CAAC;AAEF,oDAAoD;AACpD,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,IAAY;IACjD,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AAC3D,CAAC;AAED,MAAa,iBAAiB;IAa5B,YAAY,UAAyB,EAAE;QAXtB,WAAM,GAAG,IAAI,iCAAe,EAAE,CAAC;QAEhD,wCAAwC;QAChC,WAAM,GAAG,IAAI,GAAG,EAAmB,CAAC;QACpC,UAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;QACtC,cAAS,GAAe,EAAE,CAAC;QACnC,uEAAuE;QAC/D,UAAK,GAAG,IAAI,GAAG,EAAkC,CAAC;QAElD,WAAM,GAAgB,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QAG/D,IAAI,CAAC,OAAO,mCAAQ,QAAQ,GAAK,OAAO,CAAE,CAAC;IAC7C,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,sEAAsE;IACtE,KAAK,CAAC,KAAmB,EAAE,SAAqB;QAC9C,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QAEjD,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CACd,OAAuD,EACvD,SAAsB;;QAEtB,IAAI,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QAEjD,2DAA2D;QAC3D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;YAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACxC,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,OAAO,EAAE,CAAC;YACxC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,2EAA2E;QAC3E,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrE,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACvE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACxC,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,KAAK,MAAM,EAAE,IAAI,MAAA,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,0CAAE,IAAI,EAAE,mCAAI,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;oBAAE,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,IAAI;gBAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACpE,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED,4EAA4E;IAEpE,SAAS,CAAC,IAAgB;QAChC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACnC,8EAA8E;QAC9E,0EAA0E;QAC1E,yEAAyE;QACzE,sEAAsE;QACtE,0EAA0E;QAC1E,4EAA4E;QAC5E,4EAA4E;QAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM;YAAE,OAAO;QAEpB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QAE1B,+BAA+B;QAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpD,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;gBACjC,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClC,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;oBACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC/B,CAAC;gBACD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAAC,IAAgB,EAAE,IAAY;;QACnD,MAAM,EAAE,iBAAiB,EAAE,eAAe,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5D,MAAM,IAAI,GAAG,IAAI,CAAC;QAElB,uEAAuE;QACvE,0EAA0E;QAC1E,0EAA0E;QAC1E,2EAA2E;QAC3E,4BAA4B;QAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,GAAG,EAAE;;YAChB,OAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;gBAChB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,eAAe,EAAE,IAAI,CAAC,eAAe;gBACrC,eAAe,EAAE,IAAI,CAAC,eAAe;gBACrC,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,OAAO,EAAE;oBACP,QAAQ,EAAE,IAAI;oBACd,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,cAAc;oBAC3C,aAAa,EAAE,IAAI,CAAC,OAAO,CAAC,aAAa;oBACzC,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;oBACvC,KAAK,EAAE,MAAA,IAAI,CAAC,KAAK,mCAAI,IAAI;iBAC1B;aACF,CAAC,CAAA;SAAA,CAAC;QACL,IAAI,UAAU;YAAE,OAAO,IAAI,EAAE,CAAC;QAE9B,4EAA4E;QAC5E,MAAM,KAAK,GAAG,MAAA,IAAI,CAAC,KAAK,mCAAI,IAAI,CAAC;QACjC,MAAM,GAAG,GAAwB;YAC/B,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;YACrB,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;YACrB,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YACpB,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;SACvB,CAAC;QACF,MAAM,OAAO,GACX,MAAA,IAAI,CAAC,eAAe,mCACpB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACzE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM;YAC/C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACrD,MAAM,OAAO,GACX,MAAA,IAAI,CAAC,eAAe,mCACpB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACzE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM;YAC/C,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAErD,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;QACjF,MAAM,KAAK,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;QAE7E,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;;YAAC,OAAA,CAAC;gBAC1C,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,MAAA,CAAC,CAAC,MAAM,mCAAI,CAAC,CAAC;gBACjC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,MAAA,CAAC,CAAC,MAAM,mCAAI,CAAC,CAAC;gBACjC,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,MAAA,CAAC,CAAC,MAAM,mCAAI,CAAC,CAAC,CAAC;gBAC/C,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,MAAA,CAAC,CAAC,MAAM,mCAAI,CAAC,CAAC,CAAC;aAClD,CAAC,CAAA;SAAA,CAAC,CAAC;QACJ,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CACvC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAE1F,MAAM,KAAK,GAAG;YACZ,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;YACzB,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE;YAC1B,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE;YAC1B,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE;SAC5B,CAAC;QACF,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QACvE,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CACtC,CAAC,OAAO,KAAK,OAAO,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YAC1E,CAAC,OAAO,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;QAGjF,MAAM,IAAI,GAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QACxF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,cAAuB,EAAU,EAAE;YAC1E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;gBAChC,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE;oBAAE,SAAS;gBAC7B,IAAI,IAAI,iBAAiB,CAAC;gBAC1B,iDAAiD;gBACjD,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,KAAK,cAAc;oBAAE,IAAI,IAAI,eAAe,CAAC;YACjE,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa;gBAAE,OAAO,IAAI,EAAE,CAAC,CAAC,gCAAgC;YAC9F,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;oBAAE,EAAE,GAAG,CAAC,CAAC;YACzE,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEnC,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAY,EAAE,CAAC;gBAC1B,IAAI,GAAG,GAAa,IAAI,CAAC;gBACzB,OAAO,GAAG,EAAE,CAAC;oBAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;oBAAC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;gBAAC,CAAC;gBACnF,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChB,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,UAAmB,EAAW,EAAE,CAChE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3F,MAAM,GAAG,GAAY;sCACd,IAAI,CAAC,KAAK;oBAAI,KAAK;oBACxB,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;oBACpC,GAAG,KAAK;oBACR,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC;oBAC7C,KAAK;sCAAO,IAAI,CAAC,GAAG;iBACrB,CAAC;gBACF,2BAA2B;gBAC3B,MAAM,GAAG,GAAY,EAAE,CAAC;gBACxB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;oBACpB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACjC,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;wBAAE,SAAS;oBACvD,OAAO,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;wBACvB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBACzD,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;4BAAE,GAAG,CAAC,GAAG,EAAE,CAAC;;4BAC7E,MAAM;oBACb,CAAC;oBACD,GAAG,CAAC,IAAI,mBAAM,CAAC,EAAG,CAAC;gBACrB,CAAC;gBACD,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;oBAAE,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClH,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;YACnF,CAAC;YAED,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;gBACzC,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC;oBAAE,SAAS,CAAC,aAAa;gBACzE,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;gBACpB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC7C,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;gBACrC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC;oBAAE,SAAS;gBAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5E,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxD,MAAM,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,IAAI,CAAC;oBAAE,SAAS;gBAChD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBACjB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;QACD,OAAO,IAAI,EAAE,CAAC;IAChB,CAAC;IAEO,cAAc,CAAC,MAAc;QACnC,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACtB,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;CACF;AApSD,8CAoSC"}

package/src/libs/engine/src/routing/global/solver-host.d.ts

@@ -0,0 +1,65 @@
+import { type SolverEdge, type SolverOptions, type SolverStats } from './GlobalRouteSolver';
+import type { Obstacle } from '../types';
+import type { Point } from '../../types';
+export interface SolverRequestSolve {
+    seq: number;
+    kind: 'solve';
+    edges: SolverEdge[];
+    obstacles: Obstacle[];
+    options?: SolverOptions;
+}
+export interface SolverRequestIncremental {
+    seq: number;
+    kind: 'incremental';
+    changed: Array<{
+        edge: SolverEdge;
+        removed?: boolean;
+    }>;
+    obstacles?: Obstacle[];
+}
+export type SolverRequest = SolverRequestSolve | SolverRequestIncremental;
+export interface SolverResponse {
+    seq: number;
+    routes: Array<[string, Point[]]>;
+    stats: SolverStats;
+}
+/** The message port surface the host needs — a real Worker satisfies it. */
+export interface SolverPort {
+    postMessage(msg: SolverRequest): void;
+    onmessage: ((ev: {
+        data: SolverResponse;
+    }) => void) | null;
+}
+/**
+ * Serve solver requests on a port. This IS the worker's message loop — call it
+ * inside the worker script with `self`, or in a test with a fake port.
+ */
+export declare function serveSolver(port: {
+    onmessage: ((ev: {
+        data: SolverRequest;
+    }) => void) | null;
+    postMessage(msg: SolverResponse): void;
+}): void;
+/**
+ * The caller-side host. Pass a real Worker (or anything satisfying SolverPort)
+ * to run remote; pass nothing to run inline on the same thread — identical
+ * behaviour, no protocol drift, because BOTH paths speak through serveSolver.
+ */
+export declare class SolverHost {
+    private seq;
+    private pending;
+    private readonly port;
+    constructor(port?: SolverPort);
+    solve(edges: SolverEdge[], obstacles: Obstacle[], options?: SolverOptions): Promise<{
+        routes: Map<string, Point[]>;
+        stats: SolverStats;
+    }>;
+    solveIncremental(changed: Array<{
+        edge: SolverEdge;
+        removed?: boolean;
+    }>, obstacles?: Obstacle[]): Promise<{
+        routes: Map<string, Point[]>;
+        stats: SolverStats;
+    }>;
+    private request;
+}

package/src/libs/engine/src/routing/global/solver-host.js

@@ -0,0 +1,87 @@
+"use strict";
+// Wave 5 (Edge routing) — Card 7, the worker seam.
+//
+// The solver is pure and synchronous; this host runs it EITHER inline (no
+// Worker available — jsdom, SSR, tests) or behind a postMessage boundary, with
+// one protocol and one code path for callers. The caller never knows which.
+//
+// Protocol (structured-clone-safe, no functions, no class instances):
+//   → { seq, kind: 'solve',       edges, obstacles, options }
+//   → { seq, kind: 'incremental', changed, obstacles? }
+//   ← { seq, routes: Array<[edgeId, Point[]]>, stats }
+//
+// `createSolverWorkerScript()` returns the exact onmessage body a bundler-built
+// Worker needs, so the renderer (or a server thumbnailer) can instantiate the
+// worker however its toolchain likes — new Worker(new URL(...)), a blob, or a
+// node worker_thread — and hand the port in. The host does not construct
+// Workers itself: doing so would bake ONE bundler's URL scheme into the engine.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SolverHost = void 0;
+exports.serveSolver = serveSolver;
+const GlobalRouteSolver_1 = require("./GlobalRouteSolver");
+/**
+ * Serve solver requests on a port. This IS the worker's message loop — call it
+ * inside the worker script with `self`, or in a test with a fake port.
+ */
+function serveSolver(port) {
+    let solver = null;
+    port.onmessage = (ev) => {
+        const req = ev.data;
+        if (req.kind === 'solve') {
+            solver = new GlobalRouteSolver_1.GlobalRouteSolver(req.options);
+            const routes = solver.solve(req.edges, req.obstacles);
+            port.postMessage({ seq: req.seq, routes: [...routes], stats: Object.assign({}, solver.stats) });
+        }
+        else {
+            if (!solver)
+                solver = new GlobalRouteSolver_1.GlobalRouteSolver();
+            const routes = solver.solveIncremental(req.changed, req.obstacles);
+            port.postMessage({ seq: req.seq, routes: [...routes], stats: Object.assign({}, solver.stats) });
+        }
+    };
+}
+/**
+ * The caller-side host. Pass a real Worker (or anything satisfying SolverPort)
+ * to run remote; pass nothing to run inline on the same thread — identical
+ * behaviour, no protocol drift, because BOTH paths speak through serveSolver.
+ */
+class SolverHost {
+    constructor(port) {
+        this.seq = 0;
+        this.pending = new Map();
+        if (port) {
+            this.port = port;
+        }
+        else {
+            // inline fallback: a loopback "port" pair served by the same loop the
+            // worker would run — the protocol is exercised even in-process.
+            const hostSide = { postMessage: () => void 0, onmessage: null };
+            const workerSide = {
+                onmessage: null,
+                postMessage: (msg) => { var _a; return (_a = hostSide.onmessage) === null || _a === void 0 ? void 0 : _a.call(hostSide, { data: msg }); },
+            };
+            serveSolver(workerSide);
+            hostSide.postMessage = (msg) => { var _a; return (_a = workerSide.onmessage) === null || _a === void 0 ? void 0 : _a.call(workerSide, { data: msg }); };
+            this.port = hostSide;
+        }
+        this.port.onmessage = (ev) => {
+            const cb = this.pending.get(ev.data.seq);
+            this.pending.delete(ev.data.seq);
+            cb === null || cb === void 0 ? void 0 : cb(ev.data);
+        };
+    }
+    solve(edges, obstacles, options) {
+        return this.request({ seq: ++this.seq, kind: 'solve', edges, obstacles, options });
+    }
+    solveIncremental(changed, obstacles) {
+        return this.request({ seq: ++this.seq, kind: 'incremental', changed, obstacles });
+    }
+    request(req) {
+        return new Promise((resolve) => {
+            this.pending.set(req.seq, (r) => resolve({ routes: new Map(r.routes), stats: r.stats }));
+            this.port.postMessage(req);
+        });
+    }
+}
+exports.SolverHost = SolverHost;
+//# sourceMappingURL=solver-host.js.map

package/src/libs/engine/src/routing/global/solver-host.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"solver-host.js","sourceRoot":"","sources":["../../../../../../../engine/src/routing/global/solver-host.ts"],"names":[],"mappings":";AAAA,mDAAmD;AACnD,EAAE;AACF,0EAA0E;AAC1E,+EAA+E;AAC/E,4EAA4E;AAC5E,EAAE;AACF,sEAAsE;AACtE,8DAA8D;AAC9D,wDAAwD;AACxD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,8EAA8E;AAC9E,8EAA8E;AAC9E,yEAAyE;AACzE,gFAAgF;;;AAuChF,kCAiBC;AAtDD,2DAA+G;AAiC/G;;;GAGG;AACH,SAAgB,WAAW,CAAC,IAG3B;IACC,IAAI,MAAM,GAA6B,IAAI,CAAC;IAC5C,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,EAAE,EAAE;QACtB,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;QACpB,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,qCAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;YACtD,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,KAAK,oBAAO,MAAM,CAAC,KAAK,CAAE,EAAE,CAAC,CAAC;QACtF,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM;gBAAE,MAAM,GAAG,IAAI,qCAAiB,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;YACnE,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,KAAK,oBAAO,MAAM,CAAC,KAAK,CAAE,EAAE,CAAC,CAAC;QACtF,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAa,UAAU;IAKrB,YAAY,IAAiB;QAJrB,QAAG,GAAG,CAAC,CAAC;QACR,YAAO,GAAG,IAAI,GAAG,EAAuC,CAAC;QAI/D,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,sEAAsE;YACtE,gEAAgE;YAChE,MAAM,QAAQ,GAAe,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;YAC5E,MAAM,UAAU,GAAG;gBACjB,SAAS,EAAE,IAAsD;gBACjE,WAAW,EAAE,CAAC,GAAmB,EAAE,EAAE,WAAC,OAAA,MAAA,QAAQ,CAAC,SAAS,yDAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAA,EAAA;aAC1E,CAAC;YACF,WAAW,CAAC,UAAU,CAAC,CAAC;YACxB,QAAQ,CAAC,WAAW,GAAG,CAAC,GAAkB,EAAE,EAAE,WAAC,OAAA,MAAA,UAAU,CAAC,SAAS,2DAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAA,EAAA,CAAC;YACrF,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,EAAE,EAAE;YAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjC,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAChB,CAAC,CAAC;IACJ,CAAC;IAED,KAAK,CACH,KAAmB,EACnB,SAAqB,EACrB,OAAuB;QAEvB,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;IACrF,CAAC;IAED,gBAAgB,CACd,OAAuD,EACvD,SAAsB;QAEtB,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;IACpF,CAAC;IAEO,OAAO,CAAC,GAAkB;QAChC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzF,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAhDD,gCAgDC"}

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

@@ -0,0 +1,15 @@
+export * from './types';
+export * from './RoutingEngine';
+export * from './LiveReroutingEngine';
+export * from './ObstacleMap';
+export * from './ObstacleIndex';
+export * from './ObstacleMapBuilder';
+export * from './PathSimplifier';
+export * from './algorithms/StraightRouter';
+export * from './algorithms/OrthogonalRouter';
+export * from './algorithms/ManhattanRouter';
+export * from './global/GlobalRouteSolver';
+export * from './global/solver-host';
+export * from './algorithms/AStarRouter';
+export * from './algorithms/DijkstraRouter';
+export * from './algorithms/VisibilityGraphRouter';

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

@@ -0,0 +1,20 @@
+"use strict";
+// Routing index - exports routing system components
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./types"), exports);
+tslib_1.__exportStar(require("./RoutingEngine"), exports);
+tslib_1.__exportStar(require("./LiveReroutingEngine"), exports); // Phase 0.2
+tslib_1.__exportStar(require("./ObstacleMap"), exports);
+tslib_1.__exportStar(require("./ObstacleIndex"), exports); // Wave 8 Card 6
+tslib_1.__exportStar(require("./ObstacleMapBuilder"), exports); // Phase 1.6b
+tslib_1.__exportStar(require("./PathSimplifier"), exports); // Phase 2.2
+tslib_1.__exportStar(require("./algorithms/StraightRouter"), exports);
+tslib_1.__exportStar(require("./algorithms/OrthogonalRouter"), exports);
+tslib_1.__exportStar(require("./algorithms/ManhattanRouter"), exports); // Wave 5 Card 3
+tslib_1.__exportStar(require("./global/GlobalRouteSolver"), exports); // Wave 5 Card 7
+tslib_1.__exportStar(require("./global/solver-host"), exports); // Wave 5 Card 7
+tslib_1.__exportStar(require("./algorithms/AStarRouter"), exports); // Phase 1.6b
+tslib_1.__exportStar(require("./algorithms/DijkstraRouter"), exports); // Phase 1.6b
+tslib_1.__exportStar(require("./algorithms/VisibilityGraphRouter"), exports); // Phase 1.6b
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../engine/src/routing/index.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AAEpD,kDAAwB;AACxB,0DAAgC;AAChC,gEAAsC,CAAC,YAAY;AACnD,wDAA8B;AAC9B,0DAAgC,CAAC,gBAAgB;AACjD,+DAAqC,CAAC,aAAa;AACnD,2DAAiC,CAAC,YAAY;AAC9C,sEAA4C;AAC5C,wEAA8C;AAC9C,uEAA6C,CAAC,gBAAgB;AAC9D,qEAA2C,CAAC,gBAAgB;AAC5D,+DAAqC,CAAC,gBAAgB;AACtD,mEAAyC,CAAC,aAAa;AACvD,sEAA4C,CAAC,aAAa;AAC1D,6EAAmD,CAAC,aAAa"}