@grafloria/element 0.3.17 → 0.3.19

package/src/libs/renderer/src/svg/route-memo.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"route-memo.js","sourceRoot":"","sources":["../../../../../../renderer/src/svg/route-memo.ts"],"names":[],"mappings":";AAAA,2EAA2E;AAC3E,EAAE;AACF,+EAA+E;AAC/E,kBAAkB;AAClB,EAAE;AACF,yFAAyF;AACzF,EAAE;AACF,gFAAgF;AAChF,8EAA8E;AAC9E,uEAAuE;AACvE,EAAE;AACF,gFAAgF;AAChF,YAAY;AACZ,EAAE;AACF,iFAAiF;AACjF,iFAAiF;AACjF,gFAAgF;AAChF,gFAAgF;AAChF,2EAA2E;AAC3E,EAAE;AACF,gFAAgF;AAChF,6EAA6E;AAC7E,8EAA8E;AAC9E,gFAAgF;AAChF,0CAA0C;AAC1C,EAAE;AACF,iFAAiF;AACjF,+EAA+E;AAC/E,qFAAqF;AACrF,kFAAkF;AAClF,EAAE;AACF,6EAA6E;AAC7E,+EAA+E;AAC/E,8EAA8E;AAC9E,8EAA8E;AAC9E,2EAA2E;AAC3E,8EAA8E;AAC9E,6EAA6E;AAC7E,QAAQ;;;AAqIR,0BAOC;AASD,4BA4CC;AA/KD;;;;;;;;;GASG;AACU,QAAA,mBAAmB,GAAG,EAAE,CAAC;AAEtC,0FAA0F;AAC1F,MAAM,WAAW,GAAG,KAAM,CAAC;AAE3B,MAAa,SAAS;IAAtB;QACU,YAAO,GAAG,IAAI,GAAG,EAA+C,CAAC;QACjE,cAAS,GAAG,IAAI,GAAG,EAAgB,CAAC;QAC5C,2FAA2F;QACnF,UAAK,GAAG,EAAE,CAAC;QACX,WAAM,GAAmB,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IA4F5D,CAAC;IA1FC,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;;;;;;;;;;OAWG;IACH,UAAU,CAAC,KAAwB,EAAE,aAAqB;QACxD,IAAI,CAAC,MAAM,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAEvC,IAAI,aAAa,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,qDAAqD;YACrD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,KAAK,GAAW,EAAE,CAAC;QAEzB,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW;gBAC5B,SAAS;YACX,CAAC;YACD,IACE,MAAM,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBAClB,MAAM,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;gBAClB,MAAM,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK;gBAC1B,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,EAC5B,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU;gBAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW;YAC9B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW;QACrD,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8EAA8E;IAC9E,MAAM,CAAC,MAAc,EAAE,GAAW;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG;YAAE,OAAO,SAAS,CAAC;QAC9C,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QACrB,OAAO,GAAG,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,MAAc,EAAE,GAAW,EAAE,MAAkB;QACnD,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QACrB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,WAAW,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAClE,6DAA6D;YAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;YAC1C,IAAI,CAAC,MAAM,CAAC,IAAI;gBAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,4FAA4F;IAC5F,IAAI,CAAC,MAAc;QACjB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAED,UAAU,CAAC,OAAyB;QAClC,KAAK,MAAM,EAAE,IAAI,OAAO;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACpD,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;CACF;AAjGD,8BAiGC;AAED,0CAA0C;AAC1C,SAAgB,OAAO,CAAC,CAAO,EAAE,GAAW;IAC1C,OAAO;QACL,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG;QACZ,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG;QACZ,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC;QACxB,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,GAAG,GAAG,CAAC;KAC3B,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,QAAQ,CAAC,KAAa,EAAE,QAAQ,GAAG,EAAE;IACnD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAEpC,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IACE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK;gBACpB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;gBACpB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM;gBACrB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,EACrB,CAAC;gBACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;gBACpD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;gBACtD,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC;gBACzE,MAAM,GAAG,IAAI,CAAC;gBACd,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM;YAAE,KAAK,CAAC,IAAI,mBAAM,CAAC,EAAG,CAAC;IACpC,CAAC;IAED,2EAA2E;IAC3E,4EAA4E;IAC5E,yDAAyD;IACzD,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/src/libs/renderer/src/svg/route-solver-bridge.d.ts

