@cristianormazabal/triton-core 0.1.0 → 0.1.2

package/dist/frontend/preprocess.js

@@ -0,0 +1,60 @@
+/**
+ * @file frontend/preprocess.ts — Source pre-processing before grammar dispatch.
+ *
+ * Central `%%` comment stripping so that every diagram family accepts comment
+ * lines without requiring per-grammar Comment rules.
+ */
+/**
+ * Strip full-line `%%` comments from Mermaid diagram source.
+ *
+ * ### Semantics (aligned with the 4 built-in grammars that handle `%%` natively)
+ *
+ * - **Full-line only:** a line is a comment iff its first non-whitespace
+ *   characters are `%%`. Such lines are removed entirely.
+ * - **No inline trailing comments:** `A --> B %% note` is NOT stripped. This
+ *   is the safe default — distinguishing a real trailing comment from `%%`
+ *   inside node labels such as `A["50%% off"]` is unsafe without a full parse.
+ *   The 4 grammars that already handle their own Comment rules continue to work
+ *   unchanged on the pre-stripped input.
+ * - **Frontmatter preserved:** if the input opens with a `---\n…\n---` YAML
+ *   frontmatter block, that block is passed through verbatim (YAML may contain
+ *   `%%` in values). Comment stripping applies only to the Mermaid body that
+ *   follows the closing fence.
+ * - **Pure-YAML inputs untouched:** if the first non-whitespace token is
+ *   `type:` (the Triton YAML path), the input is returned unchanged so that
+ *   `parseYaml` receives exactly what the author wrote.
+ */
+export function stripComments(input) {
+    const trimmed = input.trimStart();
+    // Pure-YAML path: do not strip — `%%` is not a YAML construct and may
+    // appear legitimately inside YAML string values.
+    if (/^type:\s/.test(trimmed))
+        return input;
+    // Frontmatter path: preserve the `---…---` block verbatim; strip comments
+    // only in the Mermaid body that follows.
+    if (trimmed.startsWith('---')) {
+        const fmMatch = trimmed.match(/^---\r?\n[\s\S]*?\r?\n---\r?\n?/);
+        if (fmMatch) {
+            const leadingWs = input.slice(0, input.length - trimmed.length);
+            const frontmatter = fmMatch[0];
+            const body = trimmed.slice(frontmatter.length);
+            return leadingWs + frontmatter + removeCommentLines(body);
+        }
+        // Malformed frontmatter (no closing `---`) — treat conservatively as
+        // YAML-ish and return untouched.
+        return input;
+    }
+    // Plain Mermaid text — strip comment lines from the entire input.
+    return removeCommentLines(input);
+}
+/**
+ * Remove every line whose first non-whitespace characters are `%%`.
+ * Lines are joined back with `\n`; `\r` characters within lines are preserved.
+ */
+function removeCommentLines(text) {
+    return text
+        .split('\n')
+        .filter(line => !/^\s*%%/.test(line))
+        .join('\n');
+}
+//# sourceMappingURL=preprocess.js.map

package/dist/frontend/preprocess.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"preprocess.js","sourceRoot":"","sources":["../../../../src/frontend/preprocess.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;IAElC,sEAAsE;IACtE,iDAAiD;IACjD,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IAE3C,0EAA0E;IAC1E,yCAAyC;IACzC,IAAI,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACjE,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAChE,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAC/C,OAAO,SAAS,GAAG,WAAW,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAC5D,CAAC;QACD,qEAAqE;QACrE,iCAAiC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kEAAkE;IAClE,OAAO,kBAAkB,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAAY;IACtC,OAAO,IAAI;SACR,KAAK,CAAC,IAAI,CAAC;SACX,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACpC,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC"}

package/dist/frontend/registry.js

@@ -0,0 +1,25 @@
+/**
+ * Diagram Registry
+ *
+ * Central registry of all available diagram modules.
+ * Built-in modules are registered in frontend/index.ts at startup.
+ * Third-party diagrams call registerDiagram() from their own package.
+ *
+ * The registry stores modules as DiagramModule<any> internally to handle
+ * the contravariance of layout()'s IR parameter. Type safety is preserved
+ * at registration time via the generic constraint on registerDiagram().
+ */
+const registry = new Map();
+/** Register a diagram module under the given kind key. */
+export function registerDiagram(kind, module) {
+    registry.set(kind, module);
+}
+/** Look up a registered diagram module by kind. Returns undefined if not found. */
+export function getModule(kind) {
+    return registry.get(kind);
+}
+/** Return all currently registered diagram kind strings. */
+export function registeredKinds() {
+    return [...registry.keys()];
+}
+//# sourceMappingURL=registry.js.map

