@grafloria/element 0.3.17 → 0.3.19

package/src/libs/engine/src/dsl/mermaid/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Mermaid graph-family diagram types beyond the flowchart (Phase 3).
+ *
+ * Each type is a matched TRIPLE — parser, model builder, generator — because a
+ * type that parses but cannot re-emit itself loses everything the grammar
+ * cannot say on the first save (gap-analysis §7).
+ */
+export { parseMermaidEr, erModelToDiagram, erModelFromDiagram, generateMermaidEr, generateErFromDiagram, erSpecFrom, erMarkers, type MermaidErModel, type MermaidErEntity, type MermaidErAttribute, type MermaidErRelationship, type ErCardinalityMarker, type ErSpec, } from './MermaidER';
+export { parseMermaidClass, classModelToDiagram, classModelFromDiagram, generateMermaidClass, generateClassFromDiagram, umlSpecFrom, umlRelationKind, type MermaidClassModel, type MermaidClassDef, type MermaidClassMember, type MermaidClassRelationship, type UmlOperator, type UmlLeftMarker, type UmlRightMarker, type UmlLineType, type UmlKind, type UmlSpec, } from './MermaidClass';
+export { parseMermaidState, stateModelToDiagram, stateModelFromDiagram, generateMermaidState, generateStateFromDiagram, type MermaidStateModel, type MermaidStateNode, type MermaidStateTransition, type StateKind, } from './MermaidState';

package/src/libs/engine/src/dsl/mermaid/index.js

@@ -0,0 +1,33 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.generateStateFromDiagram = exports.generateMermaidState = exports.stateModelFromDiagram = exports.stateModelToDiagram = exports.parseMermaidState = exports.umlRelationKind = exports.umlSpecFrom = exports.generateClassFromDiagram = exports.generateMermaidClass = exports.classModelFromDiagram = exports.classModelToDiagram = exports.parseMermaidClass = exports.erMarkers = exports.erSpecFrom = exports.generateErFromDiagram = exports.generateMermaidEr = exports.erModelFromDiagram = exports.erModelToDiagram = exports.parseMermaidEr = void 0;
+/**
+ * Mermaid graph-family diagram types beyond the flowchart (Phase 3).
+ *
+ * Each type is a matched TRIPLE — parser, model builder, generator — because a
+ * type that parses but cannot re-emit itself loses everything the grammar
+ * cannot say on the first save (gap-analysis §7).
+ */
+var MermaidER_1 = require("./MermaidER");
+Object.defineProperty(exports, "parseMermaidEr", { enumerable: true, get: function () { return MermaidER_1.parseMermaidEr; } });
+Object.defineProperty(exports, "erModelToDiagram", { enumerable: true, get: function () { return MermaidER_1.erModelToDiagram; } });
+Object.defineProperty(exports, "erModelFromDiagram", { enumerable: true, get: function () { return MermaidER_1.erModelFromDiagram; } });
+Object.defineProperty(exports, "generateMermaidEr", { enumerable: true, get: function () { return MermaidER_1.generateMermaidEr; } });
+Object.defineProperty(exports, "generateErFromDiagram", { enumerable: true, get: function () { return MermaidER_1.generateErFromDiagram; } });
+Object.defineProperty(exports, "erSpecFrom", { enumerable: true, get: function () { return MermaidER_1.erSpecFrom; } });
+Object.defineProperty(exports, "erMarkers", { enumerable: true, get: function () { return MermaidER_1.erMarkers; } });
+var MermaidClass_1 = require("./MermaidClass");
+Object.defineProperty(exports, "parseMermaidClass", { enumerable: true, get: function () { return MermaidClass_1.parseMermaidClass; } });
+Object.defineProperty(exports, "classModelToDiagram", { enumerable: true, get: function () { return MermaidClass_1.classModelToDiagram; } });
+Object.defineProperty(exports, "classModelFromDiagram", { enumerable: true, get: function () { return MermaidClass_1.classModelFromDiagram; } });
+Object.defineProperty(exports, "generateMermaidClass", { enumerable: true, get: function () { return MermaidClass_1.generateMermaidClass; } });
+Object.defineProperty(exports, "generateClassFromDiagram", { enumerable: true, get: function () { return MermaidClass_1.generateClassFromDiagram; } });
+Object.defineProperty(exports, "umlSpecFrom", { enumerable: true, get: function () { return MermaidClass_1.umlSpecFrom; } });
+Object.defineProperty(exports, "umlRelationKind", { enumerable: true, get: function () { return MermaidClass_1.umlRelationKind; } });
+var MermaidState_1 = require("./MermaidState");
+Object.defineProperty(exports, "parseMermaidState", { enumerable: true, get: function () { return MermaidState_1.parseMermaidState; } });
+Object.defineProperty(exports, "stateModelToDiagram", { enumerable: true, get: function () { return MermaidState_1.stateModelToDiagram; } });
+Object.defineProperty(exports, "stateModelFromDiagram", { enumerable: true, get: function () { return MermaidState_1.stateModelFromDiagram; } });
+Object.defineProperty(exports, "generateMermaidState", { enumerable: true, get: function () { return MermaidState_1.generateMermaidState; } });
+Object.defineProperty(exports, "generateStateFromDiagram", { enumerable: true, get: function () { return MermaidState_1.generateStateFromDiagram; } });
+//# sourceMappingURL=index.js.map

