@graphrefly/graphrefly 0.45.0 → 0.46.0

package/dist/base/render/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/base/render/index.ts","../../../src/base/render/_ascii-width.ts","../../../src/base/render/_ascii-grid.ts","../../../src/base/render/_layout-sugiyama.ts","../../../src/base/render/graph-spec-to-ascii.ts","../../../src/base/render/_internal.ts","../../../src/base/render/graph-spec-to-d2.ts","../../../src/base/render/graph-spec-to-json.ts","../../../src/base/render/graph-spec-to-mermaid.ts","../../../src/base/render/graph-spec-to-mermaid-url.ts","../../../src/base/render/graph-spec-to-pretty.ts","../../../src/base/render/layout-frame-to-svg.ts"],"sourcesContent":["/**\n * Renderers barrel — pure functions over `GraphDescribeOutput` (Tier 2.1 A2).\n *\n * Each function takes a describe snapshot and returns a formatted string.\n * Compose with `derived` for live formatted output:\n *\n * ```ts\n * import { graphSpecToMermaid } from \"@graphrefly/graphrefly/extra/render\";\n * import { derived } from \"@graphrefly/graphrefly\";\n *\n * const live = derived(\n *   [graph.describe({ reactive: true }).node],\n *   ([g]) => graphSpecToMermaid(g),\n * );\n * ```\n *\n * Replaces the old `describe({ format })` dispatch — the `format` sugar option\n * was removed in the D1 three-layer-view refactor (pre-1.0 breaking, no shim).\n *\n * @module\n */\n\nexport type { DiagramDirection } from \"./_internal.js\";\nexport type { LayoutDirection } from \"./_layout-sugiyama.js\";\nexport { type GraphSpecToAsciiOptions, graphSpecToAscii } from \"./graph-spec-to-ascii.js\";\nexport { type GraphSpecToD2Options, graphSpecToD2 } from \"./graph-spec-to-d2.js\";\nexport { type GraphSpecToJsonOptions, graphSpecToJson } from \"./graph-spec-to-json.js\";\nexport { type GraphSpecToMermaidOptions, graphSpecToMermaid } from \"./graph-spec-to-mermaid.js\";\nexport {\n\ttype GraphSpecToMermaidUrlOptions,\n\tgraphSpecToMermaidUrl,\n\ttype MermaidLiveTheme,\n\tmermaidLiveUrl,\n} from \"./graph-spec-to-mermaid-url.js\";\nexport { type GraphSpecToPrettyOptions, graphSpecToPretty } from \"./graph-spec-to-pretty.js\";\nexport {\n\ttype LayoutFrameToSvgOptions,\n\tlayoutFrameToSvg,\n} from \"./layout-frame-to-svg.js\";\n","/**\n * Monospace-terminal cell-width utilities shared by the CLI measurement\n * adapter ([src/patterns/reactive-layout/measurement-adapters.ts](../patterns/reactive-layout/measurement-adapters.ts))\n * and the ASCII describe renderer ([graph-spec-to-ascii.ts](./graph-spec-to-ascii.ts)).\n *\n * Approximates UAX #11 East_Asian_Width (W/F → 2) plus known combining-mark\n * ranges (→ 0). Not a full EAW table — covers CJK, Hangul, fullwidth forms,\n * common emoji, and Extensions B-G. Does not handle ZWJ emoji sequences\n * (multi-codepoint clusters rendered as a single glyph) — terminal support\n * for those varies widely.\n */\n\nexport function cellWidth(code: number): 0 | 1 | 2 {\n\t// Combining marks (Mn, Mc, Me) → 0 cells\n\tif (\n\t\t(code >= 0x0300 && code <= 0x036f) || // Combining Diacritical Marks\n\t\t(code >= 0x0483 && code <= 0x0489) || // Cyrillic combining marks\n\t\t(code >= 0x0591 && code <= 0x05bd) || // Hebrew combining marks\n\t\t(code >= 0x0610 && code <= 0x061a) || // Arabic combining marks\n\t\t(code >= 0x064b && code <= 0x065f) || // Arabic combining marks\n\t\t(code >= 0x0670 && code === 0x0670) || // Arabic superscript alef\n\t\t(code >= 0x06d6 && code <= 0x06dc) || // Arabic combining marks\n\t\t(code >= 0x06df && code <= 0x06e4) || // Arabic combining marks\n\t\t(code >= 0x06e7 && code <= 0x06e8) || // Arabic combining marks\n\t\t(code >= 0x06ea && code <= 0x06ed) || // Arabic combining marks\n\t\t(code >= 0x0730 && code <= 0x074a) || // Syriac combining marks\n\t\t(code >= 0x07a6 && code <= 0x07b0) || // Thaana combining marks\n\t\t(code >= 0x0900 && code <= 0x0903) || // Devanagari combining marks\n\t\t(code >= 0x093a && code <= 0x094f) || // Devanagari combining marks\n\t\t(code >= 0x0951 && code <= 0x0957) || // Devanagari combining marks\n\t\t(code >= 0x0962 && code <= 0x0963) || // Devanagari combining marks\n\t\t(code >= 0x0981 && code <= 0x0983) || // Bengali combining marks\n\t\t(code >= 0x09bc && code <= 0x09cd) || // Bengali combining marks\n\t\t(code >= 0x0a01 && code <= 0x0a03) || // Gurmukhi combining marks\n\t\t(code >= 0x0a3c && code <= 0x0a51) || // Gurmukhi combining marks\n\t\t(code >= 0x0a70 && code <= 0x0a71) || // Gurmukhi combining marks\n\t\t(code >= 0x0a75 && code === 0x0a75) || // Gurmukhi combining mark\n\t\t(code >= 0x0e31 && code === 0x0e31) || // Thai combining mark\n\t\t(code >= 0x0e34 && code <= 0x0e3a) || // Thai combining marks\n\t\t(code >= 0x0e47 && code <= 0x0e4e) || // Thai combining marks\n\t\t(code >= 0x0eb1 && code === 0x0eb1) || // Lao combining mark\n\t\t(code >= 0x0eb4 && code <= 0x0ebc) || // Lao combining marks\n\t\t(code >= 0x0ec8 && code <= 0x0ece) || // Lao combining marks\n\t\t(code >= 0x1dc0 && code <= 0x1dff) || // Combining Diacritical Marks Supplement\n\t\t(code >= 0x20d0 && code <= 0x20ff) || // Combining Diacritical Marks for Symbols\n\t\t(code >= 0xfe00 && code <= 0xfe0f) || // Variation Selectors\n\t\t(code >= 0xfe20 && code <= 0xfe2f) || // Combining Half Marks\n\t\tcode === 0x200d // Zero Width Joiner\n\t) {\n\t\treturn 0;\n\t}\n\t// Wide / fullwidth → 2 cells\n\tif (\n\t\t(code >= 0x1100 && code <= 0x115f) || // Hangul Jamo\n\t\t(code >= 0x231a && code <= 0x231b) || // Watch, Hourglass\n\t\t(code >= 0x2329 && code <= 0x232a) || // Angle brackets\n\t\t(code >= 0x23e9 && code <= 0x23f3) || // Media control symbols\n\t\t(code >= 0x23f8 && code <= 0x23fa) || // Media control symbols\n\t\t(code >= 0x25fd && code <= 0x25fe) || // Medium squares\n\t\t(code >= 0x2614 && code <= 0x2615) || // Umbrella, Hot Beverage\n\t\t(code >= 0x2648 && code <= 0x2653) || // Zodiac symbols\n\t\tcode === 0x267f || // Wheelchair\n\t\tcode === 0x2693 || // Anchor\n\t\tcode === 0x26a1 || // High Voltage\n\t\t(code >= 0x26aa && code <= 0x26ab) || // Medium circles\n\t\t(code >= 0x26bd && code <= 0x26be) || // Soccer, Baseball\n\t\t(code >= 0x26c4 && code <= 0x26c5) || // Snowman, Sun behind cloud\n\t\tcode === 0x26ce || // Ophiuchus\n\t\tcode === 0x26d4 || // No Entry\n\t\tcode === 0x26ea || // Church\n\t\t(code >= 0x26f2 && code <= 0x26f3) || // Fountain, Golf\n\t\tcode === 0x26f5 || // Sailboat\n\t\tcode === 0x26fa || // Tent\n\t\tcode === 0x26fd || // Fuel Pump\n\t\tcode === 0x2702 || // Scissors\n\t\tcode === 0x2705 || // Check Mark\n\t\t(code >= 0x2708 && code <= 0x270d) || // Airplane...Writing Hand\n\t\tcode === 0x270f || // Pencil\n\t\t(code >= 0x2753 && code <= 0x2755) || // Question marks\n\t\tcode === 0x2757 || // Exclamation\n\t\t(code >= 0x2795 && code <= 0x2797) || // Plus, Minus, Divide\n\t\tcode === 0x27b0 || // Curly Loop\n\t\tcode === 0x27bf || // Double Curly Loop\n\t\t(code >= 0x2934 && code <= 0x2935) || // Arrows\n\t\t(code >= 0x2b05 && code <= 0x2b07) || // Arrows\n\t\t(code >= 0x2b1b && code <= 0x2b1c) || // Squares\n\t\tcode === 0x2b50 || // Star\n\t\tcode === 0x2b55 || // Circle\n\t\t(code >= 0x2e80 && code <= 0x303e) || // CJK Radicals, Symbols, Punctuation\n\t\t(code >= 0x3040 && code <= 0x309f) || // Hiragana\n\t\t(code >= 0x30a0 && code <= 0x30ff) || // Katakana\n\t\t(code >= 0x3105 && code <= 0x312f) || // Bopomofo\n\t\t(code >= 0x3131 && code <= 0x318e) || // Hangul Compatibility Jamo\n\t\t(code >= 0x3190 && code <= 0x31e3) || // Kanbun, CJK Strokes\n\t\t(code >= 0x31f0 && code <= 0x321e) || // Katakana Phonetic Extensions\n\t\t(code >= 0x3220 && code <= 0x3247) || // Enclosed CJK\n\t\t(code >= 0x3250 && code <= 0x4dbf) || // CJK Extensions + Unified block\n\t\t(code >= 0x4e00 && code <= 0x9fff) || // CJK Unified Ideographs\n\t\t(code >= 0xa960 && code <= 0xa97c) || // Hangul Jamo Extended-A\n\t\t(code >= 0xac00 && code <= 0xd7a3) || // Hangul Syllables\n\t\t(code >= 0xf900 && code <= 0xfaff) || // CJK Compatibility Ideographs\n\t\t(code >= 0xfe10 && code <= 0xfe19) || // Vertical forms\n\t\t(code >= 0xfe30 && code <= 0xfe6b) || // CJK Compatibility Forms\n\t\t(code >= 0xff01 && code <= 0xff60) || // Fullwidth Forms (excl. halfwidth)\n\t\t(code >= 0xffe0 && code <= 0xffe6) || // Fullwidth Signs\n\t\t(code >= 0x1f004 && code === 0x1f004) || // Mahjong Red Dragon\n\t\tcode === 0x1f0cf || // Joker\n\t\t(code >= 0x1f170 && code <= 0x1f171) || // A/B buttons\n\t\tcode === 0x1f17e || // O button\n\t\tcode === 0x1f17f || // P button\n\t\tcode === 0x1f18e || // AB button\n\t\t(code >= 0x1f191 && code <= 0x1f19a) || // Squared symbols\n\t\t(code >= 0x1f1e0 && code <= 0x1f1ff) || // Regional Indicator Symbols\n\t\t(code >= 0x1f200 && code <= 0x1f202) || // Enclosed ideographic\n\t\tcode === 0x1f21a || // Squared CJK\n\t\tcode === 0x1f22f || // Squared CJK\n\t\t(code >= 0x1f232 && code <= 0x1f23a) || // Squared CJK\n\t\t(code >= 0x1f250 && code <= 0x1f251) || // Circled ideographic\n\t\t(code >= 0x1f300 && code <= 0x1f9ff) || // Misc Symbols / Emoticons / Emoji\n\t\t(code >= 0x1fa00 && code <= 0x1faff) || // Chess, Symbols Extended-A\n\t\t(code >= 0x1fb00 && code <= 0x1fbff) || // Symbols for Legacy Computing\n\t\t(code >= 0x20000 && code <= 0x2fffd) || // CJK Extension B-F (excl. nonchars)\n\t\t(code >= 0x30000 && code <= 0x3fffd) // CJK Extension G+ (excl. nonchars)\n\t) {\n\t\treturn 2;\n\t}\n\treturn 1;\n}\n\n/**\n * Count total display cells for a string in a monospace terminal.\n *\n * Combining marks contribute 0 cells; CJK / fullwidth contribute 2.\n * Does not handle ZWJ emoji sequences.\n */\nexport function countCells(text: string): number {\n\tlet cells = 0;\n\tfor (const ch of text) {\n\t\tcells += cellWidth(ch.codePointAt(0)!);\n\t}\n\treturn cells;\n}\n\n/**\n * Truncate `text` to at most `maxCells` terminal cells, appending an ellipsis\n * (\"…\" → 1 cell) when truncation occurs. Grapheme-unaware — splits at\n * codepoints; ZWJ sequences may be cut mid-cluster.\n */\nexport function truncateToCells(text: string, maxCells: number): string {\n\tif (maxCells <= 0) return \"\";\n\tlet cells = 0;\n\tlet out = \"\";\n\tfor (const ch of text) {\n\t\tconst w = cellWidth(ch.codePointAt(0)!);\n\t\tif (cells + w > maxCells) {\n\t\t\tif (maxCells <= 1) return \"…\";\n\t\t\t// Drop last wide char if we'd exceed budget with the ellipsis\n\t\t\twhile (cells + 1 > maxCells && out.length > 0) {\n\t\t\t\tconst last = [...out].pop()!;\n\t\t\t\tout = out.slice(0, -last.length);\n\t\t\t\tcells -= cellWidth(last.codePointAt(0)!);\n\t\t\t}\n\t\t\treturn `${out}…`;\n\t\t}\n\t\tout += ch;\n\t\tcells += w;\n\t}\n\treturn out;\n}\n","/**\n * Character-grid blitter for the ASCII describe renderer.\n *\n * Given a [LayoutResult](./_layout-sugiyama.ts) (boxes + polyline edges on\n * an integer cell grid), produce a newline-joined string using Unicode\n * box-drawing glyphs (or plain ASCII when `charset: \"ascii\"` is requested).\n *\n * Invariants:\n *   - Multi-cell CJK labels still count as 2 cells via\n *     [_ascii-width.ts](./_ascii-width.ts).\n *   - Edge crossings (two segments perpendicular at the same cell) collapse\n *     to `┼` / `+`. Corner-vs-line collisions resolve to a corner glyph.\n *   - Boxes overwrite edge glyphs — boxes are blitted last so an edge that\n *     happens to pass under a box body is hidden.\n */\n\nimport { countCells } from \"./_ascii-width.js\";\nimport type { LayoutBox, LayoutEdge, LayoutResult } from \"./_layout-sugiyama.js\";\n\nexport type AsciiCharset = \"unicode\" | \"ascii\";\n\nexport type GridOptions = {\n\treadonly charset: AsciiCharset;\n\treadonly labelOf: (id: string) => string;\n};\n\ntype Glyphs = {\n\treadonly horizontal: string;\n\treadonly vertical: string;\n\treadonly cornerTL: string;\n\treadonly cornerTR: string;\n\treadonly cornerBL: string;\n\treadonly cornerBR: string;\n\treadonly tDown: string;\n\treadonly tUp: string;\n\treadonly tRight: string;\n\treadonly tLeft: string;\n\treadonly cross: string;\n\treadonly arrowRight: string;\n\treadonly arrowDown: string;\n\treadonly arrowLeft: string;\n\treadonly arrowUp: string;\n\treadonly boxTL: string;\n\treadonly boxTR: string;\n\treadonly boxBL: string;\n\treadonly boxBR: string;\n\treadonly boxH: string;\n\treadonly boxV: string;\n};\n\nconst UNICODE: Glyphs = {\n\thorizontal: \"─\",\n\tvertical: \"│\",\n\tcornerTL: \"┌\",\n\tcornerTR: \"┐\",\n\tcornerBL: \"└\",\n\tcornerBR: \"┘\",\n\ttDown: \"┬\",\n\ttUp: \"┴\",\n\ttRight: \"├\",\n\ttLeft: \"┤\",\n\tcross: \"┼\",\n\tarrowRight: \"▶\",\n\tarrowDown: \"▼\",\n\tarrowLeft: \"◀\",\n\tarrowUp: \"▲\",\n\tboxTL: \"┌\",\n\tboxTR: \"┐\",\n\tboxBL: \"└\",\n\tboxBR: \"┘\",\n\tboxH: \"─\",\n\tboxV: \"│\",\n};\n\nconst ASCII: Glyphs = {\n\thorizontal: \"-\",\n\tvertical: \"|\",\n\tcornerTL: \"+\",\n\tcornerTR: \"+\",\n\tcornerBL: \"+\",\n\tcornerBR: \"+\",\n\ttDown: \"+\",\n\ttUp: \"+\",\n\ttRight: \"+\",\n\ttLeft: \"+\",\n\tcross: \"+\",\n\tarrowRight: \">\",\n\tarrowDown: \"v\",\n\tarrowLeft: \"<\",\n\tarrowUp: \"^\",\n\tboxTL: \"+\",\n\tboxTR: \"+\",\n\tboxBL: \"+\",\n\tboxBR: \"+\",\n\tboxH: \"-\",\n\tboxV: \"|\",\n};\n\n// Set of glyphs considered \"edge lines\" when resolving collisions. A later\n// put() into an edge cell that conflicts produces `cross`; corners and\n// T-junctions are preserved (they carry more information).\ntype CellKind =\n\t| \"empty\"\n\t| \"boxH\"\n\t| \"boxV\"\n\t| \"boxCorner\"\n\t| \"edgeH\"\n\t| \"edgeV\"\n\t| \"edgeCorner\"\n\t| \"arrow\"\n\t| \"label\";\n\nexport function renderGrid(layout: LayoutResult, options: GridOptions): string {\n\tconst glyphs = options.charset === \"ascii\" ? ASCII : UNICODE;\n\tconst width = layout.width;\n\tconst height = layout.height;\n\tconst grid: string[][] = Array.from({ length: height }, () =>\n\t\tArray.from({ length: width }, () => \" \"),\n\t);\n\tconst kind: CellKind[][] = Array.from({ length: height }, () =>\n\t\tArray.from({ length: width }, () => \"empty\" as CellKind),\n\t);\n\n\t// 1. Draw edges first (boxes overwrite).\n\tfor (const edge of layout.edges) {\n\t\tdrawEdge(grid, kind, glyphs, edge);\n\t}\n\n\t// 2. Draw boxes on top.\n\tfor (const box of layout.boxes) {\n\t\tdrawBox(grid, kind, glyphs, box, options.labelOf(box.id));\n\t}\n\n\treturn grid.map((row) => stripTrailing(row.join(\"\"))).join(\"\\n\");\n}\n\n// ---------------------------------------------------------------------------\n// Box drawing\n// ---------------------------------------------------------------------------\n\nfunction drawBox(\n\tgrid: string[][],\n\tkind: CellKind[][],\n\tglyphs: Glyphs,\n\tbox: LayoutBox,\n\tlabel: string,\n): void {\n\tconst { x, y, w, h } = box;\n\tif (w < 2 || h < 2) {\n\t\t// Degenerate — just paint the label.\n\t\tif (h > 0) writeLabel(grid, kind, x, y, w, label);\n\t\treturn;\n\t}\n\t// Top border\n\tputBoxCell(grid, kind, x, y, glyphs.boxTL);\n\tfor (let cx = x + 1; cx < x + w - 1; cx += 1) putBoxCell(grid, kind, cx, y, glyphs.boxH);\n\tputBoxCell(grid, kind, x + w - 1, y, glyphs.boxTR);\n\t// Middle rows — side borders + content (only middle row carries the label)\n\tfor (let cy = y + 1; cy < y + h - 1; cy += 1) {\n\t\tputBoxCell(grid, kind, x, cy, glyphs.boxV);\n\t\tfor (let cx = x + 1; cx < x + w - 1; cx += 1) {\n\t\t\tputBoxCellAs(grid, kind, cx, cy, \" \", \"empty\");\n\t\t}\n\t\tputBoxCell(grid, kind, x + w - 1, cy, glyphs.boxV);\n\t}\n\t// Bottom border\n\tputBoxCell(grid, kind, x, y + h - 1, glyphs.boxBL);\n\tfor (let cx = x + 1; cx < x + w - 1; cx += 1) putBoxCell(grid, kind, cx, y + h - 1, glyphs.boxH);\n\tputBoxCell(grid, kind, x + w - 1, y + h - 1, glyphs.boxBR);\n\t// Label in vertical middle (h >= 3 expected)\n\tconst midY = y + Math.floor(h / 2);\n\twriteLabel(grid, kind, x + 1, midY, w - 2, label);\n}\n\nfunction putBoxCell(\n\tgrid: string[][],\n\tkind: CellKind[][],\n\tx: number,\n\ty: number,\n\tglyph: string,\n): void {\n\tconst k: CellKind =\n\t\tglyph === \" \"\n\t\t\t? \"empty\"\n\t\t\t: glyph === \"─\" || glyph === \"-\"\n\t\t\t\t? \"boxH\"\n\t\t\t\t: glyph === \"│\" || glyph === \"|\"\n\t\t\t\t\t? \"boxV\"\n\t\t\t\t\t: \"boxCorner\";\n\tputBoxCellAs(grid, kind, x, y, glyph, k);\n}\n\nfunction putBoxCellAs(\n\tgrid: string[][],\n\tkind: CellKind[][],\n\tx: number,\n\ty: number,\n\tglyph: string,\n\tk: CellKind,\n): void {\n\tif (y < 0 || y >= grid.length) return;\n\tconst row = grid[y]!;\n\tif (x < 0 || x >= row.length) return;\n\trow[x] = glyph;\n\tkind[y]![x] = k;\n}\n\nfunction writeLabel(\n\tgrid: string[][],\n\tkind: CellKind[][],\n\tx: number,\n\ty: number,\n\tmaxWidthCells: number,\n\tlabel: string,\n): void {\n\t// The grid is cell-indexed (one array slot per terminal cell). Wide\n\t// characters (CJK, fullwidth) occupy TWO cells visually; we store the\n\t// char in the first slot and an empty string in the second slot so\n\t// join(\"\") collapses to a single visible wide glyph and neighboring\n\t// writes don't add spurious narrow spaces next to the wide char.\n\tif (y < 0 || y >= grid.length) return;\n\tlet cursor = x;\n\tlet cellsLeft = maxWidthCells;\n\tfor (const ch of label) {\n\t\tconst cw = countCells(ch);\n\t\tif (cw === 0) continue;\n\t\tif (cellsLeft < cw) break;\n\t\tif (cursor >= 0 && cursor < grid[y]!.length) {\n\t\t\tgrid[y]![cursor] = ch;\n\t\t\tkind[y]![cursor] = \"label\";\n\t\t\tif (cw === 2 && cursor + 1 < grid[y]!.length) {\n\t\t\t\tgrid[y]![cursor + 1] = \"\";\n\t\t\t\tkind[y]![cursor + 1] = \"label\";\n\t\t\t}\n\t\t}\n\t\tcursor += cw;\n\t\tcellsLeft -= cw;\n\t}\n\t// Pad remaining cells with spaces so any edge glyphs lurking under the\n\t// box body don't leak into the label row.\n\twhile (cellsLeft > 0) {\n\t\tif (cursor >= 0 && cursor < grid[y]!.length) {\n\t\t\tgrid[y]![cursor] = \" \";\n\t\t\tkind[y]![cursor] = \"empty\";\n\t\t}\n\t\tcursor += 1;\n\t\tcellsLeft -= 1;\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// Edge drawing\n// ---------------------------------------------------------------------------\n\nfunction drawEdge(grid: string[][], kind: CellKind[][], glyphs: Glyphs, edge: LayoutEdge): void {\n\tconst pts = edge.points;\n\tif (pts.length < 2) return;\n\t// Draw segments\n\tfor (let i = 0; i + 1 < pts.length; i += 1) {\n\t\tdrawSegment(grid, kind, glyphs, pts[i]!, pts[i + 1]!);\n\t}\n\t// Draw corners at interior points\n\tfor (let i = 1; i + 1 < pts.length; i += 1) {\n\t\tconst a = pts[i - 1]!;\n\t\tconst b = pts[i]!;\n\t\tconst c = pts[i + 1]!;\n\t\tconst corner = cornerGlyph(a, b, c, glyphs);\n\t\tif (corner) putEdgeCell(grid, kind, b.x, b.y, corner, \"edgeCorner\");\n\t}\n\t// Arrow tip at the final point, aimed from the penultimate point.\n\t// Four cardinal directions — covers backward and upward tips produced\n\t// by routing past virtual nodes or dense-gutter fallbacks.\n\tconst tip = pts[pts.length - 1]!;\n\tconst prev = pts[pts.length - 2]!;\n\tconst arrow = arrowGlyph(prev, tip, glyphs);\n\tif (arrow) putEdgeCell(grid, kind, tip.x, tip.y, arrow, \"arrow\");\n}\n\nfunction drawSegment(\n\tgrid: string[][],\n\tkind: CellKind[][],\n\tglyphs: Glyphs,\n\ta: { x: number; y: number },\n\tb: { x: number; y: number },\n): void {\n\tif (a.x === b.x && a.y === b.y) return;\n\tif (a.y === b.y) {\n\t\t// Horizontal\n\t\tconst y = a.y;\n\t\tconst x0 = Math.min(a.x, b.x);\n\t\tconst x1 = Math.max(a.x, b.x);\n\t\tfor (let x = x0; x <= x1; x += 1) {\n\t\t\tputEdgeLine(grid, kind, x, y, glyphs, \"h\");\n\t\t}\n\t} else if (a.x === b.x) {\n\t\t// Vertical\n\t\tconst x = a.x;\n\t\tconst y0 = Math.min(a.y, b.y);\n\t\tconst y1 = Math.max(a.y, b.y);\n\t\tfor (let y = y0; y <= y1; y += 1) {\n\t\t\tputEdgeLine(grid, kind, x, y, glyphs, \"v\");\n\t\t}\n\t}\n\t// Diagonal shouldn't happen — routing is orthogonal.\n}\n\nfunction putEdgeLine(\n\tgrid: string[][],\n\tkind: CellKind[][],\n\tx: number,\n\ty: number,\n\tglyphs: Glyphs,\n\torientation: \"h\" | \"v\",\n): void {\n\tif (y < 0 || y >= grid.length) return;\n\tconst row = grid[y]!;\n\tif (x < 0 || x >= row.length) return;\n\tconst existing = kind[y]![x];\n\tif (\n\t\texisting === \"boxH\" ||\n\t\texisting === \"boxV\" ||\n\t\texisting === \"boxCorner\" ||\n\t\texisting === \"label\"\n\t) {\n\t\t// Box wins — do nothing. Boxes are drawn after edges, but if order\n\t\t// is reversed the edge must not clobber the box.\n\t\treturn;\n\t}\n\tif (existing === \"empty\") {\n\t\trow[x] = orientation === \"h\" ? glyphs.horizontal : glyphs.vertical;\n\t\tkind[y]![x] = orientation === \"h\" ? \"edgeH\" : \"edgeV\";\n\t\treturn;\n\t}\n\tif (existing === \"edgeH\" && orientation === \"v\") {\n\t\trow[x] = glyphs.cross;\n\t\tkind[y]![x] = \"edgeCorner\";\n\t\treturn;\n\t}\n\tif (existing === \"edgeV\" && orientation === \"h\") {\n\t\trow[x] = glyphs.cross;\n\t\tkind[y]![x] = \"edgeCorner\";\n\t\treturn;\n\t}\n\t// Same-orientation overlay: keep existing glyph.\n}\n\nfunction putEdgeCell(\n\tgrid: string[][],\n\tkind: CellKind[][],\n\tx: number,\n\ty: number,\n\tglyph: string,\n\tk: CellKind,\n): void {\n\tif (y < 0 || y >= grid.length) return;\n\tconst row = grid[y]!;\n\tif (x < 0 || x >= row.length) return;\n\tconst existing = kind[y]![x];\n\tif (\n\t\texisting === \"boxH\" ||\n\t\texisting === \"boxV\" ||\n\t\texisting === \"boxCorner\" ||\n\t\texisting === \"label\"\n\t)\n\t\treturn;\n\trow[x] = glyph;\n\tkind[y]![x] = k;\n}\n\n// ---------------------------------------------------------------------------\n// Corner + arrow glyph selection\n// ---------------------------------------------------------------------------\n\nfunction cornerGlyph(\n\ta: { x: number; y: number },\n\tb: { x: number; y: number },\n\tc: { x: number; y: number },\n\tglyphs: Glyphs,\n): string | undefined {\n\tconst inHoriz = a.y === b.y;\n\tconst outHoriz = b.y === c.y;\n\tif (inHoriz === outHoriz) return undefined; // not a turn\n\t// In from horizontal, out to vertical (or vice versa). Figure out which\n\t// of the four corners we're at.\n\tif (inHoriz) {\n\t\t// Coming from the left (a.x < b.x) or right (a.x > b.x)\n\t\tconst fromLeft = a.x < b.x;\n\t\tconst goingDown = c.y > b.y;\n\t\tif (fromLeft && goingDown) return glyphs.cornerTR;\n\t\tif (fromLeft && !goingDown) return glyphs.cornerBR;\n\t\tif (!fromLeft && goingDown) return glyphs.cornerTL;\n\t\treturn glyphs.cornerBL;\n\t}\n\t// Vertical in, horizontal out\n\tconst fromAbove = a.y < b.y;\n\tconst goingRight = c.x > b.x;\n\tif (fromAbove && goingRight) return glyphs.cornerBL;\n\tif (fromAbove && !goingRight) return glyphs.cornerBR;\n\tif (!fromAbove && goingRight) return glyphs.cornerTL;\n\treturn glyphs.cornerTR;\n}\n\nfunction arrowGlyph(\n\tprev: { x: number; y: number },\n\ttip: { x: number; y: number },\n\tglyphs: Glyphs,\n): string | undefined {\n\tif (tip.x > prev.x) return glyphs.arrowRight;\n\tif (tip.x < prev.x) return glyphs.arrowLeft;\n\tif (tip.y > prev.y) return glyphs.arrowDown;\n\tif (tip.y < prev.y) return glyphs.arrowUp;\n\treturn undefined; // zero-length segment — no tip\n}\n\n// ---------------------------------------------------------------------------\n// Output trimming\n// ---------------------------------------------------------------------------\n\nfunction stripTrailing(line: string): string {\n\t// Trim trailing spaces only; preserve internal grid alignment.\n\tlet end = line.length;\n\twhile (end > 0 && line.charCodeAt(end - 1) === 32) end -= 1;\n\treturn line.slice(0, end);\n}\n","/**\n * Sugiyama-style layered DAG layout on an integer grid.\n *\n * Pipeline:\n *   1. Longest-path layer assignment (sources at layer 0).\n *   2. Virtual-node splitting — every edge spanning more than one layer\n *      becomes a chain of synthetic nodes on intermediate layers. Downstream\n *      passes treat real and virtual nodes identically; crossing\n *      minimization therefore works on wide + deep DAGs, not only\n *      adjacent-layer cases.\n *   3. Crossing minimization — barycenter heuristic with alternating up /\n *      down sweeps plus an adjacent-transposition polish pass.\n *   4. Coordinate assignment — greedy median-aligned packing with collision\n *      resolution. Straightens vertical runs of virtual nodes so long edges\n *      become straight lines where topology allows.\n *   5. Orthogonal edge routing — per-gutter x-track assignment; horizontal\n *      segments sit at endpoint centerlines, vertical segments pack into the\n *      gutter column range without overlap. Remaining crossings are\n *      topologically unavoidable and will render as `┼` at draw time.\n *\n * Output coordinates are cell-grid integers (LR direction). TD rendering\n * swaps axes at draw time — the layout is direction-agnostic by\n * construction.\n *\n * Used only by [graph-spec-to-ascii.ts](./graph-spec-to-ascii.ts); not part of the public\n * `extra/render/index.ts` surface (underscore-prefixed).\n */\n\nexport type LayoutDirection = \"LR\" | \"TD\";\n\nexport type LayoutInput = {\n\t/** Node ids in stable iteration order. Determines initial tie-break. */\n\treadonly nodes: readonly string[];\n\t/** Edges by (from, to) path. Endpoints must be present in `nodes`. */\n\treadonly edges: ReadonlyArray<{ from: string; to: string }>;\n\t/** Label width in cells for each node (independent of direction). */\n\treadonly widthCells: (id: string) => number;\n\t/** Label height in cells for each node (independent of direction). */\n\treadonly heightCells: (id: string) => number;\n\t/**\n\t * Gap between layer \"columns\" (LR) or \"rows\" (TD), in cells.\n\t * Must allow enough room for per-gutter edge tracks.\n\t */\n\treadonly layerGap: number;\n\t/**\n\t * Gap between neighboring nodes *within* a layer, in cells.\n\t * LR: vertical gap; TD: horizontal gap.\n\t */\n\treadonly nodeGap: number;\n\t/**\n\t * Axis orientation. LR: layers = columns (x grows), order = rows (y grows).\n\t * TD: layers = rows (y grows), order = columns (x grows).\n\t */\n\treadonly direction: LayoutDirection;\n};\n\nexport type LayoutBox = {\n\treadonly id: string;\n\treadonly layer: number;\n\treadonly order: number;\n\treadonly x: number;\n\treadonly y: number;\n\treadonly w: number;\n\treadonly h: number;\n};\n\nexport type LayoutEdgePoint = { readonly x: number; readonly y: number };\n\nexport type LayoutEdge = {\n\treadonly from: string;\n\treadonly to: string;\n\t/** Polyline of waypoints (start → corners → end). Minimum 2 entries. */\n\treadonly points: readonly LayoutEdgePoint[];\n};\n\nexport type LayoutResult = {\n\treadonly boxes: readonly LayoutBox[];\n\treadonly edges: readonly LayoutEdge[];\n\treadonly width: number;\n\treadonly height: number;\n};\n\n// ---------------------------------------------------------------------------\n// Internal types — carried through the pipeline\n// ---------------------------------------------------------------------------\n\ntype Hop = {\n\tchainId: number;\n\tchainFrom: string;\n\tchainTo: string;\n\tfromId: string;\n\ttoId: string;\n\t/** 0-based hop index along the chain. */\n\thopIndex: number;\n\t/** Total hops in the chain (1 = direct, 2+ = spans virtuals). */\n\tchainLen: number;\n};\n\ntype InternalNode = {\n\tid: string;\n\tisVirtual: boolean;\n\tlayer: number;\n\torder: number;\n\tx: number;\n\ty: number;\n\tw: number;\n\th: number;\n\tin: Hop[];\n\tout: Hop[];\n};\n\ntype Layer = InternalNode[];\n\ntype PipelineState = {\n\tnodes: Map<string, InternalNode>;\n\tlayers: Layer[];\n\thops: Hop[];\n};\n\n// ---------------------------------------------------------------------------\n// Pipeline entry\n// ---------------------------------------------------------------------------\n\nexport function sugiyamaLayout(input: LayoutInput): LayoutResult {\n\tconst state = buildInitial(input);\n\tassignLayers(state);\n\tinsertVirtualNodes(state);\n\tminimizeCrossings(state);\n\tassignCoordinates(state, input);\n\tconst edges = routeEdges(state, input);\n\tconst { width, height } = boundingBox(state);\n\tconst boxes: LayoutBox[] = [];\n\tfor (const layer of state.layers) {\n\t\tfor (const n of layer) {\n\t\t\tif (n.isVirtual) continue;\n\t\t\tboxes.push({\n\t\t\t\tid: n.id,\n\t\t\t\tlayer: n.layer,\n\t\t\t\torder: n.order,\n\t\t\t\tx: n.x,\n\t\t\t\ty: n.y,\n\t\t\t\tw: n.w,\n\t\t\t\th: n.h,\n\t\t\t});\n\t\t}\n\t}\n\treturn { boxes, edges, width, height };\n}\n\n// ---------------------------------------------------------------------------\n// 1. Build internal graph\n// ---------------------------------------------------------------------------\n\nfunction buildInitial(input: LayoutInput): PipelineState {\n\tconst nodes = new Map<string, InternalNode>();\n\tfor (const id of input.nodes) {\n\t\tnodes.set(id, {\n\t\t\tid,\n\t\t\tisVirtual: false,\n\t\t\tlayer: -1,\n\t\t\torder: 0,\n\t\t\tx: 0,\n\t\t\ty: 0,\n\t\t\tw: input.widthCells(id),\n\t\t\th: input.heightCells(id),\n\t\t\tin: [],\n\t\t\tout: [],\n\t\t});\n\t}\n\tconst hops: Hop[] = [];\n\tlet chainId = 0;\n\tfor (const e of input.edges) {\n\t\tif (e.from === e.to) continue; // drop self-loops\n\t\tconst f = nodes.get(e.from);\n\t\tconst t = nodes.get(e.to);\n\t\tif (!f || !t) continue; // drop dangling endpoints\n\t\tconst hop: Hop = {\n\t\t\tchainId: chainId++,\n\t\t\tchainFrom: e.from,\n\t\t\tchainTo: e.to,\n\t\t\tfromId: e.from,\n\t\t\ttoId: e.to,\n\t\t\thopIndex: 0,\n\t\t\tchainLen: 1,\n\t\t};\n\t\tf.out.push(hop);\n\t\tt.in.push(hop);\n\t\thops.push(hop);\n\t}\n\treturn { nodes, layers: [], hops };\n}\n\n// ---------------------------------------------------------------------------\n// 2. Longest-path layer assignment (Kahn's algorithm)\n// ---------------------------------------------------------------------------\n\nfunction assignLayers(state: PipelineState): void {\n\tconst indeg = new Map<string, number>();\n\tfor (const n of state.nodes.values()) indeg.set(n.id, n.in.length);\n\n\tconst queue: InternalNode[] = [];\n\tfor (const n of state.nodes.values()) {\n\t\tif ((indeg.get(n.id) ?? 0) === 0) {\n\t\t\tn.layer = 0;\n\t\t\tqueue.push(n);\n\t\t}\n\t}\n\n\t// Cursor-based BFS — `Array.prototype.shift` is O(n), so the naive form\n\t// is O(n²) and degrades past ~1000 nodes. Cursor keeps it linear.\n\tconst visited = new Set<string>();\n\tlet head = 0;\n\twhile (head < queue.length) {\n\t\tconst n = queue[head++]!;\n\t\tif (visited.has(n.id)) continue;\n\t\tvisited.add(n.id);\n\t\tfor (const hop of n.out) {\n\t\t\tconst t = state.nodes.get(hop.toId)!;\n\t\t\tt.layer = Math.max(t.layer, n.layer + 1);\n\t\t\tconst d = (indeg.get(t.id) ?? 0) - 1;\n\t\t\tindeg.set(t.id, d);\n\t\t\tif (d <= 0) queue.push(t);\n\t\t}\n\t}\n\t// Nodes trapped in a cycle default to layer 0. The edges that would\n\t// close the cycle are dropped in `insertVirtualNodes` (any hop whose\n\t// span is not a positive integer). GraphReFly graphs are DAGs by spec;\n\t// this path is defensive against malformed describe snapshots.\n\tfor (const n of state.nodes.values()) if (n.layer < 0) n.layer = 0;\n}\n\n// ---------------------------------------------------------------------------\n// 3. Virtual-node insertion — critical for scaling past adjacent-layer edges\n// ---------------------------------------------------------------------------\n\nfunction insertVirtualNodes(state: PipelineState): void {\n\tconst maxLayer = Math.max(0, ...Array.from(state.nodes.values(), (n) => n.layer));\n\tconst layers: Layer[] = Array.from({ length: maxLayer + 1 }, () => []);\n\tfor (const n of state.nodes.values()) layers[n.layer]!.push(n);\n\n\tconst newHops: Hop[] = [];\n\tlet virtCounter = 0;\n\tfor (const hop of state.hops) {\n\t\tconst f = state.nodes.get(hop.fromId)!;\n\t\tconst t = state.nodes.get(hop.toId)!;\n\t\tconst span = t.layer - f.layer;\n\t\tif (span <= 0) {\n\t\t\t// Same-layer or back-edge — the input violated the DAG invariant\n\t\t\t// (self-loop was already dropped in `buildInitial`; this catches\n\t\t\t// cycles whose nodes collapsed to layer 0 in `assignLayers`).\n\t\t\t// Drop from both endpoints so routing never sees the hop; same\n\t\t\t// render-best-effort policy as the self-loop / dangling-endpoint\n\t\t\t// filters in `buildInitial`.\n\t\t\tf.out = f.out.filter((h) => h !== hop);\n\t\t\tt.in = t.in.filter((h) => h !== hop);\n\t\t\tcontinue;\n\t\t}\n\t\tif (span === 1) {\n\t\t\thop.hopIndex = 0;\n\t\t\thop.chainLen = 1;\n\t\t\tnewHops.push(hop);\n\t\t\tcontinue;\n\t\t}\n\t\t// Multi-hop: f → v1 → v2 → ... → t\n\t\t// Detach the original edge from f.out / t.in; we rewrite as chain.\n\t\tf.out = f.out.filter((h) => h !== hop);\n\t\tt.in = t.in.filter((h) => h !== hop);\n\n\t\tlet prev = f;\n\t\tfor (let i = 1; i < span; i += 1) {\n\t\t\tconst vid = `__virt_${virtCounter++}__`;\n\t\t\tconst v: InternalNode = {\n\t\t\t\tid: vid,\n\t\t\t\tisVirtual: true,\n\t\t\t\tlayer: f.layer + i,\n\t\t\t\torder: 0,\n\t\t\t\tx: 0,\n\t\t\t\ty: 0,\n\t\t\t\tw: 0,\n\t\t\t\th: 1,\n\t\t\t\tin: [],\n\t\t\t\tout: [],\n\t\t\t};\n\t\t\tstate.nodes.set(vid, v);\n\t\t\tlayers[v.layer]!.push(v);\n\t\t\tconst h: Hop = {\n\t\t\t\tchainId: hop.chainId,\n\t\t\t\tchainFrom: hop.chainFrom,\n\t\t\t\tchainTo: hop.chainTo,\n\t\t\t\tfromId: prev.id,\n\t\t\t\ttoId: vid,\n\t\t\t\thopIndex: i - 1,\n\t\t\t\tchainLen: span,\n\t\t\t};\n\t\t\tprev.out.push(h);\n\t\t\tv.in.push(h);\n\t\t\tnewHops.push(h);\n\t\t\tprev = v;\n\t\t}\n\t\tconst finalHop: Hop = {\n\t\t\tchainId: hop.chainId,\n\t\t\tchainFrom: hop.chainFrom,\n\t\t\tchainTo: hop.chainTo,\n\t\t\tfromId: prev.id,\n\t\t\ttoId: t.id,\n\t\t\thopIndex: span - 1,\n\t\t\tchainLen: span,\n\t\t};\n\t\tprev.out.push(finalHop);\n\t\tt.in.push(finalHop);\n\t\tnewHops.push(finalHop);\n\t}\n\n\t// Stable initial order within each layer.\n\tfor (const layer of layers) {\n\t\tfor (let i = 0; i < layer.length; i += 1) layer[i]!.order = i;\n\t}\n\tstate.layers = layers;\n\tstate.hops = newHops;\n}\n\n// ---------------------------------------------------------------------------\n// 4. Crossing minimization\n// ---------------------------------------------------------------------------\n\nfunction minimizeCrossings(state: PipelineState): void {\n\tconst SWEEPS = 4;\n\tfor (let sweep = 0; sweep < SWEEPS; sweep += 1) {\n\t\t// Down-sweep\n\t\tfor (let li = 1; li < state.layers.length; li += 1) {\n\t\t\tsortByBarycenter(state, state.layers[li]!, \"in\");\n\t\t\treindex(state.layers[li]!);\n\t\t}\n\t\t// Up-sweep\n\t\tfor (let li = state.layers.length - 2; li >= 0; li -= 1) {\n\t\t\tsortByBarycenter(state, state.layers[li]!, \"out\");\n\t\t\treindex(state.layers[li]!);\n\t\t}\n\t}\n\t// Polish — adjacent-transposition pass, bounded iterations.\n\tfor (let iter = 0; iter < 2; iter += 1) {\n\t\tlet improved = false;\n\t\tfor (let li = 1; li < state.layers.length; li += 1) {\n\t\t\tconst layer = state.layers[li]!;\n\t\t\tfor (let i = 0; i + 1 < layer.length; i += 1) {\n\t\t\t\tconst before = pairCrossings(state, layer[i]!, layer[i + 1]!, \"in\");\n\t\t\t\t[layer[i], layer[i + 1]] = [layer[i + 1]!, layer[i]!];\n\t\t\t\treindex(layer);\n\t\t\t\tconst after = pairCrossings(state, layer[i]!, layer[i + 1]!, \"in\");\n\t\t\t\tif (after < before) {\n\t\t\t\t\timproved = true;\n\t\t\t\t} else {\n\t\t\t\t\t[layer[i], layer[i + 1]] = [layer[i + 1]!, layer[i]!];\n\t\t\t\t\treindex(layer);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!improved) break;\n\t}\n}\n\nfunction sortByBarycenter(state: PipelineState, layer: Layer, direction: \"in\" | \"out\"): void {\n\tconst bary = new Map<string, number>();\n\tfor (const n of layer) {\n\t\tconst neighbors = direction === \"in\" ? n.in : n.out;\n\t\tif (neighbors.length === 0) {\n\t\t\tbary.set(n.id, n.order);\n\t\t\tcontinue;\n\t\t}\n\t\tlet sum = 0;\n\t\tlet count = 0;\n\t\tfor (const h of neighbors) {\n\t\t\tconst other = state.nodes.get(direction === \"in\" ? h.fromId : h.toId);\n\t\t\tif (!other) continue;\n\t\t\tsum += other.order;\n\t\t\tcount += 1;\n\t\t}\n\t\tbary.set(n.id, count === 0 ? n.order : sum / count);\n\t}\n\tlayer.sort((a, b) => {\n\t\tconst ba = bary.get(a.id)!;\n\t\tconst bb = bary.get(b.id)!;\n\t\tif (ba !== bb) return ba - bb;\n\t\treturn a.order - b.order;\n\t});\n}\n\nfunction reindex(layer: Layer): void {\n\tfor (let i = 0; i < layer.length; i += 1) layer[i]!.order = i;\n}\n\nfunction pairCrossings(\n\tstate: PipelineState,\n\ta: InternalNode,\n\tb: InternalNode,\n\tdirection: \"in\" | \"out\",\n): number {\n\tconst aEdges = direction === \"in\" ? a.in : a.out;\n\tconst bEdges = direction === \"in\" ? b.in : b.out;\n\tlet crossings = 0;\n\tfor (const ea of aEdges) {\n\t\tfor (const eb of bEdges) {\n\t\t\tconst oa = state.nodes.get(direction === \"in\" ? ea.fromId : ea.toId)?.order ?? 0;\n\t\t\tconst ob = state.nodes.get(direction === \"in\" ? eb.fromId : eb.toId)?.order ?? 0;\n\t\t\tif ((a.order < b.order && oa > ob) || (a.order > b.order && oa < ob)) {\n\t\t\t\tcrossings += 1;\n\t\t\t}\n\t\t}\n\t}\n\treturn crossings;\n}\n\n// ---------------------------------------------------------------------------\n// 5. Coordinate assignment (direction-aware)\n// ---------------------------------------------------------------------------\n\nfunction assignCoordinates(state: PipelineState, input: LayoutInput): void {\n\tif (input.direction === \"LR\") assignCoordinatesLR(state, input);\n\telse assignCoordinatesTD(state, input);\n}\n\nfunction assignCoordinatesLR(state: PipelineState, input: LayoutInput): void {\n\t// x: per-layer column based on cumulative max width.\n\tconst layerX: number[] = [];\n\tlet cursorX = 0;\n\tfor (let li = 0; li < state.layers.length; li += 1) {\n\t\tlayerX.push(cursorX);\n\t\tlet maxW = 0;\n\t\tfor (const n of state.layers[li]!) maxW = Math.max(maxW, n.w);\n\t\tcursorX += maxW + input.layerGap;\n\t}\n\tfor (let li = 0; li < state.layers.length; li += 1) {\n\t\tfor (const n of state.layers[li]!) n.x = layerX[li]!;\n\t}\n\t// y: greedy pack per layer.\n\tfor (const layer of state.layers) {\n\t\tlet y = 0;\n\t\tfor (const n of layer) {\n\t\t\tn.y = y;\n\t\t\ty += n.h + input.nodeGap;\n\t\t}\n\t}\n\t// Median alignment — straightens chains through virtuals.\n\trunMedianPasses(state, input, \"y\");\n}\n\nfunction assignCoordinatesTD(state: PipelineState, input: LayoutInput): void {\n\t// y: per-layer row based on cumulative max height.\n\tconst layerY: number[] = [];\n\tlet cursorY = 0;\n\tfor (let li = 0; li < state.layers.length; li += 1) {\n\t\tlayerY.push(cursorY);\n\t\tlet maxH = 0;\n\t\tfor (const n of state.layers[li]!) maxH = Math.max(maxH, n.h);\n\t\tcursorY += maxH + input.layerGap;\n\t}\n\tfor (let li = 0; li < state.layers.length; li += 1) {\n\t\tfor (const n of state.layers[li]!) n.y = layerY[li]!;\n\t}\n\t// x: greedy pack per layer.\n\tfor (const layer of state.layers) {\n\t\tlet x = 0;\n\t\tfor (const n of layer) {\n\t\t\tn.x = x;\n\t\t\tx += n.w + input.nodeGap;\n\t\t}\n\t}\n\trunMedianPasses(state, input, \"x\");\n}\n\n/**\n * Median alignment passes — pulls each node toward the median position of\n * its in-layer neighbors along the private axis (\"y\" for LR, \"x\" for TD),\n * then resolves collisions greedily while preserving layer order.\n */\nfunction runMedianPasses(state: PipelineState, input: LayoutInput, axis: \"x\" | \"y\"): void {\n\tconst sizeOf = (n: InternalNode) => (axis === \"y\" ? n.h : n.w);\n\tconst gap = input.nodeGap;\n\tfor (let pass = 0; pass < 2; pass += 1) {\n\t\tconst walk = pass === 0 ? state.layers.slice(1) : state.layers.slice(0, -1).reverse();\n\t\tfor (const layer of walk) {\n\t\t\tconst preferred = new Map<string, number>();\n\t\t\tfor (const n of layer) {\n\t\t\t\tconst neighbors = pass === 0 ? n.in : n.out;\n\t\t\t\tif (neighbors.length === 0) continue;\n\t\t\t\tconst centers: number[] = [];\n\t\t\t\tfor (const h of neighbors) {\n\t\t\t\t\tconst other = state.nodes.get(pass === 0 ? h.fromId : h.toId);\n\t\t\t\t\tif (!other) continue;\n\t\t\t\t\tconst base = axis === \"y\" ? other.y : other.x;\n\t\t\t\t\tcenters.push(base + Math.floor(sizeOf(other) / 2));\n\t\t\t\t}\n\t\t\t\tif (centers.length === 0) continue;\n\t\t\t\tcenters.sort((a, b) => a - b);\n\t\t\t\tconst mid = centers[Math.floor(centers.length / 2)]!;\n\t\t\t\tpreferred.set(n.id, mid - Math.floor(sizeOf(n) / 2));\n\t\t\t}\n\t\t\tlet floor = 0;\n\t\t\tfor (const n of layer) {\n\t\t\t\tconst p = preferred.get(n.id);\n\t\t\t\tconst current = axis === \"y\" ? n.y : n.x;\n\t\t\t\tconst target = p ?? current;\n\t\t\t\tconst clamped = Math.max(target, floor);\n\t\t\t\tif (axis === \"y\") n.y = clamped;\n\t\t\t\telse n.x = clamped;\n\t\t\t\tfloor = clamped + sizeOf(n) + gap;\n\t\t\t}\n\t\t}\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// 6. Orthogonal edge routing (direction-aware)\n//\n// For both LR and TD the algorithm is symmetric — it just operates on a\n// different pair of \"primary\" vs \"cross\" axes:\n//\n//   LR: primary = x (layer axis); cross = y. Gutters are vertical strips\n//       between columns; tracks within a gutter are distinct x-values.\n//   TD: primary = y (layer axis); cross = x. Gutters are horizontal strips\n//       between rows; tracks within a gutter are distinct y-values.\n// ---------------------------------------------------------------------------\n\nfunction routeEdges(state: PipelineState, input: LayoutInput): LayoutEdge[] {\n\t// Group hops by chainId → one LayoutEdge per user-facing edge.\n\tconst byChain = new Map<number, Hop[]>();\n\tfor (const h of state.hops) {\n\t\tconst arr = byChain.get(h.chainId);\n\t\tif (arr) arr.push(h);\n\t\telse byChain.set(h.chainId, [h]);\n\t}\n\tfor (const arr of byChain.values()) arr.sort((a, b) => a.hopIndex - b.hopIndex);\n\n\tconst isLR = input.direction === \"LR\";\n\tconst primary = (n: InternalNode): number => (isLR ? n.x : n.y);\n\tconst primarySize = (n: InternalNode): number => (isLR ? n.w : n.h);\n\tconst crossCenter = (n: InternalNode): number =>\n\t\tisLR ? n.y + Math.floor(n.h / 2) : n.x + Math.floor(n.w / 2);\n\n\t// Per-gutter cross-axis track assignment. Two passes:\n\t//   1. Assign each hop to a track INDEX using disjoint-interval packing\n\t//      (an existing track may host multiple hops as long as their\n\t//      cross-axis ranges don't overlap pairwise).\n\t//   2. Map each track index to a primary-axis position using the final\n\t//      track count so the distribution is uniform across the gutter —\n\t//      per-hop recomputation (old behavior) collapsed late tracks onto\n\t//      `gEnd`, producing bundled overlaps in dense gutters.\n\tconst hopTrackCross = new Map<Hop, number>();\n\tfor (let g = 0; g + 1 < state.layers.length; g += 1) {\n\t\tconst srcLayer = state.layers[g]!;\n\t\tconst dstLayer = state.layers[g + 1]!;\n\n\t\tlet gutterStart = 0;\n\t\tfor (const n of srcLayer) gutterStart = Math.max(gutterStart, primary(n) + primarySize(n));\n\t\tlet gutterEnd = Number.POSITIVE_INFINITY;\n\t\tfor (const n of dstLayer) gutterEnd = Math.min(gutterEnd, primary(n));\n\t\tconst gEnd = Number.isFinite(gutterEnd) ? (gutterEnd as number) - 1 : gutterStart;\n\t\tconst gutterWidth = Math.max(1, gEnd - gutterStart + 1);\n\n\t\tconst gutterHops: Hop[] = [];\n\t\tfor (const n of srcLayer) for (const h of n.out) gutterHops.push(h);\n\t\tgutterHops.sort((a, b) => {\n\t\t\tconst sa = crossCenter(state.nodes.get(a.fromId)!);\n\t\t\tconst sb = crossCenter(state.nodes.get(b.fromId)!);\n\t\t\tif (sa !== sb) return sa - sb;\n\t\t\tconst da = crossCenter(state.nodes.get(a.toId)!);\n\t\t\tconst db = crossCenter(state.nodes.get(b.toId)!);\n\t\t\treturn da - db;\n\t\t});\n\n\t\t// Pass 1: assign track indexes. Each track is an ARRAY of disjoint\n\t\t// intervals — two hops share a track iff their cross-axis ranges\n\t\t// don't overlap any existing interval on that track.\n\t\tconst tracks: Array<Array<{ lo: number; hi: number }>> = [];\n\t\tconst hopToTrackIdx = new Map<Hop, number>();\n\t\tfor (const h of gutterHops) {\n\t\t\tconst sc = crossCenter(state.nodes.get(h.fromId)!);\n\t\t\tconst dc = crossCenter(state.nodes.get(h.toId)!);\n\t\t\tconst lo = Math.min(sc, dc);\n\t\t\tconst hi = Math.max(sc, dc);\n\t\t\tlet idx = -1;\n\t\t\tfor (let t = 0; t < tracks.length; t += 1) {\n\t\t\t\tconst intervals = tracks[t]!;\n\t\t\t\tlet fits = true;\n\t\t\t\tfor (const iv of intervals) {\n\t\t\t\t\tif (iv.lo <= hi && lo <= iv.hi) {\n\t\t\t\t\t\tfits = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (fits) {\n\t\t\t\t\tintervals.push({ lo, hi });\n\t\t\t\t\tidx = t;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (idx < 0) {\n\t\t\t\ttracks.push([{ lo, hi }]);\n\t\t\t\tidx = tracks.length - 1;\n\t\t\t}\n\t\t\thopToTrackIdx.set(h, idx);\n\t\t}\n\n\t\t// Pass 2: distribute track indexes uniformly across the gutter's\n\t\t// **interior** (reserve 1-cell margin from each boundary when the\n\t\t// gutter is wide enough). A track placed exactly at `gutterStart`\n\t\t// or `gEnd` collapses the final turn-segment into the adjacent\n\t\t// node's border row, producing a visually misleading arrow; the\n\t\t// margin avoids that whenever geometry allows.\n\t\tconst count = tracks.length;\n\t\tconst hasMargin = gutterWidth >= Math.max(3, count + 2);\n\t\tconst usableStart = hasMargin ? gutterStart + 1 : gutterStart;\n\t\tconst usableEnd = hasMargin ? gEnd - 1 : gEnd;\n\t\tconst usableWidth = Math.max(1, usableEnd - usableStart + 1);\n\t\tfor (const h of gutterHops) {\n\t\t\tconst idx = hopToTrackIdx.get(h)!;\n\t\t\tlet trackPrimary: number;\n\t\t\tif (count <= 1) {\n\t\t\t\ttrackPrimary = usableStart + Math.floor(usableWidth / 2);\n\t\t\t} else {\n\t\t\t\tconst step = (usableWidth - 1) / (count - 1);\n\t\t\t\ttrackPrimary = usableStart + Math.floor(idx * step);\n\t\t\t}\n\t\t\thopTrackCross.set(h, Math.max(gutterStart, Math.min(gEnd, trackPrimary)));\n\t\t}\n\t}\n\n\t// Build polylines.\n\tconst out: LayoutEdge[] = [];\n\tfor (const [, hops] of byChain) {\n\t\tconst points: LayoutEdgePoint[] = [];\n\t\tfor (let i = 0; i < hops.length; i += 1) {\n\t\t\tconst h = hops[i]!;\n\t\t\tconst src = state.nodes.get(h.fromId)!;\n\t\t\tconst dst = state.nodes.get(h.toId)!;\n\t\t\tconst track = hopTrackCross.get(h)!;\n\t\t\t// Endpoints in (primary, cross) space.\n\t\t\tconst srcPrimary = src.isVirtual ? primary(src) : primary(src) + primarySize(src);\n\t\t\tconst dstPrimary = dst.isVirtual ? primary(dst) : primary(dst) - 1;\n\t\t\tconst sc = crossCenter(src);\n\t\t\tconst dc = crossCenter(dst);\n\t\t\tif (i === 0) pushPoint(points, isLR, srcPrimary, sc);\n\t\t\tif (sc !== dc) {\n\t\t\t\tpushPoint(points, isLR, track, sc);\n\t\t\t\tpushPoint(points, isLR, track, dc);\n\t\t\t}\n\t\t\tpushPoint(points, isLR, dstPrimary, dc);\n\t\t}\n\t\tconst chain = hops[0]!;\n\t\tout.push({\n\t\t\tfrom: chain.chainFrom,\n\t\t\tto: chain.chainTo,\n\t\t\tpoints: dedupWaypoints(points),\n\t\t});\n\t}\n\treturn out;\n}\n\nfunction pushPoint(acc: LayoutEdgePoint[], isLR: boolean, primary: number, cross: number): void {\n\tacc.push(isLR ? { x: primary, y: cross } : { x: cross, y: primary });\n}\n\nfunction dedupWaypoints(points: readonly LayoutEdgePoint[]): LayoutEdgePoint[] {\n\tconst out: LayoutEdgePoint[] = [];\n\tfor (const p of points) {\n\t\tconst last = out[out.length - 1];\n\t\tif (!last || last.x !== p.x || last.y !== p.y) out.push(p);\n\t}\n\treturn out;\n}\n\n// ---------------------------------------------------------------------------\n// Bounding box\n// ---------------------------------------------------------------------------\n\nfunction boundingBox(state: PipelineState): { width: number; height: number } {\n\tlet w = 0;\n\tlet h = 0;\n\tfor (const layer of state.layers) {\n\t\tfor (const n of layer) {\n\t\t\tw = Math.max(w, n.x + n.w);\n\t\t\th = Math.max(h, n.y + n.h);\n\t\t}\n\t}\n\treturn { width: w, height: h };\n}\n","/**\n * `graphSpecToAscii(g, opts?)` — stdout-native DAG flowchart renderer for a\n * {@link GraphDescribeOutput}.\n *\n * Zero external dependencies, graph-size independent via proper Sugiyama\n * (layer assignment → virtual-node splitting → barycenter crossing\n * minimization → median-aligned coordinate assignment → per-gutter\n * track-assigned orthogonal routing). See\n * [_layout-sugiyama.ts](./_layout-sugiyama.ts) for the layout pipeline and\n * [_ascii-grid.ts](./_ascii-grid.ts) for the character blitter.\n *\n * Pure function over the describe snapshot; no Graph instance dependency.\n *\n * @category extra\n */\n\nimport type { GraphDescribeOutput } from \"@graphrefly/pure-ts/graph\";\nimport { renderGrid } from \"./_ascii-grid.js\";\nimport { countCells, truncateToCells } from \"./_ascii-width.js\";\nimport type { LayoutDirection } from \"./_layout-sugiyama.js\";\nimport { sugiyamaLayout } from \"./_layout-sugiyama.js\";\n\nconst DEFAULT_LABEL_WIDTH = 24;\nconst LAYER_GAP = 4;\nconst NODE_GAP = 1;\nconst BOX_HEIGHT = 3;\n\nexport type GraphSpecToAsciiOptions = {\n\t/**\n\t * ASCII layout direction. ASCII grid semantics are meaningful only for\n\t * `\"LR\"` (default) and `\"TD\"`.\n\t */\n\tdirection?: LayoutDirection;\n\t/** Per-box label cell cap; longer labels are truncated with `…`. Default `24`. */\n\tmaxLabelWidth?: number;\n\t/** Glyph set: `\"unicode\"` (default, box-drawing) or `\"ascii\"` (`-|+<>v`). */\n\tasciiCharset?: \"unicode\" | \"ascii\";\n\t/** Optional logger hook; fires with the rendered text before return. */\n\tlogger?: (text: string) => void;\n};\n\nexport function graphSpecToAscii(g: GraphDescribeOutput, opts?: GraphSpecToAsciiOptions): string {\n\tconst direction = normalizeAsciiDirection(opts?.direction);\n\tconst maxLabel = Math.max(3, opts?.maxLabelWidth ?? DEFAULT_LABEL_WIDTH);\n\tconst charset = opts?.asciiCharset ?? \"unicode\";\n\n\t// Deterministic paths ordering — match the rest of describe rendering.\n\tconst paths = Object.keys(g.nodes).sort();\n\t// Drop edges whose endpoints aren't in the current visible path set\n\t// (respects actor filtering that the caller already applied).\n\tconst nodeSet = new Set(paths);\n\tconst edges = g.edges.filter((e) => nodeSet.has(e.from) && nodeSet.has(e.to));\n\n\t// Precompute truncated labels + cell widths so the layout knows box\n\t// dimensions without re-measuring.\n\tconst labels = new Map<string, string>();\n\tconst widths = new Map<string, number>();\n\tfor (const p of paths) {\n\t\tconst label = truncateToCells(p, maxLabel);\n\t\tlabels.set(p, label);\n\t\t// Box width = label cells + 2 side borders + 2 cells of padding.\n\t\twidths.set(p, countCells(label) + 4);\n\t}\n\n\tconst layout = sugiyamaLayout({\n\t\tnodes: paths,\n\t\tedges,\n\t\twidthCells: (id) => widths.get(id) ?? 3,\n\t\theightCells: () => BOX_HEIGHT,\n\t\tlayerGap: LAYER_GAP,\n\t\tnodeGap: NODE_GAP,\n\t\tdirection,\n\t});\n\n\tconst text = renderGrid(layout, {\n\t\tcharset,\n\t\tlabelOf: (id) => labels.get(id) ?? id,\n\t});\n\n\topts?.logger?.(text);\n\treturn text;\n}\n\nfunction normalizeAsciiDirection(direction: unknown): LayoutDirection {\n\tif (direction === undefined || direction === \"LR\") return \"LR\";\n\tif (direction === \"TD\") return \"TD\";\n\t// BT / RL are valid for the vector diagram formats but ASCII grid\n\t// semantics are meaningful only for LR and TD — reject early with a\n\t// clear message rather than silently ignoring.\n\tthrow new Error(`ascii describe supports direction \"LR\" or \"TD\" only; got ${String(direction)}`);\n}\n","/**\n * Internal helpers shared across renderers in `extra/render/`.\n *\n * These are pure functions over `GraphDescribeOutput` — no Graph instance\n * dependency. Extracted from `src/graph/graph.ts` (the consolidated\n * ex-dumpGraph / ex-graphSpecToMermaid / ex-graphSpecToD2 renderers) per\n * Tier 2.1 A2.\n */\n\nimport type { GraphDescribeOutput } from \"@graphrefly/pure-ts/graph\";\n\n/** Direction options for diagram exports. */\nexport type DiagramDirection = \"TD\" | \"LR\" | \"BT\" | \"RL\";\n\n/** Recursively sort object keys for deterministic JSON (git-diffable). */\nexport function sortJsonValue(value: unknown): unknown {\n\tif (value === null || typeof value !== \"object\") {\n\t\treturn value;\n\t}\n\tif (Array.isArray(value)) {\n\t\treturn value.map(sortJsonValue);\n\t}\n\tconst obj = value as Record<string, unknown>;\n\tconst keys = Object.keys(obj).sort();\n\tconst out: Record<string, unknown> = {};\n\tfor (const k of keys) {\n\t\tout[k] = sortJsonValue(obj[k]);\n\t}\n\treturn out;\n}\n\n/** Escape characters that are illegal inside a quoted Mermaid label. */\nexport function escapeMermaidLabel(value: string): string {\n\treturn value.replaceAll(\"\\\\\", \"\\\\\\\\\").replaceAll('\"', '\\\\\"');\n}\n\n/** Escape characters that are illegal inside a quoted D2 label. */\nexport function escapeD2Label(value: string): string {\n\treturn value.replaceAll(\"\\\\\", \"\\\\\\\\\").replaceAll('\"', '\\\\\"');\n}\n\n/** Map our 4-direction enum to D2's `direction:` keyword. */\nexport function d2DirectionFromGraphDirection(direction: DiagramDirection): string {\n\tif (direction === \"TD\") return \"down\";\n\tif (direction === \"BT\") return \"up\";\n\tif (direction === \"RL\") return \"left\";\n\treturn \"right\";\n}\n\n/** Collect deduplicated (from, to) arrows from deps + edges. */\nexport function collectDiagramArrows(described: GraphDescribeOutput): [string, string][] {\n\tconst seen = new Set<string>();\n\tconst arrows: [string, string][] = [];\n\tfunction add(from: string, to: string): void {\n\t\tconst key = `${from}\\0${to}`;\n\t\tif (seen.has(key)) return;\n\t\tseen.add(key);\n\t\tarrows.push([from, to]);\n\t}\n\tfor (const [path, info] of Object.entries(described.nodes)) {\n\t\tconst deps: string[] | undefined = (info as Record<string, unknown>).deps as\n\t\t\t| string[]\n\t\t\t| undefined;\n\t\tif (deps) {\n\t\t\tfor (const dep of deps) add(dep, path);\n\t\t}\n\t}\n\tfor (const edge of described.edges) add(edge.from, edge.to);\n\treturn arrows;\n}\n\n/** Default to \"LR\"; throw on unknown values to surface caller bugs early. */\nexport function normalizeDiagramDirection(direction: unknown): DiagramDirection {\n\tif (direction === undefined) return \"LR\";\n\tif (direction === \"TD\" || direction === \"LR\" || direction === \"BT\" || direction === \"RL\") {\n\t\treturn direction;\n\t}\n\tthrow new Error(\n\t\t`invalid diagram direction ${String(direction)}; expected one of: TD, LR, BT, RL`,\n\t);\n}\n\n/** JSON-aware single-value formatter (used by `graphSpecToPretty`). */\nexport function describeData(value: unknown): string {\n\tif (typeof value === \"string\") return JSON.stringify(value);\n\tif (typeof value === \"number\" || typeof value === \"boolean\" || value == null)\n\t\treturn String(value);\n\ttry {\n\t\treturn JSON.stringify(value);\n\t} catch {\n\t\treturn \"[unserializable]\";\n\t}\n}\n","/**\n * `graphSpecToD2(g, opts?)` — render a {@link GraphDescribeOutput} as D2\n * diagram text.\n *\n * Pure function over the describe snapshot; no Graph instance dependency.\n *\n * @category extra\n */\n\nimport type { GraphDescribeOutput } from \"@graphrefly/pure-ts/graph\";\nimport {\n\tcollectDiagramArrows,\n\ttype DiagramDirection,\n\td2DirectionFromGraphDirection,\n\tescapeD2Label,\n\tnormalizeDiagramDirection,\n} from \"./_internal.js\";\n\nexport type GraphSpecToD2Options = {\n\t/** Diagram direction; default `\"LR\"`. */\n\tdirection?: DiagramDirection;\n};\n\nexport function graphSpecToD2(g: GraphDescribeOutput, opts?: GraphSpecToD2Options): string {\n\tconst direction = normalizeDiagramDirection(opts?.direction);\n\tconst paths = Object.keys(g.nodes).sort();\n\tconst ids = new Map<string, string>();\n\tfor (let i = 0; i < paths.length; i += 1) ids.set(paths[i]!, `n${i}`);\n\tconst lines: string[] = [`direction: ${d2DirectionFromGraphDirection(direction)}`];\n\tfor (const path of paths) {\n\t\tconst id = ids.get(path)!;\n\t\tlines.push(`${id}: \"${escapeD2Label(path)}\"`);\n\t}\n\tfor (const [from, to] of collectDiagramArrows(g)) {\n\t\tconst fromId = ids.get(from);\n\t\tconst toId = ids.get(to);\n\t\tif (!fromId || !toId) continue;\n\t\tlines.push(`${fromId} -> ${toId}`);\n\t}\n\treturn lines.join(\"\\n\");\n}\n","/**\n * `graphSpecToJson(g, opts?)` — render a {@link GraphDescribeOutput} as\n * deterministic JSON text with sorted keys.\n *\n * Pure function over the describe snapshot; no Graph instance dependency.\n *\n * @category extra\n */\n\nimport type { GraphDescribeOutput } from \"@graphrefly/pure-ts/graph\";\nimport { sortJsonValue } from \"./_internal.js\";\n\nexport type GraphSpecToJsonOptions = {\n\t/** Include the Edges section (default `true`). */\n\tincludeEdges?: boolean;\n\t/** Include the Subgraphs section (default `true`). */\n\tincludeSubgraphs?: boolean;\n\t/** JSON indent (default `2`). */\n\tindent?: number;\n\t/** Optional logger hook; fires with the rendered text before return. */\n\tlogger?: (text: string) => void;\n};\n\nexport function graphSpecToJson(g: GraphDescribeOutput, opts?: GraphSpecToJsonOptions): string {\n\tconst includeEdges = opts?.includeEdges ?? true;\n\tconst includeSubgraphs = opts?.includeSubgraphs ?? true;\n\tconst { expand: _expand, ...rest } = g;\n\tconst payload: GraphDescribeOutput = {\n\t\t...rest,\n\t\tedges: includeEdges ? g.edges : [],\n\t\tsubgraphs: includeSubgraphs ? g.subgraphs : [],\n\t};\n\tconst text = JSON.stringify(sortJsonValue(payload), null, opts?.indent ?? 2);\n\topts?.logger?.(text);\n\treturn text;\n}\n","/**\n * `graphSpecToMermaid(g, opts?)` — render a {@link GraphDescribeOutput} as\n * Mermaid flowchart text.\n *\n * Pure function over the describe snapshot; no Graph instance dependency.\n * Compose with `derived` for live formatted output:\n *\n * ```ts\n * import { graphSpecToMermaid } from \"@graphrefly/graphrefly/extra/render\";\n * import { derived } from \"@graphrefly/graphrefly\";\n *\n * const live = derived(\n *   [graph.describe({ reactive: true }).node],\n *   ([g]) => graphSpecToMermaid(g),\n * );\n * ```\n *\n * @category extra\n */\n\nimport type { GraphDescribeOutput } from \"@graphrefly/pure-ts/graph\";\nimport {\n\tcollectDiagramArrows,\n\ttype DiagramDirection,\n\tescapeMermaidLabel,\n\tnormalizeDiagramDirection,\n} from \"./_internal.js\";\n\nexport type GraphSpecToMermaidOptions = {\n\t/** Diagram direction; default `\"LR\"`. */\n\tdirection?: DiagramDirection;\n};\n\nexport function graphSpecToMermaid(\n\tg: GraphDescribeOutput,\n\topts?: GraphSpecToMermaidOptions,\n): string {\n\tconst direction = normalizeDiagramDirection(opts?.direction);\n\tconst paths = Object.keys(g.nodes).sort();\n\tconst ids = new Map<string, string>();\n\tfor (let i = 0; i < paths.length; i += 1) ids.set(paths[i]!, `n${i}`);\n\tconst lines: string[] = [`flowchart ${direction}`];\n\tfor (const path of paths) {\n\t\tconst id = ids.get(path)!;\n\t\tlines.push(`  ${id}[\"${escapeMermaidLabel(path)}\"]`);\n\t}\n\tfor (const [from, to] of collectDiagramArrows(g)) {\n\t\tconst fromId = ids.get(from);\n\t\tconst toId = ids.get(to);\n\t\tif (!fromId || !toId) continue;\n\t\tlines.push(`  ${fromId} --> ${toId}`);\n\t}\n\treturn lines.join(\"\\n\");\n}\n","/**\n * `graphSpecToMermaidUrl(g, opts?)` — encode a {@link GraphDescribeOutput}\n * as a `https://mermaid.live/edit#base64:…` deep link.\n *\n * Round-trip with the mermaid.live editor's `/edit#base64:` share format —\n * payload is `base64url(JSON({code, mermaid: {theme}, ...}))`. No network\n * calls; the payload is encoded into the URL fragment.\n *\n * @category extra\n */\n\nimport type { GraphDescribeOutput } from \"@graphrefly/pure-ts/graph\";\nimport { type GraphSpecToMermaidOptions, graphSpecToMermaid } from \"./graph-spec-to-mermaid.js\";\n\nexport type MermaidLiveTheme = \"default\" | \"dark\" | \"forest\" | \"neutral\" | \"base\";\n\nexport type GraphSpecToMermaidUrlOptions = GraphSpecToMermaidOptions & {\n\ttheme?: MermaidLiveTheme;\n\tautoSync?: boolean;\n};\n\n/**\n * Encode an arbitrary mermaid source string to a `mermaid.live` deep link.\n * Exported separately so callers that already rendered mermaid text can\n * upgrade to a live-editor URL without re-rendering.\n */\nexport function mermaidLiveUrl(\n\tmermaidSrc: string,\n\topts?: { theme?: MermaidLiveTheme; autoSync?: boolean },\n): string {\n\tconst theme = opts?.theme ?? \"default\";\n\tconst autoSync = opts?.autoSync ?? true;\n\tconst payload = { code: mermaidSrc, mermaid: { theme }, autoSync };\n\tconst json = JSON.stringify(payload);\n\t// Browsers + Node both expose globalThis.btoa; encode UTF-8 bytes first so\n\t// non-ASCII node names don't explode btoa. Then url-safe base64 (`+/=`→`-_` strip).\n\tconst bytes = new TextEncoder().encode(json);\n\tlet binary = \"\";\n\tfor (let i = 0; i < bytes.length; i++) binary += String.fromCharCode(bytes[i]!);\n\tconst b64 = globalThis.btoa(binary).replace(/\\+/g, \"-\").replace(/\\//g, \"_\").replace(/=+$/, \"\");\n\treturn `https://mermaid.live/edit#base64:${b64}`;\n}\n\nexport function graphSpecToMermaidUrl(\n\tg: GraphDescribeOutput,\n\topts?: GraphSpecToMermaidUrlOptions,\n): string {\n\tconst mermaidSrc = graphSpecToMermaid(g, opts);\n\treturn mermaidLiveUrl(mermaidSrc, opts);\n}\n","/**\n * `graphSpecToPretty(g, opts?)` — render a {@link GraphDescribeOutput} as\n * human-readable plaintext (Node list with values, plus optional Edges and\n * Subgraphs sections).\n *\n * Pure function over the describe snapshot; no Graph instance dependency.\n *\n * @category extra\n */\n\nimport type { GraphDescribeOutput } from \"@graphrefly/pure-ts/graph\";\nimport { describeData } from \"./_internal.js\";\n\nexport type GraphSpecToPrettyOptions = {\n\t/** Include the Edges section (default `true`). */\n\tincludeEdges?: boolean;\n\t/** Include the Subgraphs section (default `true`). */\n\tincludeSubgraphs?: boolean;\n\t/** Optional logger hook; fires with the rendered text before return. */\n\tlogger?: (text: string) => void;\n};\n\nexport function graphSpecToPretty(g: GraphDescribeOutput, opts?: GraphSpecToPrettyOptions): string {\n\tconst includeEdges = opts?.includeEdges ?? true;\n\tconst includeSubgraphs = opts?.includeSubgraphs ?? true;\n\tconst lines: string[] = [];\n\tlines.push(`Graph ${g.name}`);\n\tlines.push(\"Nodes:\");\n\tfor (const path of Object.keys(g.nodes).sort()) {\n\t\tconst n = g.nodes[path]!;\n\t\tlines.push(`- ${path} (${n.type}/${n.status}): ${describeData(n.value)}`);\n\t}\n\tif (includeEdges) {\n\t\tlines.push(\"Edges:\");\n\t\tfor (const edge of g.edges) {\n\t\t\tlines.push(`- ${edge.from} -> ${edge.to}`);\n\t\t}\n\t}\n\tif (includeSubgraphs) {\n\t\tlines.push(\"Subgraphs:\");\n\t\tfor (const sg of g.subgraphs) {\n\t\t\tlines.push(`- ${sg}`);\n\t\t}\n\t}\n\tconst text = lines.join(\"\\n\");\n\topts?.logger?.(text);\n\treturn text;\n}\n","/**\n * `layoutFrameToSvg(frame, opts?)` — render a {@link LayoutFrame} as an SVG\n * markup string.\n *\n * Universal-safe — emits a string, not a DOM tree. Browser code embeds via\n * `el.innerHTML = svg`; Node code writes to a file. Cell-grid coordinates from\n * the layout are scaled by `cellWidth` / `cellHeight` (default 12 × 18 px,\n * roughly matching a monospace baseline).\n *\n * Each box gets `data-id=\"<path>\"` for change-event highlighting; each edge\n * gets `data-from=\"<from>\" data-to=\"<to>\"` so renderers can animate flowing\n * data per `LayoutFrame.changes`.\n *\n * @category extra\n */\n\nimport type { LayoutFrame } from \"./layout-types.js\";\n\nexport interface LayoutFrameToSvgOptions {\n\t/** Pixel width of one cell. Default: `12`. */\n\treadonly cellWidth?: number;\n\t/** Pixel height of one cell. Default: `18`. */\n\treadonly cellHeight?: number;\n\t/** Outer margin in pixels. Default: `16`. */\n\treadonly padding?: number;\n\t/** Box stroke color. Default: `\"#444\"`. */\n\treadonly boxStroke?: string;\n\t/** Box fill color. Default: `\"#fff\"`. */\n\treadonly boxFill?: string;\n\t/** Edge stroke color. Default: `\"#888\"`. */\n\treadonly edgeStroke?: string;\n\t/** Box label text color. Default: `\"#111\"`. */\n\treadonly textColor?: string;\n\t/** Font family. Default: `\"ui-monospace, monospace\"`. */\n\treadonly fontFamily?: string;\n\t/** Font size in pixels. Default: `12`. */\n\treadonly fontSize?: number;\n}\n\nconst SPECIAL_CHARS: Record<string, string> = {\n\t\"&\": \"&amp;\",\n\t\"<\": \"&lt;\",\n\t\">\": \"&gt;\",\n\t'\"': \"&quot;\",\n\t\"'\": \"&apos;\",\n};\n\nfunction escapeXml(s: string): string {\n\treturn s.replace(/[&<>\"']/g, (c) => SPECIAL_CHARS[c] ?? c);\n}\n\n/**\n * Render a {@link LayoutFrame} to SVG markup. Pure function — call from\n * `derived` to drive a live `<svg>` element from a `topologyView` output.\n */\nexport function layoutFrameToSvg(frame: LayoutFrame, opts?: LayoutFrameToSvgOptions): string {\n\tconst cellW = opts?.cellWidth ?? 12;\n\tconst cellH = opts?.cellHeight ?? 18;\n\tconst pad = opts?.padding ?? 16;\n\t// /qa F-10: route option-bag string attributes through escapeXml so that\n\t// user-supplied themes (URL params, dashboard config, etc.) cannot inject\n\t// `\"/><script>...` and break out of the attribute. Numeric `fontSize` has\n\t// no XSS surface; escape only when caller passes a string.\n\tconst boxStroke = escapeXml(opts?.boxStroke ?? \"#444\");\n\tconst boxFill = escapeXml(opts?.boxFill ?? \"#fff\");\n\tconst edgeStroke = escapeXml(opts?.edgeStroke ?? \"#888\");\n\tconst textColor = escapeXml(opts?.textColor ?? \"#111\");\n\tconst fontFamily = opts?.fontFamily ?? \"ui-monospace, monospace\";\n\tconst fontSize = opts?.fontSize ?? 12;\n\n\tlet maxX = 0;\n\tlet maxY = 0;\n\tfor (const b of frame.boxes) {\n\t\tmaxX = Math.max(maxX, b.x + b.w);\n\t\tmaxY = Math.max(maxY, b.y + b.h);\n\t}\n\tfor (const e of frame.edges) {\n\t\tfor (const [x, y] of e.points) {\n\t\t\tmaxX = Math.max(maxX, x);\n\t\t\tmaxY = Math.max(maxY, y);\n\t\t}\n\t}\n\tconst width = Math.max(1, maxX) * cellW + pad * 2;\n\tconst height = Math.max(1, maxY) * cellH + pad * 2;\n\n\tconst lines: string[] = [];\n\tlines.push(\n\t\t`<svg xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 ${width} ${height}\" width=\"${width}\" height=\"${height}\">`,\n\t);\n\n\t// Edges first (so boxes overlay them at endpoints).\n\tfor (const e of frame.edges) {\n\t\tif (e.points.length < 2) continue;\n\t\tconst pts = e.points.map(([x, y]) => `${x * cellW + pad},${y * cellH + pad}`).join(\" \");\n\t\tlines.push(\n\t\t\t`  <polyline points=\"${pts}\" fill=\"none\" stroke=\"${edgeStroke}\" stroke-width=\"1\" data-from=\"${escapeXml(e.from)}\" data-to=\"${escapeXml(e.to)}\" data-dep-index=\"${e.depIndex}\" />`,\n\t\t);\n\t}\n\n\t// Boxes.\n\tfor (const b of frame.boxes) {\n\t\tconst px = b.x * cellW + pad;\n\t\tconst py = b.y * cellH + pad;\n\t\tconst pw = Math.max(1, b.w) * cellW;\n\t\tconst ph = Math.max(1, b.h) * cellH;\n\t\t// Local segment for label so deeply-mounted nodes stay readable.\n\t\tconst local = b.id.includes(\"::\") ? (b.id.split(\"::\").pop() ?? b.id) : b.id;\n\t\tlines.push(\n\t\t\t`  <g data-id=\"${escapeXml(b.id)}\">`,\n\t\t\t`    <rect x=\"${px}\" y=\"${py}\" width=\"${pw}\" height=\"${ph}\" fill=\"${boxFill}\" stroke=\"${boxStroke}\" stroke-width=\"1\" />`,\n\t\t\t`    <text x=\"${px + pw / 2}\" y=\"${py + ph / 2}\" fill=\"${textColor}\" font-family=\"${escapeXml(fontFamily)}\" font-size=\"${fontSize}\" text-anchor=\"middle\" dominant-baseline=\"central\">${escapeXml(local)}</text>`,\n\t\t\t`  </g>`,\n\t\t);\n\t}\n\n\tlines.push(\"</svg>\");\n\treturn lines.join(\"\\n\");\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACYO,SAAS,UAAU,MAAyB;AAElD,MACE,QAAQ,OAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,SAAS;AAAA,EAC3B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,SAAS;AAAA,EAC3B,QAAQ,QAAU,SAAS;AAAA,EAC3B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,SAAS;AAAA,EAC3B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC3B,SAAS,MACR;AACD,WAAO;AAAA,EACR;AAEA,MACE,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC3B,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACR,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC1B,QAAQ,QAAU,QAAQ;AAAA,EAC3B,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACR,QAAQ,QAAU,QAAQ;AAAA,EAC3B,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACR,QAAQ,QAAU,QAAQ;AAAA,EAC3B,SAAS;AAAA,EACR,QAAQ,SAAU,QAAQ;AAAA,EAC3B,SAAS;AAAA,EACR,QAAQ,SAAU,QAAQ;AAAA,EAC3B,SAAS;AAAA,EACT,SAAS;AAAA,EACR,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC3B,SAAS;AAAA,EACT,SAAS;AAAA,EACR,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,SAAU,QAAQ;AAAA,EAC1B,QAAQ,UAAW,SAAS;AAAA,EAC7B,SAAS;AAAA,EACR,QAAQ,UAAW,QAAQ;AAAA,EAC5B,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACR,QAAQ,UAAW,QAAQ;AAAA,EAC3B,QAAQ,UAAW,QAAQ;AAAA,EAC3B,QAAQ,UAAW,QAAQ;AAAA,EAC5B,SAAS;AAAA,EACT,SAAS;AAAA,EACR,QAAQ,UAAW,QAAQ;AAAA,EAC3B,QAAQ,UAAW,QAAQ;AAAA,EAC3B,QAAQ,UAAW,QAAQ;AAAA,EAC3B,QAAQ,UAAW,QAAQ;AAAA,EAC3B,QAAQ,UAAW,QAAQ;AAAA,EAC3B,QAAQ,UAAW,QAAQ;AAAA,EAC3B,QAAQ,UAAW,QAAQ,QAC3B;AACD,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAQO,SAAS,WAAW,MAAsB;AAChD,MAAI,QAAQ;AACZ,aAAW,MAAM,MAAM;AACtB,aAAS,UAAU,GAAG,YAAY,CAAC,CAAE;AAAA,EACtC;AACA,SAAO;AACR;AAOO,SAAS,gBAAgB,MAAc,UAA0B;AACvE,MAAI,YAAY,EAAG,QAAO;AAC1B,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,aAAW,MAAM,MAAM;AACtB,UAAM,IAAI,UAAU,GAAG,YAAY,CAAC,CAAE;AACtC,QAAI,QAAQ,IAAI,UAAU;AACzB,UAAI,YAAY,EAAG,QAAO;AAE1B,aAAO,QAAQ,IAAI,YAAY,IAAI,SAAS,GAAG;AAC9C,cAAM,OAAO,CAAC,GAAG,GAAG,EAAE,IAAI;AAC1B,cAAM,IAAI,MAAM,GAAG,CAAC,KAAK,MAAM;AAC/B,iBAAS,UAAU,KAAK,YAAY,CAAC,CAAE;AAAA,MACxC;AACA,aAAO,GAAG,GAAG;AAAA,IACd;AACA,WAAO;AACP,aAAS;AAAA,EACV;AACA,SAAO;AACR;;;ACtHA,IAAM,UAAkB;AAAA,EACvB,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,OAAO;AAAA,EACP,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,WAAW;AAAA,EACX,SAAS;AAAA,EACT,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AACP;AAEA,IAAM,QAAgB;AAAA,EACrB,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,UAAU;AAAA,EACV,OAAO;AAAA,EACP,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,WAAW;AAAA,EACX,SAAS;AAAA,EACT,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AACP;AAgBO,SAAS,WAAW,QAAsB,SAA8B;AAC9E,QAAM,SAAS,QAAQ,YAAY,UAAU,QAAQ;AACrD,QAAM,QAAQ,OAAO;AACrB,QAAM,SAAS,OAAO;AACtB,QAAM,OAAmB,MAAM;AAAA,IAAK,EAAE,QAAQ,OAAO;AAAA,IAAG,MACvD,MAAM,KAAK,EAAE,QAAQ,MAAM,GAAG,MAAM,GAAG;AAAA,EACxC;AACA,QAAM,OAAqB,MAAM;AAAA,IAAK,EAAE,QAAQ,OAAO;AAAA,IAAG,MACzD,MAAM,KAAK,EAAE,QAAQ,MAAM,GAAG,MAAM,OAAmB;AAAA,EACxD;AAGA,aAAW,QAAQ,OAAO,OAAO;AAChC,aAAS,MAAM,MAAM,QAAQ,IAAI;AAAA,EAClC;AAGA,aAAW,OAAO,OAAO,OAAO;AAC/B,YAAQ,MAAM,MAAM,QAAQ,KAAK,QAAQ,QAAQ,IAAI,EAAE,CAAC;AAAA,EACzD;AAEA,SAAO,KAAK,IAAI,CAAC,QAAQ,cAAc,IAAI,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI;AAChE;AAMA,SAAS,QACR,MACA,MACA,QACA,KACA,OACO;AACP,QAAM,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI;AACvB,MAAI,IAAI,KAAK,IAAI,GAAG;AAEnB,QAAI,IAAI,EAAG,YAAW,MAAM,MAAM,GAAG,GAAG,GAAG,KAAK;AAChD;AAAA,EACD;AAEA,aAAW,MAAM,MAAM,GAAG,GAAG,OAAO,KAAK;AACzC,WAAS,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,MAAM,EAAG,YAAW,MAAM,MAAM,IAAI,GAAG,OAAO,IAAI;AACvF,aAAW,MAAM,MAAM,IAAI,IAAI,GAAG,GAAG,OAAO,KAAK;AAEjD,WAAS,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,MAAM,GAAG;AAC7C,eAAW,MAAM,MAAM,GAAG,IAAI,OAAO,IAAI;AACzC,aAAS,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,MAAM,GAAG;AAC7C,mBAAa,MAAM,MAAM,IAAI,IAAI,KAAK,OAAO;AAAA,IAC9C;AACA,eAAW,MAAM,MAAM,IAAI,IAAI,GAAG,IAAI,OAAO,IAAI;AAAA,EAClD;AAEA,aAAW,MAAM,MAAM,GAAG,IAAI,IAAI,GAAG,OAAO,KAAK;AACjD,WAAS,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,MAAM,EAAG,YAAW,MAAM,MAAM,IAAI,IAAI,IAAI,GAAG,OAAO,IAAI;AAC/F,aAAW,MAAM,MAAM,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,OAAO,KAAK;AAEzD,QAAM,OAAO,IAAI,KAAK,MAAM,IAAI,CAAC;AACjC,aAAW,MAAM,MAAM,IAAI,GAAG,MAAM,IAAI,GAAG,KAAK;AACjD;AAEA,SAAS,WACR,MACA,MACA,GACA,GACA,OACO;AACP,QAAM,IACL,UAAU,MACP,UACA,UAAU,YAAO,UAAU,MAC1B,SACA,UAAU,YAAO,UAAU,MAC1B,SACA;AACN,eAAa,MAAM,MAAM,GAAG,GAAG,OAAO,CAAC;AACxC;AAEA,SAAS,aACR,MACA,MACA,GACA,GACA,OACA,GACO;AACP,MAAI,IAAI,KAAK,KAAK,KAAK,OAAQ;AAC/B,QAAM,MAAM,KAAK,CAAC;AAClB,MAAI,IAAI,KAAK,KAAK,IAAI,OAAQ;AAC9B,MAAI,CAAC,IAAI;AACT,OAAK,CAAC,EAAG,CAAC,IAAI;AACf;AAEA,SAAS,WACR,MACA,MACA,GACA,GACA,eACA,OACO;AAMP,MAAI,IAAI,KAAK,KAAK,KAAK,OAAQ;AAC/B,MAAI,SAAS;AACb,MAAI,YAAY;AAChB,aAAW,MAAM,OAAO;AACvB,UAAM,KAAK,WAAW,EAAE;AACxB,QAAI,OAAO,EAAG;AACd,QAAI,YAAY,GAAI;AACpB,QAAI,UAAU,KAAK,SAAS,KAAK,CAAC,EAAG,QAAQ;AAC5C,WAAK,CAAC,EAAG,MAAM,IAAI;AACnB,WAAK,CAAC,EAAG,MAAM,IAAI;AACnB,UAAI,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,EAAG,QAAQ;AAC7C,aAAK,CAAC,EAAG,SAAS,CAAC,IAAI;AACvB,aAAK,CAAC,EAAG,SAAS,CAAC,IAAI;AAAA,MACxB;AAAA,IACD;AACA,cAAU;AACV,iBAAa;AAAA,EACd;AAGA,SAAO,YAAY,GAAG;AACrB,QAAI,UAAU,KAAK,SAAS,KAAK,CAAC,EAAG,QAAQ;AAC5C,WAAK,CAAC,EAAG,MAAM,IAAI;AACnB,WAAK,CAAC,EAAG,MAAM,IAAI;AAAA,IACpB;AACA,cAAU;AACV,iBAAa;AAAA,EACd;AACD;AAMA,SAAS,SAAS,MAAkB,MAAoB,QAAgB,MAAwB;AAC/F,QAAM,MAAM,KAAK;AACjB,MAAI,IAAI,SAAS,EAAG;AAEpB,WAAS,IAAI,GAAG,IAAI,IAAI,IAAI,QAAQ,KAAK,GAAG;AAC3C,gBAAY,MAAM,MAAM,QAAQ,IAAI,CAAC,GAAI,IAAI,IAAI,CAAC,CAAE;AAAA,EACrD;AAEA,WAAS,IAAI,GAAG,IAAI,IAAI,IAAI,QAAQ,KAAK,GAAG;AAC3C,UAAM,IAAI,IAAI,IAAI,CAAC;AACnB,UAAM,IAAI,IAAI,CAAC;AACf,UAAM,IAAI,IAAI,IAAI,CAAC;AACnB,UAAM,SAAS,YAAY,GAAG,GAAG,GAAG,MAAM;AAC1C,QAAI,OAAQ,aAAY,MAAM,MAAM,EAAE,GAAG,EAAE,GAAG,QAAQ,YAAY;AAAA,EACnE;AAIA,QAAM,MAAM,IAAI,IAAI,SAAS,CAAC;AAC9B,QAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAM,QAAQ,WAAW,MAAM,KAAK,MAAM;AAC1C,MAAI,MAAO,aAAY,MAAM,MAAM,IAAI,GAAG,IAAI,GAAG,OAAO,OAAO;AAChE;AAEA,SAAS,YACR,MACA,MACA,QACA,GACA,GACO;AACP,MAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,EAAG;AAChC,MAAI,EAAE,MAAM,EAAE,GAAG;AAEhB,UAAM,IAAI,EAAE;AACZ,UAAM,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;AAC5B,UAAM,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;AAC5B,aAAS,IAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AACjC,kBAAY,MAAM,MAAM,GAAG,GAAG,QAAQ,GAAG;AAAA,IAC1C;AAAA,EACD,WAAW,EAAE,MAAM,EAAE,GAAG;AAEvB,UAAM,IAAI,EAAE;AACZ,UAAM,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;AAC5B,UAAM,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;AAC5B,aAAS,IAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AACjC,kBAAY,MAAM,MAAM,GAAG,GAAG,QAAQ,GAAG;AAAA,IAC1C;AAAA,EACD;AAED;AAEA,SAAS,YACR,MACA,MACA,GACA,GACA,QACA,aACO;AACP,MAAI,IAAI,KAAK,KAAK,KAAK,OAAQ;AAC/B,QAAM,MAAM,KAAK,CAAC;AAClB,MAAI,IAAI,KAAK,KAAK,IAAI,OAAQ;AAC9B,QAAM,WAAW,KAAK,CAAC,EAAG,CAAC;AAC3B,MACC,aAAa,UACb,aAAa,UACb,aAAa,eACb,aAAa,SACZ;AAGD;AAAA,EACD;AACA,MAAI,aAAa,SAAS;AACzB,QAAI,CAAC,IAAI,gBAAgB,MAAM,OAAO,aAAa,OAAO;AAC1D,SAAK,CAAC,EAAG,CAAC,IAAI,gBAAgB,MAAM,UAAU;AAC9C;AAAA,EACD;AACA,MAAI,aAAa,WAAW,gBAAgB,KAAK;AAChD,QAAI,CAAC,IAAI,OAAO;AAChB,SAAK,CAAC,EAAG,CAAC,IAAI;AACd;AAAA,EACD;AACA,MAAI,aAAa,WAAW,gBAAgB,KAAK;AAChD,QAAI,CAAC,IAAI,OAAO;AAChB,SAAK,CAAC,EAAG,CAAC,IAAI;AACd;AAAA,EACD;AAED;AAEA,SAAS,YACR,MACA,MACA,GACA,GACA,OACA,GACO;AACP,MAAI,IAAI,KAAK,KAAK,KAAK,OAAQ;AAC/B,QAAM,MAAM,KAAK,CAAC;AAClB,MAAI,IAAI,KAAK,KAAK,IAAI,OAAQ;AAC9B,QAAM,WAAW,KAAK,CAAC,EAAG,CAAC;AAC3B,MACC,aAAa,UACb,aAAa,UACb,aAAa,eACb,aAAa;AAEb;AACD,MAAI,CAAC,IAAI;AACT,OAAK,CAAC,EAAG,CAAC,IAAI;AACf;AAMA,SAAS,YACR,GACA,GACA,GACA,QACqB;AACrB,QAAM,UAAU,EAAE,MAAM,EAAE;AAC1B,QAAM,WAAW,EAAE,MAAM,EAAE;AAC3B,MAAI,YAAY,SAAU,QAAO;AAGjC,MAAI,SAAS;AAEZ,UAAM,WAAW,EAAE,IAAI,EAAE;AACzB,UAAM,YAAY,EAAE,IAAI,EAAE;AAC1B,QAAI,YAAY,UAAW,QAAO,OAAO;AACzC,QAAI,YAAY,CAAC,UAAW,QAAO,OAAO;AAC1C,QAAI,CAAC,YAAY,UAAW,QAAO,OAAO;AAC1C,WAAO,OAAO;AAAA,EACf;AAEA,QAAM,YAAY,EAAE,IAAI,EAAE;AAC1B,QAAM,aAAa,EAAE,IAAI,EAAE;AAC3B,MAAI,aAAa,WAAY,QAAO,OAAO;AAC3C,MAAI,aAAa,CAAC,WAAY,QAAO,OAAO;AAC5C,MAAI,CAAC,aAAa,WAAY,QAAO,OAAO;AAC5C,SAAO,OAAO;AACf;AAEA,SAAS,WACR,MACA,KACA,QACqB;AACrB,MAAI,IAAI,IAAI,KAAK,EAAG,QAAO,OAAO;AAClC,MAAI,IAAI,IAAI,KAAK,EAAG,QAAO,OAAO;AAClC,MAAI,IAAI,IAAI,KAAK,EAAG,QAAO,OAAO;AAClC,MAAI,IAAI,IAAI,KAAK,EAAG,QAAO,OAAO;AAClC,SAAO;AACR;AAMA,SAAS,cAAc,MAAsB;AAE5C,MAAI,MAAM,KAAK;AACf,SAAO,MAAM,KAAK,KAAK,WAAW,MAAM,CAAC,MAAM,GAAI,QAAO;AAC1D,SAAO,KAAK,MAAM,GAAG,GAAG;AACzB;;;AC5SO,SAAS,eAAe,OAAkC;AAChE,QAAM,QAAQ,aAAa,KAAK;AAChC,eAAa,KAAK;AAClB,qBAAmB,KAAK;AACxB,oBAAkB,KAAK;AACvB,oBAAkB,OAAO,KAAK;AAC9B,QAAM,QAAQ,WAAW,OAAO,KAAK;AACrC,QAAM,EAAE,OAAO,OAAO,IAAI,YAAY,KAAK;AAC3C,QAAM,QAAqB,CAAC;AAC5B,aAAW,SAAS,MAAM,QAAQ;AACjC,eAAW,KAAK,OAAO;AACtB,UAAI,EAAE,UAAW;AACjB,YAAM,KAAK;AAAA,QACV,IAAI,EAAE;AAAA,QACN,OAAO,EAAE;AAAA,QACT,OAAO,EAAE;AAAA,QACT,GAAG,EAAE;AAAA,QACL,GAAG,EAAE;AAAA,QACL,GAAG,EAAE;AAAA,QACL,GAAG,EAAE;AAAA,MACN,CAAC;AAAA,IACF;AAAA,EACD;AACA,SAAO,EAAE,OAAO,OAAO,OAAO,OAAO;AACtC;AAMA,SAAS,aAAa,OAAmC;AACxD,QAAM,QAAQ,oBAAI,IAA0B;AAC5C,aAAW,MAAM,MAAM,OAAO;AAC7B,UAAM,IAAI,IAAI;AAAA,MACb;AAAA,MACA,WAAW;AAAA,MACX,OAAO;AAAA,MACP,OAAO;AAAA,MACP,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG,MAAM,WAAW,EAAE;AAAA,MACtB,GAAG,MAAM,YAAY,EAAE;AAAA,MACvB,IAAI,CAAC;AAAA,MACL,KAAK,CAAC;AAAA,IACP,CAAC;AAAA,EACF;AACA,QAAM,OAAc,CAAC;AACrB,MAAI,UAAU;AACd,aAAW,KAAK,MAAM,OAAO;AAC5B,QAAI,EAAE,SAAS,EAAE,GAAI;AACrB,UAAM,IAAI,MAAM,IAAI,EAAE,IAAI;AAC1B,UAAM,IAAI,MAAM,IAAI,EAAE,EAAE;AACxB,QAAI,CAAC,KAAK,CAAC,EAAG;AACd,UAAM,MAAW;AAAA,MAChB,SAAS;AAAA,MACT,WAAW,EAAE;AAAA,MACb,SAAS,EAAE;AAAA,MACX,QAAQ,EAAE;AAAA,MACV,MAAM,EAAE;AAAA,MACR,UAAU;AAAA,MACV,UAAU;AAAA,IACX;AACA,MAAE,IAAI,KAAK,GAAG;AACd,MAAE,GAAG,KAAK,GAAG;AACb,SAAK,KAAK,GAAG;AAAA,EACd;AACA,SAAO,EAAE,OAAO,QAAQ,CAAC,GAAG,KAAK;AAClC;AAMA,SAAS,aAAa,OAA4B;AACjD,QAAM,QAAQ,oBAAI,IAAoB;AACtC,aAAW,KAAK,MAAM,MAAM,OAAO,EAAG,OAAM,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM;AAEjE,QAAM,QAAwB,CAAC;AAC/B,aAAW,KAAK,MAAM,MAAM,OAAO,GAAG;AACrC,SAAK,MAAM,IAAI,EAAE,EAAE,KAAK,OAAO,GAAG;AACjC,QAAE,QAAQ;AACV,YAAM,KAAK,CAAC;AAAA,IACb;AAAA,EACD;AAIA,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,OAAO;AACX,SAAO,OAAO,MAAM,QAAQ;AAC3B,UAAM,IAAI,MAAM,MAAM;AACtB,QAAI,QAAQ,IAAI,EAAE,EAAE,EAAG;AACvB,YAAQ,IAAI,EAAE,EAAE;AAChB,eAAW,OAAO,EAAE,KAAK;AACxB,YAAM,IAAI,MAAM,MAAM,IAAI,IAAI,IAAI;AAClC,QAAE,QAAQ,KAAK,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC;AACvC,YAAM,KAAK,MAAM,IAAI,EAAE,EAAE,KAAK,KAAK;AACnC,YAAM,IAAI,EAAE,IAAI,CAAC;AACjB,UAAI,KAAK,EAAG,OAAM,KAAK,CAAC;AAAA,IACzB;AAAA,EACD;AAKA,aAAW,KAAK,MAAM,MAAM,OAAO,EAAG,KAAI,EAAE,QAAQ,EAAG,GAAE,QAAQ;AAClE;AAMA,SAAS,mBAAmB,OAA4B;AACvD,QAAM,WAAW,KAAK,IAAI,GAAG,GAAG,MAAM,KAAK,MAAM,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC;AAChF,QAAM,SAAkB,MAAM,KAAK,EAAE,QAAQ,WAAW,EAAE,GAAG,MAAM,CAAC,CAAC;AACrE,aAAW,KAAK,MAAM,MAAM,OAAO,EAAG,QAAO,EAAE,KAAK,EAAG,KAAK,CAAC;AAE7D,QAAM,UAAiB,CAAC;AACxB,MAAI,cAAc;AAClB,aAAW,OAAO,MAAM,MAAM;AAC7B,UAAM,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM;AACpC,UAAM,IAAI,MAAM,MAAM,IAAI,IAAI,IAAI;AAClC,UAAM,OAAO,EAAE,QAAQ,EAAE;AACzB,QAAI,QAAQ,GAAG;AAOd,QAAE,MAAM,EAAE,IAAI,OAAO,CAAC,MAAM,MAAM,GAAG;AACrC,QAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,MAAM,GAAG;AACnC;AAAA,IACD;AACA,QAAI,SAAS,GAAG;AACf,UAAI,WAAW;AACf,UAAI,WAAW;AACf,cAAQ,KAAK,GAAG;AAChB;AAAA,IACD;AAGA,MAAE,MAAM,EAAE,IAAI,OAAO,CAAC,MAAM,MAAM,GAAG;AACrC,MAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,MAAM,GAAG;AAEnC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK,GAAG;AACjC,YAAM,MAAM,UAAU,aAAa;AACnC,YAAM,IAAkB;AAAA,QACvB,IAAI;AAAA,QACJ,WAAW;AAAA,QACX,OAAO,EAAE,QAAQ;AAAA,QACjB,OAAO;AAAA,QACP,GAAG;AAAA,QACH,GAAG;AAAA,QACH,GAAG;AAAA,QACH,GAAG;AAAA,QACH,IAAI,CAAC;AAAA,QACL,KAAK,CAAC;AAAA,MACP;AACA,YAAM,MAAM,IAAI,KAAK,CAAC;AACtB,aAAO,EAAE,KAAK,EAAG,KAAK,CAAC;AACvB,YAAM,IAAS;AAAA,QACd,SAAS,IAAI;AAAA,QACb,WAAW,IAAI;AAAA,QACf,SAAS,IAAI;AAAA,QACb,QAAQ,KAAK;AAAA,QACb,MAAM;AAAA,QACN,UAAU,IAAI;AAAA,QACd,UAAU;AAAA,MACX;AACA,WAAK,IAAI,KAAK,CAAC;AACf,QAAE,GAAG,KAAK,CAAC;AACX,cAAQ,KAAK,CAAC;AACd,aAAO;AAAA,IACR;AACA,UAAM,WAAgB;AAAA,MACrB,SAAS,IAAI;AAAA,MACb,WAAW,IAAI;AAAA,MACf,SAAS,IAAI;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,MAAM,EAAE;AAAA,MACR,UAAU,OAAO;AAAA,MACjB,UAAU;AAAA,IACX;AACA,SAAK,IAAI,KAAK,QAAQ;AACtB,MAAE,GAAG,KAAK,QAAQ;AAClB,YAAQ,KAAK,QAAQ;AAAA,EACtB;AAGA,aAAW,SAAS,QAAQ;AAC3B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EAAG,OAAM,CAAC,EAAG,QAAQ;AAAA,EAC7D;AACA,QAAM,SAAS;AACf,QAAM,OAAO;AACd;AAMA,SAAS,kBAAkB,OAA4B;AACtD,QAAM,SAAS;AACf,WAAS,QAAQ,GAAG,QAAQ,QAAQ,SAAS,GAAG;AAE/C,aAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,uBAAiB,OAAO,MAAM,OAAO,EAAE,GAAI,IAAI;AAC/C,cAAQ,MAAM,OAAO,EAAE,CAAE;AAAA,IAC1B;AAEA,aAAS,KAAK,MAAM,OAAO,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG;AACxD,uBAAiB,OAAO,MAAM,OAAO,EAAE,GAAI,KAAK;AAChD,cAAQ,MAAM,OAAO,EAAE,CAAE;AAAA,IAC1B;AAAA,EACD;AAEA,WAAS,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG;AACvC,QAAI,WAAW;AACf,aAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,YAAM,QAAQ,MAAM,OAAO,EAAE;AAC7B,eAAS,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK,GAAG;AAC7C,cAAM,SAAS,cAAc,OAAO,MAAM,CAAC,GAAI,MAAM,IAAI,CAAC,GAAI,IAAI;AAClE,SAAC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,GAAI,MAAM,CAAC,CAAE;AACpD,gBAAQ,KAAK;AACb,cAAM,QAAQ,cAAc,OAAO,MAAM,CAAC,GAAI,MAAM,IAAI,CAAC,GAAI,IAAI;AACjE,YAAI,QAAQ,QAAQ;AACnB,qBAAW;AAAA,QACZ,OAAO;AACN,WAAC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,GAAI,MAAM,CAAC,CAAE;AACpD,kBAAQ,KAAK;AAAA,QACd;AAAA,MACD;AAAA,IACD;AACA,QAAI,CAAC,SAAU;AAAA,EAChB;AACD;AAEA,SAAS,iBAAiB,OAAsB,OAAc,WAA+B;AAC5F,QAAM,OAAO,oBAAI,IAAoB;AACrC,aAAW,KAAK,OAAO;AACtB,UAAM,YAAY,cAAc,OAAO,EAAE,KAAK,EAAE;AAChD,QAAI,UAAU,WAAW,GAAG;AAC3B,WAAK,IAAI,EAAE,IAAI,EAAE,KAAK;AACtB;AAAA,IACD;AACA,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,eAAW,KAAK,WAAW;AAC1B,YAAM,QAAQ,MAAM,MAAM,IAAI,cAAc,OAAO,EAAE,SAAS,EAAE,IAAI;AACpE,UAAI,CAAC,MAAO;AACZ,aAAO,MAAM;AACb,eAAS;AAAA,IACV;AACA,SAAK,IAAI,EAAE,IAAI,UAAU,IAAI,EAAE,QAAQ,MAAM,KAAK;AAAA,EACnD;AACA,QAAM,KAAK,CAAC,GAAG,MAAM;AACpB,UAAM,KAAK,KAAK,IAAI,EAAE,EAAE;AACxB,UAAM,KAAK,KAAK,IAAI,EAAE,EAAE;AACxB,QAAI,OAAO,GAAI,QAAO,KAAK;AAC3B,WAAO,EAAE,QAAQ,EAAE;AAAA,EACpB,CAAC;AACF;AAEA,SAAS,QAAQ,OAAoB;AACpC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EAAG,OAAM,CAAC,EAAG,QAAQ;AAC7D;AAEA,SAAS,cACR,OACA,GACA,GACA,WACS;AACT,QAAM,SAAS,cAAc,OAAO,EAAE,KAAK,EAAE;AAC7C,QAAM,SAAS,cAAc,OAAO,EAAE,KAAK,EAAE;AAC7C,MAAI,YAAY;AAChB,aAAW,MAAM,QAAQ;AACxB,eAAW,MAAM,QAAQ;AACxB,YAAM,KAAK,MAAM,MAAM,IAAI,cAAc,OAAO,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS;AAC/E,YAAM,KAAK,MAAM,MAAM,IAAI,cAAc,OAAO,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS;AAC/E,UAAK,EAAE,QAAQ,EAAE,SAAS,KAAK,MAAQ,EAAE,QAAQ,EAAE,SAAS,KAAK,IAAK;AACrE,qBAAa;AAAA,MACd;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAMA,SAAS,kBAAkB,OAAsB,OAA0B;AAC1E,MAAI,MAAM,cAAc,KAAM,qBAAoB,OAAO,KAAK;AAAA,MACzD,qBAAoB,OAAO,KAAK;AACtC;AAEA,SAAS,oBAAoB,OAAsB,OAA0B;AAE5E,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,WAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,WAAO,KAAK,OAAO;AACnB,QAAI,OAAO;AACX,eAAW,KAAK,MAAM,OAAO,EAAE,EAAI,QAAO,KAAK,IAAI,MAAM,EAAE,CAAC;AAC5D,eAAW,OAAO,MAAM;AAAA,EACzB;AACA,WAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,eAAW,KAAK,MAAM,OAAO,EAAE,EAAI,GAAE,IAAI,OAAO,EAAE;AAAA,EACnD;AAEA,aAAW,SAAS,MAAM,QAAQ;AACjC,QAAI,IAAI;AACR,eAAW,KAAK,OAAO;AACtB,QAAE,IAAI;AACN,WAAK,EAAE,IAAI,MAAM;AAAA,IAClB;AAAA,EACD;AAEA,kBAAgB,OAAO,OAAO,GAAG;AAClC;AAEA,SAAS,oBAAoB,OAAsB,OAA0B;AAE5E,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,WAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,WAAO,KAAK,OAAO;AACnB,QAAI,OAAO;AACX,eAAW,KAAK,MAAM,OAAO,EAAE,EAAI,QAAO,KAAK,IAAI,MAAM,EAAE,CAAC;AAC5D,eAAW,OAAO,MAAM;AAAA,EACzB;AACA,WAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,eAAW,KAAK,MAAM,OAAO,EAAE,EAAI,GAAE,IAAI,OAAO,EAAE;AAAA,EACnD;AAEA,aAAW,SAAS,MAAM,QAAQ;AACjC,QAAI,IAAI;AACR,eAAW,KAAK,OAAO;AACtB,QAAE,IAAI;AACN,WAAK,EAAE,IAAI,MAAM;AAAA,IAClB;AAAA,EACD;AACA,kBAAgB,OAAO,OAAO,GAAG;AAClC;AAOA,SAAS,gBAAgB,OAAsB,OAAoB,MAAuB;AACzF,QAAM,SAAS,CAAC,MAAqB,SAAS,MAAM,EAAE,IAAI,EAAE;AAC5D,QAAM,MAAM,MAAM;AAClB,WAAS,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG;AACvC,UAAM,OAAO,SAAS,IAAI,MAAM,OAAO,MAAM,CAAC,IAAI,MAAM,OAAO,MAAM,GAAG,EAAE,EAAE,QAAQ;AACpF,eAAW,SAAS,MAAM;AACzB,YAAM,YAAY,oBAAI,IAAoB;AAC1C,iBAAW,KAAK,OAAO;AACtB,cAAM,YAAY,SAAS,IAAI,EAAE,KAAK,EAAE;AACxC,YAAI,UAAU,WAAW,EAAG;AAC5B,cAAM,UAAoB,CAAC;AAC3B,mBAAW,KAAK,WAAW;AAC1B,gBAAM,QAAQ,MAAM,MAAM,IAAI,SAAS,IAAI,EAAE,SAAS,EAAE,IAAI;AAC5D,cAAI,CAAC,MAAO;AACZ,gBAAM,OAAO,SAAS,MAAM,MAAM,IAAI,MAAM;AAC5C,kBAAQ,KAAK,OAAO,KAAK,MAAM,OAAO,KAAK,IAAI,CAAC,CAAC;AAAA,QAClD;AACA,YAAI,QAAQ,WAAW,EAAG;AAC1B,gBAAQ,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC5B,cAAM,MAAM,QAAQ,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;AAClD,kBAAU,IAAI,EAAE,IAAI,MAAM,KAAK,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;AAAA,MACpD;AACA,UAAI,QAAQ;AACZ,iBAAW,KAAK,OAAO;AACtB,cAAM,IAAI,UAAU,IAAI,EAAE,EAAE;AAC5B,cAAM,UAAU,SAAS,MAAM,EAAE,IAAI,EAAE;AACvC,cAAM,SAAS,KAAK;AACpB,cAAM,UAAU,KAAK,IAAI,QAAQ,KAAK;AACtC,YAAI,SAAS,IAAK,GAAE,IAAI;AAAA,YACnB,GAAE,IAAI;AACX,gBAAQ,UAAU,OAAO,CAAC,IAAI;AAAA,MAC/B;AAAA,IACD;AAAA,EACD;AACD;AAcA,SAAS,WAAW,OAAsB,OAAkC;AAE3E,QAAM,UAAU,oBAAI,IAAmB;AACvC,aAAW,KAAK,MAAM,MAAM;AAC3B,UAAM,MAAM,QAAQ,IAAI,EAAE,OAAO;AACjC,QAAI,IAAK,KAAI,KAAK,CAAC;AAAA,QACd,SAAQ,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;AAAA,EAChC;AACA,aAAW,OAAO,QAAQ,OAAO,EAAG,KAAI,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAE9E,QAAM,OAAO,MAAM,cAAc;AACjC,QAAM,UAAU,CAAC,MAA6B,OAAO,EAAE,IAAI,EAAE;AAC7D,QAAM,cAAc,CAAC,MAA6B,OAAO,EAAE,IAAI,EAAE;AACjE,QAAM,cAAc,CAAC,MACpB,OAAO,EAAE,IAAI,KAAK,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,EAAE,IAAI,CAAC;AAU5D,QAAM,gBAAgB,oBAAI,IAAiB;AAC3C,WAAS,IAAI,GAAG,IAAI,IAAI,MAAM,OAAO,QAAQ,KAAK,GAAG;AACpD,UAAM,WAAW,MAAM,OAAO,CAAC;AAC/B,UAAM,WAAW,MAAM,OAAO,IAAI,CAAC;AAEnC,QAAI,cAAc;AAClB,eAAW,KAAK,SAAU,eAAc,KAAK,IAAI,aAAa,QAAQ,CAAC,IAAI,YAAY,CAAC,CAAC;AACzF,QAAI,YAAY,OAAO;AACvB,eAAW,KAAK,SAAU,aAAY,KAAK,IAAI,WAAW,QAAQ,CAAC,CAAC;AACpE,UAAM,OAAO,OAAO,SAAS,SAAS,IAAK,YAAuB,IAAI;AACtE,UAAM,cAAc,KAAK,IAAI,GAAG,OAAO,cAAc,CAAC;AAEtD,UAAM,aAAoB,CAAC;AAC3B,eAAW,KAAK,SAAU,YAAW,KAAK,EAAE,IAAK,YAAW,KAAK,CAAC;AAClE,eAAW,KAAK,CAAC,GAAG,MAAM;AACzB,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,MAAM,CAAE;AACjD,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,MAAM,CAAE;AACjD,UAAI,OAAO,GAAI,QAAO,KAAK;AAC3B,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,IAAI,CAAE;AAC/C,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,IAAI,CAAE;AAC/C,aAAO,KAAK;AAAA,IACb,CAAC;AAKD,UAAM,SAAmD,CAAC;AAC1D,UAAM,gBAAgB,oBAAI,IAAiB;AAC3C,eAAW,KAAK,YAAY;AAC3B,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,MAAM,CAAE;AACjD,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,IAAI,CAAE;AAC/C,YAAM,KAAK,KAAK,IAAI,IAAI,EAAE;AAC1B,YAAM,KAAK,KAAK,IAAI,IAAI,EAAE;AAC1B,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC1C,cAAM,YAAY,OAAO,CAAC;AAC1B,YAAI,OAAO;AACX,mBAAW,MAAM,WAAW;AAC3B,cAAI,GAAG,MAAM,MAAM,MAAM,GAAG,IAAI;AAC/B,mBAAO;AACP;AAAA,UACD;AAAA,QACD;AACA,YAAI,MAAM;AACT,oBAAU,KAAK,EAAE,IAAI,GAAG,CAAC;AACzB,gBAAM;AACN;AAAA,QACD;AAAA,MACD;AACA,UAAI,MAAM,GAAG;AACZ,eAAO,KAAK,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;AACxB,cAAM,OAAO,SAAS;AAAA,MACvB;AACA,oBAAc,IAAI,GAAG,GAAG;AAAA,IACzB;AAQA,UAAM,QAAQ,OAAO;AACrB,UAAM,YAAY,eAAe,KAAK,IAAI,GAAG,QAAQ,CAAC;AACtD,UAAM,cAAc,YAAY,cAAc,IAAI;AAClD,UAAM,YAAY,YAAY,OAAO,IAAI;AACzC,UAAM,cAAc,KAAK,IAAI,GAAG,YAAY,cAAc,CAAC;AAC3D,eAAW,KAAK,YAAY;AAC3B,YAAM,MAAM,cAAc,IAAI,CAAC;AAC/B,UAAI;AACJ,UAAI,SAAS,GAAG;AACf,uBAAe,cAAc,KAAK,MAAM,cAAc,CAAC;AAAA,MACxD,OAAO;AACN,cAAM,QAAQ,cAAc,MAAM,QAAQ;AAC1C,uBAAe,cAAc,KAAK,MAAM,MAAM,IAAI;AAAA,MACnD;AACA,oBAAc,IAAI,GAAG,KAAK,IAAI,aAAa,KAAK,IAAI,MAAM,YAAY,CAAC,CAAC;AAAA,IACzE;AAAA,EACD;AAGA,QAAM,MAAoB,CAAC;AAC3B,aAAW,CAAC,EAAE,IAAI,KAAK,SAAS;AAC/B,UAAM,SAA4B,CAAC;AACnC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACxC,YAAM,IAAI,KAAK,CAAC;AAChB,YAAM,MAAM,MAAM,MAAM,IAAI,EAAE,MAAM;AACpC,YAAM,MAAM,MAAM,MAAM,IAAI,EAAE,IAAI;AAClC,YAAM,QAAQ,cAAc,IAAI,CAAC;AAEjC,YAAM,aAAa,IAAI,YAAY,QAAQ,GAAG,IAAI,QAAQ,GAAG,IAAI,YAAY,GAAG;AAChF,YAAM,aAAa,IAAI,YAAY,QAAQ,GAAG,IAAI,QAAQ,GAAG,IAAI;AACjE,YAAM,KAAK,YAAY,GAAG;AAC1B,YAAM,KAAK,YAAY,GAAG;AAC1B,UAAI,MAAM,EAAG,WAAU,QAAQ,MAAM,YAAY,EAAE;AACnD,UAAI,OAAO,IAAI;AACd,kBAAU,QAAQ,MAAM,OAAO,EAAE;AACjC,kBAAU,QAAQ,MAAM,OAAO,EAAE;AAAA,MAClC;AACA,gBAAU,QAAQ,MAAM,YAAY,EAAE;AAAA,IACvC;AACA,UAAM,QAAQ,KAAK,CAAC;AACpB,QAAI,KAAK;AAAA,MACR,MAAM,MAAM;AAAA,MACZ,IAAI,MAAM;AAAA,MACV,QAAQ,eAAe,MAAM;AAAA,IAC9B,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEA,SAAS,UAAU,KAAwB,MAAe,SAAiB,OAAqB;AAC/F,MAAI,KAAK,OAAO,EAAE,GAAG,SAAS,GAAG,MAAM,IAAI,EAAE,GAAG,OAAO,GAAG,QAAQ,CAAC;AACpE;AAEA,SAAS,eAAe,QAAuD;AAC9E,QAAM,MAAyB,CAAC;AAChC,aAAW,KAAK,QAAQ;AACvB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAI,CAAC,QAAQ,KAAK,MAAM,EAAE,KAAK,KAAK,MAAM,EAAE,EAAG,KAAI,KAAK,CAAC;AAAA,EAC1D;AACA,SAAO;AACR;AAMA,SAAS,YAAY,OAAyD;AAC7E,MAAI,IAAI;AACR,MAAI,IAAI;AACR,aAAW,SAAS,MAAM,QAAQ;AACjC,eAAW,KAAK,OAAO;AACtB,UAAI,KAAK,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC;AACzB,UAAI,KAAK,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC;AAAA,IAC1B;AAAA,EACD;AACA,SAAO,EAAE,OAAO,GAAG,QAAQ,EAAE;AAC9B;;;ACvpBA,IAAM,sBAAsB;AAC5B,IAAM,YAAY;AAClB,IAAM,WAAW;AACjB,IAAM,aAAa;AAgBZ,SAAS,iBAAiB,GAAwB,MAAwC;AAChG,QAAM,YAAY,wBAAwB,MAAM,SAAS;AACzD,QAAM,WAAW,KAAK,IAAI,GAAG,MAAM,iBAAiB,mBAAmB;AACvE,QAAM,UAAU,MAAM,gBAAgB;AAGtC,QAAM,QAAQ,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK;AAGxC,QAAM,UAAU,IAAI,IAAI,KAAK;AAC7B,QAAM,QAAQ,EAAE,MAAM,OAAO,CAAC,MAAM,QAAQ,IAAI,EAAE,IAAI,KAAK,QAAQ,IAAI,EAAE,EAAE,CAAC;AAI5E,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,KAAK,OAAO;AACtB,UAAM,QAAQ,gBAAgB,GAAG,QAAQ;AACzC,WAAO,IAAI,GAAG,KAAK;AAEnB,WAAO,IAAI,GAAG,WAAW,KAAK,IAAI,CAAC;AAAA,EACpC;AAEA,QAAM,SAAS,eAAe;AAAA,IAC7B,OAAO;AAAA,IACP;AAAA,IACA,YAAY,CAAC,OAAO,OAAO,IAAI,EAAE,KAAK;AAAA,IACtC,aAAa,MAAM;AAAA,IACnB,UAAU;AAAA,IACV,SAAS;AAAA,IACT;AAAA,EACD,CAAC;AAED,QAAM,OAAO,WAAW,QAAQ;AAAA,IAC/B;AAAA,IACA,SAAS,CAAC,OAAO,OAAO,IAAI,EAAE,KAAK;AAAA,EACpC,CAAC;AAED,QAAM,SAAS,IAAI;AACnB,SAAO;AACR;AAEA,SAAS,wBAAwB,WAAqC;AACrE,MAAI,cAAc,UAAa,cAAc,KAAM,QAAO;AAC1D,MAAI,cAAc,KAAM,QAAO;AAI/B,QAAM,IAAI,MAAM,4DAA4D,OAAO,SAAS,CAAC,EAAE;AAChG;;;AC3EO,SAAS,cAAc,OAAyB;AACtD,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAChD,WAAO;AAAA,EACR;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,WAAO,MAAM,IAAI,aAAa;AAAA,EAC/B;AACA,QAAM,MAAM;AACZ,QAAM,OAAO,OAAO,KAAK,GAAG,EAAE,KAAK;AACnC,QAAM,MAA+B,CAAC;AACtC,aAAW,KAAK,MAAM;AACrB,QAAI,CAAC,IAAI,cAAc,IAAI,CAAC,CAAC;AAAA,EAC9B;AACA,SAAO;AACR;AAGO,SAAS,mBAAmB,OAAuB;AACzD,SAAO,MAAM,WAAW,MAAM,MAAM,EAAE,WAAW,KAAK,KAAK;AAC5D;AAGO,SAAS,cAAc,OAAuB;AACpD,SAAO,MAAM,WAAW,MAAM,MAAM,EAAE,WAAW,KAAK,KAAK;AAC5D;AAGO,SAAS,8BAA8B,WAAqC;AAClF,MAAI,cAAc,KAAM,QAAO;AAC/B,MAAI,cAAc,KAAM,QAAO;AAC/B,MAAI,cAAc,KAAM,QAAO;AAC/B,SAAO;AACR;AAGO,SAAS,qBAAqB,WAAoD;AACxF,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,SAA6B,CAAC;AACpC,WAAS,IAAI,MAAc,IAAkB;AAC5C,UAAM,MAAM,GAAG,IAAI,KAAK,EAAE;AAC1B,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,SAAK,IAAI,GAAG;AACZ,WAAO,KAAK,CAAC,MAAM,EAAE,CAAC;AAAA,EACvB;AACA,aAAW,CAAC,MAAM,IAAI,KAAK,OAAO,QAAQ,UAAU,KAAK,GAAG;AAC3D,UAAM,OAA8B,KAAiC;AAGrE,QAAI,MAAM;AACT,iBAAW,OAAO,KAAM,KAAI,KAAK,IAAI;AAAA,IACtC;AAAA,EACD;AACA,aAAW,QAAQ,UAAU,MAAO,KAAI,KAAK,MAAM,KAAK,EAAE;AAC1D,SAAO;AACR;AAGO,SAAS,0BAA0B,WAAsC;AAC/E,MAAI,cAAc,OAAW,QAAO;AACpC,MAAI,cAAc,QAAQ,cAAc,QAAQ,cAAc,QAAQ,cAAc,MAAM;AACzF,WAAO;AAAA,EACR;AACA,QAAM,IAAI;AAAA,IACT,6BAA6B,OAAO,SAAS,CAAC;AAAA,EAC/C;AACD;AAGO,SAAS,aAAa,OAAwB;AACpD,MAAI,OAAO,UAAU,SAAU,QAAO,KAAK,UAAU,KAAK;AAC1D,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,SAAS;AACvE,WAAO,OAAO,KAAK;AACpB,MAAI;AACH,WAAO,KAAK,UAAU,KAAK;AAAA,EAC5B,QAAQ;AACP,WAAO;AAAA,EACR;AACD;;;ACrEO,SAAS,cAAc,GAAwB,MAAqC;AAC1F,QAAM,YAAY,0BAA0B,MAAM,SAAS;AAC3D,QAAM,QAAQ,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK;AACxC,QAAM,MAAM,oBAAI,IAAoB;AACpC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EAAG,KAAI,IAAI,MAAM,CAAC,GAAI,IAAI,CAAC,EAAE;AACpE,QAAM,QAAkB,CAAC,cAAc,8BAA8B,SAAS,CAAC,EAAE;AACjF,aAAW,QAAQ,OAAO;AACzB,UAAM,KAAK,IAAI,IAAI,IAAI;AACvB,UAAM,KAAK,GAAG,EAAE,MAAM,cAAc,IAAI,CAAC,GAAG;AAAA,EAC7C;AACA,aAAW,CAAC,MAAM,EAAE,KAAK,qBAAqB,CAAC,GAAG;AACjD,UAAM,SAAS,IAAI,IAAI,IAAI;AAC3B,UAAM,OAAO,IAAI,IAAI,EAAE;AACvB,QAAI,CAAC,UAAU,CAAC,KAAM;AACtB,UAAM,KAAK,GAAG,MAAM,OAAO,IAAI,EAAE;AAAA,EAClC;AACA,SAAO,MAAM,KAAK,IAAI;AACvB;;;ACjBO,SAAS,gBAAgB,GAAwB,MAAuC;AAC9F,QAAM,eAAe,MAAM,gBAAgB;AAC3C,QAAM,mBAAmB,MAAM,oBAAoB;AACnD,QAAM,EAAE,QAAQ,SAAS,GAAG,KAAK,IAAI;AACrC,QAAM,UAA+B;AAAA,IACpC,GAAG;AAAA,IACH,OAAO,eAAe,EAAE,QAAQ,CAAC;AAAA,IACjC,WAAW,mBAAmB,EAAE,YAAY,CAAC;AAAA,EAC9C;AACA,QAAM,OAAO,KAAK,UAAU,cAAc,OAAO,GAAG,MAAM,MAAM,UAAU,CAAC;AAC3E,QAAM,SAAS,IAAI;AACnB,SAAO;AACR;;;ACFO,SAAS,mBACf,GACA,MACS;AACT,QAAM,YAAY,0BAA0B,MAAM,SAAS;AAC3D,QAAM,QAAQ,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK;AACxC,QAAM,MAAM,oBAAI,IAAoB;AACpC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EAAG,KAAI,IAAI,MAAM,CAAC,GAAI,IAAI,CAAC,EAAE;AACpE,QAAM,QAAkB,CAAC,aAAa,SAAS,EAAE;AACjD,aAAW,QAAQ,OAAO;AACzB,UAAM,KAAK,IAAI,IAAI,IAAI;AACvB,UAAM,KAAK,KAAK,EAAE,KAAK,mBAAmB,IAAI,CAAC,IAAI;AAAA,EACpD;AACA,aAAW,CAAC,MAAM,EAAE,KAAK,qBAAqB,CAAC,GAAG;AACjD,UAAM,SAAS,IAAI,IAAI,IAAI;AAC3B,UAAM,OAAO,IAAI,IAAI,EAAE;AACvB,QAAI,CAAC,UAAU,CAAC,KAAM;AACtB,UAAM,KAAK,KAAK,MAAM,QAAQ,IAAI,EAAE;AAAA,EACrC;AACA,SAAO,MAAM,KAAK,IAAI;AACvB;;;AC3BO,SAAS,eACf,YACA,MACS;AACT,QAAM,QAAQ,MAAM,SAAS;AAC7B,QAAM,WAAW,MAAM,YAAY;AACnC,QAAM,UAAU,EAAE,MAAM,YAAY,SAAS,EAAE,MAAM,GAAG,SAAS;AACjE,QAAM,OAAO,KAAK,UAAU,OAAO;AAGnC,QAAM,QAAQ,IAAI,YAAY,EAAE,OAAO,IAAI;AAC3C,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAK,WAAU,OAAO,aAAa,MAAM,CAAC,CAAE;AAC9E,QAAM,MAAM,WAAW,KAAK,MAAM,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,EAAE;AAC7F,SAAO,oCAAoC,GAAG;AAC/C;AAEO,SAAS,sBACf,GACA,MACS;AACT,QAAM,aAAa,mBAAmB,GAAG,IAAI;AAC7C,SAAO,eAAe,YAAY,IAAI;AACvC;;;AC3BO,SAAS,kBAAkB,GAAwB,MAAyC;AAClG,QAAM,eAAe,MAAM,gBAAgB;AAC3C,QAAM,mBAAmB,MAAM,oBAAoB;AACnD,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,SAAS,EAAE,IAAI,EAAE;AAC5B,QAAM,KAAK,QAAQ;AACnB,aAAW,QAAQ,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG;AAC/C,UAAM,IAAI,EAAE,MAAM,IAAI;AACtB,UAAM,KAAK,KAAK,IAAI,KAAK,EAAE,IAAI,IAAI,EAAE,MAAM,MAAM,aAAa,EAAE,KAAK,CAAC,EAAE;AAAA,EACzE;AACA,MAAI,cAAc;AACjB,UAAM,KAAK,QAAQ;AACnB,eAAW,QAAQ,EAAE,OAAO;AAC3B,YAAM,KAAK,KAAK,KAAK,IAAI,OAAO,KAAK,EAAE,EAAE;AAAA,IAC1C;AAAA,EACD;AACA,MAAI,kBAAkB;AACrB,UAAM,KAAK,YAAY;AACvB,eAAW,MAAM,EAAE,WAAW;AAC7B,YAAM,KAAK,KAAK,EAAE,EAAE;AAAA,IACrB;AAAA,EACD;AACA,QAAM,OAAO,MAAM,KAAK,IAAI;AAC5B,QAAM,SAAS,IAAI;AACnB,SAAO;AACR;;;ACRA,IAAM,gBAAwC;AAAA,EAC7C,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AACN;AAEA,SAAS,UAAU,GAAmB;AACrC,SAAO,EAAE,QAAQ,YAAY,CAAC,MAAM,cAAc,CAAC,KAAK,CAAC;AAC1D;AAMO,SAAS,iBAAiB,OAAoB,MAAwC;AAC5F,QAAM,QAAQ,MAAM,aAAa;AACjC,QAAM,QAAQ,MAAM,cAAc;AAClC,QAAM,MAAM,MAAM,WAAW;AAK7B,QAAM,YAAY,UAAU,MAAM,aAAa,MAAM;AACrD,QAAM,UAAU,UAAU,MAAM,WAAW,MAAM;AACjD,QAAM,aAAa,UAAU,MAAM,cAAc,MAAM;AACvD,QAAM,YAAY,UAAU,MAAM,aAAa,MAAM;AACrD,QAAM,aAAa,MAAM,cAAc;AACvC,QAAM,WAAW,MAAM,YAAY;AAEnC,MAAI,OAAO;AACX,MAAI,OAAO;AACX,aAAW,KAAK,MAAM,OAAO;AAC5B,WAAO,KAAK,IAAI,MAAM,EAAE,IAAI,EAAE,CAAC;AAC/B,WAAO,KAAK,IAAI,MAAM,EAAE,IAAI,EAAE,CAAC;AAAA,EAChC;AACA,aAAW,KAAK,MAAM,OAAO;AAC5B,eAAW,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ;AAC9B,aAAO,KAAK,IAAI,MAAM,CAAC;AACvB,aAAO,KAAK,IAAI,MAAM,CAAC;AAAA,IACxB;AAAA,EACD;AACA,QAAM,QAAQ,KAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,MAAM;AAChD,QAAM,SAAS,KAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,MAAM;AAEjD,QAAM,QAAkB,CAAC;AACzB,QAAM;AAAA,IACL,wDAAwD,KAAK,IAAI,MAAM,YAAY,KAAK,aAAa,MAAM;AAAA,EAC5G;AAGA,aAAW,KAAK,MAAM,OAAO;AAC5B,QAAI,EAAE,OAAO,SAAS,EAAG;AACzB,UAAM,MAAM,EAAE,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,QAAQ,GAAG,IAAI,IAAI,QAAQ,GAAG,EAAE,EAAE,KAAK,GAAG;AACtF,UAAM;AAAA,MACL,uBAAuB,GAAG,yBAAyB,UAAU,iCAAiC,UAAU,EAAE,IAAI,CAAC,cAAc,UAAU,EAAE,EAAE,CAAC,qBAAqB,EAAE,QAAQ;AAAA,IAC5K;AAAA,EACD;AAGA,aAAW,KAAK,MAAM,OAAO;AAC5B,UAAM,KAAK,EAAE,IAAI,QAAQ;AACzB,UAAM,KAAK,EAAE,IAAI,QAAQ;AACzB,UAAM,KAAK,KAAK,IAAI,GAAG,EAAE,CAAC,IAAI;AAC9B,UAAM,KAAK,KAAK,IAAI,GAAG,EAAE,CAAC,IAAI;AAE9B,UAAM,QAAQ,EAAE,GAAG,SAAS,IAAI,IAAK,EAAE,GAAG,MAAM,IAAI,EAAE,IAAI,KAAK,EAAE,KAAM,EAAE;AACzE,UAAM;AAAA,MACL,iBAAiB,UAAU,EAAE,EAAE,CAAC;AAAA,MAChC,gBAAgB,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,WAAW,OAAO,aAAa,SAAS;AAAA,MACjG,gBAAgB,KAAK,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC,WAAW,SAAS,kBAAkB,UAAU,UAAU,CAAC,gBAAgB,QAAQ,sDAAsD,UAAU,KAAK,CAAC;AAAA,MACvM;AAAA,IACD;AAAA,EACD;AAEA,QAAM,KAAK,QAAQ;AACnB,SAAO,MAAM,KAAK,IAAI;AACvB;","names":[]}