package/dist/frontend/registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.js","sourceRoot":"","sources":["../../../../src/frontend/registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;AAEnD,0DAA0D;AAC1D,MAAM,UAAU,eAAe,CAC7B,IAAiB,EACjB,MAAyB;IAEzB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,MAAmB,CAAC,CAAC;AAC1C,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,SAAS,CAAC,IAAiB;IACzC,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,eAAe;IAC7B,OAAO,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;AAC9B,CAAC"}

package/dist/graph/connect.js

@@ -0,0 +1,44 @@
+/**
+ * @file graph/connect.ts — Edge endpoint helpers for node-link layouts.
+ */
+/**
+ * The point on a box's border along the ray from its centre toward (tx, ty).
+ * Used to clip connector lines to node boundaries.
+ */
+export function borderPoint(box, tx, ty) {
+    const cx = box.x + box.width / 2;
+    const cy = box.y + box.height / 2;
+    const dx = tx - cx;
+    const dy = ty - cy;
+    if (dx === 0 && dy === 0)
+        return { x: cx, y: cy };
+    const hw = box.width / 2;
+    const hh = box.height / 2;
+    const scale = 1 / Math.max(Math.abs(dx) / hw, Math.abs(dy) / hh);
+    return { x: cx + dx * scale, y: cy + dy * scale };
+}
+/** The midpoint of one side of a box — an explicit anchor for slot pointers. */
+export function slotAnchor(box, side) {
+    const cx = box.x + box.width / 2;
+    const cy = box.y + box.height / 2;
+    switch (side) {
+        case 'left': return { x: box.x, y: cy };
+        case 'right': return { x: box.x + box.width, y: cy };
+        case 'top': return { x: cx, y: box.y };
+        case 'bottom': return { x: cx, y: box.y + box.height };
+    }
+}
+/**
+ * A slot-aware connector: clips both ends to the box borders along the line
+ * joining their centres. Works for cells in a strip, nodes in a tree, or
+ * panels in a poster (the same router the cross-link feature uses).
+ */
+export function connectSlots(from, to) {
+    const fc = { x: from.x + from.width / 2, y: from.y + from.height / 2 };
+    const tc = { x: to.x + to.width / 2, y: to.y + to.height / 2 };
+    return {
+        start: borderPoint(from, tc.x, tc.y),
+        end: borderPoint(to, fc.x, fc.y),
+    };
+}
+//# sourceMappingURL=connect.js.map

package/dist/graph/connect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"connect.js","sourceRoot":"","sources":["../../../../src/graph/connect.ts"],"names":[],"mappings":"AAAA;;GAEG;AASH;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,GAAY,EAAE,EAAU,EAAE,EAAU;IAC9D,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;IAClD,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;IACjE,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;AACpD,CAAC;AAID,gFAAgF;AAChF,MAAM,UAAU,UAAU,CAAC,GAAY,EAAE,IAAU;IACjD,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IAClC,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC,CAAG,OAAO,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;QAC1C,KAAK,OAAO,CAAC,CAAE,OAAO,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;QACtD,KAAK,KAAK,CAAC,CAAI,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QAC1C,KAAK,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;IACzD,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAa,EAAE,EAAW;IAIrD,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;IACvE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;IAC/D,OAAO;QACL,KAAK,EAAE,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACpC,GAAG,EAAI,WAAW,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;KACnC,CAAC;AACJ,CAAC"}

package/dist/graph/layered.d.ts