@@ -0,0 +1,48 @@
+import type { SolverEdge, SolverOptions, SolverPort, Obstacle, RoutedPath } from '@grafloria/engine';
+export interface RouteSolverBridgeOptions {
+    /**
+     * A real Worker (or anything satisfying SolverPort). Omit to run the solver
+     * INLINE — same protocol, same code, same answers, just on this thread. The
+     * bridge does not construct a Worker itself: that would bake one bundler's URL
+     * scheme into the renderer, which is the mistake the old LayoutWorkerPool made.
+     */
+    port?: SolverPort;
+    solver?: SolverOptions;
+    /** "I have better routes than the ones you painted." Ask for a re-render. */
+    onRoutesReady?: () => void;
+}
+export interface RouteSolverStats {
+    submitted: number;
+    applied: number;
+    /** answers thrown away because the world had moved on under them */
+    discarded: number;
+    superseded: number;
+}
+export declare class RouteSolverBridge {
+    private readonly host;
+    private readonly options?;
+    private readonly onRoutesReady?;
+    /** The solver's latest accepted answer, and the world it describes. */
+    private routes;
+    private routesVersion;
+    private inFlightVersion;
+    private queued;
+    private _stats;
+    private disposed;
+    constructor(options?: RouteSolverBridgeOptions);
+    get stats(): Readonly<RouteSolverStats>;
+    /** True once the solver has an answer for THIS world — i.e. one safe to paint. */
+    hasRoutesFor(version: number): boolean;
+    routeFor(linkId: string, version: number): RoutedPath | undefined;
+    /**
+     * Ask for this world to be solved. Idempotent per version: submitting the same
+     * world twice does nothing, so calling this every frame is free.
+     *
+     * If a solve is already running for an older world, the new one is QUEUED, not
+     * raced — and if a third arrives first, it replaces the queued one. At most one
+     * solve in flight, and the newest world always wins.
+     */
+    submit(version: number, edges: SolverEdge[], obstacles: Obstacle[]): void;
+    private dispatch;
+    dispose(): void;
+}

package/src/libs/renderer/src/svg/route-solver-bridge.js