package/src/libs/engine/src/dsl/mermaid/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../../engine/src/dsl/mermaid/index.ts"],"names":[],"mappings":";;;AAAA;;;;;;GAMG;AACH,yCAcqB;AAbnB,2GAAA,cAAc,OAAA;AACd,6GAAA,gBAAgB,OAAA;AAChB,+GAAA,kBAAkB,OAAA;AAClB,8GAAA,iBAAiB,OAAA;AACjB,kHAAA,qBAAqB,OAAA;AACrB,uGAAA,UAAU,OAAA;AACV,sGAAA,SAAS,OAAA;AASX,+CAkBwB;AAjBtB,iHAAA,iBAAiB,OAAA;AACjB,mHAAA,mBAAmB,OAAA;AACnB,qHAAA,qBAAqB,OAAA;AACrB,oHAAA,oBAAoB,OAAA;AACpB,wHAAA,wBAAwB,OAAA;AACxB,2GAAA,WAAW,OAAA;AACX,+GAAA,eAAe,OAAA;AAajB,+CAUwB;AATtB,iHAAA,iBAAiB,OAAA;AACjB,mHAAA,mBAAmB,OAAA;AACnB,qHAAA,qBAAqB,OAAA;AACrB,oHAAA,oBAAoB,OAAA;AACpB,wHAAA,wBAAwB,OAAA"}