@@ -1,12 +1,27 @@
 /**
- * @file graph/layered.ts — Minimal layered (Sugiyama-lite) graph placement.
+ * @file graph/layered.ts — Sugiyama layered graph placement kernel.
  *
- * Longest-path layering + size-aware coordinate assignment. Shared by the
- * node-link / UML diagram layouts (class, state, er; later c4/block/requirement)
- * so they don't each reinvent rank assignment. Edge routing is left to callers
- * (they connect the returned boxes via the routing module).
+ * Implements the full Sugiyama framework, with Phase 3 and Phase 4 ported
+ * faithfully from dagre (https://github.com/dagrejs/dagre):
+ *   1. Longest-path layer assignment
+ *   2a. DFS back-edge detection (proper cycle identification)
+ *   2b. Dummy node insertion for skip edges (spans > 1 layer)
+ *   3. Dagre-faithful crossing minimisation — DFS initOrder, bi-directional
+ *      barycenter sweeps with biasRight, dagre's sort() with unsortable-node
+ *      interleaving, BIT-based cross-count feedback loop; keeps best ordering seen
+ *   4. Dagre-faithful Brandes–Köpf coordinate assignment — type-1 conflict
+ *      detection, vertical alignment with NO isDummy guard (real↔dummy blocks),
+ *      horizontal compaction (block graph, two-pass), 4 sweep directions,
+ *      smallest-width selection, balance; plus our obstacle-aware dummy snap
+ *   5. Dummy node removal + bend point extraction (edgeBends on LayeredResult)
+ *
+ * Shared by the node-link / UML diagram layouts (class, state, er, c4,
+ * architecture, requirement, ds) so they all inherit crossing minimisation
+ * and improved coordinate assignment automatically. Edge routing is left to
+ * callers (they connect the returned boxes via the routing module).
  *
  * Deterministic: stable insertion order within a layer, no clock, no randomness.
+ * Termination guaranteed: crossing-min loop exits after 4 non-improving sweeps.
  */
 export interface GraphNode {
     readonly id: string;
@@ -38,6 +53,51 @@ export interface LayeredResult {
     readonly boxes: Map<string, NodeBox>;
     readonly width: number;
     readonly height: number;
+    /** Bend points for original skip edges (those that spanned > 1 layer).
+     *  Key = index into the original `edges` array passed to `layeredLayout`.
+     *  Value = ordered list of bend points in layout coordinates (no yOff applied). */
+    readonly edgeBends: Map<number, Array<{
+        x: number;
+        y: number;
+    }>>;
+    /**
+     * Per-dummy node x values from each of the 4 BK sweeps, BEFORE balance.
+     * Key = dummy node id. Value = [ul_x, ur_x, dl_x, dr_x].
+     * Only populated for dummy nodes that belong to skip-edge chains.
+     * Used by the skip-routing optimizer in layout.ts as seed candidates.
+     */
+    readonly dummySweepXs: Map<string, number[]>;
+    /**
+     * Map from original edge index → ordered dummy node ids forming the skip chain.
+     * Empty for direct (non-skip) edges.
+     */
+    readonly dummyChainIds: Map<number, string[]>;
 }
 export declare function layeredLayout(nodes: readonly GraphNode[], edges: readonly GraphEdge[], options?: LayeredOptions): LayeredResult;
+/**
+ * Route an edge between two node boxes with obstacle avoidance.
+ *
+ * If a straight line from `fromPt` to `toPt` is unobstructed, it is used
+ * directly. Otherwise the orthogonal router produces a bent path.
+ *
+ * @param fromBox   Source node box (in laid.boxes coordinates).
+ * @param toBox     Target node box (in laid.boxes coordinates).
+ * @param allBoxes  All node boxes in the diagram (obstacles are inferred from these).
+ * @param yOff      Vertical offset to apply (e.g. title height) when computing world coords.
+ * @param fromPt    Optional explicit source attachment point (overrides borderPoint).
+ * @param toPt      Optional explicit target attachment point (overrides borderPoint).
+ */
+export declare function routeEdge(fromBox: NodeBox, toBox: NodeBox, allBoxes: ReadonlyArray<NodeBox>, yOff?: number, fromPt?: {
+    x: number;
+    y: number;
+}, toPt?: {
+    x: number;
+    y: number;
+}, forceOrthogonal?: boolean): {
+    path: string;
+    labelMidpoint: {
+        x: number;
+        y: number;
+    };
+};
 //# sourceMappingURL=layered.d.ts.map

package/dist/graph/layered.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"layered.d.ts","sourceRoot":"","sources":["../../../../src/graph/layered.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,cAAc;IAC7B,8EAA8E;IAC9E,QAAQ,CAAC,SAAS,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC;IACjC,2CAA2C;IAC3C,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,qDAAqD;IACrD,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,yBAAyB;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAoBD,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,OAAO,GAAE,cAAmB,GAC3B,aAAa,CAiDf"}
+{"version":3,"file":"layered.d.ts","sourceRoot":"","sources":["../../../../src/graph/layered.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAMH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB;AAaD,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,cAAc;IAC7B,8EAA8E;IAC9E,QAAQ,CAAC,SAAS,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC;IACjC,2CAA2C;IAC3C,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,qDAAqD;IACrD,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,yBAAyB;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;uFAEmF;IACnF,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;IACjE;;;;;OAKG;IACH,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC7C;;;OAGG;IACH,QAAQ,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CAC/C;AAowBD,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,OAAO,GAAE,cAAmB,GAC3B,aAAa,CA0Gf;AA2CD;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CACvB,OAAO,EAAE,OAAO,EAChB,KAAK,EAAE,OAAO,EACd,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,EAChC,IAAI,SAAI,EACR,MAAM,CAAC,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EACjC,IAAI,CAAC,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,EAC/B,eAAe,UAAQ,GACtB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,CAAA;CAAE,CA2D3D"}