@@ -0,0 +1,151 @@
+"use strict";
+// Wave 8 (Performance & scale) — Card 6: the render loop finally drives the solver.
+//
+// Wave 5 (Card 7) built `GlobalRouteSolver` — all edges routed against ONE shared
+// penalty field, so an edge pays for crossing another edge or crowding a corridor
+// at ROUTING time — and `SolverHost`, the worker seam, whose inline fallback
+// speaks the identical protocol. And then it wrote, honestly, in its own notes:
+// "the render loop does not yet drive the solver." This is that wire.
+//
+// THE CONSTRAINT THAT DICTATES THE ARCHITECTURE. `render()` is SYNCHRONOUS: it
+// returns a VNode tree, and every link's geometry must be final before it does.
+// A worker cannot be awaited from inside it. There is no clever way around this;
+// Wave 7's layout-host learned the neighbouring version of the same lesson the
+// hard way (a worker running a synchronous loop is not reading its message queue,
+// so it cannot even RECEIVE the cancel you sent it).
+//
+// So the wiring is PROVISIONAL-THEN-REFINED, which is what libavoid-class systems
+// do and the only thing that is actually sound here:
+//
+//   1. the synchronous incremental router paints immediately — it is correct, and
+//      after this card it is also fast (a one-node drag at 10k nodes is ~90ms);
+//   2. the global solver runs OFF THE MAIN THREAD against the same world;
+//   3. when its answer lands it is adopted, and a re-render is requested.
+//
+// THE BUG THIS MUST NOT HAVE, and the reason for every `version` below: an answer
+// that arrives after the world has moved was computed against an obstacle set that
+// no longer exists. Painting it puts links through nodes. So every submission
+// carries the world version it was computed for, and a result whose version is no
+// longer current is DISCARDED, not adopted. Late is fine. Wrong is not.
+//
+// And we never try to CANCEL an in-flight solve — see the layout-host note above,
+// it does not work. We SUPERSEDE: the newest world wins, and at most one solve is
+// ever in flight.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RouteSolverBridge = void 0;
+const engine_1 = require("@grafloria/engine");
+class RouteSolverBridge {
+    constructor(options = {}) {
+        /** The solver's latest accepted answer, and the world it describes. */
+        this.routes = new Map();
+        this.routesVersion = -1;
+        this.inFlightVersion = -1;
+        this.queued = null;
+        this._stats = { submitted: 0, applied: 0, discarded: 0, superseded: 0 };
+        this.disposed = false;
+        this.host = new engine_1.SolverHost(options.port);
+        this.options = options.solver;
+        this.onRoutesReady = options.onRoutesReady;
+    }
+    get stats() {
+        return this._stats;
+    }
+    /** True once the solver has an answer for THIS world — i.e. one safe to paint. */
+    hasRoutesFor(version) {
+        return this.routesVersion === version && this.routes.size > 0;
+    }
+    routeFor(linkId, version) {
+        if (this.routesVersion !== version)
+            return undefined;
+        return this.routes.get(linkId);
+    }
+    /**
+     * Ask for this world to be solved. Idempotent per version: submitting the same
+     * world twice does nothing, so calling this every frame is free.
+     *
+     * If a solve is already running for an older world, the new one is QUEUED, not
+     * raced — and if a third arrives first, it replaces the queued one. At most one
+     * solve in flight, and the newest world always wins.
+     */
+    submit(version, edges, obstacles) {
+        if (this.disposed)
+            return;
+        if (version === this.routesVersion)
+            return; // already solved
+        if (version === this.inFlightVersion)
+            return; // already solving
+        if (this.inFlightVersion >= 0) {
+            if (this.queued)
+                this._stats.superseded++;
+            this.queued = { version, edges, obstacles };
+            return;
+        }
+        this.dispatch({ version, edges, obstacles });
+    }
+    dispatch(job) {
+        this.inFlightVersion = job.version;
+        this._stats.submitted++;
+        this.host
+            .solve(job.edges, job.obstacles, this.options)
+            .then(({ routes }) => {
+            var _a;
+            if (this.disposed)
+                return;
+            this.inFlightVersion = -1;
+            // The world may have moved while we were solving. If it did, this answer
+            // describes obstacles that are no longer where they were — it is not
+            // "slightly out of date", it is wrong, and painting it would run links
+            // through nodes. Drop it; the queued job below is already solving the
+            // world as it now is.
+            const stillCurrent = this.queued === null || this.queued.version === job.version;
+            if (!stillCurrent) {
+                this._stats.discarded++;
+            }
+            else {
+                this.routes = new Map();
+                for (const [id, points] of routes) {
+                    if (points.length < 2)
+                        continue;
+                    this.routes.set(id, toRoutedPath(points));
+                }
+                this.routesVersion = job.version;
+                this._stats.applied++;
+            }
+            const next = this.queued;
+            this.queued = null;
+            if (next)
+                this.dispatch(next);
+            else if (stillCurrent)
+                (_a = this.onRoutesReady) === null || _a === void 0 ? void 0 : _a.call(this);
+        })
+            .catch(() => {
+            // A solver that throws must not wedge the bridge: the sync router is
+            // already painting correct geometry, so the worst case here is that we
+            // never refine. Reset and let the next frame try again.
+            this.inFlightVersion = -1;
+            const next = this.queued;
+            this.queued = null;
+            if (next)
+                this.dispatch(next);
+        });
+    }
+    dispose() {
+        this.disposed = true;
+        this.routes.clear();
+        this.queued = null;
+    }
+}
+exports.RouteSolverBridge = RouteSolverBridge;
+function toRoutedPath(points) {
+    let totalLength = 0;
+    for (let i = 1; i < points.length; i++) {
+        totalLength += Math.abs(points[i].x - points[i - 1].x) + Math.abs(points[i].y - points[i - 1].y);
+    }
+    return {
+        points: points.map((p) => ({ x: p.x, y: p.y })),
+        totalLength,
+        bendCount: Math.max(0, points.length - 2),
+        cost: totalLength,
+    };
+}
+//# sourceMappingURL=route-solver-bridge.js.map