package/src/libs/engine/src/dsl/mermaid/layout.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Type-aware placement for Mermaid imports — shared rank machinery.
+ *
+ * Closes the gap-analysis §3a item "no type-aware layout (ER tables by FK
+ * dependency, class by inheritance depth, state by flow)". Each Mermaid type
+ * chooses WHICH edges rank its graph (flowchart: every edge; ER: FK
+ * dependency; class: inheritance/realization only; state: transitions from the
+ * start pseudo-states) and hands them here. This module answers the two
+ * questions the types share:
+ *
+ *   1. `assignRanks` — a rank per node by LONGEST PATH over the chosen edge
+ *      subset. Cycles are broken at the back-edge (deterministic DFS in the
+ *      caller's node order), so `Check -->|no| Start` ranks as a back-edge
+ *      instead of dragging Start below Check.
+ *   2. `placeByRank` — ranks become bands along the direction's flow axis
+ *      (TD/TB/BT ⇒ y, LR/RL ⇒ x), size-aware; siblings spread on the cross
+ *      axis, centered per band.
+ *
+ * SYNCHRONOUS and DETERMINISTIC on purpose: this runs at parse time inside the
+ * builders/transformer (TextFormat constructs DSL with `autoLayout:false` and
+ * must stay sync), so it cannot be the async ELK path and it must produce the
+ * same picture for the same text, every time. No new dependencies.
+ */
+export interface RankEdge {
+    from: string;
+    to: string;
+}
+/**
+ * Longest-path ranks over the edge subset, back-edges dropped.
+ *
+ * Deterministic: DFS roots and neighbour order follow `ids` / `edges` order,
+ * so the same text always breaks a cycle at the same edge. Nodes with no
+ * ranking edges sit at rank 0.
+ */
+export declare function assignRanks(ids: readonly string[], edges: readonly RankEdge[]): Map<string, number>;
+export interface PlaceByRankOptions {
+    /** TD / TB / BT rank down (or up) the page; LR / RL rank across it. Default TB. */
+    direction?: string;
+    /** Top-left corner of the laid-out block. */
+    start?: {
+        x: number;
+        y: number;
+    };
+    /** Gap between consecutive rank bands, along the flow axis. */
+    rankGap?: number;
+    /** Gap between siblings inside a band, across the flow axis. */
+    crossGap?: number;
+}
+export interface Placeable {
+    id: string;
+    size: {
+        width: number;
+        height: number;
+    };
+}
+/**
+ * Rank-band placement. Bands are size-aware (a band is as deep as its deepest
+ * node; each node centres within its band), siblings pack across the flow axis
+ * and every band centres on the widest band — so a fork reads as a fork.
+ * BT / RL simply reverse the band order, keeping coordinates positive.
+ */
+export declare function placeByRank(nodes: readonly Placeable[], ranks: ReadonlyMap<string, number>, options?: PlaceByRankOptions): Map<string, {
+    x: number;
+    y: number;
+}>;
+/** The two steps together — the common case for the type builders. */
+export declare function rankLayout(nodes: readonly Placeable[], edges: readonly RankEdge[], options?: PlaceByRankOptions): Map<string, {
+    x: number;
+    y: number;
+}>;

package/src/libs/engine/src/dsl/mermaid/layout.js

@@ -0,0 +1,162 @@
+"use strict";
+/**
+ * Type-aware placement for Mermaid imports — shared rank machinery.
+ *
+ * Closes the gap-analysis §3a item "no type-aware layout (ER tables by FK
+ * dependency, class by inheritance depth, state by flow)". Each Mermaid type
+ * chooses WHICH edges rank its graph (flowchart: every edge; ER: FK
+ * dependency; class: inheritance/realization only; state: transitions from the
+ * start pseudo-states) and hands them here. This module answers the two
+ * questions the types share:
+ *
+ *   1. `assignRanks` — a rank per node by LONGEST PATH over the chosen edge
+ *      subset. Cycles are broken at the back-edge (deterministic DFS in the
+ *      caller's node order), so `Check -->|no| Start` ranks as a back-edge
+ *      instead of dragging Start below Check.
+ *   2. `placeByRank` — ranks become bands along the direction's flow axis
+ *      (TD/TB/BT ⇒ y, LR/RL ⇒ x), size-aware; siblings spread on the cross
+ *      axis, centered per band.
+ *
+ * SYNCHRONOUS and DETERMINISTIC on purpose: this runs at parse time inside the
+ * builders/transformer (TextFormat constructs DSL with `autoLayout:false` and
+ * must stay sync), so it cannot be the async ELK path and it must produce the
+ * same picture for the same text, every time. No new dependencies.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.assignRanks = assignRanks;
+exports.placeByRank = placeByRank;
+exports.rankLayout = rankLayout;
+/**
+ * Longest-path ranks over the edge subset, back-edges dropped.
+ *
+ * Deterministic: DFS roots and neighbour order follow `ids` / `edges` order,
+ * so the same text always breaks a cycle at the same edge. Nodes with no
+ * ranking edges sit at rank 0.
+ */
+function assignRanks(ids, edges) {
+    var _a;
+    const idSet = new Set(ids);
+    const out = new Map();
+    for (const id of ids)
+        out.set(id, []);
+    for (const edge of edges) {
+        if (!idSet.has(edge.from) || !idSet.has(edge.to))
+            continue;
+        if (edge.from === edge.to)
+            continue; // self-loop: never a ranking edge
+        out.get(edge.from).push(edge);
+    }
+    // Back-edge detection: iterative DFS, colouring nodes white→grey→black. An
+    // edge into a GREY node closes a cycle and is dropped from ranking.
+    const GREY = 1;
+    const BLACK = 2;
+    const colour = new Map();
+    const forward = new Map();
+    for (const id of ids)
+        forward.set(id, []);
+    for (const root of ids) {
+        if (colour.has(root))
+            continue;
+        const stack = [{ id: root, next: 0 }];
+        colour.set(root, GREY);
+        while (stack.length > 0) {
+            const frame = stack[stack.length - 1];
+            const outgoing = out.get(frame.id);
+            if (frame.next < outgoing.length) {
+                const edge = outgoing[frame.next++];
+                const state = colour.get(edge.to);
+                if (state === GREY)
+                    continue; // back-edge — drop
+                forward.get(frame.id).push(edge);
+                if (state === undefined) {
+                    colour.set(edge.to, GREY);
+                    stack.push({ id: edge.to, next: 0 });
+                }
+            }
+            else {
+                colour.set(frame.id, BLACK);
+                stack.pop();
+            }
+        }
+    }
+    // Longest-path over the acyclic subset (Kahn order, then relax).
+    const incoming = new Map();
+    for (const id of ids)
+        incoming.set(id, 0);
+    for (const bucket of forward.values()) {
+        for (const edge of bucket)
+            incoming.set(edge.to, incoming.get(edge.to) + 1);
+    }
+    const ranks = new Map();
+    const queue = ids.filter((id) => incoming.get(id) === 0);
+    for (const id of queue)
+        ranks.set(id, 0);
+    for (let head = 0; head < queue.length; head++) {
+        const id = queue[head];
+        const rank = ranks.get(id);
+        for (const edge of forward.get(id)) {
+            const proposed = rank + 1;
+            if (((_a = ranks.get(edge.to)) !== null && _a !== void 0 ? _a : -1) < proposed)
+                ranks.set(edge.to, proposed);
+            const remaining = incoming.get(edge.to) - 1;
+            incoming.set(edge.to, remaining);
+            if (remaining === 0)
+                queue.push(edge.to);
+        }
+    }
+    for (const id of ids)
+        if (!ranks.has(id))
+            ranks.set(id, 0);
+    return ranks;
+}
+/**
+ * Rank-band placement. Bands are size-aware (a band is as deep as its deepest
+ * node; each node centres within its band), siblings pack across the flow axis
+ * and every band centres on the widest band — so a fork reads as a fork.
+ * BT / RL simply reverse the band order, keeping coordinates positive.
+ */
+function placeByRank(nodes, ranks, options = {}) {
+    var _a, _b, _c, _d, _e, _f;
+    if (nodes.length === 0)
+        return new Map();
+    const direction = ((_a = options.direction) !== null && _a !== void 0 ? _a : 'TB').toUpperCase();
+    const vertical = direction !== 'LR' && direction !== 'RL';
+    const reversed = direction === 'BT' || direction === 'RL';
+    const start = (_b = options.start) !== null && _b !== void 0 ? _b : { x: 100, y: 100 };
+    const rankGap = (_c = options.rankGap) !== null && _c !== void 0 ? _c : 70;
+    const crossGap = (_d = options.crossGap) !== null && _d !== void 0 ? _d : 50;
+    const along = (n) => (vertical ? n.size.height : n.size.width);
+    const across = (n) => (vertical ? n.size.width : n.size.height);
+    // Bands in rank order, preserving the caller's node order inside a band.
+    const bands = new Map();
+    for (const node of nodes) {
+        const rank = (_e = ranks.get(node.id)) !== null && _e !== void 0 ? _e : 0;
+        const band = (_f = bands.get(rank)) !== null && _f !== void 0 ? _f : [];
+        band.push(node);
+        bands.set(rank, band);
+    }
+    let order = [...bands.keys()].sort((a, b) => a - b);
+    if (reversed)
+        order = order.reverse();
+    const crossTotal = (band) => band.reduce((sum, n) => sum + across(n), 0) + (band.length - 1) * crossGap;
+    const widest = Math.max(...order.map((r) => crossTotal(bands.get(r))));
+    const positions = new Map();
+    let alongCursor = vertical ? start.y : start.x;
+    for (const rank of order) {
+        const band = bands.get(rank);
+        const bandDepth = Math.max(...band.map(along));
+        let crossCursor = (vertical ? start.x : start.y) + (widest - crossTotal(band)) / 2;
+        for (const node of band) {
+            const alongPos = alongCursor + (bandDepth - along(node)) / 2;
+            positions.set(node.id, vertical ? { x: crossCursor, y: alongPos } : { x: alongPos, y: crossCursor });
+            crossCursor += across(node) + crossGap;
+        }
+        alongCursor += bandDepth + rankGap;
+    }
+    return positions;
+}
+/** The two steps together — the common case for the type builders. */
+function rankLayout(nodes, edges, options = {}) {
+    return placeByRank(nodes, assignRanks(nodes.map((n) => n.id), edges), options);
+}
+//# sourceMappingURL=layout.js.map

package/src/libs/engine/src/dsl/mermaid/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../../../../../../engine/src/dsl/mermaid/layout.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;AAcH,kCAiEC;AAwBD,kCAiDC;AAGD,gCAUC;AA9JD;;;;;;GAMG;AACH,SAAgB,WAAW,CACzB,GAAsB,EACtB,KAA0B;;IAE1B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,GAAG;QAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAC3D,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE;YAAE,SAAS,CAAC,kCAAkC;QACvE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,2EAA2E;IAC3E,oEAAoE;IACpE,MAAM,IAAI,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC9C,KAAK,MAAM,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC/B,MAAM,KAAK,GAAwC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3E,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACtC,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC;YACpC,IAAI,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACjC,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;gBACpC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClC,IAAI,KAAK,KAAK,IAAI;oBAAE,SAAS,CAAC,mBAAmB;gBACjD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;oBAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBAC5B,KAAK,CAAC,GAAG,EAAE,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,EAAE,IAAI,GAAG;QAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,MAAM;YAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,GAAG,CAAC,CAAC,CAAC;IAC/E,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,KAAK,GAAa,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACnE,KAAK,MAAM,EAAE,IAAI,KAAK;QAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACzC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QAC/C,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAA,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,mCAAI,CAAC,CAAC,CAAC,GAAG,QAAQ;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxE,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,GAAG,CAAC,CAAC;YAC7C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;YACjC,IAAI,SAAS,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,GAAG;QAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3D,OAAO,KAAK,CAAC;AACf,CAAC;AAkBD;;;;;GAKG;AACH,SAAgB,WAAW,CACzB,KAA2B,EAC3B,KAAkC,EAClC,UAA8B,EAAE;;IAEhC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IACzC,MAAM,SAAS,GAAG,CAAC,MAAA,OAAO,CAAC,SAAS,mCAAI,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;IAC5D,MAAM,QAAQ,GAAG,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC;IAC1D,MAAM,QAAQ,GAAG,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC;IAC1D,MAAM,KAAK,GAAG,MAAA,OAAO,CAAC,KAAK,mCAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;IAClD,MAAM,OAAO,GAAG,MAAA,OAAO,CAAC,OAAO,mCAAI,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,MAAA,OAAO,CAAC,QAAQ,mCAAI,EAAE,CAAC;IAExC,MAAM,KAAK,GAAG,CAAC,CAAY,EAAU,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClF,MAAM,MAAM,GAAG,CAAC,CAAY,EAAU,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEnF,yEAAyE;IACzE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,MAAA,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,mCAAI,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,MAAA,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,mCAAI,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpD,IAAI,QAAQ;QAAE,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;IAEtC,MAAM,UAAU,GAAG,CAAC,IAAiB,EAAU,EAAE,CAC/C,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;IAC7E,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC;IAExE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoC,CAAC;IAC9D,IAAI,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/C,IAAI,WAAW,GACb,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnE,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAG,WAAW,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7D,SAAS,CAAC,GAAG,CACX,IAAI,CAAC,EAAE,EACP,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,WAAW,EAAE,CAC7E,CAAC;YACF,WAAW,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;QACzC,CAAC;QACD,WAAW,IAAI,SAAS,GAAG,OAAO,CAAC;IACrC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,sEAAsE;AACtE,SAAgB,UAAU,CACxB,KAA2B,EAC3B,KAA0B,EAC1B,UAA8B,EAAE;IAEhC,OAAO,WAAW,CAChB,KAAK,EACL,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAC1C,OAAO,CACR,CAAC;AACJ,CAAC"}

package/src/libs/engine/src/dsl/mermaid/lines.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Shared line pre-pass for the Mermaid graph-family parsers (ER, class, state).
+ *
+ * Every Mermaid body carries the same non-content furniture: `---` YAML
+ * frontmatter, `%%{init: …}%%` config directives, `%%` comments (own-line and
+ * trailing) and the type header itself. Stripping it in ONE place is what keeps
+ * the three parsers honest about the rest — a directive we do not understand
+ * must be SKIPPED, never turned into an entity (gap-analysis §5, invariant #1).
+ */
+export interface SignificantLine {
+    /** The line with comments and surrounding whitespace removed. */
+    text: string;
+    /** 1-based line number in the original text (for diagnostics). */
+    line: number;
+}
+/**
+ * Content lines of a Mermaid body: frontmatter, init directives, comments and
+ * blank lines removed. The header line (`erDiagram`, `classDiagram`, …) is
+ * dropped when `header` matches its first word, case-insensitively.
+ */
+export declare function significantLines(text: string, header: string | string[]): SignificantLine[];
+/** Unwrap a `"quoted"` token; returns the raw token otherwise. */
+export declare function unquote(token: string): string;
+/** Quote a Mermaid label when it is not a bare word (spaces, punctuation, empty). */
+export declare function quoteIfNeeded(label: string): string;

package/src/libs/engine/src/dsl/mermaid/lines.js

@@ -0,0 +1,74 @@
+"use strict";
+/**
+ * Shared line pre-pass for the Mermaid graph-family parsers (ER, class, state).
+ *
+ * Every Mermaid body carries the same non-content furniture: `---` YAML
+ * frontmatter, `%%{init: …}%%` config directives, `%%` comments (own-line and
+ * trailing) and the type header itself. Stripping it in ONE place is what keeps
+ * the three parsers honest about the rest — a directive we do not understand
+ * must be SKIPPED, never turned into an entity (gap-analysis §5, invariant #1).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.significantLines = significantLines;
+exports.unquote = unquote;
+exports.quoteIfNeeded = quoteIfNeeded;
+/** A `%%`-comment stripper that does not eat `%%` inside a quoted string. */
+function stripTrailingComment(raw) {
+    let inQuote = false;
+    for (let i = 0; i < raw.length; i++) {
+        const ch = raw[i];
+        if (ch === '"')
+            inQuote = !inQuote;
+        if (!inQuote && ch === '%' && raw[i + 1] === '%')
+            return raw.slice(0, i);
+    }
+    return raw;
+}
+/**
+ * Content lines of a Mermaid body: frontmatter, init directives, comments and
+ * blank lines removed. The header line (`erDiagram`, `classDiagram`, …) is
+ * dropped when `header` matches its first word, case-insensitively.
+ */
+function significantLines(text, header) {
+    const headers = (Array.isArray(header) ? header : [header]).map((h) => h.toLowerCase());
+    const out = [];
+    let inFrontmatter = false;
+    let headerSeen = false;
+    const lines = text.split('\n');
+    for (let i = 0; i < lines.length; i++) {
+        const raw = lines[i];
+        const trimmedRaw = raw.trim();
+        if (trimmedRaw === '---') {
+            // Only the LEADING `---` block is frontmatter; a stray one later is not.
+            if (!headerSeen)
+                inFrontmatter = !inFrontmatter;
+            continue;
+        }
+        if (inFrontmatter)
+            continue;
+        const text2 = stripTrailingComment(raw).trim();
+        if (!text2)
+            continue;
+        if (!headerSeen) {
+            const first = text2.split(/[\s:]/)[0].toLowerCase();
+            if (headers.includes(first)) {
+                headerSeen = true;
+                continue;
+            }
+        }
+        out.push({ text: text2, line: i + 1 });
+    }
+    return out;
+}
+/** Unwrap a `"quoted"` token; returns the raw token otherwise. */
+function unquote(token) {
+    const t = token.trim();
+    if (t.length >= 2 && t.startsWith('"') && t.endsWith('"'))
+        return t.slice(1, -1);
+    return t;
+}
+/** Quote a Mermaid label when it is not a bare word (spaces, punctuation, empty). */
+function quoteIfNeeded(label) {
+    return /^[A-Za-z0-9_-]+$/.test(label) ? label : `"${label.replace(/"/g, "'")}"`;
+}
+//# sourceMappingURL=lines.js.map

package/src/libs/engine/src/dsl/mermaid/lines.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lines.js","sourceRoot":"","sources":["../../../../../../../engine/src/dsl/mermaid/lines.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;AAyBH,4CA2BC;AAGD,0BAIC;AAGD,sCAEC;AAvDD,6EAA6E;AAC7E,SAAS,oBAAoB,CAAC,GAAW;IACvC,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,KAAK,GAAG;YAAE,OAAO,GAAG,CAAC,OAAO,CAAC;QACnC,IAAI,CAAC,OAAO,IAAI,EAAE,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG;YAAE,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAgB,gBAAgB,CAAC,IAAY,EAAE,MAAyB;IACtE,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IACxF,MAAM,GAAG,GAAsB,EAAE,CAAC;IAClC,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAC9B,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;YACzB,yEAAyE;YACzE,IAAI,CAAC,UAAU;gBAAE,aAAa,GAAG,CAAC,aAAa,CAAC;YAChD,SAAS;QACX,CAAC;QACD,IAAI,aAAa;YAAE,SAAS;QAC5B,MAAM,KAAK,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/C,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACpD,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,UAAU,GAAG,IAAI,CAAC;gBAClB,SAAS;YACX,CAAC;QACH,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kEAAkE;AAClE,SAAgB,OAAO,CAAC,KAAa;IACnC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACvB,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACjF,OAAO,CAAC,CAAC;AACX,CAAC;AAED,qFAAqF;AACrF,SAAgB,aAAa,CAAC,KAAa;IACzC,OAAO,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC;AAClF,CAAC"}

package/src/libs/engine/src/dsl/parser/Parser.d.ts

@@ -0,0 +1,131 @@
+/**
+ * DSL Parser - Converts token stream into Abstract Syntax Tree
+ *
+ * Parses Mermaid-compatible diagram syntax into structured AST
+ */
+import { Token } from '../types/Token';
+import { DiagramNode } from '../types/ASTNode';
+export declare class ParseError extends Error {
+    token: Token;
+    line: number;
+    column: number;
+    constructor(message: string, token: Token, line: number, column: number);
+}
+export declare class Parser {
+    private tokens;
+    private current;
+    /**
+     * Parse tokens into an AST
+     */
+    parse(tokens: Token[]): DiagramNode;
+    /**
+     * Parse diagram root
+     */
+    private parseDiagram;
+    /**
+     * Parse a statement
+     */
+    private parseStatement;
+    /**
+     * A single node reference: an id, then an optional shape (`[A]`, `([A])`, …)
+     * or a v11 metadata block (`@{ shape: rect, label: "Hi" }`).
+     */
+    private parseNodeRef;
+    /** One or more node refs joined by `&` (Mermaid multi-node syntax). */
+    private parseNodeGroup;
+    /** ClassApplication statements for any refs carrying an inline `:::class`. */
+    private classApps;
+    /**
+     * An edge chain: node-group (link [label] node-group)+. Each link produces the
+     * FULL CROSS PRODUCT of the previous group and the next (so `a & b --> c & d`
+     * is four edges), and the chain continues so `a --> b --> c` is two.
+     */
+    private parseEdgeChain;
+    /**
+     * v11 node metadata block: `@{ shape: rect, label: "Hi", icon: … }`. We read
+     * the keys we model (shape, label) and ignore the rest for forward-compat.
+     * `{`/`}` lex as RHOMBUS_OPEN/CLOSE.
+     */
+    private parseNodeMetadata;
+    /**
+     * Parse subgraph
+     */
+    private parseSubgraph;
+    /**
+     * Parse style definition: style A fill:#f9f,stroke:#333
+     */
+    private parseStyle;
+    /**
+     * Parse class definition: classDef className fill:#f9f
+     */
+    private parseClassDef;
+    /**
+     * Parse `class a,b hot` — bind an existing classDef to one or more nodes.
+     */
+    private parseClassApplication;
+    /**
+     * Parse `linkStyle 0,2 stroke:#f00` — style links by index (or `default`).
+     */
+    private parseLinkStyle;
+    /**
+     * Parse `click a "https://…" "tooltip"` — a node's navigation target. The
+     * `href` keyword form and `call`/callback forms are intentionally not modeled
+     * (a callback name is not a document fact); those lines are still skipped.
+     */
+    private parseClick;
+    /**
+     * Parse a Tier-2 extension comment into a GrafloriaDirective:
+     *   %%grafloria:node <id> <k>:<v>[,<k>:<v>]*
+     *   %%grafloria:edge <source> <target> <k>:<v>...
+     * Returns null for anything that is not a well-formed grafloria directive (a
+     * malformed one is simply ignored, never garbage).
+     */
+    private parseGrafloriaComment;
+    /**
+     * Parse style properties: fill:#f9f,stroke:#333,stroke-width:2
+     */
+    private parseStyleProperties;
+    /**
+     * Parse node ID
+     */
+    private parseNodeId;
+    /**
+     * Parse node shape and extract label
+     */
+    private parseNodeShape;
+    /**
+     * Parse text until a specific token type
+     */
+    private parseTextUntil;
+    /**
+     * Get link type from token type
+     */
+    private getLinkType;
+    /**
+     * Check if current token is a link token
+     */
+    private isLinkToken;
+    /**
+     * Check if current token starts a node shape
+     */
+    private isNodeShapeStart;
+    /**
+     * Token stream helpers
+     */
+    private match;
+    private check;
+    private checkSequence;
+    private advance;
+    private isAtEnd;
+    private peek;
+    private previous;
+    private currentToken;
+    private consume;
+    private consumeNewlines;
+    /** Consume everything up to (not including) the next newline. */
+    private skipLine;
+    /**
+     * Get source location from start and end tokens
+     */
+    private getLocation;
+}