package/dist/base/render/index.d.cts

@@ -0,0 +1,227 @@
+import { GraphDescribeOutput } from '@graphrefly/pure-ts/graph';
+import { c as LayoutFrame } from '../../layout-types-B5aiHYgk.cjs';
+
+/**
+ * Internal helpers shared across renderers in `extra/render/`.
+ *
+ * These are pure functions over `GraphDescribeOutput` — no Graph instance
+ * dependency. Extracted from `src/graph/graph.ts` (the consolidated
+ * ex-dumpGraph / ex-graphSpecToMermaid / ex-graphSpecToD2 renderers) per
+ * Tier 2.1 A2.
+ */
+
+/** Direction options for diagram exports. */
+type DiagramDirection = "TD" | "LR" | "BT" | "RL";
+
+/**
+ * Sugiyama-style layered DAG layout on an integer grid.
+ *
+ * Pipeline:
+ *   1. Longest-path layer assignment (sources at layer 0).
+ *   2. Virtual-node splitting — every edge spanning more than one layer
+ *      becomes a chain of synthetic nodes on intermediate layers. Downstream
+ *      passes treat real and virtual nodes identically; crossing
+ *      minimization therefore works on wide + deep DAGs, not only
+ *      adjacent-layer cases.
+ *   3. Crossing minimization — barycenter heuristic with alternating up /
+ *      down sweeps plus an adjacent-transposition polish pass.
+ *   4. Coordinate assignment — greedy median-aligned packing with collision
+ *      resolution. Straightens vertical runs of virtual nodes so long edges
+ *      become straight lines where topology allows.
+ *   5. Orthogonal edge routing — per-gutter x-track assignment; horizontal
+ *      segments sit at endpoint centerlines, vertical segments pack into the
+ *      gutter column range without overlap. Remaining crossings are
+ *      topologically unavoidable and will render as `┼` at draw time.
+ *
+ * Output coordinates are cell-grid integers (LR direction). TD rendering
+ * swaps axes at draw time — the layout is direction-agnostic by
+ * construction.
+ *
+ * Used only by [graph-spec-to-ascii.ts](./graph-spec-to-ascii.ts); not part of the public
+ * `extra/render/index.ts` surface (underscore-prefixed).
+ */
+type LayoutDirection = "LR" | "TD";
+
+/**
+ * `graphSpecToAscii(g, opts?)` — stdout-native DAG flowchart renderer for a
+ * {@link GraphDescribeOutput}.
+ *
+ * Zero external dependencies, graph-size independent via proper Sugiyama
+ * (layer assignment → virtual-node splitting → barycenter crossing
+ * minimization → median-aligned coordinate assignment → per-gutter
+ * track-assigned orthogonal routing). See
+ * [_layout-sugiyama.ts](./_layout-sugiyama.ts) for the layout pipeline and
+ * [_ascii-grid.ts](./_ascii-grid.ts) for the character blitter.
+ *
+ * Pure function over the describe snapshot; no Graph instance dependency.
+ *
+ * @category extra
+ */
+
+type GraphSpecToAsciiOptions = {
+    /**
+     * ASCII layout direction. ASCII grid semantics are meaningful only for
+     * `"LR"` (default) and `"TD"`.
+     */
+    direction?: LayoutDirection;
+    /** Per-box label cell cap; longer labels are truncated with `…`. Default `24`. */
+    maxLabelWidth?: number;
+    /** Glyph set: `"unicode"` (default, box-drawing) or `"ascii"` (`-|+<>v`). */
+    asciiCharset?: "unicode" | "ascii";
+    /** Optional logger hook; fires with the rendered text before return. */
+    logger?: (text: string) => void;
+};
+declare function graphSpecToAscii(g: GraphDescribeOutput, opts?: GraphSpecToAsciiOptions): string;
+
+/**
+ * `graphSpecToD2(g, opts?)` — render a {@link GraphDescribeOutput} as D2
+ * diagram text.
+ *
+ * Pure function over the describe snapshot; no Graph instance dependency.
+ *
+ * @category extra
+ */
+
+type GraphSpecToD2Options = {
+    /** Diagram direction; default `"LR"`. */
+    direction?: DiagramDirection;
+};
+declare function graphSpecToD2(g: GraphDescribeOutput, opts?: GraphSpecToD2Options): string;
+
+/**
+ * `graphSpecToJson(g, opts?)` — render a {@link GraphDescribeOutput} as
+ * deterministic JSON text with sorted keys.
+ *
+ * Pure function over the describe snapshot; no Graph instance dependency.
+ *
+ * @category extra
+ */
+
+type GraphSpecToJsonOptions = {
+    /** Include the Edges section (default `true`). */
+    includeEdges?: boolean;
+    /** Include the Subgraphs section (default `true`). */
+    includeSubgraphs?: boolean;
+    /** JSON indent (default `2`). */
+    indent?: number;
+    /** Optional logger hook; fires with the rendered text before return. */
+    logger?: (text: string) => void;
+};
+declare function graphSpecToJson(g: GraphDescribeOutput, opts?: GraphSpecToJsonOptions): string;
+
+/**
+ * `graphSpecToMermaid(g, opts?)` — render a {@link GraphDescribeOutput} as
+ * Mermaid flowchart text.
+ *
+ * Pure function over the describe snapshot; no Graph instance dependency.
+ * Compose with `derived` for live formatted output:
+ *
+ * ```ts
+ * import { graphSpecToMermaid } from "@graphrefly/graphrefly/extra/render";
+ * import { derived } from "@graphrefly/graphrefly";
+ *
+ * const live = derived(
+ *   [graph.describe({ reactive: true }).node],
+ *   ([g]) => graphSpecToMermaid(g),
+ * );
+ * ```
+ *
+ * @category extra
+ */
+
+type GraphSpecToMermaidOptions = {
+    /** Diagram direction; default `"LR"`. */
+    direction?: DiagramDirection;
+};
+declare function graphSpecToMermaid(g: GraphDescribeOutput, opts?: GraphSpecToMermaidOptions): string;
+
+/**
+ * `graphSpecToMermaidUrl(g, opts?)` — encode a {@link GraphDescribeOutput}
+ * as a `https://mermaid.live/edit#base64:…` deep link.
+ *
+ * Round-trip with the mermaid.live editor's `/edit#base64:` share format —
+ * payload is `base64url(JSON({code, mermaid: {theme}, ...}))`. No network
+ * calls; the payload is encoded into the URL fragment.
+ *
+ * @category extra
+ */
+
+type MermaidLiveTheme = "default" | "dark" | "forest" | "neutral" | "base";
+type GraphSpecToMermaidUrlOptions = GraphSpecToMermaidOptions & {
+    theme?: MermaidLiveTheme;
+    autoSync?: boolean;
+};
+/**
+ * Encode an arbitrary mermaid source string to a `mermaid.live` deep link.
+ * Exported separately so callers that already rendered mermaid text can
+ * upgrade to a live-editor URL without re-rendering.
+ */
+declare function mermaidLiveUrl(mermaidSrc: string, opts?: {
+    theme?: MermaidLiveTheme;
+    autoSync?: boolean;
+}): string;
+declare function graphSpecToMermaidUrl(g: GraphDescribeOutput, opts?: GraphSpecToMermaidUrlOptions): string;
+
+/**
+ * `graphSpecToPretty(g, opts?)` — render a {@link GraphDescribeOutput} as
+ * human-readable plaintext (Node list with values, plus optional Edges and
+ * Subgraphs sections).
+ *
+ * Pure function over the describe snapshot; no Graph instance dependency.
+ *
+ * @category extra
+ */
+
+type GraphSpecToPrettyOptions = {
+    /** Include the Edges section (default `true`). */
+    includeEdges?: boolean;
+    /** Include the Subgraphs section (default `true`). */
+    includeSubgraphs?: boolean;
+    /** Optional logger hook; fires with the rendered text before return. */
+    logger?: (text: string) => void;
+};
+declare function graphSpecToPretty(g: GraphDescribeOutput, opts?: GraphSpecToPrettyOptions): string;
+
+/**
+ * `layoutFrameToSvg(frame, opts?)` — render a {@link LayoutFrame} as an SVG
+ * markup string.
+ *
+ * Universal-safe — emits a string, not a DOM tree. Browser code embeds via
+ * `el.innerHTML = svg`; Node code writes to a file. Cell-grid coordinates from
+ * the layout are scaled by `cellWidth` / `cellHeight` (default 12 × 18 px,
+ * roughly matching a monospace baseline).
+ *
+ * Each box gets `data-id="<path>"` for change-event highlighting; each edge
+ * gets `data-from="<from>" data-to="<to>"` so renderers can animate flowing
+ * data per `LayoutFrame.changes`.
+ *
+ * @category extra
+ */
+
+interface LayoutFrameToSvgOptions {
+    /** Pixel width of one cell. Default: `12`. */
+    readonly cellWidth?: number;
+    /** Pixel height of one cell. Default: `18`. */
+    readonly cellHeight?: number;
+    /** Outer margin in pixels. Default: `16`. */
+    readonly padding?: number;
+    /** Box stroke color. Default: `"#444"`. */
+    readonly boxStroke?: string;
+    /** Box fill color. Default: `"#fff"`. */
+    readonly boxFill?: string;
+    /** Edge stroke color. Default: `"#888"`. */
+    readonly edgeStroke?: string;
+    /** Box label text color. Default: `"#111"`. */
+    readonly textColor?: string;
+    /** Font family. Default: `"ui-monospace, monospace"`. */
+    readonly fontFamily?: string;
+    /** Font size in pixels. Default: `12`. */
+    readonly fontSize?: number;
+}
+/**
+ * Render a {@link LayoutFrame} to SVG markup. Pure function — call from
+ * `derived` to drive a live `<svg>` element from a `topologyView` output.
+ */
+declare function layoutFrameToSvg(frame: LayoutFrame, opts?: LayoutFrameToSvgOptions): string;
+
+export { type DiagramDirection, type GraphSpecToAsciiOptions, type GraphSpecToD2Options, type GraphSpecToJsonOptions, type GraphSpecToMermaidOptions, type GraphSpecToMermaidUrlOptions, type GraphSpecToPrettyOptions, type LayoutDirection, type LayoutFrameToSvgOptions, type MermaidLiveTheme, graphSpecToAscii, graphSpecToD2, graphSpecToJson, graphSpecToMermaid, graphSpecToMermaidUrl, graphSpecToPretty, layoutFrameToSvg, mermaidLiveUrl };