package/src/libs/renderer/src/svg/route-solver-bridge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"route-solver-bridge.js","sourceRoot":"","sources":["../../../../../../renderer/src/svg/route-solver-bridge.ts"],"names":[],"mappings":";AAAA,oFAAoF;AACpF,EAAE;AACF,kFAAkF;AAClF,kFAAkF;AAClF,6EAA6E;AAC7E,gFAAgF;AAChF,sEAAsE;AACtE,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,iFAAiF;AACjF,+EAA+E;AAC/E,kFAAkF;AAClF,qDAAqD;AACrD,EAAE;AACF,kFAAkF;AAClF,qDAAqD;AACrD,EAAE;AACF,kFAAkF;AAClF,gFAAgF;AAChF,0EAA0E;AAC1E,0EAA0E;AAC1E,EAAE;AACF,kFAAkF;AAClF,mFAAmF;AACnF,8EAA8E;AAC9E,kFAAkF;AAClF,wEAAwE;AACxE,EAAE;AACF,kFAAkF;AAClF,kFAAkF;AAClF,kBAAkB;;;AAElB,8CAA+C;AAwB/C,MAAa,iBAAiB;IAe5B,YAAY,UAAoC,EAAE;QAVlD,uEAAuE;QAC/D,WAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;QACvC,kBAAa,GAAG,CAAC,CAAC,CAAC;QAEnB,oBAAe,GAAG,CAAC,CAAC,CAAC;QACrB,WAAM,GAA2E,IAAI,CAAC;QAEtF,WAAM,GAAqB,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QACrF,aAAQ,GAAG,KAAK,CAAC;QAGvB,IAAI,CAAC,IAAI,GAAG,IAAI,mBAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;IAC7C,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,kFAAkF;IAClF,YAAY,CAAC,OAAe;QAC1B,OAAO,IAAI,CAAC,aAAa,KAAK,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IAChE,CAAC;IAED,QAAQ,CAAC,MAAc,EAAE,OAAe;QACtC,IAAI,IAAI,CAAC,aAAa,KAAK,OAAO;YAAE,OAAO,SAAS,CAAC;QACrD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,OAAe,EAAE,KAAmB,EAAE,SAAqB;QAChE,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAC1B,IAAI,OAAO,KAAK,IAAI,CAAC,aAAa;YAAE,OAAO,CAAC,iBAAiB;QAC7D,IAAI,OAAO,KAAK,IAAI,CAAC,eAAe;YAAE,OAAO,CAAC,kBAAkB;QAEhE,IAAI,IAAI,CAAC,eAAe,IAAI,CAAC,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YAC1C,IAAI,CAAC,MAAM,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;YAC5C,OAAO;QACT,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;IAC/C,CAAC;IAEO,QAAQ,CAAC,GAAoE;QACnF,IAAI,CAAC,eAAe,GAAG,GAAG,CAAC,OAAO,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;QAExB,IAAI,CAAC,IAAI;aACN,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC;aAC7C,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE;;YACnB,IAAI,IAAI,CAAC,QAAQ;gBAAE,OAAO;YAC1B,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;YAE1B,yEAAyE;YACzE,qEAAqE;YACrE,uEAAuE;YACvE,sEAAsE;YACtE,sBAAsB;YACtB,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO,CAAC;YACjF,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;gBACxB,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;oBAClC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;wBAAE,SAAS;oBAChC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC5C,CAAC;gBACD,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,OAAO,CAAC;gBACjC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACxB,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,IAAI,IAAI;gBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;iBACzB,IAAI,YAAY;gBAAE,MAAA,IAAI,CAAC,aAAa,oDAAI,CAAC;QAChD,CAAC,CAAC;aACD,KAAK,CAAC,GAAG,EAAE;YACV,qEAAqE;YACrE,uEAAuE;YACvE,wDAAwD;YACxD,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,IAAI,IAAI;gBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;IACP,CAAC;IAED,OAAO;QACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IACrB,CAAC;CACF;AA1GD,8CA0GC;AAED,SAAS,YAAY,CAAC,MAAe;IACnC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,CAAC;IACD,OAAO;QACL,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/C,WAAW;QACX,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACzC,IAAI,EAAE,WAAW;KAClB,CAAC;AACJ,CAAC"}

package/src/libs/renderer/src/svg/shape-registry.d.ts

@@ -0,0 +1,189 @@
+import type { VNode, VNodeType } from '../types';
+import { type PathViewBox } from './path-outline';
+export type ShapeSide = 'left' | 'right' | 'top' | 'bottom';
+export interface ShapePoint {
+    x: number;
+    y: number;
+}
+/** Node bounding box in WORLD coordinates (used by boundaryPoint). */
+export interface ShapeRect {
+    x: number;
+    y: number;
+    w: number;
+    h: number;
+}
+/**
+ * Transform applied to a shape outline. The same primitive drives every render
+ * site: body = {}, selection = { grow: padding }, shadow = { dx, dy }.
+ */
+export interface OutlineTransform {
+    /** Expand the outline outward by this many px (selection highlight padding). */
+    grow?: number;
+    /** Translate the outline (drop-shadow offset). */
+    dx?: number;
+    dy?: number;
+    /** Corner radius for rect (rx). Emitted only when truthy unless `radiusAlways`. */
+    radius?: number;
+    /** Also emit ry (= radius). Selection/body want rx+ry; shadow wants rx only. */
+    radiusY?: boolean;
+    /** Emit rx even when `radius` is 0 (shadow keeps rx: borderRadius ?? 4). */
+    radiusAlways?: boolean;
+}
+/** An SVG element type plus the geometry props for one outline instance. */
+export interface OutlineSpec {
+    el: VNodeType;
+    geom: Record<string, number | string>;
+    /** Polygon shapes expose their vertices so boundaryPoint can reuse them. */
+    verts?: ShapePoint[];
+}
+/**
+ * A shape's inner label box in LOCAL coordinates (0,0 = node top-left). The
+ * node label engine wraps + clips text to this rect. Curved / slanted shapes
+ * (diamond, ellipse, triangle, cylinder …) inset it so text stays inside the
+ * visible silhouette. See {@link getInnerRect}.
+ */
+export interface InnerRect {
+    x: number;
+    y: number;
+    w: number;
+    h: number;
+}
+/**
+ * The single geometry contract every node shape implements. Register once via
+ * {@link registerShape} and the shape works across body, selection, shadow,
+ * smart-connection boundary and port positioning — no switch edits required.
+ */
+export interface ShapeDefinition {
+    type: string;
+    /** Outline geometry under a transform (drives body + selection + shadow). */
+    outline(width: number, height: number, transform?: OutlineTransform): OutlineSpec;
+    /**
+     * Point on the outline for a floating smart-connection attachment on `side`
+     * at cross-axis coordinate `cross` (world coords). Return null to fall back
+     * to the bounding-box edge (rect and unknown shapes do this).
+     */
+    boundaryPoint(rect: ShapeRect, side: ShapeSide, cross: number): ShapePoint | null;
+    /** Local-space port anchor on `side` for port `rank` of `count` on that side. */
+    portAnchor(width: number, height: number, side: ShapeSide, rank: number, count: number): ShapePoint;
+    /**
+     * The label box in local coords (0,0 = top-left). Used by the node label
+     * engine to wrap, clip and ellipsis-truncate text inside the silhouette.
+     * Optional — omit to accept the padded-bbox default ({@link defaultInnerRect}).
+     */
+    innerRect?(width: number, height: number): InnerRect;
+    /** How the node body applies node styles. Defaults to 'inline'. */
+    styleMode?: 'inline' | 'spread';
+    /** Style keys dropped from the body's pass-through props (circle: rx, ry). */
+    bodyStripKeys?: string[];
+    /**
+     * Geometry keys emitted AFTER the pass-through props in the body, so an
+     * explicit value overrides one arriving via the styles object. rect defers
+     * rx/ry so an explicit cornerRadius wins over a themed borderRadius.
+     */
+    bodyDeferGeomKeys?: string[];
+}
+/**
+ * Register (or replace) a shape definition. This is the payoff: a new shape is
+ * added in ONE place and immediately works across body/selection/shadow,
+ * smart-connection boundaries and port positioning — no switch edits.
+ */
+export declare function registerShape(type: string, def: Omit<ShapeDefinition, 'type'> & {
+    type?: string;
+}): void;
+/**
+ * A static SVG path string, or a parametric generator that returns the path `d`
+ * for a specific `width × height` box (0,0 at top-left). The generator form is
+ * preferred for shapes whose detail should NOT scale uniformly (rounded corners,
+ * fixed-radius notches); the static form is the quickest way to drop in a figure
+ * authored in a design tool.
+ */
+export type PathGeometry = string | ((width: number, height: number) => string);
+/**
+ * Options for {@link registerPathShape}.
+ *
+ * By default the boundary point (smart-connection attachment) and the port
+ * anchors are DERIVED from the path outline by sampling — so a custom silhouette
+ * attaches links to its real edge, not its bounding box. Supply `portAnchor` /
+ * `boundaryPoint` to override the sampled geometry with exact analytic anchors
+ * (the same override seam the built-in triangle uses for its apex/base points).
+ */
+export interface PathShapeOptions {
+    /** Reference box for a STATIC path string (default `0 0 1 1` — unit box). */
+    viewBox?: PathViewBox;
+    /** Exact port anchors, bypassing outline sampling. */
+    portAnchor?: ShapeDefinition['portAnchor'];
+    /** Exact smart-connection boundary, bypassing outline sampling. */
+    boundaryPoint?: ShapeDefinition['boundaryPoint'];
+    /** Label box; defaults to the padded bounding box. */
+    innerRect?: ShapeDefinition['innerRect'];
+    /** Curve subdivision when sampling the outline (default 24). */
+    sampleSteps?: number;
+}
+/**
+ * Register an arbitrary SVG-path shape (Card 2). This is the payoff of the
+ * geometry contract: a userland caller adds a brand-new silhouette in ONE call
+ * and it works everywhere the built-ins do — node body, selection highlight,
+ * drop shadow, smart-connection boundary and geometry-true port anchors — with
+ * NO core-team switch edits.
+ *
+ * ```ts
+ * // Parametric — a 5-point star that fills any box.
+ * registerPathShape('star', (w, h) => starPath(w, h));
+ * // Static — a chevron authored in a 24×24 art box.
+ * registerPathShape('chevron', 'M2,4 L14,4 L22,12 L14,20 L2,20 L10,12 Z',
+ *   { viewBox: { x: 0, y: 0, w: 24, h: 24 } });
+ * ```
+ */
+export declare function registerPathShape(type: string, path: PathGeometry, opts?: PathShapeOptions): void;
+/**
+ * BUILD a path shape's definition without storing it anywhere.
+ *
+ * Extracted from {@link registerPathShape} so a PER-DIAGRAM registry can offer
+ * `registerPathShape` too. Everything expensive and everything subtle — path
+ * parsing, the one-slot outline sample memo, the derived boundary and port
+ * anchors — lives here, so the global and scoped paths cannot drift into
+ * producing different geometry for the same path.
+ */
+export declare function buildPathShapeDefinition(type: string, path: PathGeometry, opts?: PathShapeOptions): ShapeDefinition;
+/**
+ * The rect shape is the default fallback for unknown / unset shape types.
+ *
+ * Resolution order is DIAGRAM-FIRST, then process-global. A diagram that
+ * contributed its own `badge` sees its own; every other diagram — and this one,
+ * for every name it did not claim — still sees the global registry. See
+ * `ext/registry-scope.ts` for why the lookup is ambient rather than threaded.
+ */
+export declare function getShape(type: string | undefined): ShapeDefinition;
+/** Whether a shape type is registered (excludes the implicit rect fallback). */
+export declare function hasShape(type: string): boolean;
+/** All registered shape type names (built-ins + extended library + aliases). */
+export declare function listShapes(): string[];
+/** Remove a registered shape. Returns false when the type was not registered. */
+export declare function unregisterShape(type: string): boolean;
+/**
+ * Snapshot the current catalogue, so a caller can restore it later. Used by the
+ * ExtensionHost to give a scoped extension an exact "undo" even when it OVERWROTE
+ * an existing shape rather than adding a new one.
+ */
+export declare function getShapeDefinition(type: string): ShapeDefinition | undefined;
+/**
+ * Monotonic counter, incremented on every add/remove. Cheap cache key.
+ * NOTE: `registerShape` itself bumps it — see the wrapper installed below.
+ */
+export declare function getShapeRegistryVersion(): number;
+/** Subscribe to catalogue changes. Returns a disposer. */
+export declare function onShapeRegistryChange(listener: () => void): () => void;
+/** Internal: let `registerShape` participate in the version/notify protocol. */
+export declare function notifyShapeRegistered(): void;
+/**
+ * The label box for a shape in local coords. Falls back to a padded bounding
+ * box when the shape doesn't override `innerRect`.
+ */
+export declare function getInnerRect(def: ShapeDefinition, width: number, height: number): InnerRect;
+/** Padded-bbox label box: inset by up to 8px, clamped so it never inverts. */
+export declare function defaultInnerRect(width: number, height: number): InnerRect;
+export declare function buildShapeBody(def: ShapeDefinition, width: number, height: number, cornerRadius: number | undefined, styles: any): VNode;
+/** Selection-highlight VNode: the outline grown by `padding`, plus baseProps. */
+export declare function buildShapeSelection(def: ShapeDefinition, width: number, height: number, padding: number, baseProps: Record<string, any>): VNode;
+/** Drop-shadow VNode: the outline offset by (offset, offset), plus baseProps. */
+export declare function buildShapeShadow(def: ShapeDefinition, width: number, height: number, offset: number, borderRadius: number, baseProps: Record<string, any>): VNode;