@prisma/orm-toolchain 0.16.0-dev.36

package/dist/migration-graph-command-render-BKrg6BPv-BP8Pfj4J.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"migration-graph-command-render-BKrg6BPv-BP8Pfj4J.mjs","names":[],"sources":["../../../../1-framework/3-tooling/cli/dist/migration-graph-command-render-BKrg6BPv.mjs"],"sourcesContent":["import { ifDefined } from \"@internal/utils/defined\";\nimport { bold, createColors, cyan, cyanBright, dim, green, yellow } from \"colorette\";\nimport stringWidth from \"string-width\";\nimport { InternalError } from \"@internal/utils/internal-error\";\nimport { EMPTY_CONTRACT_HASH } from \"@internal/migration-tools/constants\";\n//#region src/utils/formatters/migration-graph-occlusion-render.ts\n/**\n* Occlusion renderer for the line/plane/occlusion migration-graph.\n*\n* Per cell: pick the topmost-plane line (lowest plane number = drawn on top),\n* look up its glyph, apply colour from the line's lane or role. Lower-plane\n* lines are occluded (not drawn).\n*\n* Colour is forced via createColors({ useColor: true }) regardless of NO_COLOR.\n*/\nconst palette = createColors({ useColor: true });\nconst LANE_COLORIZERS = [\n\tpalette.white,\n\tpalette.cyan,\n\tpalette.yellow,\n\tpalette.blueBright,\n\tpalette.magenta,\n\tpalette.green\n];\nfunction laneColor(lane) {\n\treturn LANE_COLORIZERS[lane % LANE_COLORIZERS.length] ?? ((t) => t);\n}\n/**\n* The colourizer for a lane's hue (lane0 = white, lane1 = cyan, …). Exported\n* so the per-row LABEL renderer can tint a migration name in its lane's colour,\n* matching the node `○`, the edges, and the arrows drawn in the gutter — one\n* colour per lane across glyph and text.\n*/\nfunction laneColorizer(lane) {\n\treturn laneColor(lane);\n}\nfunction roleColor(role) {\n\treturn role === \"on-path\" ? palette.greenBright : palette.dim;\n}\nconst UNICODE_ALPHABET = {\n\tvertical: \"│\",\n\thorizontal: \"─\",\n\tcornerUpRight: \"╰\",\n\tcornerDownRight: \"╭\",\n\tcornerUpLeft: \"╯\",\n\tcornerDownLeft: \"╮\",\n\tarrowUp: \"↑\",\n\tarrowDown: \"↓\",\n\tnode: \"○\",\n\tselfLoop: \"⟲\",\n\tlandingArrow: \"◂\",\n\tfallback: \"?\"\n};\nconst ASCII_ALPHABET = {\n\tvertical: \"|\",\n\thorizontal: \"-\",\n\tcornerUpRight: \"\\\\\",\n\tcornerDownRight: \"/\",\n\tcornerUpLeft: \"/\",\n\tcornerDownLeft: \"\\\\\",\n\tarrowUp: \"^\",\n\tarrowDown: \"v\",\n\tnode: \"*\",\n\tselfLoop: \"@\",\n\tlandingArrow: \"<\",\n\tfallback: \"?\"\n};\nfunction alphabetFor(mode) {\n\treturn mode === \"ascii\" ? ASCII_ALPHABET : UNICODE_ALPHABET;\n}\nfunction glyphFor(dirs, alphabet) {\n\tconst has = (d) => dirs.has(d);\n\tif (has(\"up\") && has(\"down\") && !has(\"left\") && !has(\"right\")) return alphabet.vertical;\n\tif (has(\"left\") && has(\"right\") && !has(\"up\") && !has(\"down\")) return alphabet.horizontal;\n\tif (has(\"up\") && has(\"right\") && !has(\"down\") && !has(\"left\")) return alphabet.cornerUpRight;\n\tif (has(\"down\") && has(\"right\") && !has(\"up\") && !has(\"left\")) return alphabet.cornerDownRight;\n\tif (has(\"up\") && has(\"left\") && !has(\"down\") && !has(\"right\")) return alphabet.cornerUpLeft;\n\tif (has(\"down\") && has(\"left\") && !has(\"up\") && !has(\"right\")) return alphabet.cornerDownLeft;\n\tif (has(\"up\") && !has(\"down\") && !has(\"left\") && !has(\"right\")) return alphabet.arrowUp;\n\tif (has(\"down\") && !has(\"up\") && !has(\"left\") && !has(\"right\")) return alphabet.arrowDown;\n\treturn alphabet.fallback;\n}\nconst NO_COLOR = (t) => t;\nfunction renderCell(cell, colorEnabled, alphabet) {\n\tif (cell.node !== void 0) return (!colorEnabled ? NO_COLOR : cell.node.role !== void 0 ? roleColor(cell.node.role) : laneColor(cell.node.lane))(alphabet.node);\n\tif (cell.lines.length === 0) return \" \";\n\tconst topLine = cell.lines.reduce((best, current) => {\n\t\tif (current.plane < best.plane) return current;\n\t\tif (current.plane > best.plane) return best;\n\t\tif (current.line.role === \"on-path\" && best.line.role !== \"on-path\") return current;\n\t\treturn best;\n\t}, cell.lines[0]);\n\tconst glyph = topLine.selfLoop === true ? alphabet.selfLoop : topLine.landingArrow === true ? alphabet.landingArrow : glyphFor(topLine.directions, alphabet);\n\treturn (!colorEnabled ? NO_COLOR : topLine.line.role !== void 0 ? roleColor(topLine.line.role) : laneColor(topLine.line.lane))(glyph);\n}\n/**\n* Render a single grid row to a coloured string. A completely empty row returns\n* the empty string (the row is NOT dropped) so callers that pair grid rows with\n* an external per-row label list keep a 1:1 index correspondence. `renderGrid`\n* itself drops empty rows for its standalone output (but preserves separator rows).\n*/\nfunction renderGridRow(row, opts = {}) {\n\tif (row[0]?.separator === true) return \"\";\n\tlet lastNonEmpty = -1;\n\tfor (let i = row.length - 1; i >= 0; i--) {\n\t\tconst cell = row[i];\n\t\tif (cell !== void 0 && (cell.lines.length > 0 || cell.node !== void 0)) {\n\t\t\tlastNonEmpty = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (lastNonEmpty < 0) return \"\";\n\tconst colsPerLane = opts.colsPerLane ?? 2;\n\tconst colorEnabled = opts.colorize ?? true;\n\tconst alphabet = alphabetFor(opts.glyphMode ?? \"unicode\");\n\tconst lastConnectorCol = Math.floor(lastNonEmpty / colsPerLane) * colsPerLane + (colsPerLane - 1);\n\tconst renderThrough = Math.max(lastNonEmpty, lastConnectorCol);\n\tlet line = \"\";\n\tfor (let col = 0; col <= Math.min(renderThrough, row.length - 1); col++) {\n\t\tconst cell = row[col];\n\t\tline += cell === void 0 ? \" \" : renderCell(cell, colorEnabled, alphabet);\n\t}\n\treturn line;\n}\nfunction migrationListForwardArrow(glyphMode) {\n\treturn glyphMode === \"ascii\" ? \"->\" : \"→\";\n}\nfunction migrationListEmptySource(glyphMode) {\n\treturn glyphMode === \"ascii\" ? \"-\" : \"∅\";\n}\nfunction abbreviateContractHash(hash) {\n\treturn hash.slice(0, 7);\n}\nfunction padFromHashColumn(text, width) {\n\tconst padding = Math.max(0, width - stringWidth(text));\n\treturn `${\" \".repeat(padding)}${text}`;\n}\n//#endregion\n//#region src/utils/formatters/migration-graph-grid-layout.ts\n/**\n* Grid layout for the line/plane/occlusion migration-graph renderer.\n*\n* Produces a Grid (rows × cells) from a MigrationGraphRowModel. Each node\n* emits: fork connector, self-loop rows, node row, merge connector, and\n* inbound migration rows — in display order (tips first, then roots).\n*/\nfunction buildLaneAssignment(nodes, edges) {\n\tconst fwdEdges = edges.filter((e) => e.kind === \"forward\" && e.from !== e.to);\n\tconst outbound = /* @__PURE__ */ new Map();\n\tconst inbound = /* @__PURE__ */ new Map();\n\tfor (const edge of fwdEdges) {\n\t\tconst ob = outbound.get(edge.from);\n\t\tif (ob) ob.push(edge);\n\t\telse outbound.set(edge.from, [edge]);\n\t\tconst ib = inbound.get(edge.to);\n\t\tif (ib) ib.push(edge);\n\t\telse inbound.set(edge.to, [edge]);\n\t}\n\tfor (const list of outbound.values()) list.sort((a, b) => a.dirName.localeCompare(b.dirName));\n\tfor (const list of inbound.values()) list.sort((a, b) => a.dirName.localeCompare(b.dirName));\n\tconst components = [];\n\tlet current = [];\n\tfor (const n of nodes) if (n === null) {\n\t\tif (current.length > 0) components.push(current);\n\t\tcurrent = [];\n\t} else current.push(n);\n\tif (current.length > 0) components.push(current);\n\tconst allNodes = /* @__PURE__ */ new Set();\n\tfor (const n of nodes) if (n !== null) allNodes.add(n);\n\tconst nodeRank = /* @__PURE__ */ new Map();\n\tfor (const n of allNodes) nodeRank.set(n, 0);\n\tfor (let pass = 0; pass < allNodes.size; pass++) {\n\t\tlet changed = false;\n\t\tfor (const [from, es] of outbound) {\n\t\t\tconst base = nodeRank.get(from) ?? 0;\n\t\t\tfor (const e of es) {\n\t\t\t\tconst next = base + 1;\n\t\t\t\tif (next > (nodeRank.get(e.to) ?? 0)) {\n\t\t\t\t\tnodeRank.set(e.to, next);\n\t\t\t\t\tchanged = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!changed) break;\n\t}\n\tconst nodeLane = /* @__PURE__ */ new Map();\n\tconst edgeLane = /* @__PURE__ */ new Map();\n\tlet totalLanes = 0;\n\tfor (const componentNodes of components) {\n\t\tconst componentSet = new Set(componentNodes);\n\t\tlet nextLane = 0;\n\t\tconst roots = [];\n\t\tfor (const n of componentNodes) if ((inbound.get(n) ?? []).length === 0) roots.push(n);\n\t\troots.sort((a, b) => {\n\t\t\tif (a === EMPTY_CONTRACT_HASH) return -1;\n\t\t\tif (b === EMPTY_CONTRACT_HASH) return 1;\n\t\t\treturn a.localeCompare(b);\n\t\t});\n\t\tconst bfsQueue = [];\n\t\tfor (const root of roots) if (!nodeLane.has(root)) {\n\t\t\tnodeLane.set(root, nextLane++);\n\t\t\tbfsQueue.push({\n\t\t\t\tnode: root,\n\t\t\t\tlane: nodeLane.get(root)\n\t\t\t});\n\t\t}\n\t\tlet head = 0;\n\t\twhile (head < bfsQueue.length) {\n\t\t\tconst { node, lane } = bfsQueue[head++];\n\t\t\tconst children = outbound.get(node) ?? [];\n\t\t\tlet first = true;\n\t\t\tfor (const childEdge of children) {\n\t\t\t\tconst child = childEdge.to;\n\t\t\t\tif (!componentSet.has(child)) continue;\n\t\t\t\tif (!nodeLane.has(child)) {\n\t\t\t\t\tconst childLane = first ? lane : nextLane++;\n\t\t\t\t\tnodeLane.set(child, childLane);\n\t\t\t\t\tbfsQueue.push({\n\t\t\t\t\t\tnode: child,\n\t\t\t\t\t\tlane: childLane\n\t\t\t\t\t});\n\t\t\t\t\tedgeLane.set(childEdge.migrationHash, childLane);\n\t\t\t\t} else edgeLane.set(childEdge.migrationHash, Math.max(lane, nodeLane.get(child)));\n\t\t\t\tfirst = false;\n\t\t\t}\n\t\t}\n\t\tfor (const n of componentNodes) if (!nodeLane.has(n)) nodeLane.set(n, nextLane++);\n\t\tfor (const n of componentNodes) {\n\t\t\tconst parents = inbound.get(n);\n\t\t\tif (!parents || parents.length <= 1) continue;\n\t\t\tlet trunkParent = parents[0].from;\n\t\t\tlet trunkRank = nodeRank.get(trunkParent) ?? 0;\n\t\t\tlet trunkLane = nodeLane.get(trunkParent) ?? 0;\n\t\t\tfor (let i = 1; i < parents.length; i++) {\n\t\t\t\tconst parent = parents[i].from;\n\t\t\t\tconst rank = nodeRank.get(parent) ?? 0;\n\t\t\t\tconst lane = nodeLane.get(parent) ?? 0;\n\t\t\t\tif (rank > trunkRank || rank === trunkRank && lane < trunkLane) {\n\t\t\t\t\ttrunkParent = parent;\n\t\t\t\t\ttrunkRank = rank;\n\t\t\t\t\ttrunkLane = lane;\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst trunkParentLane = nodeLane.get(trunkParent) ?? 0;\n\t\t\tconst currentNodeLane = nodeLane.get(n) ?? 0;\n\t\t\tif (currentNodeLane === trunkParentLane) continue;\n\t\t\tnodeLane.set(n, trunkParentLane);\n\t\t\tfor (const parentEdge of parents) if (parentEdge.from === trunkParent) edgeLane.set(parentEdge.migrationHash, trunkParentLane);\n\t\t\tconst bfsDescendants = [n];\n\t\t\tlet descHead = 0;\n\t\t\twhile (descHead < bfsDescendants.length) {\n\t\t\t\tconst current = bfsDescendants[descHead++];\n\t\t\t\tconst children = outbound.get(current) ?? [];\n\t\t\t\tfor (const childEdge of children) {\n\t\t\t\t\tconst child = childEdge.to;\n\t\t\t\t\tif (!componentSet.has(child)) continue;\n\t\t\t\t\tif ((nodeLane.get(child) ?? 0) !== currentNodeLane) continue;\n\t\t\t\t\tnodeLane.set(child, trunkParentLane);\n\t\t\t\t\tconst existingEdgeLane = edgeLane.get(childEdge.migrationHash);\n\t\t\t\t\tif (existingEdgeLane !== void 0 && existingEdgeLane === currentNodeLane) edgeLane.set(childEdge.migrationHash, trunkParentLane);\n\t\t\t\t\tbfsDescendants.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (nextLane > totalLanes) totalLanes = nextLane;\n\t}\n\treturn {\n\t\tnodeLane,\n\t\tnodeRank,\n\t\tedgeLane,\n\t\tnumLanes: totalLanes\n\t};\n}\nfunction computeDisplayOrder(nodes, nodeLane, nodeRank) {\n\tconst seen = /* @__PURE__ */ new Set();\n\tconst result = [];\n\tlet componentBuffer = [];\n\tfunction flushComponent() {\n\t\tcomponentBuffer.sort((a, b) => b.rank - a.rank || a.lane - b.lane);\n\t\tfor (const d of componentBuffer) result.push(d);\n\t\tcomponentBuffer = [];\n\t}\n\tfor (const n of nodes) {\n\t\tif (n === null) {\n\t\t\tflushComponent();\n\t\t\tresult.push(null);\n\t\t\tcontinue;\n\t\t}\n\t\tif (seen.has(n)) continue;\n\t\tseen.add(n);\n\t\tcomponentBuffer.push({\n\t\t\thash: n,\n\t\t\tlane: nodeLane.get(n) ?? 0,\n\t\t\trank: nodeRank.get(n) ?? 0\n\t\t});\n\t}\n\tflushComponent();\n\treturn result;\n}\n/** Create an empty cell. */\nfunction emptyCell() {\n\treturn { lines: [] };\n}\nfunction buildGrid(rowModel, opts = {}, highlight = {\n\tmode: \"flat\",\n\tonPath: /* @__PURE__ */ new Set()\n}) {\n\tconst colsPerLane = opts.colsPerLane ?? 2;\n\tconst isFocus = highlight.mode === \"focus\";\n\tconst { nodeLane, nodeRank, edgeLane, numLanes } = buildLaneAssignment(rowModel.nodes, rowModel.edges);\n\tconst displayOrder = computeDisplayOrder(rowModel.nodes, nodeLane, nodeRank);\n\tconst displayIndex = /* @__PURE__ */ new Map();\n\tlet nodeIdx = 0;\n\tfor (const d of displayOrder) if (d !== null) displayIndex.set(d.hash, nodeIdx++);\n\tconst rollbackEdges = rowModel.edges.filter((e) => e.kind === \"rollback\" && e.from !== e.to);\n\tconst adjacentRollbacks = [];\n\tconst skippingRollbacks = [];\n\tfor (const e of rollbackEdges) {\n\t\tconst si = displayIndex.get(e.from);\n\t\tconst ti = displayIndex.get(e.to);\n\t\tif (si === void 0 || ti === void 0) continue;\n\t\tif (ti === si + 1) adjacentRollbacks.push(e);\n\t\telse skippingRollbacks.push(e);\n\t}\n\tconst targetGroups = /* @__PURE__ */ new Map();\n\tfor (const e of skippingRollbacks) {\n\t\tconst group = targetGroups.get(e.to);\n\t\tif (group) group.push(e);\n\t\telse targetGroups.set(e.to, [e]);\n\t}\n\tconst sortedTargetKeys = [...targetGroups.keys()].sort((a, b) => {\n\t\tconst ta = displayIndex.get(a) ?? 0;\n\t\treturn (displayIndex.get(b) ?? 0) - ta;\n\t});\n\tconst numTargetGroups = sortedTargetKeys.length;\n\tconst geomLaneOf = /* @__PURE__ */ new Map();\n\tconst outermostGroup = numLanes + numTargetGroups - 1;\n\tsortedTargetKeys.forEach((targetHash, i) => {\n\t\tconst groupGeomLane = outermostGroup - i;\n\t\tfor (const e of targetGroups.get(targetHash)) geomLaneOf.set(e.migrationHash, groupGeomLane);\n\t});\n\tconst totalDisplayNodes = displayOrder.filter((d) => d !== null).length;\n\tconst planeLaneOf = /* @__PURE__ */ new Map();\n\tfor (const e of skippingRollbacks) {\n\t\tconst si = displayIndex.get(e.from) ?? 0;\n\t\tplaneLaneOf.set(e.migrationHash, totalDisplayNodes - si);\n\t}\n\tconst PALETTE_SIZE = 6;\n\tconst GREEN_PALETTE_IDX = 5;\n\tconst arcSourceIndex = /* @__PURE__ */ new Map();\n\tconst arcTargetIndex = /* @__PURE__ */ new Map();\n\tfor (const e of skippingRollbacks) {\n\t\tarcSourceIndex.set(e.migrationHash, displayIndex.get(e.from) ?? 0);\n\t\tarcTargetIndex.set(e.migrationHash, displayIndex.get(e.to) ?? 0);\n\t}\n\tconst arcsByTarget = /* @__PURE__ */ new Map();\n\tconst arcsBySource = /* @__PURE__ */ new Map();\n\tfor (const e of skippingRollbacks) {\n\t\tconst tb = arcsByTarget.get(e.to);\n\t\tif (tb) tb.push(e);\n\t\telse arcsByTarget.set(e.to, [e]);\n\t\tconst sb = arcsBySource.get(e.from);\n\t\tif (sb) sb.push(e);\n\t\telse arcsBySource.set(e.from, [e]);\n\t}\n\tconst colourLaneOf = /* @__PURE__ */ new Map();\n\tconst activeArcColours = /* @__PURE__ */ new Map();\n\tconst activeFwdLaneColours = /* @__PURE__ */ new Set();\n\tfor (let i = displayOrder.length - 1; i >= 0; i--) {\n\t\tconst nd = displayOrder[i];\n\t\tif (nd === null || nd === void 0) continue;\n\t\tconst { hash: nodeHash } = nd;\n\t\tconst nodeFwdLane = nodeLane.get(nodeHash) ?? 0;\n\t\tactiveFwdLaneColours.add(nodeFwdLane % PALETTE_SIZE);\n\t\tconst sortedIncoming = [...arcsByTarget.get(nodeHash) ?? []].sort((a, b) => a.dirName.localeCompare(b.dirName));\n\t\tfor (const arc of sortedIncoming) {\n\t\t\tconst originLaneColour = (nodeLane.get(arc.from) ?? 0) % PALETTE_SIZE;\n\t\t\tconst occupied = new Set(activeFwdLaneColours);\n\t\t\tfor (const c of activeArcColours.values()) occupied.add(c);\n\t\t\toccupied.add(GREEN_PALETTE_IDX);\n\t\t\toccupied.add(originLaneColour);\n\t\t\tlet chosen = -1;\n\t\t\tfor (let ci = 0; ci < PALETTE_SIZE; ci++) if (!occupied.has(ci)) {\n\t\t\t\tchosen = ci;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (chosen === -1) {\n\t\t\t\tfor (let ci = 0; ci < PALETTE_SIZE; ci++) if (ci !== GREEN_PALETTE_IDX) {\n\t\t\t\t\tchosen = ci;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcolourLaneOf.set(arc.migrationHash, chosen === -1 ? 0 : chosen);\n\t\t\tactiveArcColours.set(arc.migrationHash, chosen === -1 ? 0 : chosen);\n\t\t}\n\t\tfor (const arc of arcsBySource.get(nodeHash) ?? []) activeArcColours.delete(arc.migrationHash);\n\t}\n\tconst routedBackArcs = skippingRollbacks.map((e) => ({\n\t\tedge: e,\n\t\tsourceIndex: displayIndex.get(e.from) ?? 0,\n\t\ttargetIndex: displayIndex.get(e.to) ?? 0,\n\t\tgeomLane: geomLaneOf.get(e.migrationHash) ?? numLanes,\n\t\tcolourLane: colourLaneOf.get(e.migrationHash) ?? 0,\n\t\tplaneLane: planeLaneOf.get(e.migrationHash) ?? numLanes\n\t}));\n\tconst backArcsBySource = /* @__PURE__ */ new Map();\n\tconst backArcsByTarget = /* @__PURE__ */ new Map();\n\tfor (const arc of routedBackArcs) {\n\t\tconst sb = backArcsBySource.get(arc.edge.from);\n\t\tif (sb) sb.push(arc);\n\t\telse backArcsBySource.set(arc.edge.from, [arc]);\n\t\tconst tb = backArcsByTarget.get(arc.edge.to);\n\t\tif (tb) tb.push(arc);\n\t\telse backArcsByTarget.set(arc.edge.to, [arc]);\n\t}\n\tconst adjacentBySource = /* @__PURE__ */ new Map();\n\tconst adjacentByTarget = /* @__PURE__ */ new Map();\n\tfor (const e of adjacentRollbacks) {\n\t\tconst b = adjacentBySource.get(e.from);\n\t\tif (b) b.push(e);\n\t\telse adjacentBySource.set(e.from, [e]);\n\t\tconst t = adjacentByTarget.get(e.to);\n\t\tif (t) t.push(e);\n\t\telse adjacentByTarget.set(e.to, [e]);\n\t}\n\tfor (const list of adjacentBySource.values()) list.sort((a, b) => a.dirName.localeCompare(b.dirName));\n\tconst totalCols = (numLanes + numTargetGroups) * colsPerLane;\n\tconst fwdEdges = rowModel.edges.filter((e) => e.kind === \"forward\" && e.from !== e.to);\n\tconst selfEdges = rowModel.edges.filter((e) => e.kind === \"self\");\n\tconst outboundFwd = /* @__PURE__ */ new Map();\n\tconst inboundFwd = /* @__PURE__ */ new Map();\n\tfor (const e of fwdEdges) {\n\t\tconst ob = outboundFwd.get(e.from);\n\t\tif (ob) ob.push(e);\n\t\telse outboundFwd.set(e.from, [e]);\n\t\tconst ib = inboundFwd.get(e.to);\n\t\tif (ib) ib.push(e);\n\t\telse inboundFwd.set(e.to, [e]);\n\t}\n\tfor (const list of outboundFwd.values()) list.sort((a, b) => a.dirName.localeCompare(b.dirName));\n\tfor (const list of inboundFwd.values()) list.sort((a, b) => a.dirName.localeCompare(b.dirName));\n\tconst selfEdgesByNode = /* @__PURE__ */ new Map();\n\tfor (const e of selfEdges) {\n\t\tconst bucket = selfEdgesByNode.get(e.from);\n\t\tif (bucket) bucket.push(e);\n\t\telse selfEdgesByNode.set(e.from, [e]);\n\t}\n\tfor (const list of selfEdgesByNode.values()) list.sort((a, b) => a.dirName.localeCompare(b.dirName));\n\tfunction roleOf(migrationHash) {\n\t\tif (!isFocus) return void 0;\n\t\treturn highlight.onPath.has(migrationHash) ? \"on-path\" : \"off-path\";\n\t}\n\tconst onPathNodes = /* @__PURE__ */ new Set();\n\tif (isFocus) {\n\t\tfor (const e of [\n\t\t\t...fwdEdges,\n\t\t\t...selfEdges,\n\t\t\t...rollbackEdges\n\t\t]) if (highlight.onPath.has(e.migrationHash)) {\n\t\t\tonPathNodes.add(e.from);\n\t\t\tonPathNodes.add(e.to);\n\t\t}\n\t}\n\tfunction nodeRoleOf(hash) {\n\t\tif (!isFocus) return void 0;\n\t\treturn onPathNodes.has(hash) ? \"on-path\" : \"off-path\";\n\t}\n\tfunction planeOf(lane, role) {\n\t\tif (!isFocus) return lane;\n\t\treturn role === \"on-path\" ? 0 : lane + 1;\n\t}\n\tfunction lineRefFor(edge, lane) {\n\t\treturn {\n\t\t\tmigrationHash: edge.migrationHash,\n\t\t\tdirName: edge.dirName,\n\t\t\tlane,\n\t\t\trole: roleOf(edge.migrationHash)\n\t\t};\n\t}\n\t/** Synthetic LineRef for a lane carrying a representative edge's role (pass-through). */\n\tfunction passLineRef(lane, dirName, migHash) {\n\t\treturn {\n\t\t\tmigrationHash: migHash,\n\t\t\tdirName,\n\t\t\tlane,\n\t\t\trole: roleOf(migHash)\n\t\t};\n\t}\n\tfunction vertCell(line) {\n\t\treturn { lines: [{\n\t\t\tline,\n\t\t\tdirections: /* @__PURE__ */ new Set([\"up\", \"down\"]),\n\t\t\tplane: planeOf(line.lane, line.role)\n\t\t}] };\n\t}\n\tfunction dirCell(line, dirs) {\n\t\treturn { lines: [{\n\t\t\tline,\n\t\t\tdirections: dirs,\n\t\t\tplane: planeOf(line.lane, line.role)\n\t\t}] };\n\t}\n\tfunction nodeCell(nodeRef) {\n\t\treturn {\n\t\t\tnode: nodeRef,\n\t\t\tlines: []\n\t\t};\n\t}\n\tconst laneCurrentEdge = /* @__PURE__ */ new Map();\n\tfunction getRepLine(lane) {\n\t\tconst e = laneCurrentEdge.get(lane);\n\t\tif (e) return lineRefFor(e, lane);\n\t\treturn passLineRef(lane, `lane${lane}`, `lane${lane}`);\n\t}\n\tconst activeLanes = /* @__PURE__ */ new Set();\n\tconst grid = [];\n\tfunction makeRow() {\n\t\treturn Array.from({ length: totalCols }, () => emptyCell());\n\t}\n\tfunction placeVerticals(row, skip) {\n\t\tfor (const lane of activeLanes) {\n\t\t\tif (skip.has(lane)) continue;\n\t\t\tconst railCol = lane * colsPerLane;\n\t\t\tconst cell = row[railCol];\n\t\t\tif (cell !== void 0 && cell.lines.length === 0 && !cell.node) row[railCol] = vertCell(getRepLine(lane));\n\t\t}\n\t}\n\tconst activeBackArcs = /* @__PURE__ */ new Set();\n\tfunction backArcLine(arc) {\n\t\treturn {\n\t\t\tmigrationHash: arc.edge.migrationHash,\n\t\t\tdirName: arc.edge.dirName,\n\t\t\tlane: arc.colourLane,\n\t\t\trole: roleOf(arc.edge.migrationHash)\n\t\t};\n\t}\n\tfunction backArcPlane(arc) {\n\t\tconst role = roleOf(arc.edge.migrationHash);\n\t\tif (!isFocus) return arc.planeLane;\n\t\treturn role === \"on-path\" ? 0 : arc.planeLane + 1;\n\t}\n\tfunction composeLine(row, col, line, dirs, plane, extra) {\n\t\tconst existing = row[col];\n\t\tconst cellLine = {\n\t\t\tline,\n\t\t\tdirections: dirs,\n\t\t\tplane,\n\t\t\t...extra?.landingArrow ? { landingArrow: true } : {}\n\t\t};\n\t\tif (existing && (existing.lines.length > 0 || existing.node)) row[col] = {\n\t\t\t...existing,\n\t\t\tlines: [...existing.lines, cellLine]\n\t\t};\n\t\telse row[col] = { lines: [cellLine] };\n\t}\n\tfunction placeBackVerticals(row) {\n\t\tfor (const arc of activeBackArcs) composeLine(row, arc.geomLane * colsPerLane, backArcLine(arc), /* @__PURE__ */ new Set([\"up\", \"down\"]), backArcPlane(arc));\n\t\tplaceAdjacentOverlays(row);\n\t}\n\tconst activeAdjacent = /* @__PURE__ */ new Set();\n\tfunction placeAdjacentOverlays(row) {\n\t\tfor (const adj of activeAdjacent) {\n\t\t\tconst railCol = adj.lane * colsPerLane;\n\t\t\tif (row[railCol]?.node) continue;\n\t\t\tconst line = lineRefFor(adj.edge, adj.lane);\n\t\t\tcomposeLine(row, railCol, line, /* @__PURE__ */ new Set([\"up\", \"down\"]), planeOf(adj.lane, line.role));\n\t\t}\n\t}\n\tfunction emitBackArcTee(row, nodeLaneNum, arc) {\n\t\tconst nodeRail = nodeLaneNum * colsPerLane;\n\t\tconst geomRail = arc.geomLane * colsPerLane;\n\t\tconst line = backArcLine(arc);\n\t\tconst plane = backArcPlane(arc);\n\t\tfor (let col = nodeRail + 1; col < geomRail; col++) composeLine(row, col, line, /* @__PURE__ */ new Set([\"left\", \"right\"]), plane);\n\t\tcomposeLine(row, geomRail, line, /* @__PURE__ */ new Set([\"down\", \"left\"]), plane);\n\t}\n\tfunction emitBackArcLanding(row, nodeLaneNum, arc) {\n\t\tconst nodeRail = nodeLaneNum * colsPerLane;\n\t\tconst geomRail = arc.geomLane * colsPerLane;\n\t\tconst line = backArcLine(arc);\n\t\tconst plane = backArcPlane(arc);\n\t\tcomposeLine(row, nodeRail + 1, line, /* @__PURE__ */ new Set([\"left\", \"right\"]), plane, { landingArrow: true });\n\t\tfor (let col = nodeRail + 2; col < geomRail; col++) composeLine(row, col, line, /* @__PURE__ */ new Set([\"left\", \"right\"]), plane);\n\t\tcomposeLine(row, geomRail, line, /* @__PURE__ */ new Set([\"up\", \"left\"]), plane);\n\t}\n\tfunction emitConnectorRow(trunkLane, branchEntries, connectorType, trunkEdge) {\n\t\tconst row = makeRow();\n\t\tconst sorted = [...branchEntries].sort((a, b) => a.lane - b.lane);\n\t\tif (sorted.length === 0) return row;\n\t\tconst branchByLane = /* @__PURE__ */ new Map();\n\t\tfor (const b of sorted) branchByLane.set(b.lane, b.edge);\n\t\tlet continuousLane = trunkLane;\n\t\tif (isFocus) if (trunkEdge && highlight.onPath.has(trunkEdge.migrationHash)) continuousLane = trunkLane;\n\t\telse {\n\t\t\tconst onPathBranch = sorted.find((b) => highlight.onPath.has(b.edge.migrationHash));\n\t\t\tif (onPathBranch) continuousLane = onPathBranch.lane;\n\t\t}\n\t\tconst trunkRailCol = trunkLane * colsPerLane;\n\t\tconst continuousRailCol = continuousLane * colsPerLane;\n\t\tfunction addLine(col, line, dirs) {\n\t\t\tconst existing = row[col];\n\t\t\tconst cellLine = {\n\t\t\t\tline,\n\t\t\t\tdirections: dirs,\n\t\t\t\tplane: planeOf(line.lane, line.role)\n\t\t\t};\n\t\t\trow[col] = existing && existing.lines.length > 0 ? {\n\t\t\t\t...existing,\n\t\t\t\tlines: [...existing.lines, cellLine]\n\t\t\t} : { lines: [cellLine] };\n\t\t}\n\t\tconst cornerLeftDown = connectorType === \"merge\" ? /* @__PURE__ */ new Set([\"left\", \"down\"]) : /* @__PURE__ */ new Set([\"left\", \"up\"]);\n\t\tfor (let i = 0; i < sorted.length; i++) {\n\t\t\tconst b = sorted[i];\n\t\t\tif (b.lane === continuousLane) continue;\n\t\t\tconst branchLine = lineRefFor(b.edge, b.lane);\n\t\t\tconst railCol = b.lane * colsPerLane;\n\t\t\taddLine(railCol, branchLine, cornerLeftDown);\n\t\t\tconst leftBound = i === 0 ? trunkRailCol + 1 : sorted[i - 1].lane * colsPerLane + 1;\n\t\t\tfor (let col = leftBound; col < railCol; col++) addLine(col, branchLine, /* @__PURE__ */ new Set([\"left\", \"right\"]));\n\t\t}\n\t\tconst continuousLine = continuousLane === trunkLane ? trunkEdge ? lineRefFor(trunkEdge, trunkLane) : getRepLine(trunkLane) : lineRefFor(branchByLane.get(continuousLane), continuousLane);\n\t\tif (continuousLane === trunkLane) addLine(trunkRailCol, continuousLine, /* @__PURE__ */ new Set([\"up\", \"down\"]));\n\t\telse {\n\t\t\taddLine(trunkRailCol, continuousLine, connectorType === \"merge\" ? /* @__PURE__ */ new Set([\"up\", \"right\"]) : /* @__PURE__ */ new Set([\"down\", \"right\"]));\n\t\t\tfor (let col = trunkRailCol + 1; col < continuousRailCol; col++) addLine(col, continuousLine, /* @__PURE__ */ new Set([\"left\", \"right\"]));\n\t\t\taddLine(continuousRailCol, continuousLine, cornerLeftDown);\n\t\t}\n\t\tplaceVerticals(row, /* @__PURE__ */ new Set([trunkLane, ...sorted.map((b) => b.lane)]));\n\t\tplaceBackVerticals(row);\n\t\treturn row;\n\t}\n\tfor (const nodeDisplay of displayOrder) {\n\t\tif (nodeDisplay === null) {\n\t\t\tconst sepRow = makeRow();\n\t\t\tsepRow[0] = {\n\t\t\t\tlines: [],\n\t\t\t\tseparator: true\n\t\t\t};\n\t\t\tgrid.push(sepRow);\n\t\t\tcontinue;\n\t\t}\n\t\tconst { hash: nodeHash } = nodeDisplay;\n\t\tconst nodeLaneNum = nodeLane.get(nodeHash) ?? 0;\n\t\tactiveLanes.add(nodeLaneNum);\n\t\tconst outEdges = outboundFwd.get(nodeHash) ?? [];\n\t\tif (outEdges.length > 1) {\n\t\t\tconst trunkEdgeForFork = outEdges[0];\n\t\t\tconst trunkChildLane = edgeLane.get(trunkEdgeForFork.migrationHash) ?? nodeLane.get(trunkEdgeForFork.to) ?? nodeLaneNum;\n\t\t\tconst branchEntries = outEdges.slice(1).map((e) => ({\n\t\t\t\tlane: edgeLane.get(e.migrationHash) ?? nodeLane.get(e.to) ?? 0,\n\t\t\t\tedge: e\n\t\t\t})).filter((b) => b.lane !== trunkChildLane && activeLanes.has(b.lane));\n\t\t\tif (branchEntries.length > 0) {\n\t\t\t\tconst trunkEdge = outEdges[0];\n\t\t\t\tconst connRow = emitConnectorRow(nodeLaneNum, branchEntries, \"fork\", trunkEdge);\n\t\t\t\tgrid.push(connRow);\n\t\t\t\tassertSingleOwner(connRow, isFocus);\n\t\t\t\tfor (const b of branchEntries) activeLanes.delete(b.lane);\n\t\t\t}\n\t\t}\n\t\tconst selfMigrations = selfEdgesByNode.get(nodeHash) ?? [];\n\t\tfor (const selfEdge of selfMigrations) {\n\t\t\tconst row = makeRow();\n\t\t\tconst railCol = nodeLaneNum * colsPerLane;\n\t\t\tconst connCol = nodeLaneNum * colsPerLane + 1;\n\t\t\tconst line = lineRefFor(selfEdge, nodeLaneNum);\n\t\t\trow[railCol] = vertCell(line);\n\t\t\trow[connCol] = { lines: [{\n\t\t\t\tline,\n\t\t\t\tdirections: /* @__PURE__ */ new Set(),\n\t\t\t\tplane: planeOf(nodeLaneNum, line.role),\n\t\t\t\tselfLoop: true\n\t\t\t}] };\n\t\t\tplaceVerticals(row, /* @__PURE__ */ new Set([nodeLaneNum]));\n\t\t\tplaceBackVerticals(row);\n\t\t\tgrid.push(row);\n\t\t}\n\t\t{\n\t\t\tconst row = makeRow();\n\t\t\tconst railCol = nodeLaneNum * colsPerLane;\n\t\t\trow[railCol] = nodeCell({\n\t\t\t\tcontractHash: nodeHash,\n\t\t\t\tisEmpty: nodeHash === EMPTY_CONTRACT_HASH,\n\t\t\t\tlane: nodeLaneNum,\n\t\t\t\trole: nodeRoleOf(nodeHash)\n\t\t\t});\n\t\t\tplaceVerticals(row, /* @__PURE__ */ new Set([nodeLaneNum]));\n\t\t\tconst landingArcs = backArcsByTarget.get(nodeHash) ?? [];\n\t\t\tfor (const arc of landingArcs) activeBackArcs.delete(arc);\n\t\t\tfor (const adj of [...activeAdjacent]) if (adj.edge.to === nodeHash) activeAdjacent.delete(adj);\n\t\t\tplaceBackVerticals(row);\n\t\t\tfor (const arc of landingArcs) emitBackArcLanding(row, nodeLaneNum, arc);\n\t\t\tconst teeArcs = backArcsBySource.get(nodeHash) ?? [];\n\t\t\tfor (const arc of teeArcs) emitBackArcTee(row, nodeLaneNum, arc);\n\t\t\tgrid.push(row);\n\t\t\tfor (const arc of teeArcs) activeBackArcs.add(arc);\n\t\t\tfor (const adj of adjacentBySource.get(nodeHash) ?? []) activeAdjacent.add({\n\t\t\t\tlane: nodeLaneNum,\n\t\t\t\tedge: adj\n\t\t\t});\n\t\t}\n\t\tfunction edgeLaneFor(edge) {\n\t\t\tconst override = edgeLane.get(edge.migrationHash);\n\t\t\tif (override !== void 0) return override;\n\t\t\treturn Math.max(nodeLane.get(edge.from) ?? 0, nodeLane.get(edge.to) ?? 0);\n\t\t}\n\t\tconst inEdges = inboundFwd.get(nodeHash) ?? [];\n\t\tinEdges.sort((a, b) => {\n\t\t\tconst aLane = edgeLaneFor(a);\n\t\t\tconst bLane = edgeLaneFor(b);\n\t\t\tif (aLane !== bLane) return aLane - bLane;\n\t\t\treturn a.dirName.localeCompare(b.dirName);\n\t\t});\n\t\tfor (const edge of inEdges) laneCurrentEdge.set(edgeLaneFor(edge), edge);\n\t\t{\n\t\t\tconst teeArcs = backArcsBySource.get(nodeHash) ?? [];\n\t\t\tfor (const arc of teeArcs) {\n\t\t\t\tconst row = makeRow();\n\t\t\t\tconst railCol = arc.geomLane * colsPerLane;\n\t\t\t\tconst connCol = railCol + 1;\n\t\t\t\tconst line = backArcLine(arc);\n\t\t\t\tconst plane = backArcPlane(arc);\n\t\t\t\tcomposeLine(row, railCol, line, /* @__PURE__ */ new Set([\"up\", \"down\"]), plane);\n\t\t\t\tcomposeLine(row, connCol, line, /* @__PURE__ */ new Set([\"down\"]), plane);\n\t\t\t\tplaceVerticals(row, /* @__PURE__ */ new Set());\n\t\t\t\tplaceBackVerticals(row);\n\t\t\t\tgrid.push(row);\n\t\t\t}\n\t\t}\n\t\tif (inEdges.length > 1) {\n\t\t\tconst branchEntries = inEdges.slice(1).map((e) => ({\n\t\t\t\tlane: edgeLaneFor(e),\n\t\t\t\tedge: e\n\t\t\t}));\n\t\t\tconst trunkEdge = inEdges[0];\n\t\t\tconst connRow = emitConnectorRow(nodeLaneNum, branchEntries, \"merge\", trunkEdge);\n\t\t\tgrid.push(connRow);\n\t\t\tassertSingleOwner(connRow, isFocus);\n\t\t\tfor (const b of branchEntries) activeLanes.add(b.lane);\n\t\t}\n\t\tfor (const edge of inEdges) {\n\t\t\tconst eLane = edgeLaneFor(edge);\n\t\t\tconst row = makeRow();\n\t\t\tconst railCol = eLane * colsPerLane;\n\t\t\tconst connCol = eLane * colsPerLane + 1;\n\t\t\tconst line = lineRefFor(edge, eLane);\n\t\t\trow[railCol] = vertCell(line);\n\t\t\trow[connCol] = dirCell(line, /* @__PURE__ */ new Set([\"up\"]));\n\t\t\tplaceVerticals(row, /* @__PURE__ */ new Set([eLane]));\n\t\t\tplaceBackVerticals(row);\n\t\t\tgrid.push(row);\n\t\t}\n\t\t{\n\t\t\tconst adjacents = adjacentBySource.get(nodeHash) ?? [];\n\t\t\tfor (const adj of adjacents) {\n\t\t\t\tconst row = makeRow();\n\t\t\t\tconst connCol = nodeLaneNum * colsPerLane + 1;\n\t\t\t\tconst line = lineRefFor(adj, nodeLaneNum);\n\t\t\t\tconst plane = planeOf(nodeLaneNum, line.role);\n\t\t\t\tcomposeLine(row, connCol, line, /* @__PURE__ */ new Set([\"down\"]), plane);\n\t\t\t\tplaceVerticals(row, /* @__PURE__ */ new Set());\n\t\t\t\tplaceBackVerticals(row);\n\t\t\t\tgrid.push(row);\n\t\t\t}\n\t\t}\n\t\tif (inEdges.length === 0) activeLanes.delete(nodeLaneNum);\n\t}\n\treturn grid;\n}\nfunction assertSingleOwner(row, isFocus) {\n\tfor (const cell of row) {\n\t\tif (cell.lines.length <= 1) continue;\n\t\tlet topPlane = Number.POSITIVE_INFINITY;\n\t\tfor (const cl of cell.lines) if (cl.plane < topPlane) topPlane = cl.plane;\n\t\tconst top = cell.lines.filter((cl) => cl.plane === topPlane);\n\t\tif (top.length > 1) {\n\t\t\tif (isFocus) {\n\t\t\t\tif (new Set(top.map((cl) => cl.line.role)).size > 1) throw new InternalError(\"migration-graph layout: single-owner invariant violated — two differently-roled lines share the top plane in one cell\");\n\t\t\t}\n\t\t}\n\t}\n}\n//#endregion\n//#region src/utils/formatters/migration-list-graph-topology.ts\nfunction compareDirNameDesc(a, b) {\n\treturn b.dirName.localeCompare(a.dirName);\n}\nfunction bumpDegree(map, key) {\n\tmap.set(key, (map.get(key) ?? 0) + 1);\n}\nfunction compareNodesRootFirst(a, b) {\n\tif (a === EMPTY_CONTRACT_HASH) return -1;\n\tif (b === EMPTY_CONTRACT_HASH) return 1;\n\treturn a.localeCompare(b);\n}\n/**\n* Shortest-path distance of each node from the forward roots, over the given\n* candidate edges. Roots are the in-degree-0 nodes (baseline first, then lex);\n* a rooted component therefore distances every node by how many forward steps\n* it sits from a root. A component with no root (a pure cycle) is seeded from\n* its single lexically-smallest node so the cycle still gets a stable layering.\n*\n* Crucially this is *shortest* path, not longest: a backward (rollback) edge\n* `deep → shallow` never offers a shorter route to the already-shallower\n* target, so it is inert here. Distances are thus stable whether or not the\n* rollbacks are still in the candidate set — which is what lets the peel below\n* tell a genuine back-edge (target strictly shallower than source) apart from a\n* forward edge that merely happens to share the back-edge's cycle.\n*/\nfunction forwardDistances(nodes, candidates) {\n\tconst inDegree = /* @__PURE__ */ new Map();\n\tfor (const node of nodes) inDegree.set(node, 0);\n\tfor (const edge of candidates) bumpDegree(inDegree, edge.to);\n\tconst roots = [...nodes].filter((node) => (inDegree.get(node) ?? 0) === 0);\n\troots.sort(compareNodesRootFirst);\n\tconst seeds = roots.length > 0 ? roots : [...nodes].sort(compareNodesRootFirst).slice(0, 1);\n\tconst dist = /* @__PURE__ */ new Map();\n\tfor (const seed of seeds) dist.set(seed, 0);\n\tconst maxPasses = nodes.size;\n\tfor (let pass = 0; pass < maxPasses; pass++) {\n\t\tlet changed = false;\n\t\tfor (const edge of candidates) {\n\t\t\tconst base = dist.get(edge.from);\n\t\t\tif (base === void 0) continue;\n\t\t\tconst next = base + 1;\n\t\t\tif (next < (dist.get(edge.to) ?? Number.POSITIVE_INFINITY)) {\n\t\t\t\tdist.set(edge.to, next);\n\t\t\t\tchanged = true;\n\t\t\t}\n\t\t}\n\t\tif (!changed) break;\n\t}\n\tfor (const node of nodes) if (!dist.has(node)) dist.set(node, 0);\n\treturn dist;\n}\nfunction canReachForward(start, goal, candidates) {\n\tif (start === goal) return true;\n\tconst outgoing = /* @__PURE__ */ new Map();\n\tfor (const edge of candidates) {\n\t\tconst bucket = outgoing.get(edge.from);\n\t\tif (bucket) bucket.push(edge.to);\n\t\telse outgoing.set(edge.from, [edge.to]);\n\t}\n\tconst visited = /* @__PURE__ */ new Set([start]);\n\tconst queue = [start];\n\twhile (queue.length > 0) {\n\t\tconst node = queue.shift();\n\t\tif (node === void 0) continue;\n\t\tfor (const next of outgoing.get(node) ?? []) {\n\t\t\tif (next === goal) return true;\n\t\t\tif (!visited.has(next)) {\n\t\t\t\tvisited.add(next);\n\t\t\t\tqueue.push(next);\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n/**\n* Demote node-skipping rollbacks left forward by the DFS. An edge `from → to`\n* is a rollback exactly when both hold:\n*   1. `to` is a forward-ancestor of `from` — `to` can still reach `from` over\n*      the other forward edges, so the edge closes a cycle; and\n*   2. `to` is strictly shallower than `from` (smaller forward distance) — the\n*      edge points back toward the root rather than advancing history.\n*\n* Condition 2 is the discriminator: in a cycle created by a rollback every edge\n* satisfies condition 1, but only the rollback itself runs deep → shallow. The\n* forward chain edges run shallow → deep and are never peeled, however many\n* rollbacks converge on the same target. Tight back-edges whose source and\n* target sit at the same distance (mutual two-node cycles) are already resolved\n* by the DFS immediate-parent rule, so they never reach this pass. One edge is\n* peeled per iteration (dirName-descending tie-break) and distances/reachability\n* are recomputed, making the outcome independent of edge input order.\n*/\nfunction peelNodeSkippingRollbacks(nodes, kindByMigrationHash, nonSelf) {\n\tlet candidates = nonSelf.filter((edge) => kindByMigrationHash.get(edge.hash) === \"forward\");\n\twhile (candidates.length > 0) {\n\t\tconst dist = forwardDistances(nodes, candidates);\n\t\tconst backEdges = candidates.filter((edge) => {\n\t\t\tif ((dist.get(edge.to) ?? 0) >= (dist.get(edge.from) ?? 0)) return false;\n\t\t\tconst without = candidates.filter((candidate) => candidate !== edge);\n\t\t\treturn canReachForward(edge.to, edge.from, without);\n\t\t});\n\t\tif (backEdges.length === 0) break;\n\t\tbackEdges.sort(compareDirNameDesc);\n\t\tconst rollback = backEdges[0];\n\t\tif (rollback === void 0) break;\n\t\tkindByMigrationHash.set(rollback.hash, \"rollback\");\n\t\tcandidates = candidates.filter((edge) => edge !== rollback);\n\t}\n}\n/**\n* DFS with dirName-descending traversal. A GRAY target is a rollback only when it\n* is the immediate DFS parent of the source — cross-links to other GRAY nodes\n* stay forward. A follow-up peel pass demotes node-skipping rollbacks (target is\n* a forward-ancestor of the source and sits strictly shallower than it).\n*/\nfunction classifyNormalizedEdges(edges) {\n\tconst nodes = /* @__PURE__ */ new Set();\n\tconst kindByMigrationHash = /* @__PURE__ */ new Map();\n\tconst outgoingByFrom = /* @__PURE__ */ new Map();\n\tconst nonSelf = [];\n\tfor (const edge of edges) {\n\t\tnodes.add(edge.from);\n\t\tnodes.add(edge.to);\n\t\tif (edge.from === edge.to) {\n\t\t\tkindByMigrationHash.set(edge.hash, \"self\");\n\t\t\tcontinue;\n\t\t}\n\t\tnonSelf.push(edge);\n\t\tconst bucket = outgoingByFrom.get(edge.from);\n\t\tif (bucket) bucket.push(edge);\n\t\telse outgoingByFrom.set(edge.from, [edge]);\n\t}\n\tfor (const bucket of outgoingByFrom.values()) bucket.sort(compareDirNameDesc);\n\tconst nonSelfInDegree = /* @__PURE__ */ new Map();\n\tfor (const node of nodes) nonSelfInDegree.set(node, 0);\n\tfor (const bucket of outgoingByFrom.values()) for (const edge of bucket) bumpDegree(nonSelfInDegree, edge.to);\n\tconst dfsRoots = [];\n\tfor (const node of nodes) if ((nonSelfInDegree.get(node) ?? 0) === 0) dfsRoots.push(node);\n\tdfsRoots.sort((a, b) => {\n\t\tif (a === EMPTY_CONTRACT_HASH) return -1;\n\t\tif (b === EMPTY_CONTRACT_HASH) return 1;\n\t\treturn a.localeCompare(b);\n\t});\n\tif (dfsRoots.length === 0) dfsRoots.push(...[...nodes].sort((a, b) => a.localeCompare(b)));\n\tconst WHITE = 0;\n\tconst GRAY = 1;\n\tconst BLACK = 2;\n\tconst color = /* @__PURE__ */ new Map();\n\tconst dfsParent = /* @__PURE__ */ new Map();\n\tfor (const node of nodes) color.set(node, WHITE);\n\tconst stack = [];\n\tfunction isImmediateDfsParent(ancestor, node) {\n\t\treturn dfsParent.get(node) === ancestor;\n\t}\n\tfunction pushFrame(node, parent) {\n\t\tcolor.set(node, GRAY);\n\t\tdfsParent.set(node, parent);\n\t\tstack.push({\n\t\t\tnode,\n\t\t\toutgoing: outgoingByFrom.get(node) ?? [],\n\t\t\tindex: 0\n\t\t});\n\t}\n\tfunction runDfsFrom(root) {\n\t\tif (color.get(root) !== WHITE) return;\n\t\tpushFrame(root, void 0);\n\t\twhile (stack.length > 0) {\n\t\t\tconst frame = stack[stack.length - 1];\n\t\t\tif (frame === void 0) break;\n\t\t\tif (frame.index >= frame.outgoing.length) {\n\t\t\t\tcolor.set(frame.node, BLACK);\n\t\t\t\tstack.pop();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst edge = frame.outgoing[frame.index];\n\t\t\tframe.index += 1;\n\t\t\tif (edge === void 0) continue;\n\t\t\tconst v = edge.to;\n\t\t\tconst vColor = color.get(v);\n\t\t\tif (vColor === GRAY && isImmediateDfsParent(v, frame.node)) kindByMigrationHash.set(edge.hash, \"rollback\");\n\t\t\telse {\n\t\t\t\tkindByMigrationHash.set(edge.hash, \"forward\");\n\t\t\t\tif (vColor === WHITE) pushFrame(v, frame.node);\n\t\t\t}\n\t\t}\n\t}\n\tfor (const root of dfsRoots) runDfsFrom(root);\n\tconst remainingWhite = [...nodes].filter((node) => color.get(node) === WHITE);\n\tremainingWhite.sort((a, b) => a.localeCompare(b));\n\tfor (const root of remainingWhite) runDfsFrom(root);\n\tpeelNodeSkippingRollbacks(nodes, kindByMigrationHash, nonSelf);\n\tconst forwardInDegree = /* @__PURE__ */ new Map();\n\tconst forwardOutDegree = /* @__PURE__ */ new Map();\n\tfor (const edge of edges) {\n\t\tif (kindByMigrationHash.get(edge.hash) !== \"forward\") continue;\n\t\tbumpDegree(forwardOutDegree, edge.from);\n\t\tbumpDegree(forwardInDegree, edge.to);\n\t}\n\treturn {\n\t\tkindByMigrationHash,\n\t\tforwardInDegree,\n\t\tforwardOutDegree\n\t};\n}\n/**\n* Classify forward/rollback/self for a `MigrationGraph` edge set (Tier-3).\n*/\nfunction classifyMigrationGraphTopology(graph) {\n\tconst normalized = [];\n\tfor (const edges of graph.forwardChain.values()) for (const edge of edges) normalized.push({\n\t\thash: edge.migrationHash,\n\t\tfrom: edge.from,\n\t\tto: edge.to,\n\t\tdirName: edge.dirName\n\t});\n\treturn classifyNormalizedEdges(normalized);\n}\n//#endregion\n//#region src/utils/formatters/migration-graph-rows.ts\n/**\n* Return the weakly-connected components of `graph` as an array of node sets,\n* ordered so the component containing EMPTY_CONTRACT_HASH comes first (if\n* present), with remaining components sorted by their lex-smallest node hash.\n*/\nfunction weaklyConnectedComponents(graph) {\n\tconst visited = /* @__PURE__ */ new Set();\n\tconst adjacency = /* @__PURE__ */ new Map();\n\tfunction addAdjacent(a, b) {\n\t\tconst aList = adjacency.get(a);\n\t\tif (aList) aList.push(b);\n\t\telse adjacency.set(a, [b]);\n\t\tconst bList = adjacency.get(b);\n\t\tif (bList) bList.push(a);\n\t\telse adjacency.set(b, [a]);\n\t}\n\tfor (const edges of graph.forwardChain.values()) for (const edge of edges) if (edge.from !== edge.to) addAdjacent(edge.from, edge.to);\n\tfor (const node of graph.nodes) if (!adjacency.has(node)) adjacency.set(node, []);\n\tconst components = [];\n\tfunction bfsComponent(start) {\n\t\tconst component = /* @__PURE__ */ new Set();\n\t\tconst queue = [start];\n\t\twhile (queue.length > 0) {\n\t\t\tconst node = queue.shift();\n\t\t\tif (node === void 0 || visited.has(node)) continue;\n\t\t\tvisited.add(node);\n\t\t\tcomponent.add(node);\n\t\t\tfor (const neighbor of adjacency.get(node) ?? []) if (!visited.has(neighbor)) queue.push(neighbor);\n\t\t}\n\t\treturn component;\n\t}\n\tconst allNodes = [...graph.nodes].sort((a, b) => {\n\t\tif (a === EMPTY_CONTRACT_HASH) return -1;\n\t\tif (b === EMPTY_CONTRACT_HASH) return 1;\n\t\treturn a.localeCompare(b);\n\t});\n\tfor (const node of allNodes) if (!visited.has(node)) components.push(bfsComponent(node));\n\tcomponents.sort((a, b) => {\n\t\tconst aHasEmpty = a.has(EMPTY_CONTRACT_HASH);\n\t\tconst bHasEmpty = b.has(EMPTY_CONTRACT_HASH);\n\t\tif (aHasEmpty && !bHasEmpty) return -1;\n\t\tif (!aHasEmpty && bHasEmpty) return 1;\n\t\tconst aMin = [...a].sort((x, y) => x.localeCompare(y))[0] ?? \"\";\n\t\tconst bMin = [...b].sort((x, y) => x.localeCompare(y))[0] ?? \"\";\n\t\treturn aMin.localeCompare(bMin);\n\t});\n\treturn components;\n}\nfunction forwardRootsInComponent(componentNodes, topology) {\n\tconst roots = [];\n\tfor (const node of componentNodes) if ((topology.forwardInDegree.get(node) ?? 0) === 0) roots.push(node);\n\troots.sort((a, b) => {\n\t\tif (a === EMPTY_CONTRACT_HASH) return -1;\n\t\tif (b === EMPTY_CONTRACT_HASH) return 1;\n\t\treturn a.localeCompare(b);\n\t});\n\tif (roots.length > 0) return roots;\n\treturn [...componentNodes].sort((a, b) => {\n\t\tif (a === EMPTY_CONTRACT_HASH) return -1;\n\t\tif (b === EMPTY_CONTRACT_HASH) return 1;\n\t\treturn a.localeCompare(b);\n\t});\n}\nfunction compareNodesTipsFirst(a, b, rank) {\n\tconst rankA = rank.get(a) ?? 0;\n\tconst rankB = rank.get(b) ?? 0;\n\tif (rankA !== rankB) return rankB - rankA;\n\tif (a === EMPTY_CONTRACT_HASH) return 1;\n\tif (b === EMPTY_CONTRACT_HASH) return -1;\n\treturn a.localeCompare(b);\n}\n/**\n* Layer nodes by longest forward-path rank from forward roots within the\n* component. Rank 0 is the root (bottom row); the maximum rank is the tip\n* (top row). Emits rank-descending with lex-ascending tie-break among siblings\n* at the same rank — stable across edge-insertion order and correct under\n* diamonds, cross-links, and rollbacks.\n*/\nfunction maxRank(rank) {\n\tlet max = 0;\n\tfor (const value of rank.values()) if (value > max) max = value;\n\treturn max;\n}\nfunction layerNodesByLongestForwardPath(componentNodes, topology, graph, contractHash) {\n\tconst forwardOut = /* @__PURE__ */ new Map();\n\tfor (const node of componentNodes) forwardOut.set(node, []);\n\tfor (const edges of graph.forwardChain.values()) for (const edge of edges) {\n\t\tif (!componentNodes.has(edge.from) || !componentNodes.has(edge.to)) continue;\n\t\tif (edge.from === edge.to) continue;\n\t\tif (topology.kindByMigrationHash.get(edge.migrationHash) !== \"forward\") continue;\n\t\tconst bucket = forwardOut.get(edge.from);\n\t\tif (bucket) bucket.push(edge.to);\n\t}\n\tconst roots = forwardRootsInComponent(componentNodes, topology);\n\tconst rank = /* @__PURE__ */ new Map();\n\tfor (const root of roots) rank.set(root, 0);\n\tconst maxPasses = componentNodes.size;\n\tfor (let pass = 0; pass < maxPasses; pass++) {\n\t\tlet changed = false;\n\t\tfor (const node of componentNodes) {\n\t\t\tconst base = rank.get(node);\n\t\t\tif (base === void 0) continue;\n\t\t\tfor (const to of forwardOut.get(node) ?? []) {\n\t\t\t\tconst next = base + 1;\n\t\t\t\tif (next > (rank.get(to) ?? -1)) {\n\t\t\t\t\trank.set(to, next);\n\t\t\t\t\tchanged = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!changed) break;\n\t}\n\tfor (const node of componentNodes) if (!rank.has(node)) rank.set(node, 0);\n\tif (contractHash !== void 0 && contractHash !== EMPTY_CONTRACT_HASH && componentNodes.has(contractHash) && (forwardOut.get(contractHash) ?? []).length === 0) rank.set(contractHash, maxRank(rank) + 1);\n\treturn [...componentNodes].sort((a, b) => compareNodesTipsFirst(a, b, rank));\n}\n/**\n* Build the row model from a tolerant `MigrationGraph`.\n*\n* The row model is the first pure-data stage of the `migration graph` render\n* pipeline. It:\n* - classifies every edge as `forward`, `rollback`, or `self`;\n* - produces a deterministic vertical node ordering (tips at index 0, roots\n*   at the end) within each weakly-connected component;\n* - separates disjoint components with `null` sentinels;\n* - optionally prepends a detached current contract as its own single-node\n*   component when `contractHash` is not already in the graph.\n*\n* No columns, no lane allocation, no glyphs, no rendering.\n*/\n/**\n* Resolve the detached current contract, if any: a real contract (not the\n* empty baseline) that no migration on disk produces, so it is absent from\n* the graph. Such a contract renders as a floating node rather than\n* decorating an existing one. Returns the hash when detached, else undefined.\n*/\nfunction detachedContractHash(graph, contractHash) {\n\treturn contractHash !== void 0 && contractHash !== EMPTY_CONTRACT_HASH && !graph.nodes.has(contractHash) ? contractHash : void 0;\n}\nfunction isForwardLeaf(node, edges) {\n\treturn !edges.some((e) => e.kind === \"forward\" && e.from === node && e.from !== e.to);\n}\nfunction forwardReachableFrom(start, forwardTo) {\n\tconst reachable = /* @__PURE__ */ new Set([start]);\n\tconst queue = [start];\n\twhile (queue.length > 0) {\n\t\tconst node = queue.shift();\n\t\tif (node === void 0) continue;\n\t\tfor (const next of forwardTo.get(node) ?? []) if (!reachable.has(next)) {\n\t\t\treachable.add(next);\n\t\t\tqueue.push(next);\n\t\t}\n\t}\n\treturn reachable;\n}\nfunction buildForwardToMap(edges) {\n\tconst forwardTo = /* @__PURE__ */ new Map();\n\tfor (const edge of edges) {\n\t\tif (edge.kind !== \"forward\" || edge.from === edge.to) continue;\n\t\tconst bucket = forwardTo.get(edge.from);\n\t\tif (bucket) bucket.push(edge.to);\n\t\telse forwardTo.set(edge.from, [edge.to]);\n\t}\n\treturn forwardTo;\n}\nfunction sortEdgesForContractHashTrunk(edges, contractHash) {\n\tif (contractHash === void 0 || contractHash === EMPTY_CONTRACT_HASH || !isForwardLeaf(contractHash, edges)) return edges;\n\tconst preferredLeaf = contractHash;\n\tconst forwardTo = buildForwardToMap(edges);\n\tconst reachability = /* @__PURE__ */ new Map();\n\tfunction canReachContractHash(from) {\n\t\tlet cached = reachability.get(from);\n\t\tif (cached === void 0) {\n\t\t\tcached = forwardReachableFrom(from, forwardTo);\n\t\t\treachability.set(from, cached);\n\t\t}\n\t\treturn cached.has(preferredLeaf);\n\t}\n\tfunction trunkBias(edge) {\n\t\tif (edge.kind !== \"forward\" || edge.from === edge.to) return 0;\n\t\tif (edge.to === preferredLeaf) return 2;\n\t\tif (canReachContractHash(edge.to)) return 1;\n\t\treturn 0;\n\t}\n\treturn edges.map((edge, index) => ({\n\t\tedge,\n\t\tindex,\n\t\tbias: trunkBias(edge)\n\t})).sort((a, b) => {\n\t\tif (a.edge.from !== b.edge.from) return a.index - b.index;\n\t\tif (a.bias !== b.bias) return b.bias - a.bias;\n\t\treturn a.index - b.index;\n\t}).map(({ edge }) => edge);\n}\nfunction rebuildEdgeLookupMaps(edges) {\n\tconst edgesByFrom = /* @__PURE__ */ new Map();\n\tconst edgesByTo = /* @__PURE__ */ new Map();\n\tfor (const classified of edges) {\n\t\tconst fromBucket = edgesByFrom.get(classified.from);\n\t\tif (fromBucket) fromBucket.push(classified);\n\t\telse edgesByFrom.set(classified.from, [classified]);\n\t\tconst toBucket = edgesByTo.get(classified.to);\n\t\tif (toBucket) toBucket.push(classified);\n\t\telse edgesByTo.set(classified.to, [classified]);\n\t}\n\treturn {\n\t\tedgesByFrom,\n\t\tedgesByTo\n\t};\n}\nfunction buildMigrationGraphRows(graph, options = {}) {\n\tconst emptyModel = {\n\t\tnodes: [],\n\t\tedges: [],\n\t\tedgesByFrom: /* @__PURE__ */ new Map(),\n\t\tedgesByTo: /* @__PURE__ */ new Map()\n\t};\n\tif (graph.nodes.size === 0) {\n\t\tconst detached = detachedContractHash(graph, options.contractHash);\n\t\treturn detached !== void 0 ? {\n\t\t\t...emptyModel,\n\t\t\tnodes: [detached]\n\t\t} : emptyModel;\n\t}\n\tconst topology = classifyMigrationGraphTopology(graph);\n\tconst edges = [];\n\tfor (const edgeList of graph.forwardChain.values()) for (const edge of edgeList) {\n\t\tconst kind = topology.kindByMigrationHash.get(edge.migrationHash) ?? \"forward\";\n\t\tedges.push({\n\t\t\tmigrationHash: edge.migrationHash,\n\t\t\tfrom: edge.from,\n\t\t\tto: edge.to,\n\t\t\tdirName: edge.dirName,\n\t\t\tkind\n\t\t});\n\t}\n\tconst sortedEdges = sortEdgesForContractHashTrunk(edges, options.contractHash);\n\tconst { edgesByFrom, edgesByTo } = rebuildEdgeLookupMaps(sortedEdges);\n\tconst components = weaklyConnectedComponents(graph);\n\tconst nodes = [];\n\tfor (let i = 0; i < components.length; i++) {\n\t\tif (i > 0) nodes.push(null);\n\t\tconst component = components[i];\n\t\tif (component === void 0) continue;\n\t\tconst ordered = layerNodesByLongestForwardPath(component, topology, graph, options.contractHash);\n\t\tfor (const node of ordered) nodes.push(node);\n\t}\n\tconst detached = detachedContractHash(graph, options.contractHash);\n\tif (detached !== void 0) {\n\t\tif (nodes.length > 0) nodes.unshift(null);\n\t\tnodes.unshift(detached);\n\t}\n\treturn {\n\t\tnodes,\n\t\tedges: sortedEdges,\n\t\tedgesByFrom,\n\t\tedgesByTo\n\t};\n}\n//#endregion\n//#region src/utils/formatters/migration-graph-space-render.ts\nfunction mergeMigrationEdgeAnnotations(listOverlay, statusOverlay) {\n\tconst merged = /* @__PURE__ */ new Map();\n\tfor (const [migrationHash, listAnnotation] of listOverlay) {\n\t\tconst statusAnnotation = statusOverlay.get(migrationHash);\n\t\tmerged.set(migrationHash, {\n\t\t\t...listAnnotation,\n\t\t\t...statusAnnotation?.status !== void 0 ? { status: statusAnnotation.status } : {}\n\t\t});\n\t}\n\treturn merged;\n}\n/**\n* Translate `migrate --show` per-edge path-highlight annotations into a\n* {@link Highlight}. With any `pathHighlight` present the result is focus mode\n* (on-path lifted green, off-path dim); otherwise flat (lane-rotation colour).\n*/\nfunction highlightFromEdgeAnnotations(edgeAnnotationsByHash) {\n\tconst onPath = /* @__PURE__ */ new Set();\n\tlet anyPathHighlight = false;\n\tfor (const [migrationHash, annotation] of edgeAnnotationsByHash) {\n\t\tif (annotation.pathHighlight === void 0) continue;\n\t\tanyPathHighlight = true;\n\t\tif (annotation.pathHighlight === \"on-path\") onPath.add(migrationHash);\n\t}\n\treturn anyPathHighlight ? {\n\t\tmode: \"focus\",\n\t\tonPath\n\t} : {\n\t\tmode: \"flat\",\n\t\tonPath: /* @__PURE__ */ new Set()\n\t};\n}\nfunction buildGridForInput(input) {\n\tconst rowModel = buildMigrationGraphRows(input.graph, { contractHash: input.liveContractHash });\n\treturn {\n\t\tgrid: buildGrid(rowModel, {}, {\n\t\t\tmode: \"flat\",\n\t\t\tonPath: /* @__PURE__ */ new Set()\n\t\t}),\n\t\trowModel\n\t};\n}\n/**\n* The widest gutter→label column across the given space layouts. Cross-space\n* callers pass this back in so every section's labels share one column.\n*/\nfunction computeGlobalMaxEdgeTreePrefixWidth(inputs, glyphMode = \"unicode\") {\n\tlet globalMax = 0;\n\tfor (const input of inputs) {\n\t\tconst { grid } = buildGridForInput(input);\n\t\tglobalMax = Math.max(globalMax, computeLabelColumn(grid, glyphMode));\n\t}\n\treturn globalMax;\n}\nfunction computeGlobalMaxDirNameWidth(inputs) {\n\tlet globalMax = 0;\n\tfor (const input of inputs) {\n\t\tconst { rowModel } = buildGridForInput(input);\n\t\tglobalMax = Math.max(globalMax, computeMaxDirNameWidth(rowModel));\n\t}\n\treturn globalMax;\n}\nfunction renderMigrationGraphSpaceTreeInternal(input) {\n\tconst appSpace = input.isAppSpace !== false;\n\tconst rowModel = buildMigrationGraphRows(input.graph, { ...appSpace ? { contractHash: input.liveContractHash } : {} });\n\tconst listOverlay = buildEdgeAnnotationsByHashFromListEntries(input.migrations);\n\tconst edgeAnnotationsByHash = input.statusOverlayByHash === void 0 ? listOverlay : mergeMigrationEdgeAnnotations(listOverlay, input.statusOverlayByHash);\n\treturn renderMigrationGraphCommand({\n\t\tgrid: buildGrid(rowModel, {}, highlightFromEdgeAnnotations(edgeAnnotationsByHash)),\n\t\trowModel,\n\t\tcolorize: input.colorize,\n\t\tglyphMode: input.glyphMode,\n\t\tcontractHash: input.liveContractHash,\n\t\tisAppSpace: appSpace,\n\t\tedgeAnnotationsByHash,\n\t\trefsByHash: input.refsByHash ?? buildRefsByHashFromListEntries(input.migrations),\n\t\t...input.dbHash !== void 0 ? { dbHash: input.dbHash } : {},\n\t\t...input.styler !== void 0 ? { styler: input.styler } : {},\n\t\t...input.globalMaxEdgeTreePrefixWidth !== void 0 ? { globalLabelColumn: input.globalMaxEdgeTreePrefixWidth } : {},\n\t\t...input.globalMaxDirNameWidth !== void 0 ? { globalMaxDirNameWidth: input.globalMaxDirNameWidth } : {}\n\t});\n}\nfunction renderMigrationGraphSpaceTree(input) {\n\treturn renderMigrationGraphSpaceTreeInternal(input);\n}\nfunction indentMigrationGraphTreeBlock(treeOutput, indent) {\n\tif (treeOutput.length === 0) return treeOutput;\n\treturn treeOutput.split(\"\\n\").map((line) => line.length === 0 ? line : `${indent}${line}`).join(\"\\n\");\n}\n//#endregion\n//#region src/utils/formatters/migration-list-render.ts\nconst IDENTITY_MIGRATION_LIST_STYLER = {\n\tkind: (text) => text,\n\tdirName: (text) => text,\n\tsourceHash: (text) => text,\n\tdestHash: (text) => text,\n\tglyph: (text) => text,\n\tlane: (text) => text,\n\tinvariants: (ids) => `{${ids.join(\", \")}}`,\n\trefs: (names) => `(${names.join(\", \")})`,\n\tspaceHeading: (text) => text,\n\tsummary: (text) => text,\n\temptyState: (text) => text\n};\nfunction canonicalFrom(from) {\n\treturn from ?? EMPTY_CONTRACT_HASH;\n}\nfunction migrationGraphFromListEntries(entries) {\n\tconst nodes = /* @__PURE__ */ new Set();\n\tconst forwardChain = /* @__PURE__ */ new Map();\n\tconst reverseChain = /* @__PURE__ */ new Map();\n\tconst migrationByHash = /* @__PURE__ */ new Map();\n\tfor (const entry of entries) {\n\t\tconst from = canonicalFrom(entry.fromContract);\n\t\tconst edge = {\n\t\t\tfrom,\n\t\t\tto: entry.toContract,\n\t\t\tmigrationHash: entry.hash,\n\t\t\tdirName: entry.name,\n\t\t\tcreatedAt: entry.createdAt,\n\t\t\tinvariants: entry.providedInvariants\n\t\t};\n\t\tnodes.add(from);\n\t\tnodes.add(entry.toContract);\n\t\tconst forward = forwardChain.get(from);\n\t\tif (forward) forward.push(edge);\n\t\telse forwardChain.set(from, [edge]);\n\t\tconst reverse = reverseChain.get(entry.toContract);\n\t\tif (reverse) reverse.push(edge);\n\t\telse reverseChain.set(entry.toContract, [edge]);\n\t\tmigrationByHash.set(entry.hash, edge);\n\t}\n\treturn {\n\t\tnodes,\n\t\tforwardChain,\n\t\treverseChain,\n\t\tmigrationByHash\n\t};\n}\nfunction buildEdgeAnnotationsByHashFromListEntries(entries) {\n\tconst annotations = /* @__PURE__ */ new Map();\n\tfor (const entry of entries) annotations.set(entry.hash, {\n\t\toperationCount: entry.operationCount,\n\t\tinvariants: entry.providedInvariants\n\t});\n\treturn annotations;\n}\nfunction buildRefsByHashFromListEntries(entries) {\n\tconst refsByHash = /* @__PURE__ */ new Map();\n\tfor (const entry of entries) if (entry.refs.length > 0) refsByHash.set(entry.toContract, entry.refs);\n\treturn refsByHash;\n}\nfunction formatEmptyStateLine(spaceId, style) {\n\treturn style.emptyState(`There are no migrations in migrations/${spaceId}/ yet`);\n}\nfunction renderSpaceTreeBlock(spaceId, migrations, multiSpace, glyphMode, style, colorize, liveContractHash, graphForSpace, appSpaceId, globalMaxEdgeTreePrefixWidth, globalMaxDirNameWidth) {\n\tif (migrations.length === 0) {\n\t\tconst emptyLine = formatEmptyStateLine(spaceId, style);\n\t\tif (!multiSpace) return [emptyLine];\n\t\treturn [style.spaceHeading(`${spaceId}:`), `  ${emptyLine}`];\n\t}\n\tconst graph = graphForSpace(spaceId) ?? migrationGraphFromListEntries(migrations);\n\tconst isAppSpace = appSpaceId === void 0 ? void 0 : spaceId === appSpaceId;\n\tconst treeOutput = renderMigrationGraphSpaceTree({\n\t\tgraph,\n\t\tmigrations,\n\t\tliveContractHash,\n\t\tglyphMode,\n\t\tcolorize,\n\t\trefsByHash: buildRefsByHashFromListEntries(migrations),\n\t\tstyler: style,\n\t\t...isAppSpace !== void 0 ? { isAppSpace } : {},\n\t\t...globalMaxEdgeTreePrefixWidth !== void 0 ? { globalMaxEdgeTreePrefixWidth } : {},\n\t\t...globalMaxDirNameWidth !== void 0 ? { globalMaxDirNameWidth } : {}\n\t});\n\tif (!multiSpace) return treeOutput.length === 0 ? [] : [treeOutput];\n\tconst indented = indentMigrationGraphTreeBlock(treeOutput, \"  \");\n\treturn [style.spaceHeading(`${spaceId}:`), indented];\n}\n/**\n* Compose the styled `migration list` human output via the shared tree\n* renderer. Each on-disk migration is one edge row with package-fact\n* annotations; refs decorate destination contract nodes.\n*\n* `options.colorize` must match whether `style` emits ANSI (e.g. both true for\n* `createAnsiMigrationListStyler({ useColor: true })`).\n*/\nfunction renderMigrationListWithStyle(result, style, glyphMode = \"unicode\", options = {}) {\n\tconst multiSpace = result.spaces.length > 1;\n\tconst colorize = options.colorize ?? false;\n\tconst liveContractHash = options.liveContractHash ?? EMPTY_CONTRACT_HASH;\n\tconst graphForSpace = options.graphForSpace ?? (() => void 0);\n\tconst appSpaceId = options.appSpaceId;\n\tconst globalLayoutInputs = multiSpace ? result.spaces.filter((space) => space.migrations.length > 0).map((space) => ({\n\t\tgraph: graphForSpace(space.space) ?? migrationGraphFromListEntries(space.migrations),\n\t\tliveContractHash\n\t})) : [];\n\tconst globalMaxEdgeTreePrefixWidth = globalLayoutInputs.length > 0 ? computeGlobalMaxEdgeTreePrefixWidth(globalLayoutInputs) : void 0;\n\tconst globalMaxDirNameWidth = globalLayoutInputs.length > 0 ? computeGlobalMaxDirNameWidth(globalLayoutInputs) : void 0;\n\tconst lines = [];\n\tfor (let index = 0; index < result.spaces.length; index++) {\n\t\tconst space = result.spaces[index];\n\t\tif (index > 0) lines.push(\"\");\n\t\tlines.push(...renderSpaceTreeBlock(space.space, space.migrations, multiSpace, glyphMode, style, colorize, liveContractHash, graphForSpace, appSpaceId, globalMaxEdgeTreePrefixWidth, globalMaxDirNameWidth));\n\t}\n\tif (result.spaces.reduce((count, space) => count + space.migrations.length, 0) > 0) {\n\t\tlines.push(\"\");\n\t\tlines.push(style.summary(result.summary));\n\t}\n\treturn lines.join(\"\\n\");\n}\n//#endregion\n//#region src/utils/formatters/migration-list-styler.ts\nfunction hasMarkersFormatter(styler) {\n\treturn \"markers\" in styler && typeof styler.markers === \"function\";\n}\nfunction styleMarkerName(name) {\n\treturn name === \"contract\" ? bold(green(name)) : green(name);\n}\nfunction plainMarkers(names) {\n\treturn names.map((name) => `@${name}`).join(\" \");\n}\nfunction formatContractNodeOverlays(styler, markers, refs) {\n\tconst parts = [];\n\tif (markers.length > 0) parts.push(hasMarkersFormatter(styler) ? styler.markers(markers) : plainMarkers(markers));\n\tif (refs.length > 0) parts.push(styler.refs(refs));\n\treturn parts.join(\" \");\n}\n/**\n* The current contract overlay marker. Unlike user refs, this names the user's\n* declared desired state — the implicit base/target for `plan` / `migrate` —\n* not a stored label. It is emphasized (bold) so it stands out from plain refs\n* (including the live-database `db` marker, which is just another ref).\n*/\nconst CONTRACT_MARKER_NAME = \"contract\";\nfunction styleRefName(name) {\n\treturn green(name);\n}\n/**\n* Build a {@link MigrationListStyler} that decorates `migration list`\n* tokens with ANSI SGR codes. When `useColor` is `false` (non-TTY,\n* `--no-color`, `NO_COLOR=1`, piped output) the function returns the\n* shared identity styler so callers get plain text with zero ANSI\n* bytes — pipe-friendly by construction.\n*\n* Palette:\n*\n* - `dirName`: bold\n* - `sourceHash`: dim cyan\n* - `destHash`: bright cyan\n* - `kind` (`*` / `↩` / `⟲`): bright — the signal; lanes and arrows dim\n* - `glyph` (`→` / `⟲` / `∅`): dim\n* - `lane` (graph gutter lines `│` and fan/join connectors `├─┐` / `├─┘`): dim\n* - `invariants` (`{...}`): yellow\n* - `markers` (`@contract @db`): green; the `contract` desired-state marker is\n*   green-bold (`db` is plain green); the `@` sigil is applied to each name\n* - `refs` (`(...)`): green (the active ref is bolded separately by the tree styler)\n* - `spaceHeading` (`<spaceId>:`): bold\n* - `summary`: dim\n* - `emptyState`: dim\n*/\nfunction createAnsiMigrationListStyler(opts) {\n\tif (!opts.useColor) return {\n\t\t...IDENTITY_MIGRATION_LIST_STYLER,\n\t\tmarkers: plainMarkers\n\t};\n\treturn {\n\t\tkind: (text) => text,\n\t\tdirName: (text) => bold(text),\n\t\tsourceHash: (text) => dim(cyan(text)),\n\t\tdestHash: (text) => cyanBright(text),\n\t\tglyph: (text) => dim(text),\n\t\tlane: (text) => dim(text),\n\t\tinvariants: (ids) => yellow(`{${ids.join(\", \")}}`),\n\t\tmarkers: (names) => {\n\t\t\tconst sigil = green(\"@\");\n\t\t\treturn names.map((name) => sigil + styleMarkerName(name)).join(\" \");\n\t\t},\n\t\trefs: (names) => {\n\t\t\tconst open = green(\"(\");\n\t\t\tconst close = green(\")\");\n\t\t\tconst separator = green(\", \");\n\t\t\treturn open + names.map(styleRefName).join(separator) + close;\n\t\t},\n\t\tspaceHeading: (text) => bold(text),\n\t\tsummary: (text) => dim(text),\n\t\temptyState: (text) => dim(text)\n\t};\n}\n//#endregion\n//#region src/utils/formatters/migration-graph-labels.ts\n/**\n* Per-row label formatting for the command graph renderer.\n*\n* The command graph renderer ({@link renderMigrationGraphCommand}) derives the\n* graph structure — rows, gutter, lane colours — from the grid pipeline. The\n* per-row LABEL (contract hash + markers + refs for node rows;\n* migration name + `from → to` + ops/status/will-run for migration rows) is\n* formatted here. This module owns ONLY label text + styling; it knows nothing\n* about lanes, gutters, or grid geometry.\n*\n* The label format (hash abbreviation, `from → to` arrow column, `@contract`/\n* `@db` markers, `(refs)`, ops/status/will-run suffix, the legend) is the same\n* as the previous renderer — that part was never the bug.\n*/\n/**\n* The live-database overlay marker. Just another ref as far as styling goes —\n* the only emphasized markers are the active ref and the `contract`\n* desired-state marker (see {@link CONTRACT_MARKER_NAME}).\n*/\nconst DB_MARKER_NAME = \"db\";\n/**\n* Forced-color functions that always emit ANSI regardless of the ambient TTY\n* environment (NO_COLOR, piped output). Used so on-path green / off-path dim are\n* deterministically emitted in tests that request colour while NO_COLOR is set.\n*/\nconst { dim: forcedDim } = createColors({ useColor: true });\nconst { greenBright: forcedGreen } = createColors({ useColor: true });\n/**\n* The two label styles used in `migrate --show` path-highlight mode.\n*\n* - `onPath`: bold name, neutral hashes (the on-path lane glyphs are coloured\n*   green by the grid renderer, not here).\n* - `offPath`: uniform dim grey on the name and the whole hash column.\n*\n* To change the on-path / off-path label colour in future, edit this object.\n*/\nconst PATH_HIGHLIGHT_STYLES = {\n\tonPath: (_style, colorize) => ({\n\t\tlane: colorize ? forcedGreen : (text) => text,\n\t\tarrow: (text) => text,\n\t\tdirName: (text) => bold(text),\n\t\thashOverride: void 0\n\t}),\n\toffPath: (colorize) => ({\n\t\tlane: colorize ? forcedDim : (text) => text,\n\t\tarrow: colorize ? forcedDim : (text) => text,\n\t\tdirName: colorize ? forcedDim : (text) => text,\n\t\thashOverride: colorize ? forcedDim : void 0\n\t})\n};\nfunction abbreviateHash(hash, hashLength, emptySource) {\n\tif (hash === EMPTY_CONTRACT_HASH) return emptySource;\n\treturn hash.slice(0, hashLength);\n}\nfunction overlayNamesForContract(contractHash, opts) {\n\tconst markers = [];\n\tconst refs = [];\n\tconst userRefs = opts.refsByHash?.get(contractHash);\n\tif (userRefs) refs.push(...[...userRefs].sort((a, b) => a.localeCompare(b)));\n\tif (opts.isAppSpace !== false && opts.contractHash === contractHash && contractHash !== EMPTY_CONTRACT_HASH) markers.push(CONTRACT_MARKER_NAME);\n\tif (opts.dbHash === contractHash) markers.push(DB_MARKER_NAME);\n\tmarkers.sort((a, b) => {\n\t\tif (a === \"contract\") return -1;\n\t\tif (b === \"contract\") return 1;\n\t\treturn a.localeCompare(b);\n\t});\n\treturn {\n\t\tmarkers,\n\t\trefs\n\t};\n}\nfunction createLabelStyler(opts) {\n\tconst base = opts.styler ?? createAnsiMigrationListStyler({ useColor: opts.colorize });\n\tconst activeRefName = opts.activeRefName;\n\tif (!opts.colorize || activeRefName === void 0) return base;\n\treturn {\n\t\t...base,\n\t\trefs: (names) => {\n\t\t\tconst styledNames = names.map((name) => name === activeRefName ? bold(name) : name);\n\t\t\treturn base.refs(styledNames);\n\t\t}\n\t};\n}\nfunction overlayStatusGlyphs(mode) {\n\treturn mode === \"ascii\" ? {\n\t\tapplied: \"+\",\n\t\tpending: \">\"\n\t} : {\n\t\tapplied: \"✓\",\n\t\tpending: \"⧗\"\n\t};\n}\nfunction formatEdgeAnnotationSuffix(migrationHash, opts, style) {\n\tconst annotation = opts.edgeAnnotationsByHash?.get(migrationHash);\n\tif (annotation === void 0) return \"\";\n\tconst isOffPath = annotation.pathHighlight === \"off-path\";\n\tconst segments = [];\n\tif (annotation.operationCount !== void 0) segments.push(`${annotation.operationCount} ops`);\n\tif (annotation.invariants !== void 0 && annotation.invariants.length > 0) segments.push(style.invariants(annotation.invariants));\n\tconst status = annotation.status;\n\tif (status !== void 0) {\n\t\tconst glyphs = overlayStatusGlyphs(opts.glyphMode ?? \"unicode\");\n\t\tconst glyph = status === \"applied\" ? glyphs.applied : glyphs.pending;\n\t\tconst label = status === \"applied\" ? \"applied\" : \"pending\";\n\t\tif (!opts.colorize) segments.push(`${glyph} ${label}`);\n\t\telse {\n\t\t\tconst styler = status === \"applied\" ? green : yellow;\n\t\t\tsegments.push(styler(`${glyph} ${label}`));\n\t\t}\n\t}\n\tif (annotation.pathHighlight === \"on-path\") {\n\t\tconst glyph = opts.glyphMode === \"ascii\" ? \">\" : \"↑\";\n\t\tsegments.push(`${glyph} will run`);\n\t}\n\tif (segments.length === 0) return \"\";\n\tconst suffix = `  ${segments.join(\"  \")}`;\n\treturn opts.colorize && isOffPath ? forcedDim(suffix) : suffix;\n}\n/**\n* Format the `from → to` hash data column for an edge row.\n*\n* When `hashOverride` is provided (off-path → `dim`), it replaces ALL sub-stylers\n* so dim reaches every character without inner ANSI codes overriding it.\n*/\nfunction formatEdgeHashColumn(edge, style, hashLength, glyphMode, hashOverride) {\n\tconst emptySource = migrationListEmptySource(glyphMode);\n\tconst forwardArrow = migrationListForwardArrow(glyphMode);\n\tconst src = hashOverride ?? style.sourceHash;\n\tconst dst = hashOverride ?? style.destHash;\n\tconst glyph = hashOverride ?? style.glyph;\n\tif (edge.kind === \"self\") {\n\t\tconst hash = abbreviateHash(edge.from, hashLength, emptySource);\n\t\treturn `${padFromHashColumn(src(hash), hashLength)} ${glyph(forwardArrow)} ${dst(hash)}`;\n\t}\n\treturn `${edge.from === EMPTY_CONTRACT_HASH ? padFromHashColumn(glyph(emptySource), hashLength) : padFromHashColumn(src(abbreviateHash(edge.from, hashLength, emptySource)), hashLength)} ${glyph(forwardArrow)} ${dst(abbreviateHash(edge.to, hashLength, emptySource))}`;\n}\n/**\n* The label text for a contract node row: the abbreviated hash (or the `∅`\n* empty-source token for the baseline) followed by its `@contract`/`@db` markers\n* and `(refs)`, with two spaces between the hash and the overlay block.\n*/\nfunction formatNodeLabel(contractHash, opts, nodeHighlight) {\n\tconst style = createLabelStyler(opts);\n\tconst hashLength = opts.hashLength ?? 7;\n\tconst emptySource = migrationListEmptySource(opts.glyphMode ?? \"unicode\");\n\tconst overlays = overlayNamesForContract(contractHash, opts);\n\tconst hasOverlays = overlays.markers.length > 0 || overlays.refs.length > 0;\n\tconst offPath = nodeHighlight === \"off-path\" && opts.colorize;\n\tconst hashText = contractHash === EMPTY_CONTRACT_HASH ? (offPath ? forcedDim : style.glyph)(emptySource) : (offPath ? forcedDim : style.sourceHash)(abbreviateHash(contractHash, hashLength, emptySource));\n\tif (!hasOverlays) return hashText;\n\treturn `${hashText}  ${formatContractNodeOverlays(style, overlays.markers, overlays.refs)}`;\n}\n/**\n* The label text for a migration row: the migration name (padded to\n* `dirNameWidth`) followed by the `from → to` hash column and the annotation\n* suffix (ops / status / will-run).\n*\n* In flat mode the name is tinted with its lane's hue (`lane` ≥ 0), so the node\n* `○`, the edges/arrows in the gutter, and the name all read in one colour. In\n* focus mode the on-path/off-path role overrides the lane hue (bold / dim).\n*/\nfunction formatMigrationLabel(edge, dirNameWidth, opts, lane) {\n\tconst style = createLabelStyler(opts);\n\tconst hashLength = opts.hashLength ?? 7;\n\tconst glyphMode = opts.glyphMode ?? \"unicode\";\n\tconst highlight = opts.edgeAnnotationsByHash?.get(edge.migrationHash)?.pathHighlight;\n\tlet dirNameStyler;\n\tlet hashOverride;\n\tif (highlight === \"on-path\") {\n\t\tdirNameStyler = opts.colorize ? forcedGreen : (text) => text;\n\t\thashOverride = void 0;\n\t} else if (highlight === \"off-path\") {\n\t\tdirNameStyler = opts.colorize ? forcedDim : style.dirName;\n\t\thashOverride = opts.colorize ? forcedDim : void 0;\n\t} else if (opts.colorize && lane !== void 0) {\n\t\tdirNameStyler = (text) => laneColorizer(lane)(text);\n\t\thashOverride = void 0;\n\t} else {\n\t\tdirNameStyler = style.dirName;\n\t\thashOverride = void 0;\n\t}\n\tconst dirNamePadding = \" \".repeat(Math.max(0, dirNameWidth - edge.dirName.length));\n\treturn `${`${dirNameStyler(edge.dirName)}${dirNamePadding}`}${formatEdgeHashColumn(edge, style, hashLength, glyphMode, hashOverride)}${formatEdgeAnnotationSuffix(edge.migrationHash, opts, style)}`;\n}\n/**\n* Format a single on-path migration row for the `migrate --show` run-list.\n* Shares PATH_HIGHLIGHT_STYLES.onPath with the graph tree so the run-list and\n* the graph are byte-for-byte identical in their name/hash columns.\n*/\nfunction formatOnPathMigrationRow(dirName, from, to, dirNameWidth, colorize, glyphMode) {\n\tconst style = createAnsiMigrationListStyler({ useColor: colorize });\n\tconst styledDirName = `${PATH_HIGHLIGHT_STYLES.onPath(style, colorize).dirName(dirName)}${\" \".repeat(Math.max(0, dirNameWidth - dirName.length))}`;\n\tconst hashLength = 7;\n\tconst emptySource = migrationListEmptySource(glyphMode);\n\tconst forwardArrow = migrationListForwardArrow(glyphMode);\n\tconst fromAbbr = from === EMPTY_CONTRACT_HASH ? padFromHashColumn(style.glyph(emptySource), hashLength) : padFromHashColumn(style.sourceHash(abbreviateHash(from, hashLength, emptySource)), hashLength);\n\tconst toAbbr = to === EMPTY_CONTRACT_HASH ? style.glyph(emptySource) : style.destHash(abbreviateHash(to, hashLength, emptySource));\n\treturn `${styledDirName}  ${fromAbbr} ${style.glyph(forwardArrow)} ${toAbbr}`;\n}\nfunction legendGlyphs(mode) {\n\treturn mode === \"ascii\" ? {\n\t\tnode: \"*\",\n\t\tforward: \"^\",\n\t\trollback: \"v\",\n\t\tself: \"@\"\n\t} : {\n\t\tnode: \"○\",\n\t\tforward: \"↑\",\n\t\trollback: \"↓\",\n\t\tself: \"⟲\"\n\t};\n}\nfunction formatLegendExampleMarkers(colorize) {\n\tif (!colorize) return \"@contract @db\";\n\tconst sigil = green(\"@\");\n\treturn `${sigil + bold(green(\"contract\"))} ${sigil}${green(\"db\")}`;\n}\n/**\n* A compact key for the tree visual language: the contract node glyph, the\n* in-lane direction arrows, the empty baseline, the system-marker `@…` and\n* user-ref `(…)` conventions, and a worked sample of the data-column hash arrow.\n*/\nfunction renderMigrationGraphLegend(opts) {\n\tconst glyphMode = opts.glyphMode ?? \"unicode\";\n\tconst style = createAnsiMigrationListStyler({ useColor: opts.colorize });\n\tconst glyphs = legendGlyphs(glyphMode);\n\tconst emptySource = migrationListEmptySource(glyphMode);\n\tconst forwardArrow = migrationListForwardArrow(glyphMode);\n\tconst sampleArrow = `${style.sourceHash(\"aaaaaa\")} ${style.glyph(forwardArrow)} ${style.destHash(\"bbbbbb\")}`;\n\tconst statusGlyphs = overlayStatusGlyphs(glyphMode);\n\tconst appliedPending = opts.colorize ? `  ${green(statusGlyphs.applied)} ${style.summary(\"applied\")}   ${yellow(statusGlyphs.pending)} ${style.summary(\"pending\")}` : `  ${statusGlyphs.applied} ${style.summary(\"applied\")}   ${statusGlyphs.pending} ${style.summary(\"pending\")}`;\n\tconst exampleMarkers = formatLegendExampleMarkers(opts.colorize);\n\tconst exampleRefs = opts.colorize ? style.refs([\"prod\", \"staging\"]) : \"(prod, staging)\";\n\treturn [\n\t\t\"Legend:\",\n\t\t`  ${style.kind(glyphs.node)} ${style.summary(\"contract\")}   ${style.kind(glyphs.forward)} ${style.summary(\"forward\")}   ${style.kind(glyphs.rollback)} ${style.summary(\"rollback\")}`,\n\t\t`  ${style.kind(glyphs.self)} ${style.summary(\"migration without schema change\")}`,\n\t\tappliedPending,\n\t\t`  ${style.kind(emptySource)} ${style.summary(\"empty database (baseline)\")}`,\n\t\t`  ${exampleMarkers} ${style.summary(\"reserved markers — also typeable as --from/--to tokens\")}`,\n\t\t`  ${exampleRefs} ${style.summary(\"user-defined refs\")}`,\n\t\t`  ${sampleArrow}   ${style.summary(\"migration from contract aaaaaa to bbbbbb\")}`\n\t].join(\"\\n\");\n}\n//#endregion\n//#region src/utils/formatters/migration-graph-command-render.ts\n/**\n* Command graph renderer: composes the gutter (from the grid) with per-row labels.\n*\n* Pipeline: buildMigrationGraphRows → buildGrid → renderMigrationGraphCommand\n*\n* Each grid row is classified by its cells: a node row gets a contract label;\n* a migration arrow row gets a migration label; connector rows get no label.\n* Label format and styling live in `./migration-graph-labels`.\n*/\nconst LABEL_GAP = 2;\nconst MIN_HASH_DATA_COLUMN = 25;\n/**\n* Classify a grid row by its own cells:\n*   - a cell carrying a NodeRef → node row (contract label);\n*   - a cell whose top line is an arrow ({up}/{down}/self-loop) → migration row;\n*   - otherwise → no label.\n*\n* A migration's arrow appears in exactly one grid row (the forward `↑` row, the\n* adjacent-rollback `↓` row, or the self-loop `⟲` row), so each migration gets\n* exactly one label, on the row that draws its arrow.\n*\n* Two distinct migrations with identical content (same from/to/ops) hash to the\n* SAME migration hash, so the arrow line is matched on BOTH its hash and its\n* `dirName` (which the LineRef carries per-row) — otherwise both rows would\n* resolve to one edge and the other migration's name would be lost.\n*/\nfunction classifyRow(row, edgesByHash) {\n\tfor (const cell of row) if (cell.node !== void 0) return {\n\t\tkind: \"node\",\n\t\tcontractHash: cell.node.contractHash\n\t};\n\tfor (const cell of row) {\n\t\tconst arrow = arrowLine(cell);\n\t\tif (arrow === void 0) continue;\n\t\tconst candidates = edgesByHash.get(arrow.line.migrationHash) ?? [];\n\t\tconst edge = candidates.find((e) => e.dirName === arrow.line.dirName) ?? candidates[0];\n\t\tif (edge !== void 0) return {\n\t\t\tkind: \"migration\",\n\t\t\tedge,\n\t\t\tlane: arrow.line.lane\n\t\t};\n\t}\n\treturn { kind: \"none\" };\n}\n/**\n* Return the cell's arrow line if it carries one — a self-loop, or a line whose\n* directions are exactly `{up}` or `{down}` (the migration-direction arrows).\n* Connector/corner/vertical lines are not arrows and yield `undefined`.\n*/\nfunction arrowLine(cell) {\n\tfor (const line of cell.lines) {\n\t\tif (line.selfLoop === true) return line;\n\t\tif (line.landingArrow === true) continue;\n\t\tconst dirs = line.directions;\n\t\tif (dirs.size !== 1) continue;\n\t\tif (dirs.has(\"up\") || dirs.has(\"down\")) return line;\n\t}\n}\n/**\n* Resolve each contract's path-highlight role from the edges incident on it.\n* On-path wins: a contract touched by any on-path edge is on-path. Empty unless\n* focus-mode annotations are present.\n*/\nfunction resolveNodeHighlights(rowModel, edgeAnnotationsByHash) {\n\tconst result = /* @__PURE__ */ new Map();\n\tif (edgeAnnotationsByHash === void 0) return result;\n\tfor (const edge of rowModel.edges) {\n\t\tconst highlight = edgeAnnotationsByHash.get(edge.migrationHash)?.pathHighlight;\n\t\tif (highlight === void 0) continue;\n\t\tfor (const hash of [edge.from, edge.to]) {\n\t\t\tif (hash === EMPTY_CONTRACT_HASH) continue;\n\t\t\tif (result.get(hash) !== \"on-path\") result.set(hash, highlight);\n\t\t}\n\t}\n\treturn result;\n}\nfunction maxDirNameLength(edges) {\n\tlet max = 0;\n\tfor (const edge of edges) max = Math.max(max, edge.dirName.length);\n\treturn max;\n}\n/**\n* The label column for a render: the widest gutter (visible width) across every\n* row, plus the label gap. Labels begin here so they line up regardless of how\n* deep the lane structure runs on any one row. A cross-space override widens it\n* so sibling space sections share one column.\n*/\nfunction computeLabelColumn(grid, glyphMode) {\n\tlet maxGutter = 0;\n\tfor (const row of grid) {\n\t\tconst gutter = renderGridRow(row, {\n\t\t\tcolorize: false,\n\t\t\tglyphMode\n\t\t});\n\t\tmaxGutter = Math.max(maxGutter, stringWidth(gutter));\n\t}\n\treturn maxGutter + LABEL_GAP;\n}\nfunction computeMaxDirNameWidth(rowModel) {\n\treturn maxDirNameLength(rowModel.edges);\n}\nfunction padVisible(text, targetWidth) {\n\tconst padding = Math.max(0, targetWidth - stringWidth(text));\n\treturn text + \" \".repeat(padding);\n}\nconst ANSI_ESCAPE = \"\\x1B\";\nfunction trimTrailingWhitespace(line) {\n\tconst trailingSpaceBeforeReset = new RegExp(`[\\\\t ]+((?:${ANSI_ESCAPE}\\\\[[0-9;]*m)+)$`);\n\treturn line.replace(trailingSpaceBeforeReset, \"$1\").replace(/\\s+$/, \"\");\n}\nfunction renderMigrationGraphCommand(input) {\n\tconst { grid, rowModel } = input;\n\tconst glyphMode = input.glyphMode;\n\tconst edgesByHash = /* @__PURE__ */ new Map();\n\tfor (const edge of rowModel.edges) {\n\t\tconst bucket = edgesByHash.get(edge.migrationHash);\n\t\tif (bucket) bucket.push(edge);\n\t\telse edgesByHash.set(edge.migrationHash, [edge]);\n\t}\n\tconst labelOpts = {\n\t\tcolorize: input.colorize,\n\t\tglyphMode,\n\t\t...ifDefined(\"refsByHash\", input.refsByHash),\n\t\t...ifDefined(\"edgeAnnotationsByHash\", input.edgeAnnotationsByHash),\n\t\t...ifDefined(\"dbHash\", input.dbHash),\n\t\t...ifDefined(\"contractHash\", input.contractHash),\n\t\t...ifDefined(\"isAppSpace\", input.isAppSpace),\n\t\t...ifDefined(\"activeRefName\", input.activeRefName),\n\t\t...ifDefined(\"styler\", input.styler)\n\t};\n\tconst nodeHighlights = resolveNodeHighlights(rowModel, input.edgeAnnotationsByHash);\n\tconst labelColumn = input.globalLabelColumn ?? computeLabelColumn(grid, glyphMode);\n\tconst maxDirNameLen = input.globalMaxDirNameWidth ?? maxDirNameLength(rowModel.edges);\n\tconst dirNameWidth = Math.max(maxDirNameLen + LABEL_GAP, MIN_HASH_DATA_COLUMN - labelColumn);\n\tconst lines = [];\n\tfor (const row of grid) {\n\t\tconst gutter = renderGridRow(row, {\n\t\t\tcolorize: input.colorize,\n\t\t\tglyphMode\n\t\t});\n\t\tconst identity = classifyRow(row, edgesByHash);\n\t\tif (identity.kind === \"none\") {\n\t\t\tlines.push(trimTrailingWhitespace(gutter));\n\t\t\tcontinue;\n\t\t}\n\t\tconst gutterPad = padVisible(gutter, labelColumn);\n\t\tif (identity.kind === \"node\") {\n\t\t\tconst label = formatNodeLabel(identity.contractHash, labelOpts, nodeHighlights.get(identity.contractHash));\n\t\t\tlines.push(trimTrailingWhitespace(label.length === 0 ? gutter : `${gutterPad}${label}`));\n\t\t\tcontinue;\n\t\t}\n\t\tconst label = formatMigrationLabel(identity.edge, dirNameWidth, labelOpts, identity.lane);\n\t\tlines.push(trimTrailingWhitespace(`${gutterPad}${label}`));\n\t}\n\treturn lines.join(\"\\n\");\n}\n//#endregion\nexport { migrationListEmptySource as _, renderMigrationGraphLegend as a, renderMigrationListWithStyle as c, highlightFromEdgeAnnotations as d, indentMigrationGraphTreeBlock as f, abbreviateContractHash as g, buildGrid as h, formatOnPathMigrationRow as i, computeGlobalMaxDirNameWidth as l, buildMigrationGraphRows as m, computeMaxDirNameWidth as n, createAnsiMigrationListStyler as o, renderMigrationGraphSpaceTree as p, renderMigrationGraphCommand as r, IDENTITY_MIGRATION_LIST_STYLER as s, computeLabelColumn as t, computeGlobalMaxEdgeTreePrefixWidth as u, migrationListForwardArrow as v };\n\n//# sourceMappingURL=migration-graph-command-render-BKrg6BPv.mjs.map"],"mappings":";;;;;;;;;;;;;;;AAeA,MAAM,UAAU,aAAa,EAAE,UAAU,KAAK,CAAC;AAC/C,MAAM,kBAAkB;CACvB,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,QAAQ;CACR,QAAQ;AACT;AACA,SAAS,UAAU,MAAM;CACxB,OAAO,gBAAgB,OAAO,gBAAgB,aAAa,MAAM;AAClE;;;;;;;AAOA,SAAS,cAAc,MAAM;CAC5B,OAAO,UAAU,IAAI;AACtB;AACA,SAAS,UAAU,MAAM;CACxB,OAAO,SAAS,YAAY,QAAQ,cAAc,QAAQ;AAC3D;AACA,MAAM,mBAAmB;CACxB,UAAU;CACV,YAAY;CACZ,eAAe;CACf,iBAAiB;CACjB,cAAc;CACd,gBAAgB;CAChB,SAAS;CACT,WAAW;CACX,MAAM;CACN,UAAU;CACV,cAAc;CACd,UAAU;AACX;AACA,MAAM,iBAAiB;CACtB,UAAU;CACV,YAAY;CACZ,eAAe;CACf,iBAAiB;CACjB,cAAc;CACd,gBAAgB;CAChB,SAAS;CACT,WAAW;CACX,MAAM;CACN,UAAU;CACV,cAAc;CACd,UAAU;AACX;AACA,SAAS,YAAY,MAAM;CAC1B,OAAO,SAAS,UAAU,iBAAiB;AAC5C;AACA,SAAS,SAAS,MAAM,UAAU;CACjC,MAAM,OAAO,MAAM,KAAK,IAAI,CAAC;CAC7B,IAAI,IAAI,IAAI,KAAK,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,OAAO,GAAG,OAAO,SAAS;CAC/E,IAAI,IAAI,MAAM,KAAK,IAAI,OAAO,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,MAAM,GAAG,OAAO,SAAS;CAC/E,IAAI,IAAI,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,GAAG,OAAO,SAAS;CAC/E,IAAI,IAAI,MAAM,KAAK,IAAI,OAAO,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,MAAM,GAAG,OAAO,SAAS;CAC/E,IAAI,IAAI,IAAI,KAAK,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,OAAO,GAAG,OAAO,SAAS;CAC/E,IAAI,IAAI,MAAM,KAAK,IAAI,MAAM,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,OAAO,GAAG,OAAO,SAAS;CAC/E,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,OAAO,GAAG,OAAO,SAAS;CAChF,IAAI,IAAI,MAAM,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,OAAO,GAAG,OAAO,SAAS;CAChF,OAAO,SAAS;AACjB;AACA,MAAM,YAAY,MAAM;AACxB,SAAS,WAAW,MAAM,cAAc,UAAU;CACjD,IAAI,KAAK,SAAS,KAAK,GAAG,QAAQ,CAAC,eAAe,WAAW,KAAK,KAAK,SAAS,KAAK,IAAI,UAAU,KAAK,KAAK,IAAI,IAAI,UAAU,KAAK,KAAK,IAAI,EAAA,CAAG,SAAS,IAAI;CAC7J,IAAI,KAAK,MAAM,WAAW,GAAG,OAAO;CACpC,MAAM,UAAU,KAAK,MAAM,QAAQ,MAAM,YAAY;EACpD,IAAI,QAAQ,QAAQ,KAAK,OAAO,OAAO;EACvC,IAAI,QAAQ,QAAQ,KAAK,OAAO,OAAO;EACvC,IAAI,QAAQ,KAAK,SAAS,aAAa,KAAK,KAAK,SAAS,WAAW,OAAO;EAC5E,OAAO;CACR,GAAG,KAAK,MAAM,EAAE;CAChB,MAAM,QAAQ,QAAQ,aAAa,OAAO,SAAS,WAAW,QAAQ,iBAAiB,OAAO,SAAS,eAAe,SAAS,QAAQ,YAAY,QAAQ;CAC3J,QAAQ,CAAC,eAAe,WAAW,QAAQ,KAAK,SAAS,KAAK,IAAI,UAAU,QAAQ,KAAK,IAAI,IAAI,UAAU,QAAQ,KAAK,IAAI,EAAA,CAAG,KAAK;AACrI;;;;;;;AAOA,SAAS,cAAc,KAAK,OAAO,CAAC,GAAG;CACtC,IAAI,IAAI,EAAE,EAAE,cAAc,MAAM,OAAO;CACvC,IAAI,eAAe;CACnB,KAAK,IAAI,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;EACzC,MAAM,OAAO,IAAI;EACjB,IAAI,SAAS,KAAK,MAAM,KAAK,MAAM,SAAS,KAAK,KAAK,SAAS,KAAK,IAAI;GACvE,eAAe;GACf;EACD;CACD;CACA,IAAI,eAAe,GAAG,OAAO;CAC7B,MAAM,cAAc,KAAK,eAAe;CACxC,MAAM,eAAe,KAAK,YAAY;CACtC,MAAM,WAAW,YAAY,KAAK,aAAa,SAAS;CACxD,MAAM,mBAAmB,KAAK,MAAM,eAAe,WAAW,IAAI,eAAe,cAAc;CAC/F,MAAM,gBAAgB,KAAK,IAAI,cAAc,gBAAgB;CAC7D,IAAI,OAAO;CACX,KAAK,IAAI,MAAM,GAAG,OAAO,KAAK,IAAI,eAAe,IAAI,SAAS,CAAC,GAAG,OAAO;EACxE,MAAM,OAAO,IAAI;EACjB,QAAQ,SAAS,KAAK,IAAI,MAAM,WAAW,MAAM,cAAc,QAAQ;CACxE;CACA,OAAO;AACR;AACA,SAAS,0BAA0B,WAAW;CAC7C,OAAO,cAAc,UAAU,OAAO;AACvC;AACA,SAAS,yBAAyB,WAAW;CAC5C,OAAO,cAAc,UAAU,MAAM;AACtC;AACA,SAAS,uBAAuB,MAAM;CACrC,OAAO,KAAK,MAAM,GAAG,CAAC;AACvB;AACA,SAAS,kBAAkB,MAAM,OAAO;CACvC,MAAM,UAAU,KAAK,IAAI,GAAG,QAAQ,YAAY,IAAI,CAAC;CACrD,OAAO,GAAG,IAAI,OAAO,OAAO,IAAI;AACjC;;;;;;;;AAUA,SAAS,oBAAoB,OAAO,OAAO;CAC1C,MAAM,WAAW,MAAM,QAAQ,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,EAAE,EAAE;CAC5E,MAAM,2BAA2B,IAAI,IAAI;CACzC,MAAM,0BAA0B,IAAI,IAAI;CACxC,KAAK,MAAM,QAAQ,UAAU;EAC5B,MAAM,KAAK,SAAS,IAAI,KAAK,IAAI;EACjC,IAAI,IAAI,GAAG,KAAK,IAAI;OACf,SAAS,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;EACnC,MAAM,KAAK,QAAQ,IAAI,KAAK,EAAE;EAC9B,IAAI,IAAI,GAAG,KAAK,IAAI;OACf,QAAQ,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;CACjC;CACA,KAAK,MAAM,QAAQ,SAAS,OAAO,GAAG,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;CAC5F,KAAK,MAAM,QAAQ,QAAQ,OAAO,GAAG,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;CAC3F,MAAM,aAAa,CAAC;CACpB,IAAI,UAAU,CAAC;CACf,KAAK,MAAM,KAAK,OAAO,IAAI,MAAM,MAAM;EACtC,IAAI,QAAQ,SAAS,GAAG,WAAW,KAAK,OAAO;EAC/C,UAAU,CAAC;CACZ,OAAO,QAAQ,KAAK,CAAC;CACrB,IAAI,QAAQ,SAAS,GAAG,WAAW,KAAK,OAAO;CAC/C,MAAM,2BAA2B,IAAI,IAAI;CACzC,KAAK,MAAM,KAAK,OAAO,IAAI,MAAM,MAAM,SAAS,IAAI,CAAC;CACrD,MAAM,2BAA2B,IAAI,IAAI;CACzC,KAAK,MAAM,KAAK,UAAU,SAAS,IAAI,GAAG,CAAC;CAC3C,KAAK,IAAI,OAAO,GAAG,OAAO,SAAS,MAAM,QAAQ;EAChD,IAAI,UAAU;EACd,KAAK,MAAM,CAAC,MAAM,OAAO,UAAU;GAClC,MAAM,OAAO,SAAS,IAAI,IAAI,KAAK;GACnC,KAAK,MAAM,KAAK,IAAI;IACnB,MAAM,OAAO,OAAO;IACpB,IAAI,QAAQ,SAAS,IAAI,EAAE,EAAE,KAAK,IAAI;KACrC,SAAS,IAAI,EAAE,IAAI,IAAI;KACvB,UAAU;IACX;GACD;EACD;EACA,IAAI,CAAC,SAAS;CACf;CACA,MAAM,2BAA2B,IAAI,IAAI;CACzC,MAAM,2BAA2B,IAAI,IAAI;CACzC,IAAI,aAAa;CACjB,KAAK,MAAM,kBAAkB,YAAY;EACxC,MAAM,eAAe,IAAI,IAAI,cAAc;EAC3C,IAAI,WAAW;EACf,MAAM,QAAQ,CAAC;EACf,KAAK,MAAM,KAAK,gBAAgB,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,EAAA,CAAG,WAAW,GAAG,MAAM,KAAK,CAAC;EACrF,MAAM,MAAM,GAAG,MAAM;GACpB,IAAI,MAAA,SAA2B,OAAO;GACtC,IAAI,MAAA,SAA2B,OAAO;GACtC,OAAO,EAAE,cAAc,CAAC;EACzB,CAAC;EACD,MAAM,WAAW,CAAC;EAClB,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC,SAAS,IAAI,IAAI,GAAG;GAClD,SAAS,IAAI,MAAM,UAAU;GAC7B,SAAS,KAAK;IACb,MAAM;IACN,MAAM,SAAS,IAAI,IAAI;GACxB,CAAC;EACF;EACA,IAAI,OAAO;EACX,OAAO,OAAO,SAAS,QAAQ;GAC9B,MAAM,EAAE,MAAM,SAAS,SAAS;GAChC,MAAM,WAAW,SAAS,IAAI,IAAI,KAAK,CAAC;GACxC,IAAI,QAAQ;GACZ,KAAK,MAAM,aAAa,UAAU;IACjC,MAAM,QAAQ,UAAU;IACxB,IAAI,CAAC,aAAa,IAAI,KAAK,GAAG;IAC9B,IAAI,CAAC,SAAS,IAAI,KAAK,GAAG;KACzB,MAAM,YAAY,QAAQ,OAAO;KACjC,SAAS,IAAI,OAAO,SAAS;KAC7B,SAAS,KAAK;MACb,MAAM;MACN,MAAM;KACP,CAAC;KACD,SAAS,IAAI,UAAU,eAAe,SAAS;IAChD,OAAO,SAAS,IAAI,UAAU,eAAe,KAAK,IAAI,MAAM,SAAS,IAAI,KAAK,CAAC,CAAC;IAChF,QAAQ;GACT;EACD;EACA,KAAK,MAAM,KAAK,gBAAgB,IAAI,CAAC,SAAS,IAAI,CAAC,GAAG,SAAS,IAAI,GAAG,UAAU;EAChF,KAAK,MAAM,KAAK,gBAAgB;GAC/B,MAAM,UAAU,QAAQ,IAAI,CAAC;GAC7B,IAAI,CAAC,WAAW,QAAQ,UAAU,GAAG;GACrC,IAAI,cAAc,QAAQ,EAAE,CAAC;GAC7B,IAAI,YAAY,SAAS,IAAI,WAAW,KAAK;GAC7C,IAAI,YAAY,SAAS,IAAI,WAAW,KAAK;GAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;IACxC,MAAM,SAAS,QAAQ,EAAE,CAAC;IAC1B,MAAM,OAAO,SAAS,IAAI,MAAM,KAAK;IACrC,MAAM,OAAO,SAAS,IAAI,MAAM,KAAK;IACrC,IAAI,OAAO,aAAa,SAAS,aAAa,OAAO,WAAW;KAC/D,cAAc;KACd,YAAY;KACZ,YAAY;IACb;GACD;GACA,MAAM,kBAAkB,SAAS,IAAI,WAAW,KAAK;GACrD,MAAM,kBAAkB,SAAS,IAAI,CAAC,KAAK;GAC3C,IAAI,oBAAoB,iBAAiB;GACzC,SAAS,IAAI,GAAG,eAAe;GAC/B,KAAK,MAAM,cAAc,SAAS,IAAI,WAAW,SAAS,aAAa,SAAS,IAAI,WAAW,eAAe,eAAe;GAC7H,MAAM,iBAAiB,CAAC,CAAC;GACzB,IAAI,WAAW;GACf,OAAO,WAAW,eAAe,QAAQ;IACxC,MAAM,UAAU,eAAe;IAC/B,MAAM,WAAW,SAAS,IAAI,OAAO,KAAK,CAAC;IAC3C,KAAK,MAAM,aAAa,UAAU;KACjC,MAAM,QAAQ,UAAU;KACxB,IAAI,CAAC,aAAa,IAAI,KAAK,GAAG;KAC9B,KAAK,SAAS,IAAI,KAAK,KAAK,OAAO,iBAAiB;KACpD,SAAS,IAAI,OAAO,eAAe;KACnC,MAAM,mBAAmB,SAAS,IAAI,UAAU,aAAa;KAC7D,IAAI,qBAAqB,KAAK,KAAK,qBAAqB,iBAAiB,SAAS,IAAI,UAAU,eAAe,eAAe;KAC9H,eAAe,KAAK,KAAK;IAC1B;GACD;EACD;EACA,IAAI,WAAW,YAAY,aAAa;CACzC;CACA,OAAO;EACN;EACA;EACA;EACA,UAAU;CACX;AACD;AACA,SAAS,oBAAoB,OAAO,UAAU,UAAU;CACvD,MAAM,uBAAuB,IAAI,IAAI;CACrC,MAAM,SAAS,CAAC;CAChB,IAAI,kBAAkB,CAAC;CACvB,SAAS,iBAAiB;EACzB,gBAAgB,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI;EACjE,KAAK,MAAM,KAAK,iBAAiB,OAAO,KAAK,CAAC;EAC9C,kBAAkB,CAAC;CACpB;CACA,KAAK,MAAM,KAAK,OAAO;EACtB,IAAI,MAAM,MAAM;GACf,eAAe;GACf,OAAO,KAAK,IAAI;GAChB;EACD;EACA,IAAI,KAAK,IAAI,CAAC,GAAG;EACjB,KAAK,IAAI,CAAC;EACV,gBAAgB,KAAK;GACpB,MAAM;GACN,MAAM,SAAS,IAAI,CAAC,KAAK;GACzB,MAAM,SAAS,IAAI,CAAC,KAAK;EAC1B,CAAC;CACF;CACA,eAAe;CACf,OAAO;AACR;;AAEA,SAAS,YAAY;CACpB,OAAO,EAAE,OAAO,CAAC,EAAE;AACpB;AACA,SAAS,UAAU,UAAU,OAAO,CAAC,GAAG,YAAY;CACnD,MAAM;CACN,wBAAwB,IAAI,IAAI;AACjC,GAAG;CACF,MAAM,cAAc,KAAK,eAAe;CACxC,MAAM,UAAU,UAAU,SAAS;CACnC,MAAM,EAAE,UAAU,UAAU,UAAU,aAAa,oBAAoB,SAAS,OAAO,SAAS,KAAK;CACrG,MAAM,eAAe,oBAAoB,SAAS,OAAO,UAAU,QAAQ;CAC3E,MAAM,+BAA+B,IAAI,IAAI;CAC7C,IAAI,UAAU;CACd,KAAK,MAAM,KAAK,cAAc,IAAI,MAAM,MAAM,aAAa,IAAI,EAAE,MAAM,SAAS;CAChF,MAAM,gBAAgB,SAAS,MAAM,QAAQ,MAAM,EAAE,SAAS,cAAc,EAAE,SAAS,EAAE,EAAE;CAC3F,MAAM,oBAAoB,CAAC;CAC3B,MAAM,oBAAoB,CAAC;CAC3B,KAAK,MAAM,KAAK,eAAe;EAC9B,MAAM,KAAK,aAAa,IAAI,EAAE,IAAI;EAClC,MAAM,KAAK,aAAa,IAAI,EAAE,EAAE;EAChC,IAAI,OAAO,KAAK,KAAK,OAAO,KAAK,GAAG;EACpC,IAAI,OAAO,KAAK,GAAG,kBAAkB,KAAK,CAAC;OACtC,kBAAkB,KAAK,CAAC;CAC9B;CACA,MAAM,+BAA+B,IAAI,IAAI;CAC7C,KAAK,MAAM,KAAK,mBAAmB;EAClC,MAAM,QAAQ,aAAa,IAAI,EAAE,EAAE;EACnC,IAAI,OAAO,MAAM,KAAK,CAAC;OAClB,aAAa,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;CAChC;CACA,MAAM,mBAAmB,CAAC,GAAG,aAAa,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM;EAChE,MAAM,KAAK,aAAa,IAAI,CAAC,KAAK;EAClC,QAAQ,aAAa,IAAI,CAAC,KAAK,KAAK;CACrC,CAAC;CACD,MAAM,kBAAkB,iBAAiB;CACzC,MAAM,6BAA6B,IAAI,IAAI;CAC3C,MAAM,iBAAiB,WAAW,kBAAkB;CACpD,iBAAiB,SAAS,YAAY,MAAM;EAC3C,MAAM,gBAAgB,iBAAiB;EACvC,KAAK,MAAM,KAAK,aAAa,IAAI,UAAU,GAAG,WAAW,IAAI,EAAE,eAAe,aAAa;CAC5F,CAAC;CACD,MAAM,oBAAoB,aAAa,QAAQ,MAAM,MAAM,IAAI,CAAC,CAAC;CACjE,MAAM,8BAA8B,IAAI,IAAI;CAC5C,KAAK,MAAM,KAAK,mBAAmB;EAClC,MAAM,KAAK,aAAa,IAAI,EAAE,IAAI,KAAK;EACvC,YAAY,IAAI,EAAE,eAAe,oBAAoB,EAAE;CACxD;CACA,MAAM,eAAe;CACrB,MAAM,oBAAoB;CAC1B,MAAM,iCAAiC,IAAI,IAAI;CAC/C,MAAM,iCAAiC,IAAI,IAAI;CAC/C,KAAK,MAAM,KAAK,mBAAmB;EAClC,eAAe,IAAI,EAAE,eAAe,aAAa,IAAI,EAAE,IAAI,KAAK,CAAC;EACjE,eAAe,IAAI,EAAE,eAAe,aAAa,IAAI,EAAE,EAAE,KAAK,CAAC;CAChE;CACA,MAAM,+BAA+B,IAAI,IAAI;CAC7C,MAAM,+BAA+B,IAAI,IAAI;CAC7C,KAAK,MAAM,KAAK,mBAAmB;EAClC,MAAM,KAAK,aAAa,IAAI,EAAE,EAAE;EAChC,IAAI,IAAI,GAAG,KAAK,CAAC;OACZ,aAAa,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;EAC/B,MAAM,KAAK,aAAa,IAAI,EAAE,IAAI;EAClC,IAAI,IAAI,GAAG,KAAK,CAAC;OACZ,aAAa,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;CAClC;CACA,MAAM,+BAA+B,IAAI,IAAI;CAC7C,MAAM,mCAAmC,IAAI,IAAI;CACjD,MAAM,uCAAuC,IAAI,IAAI;CACrD,KAAK,IAAI,IAAI,aAAa,SAAS,GAAG,KAAK,GAAG,KAAK;EAClD,MAAM,KAAK,aAAa;EACxB,IAAI,OAAO,QAAQ,OAAO,KAAK,GAAG;EAClC,MAAM,EAAE,MAAM,aAAa;EAC3B,MAAM,cAAc,SAAS,IAAI,QAAQ,KAAK;EAC9C,qBAAqB,IAAI,cAAc,YAAY;EACnD,MAAM,iBAAiB,CAAC,GAAG,aAAa,IAAI,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;EAC9G,KAAK,MAAM,OAAO,gBAAgB;GACjC,MAAM,oBAAoB,SAAS,IAAI,IAAI,IAAI,KAAK,KAAK;GACzD,MAAM,WAAW,IAAI,IAAI,oBAAoB;GAC7C,KAAK,MAAM,KAAK,iBAAiB,OAAO,GAAG,SAAS,IAAI,CAAC;GACzD,SAAS,IAAI,iBAAiB;GAC9B,SAAS,IAAI,gBAAgB;GAC7B,IAAI,SAAS;GACb,KAAK,IAAI,KAAK,GAAG,KAAK,cAAc,MAAM,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG;IAChE,SAAS;IACT;GACD;GACA,IAAI,WAAW,IACT;SAAA,IAAI,KAAK,GAAG,KAAK,cAAc,MAAM,IAAI,OAAO,mBAAmB;KACvE,SAAS;KACT;IACD;;GAED,aAAa,IAAI,IAAI,eAAe,WAAW,KAAK,IAAI,MAAM;GAC9D,iBAAiB,IAAI,IAAI,eAAe,WAAW,KAAK,IAAI,MAAM;EACnE;EACA,KAAK,MAAM,OAAO,aAAa,IAAI,QAAQ,KAAK,CAAC,GAAG,iBAAiB,OAAO,IAAI,aAAa;CAC9F;CACA,MAAM,iBAAiB,kBAAkB,KAAK,OAAO;EACpD,MAAM;EACN,aAAa,aAAa,IAAI,EAAE,IAAI,KAAK;EACzC,aAAa,aAAa,IAAI,EAAE,EAAE,KAAK;EACvC,UAAU,WAAW,IAAI,EAAE,aAAa,KAAK;EAC7C,YAAY,aAAa,IAAI,EAAE,aAAa,KAAK;EACjD,WAAW,YAAY,IAAI,EAAE,aAAa,KAAK;CAChD,EAAE;CACF,MAAM,mCAAmC,IAAI,IAAI;CACjD,MAAM,mCAAmC,IAAI,IAAI;CACjD,KAAK,MAAM,OAAO,gBAAgB;EACjC,MAAM,KAAK,iBAAiB,IAAI,IAAI,KAAK,IAAI;EAC7C,IAAI,IAAI,GAAG,KAAK,GAAG;OACd,iBAAiB,IAAI,IAAI,KAAK,MAAM,CAAC,GAAG,CAAC;EAC9C,MAAM,KAAK,iBAAiB,IAAI,IAAI,KAAK,EAAE;EAC3C,IAAI,IAAI,GAAG,KAAK,GAAG;OACd,iBAAiB,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC;CAC7C;CACA,MAAM,mCAAmC,IAAI,IAAI;CACjD,MAAM,mCAAmC,IAAI,IAAI;CACjD,KAAK,MAAM,KAAK,mBAAmB;EAClC,MAAM,IAAI,iBAAiB,IAAI,EAAE,IAAI;EACrC,IAAI,GAAG,EAAE,KAAK,CAAC;OACV,iBAAiB,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;EACrC,MAAM,IAAI,iBAAiB,IAAI,EAAE,EAAE;EACnC,IAAI,GAAG,EAAE,KAAK,CAAC;OACV,iBAAiB,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;CACpC;CACA,KAAK,MAAM,QAAQ,iBAAiB,OAAO,GAAG,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;CACpG,MAAM,aAAa,WAAW,mBAAmB;CACjD,MAAM,WAAW,SAAS,MAAM,QAAQ,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,EAAE,EAAE;CACrF,MAAM,YAAY,SAAS,MAAM,QAAQ,MAAM,EAAE,SAAS,MAAM;CAChE,MAAM,8BAA8B,IAAI,IAAI;CAC5C,MAAM,6BAA6B,IAAI,IAAI;CAC3C,KAAK,MAAM,KAAK,UAAU;EACzB,MAAM,KAAK,YAAY,IAAI,EAAE,IAAI;EACjC,IAAI,IAAI,GAAG,KAAK,CAAC;OACZ,YAAY,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;EAChC,MAAM,KAAK,WAAW,IAAI,EAAE,EAAE;EAC9B,IAAI,IAAI,GAAG,KAAK,CAAC;OACZ,WAAW,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;CAC9B;CACA,KAAK,MAAM,QAAQ,YAAY,OAAO,GAAG,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;CAC/F,KAAK,MAAM,QAAQ,WAAW,OAAO,GAAG,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;CAC9F,MAAM,kCAAkC,IAAI,IAAI;CAChD,KAAK,MAAM,KAAK,WAAW;EAC1B,MAAM,SAAS,gBAAgB,IAAI,EAAE,IAAI;EACzC,IAAI,QAAQ,OAAO,KAAK,CAAC;OACpB,gBAAgB,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;CACrC;CACA,KAAK,MAAM,QAAQ,gBAAgB,OAAO,GAAG,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;CACnG,SAAS,OAAO,eAAe;EAC9B,IAAI,CAAC,SAAS,OAAO,KAAK;EAC1B,OAAO,UAAU,OAAO,IAAI,aAAa,IAAI,YAAY;CAC1D;CACA,MAAM,8BAA8B,IAAI,IAAI;CAC5C,IAAI,SACE;OAAA,MAAM,KAAK;GACf,GAAG;GACH,GAAG;GACH,GAAG;EACJ,GAAG,IAAI,UAAU,OAAO,IAAI,EAAE,aAAa,GAAG;GAC7C,YAAY,IAAI,EAAE,IAAI;GACtB,YAAY,IAAI,EAAE,EAAE;EACrB;;CAED,SAAS,WAAW,MAAM;EACzB,IAAI,CAAC,SAAS,OAAO,KAAK;EAC1B,OAAO,YAAY,IAAI,IAAI,IAAI,YAAY;CAC5C;CACA,SAAS,QAAQ,MAAM,MAAM;EAC5B,IAAI,CAAC,SAAS,OAAO;EACrB,OAAO,SAAS,YAAY,IAAI,OAAO;CACxC;CACA,SAAS,WAAW,MAAM,MAAM;EAC/B,OAAO;GACN,eAAe,KAAK;GACpB,SAAS,KAAK;GACd;GACA,MAAM,OAAO,KAAK,aAAa;EAChC;CACD;;CAEA,SAAS,YAAY,MAAM,SAAS,SAAS;EAC5C,OAAO;GACN,eAAe;GACf;GACA;GACA,MAAM,OAAO,OAAO;EACrB;CACD;CACA,SAAS,SAAS,MAAM;EACvB,OAAO,EAAE,OAAO,CAAC;GAChB;GACA,4BAA4B,IAAI,IAAI,CAAC,MAAM,MAAM,CAAC;GAClD,OAAO,QAAQ,KAAK,MAAM,KAAK,IAAI;EACpC,CAAC,EAAE;CACJ;CACA,SAAS,QAAQ,MAAM,MAAM;EAC5B,OAAO,EAAE,OAAO,CAAC;GAChB;GACA,YAAY;GACZ,OAAO,QAAQ,KAAK,MAAM,KAAK,IAAI;EACpC,CAAC,EAAE;CACJ;CACA,SAAS,SAAS,SAAS;EAC1B,OAAO;GACN,MAAM;GACN,OAAO,CAAC;EACT;CACD;CACA,MAAM,kCAAkC,IAAI,IAAI;CAChD,SAAS,WAAW,MAAM;EACzB,MAAM,IAAI,gBAAgB,IAAI,IAAI;EAClC,IAAI,GAAG,OAAO,WAAW,GAAG,IAAI;EAChC,OAAO,YAAY,MAAM,OAAO,QAAQ,OAAO,MAAM;CACtD;CACA,MAAM,8BAA8B,IAAI,IAAI;CAC5C,MAAM,OAAO,CAAC;CACd,SAAS,UAAU;EAClB,OAAO,MAAM,KAAK,EAAE,QAAQ,UAAU,SAAS,UAAU,CAAC;CAC3D;CACA,SAAS,eAAe,KAAK,MAAM;EAClC,KAAK,MAAM,QAAQ,aAAa;GAC/B,IAAI,KAAK,IAAI,IAAI,GAAG;GACpB,MAAM,UAAU,OAAO;GACvB,MAAM,OAAO,IAAI;GACjB,IAAI,SAAS,KAAK,KAAK,KAAK,MAAM,WAAW,KAAK,CAAC,KAAK,MAAM,IAAI,WAAW,SAAS,WAAW,IAAI,CAAC;EACvG;CACD;CACA,MAAM,iCAAiC,IAAI,IAAI;CAC/C,SAAS,YAAY,KAAK;EACzB,OAAO;GACN,eAAe,IAAI,KAAK;GACxB,SAAS,IAAI,KAAK;GAClB,MAAM,IAAI;GACV,MAAM,OAAO,IAAI,KAAK,aAAa;EACpC;CACD;CACA,SAAS,aAAa,KAAK;EAC1B,MAAM,OAAO,OAAO,IAAI,KAAK,aAAa;EAC1C,IAAI,CAAC,SAAS,OAAO,IAAI;EACzB,OAAO,SAAS,YAAY,IAAI,IAAI,YAAY;CACjD;CACA,SAAS,YAAY,KAAK,KAAK,MAAM,MAAM,OAAO,OAAO;EACxD,MAAM,WAAW,IAAI;EACrB,MAAM,WAAW;GAChB;GACA,YAAY;GACZ;GACA,GAAG,OAAO,eAAe,EAAE,cAAc,KAAK,IAAI,CAAC;EACpD;EACA,IAAI,aAAa,SAAS,MAAM,SAAS,KAAK,SAAS,OAAO,IAAI,OAAO;GACxE,GAAG;GACH,OAAO,CAAC,GAAG,SAAS,OAAO,QAAQ;EACpC;OACK,IAAI,OAAO,EAAE,OAAO,CAAC,QAAQ,EAAE;CACrC;CACA,SAAS,mBAAmB,KAAK;EAChC,KAAK,MAAM,OAAO,gBAAgB,YAAY,KAAK,IAAI,WAAW,aAAa,YAAY,GAAG,mBAAmB,IAAI,IAAI,CAAC,MAAM,MAAM,CAAC,GAAG,aAAa,GAAG,CAAC;EAC3J,sBAAsB,GAAG;CAC1B;CACA,MAAM,iCAAiC,IAAI,IAAI;CAC/C,SAAS,sBAAsB,KAAK;EACnC,KAAK,MAAM,OAAO,gBAAgB;GACjC,MAAM,UAAU,IAAI,OAAO;GAC3B,IAAI,IAAI,QAAQ,EAAE,MAAM;GACxB,MAAM,OAAO,WAAW,IAAI,MAAM,IAAI,IAAI;GAC1C,YAAY,KAAK,SAAS,sBAAsB,IAAI,IAAI,CAAC,MAAM,MAAM,CAAC,GAAG,QAAQ,IAAI,MAAM,KAAK,IAAI,CAAC;EACtG;CACD;CACA,SAAS,eAAe,KAAK,aAAa,KAAK;EAC9C,MAAM,WAAW,cAAc;EAC/B,MAAM,WAAW,IAAI,WAAW;EAChC,MAAM,OAAO,YAAY,GAAG;EAC5B,MAAM,QAAQ,aAAa,GAAG;EAC9B,KAAK,IAAI,MAAM,WAAW,GAAG,MAAM,UAAU,OAAO,YAAY,KAAK,KAAK,sBAAsB,IAAI,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,KAAK;EACjI,YAAY,KAAK,UAAU,sBAAsB,IAAI,IAAI,CAAC,QAAQ,MAAM,CAAC,GAAG,KAAK;CAClF;CACA,SAAS,mBAAmB,KAAK,aAAa,KAAK;EAClD,MAAM,WAAW,cAAc;EAC/B,MAAM,WAAW,IAAI,WAAW;EAChC,MAAM,OAAO,YAAY,GAAG;EAC5B,MAAM,QAAQ,aAAa,GAAG;EAC9B,YAAY,KAAK,WAAW,GAAG,sBAAsB,IAAI,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,OAAO,EAAE,cAAc,KAAK,CAAC;EAC9G,KAAK,IAAI,MAAM,WAAW,GAAG,MAAM,UAAU,OAAO,YAAY,KAAK,KAAK,sBAAsB,IAAI,IAAI,CAAC,QAAQ,OAAO,CAAC,GAAG,KAAK;EACjI,YAAY,KAAK,UAAU,sBAAsB,IAAI,IAAI,CAAC,MAAM,MAAM,CAAC,GAAG,KAAK;CAChF;CACA,SAAS,iBAAiB,WAAW,eAAe,eAAe,WAAW;EAC7E,MAAM,MAAM,QAAQ;EACpB,MAAM,SAAS,CAAC,GAAG,aAAa,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;EAChE,IAAI,OAAO,WAAW,GAAG,OAAO;EAChC,MAAM,+BAA+B,IAAI,IAAI;EAC7C,KAAK,MAAM,KAAK,QAAQ,aAAa,IAAI,EAAE,MAAM,EAAE,IAAI;EACvD,IAAI,iBAAiB;EACrB,IAAI,SAAS,IAAI,aAAa,UAAU,OAAO,IAAI,UAAU,aAAa,GAAG,iBAAiB;OACzF;GACJ,MAAM,eAAe,OAAO,MAAM,MAAM,UAAU,OAAO,IAAI,EAAE,KAAK,aAAa,CAAC;GAClF,IAAI,cAAc,iBAAiB,aAAa;EACjD;EACA,MAAM,eAAe,YAAY;EACjC,MAAM,oBAAoB,iBAAiB;EAC3C,SAAS,QAAQ,KAAK,MAAM,MAAM;GACjC,MAAM,WAAW,IAAI;GACrB,MAAM,WAAW;IAChB;IACA,YAAY;IACZ,OAAO,QAAQ,KAAK,MAAM,KAAK,IAAI;GACpC;GACA,IAAI,OAAO,YAAY,SAAS,MAAM,SAAS,IAAI;IAClD,GAAG;IACH,OAAO,CAAC,GAAG,SAAS,OAAO,QAAQ;GACpC,IAAI,EAAE,OAAO,CAAC,QAAQ,EAAE;EACzB;EACA,MAAM,iBAAiB,kBAAkB,0BAA0B,IAAI,IAAI,CAAC,QAAQ,MAAM,CAAC,oBAAoB,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC;EACrI,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;GACvC,MAAM,IAAI,OAAO;GACjB,IAAI,EAAE,SAAS,gBAAgB;GAC/B,MAAM,aAAa,WAAW,EAAE,MAAM,EAAE,IAAI;GAC5C,MAAM,UAAU,EAAE,OAAO;GACzB,QAAQ,SAAS,YAAY,cAAc;GAC3C,MAAM,YAAY,MAAM,IAAI,eAAe,IAAI,OAAO,IAAI,EAAE,CAAC,OAAO,cAAc;GAClF,KAAK,IAAI,MAAM,WAAW,MAAM,SAAS,OAAO,QAAQ,KAAK,4BAA4B,IAAI,IAAI,CAAC,QAAQ,OAAO,CAAC,CAAC;EACpH;EACA,MAAM,iBAAiB,mBAAmB,YAAY,YAAY,WAAW,WAAW,SAAS,IAAI,WAAW,SAAS,IAAI,WAAW,aAAa,IAAI,cAAc,GAAG,cAAc;EACxL,IAAI,mBAAmB,WAAW,QAAQ,cAAc,gCAAgC,IAAI,IAAI,CAAC,MAAM,MAAM,CAAC,CAAC;OAC1G;GACJ,QAAQ,cAAc,gBAAgB,kBAAkB,0BAA0B,IAAI,IAAI,CAAC,MAAM,OAAO,CAAC,oBAAoB,IAAI,IAAI,CAAC,QAAQ,OAAO,CAAC,CAAC;GACvJ,KAAK,IAAI,MAAM,eAAe,GAAG,MAAM,mBAAmB,OAAO,QAAQ,KAAK,gCAAgC,IAAI,IAAI,CAAC,QAAQ,OAAO,CAAC,CAAC;GACxI,QAAQ,mBAAmB,gBAAgB,cAAc;EAC1D;EACA,eAAe,qBAAqB,IAAI,IAAI,CAAC,WAAW,GAAG,OAAO,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;EACtF,mBAAmB,GAAG;EACtB,OAAO;CACR;CACA,KAAK,MAAM,eAAe,cAAc;EACvC,IAAI,gBAAgB,MAAM;GACzB,MAAM,SAAS,QAAQ;GACvB,OAAO,KAAK;IACX,OAAO,CAAC;IACR,WAAW;GACZ;GACA,KAAK,KAAK,MAAM;GAChB;EACD;EACA,MAAM,EAAE,MAAM,aAAa;EAC3B,MAAM,cAAc,SAAS,IAAI,QAAQ,KAAK;EAC9C,YAAY,IAAI,WAAW;EAC3B,MAAM,WAAW,YAAY,IAAI,QAAQ,KAAK,CAAC;EAC/C,IAAI,SAAS,SAAS,GAAG;GACxB,MAAM,mBAAmB,SAAS;GAClC,MAAM,iBAAiB,SAAS,IAAI,iBAAiB,aAAa,KAAK,SAAS,IAAI,iBAAiB,EAAE,KAAK;GAC5G,MAAM,gBAAgB,SAAS,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO;IACnD,MAAM,SAAS,IAAI,EAAE,aAAa,KAAK,SAAS,IAAI,EAAE,EAAE,KAAK;IAC7D,MAAM;GACP,EAAE,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,kBAAkB,YAAY,IAAI,EAAE,IAAI,CAAC;GACtE,IAAI,cAAc,SAAS,GAAG;IAC7B,MAAM,YAAY,SAAS;IAC3B,MAAM,UAAU,iBAAiB,aAAa,eAAe,QAAQ,SAAS;IAC9E,KAAK,KAAK,OAAO;IACjB,kBAAkB,SAAS,OAAO;IAClC,KAAK,MAAM,KAAK,eAAe,YAAY,OAAO,EAAE,IAAI;GACzD;EACD;EACA,MAAM,iBAAiB,gBAAgB,IAAI,QAAQ,KAAK,CAAC;EACzD,KAAK,MAAM,YAAY,gBAAgB;GACtC,MAAM,MAAM,QAAQ;GACpB,MAAM,UAAU,cAAc;GAC9B,MAAM,UAAU,cAAc,cAAc;GAC5C,MAAM,OAAO,WAAW,UAAU,WAAW;GAC7C,IAAI,WAAW,SAAS,IAAI;GAC5B,IAAI,WAAW,EAAE,OAAO,CAAC;IACxB;IACA,4BAA4B,IAAI,IAAI;IACpC,OAAO,QAAQ,aAAa,KAAK,IAAI;IACrC,UAAU;GACX,CAAC,EAAE;GACH,eAAe,qBAAqB,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC;GAC1D,mBAAmB,GAAG;GACtB,KAAK,KAAK,GAAG;EACd;EACA;GACC,MAAM,MAAM,QAAQ;GACpB,MAAM,UAAU,cAAc;GAC9B,IAAI,WAAW,SAAS;IACvB,cAAc;IACd,SAAS,aAAa;IACtB,MAAM;IACN,MAAM,WAAW,QAAQ;GAC1B,CAAC;GACD,eAAe,qBAAqB,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC;GAC1D,MAAM,cAAc,iBAAiB,IAAI,QAAQ,KAAK,CAAC;GACvD,KAAK,MAAM,OAAO,aAAa,eAAe,OAAO,GAAG;GACxD,KAAK,MAAM,OAAO,CAAC,GAAG,cAAc,GAAG,IAAI,IAAI,KAAK,OAAO,UAAU,eAAe,OAAO,GAAG;GAC9F,mBAAmB,GAAG;GACtB,KAAK,MAAM,OAAO,aAAa,mBAAmB,KAAK,aAAa,GAAG;GACvE,MAAM,UAAU,iBAAiB,IAAI,QAAQ,KAAK,CAAC;GACnD,KAAK,MAAM,OAAO,SAAS,eAAe,KAAK,aAAa,GAAG;GAC/D,KAAK,KAAK,GAAG;GACb,KAAK,MAAM,OAAO,SAAS,eAAe,IAAI,GAAG;GACjD,KAAK,MAAM,OAAO,iBAAiB,IAAI,QAAQ,KAAK,CAAC,GAAG,eAAe,IAAI;IAC1E,MAAM;IACN,MAAM;GACP,CAAC;EACF;EACA,SAAS,YAAY,MAAM;GAC1B,MAAM,WAAW,SAAS,IAAI,KAAK,aAAa;GAChD,IAAI,aAAa,KAAK,GAAG,OAAO;GAChC,OAAO,KAAK,IAAI,SAAS,IAAI,KAAK,IAAI,KAAK,GAAG,SAAS,IAAI,KAAK,EAAE,KAAK,CAAC;EACzE;EACA,MAAM,UAAU,WAAW,IAAI,QAAQ,KAAK,CAAC;EAC7C,QAAQ,MAAM,GAAG,MAAM;GACtB,MAAM,QAAQ,YAAY,CAAC;GAC3B,MAAM,QAAQ,YAAY,CAAC;GAC3B,IAAI,UAAU,OAAO,OAAO,QAAQ;GACpC,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO;EACzC,CAAC;EACD,KAAK,MAAM,QAAQ,SAAS,gBAAgB,IAAI,YAAY,IAAI,GAAG,IAAI;EACvE;GACC,MAAM,UAAU,iBAAiB,IAAI,QAAQ,KAAK,CAAC;GACnD,KAAK,MAAM,OAAO,SAAS;IAC1B,MAAM,MAAM,QAAQ;IACpB,MAAM,UAAU,IAAI,WAAW;IAC/B,MAAM,UAAU,UAAU;IAC1B,MAAM,OAAO,YAAY,GAAG;IAC5B,MAAM,QAAQ,aAAa,GAAG;IAC9B,YAAY,KAAK,SAAS,sBAAsB,IAAI,IAAI,CAAC,MAAM,MAAM,CAAC,GAAG,KAAK;IAC9E,YAAY,KAAK,SAAS,sBAAsB,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK;IACxE,eAAe,qBAAqB,IAAI,IAAI,CAAC;IAC7C,mBAAmB,GAAG;IACtB,KAAK,KAAK,GAAG;GACd;EACD;EACA,IAAI,QAAQ,SAAS,GAAG;GACvB,MAAM,gBAAgB,QAAQ,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO;IAClD,MAAM,YAAY,CAAC;IACnB,MAAM;GACP,EAAE;GACF,MAAM,YAAY,QAAQ;GAC1B,MAAM,UAAU,iBAAiB,aAAa,eAAe,SAAS,SAAS;GAC/E,KAAK,KAAK,OAAO;GACjB,kBAAkB,SAAS,OAAO;GAClC,KAAK,MAAM,KAAK,eAAe,YAAY,IAAI,EAAE,IAAI;EACtD;EACA,KAAK,MAAM,QAAQ,SAAS;GAC3B,MAAM,QAAQ,YAAY,IAAI;GAC9B,MAAM,MAAM,QAAQ;GACpB,MAAM,UAAU,QAAQ;GACxB,MAAM,UAAU,QAAQ,cAAc;GACtC,MAAM,OAAO,WAAW,MAAM,KAAK;GACnC,IAAI,WAAW,SAAS,IAAI;GAC5B,IAAI,WAAW,QAAQ,sBAAsB,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;GAC5D,eAAe,qBAAqB,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;GACpD,mBAAmB,GAAG;GACtB,KAAK,KAAK,GAAG;EACd;EACA;GACC,MAAM,YAAY,iBAAiB,IAAI,QAAQ,KAAK,CAAC;GACrD,KAAK,MAAM,OAAO,WAAW;IAC5B,MAAM,MAAM,QAAQ;IACpB,MAAM,UAAU,cAAc,cAAc;IAC5C,MAAM,OAAO,WAAW,KAAK,WAAW;IACxC,MAAM,QAAQ,QAAQ,aAAa,KAAK,IAAI;IAC5C,YAAY,KAAK,SAAS,sBAAsB,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK;IACxE,eAAe,qBAAqB,IAAI,IAAI,CAAC;IAC7C,mBAAmB,GAAG;IACtB,KAAK,KAAK,GAAG;GACd;EACD;EACA,IAAI,QAAQ,WAAW,GAAG,YAAY,OAAO,WAAW;CACzD;CACA,OAAO;AACR;AACA,SAAS,kBAAkB,KAAK,SAAS;CACxC,KAAK,MAAM,QAAQ,KAAK;EACvB,IAAI,KAAK,MAAM,UAAU,GAAG;EAC5B,IAAI,WAAW,OAAO;EACtB,KAAK,MAAM,MAAM,KAAK,OAAO,IAAI,GAAG,QAAQ,UAAU,WAAW,GAAG;EACpE,MAAM,MAAM,KAAK,MAAM,QAAQ,OAAO,GAAG,UAAU,QAAQ;EAC3D,IAAI,IAAI,SAAS,GACZ;OAAA,SACC;QAAA,IAAI,IAAI,IAAI,KAAK,OAAO,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,GAAG,MAAM,IAAI,cAAc,uHAAuH;GAAA;EAAC;CAGxM;AACD;AAGA,SAAS,mBAAmB,GAAG,GAAG;CACjC,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO;AACzC;AACA,SAAS,WAAW,KAAK,KAAK;CAC7B,IAAI,IAAI,MAAM,IAAI,IAAI,GAAG,KAAK,KAAK,CAAC;AACrC;AACA,SAAS,sBAAsB,GAAG,GAAG;CACpC,IAAI,MAAA,SAA2B,OAAO;CACtC,IAAI,MAAA,SAA2B,OAAO;CACtC,OAAO,EAAE,cAAc,CAAC;AACzB;;;;;;;;;;;;;;;AAeA,SAAS,iBAAiB,OAAO,YAAY;CAC5C,MAAM,2BAA2B,IAAI,IAAI;CACzC,KAAK,MAAM,QAAQ,OAAO,SAAS,IAAI,MAAM,CAAC;CAC9C,KAAK,MAAM,QAAQ,YAAY,WAAW,UAAU,KAAK,EAAE;CAC3D,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,UAAU,SAAS,IAAI,IAAI,KAAK,OAAO,CAAC;CACzE,MAAM,KAAK,qBAAqB;CAChC,MAAM,QAAQ,MAAM,SAAS,IAAI,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,qBAAqB,CAAC,CAAC,MAAM,GAAG,CAAC;CAC1F,MAAM,uBAAuB,IAAI,IAAI;CACrC,KAAK,MAAM,QAAQ,OAAO,KAAK,IAAI,MAAM,CAAC;CAC1C,MAAM,YAAY,MAAM;CACxB,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC5C,IAAI,UAAU;EACd,KAAK,MAAM,QAAQ,YAAY;GAC9B,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI;GAC/B,IAAI,SAAS,KAAK,GAAG;GACrB,MAAM,OAAO,OAAO;GACpB,IAAI,QAAQ,KAAK,IAAI,KAAK,EAAE,KAAK,OAAO,oBAAoB;IAC3D,KAAK,IAAI,KAAK,IAAI,IAAI;IACtB,UAAU;GACX;EACD;EACA,IAAI,CAAC,SAAS;CACf;CACA,KAAK,MAAM,QAAQ,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,MAAM,CAAC;CAC/D,OAAO;AACR;AACA,SAAS,gBAAgB,OAAO,MAAM,YAAY;CACjD,IAAI,UAAU,MAAM,OAAO;CAC3B,MAAM,2BAA2B,IAAI,IAAI;CACzC,KAAK,MAAM,QAAQ,YAAY;EAC9B,MAAM,SAAS,SAAS,IAAI,KAAK,IAAI;EACrC,IAAI,QAAQ,OAAO,KAAK,KAAK,EAAE;OAC1B,SAAS,IAAI,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC;CACvC;CACA,MAAM,0BAA0B,IAAI,IAAI,CAAC,KAAK,CAAC;CAC/C,MAAM,QAAQ,CAAC,KAAK;CACpB,OAAO,MAAM,SAAS,GAAG;EACxB,MAAM,OAAO,MAAM,MAAM;EACzB,IAAI,SAAS,KAAK,GAAG;EACrB,KAAK,MAAM,QAAQ,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG;GAC5C,IAAI,SAAS,MAAM,OAAO;GAC1B,IAAI,CAAC,QAAQ,IAAI,IAAI,GAAG;IACvB,QAAQ,IAAI,IAAI;IAChB,MAAM,KAAK,IAAI;GAChB;EACD;CACD;CACA,OAAO;AACR;;;;;;;;;;;;;;;;;;AAkBA,SAAS,0BAA0B,OAAO,qBAAqB,SAAS;CACvE,IAAI,aAAa,QAAQ,QAAQ,SAAS,oBAAoB,IAAI,KAAK,IAAI,MAAM,SAAS;CAC1F,OAAO,WAAW,SAAS,GAAG;EAC7B,MAAM,OAAO,iBAAiB,OAAO,UAAU;EAC/C,MAAM,YAAY,WAAW,QAAQ,SAAS;GAC7C,KAAK,KAAK,IAAI,KAAK,EAAE,KAAK,OAAO,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,OAAO;GACnE,MAAM,UAAU,WAAW,QAAQ,cAAc,cAAc,IAAI;GACnE,OAAO,gBAAgB,KAAK,IAAI,KAAK,MAAM,OAAO;EACnD,CAAC;EACD,IAAI,UAAU,WAAW,GAAG;EAC5B,UAAU,KAAK,kBAAkB;EACjC,MAAM,WAAW,UAAU;EAC3B,IAAI,aAAa,KAAK,GAAG;EACzB,oBAAoB,IAAI,SAAS,MAAM,UAAU;EACjD,aAAa,WAAW,QAAQ,SAAS,SAAS,QAAQ;CAC3D;AACD;;;;;;;AAOA,SAAS,wBAAwB,OAAO;CACvC,MAAM,wBAAwB,IAAI,IAAI;CACtC,MAAM,sCAAsC,IAAI,IAAI;CACpD,MAAM,iCAAiC,IAAI,IAAI;CAC/C,MAAM,UAAU,CAAC;CACjB,KAAK,MAAM,QAAQ,OAAO;EACzB,MAAM,IAAI,KAAK,IAAI;EACnB,MAAM,IAAI,KAAK,EAAE;EACjB,IAAI,KAAK,SAAS,KAAK,IAAI;GAC1B,oBAAoB,IAAI,KAAK,MAAM,MAAM;GACzC;EACD;EACA,QAAQ,KAAK,IAAI;EACjB,MAAM,SAAS,eAAe,IAAI,KAAK,IAAI;EAC3C,IAAI,QAAQ,OAAO,KAAK,IAAI;OACvB,eAAe,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;CAC1C;CACA,KAAK,MAAM,UAAU,eAAe,OAAO,GAAG,OAAO,KAAK,kBAAkB;CAC5E,MAAM,kCAAkC,IAAI,IAAI;CAChD,KAAK,MAAM,QAAQ,OAAO,gBAAgB,IAAI,MAAM,CAAC;CACrD,KAAK,MAAM,UAAU,eAAe,OAAO,GAAG,KAAK,MAAM,QAAQ,QAAQ,WAAW,iBAAiB,KAAK,EAAE;CAC5G,MAAM,WAAW,CAAC;CAClB,KAAK,MAAM,QAAQ,OAAO,KAAK,gBAAgB,IAAI,IAAI,KAAK,OAAO,GAAG,SAAS,KAAK,IAAI;CACxF,SAAS,MAAM,GAAG,MAAM;EACvB,IAAI,MAAA,SAA2B,OAAO;EACtC,IAAI,MAAA,SAA2B,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CACzB,CAAC;CACD,IAAI,SAAS,WAAW,GAAG,SAAS,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;CACzF,MAAM,QAAQ;CACd,MAAM,OAAO;CACb,MAAM,QAAQ;CACd,MAAM,wBAAwB,IAAI,IAAI;CACtC,MAAM,4BAA4B,IAAI,IAAI;CAC1C,KAAK,MAAM,QAAQ,OAAO,MAAM,IAAI,MAAM,KAAK;CAC/C,MAAM,QAAQ,CAAC;CACf,SAAS,qBAAqB,UAAU,MAAM;EAC7C,OAAO,UAAU,IAAI,IAAI,MAAM;CAChC;CACA,SAAS,UAAU,MAAM,QAAQ;EAChC,MAAM,IAAI,MAAM,IAAI;EACpB,UAAU,IAAI,MAAM,MAAM;EAC1B,MAAM,KAAK;GACV;GACA,UAAU,eAAe,IAAI,IAAI,KAAK,CAAC;GACvC,OAAO;EACR,CAAC;CACF;CACA,SAAS,WAAW,MAAM;EACzB,IAAI,MAAM,IAAI,IAAI,MAAM,OAAO;EAC/B,UAAU,MAAM,KAAK,CAAC;EACtB,OAAO,MAAM,SAAS,GAAG;GACxB,MAAM,QAAQ,MAAM,MAAM,SAAS;GACnC,IAAI,UAAU,KAAK,GAAG;GACtB,IAAI,MAAM,SAAS,MAAM,SAAS,QAAQ;IACzC,MAAM,IAAI,MAAM,MAAM,KAAK;IAC3B,MAAM,IAAI;IACV;GACD;GACA,MAAM,OAAO,MAAM,SAAS,MAAM;GAClC,MAAM,SAAS;GACf,IAAI,SAAS,KAAK,GAAG;GACrB,MAAM,IAAI,KAAK;GACf,MAAM,SAAS,MAAM,IAAI,CAAC;GAC1B,IAAI,WAAW,QAAQ,qBAAqB,GAAG,MAAM,IAAI,GAAG,oBAAoB,IAAI,KAAK,MAAM,UAAU;QACpG;IACJ,oBAAoB,IAAI,KAAK,MAAM,SAAS;IAC5C,IAAI,WAAW,OAAO,UAAU,GAAG,MAAM,IAAI;GAC9C;EACD;CACD;CACA,KAAK,MAAM,QAAQ,UAAU,WAAW,IAAI;CAC5C,MAAM,iBAAiB,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,SAAS,MAAM,IAAI,IAAI,MAAM,KAAK;CAC5E,eAAe,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;CAChD,KAAK,MAAM,QAAQ,gBAAgB,WAAW,IAAI;CAClD,0BAA0B,OAAO,qBAAqB,OAAO;CAC7D,MAAM,kCAAkC,IAAI,IAAI;CAChD,MAAM,mCAAmC,IAAI,IAAI;CACjD,KAAK,MAAM,QAAQ,OAAO;EACzB,IAAI,oBAAoB,IAAI,KAAK,IAAI,MAAM,WAAW;EACtD,WAAW,kBAAkB,KAAK,IAAI;EACtC,WAAW,iBAAiB,KAAK,EAAE;CACpC;CACA,OAAO;EACN;EACA;EACA;CACD;AACD;;;;AAIA,SAAS,+BAA+B,OAAO;CAC9C,MAAM,aAAa,CAAC;CACpB,KAAK,MAAM,SAAS,MAAM,aAAa,OAAO,GAAG,KAAK,MAAM,QAAQ,OAAO,WAAW,KAAK;EAC1F,MAAM,KAAK;EACX,MAAM,KAAK;EACX,IAAI,KAAK;EACT,SAAS,KAAK;CACf,CAAC;CACD,OAAO,wBAAwB,UAAU;AAC1C;;;;;;AAQA,SAAS,0BAA0B,OAAO;CACzC,MAAM,0BAA0B,IAAI,IAAI;CACxC,MAAM,4BAA4B,IAAI,IAAI;CAC1C,SAAS,YAAY,GAAG,GAAG;EAC1B,MAAM,QAAQ,UAAU,IAAI,CAAC;EAC7B,IAAI,OAAO,MAAM,KAAK,CAAC;OAClB,UAAU,IAAI,GAAG,CAAC,CAAC,CAAC;EACzB,MAAM,QAAQ,UAAU,IAAI,CAAC;EAC7B,IAAI,OAAO,MAAM,KAAK,CAAC;OAClB,UAAU,IAAI,GAAG,CAAC,CAAC,CAAC;CAC1B;CACA,KAAK,MAAM,SAAS,MAAM,aAAa,OAAO,GAAG,KAAK,MAAM,QAAQ,OAAO,IAAI,KAAK,SAAS,KAAK,IAAI,YAAY,KAAK,MAAM,KAAK,EAAE;CACpI,KAAK,MAAM,QAAQ,MAAM,OAAO,IAAI,CAAC,UAAU,IAAI,IAAI,GAAG,UAAU,IAAI,MAAM,CAAC,CAAC;CAChF,MAAM,aAAa,CAAC;CACpB,SAAS,aAAa,OAAO;EAC5B,MAAM,4BAA4B,IAAI,IAAI;EAC1C,MAAM,QAAQ,CAAC,KAAK;EACpB,OAAO,MAAM,SAAS,GAAG;GACxB,MAAM,OAAO,MAAM,MAAM;GACzB,IAAI,SAAS,KAAK,KAAK,QAAQ,IAAI,IAAI,GAAG;GAC1C,QAAQ,IAAI,IAAI;GAChB,UAAU,IAAI,IAAI;GAClB,KAAK,MAAM,YAAY,UAAU,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG,MAAM,KAAK,QAAQ;EAClG;EACA,OAAO;CACR;CACA,MAAM,WAAW,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM;EAChD,IAAI,MAAA,SAA2B,OAAO;EACtC,IAAI,MAAA,SAA2B,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CACzB,CAAC;CACD,KAAK,MAAM,QAAQ,UAAU,IAAI,CAAC,QAAQ,IAAI,IAAI,GAAG,WAAW,KAAK,aAAa,IAAI,CAAC;CACvF,WAAW,MAAM,GAAG,MAAM;EACzB,MAAM,YAAY,EAAE,IAAI,mBAAmB;EAC3C,MAAM,YAAY,EAAE,IAAI,mBAAmB;EAC3C,IAAI,aAAa,CAAC,WAAW,OAAO;EACpC,IAAI,CAAC,aAAa,WAAW,OAAO;EACpC,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM;EAC7D,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM;EAC7D,OAAO,KAAK,cAAc,IAAI;CAC/B,CAAC;CACD,OAAO;AACR;AACA,SAAS,wBAAwB,gBAAgB,UAAU;CAC1D,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,QAAQ,gBAAgB,KAAK,SAAS,gBAAgB,IAAI,IAAI,KAAK,OAAO,GAAG,MAAM,KAAK,IAAI;CACvG,MAAM,MAAM,GAAG,MAAM;EACpB,IAAI,MAAA,SAA2B,OAAO;EACtC,IAAI,MAAA,SAA2B,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CACzB,CAAC;CACD,IAAI,MAAM,SAAS,GAAG,OAAO;CAC7B,OAAO,CAAC,GAAG,cAAc,CAAC,CAAC,MAAM,GAAG,MAAM;EACzC,IAAI,MAAA,SAA2B,OAAO;EACtC,IAAI,MAAA,SAA2B,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CACzB,CAAC;AACF;AACA,SAAS,sBAAsB,GAAG,GAAG,MAAM;CAC1C,MAAM,QAAQ,KAAK,IAAI,CAAC,KAAK;CAC7B,MAAM,QAAQ,KAAK,IAAI,CAAC,KAAK;CAC7B,IAAI,UAAU,OAAO,OAAO,QAAQ;CACpC,IAAI,MAAA,SAA2B,OAAO;CACtC,IAAI,MAAA,SAA2B,OAAO;CACtC,OAAO,EAAE,cAAc,CAAC;AACzB;;;;;;;;AAQA,SAAS,QAAQ,MAAM;CACtB,IAAI,MAAM;CACV,KAAK,MAAM,SAAS,KAAK,OAAO,GAAG,IAAI,QAAQ,KAAK,MAAM;CAC1D,OAAO;AACR;AACA,SAAS,+BAA+B,gBAAgB,UAAU,OAAO,cAAc;CACtF,MAAM,6BAA6B,IAAI,IAAI;CAC3C,KAAK,MAAM,QAAQ,gBAAgB,WAAW,IAAI,MAAM,CAAC,CAAC;CAC1D,KAAK,MAAM,SAAS,MAAM,aAAa,OAAO,GAAG,KAAK,MAAM,QAAQ,OAAO;EAC1E,IAAI,CAAC,eAAe,IAAI,KAAK,IAAI,KAAK,CAAC,eAAe,IAAI,KAAK,EAAE,GAAG;EACpE,IAAI,KAAK,SAAS,KAAK,IAAI;EAC3B,IAAI,SAAS,oBAAoB,IAAI,KAAK,aAAa,MAAM,WAAW;EACxE,MAAM,SAAS,WAAW,IAAI,KAAK,IAAI;EACvC,IAAI,QAAQ,OAAO,KAAK,KAAK,EAAE;CAChC;CACA,MAAM,QAAQ,wBAAwB,gBAAgB,QAAQ;CAC9D,MAAM,uBAAuB,IAAI,IAAI;CACrC,KAAK,MAAM,QAAQ,OAAO,KAAK,IAAI,MAAM,CAAC;CAC1C,MAAM,YAAY,eAAe;CACjC,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC5C,IAAI,UAAU;EACd,KAAK,MAAM,QAAQ,gBAAgB;GAClC,MAAM,OAAO,KAAK,IAAI,IAAI;GAC1B,IAAI,SAAS,KAAK,GAAG;GACrB,KAAK,MAAM,MAAM,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG;IAC5C,MAAM,OAAO,OAAO;IACpB,IAAI,QAAQ,KAAK,IAAI,EAAE,KAAK,KAAK;KAChC,KAAK,IAAI,IAAI,IAAI;KACjB,UAAU;IACX;GACD;EACD;EACA,IAAI,CAAC,SAAS;CACf;CACA,KAAK,MAAM,QAAQ,gBAAgB,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,MAAM,CAAC;CACxE,IAAI,iBAAiB,KAAK,KAAK,iBAAA,WAAwC,eAAe,IAAI,YAAY,MAAM,WAAW,IAAI,YAAY,KAAK,CAAC,EAAA,CAAG,WAAW,GAAG,KAAK,IAAI,cAAc,QAAQ,IAAI,IAAI,CAAC;CACtM,OAAO,CAAC,GAAG,cAAc,CAAC,CAAC,MAAM,GAAG,MAAM,sBAAsB,GAAG,GAAG,IAAI,CAAC;AAC5E;;;;;;;;;;;;;;;;;;;;;AAqBA,SAAS,qBAAqB,OAAO,cAAc;CAClD,OAAO,iBAAiB,KAAK,KAAK,iBAAA,WAAwC,CAAC,MAAM,MAAM,IAAI,YAAY,IAAI,eAAe,KAAK;AAChI;AACA,SAAS,cAAc,MAAM,OAAO;CACnC,OAAO,CAAC,MAAM,MAAM,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,QAAQ,EAAE,SAAS,EAAE,EAAE;AACrF;AACA,SAAS,qBAAqB,OAAO,WAAW;CAC/C,MAAM,4BAA4B,IAAI,IAAI,CAAC,KAAK,CAAC;CACjD,MAAM,QAAQ,CAAC,KAAK;CACpB,OAAO,MAAM,SAAS,GAAG;EACxB,MAAM,OAAO,MAAM,MAAM;EACzB,IAAI,SAAS,KAAK,GAAG;EACrB,KAAK,MAAM,QAAQ,UAAU,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,GAAG;GACvE,UAAU,IAAI,IAAI;GAClB,MAAM,KAAK,IAAI;EAChB;CACD;CACA,OAAO;AACR;AACA,SAAS,kBAAkB,OAAO;CACjC,MAAM,4BAA4B,IAAI,IAAI;CAC1C,KAAK,MAAM,QAAQ,OAAO;EACzB,IAAI,KAAK,SAAS,aAAa,KAAK,SAAS,KAAK,IAAI;EACtD,MAAM,SAAS,UAAU,IAAI,KAAK,IAAI;EACtC,IAAI,QAAQ,OAAO,KAAK,KAAK,EAAE;OAC1B,UAAU,IAAI,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC;CACxC;CACA,OAAO;AACR;AACA,SAAS,8BAA8B,OAAO,cAAc;CAC3D,IAAI,iBAAiB,KAAK,KAAK,iBAAA,WAAwC,CAAC,cAAc,cAAc,KAAK,GAAG,OAAO;CACnH,MAAM,gBAAgB;CACtB,MAAM,YAAY,kBAAkB,KAAK;CACzC,MAAM,+BAA+B,IAAI,IAAI;CAC7C,SAAS,qBAAqB,MAAM;EACnC,IAAI,SAAS,aAAa,IAAI,IAAI;EAClC,IAAI,WAAW,KAAK,GAAG;GACtB,SAAS,qBAAqB,MAAM,SAAS;GAC7C,aAAa,IAAI,MAAM,MAAM;EAC9B;EACA,OAAO,OAAO,IAAI,aAAa;CAChC;CACA,SAAS,UAAU,MAAM;EACxB,IAAI,KAAK,SAAS,aAAa,KAAK,SAAS,KAAK,IAAI,OAAO;EAC7D,IAAI,KAAK,OAAO,eAAe,OAAO;EACtC,IAAI,qBAAqB,KAAK,EAAE,GAAG,OAAO;EAC1C,OAAO;CACR;CACA,OAAO,MAAM,KAAK,MAAM,WAAW;EAClC;EACA;EACA,MAAM,UAAU,IAAI;CACrB,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM;EAClB,IAAI,EAAE,KAAK,SAAS,EAAE,KAAK,MAAM,OAAO,EAAE,QAAQ,EAAE;EACpD,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO,EAAE,OAAO,EAAE;EACzC,OAAO,EAAE,QAAQ,EAAE;CACpB,CAAC,CAAC,CAAC,KAAK,EAAE,WAAW,IAAI;AAC1B;AACA,SAAS,sBAAsB,OAAO;CACrC,MAAM,8BAA8B,IAAI,IAAI;CAC5C,MAAM,4BAA4B,IAAI,IAAI;CAC1C,KAAK,MAAM,cAAc,OAAO;EAC/B,MAAM,aAAa,YAAY,IAAI,WAAW,IAAI;EAClD,IAAI,YAAY,WAAW,KAAK,UAAU;OACrC,YAAY,IAAI,WAAW,MAAM,CAAC,UAAU,CAAC;EAClD,MAAM,WAAW,UAAU,IAAI,WAAW,EAAE;EAC5C,IAAI,UAAU,SAAS,KAAK,UAAU;OACjC,UAAU,IAAI,WAAW,IAAI,CAAC,UAAU,CAAC;CAC/C;CACA,OAAO;EACN;EACA;CACD;AACD;AACA,SAAS,wBAAwB,OAAO,UAAU,CAAC,GAAG;CACrD,MAAM,aAAa;EAClB,OAAO,CAAC;EACR,OAAO,CAAC;EACR,6BAA6B,IAAI,IAAI;EACrC,2BAA2B,IAAI,IAAI;CACpC;CACA,IAAI,MAAM,MAAM,SAAS,GAAG;EAC3B,MAAM,WAAW,qBAAqB,OAAO,QAAQ,YAAY;EACjE,OAAO,aAAa,KAAK,IAAI;GAC5B,GAAG;GACH,OAAO,CAAC,QAAQ;EACjB,IAAI;CACL;CACA,MAAM,WAAW,+BAA+B,KAAK;CACrD,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,YAAY,MAAM,aAAa,OAAO,GAAG,KAAK,MAAM,QAAQ,UAAU;EAChF,MAAM,OAAO,SAAS,oBAAoB,IAAI,KAAK,aAAa,KAAK;EACrE,MAAM,KAAK;GACV,eAAe,KAAK;GACpB,MAAM,KAAK;GACX,IAAI,KAAK;GACT,SAAS,KAAK;GACd;EACD,CAAC;CACF;CACA,MAAM,cAAc,8BAA8B,OAAO,QAAQ,YAAY;CAC7E,MAAM,EAAE,aAAa,cAAc,sBAAsB,WAAW;CACpE,MAAM,aAAa,0BAA0B,KAAK;CAClD,MAAM,QAAQ,CAAC;CACf,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC3C,IAAI,IAAI,GAAG,MAAM,KAAK,IAAI;EAC1B,MAAM,YAAY,WAAW;EAC7B,IAAI,cAAc,KAAK,GAAG;EAC1B,MAAM,UAAU,+BAA+B,WAAW,UAAU,OAAO,QAAQ,YAAY;EAC/F,KAAK,MAAM,QAAQ,SAAS,MAAM,KAAK,IAAI;CAC5C;CACA,MAAM,WAAW,qBAAqB,OAAO,QAAQ,YAAY;CACjE,IAAI,aAAa,KAAK,GAAG;EACxB,IAAI,MAAM,SAAS,GAAG,MAAM,QAAQ,IAAI;EACxC,MAAM,QAAQ,QAAQ;CACvB;CACA,OAAO;EACN;EACA,OAAO;EACP;EACA;CACD;AACD;AAGA,SAAS,8BAA8B,aAAa,eAAe;CAClE,MAAM,yBAAyB,IAAI,IAAI;CACvC,KAAK,MAAM,CAAC,eAAe,mBAAmB,aAAa;EAC1D,MAAM,mBAAmB,cAAc,IAAI,aAAa;EACxD,OAAO,IAAI,eAAe;GACzB,GAAG;GACH,GAAG,kBAAkB,WAAW,KAAK,IAAI,EAAE,QAAQ,iBAAiB,OAAO,IAAI,CAAC;EACjF,CAAC;CACF;CACA,OAAO;AACR;;;;;;AAMA,SAAS,6BAA6B,uBAAuB;CAC5D,MAAM,yBAAyB,IAAI,IAAI;CACvC,IAAI,mBAAmB;CACvB,KAAK,MAAM,CAAC,eAAe,eAAe,uBAAuB;EAChE,IAAI,WAAW,kBAAkB,KAAK,GAAG;EACzC,mBAAmB;EACnB,IAAI,WAAW,kBAAkB,WAAW,OAAO,IAAI,aAAa;CACrE;CACA,OAAO,mBAAmB;EACzB,MAAM;EACN;CACD,IAAI;EACH,MAAM;EACN,wBAAwB,IAAI,IAAI;CACjC;AACD;AACA,SAAS,kBAAkB,OAAO;CACjC,MAAM,WAAW,wBAAwB,MAAM,OAAO,EAAE,cAAc,MAAM,iBAAiB,CAAC;CAC9F,OAAO;EACN,MAAM,UAAU,UAAU,CAAC,GAAG;GAC7B,MAAM;GACN,wBAAwB,IAAI,IAAI;EACjC,CAAC;EACD;CACD;AACD;;;;;AAKA,SAAS,oCAAoC,QAAQ,YAAY,WAAW;CAC3E,IAAI,YAAY;CAChB,KAAK,MAAM,SAAS,QAAQ;EAC3B,MAAM,EAAE,SAAS,kBAAkB,KAAK;EACxC,YAAY,KAAK,IAAI,WAAW,mBAAmB,MAAM,SAAS,CAAC;CACpE;CACA,OAAO;AACR;AACA,SAAS,6BAA6B,QAAQ;CAC7C,IAAI,YAAY;CAChB,KAAK,MAAM,SAAS,QAAQ;EAC3B,MAAM,EAAE,aAAa,kBAAkB,KAAK;EAC5C,YAAY,KAAK,IAAI,WAAW,uBAAuB,QAAQ,CAAC;CACjE;CACA,OAAO;AACR;AACA,SAAS,sCAAsC,OAAO;CACrD,MAAM,WAAW,MAAM,eAAe;CACtC,MAAM,WAAW,wBAAwB,MAAM,OAAO,EAAE,GAAG,WAAW,EAAE,cAAc,MAAM,iBAAiB,IAAI,CAAC,EAAE,CAAC;CACrH,MAAM,cAAc,0CAA0C,MAAM,UAAU;CAC9E,MAAM,wBAAwB,MAAM,wBAAwB,KAAK,IAAI,cAAc,8BAA8B,aAAa,MAAM,mBAAmB;CACvJ,OAAO,4BAA4B;EAClC,MAAM,UAAU,UAAU,CAAC,GAAG,6BAA6B,qBAAqB,CAAC;EACjF;EACA,UAAU,MAAM;EAChB,WAAW,MAAM;EACjB,cAAc,MAAM;EACpB,YAAY;EACZ;EACA,YAAY,MAAM,cAAc,+BAA+B,MAAM,UAAU;EAC/E,GAAG,MAAM,WAAW,KAAK,IAAI,EAAE,QAAQ,MAAM,OAAO,IAAI,CAAC;EACzD,GAAG,MAAM,WAAW,KAAK,IAAI,EAAE,QAAQ,MAAM,OAAO,IAAI,CAAC;EACzD,GAAG,MAAM,iCAAiC,KAAK,IAAI,EAAE,mBAAmB,MAAM,6BAA6B,IAAI,CAAC;EAChH,GAAG,MAAM,0BAA0B,KAAK,IAAI,EAAE,uBAAuB,MAAM,sBAAsB,IAAI,CAAC;CACvG,CAAC;AACF;AACA,SAAS,8BAA8B,OAAO;CAC7C,OAAO,sCAAsC,KAAK;AACnD;AACA,SAAS,8BAA8B,YAAY,QAAQ;CAC1D,IAAI,WAAW,WAAW,GAAG,OAAO;CACpC,OAAO,WAAW,MAAM,IAAI,CAAC,CAAC,KAAK,SAAS,KAAK,WAAW,IAAI,OAAO,GAAG,SAAS,MAAM,CAAC,CAAC,KAAK,IAAI;AACrG;AAGA,MAAM,iCAAiC;CACtC,OAAO,SAAS;CAChB,UAAU,SAAS;CACnB,aAAa,SAAS;CACtB,WAAW,SAAS;CACpB,QAAQ,SAAS;CACjB,OAAO,SAAS;CAChB,aAAa,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE;CACxC,OAAO,UAAU,IAAI,MAAM,KAAK,IAAI,EAAE;CACtC,eAAe,SAAS;CACxB,UAAU,SAAS;CACnB,aAAa,SAAS;AACvB;AACA,SAAS,cAAc,MAAM;CAC5B,OAAO,QAAA;AACR;AACA,SAAS,8BAA8B,SAAS;CAC/C,MAAM,wBAAwB,IAAI,IAAI;CACtC,MAAM,+BAA+B,IAAI,IAAI;CAC7C,MAAM,+BAA+B,IAAI,IAAI;CAC7C,MAAM,kCAAkC,IAAI,IAAI;CAChD,KAAK,MAAM,SAAS,SAAS;EAC5B,MAAM,OAAO,cAAc,MAAM,YAAY;EAC7C,MAAM,OAAO;GACZ;GACA,IAAI,MAAM;GACV,eAAe,MAAM;GACrB,SAAS,MAAM;GACf,WAAW,MAAM;GACjB,YAAY,MAAM;EACnB;EACA,MAAM,IAAI,IAAI;EACd,MAAM,IAAI,MAAM,UAAU;EAC1B,MAAM,UAAU,aAAa,IAAI,IAAI;EACrC,IAAI,SAAS,QAAQ,KAAK,IAAI;OACzB,aAAa,IAAI,MAAM,CAAC,IAAI,CAAC;EAClC,MAAM,UAAU,aAAa,IAAI,MAAM,UAAU;EACjD,IAAI,SAAS,QAAQ,KAAK,IAAI;OACzB,aAAa,IAAI,MAAM,YAAY,CAAC,IAAI,CAAC;EAC9C,gBAAgB,IAAI,MAAM,MAAM,IAAI;CACrC;CACA,OAAO;EACN;EACA;EACA;EACA;CACD;AACD;AACA,SAAS,0CAA0C,SAAS;CAC3D,MAAM,8BAA8B,IAAI,IAAI;CAC5C,KAAK,MAAM,SAAS,SAAS,YAAY,IAAI,MAAM,MAAM;EACxD,gBAAgB,MAAM;EACtB,YAAY,MAAM;CACnB,CAAC;CACD,OAAO;AACR;AACA,SAAS,+BAA+B,SAAS;CAChD,MAAM,6BAA6B,IAAI,IAAI;CAC3C,KAAK,MAAM,SAAS,SAAS,IAAI,MAAM,KAAK,SAAS,GAAG,WAAW,IAAI,MAAM,YAAY,MAAM,IAAI;CACnG,OAAO;AACR;AACA,SAAS,qBAAqB,SAAS,OAAO;CAC7C,OAAO,MAAM,WAAW,yCAAyC,QAAQ,MAAM;AAChF;AACA,SAAS,qBAAqB,SAAS,YAAY,YAAY,WAAW,OAAO,UAAU,kBAAkB,eAAe,YAAY,8BAA8B,uBAAuB;CAC5L,IAAI,WAAW,WAAW,GAAG;EAC5B,MAAM,YAAY,qBAAqB,SAAS,KAAK;EACrD,IAAI,CAAC,YAAY,OAAO,CAAC,SAAS;EAClC,OAAO,CAAC,MAAM,aAAa,GAAG,QAAQ,EAAE,GAAG,KAAK,WAAW;CAC5D;CACA,MAAM,QAAQ,cAAc,OAAO,KAAK,8BAA8B,UAAU;CAChF,MAAM,aAAa,eAAe,KAAK,IAAI,KAAK,IAAI,YAAY;CAChE,MAAM,aAAa,8BAA8B;EAChD;EACA;EACA;EACA;EACA;EACA,YAAY,+BAA+B,UAAU;EACrD,QAAQ;EACR,GAAG,eAAe,KAAK,IAAI,EAAE,WAAW,IAAI,CAAC;EAC7C,GAAG,iCAAiC,KAAK,IAAI,EAAE,6BAA6B,IAAI,CAAC;EACjF,GAAG,0BAA0B,KAAK,IAAI,EAAE,sBAAsB,IAAI,CAAC;CACpE,CAAC;CACD,IAAI,CAAC,YAAY,OAAO,WAAW,WAAW,IAAI,CAAC,IAAI,CAAC,UAAU;CAClE,MAAM,WAAW,8BAA8B,YAAY,IAAI;CAC/D,OAAO,CAAC,MAAM,aAAa,GAAG,QAAQ,EAAE,GAAG,QAAQ;AACpD;;;;;;;;;AASA,SAAS,6BAA6B,QAAQ,OAAO,YAAY,WAAW,UAAU,CAAC,GAAG;CACzF,MAAM,aAAa,OAAO,OAAO,SAAS;CAC1C,MAAM,WAAW,QAAQ,YAAY;CACrC,MAAM,mBAAmB,QAAQ,oBAAA;CACjC,MAAM,gBAAgB,QAAQ,wBAAwB,KAAK;CAC3D,MAAM,aAAa,QAAQ;CAC3B,MAAM,qBAAqB,aAAa,OAAO,OAAO,QAAQ,UAAU,MAAM,WAAW,SAAS,CAAC,CAAC,CAAC,KAAK,WAAW;EACpH,OAAO,cAAc,MAAM,KAAK,KAAK,8BAA8B,MAAM,UAAU;EACnF;CACD,EAAE,IAAI,CAAC;CACP,MAAM,+BAA+B,mBAAmB,SAAS,IAAI,oCAAoC,kBAAkB,IAAI,KAAK;CACpI,MAAM,wBAAwB,mBAAmB,SAAS,IAAI,6BAA6B,kBAAkB,IAAI,KAAK;CACtH,MAAM,QAAQ,CAAC;CACf,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,OAAO,QAAQ,SAAS;EAC1D,MAAM,QAAQ,OAAO,OAAO;EAC5B,IAAI,QAAQ,GAAG,MAAM,KAAK,EAAE;EAC5B,MAAM,KAAK,GAAG,qBAAqB,MAAM,OAAO,MAAM,YAAY,YAAY,WAAW,OAAO,UAAU,kBAAkB,eAAe,YAAY,8BAA8B,qBAAqB,CAAC;CAC5M;CACA,IAAI,OAAO,OAAO,QAAQ,OAAO,UAAU,QAAQ,MAAM,WAAW,QAAQ,CAAC,IAAI,GAAG;EACnF,MAAM,KAAK,EAAE;EACb,MAAM,KAAK,MAAM,QAAQ,OAAO,OAAO,CAAC;CACzC;CACA,OAAO,MAAM,KAAK,IAAI;AACvB;AAGA,SAAS,oBAAoB,QAAQ;CACpC,OAAO,aAAa,UAAU,OAAO,OAAO,YAAY;AACzD;AACA,SAAS,gBAAgB,MAAM;CAC9B,OAAO,SAAS,aAAa,KAAK,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI;AAC5D;AACA,SAAS,aAAa,OAAO;CAC5B,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,KAAK,GAAG;AAChD;AACA,SAAS,2BAA2B,QAAQ,SAAS,MAAM;CAC1D,MAAM,QAAQ,CAAC;CACf,IAAI,QAAQ,SAAS,GAAG,MAAM,KAAK,oBAAoB,MAAM,IAAI,OAAO,QAAQ,OAAO,IAAI,aAAa,OAAO,CAAC;CAChH,IAAI,KAAK,SAAS,GAAG,MAAM,KAAK,OAAO,KAAK,IAAI,CAAC;CACjD,OAAO,MAAM,KAAK,GAAG;AACtB;;;;;;;AAOA,MAAM,uBAAuB;AAC7B,SAAS,aAAa,MAAM;CAC3B,OAAO,MAAM,IAAI;AAClB;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAS,8BAA8B,MAAM;CAC5C,IAAI,CAAC,KAAK,UAAU,OAAO;EAC1B,GAAG;EACH,SAAS;CACV;CACA,OAAO;EACN,OAAO,SAAS;EAChB,UAAU,SAAS,KAAK,IAAI;EAC5B,aAAa,SAAS,IAAI,KAAK,IAAI,CAAC;EACpC,WAAW,SAAS,WAAW,IAAI;EACnC,QAAQ,SAAS,IAAI,IAAI;EACzB,OAAO,SAAS,IAAI,IAAI;EACxB,aAAa,QAAQ,OAAO,IAAI,IAAI,KAAK,IAAI,EAAE,EAAE;EACjD,UAAU,UAAU;GACnB,MAAM,QAAQ,MAAM,GAAG;GACvB,OAAO,MAAM,KAAK,SAAS,QAAQ,gBAAgB,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;EACnE;EACA,OAAO,UAAU;GAChB,MAAM,OAAO,MAAM,GAAG;GACtB,MAAM,QAAQ,MAAM,GAAG;GACvB,MAAM,YAAY,MAAM,IAAI;GAC5B,OAAO,OAAO,MAAM,IAAI,YAAY,CAAC,CAAC,KAAK,SAAS,IAAI;EACzD;EACA,eAAe,SAAS,KAAK,IAAI;EACjC,UAAU,SAAS,IAAI,IAAI;EAC3B,aAAa,SAAS,IAAI,IAAI;CAC/B;AACD;;;;;;;;;;;;;;;;;;;;AAsBA,MAAM,iBAAiB;;;;;;AAMvB,MAAM,EAAE,KAAK,cAAc,aAAa,EAAE,UAAU,KAAK,CAAC;AAC1D,MAAM,EAAE,aAAa,gBAAgB,aAAa,EAAE,UAAU,KAAK,CAAC;;;;;;;;;;AAUpE,MAAM,wBAAwB;CAC7B,SAAS,QAAQ,cAAc;EAC9B,MAAM,WAAW,eAAe,SAAS;EACzC,QAAQ,SAAS;EACjB,UAAU,SAAS,KAAK,IAAI;EAC5B,cAAc,KAAK;CACpB;CACA,UAAU,cAAc;EACvB,MAAM,WAAW,aAAa,SAAS;EACvC,OAAO,WAAW,aAAa,SAAS;EACxC,SAAS,WAAW,aAAa,SAAS;EAC1C,cAAc,WAAW,YAAY,KAAK;CAC3C;AACD;AACA,SAAS,eAAe,MAAM,YAAY,aAAa;CACtD,IAAI,SAAA,SAA8B,OAAO;CACzC,OAAO,KAAK,MAAM,GAAG,UAAU;AAChC;AACA,SAAS,wBAAwB,cAAc,MAAM;CACpD,MAAM,UAAU,CAAC;CACjB,MAAM,OAAO,CAAC;CACd,MAAM,WAAW,KAAK,YAAY,IAAI,YAAY;CAClD,IAAI,UAAU,KAAK,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;CAC3E,IAAI,KAAK,eAAe,SAAS,KAAK,iBAAiB,gBAAgB,iBAAA,SAAsC,QAAQ,KAAK,oBAAoB;CAC9I,IAAI,KAAK,WAAW,cAAc,QAAQ,KAAK,cAAc;CAC7D,QAAQ,MAAM,GAAG,MAAM;EACtB,IAAI,MAAM,YAAY,OAAO;EAC7B,IAAI,MAAM,YAAY,OAAO;EAC7B,OAAO,EAAE,cAAc,CAAC;CACzB,CAAC;CACD,OAAO;EACN;EACA;CACD;AACD;AACA,SAAS,kBAAkB,MAAM;CAChC,MAAM,OAAO,KAAK,UAAU,8BAA8B,EAAE,UAAU,KAAK,SAAS,CAAC;CACrF,MAAM,gBAAgB,KAAK;CAC3B,IAAI,CAAC,KAAK,YAAY,kBAAkB,KAAK,GAAG,OAAO;CACvD,OAAO;EACN,GAAG;EACH,OAAO,UAAU;GAChB,MAAM,cAAc,MAAM,KAAK,SAAS,SAAS,gBAAgB,KAAK,IAAI,IAAI,IAAI;GAClF,OAAO,KAAK,KAAK,WAAW;EAC7B;CACD;AACD;AACA,SAAS,oBAAoB,MAAM;CAClC,OAAO,SAAS,UAAU;EACzB,SAAS;EACT,SAAS;CACV,IAAI;EACH,SAAS;EACT,SAAS;CACV;AACD;AACA,SAAS,2BAA2B,eAAe,MAAM,OAAO;CAC/D,MAAM,aAAa,KAAK,uBAAuB,IAAI,aAAa;CAChE,IAAI,eAAe,KAAK,GAAG,OAAO;CAClC,MAAM,YAAY,WAAW,kBAAkB;CAC/C,MAAM,WAAW,CAAC;CAClB,IAAI,WAAW,mBAAmB,KAAK,GAAG,SAAS,KAAK,GAAG,WAAW,eAAe,KAAK;CAC1F,IAAI,WAAW,eAAe,KAAK,KAAK,WAAW,WAAW,SAAS,GAAG,SAAS,KAAK,MAAM,WAAW,WAAW,UAAU,CAAC;CAC/H,MAAM,SAAS,WAAW;CAC1B,IAAI,WAAW,KAAK,GAAG;EACtB,MAAM,SAAS,oBAAoB,KAAK,aAAa,SAAS;EAC9D,MAAM,QAAQ,WAAW,YAAY,OAAO,UAAU,OAAO;EAC7D,MAAM,QAAQ,WAAW,YAAY,YAAY;EACjD,IAAI,CAAC,KAAK,UAAU,SAAS,KAAK,GAAG,MAAM,GAAG,OAAO;OAChD;GACJ,MAAM,SAAS,WAAW,YAAY,QAAQ;GAC9C,SAAS,KAAK,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC;EAC1C;CACD;CACA,IAAI,WAAW,kBAAkB,WAAW;EAC3C,MAAM,QAAQ,KAAK,cAAc,UAAU,MAAM;EACjD,SAAS,KAAK,GAAG,MAAM,UAAU;CAClC;CACA,IAAI,SAAS,WAAW,GAAG,OAAO;CAClC,MAAM,SAAS,KAAK,SAAS,KAAK,IAAI;CACtC,OAAO,KAAK,YAAY,YAAY,UAAU,MAAM,IAAI;AACzD;;;;;;;AAOA,SAAS,qBAAqB,MAAM,OAAO,YAAY,WAAW,cAAc;CAC/E,MAAM,cAAc,yBAAyB,SAAS;CACtD,MAAM,eAAe,0BAA0B,SAAS;CACxD,MAAM,MAAM,gBAAgB,MAAM;CAClC,MAAM,MAAM,gBAAgB,MAAM;CAClC,MAAM,QAAQ,gBAAgB,MAAM;CACpC,IAAI,KAAK,SAAS,QAAQ;EACzB,MAAM,OAAO,eAAe,KAAK,MAAM,YAAY,WAAW;EAC9D,OAAO,GAAG,kBAAkB,IAAI,IAAI,GAAG,UAAU,EAAE,GAAG,MAAM,YAAY,EAAE,GAAG,IAAI,IAAI;CACtF;CACA,OAAO,GAAG,KAAK,SAAA,UAA+B,kBAAkB,MAAM,WAAW,GAAG,UAAU,IAAI,kBAAkB,IAAI,eAAe,KAAK,MAAM,YAAY,WAAW,CAAC,GAAG,UAAU,EAAE,GAAG,MAAM,YAAY,EAAE,GAAG,IAAI,eAAe,KAAK,IAAI,YAAY,WAAW,CAAC;AACxQ;;;;;;AAMA,SAAS,gBAAgB,cAAc,MAAM,eAAe;CAC3D,MAAM,QAAQ,kBAAkB,IAAI;CACpC,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,cAAc,yBAAyB,KAAK,aAAa,SAAS;CACxE,MAAM,WAAW,wBAAwB,cAAc,IAAI;CAC3D,MAAM,cAAc,SAAS,QAAQ,SAAS,KAAK,SAAS,KAAK,SAAS;CAC1E,MAAM,UAAU,kBAAkB,cAAc,KAAK;CACrD,MAAM,WAAW,iBAAA,WAAwC,UAAU,YAAY,MAAM,MAAA,CAAO,WAAW,KAAK,UAAU,YAAY,MAAM,WAAA,CAAY,eAAe,cAAc,YAAY,WAAW,CAAC;CACzM,IAAI,CAAC,aAAa,OAAO;CACzB,OAAO,GAAG,SAAS,IAAI,2BAA2B,OAAO,SAAS,SAAS,SAAS,IAAI;AACzF;;;;;;;;;;AAUA,SAAS,qBAAqB,MAAM,cAAc,MAAM,MAAM;CAC7D,MAAM,QAAQ,kBAAkB,IAAI;CACpC,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,YAAY,KAAK,uBAAuB,IAAI,KAAK,aAAa,CAAC,EAAE;CACvE,IAAI;CACJ,IAAI;CACJ,IAAI,cAAc,WAAW;EAC5B,gBAAgB,KAAK,WAAW,eAAe,SAAS;EACxD,eAAe,KAAK;CACrB,OAAO,IAAI,cAAc,YAAY;EACpC,gBAAgB,KAAK,WAAW,YAAY,MAAM;EAClD,eAAe,KAAK,WAAW,YAAY,KAAK;CACjD,OAAO,IAAI,KAAK,YAAY,SAAS,KAAK,GAAG;EAC5C,iBAAiB,SAAS,cAAc,IAAI,CAAC,CAAC,IAAI;EAClD,eAAe,KAAK;CACrB,OAAO;EACN,gBAAgB,MAAM;EACtB,eAAe,KAAK;CACrB;CACA,MAAM,iBAAiB,IAAI,OAAO,KAAK,IAAI,GAAG,eAAe,KAAK,QAAQ,MAAM,CAAC;CACjF,OAAO,GAAG,GAAG,cAAc,KAAK,OAAO,IAAI,mBAAmB,qBAAqB,MAAM,OAAO,YAAY,WAAW,YAAY,IAAI,2BAA2B,KAAK,eAAe,MAAM,KAAK;AAClM;;;;;;AAMA,SAAS,yBAAyB,SAAS,MAAM,IAAI,cAAc,UAAU,WAAW;CACvF,MAAM,QAAQ,8BAA8B,EAAE,UAAU,SAAS,CAAC;CAClE,MAAM,gBAAgB,GAAG,sBAAsB,OAAO,OAAO,QAAQ,CAAC,CAAC,QAAQ,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,GAAG,eAAe,QAAQ,MAAM,CAAC;CAC/I,MAAM,aAAa;CACnB,MAAM,cAAc,yBAAyB,SAAS;CACtD,MAAM,eAAe,0BAA0B,SAAS;CACxD,MAAM,WAAW,SAAA,UAA+B,kBAAkB,MAAM,MAAM,WAAW,GAAG,UAAU,IAAI,kBAAkB,MAAM,WAAW,eAAe,MAAM,YAAY,WAAW,CAAC,GAAG,UAAU;CACvM,MAAM,SAAS,OAAA,UAA6B,MAAM,MAAM,WAAW,IAAI,MAAM,SAAS,eAAe,IAAI,YAAY,WAAW,CAAC;CACjI,OAAO,GAAG,cAAc,IAAI,SAAS,GAAG,MAAM,MAAM,YAAY,EAAE,GAAG;AACtE;AACA,SAAS,aAAa,MAAM;CAC3B,OAAO,SAAS,UAAU;EACzB,MAAM;EACN,SAAS;EACT,UAAU;EACV,MAAM;CACP,IAAI;EACH,MAAM;EACN,SAAS;EACT,UAAU;EACV,MAAM;CACP;AACD;AACA,SAAS,2BAA2B,UAAU;CAC7C,IAAI,CAAC,UAAU,OAAO;CACtB,MAAM,QAAQ,MAAM,GAAG;CACvB,OAAO,GAAG,QAAQ,KAAK,MAAM,UAAU,CAAC,EAAE,GAAG,QAAQ,MAAM,IAAI;AAChE;;;;;;AAMA,SAAS,2BAA2B,MAAM;CACzC,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,QAAQ,8BAA8B,EAAE,UAAU,KAAK,SAAS,CAAC;CACvE,MAAM,SAAS,aAAa,SAAS;CACrC,MAAM,cAAc,yBAAyB,SAAS;CACtD,MAAM,eAAe,0BAA0B,SAAS;CACxD,MAAM,cAAc,GAAG,MAAM,WAAW,QAAQ,EAAE,GAAG,MAAM,MAAM,YAAY,EAAE,GAAG,MAAM,SAAS,QAAQ;CACzG,MAAM,eAAe,oBAAoB,SAAS;CAClD,MAAM,iBAAiB,KAAK,WAAW,KAAK,MAAM,aAAa,OAAO,EAAE,GAAG,MAAM,QAAQ,SAAS,EAAE,KAAK,OAAO,aAAa,OAAO,EAAE,GAAG,MAAM,QAAQ,SAAS,MAAM,KAAK,aAAa,QAAQ,GAAG,MAAM,QAAQ,SAAS,EAAE,KAAK,aAAa,QAAQ,GAAG,MAAM,QAAQ,SAAS;CAChR,MAAM,iBAAiB,2BAA2B,KAAK,QAAQ;CAC/D,MAAM,cAAc,KAAK,WAAW,MAAM,KAAK,CAAC,QAAQ,SAAS,CAAC,IAAI;CACtE,OAAO;EACN;EACA,KAAK,MAAM,KAAK,OAAO,IAAI,EAAE,GAAG,MAAM,QAAQ,UAAU,EAAE,KAAK,MAAM,KAAK,OAAO,OAAO,EAAE,GAAG,MAAM,QAAQ,SAAS,EAAE,KAAK,MAAM,KAAK,OAAO,QAAQ,EAAE,GAAG,MAAM,QAAQ,UAAU;EAClL,KAAK,MAAM,KAAK,OAAO,IAAI,EAAE,GAAG,MAAM,QAAQ,iCAAiC;EAC/E;EACA,KAAK,MAAM,KAAK,WAAW,EAAE,GAAG,MAAM,QAAQ,2BAA2B;EACzE,KAAK,eAAe,GAAG,MAAM,QAAQ,wDAAwD;EAC7F,KAAK,YAAY,GAAG,MAAM,QAAQ,mBAAmB;EACrD,KAAK,YAAY,KAAK,MAAM,QAAQ,0CAA0C;CAC/E,CAAC,CAAC,KAAK,IAAI;AACZ;;;;;;;;;;AAYA,MAAM,YAAY;AAClB,MAAM,uBAAuB;;;;;;;;;;;;;;;;AAgB7B,SAAS,YAAY,KAAK,aAAa;CACtC,KAAK,MAAM,QAAQ,KAAK,IAAI,KAAK,SAAS,KAAK,GAAG,OAAO;EACxD,MAAM;EACN,cAAc,KAAK,KAAK;CACzB;CACA,KAAK,MAAM,QAAQ,KAAK;EACvB,MAAM,QAAQ,UAAU,IAAI;EAC5B,IAAI,UAAU,KAAK,GAAG;EACtB,MAAM,aAAa,YAAY,IAAI,MAAM,KAAK,aAAa,KAAK,CAAC;EACjE,MAAM,OAAO,WAAW,MAAM,MAAM,EAAE,YAAY,MAAM,KAAK,OAAO,KAAK,WAAW;EACpF,IAAI,SAAS,KAAK,GAAG,OAAO;GAC3B,MAAM;GACN;GACA,MAAM,MAAM,KAAK;EAClB;CACD;CACA,OAAO,EAAE,MAAM,OAAO;AACvB;;;;;;AAMA,SAAS,UAAU,MAAM;CACxB,KAAK,MAAM,QAAQ,KAAK,OAAO;EAC9B,IAAI,KAAK,aAAa,MAAM,OAAO;EACnC,IAAI,KAAK,iBAAiB,MAAM;EAChC,MAAM,OAAO,KAAK;EAClB,IAAI,KAAK,SAAS,GAAG;EACrB,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,MAAM,GAAG,OAAO;CAChD;AACD;;;;;;AAMA,SAAS,sBAAsB,UAAU,uBAAuB;CAC/D,MAAM,yBAAyB,IAAI,IAAI;CACvC,IAAI,0BAA0B,KAAK,GAAG,OAAO;CAC7C,KAAK,MAAM,QAAQ,SAAS,OAAO;EAClC,MAAM,YAAY,sBAAsB,IAAI,KAAK,aAAa,CAAC,EAAE;EACjE,IAAI,cAAc,KAAK,GAAG;EAC1B,KAAK,MAAM,QAAQ,CAAC,KAAK,MAAM,KAAK,EAAE,GAAG;GACxC,IAAI,SAAA,SAA8B;GAClC,IAAI,OAAO,IAAI,IAAI,MAAM,WAAW,OAAO,IAAI,MAAM,SAAS;EAC/D;CACD;CACA,OAAO;AACR;AACA,SAAS,iBAAiB,OAAO;CAChC,IAAI,MAAM;CACV,KAAK,MAAM,QAAQ,OAAO,MAAM,KAAK,IAAI,KAAK,KAAK,QAAQ,MAAM;CACjE,OAAO;AACR;;;;;;;AAOA,SAAS,mBAAmB,MAAM,WAAW;CAC5C,IAAI,YAAY;CAChB,KAAK,MAAM,OAAO,MAAM;EACvB,MAAM,SAAS,cAAc,KAAK;GACjC,UAAU;GACV;EACD,CAAC;EACD,YAAY,KAAK,IAAI,WAAW,YAAY,MAAM,CAAC;CACpD;CACA,OAAO,YAAY;AACpB;AACA,SAAS,uBAAuB,UAAU;CACzC,OAAO,iBAAiB,SAAS,KAAK;AACvC;AACA,SAAS,WAAW,MAAM,aAAa;CACtC,MAAM,UAAU,KAAK,IAAI,GAAG,cAAc,YAAY,IAAI,CAAC;CAC3D,OAAO,OAAO,IAAI,OAAO,OAAO;AACjC;AACA,MAAM,cAAc;AACpB,SAAS,uBAAuB,MAAM;CACrC,MAAM,2BAA2B,IAAI,OAAO,cAAc,YAAY,gBAAgB;CACtF,OAAO,KAAK,QAAQ,0BAA0B,IAAI,CAAC,CAAC,QAAQ,QAAQ,EAAE;AACvE;AACA,SAAS,4BAA4B,OAAO;CAC3C,MAAM,EAAE,MAAM,aAAa;CAC3B,MAAM,YAAY,MAAM;CACxB,MAAM,8BAA8B,IAAI,IAAI;CAC5C,KAAK,MAAM,QAAQ,SAAS,OAAO;EAClC,MAAM,SAAS,YAAY,IAAI,KAAK,aAAa;EACjD,IAAI,QAAQ,OAAO,KAAK,IAAI;OACvB,YAAY,IAAI,KAAK,eAAe,CAAC,IAAI,CAAC;CAChD;CACA,MAAM,YAAY;EACjB,UAAU,MAAM;EAChB;EACA,GAAG,UAAU,cAAc,MAAM,UAAU;EAC3C,GAAG,UAAU,yBAAyB,MAAM,qBAAqB;EACjE,GAAG,UAAU,UAAU,MAAM,MAAM;EACnC,GAAG,UAAU,gBAAgB,MAAM,YAAY;EAC/C,GAAG,UAAU,cAAc,MAAM,UAAU;EAC3C,GAAG,UAAU,iBAAiB,MAAM,aAAa;EACjD,GAAG,UAAU,UAAU,MAAM,MAAM;CACpC;CACA,MAAM,iBAAiB,sBAAsB,UAAU,MAAM,qBAAqB;CAClF,MAAM,cAAc,MAAM,qBAAqB,mBAAmB,MAAM,SAAS;CACjF,MAAM,gBAAgB,MAAM,yBAAyB,iBAAiB,SAAS,KAAK;CACpF,MAAM,eAAe,KAAK,IAAI,gBAAgB,WAAW,uBAAuB,WAAW;CAC3F,MAAM,QAAQ,CAAC;CACf,KAAK,MAAM,OAAO,MAAM;EACvB,MAAM,SAAS,cAAc,KAAK;GACjC,UAAU,MAAM;GAChB;EACD,CAAC;EACD,MAAM,WAAW,YAAY,KAAK,WAAW;EAC7C,IAAI,SAAS,SAAS,QAAQ;GAC7B,MAAM,KAAK,uBAAuB,MAAM,CAAC;GACzC;EACD;EACA,MAAM,YAAY,WAAW,QAAQ,WAAW;EAChD,IAAI,SAAS,SAAS,QAAQ;GAC7B,MAAM,QAAQ,gBAAgB,SAAS,cAAc,WAAW,eAAe,IAAI,SAAS,YAAY,CAAC;GACzG,MAAM,KAAK,uBAAuB,MAAM,WAAW,IAAI,SAAS,GAAG,YAAY,OAAO,CAAC;GACvF;EACD;EACA,MAAM,QAAQ,qBAAqB,SAAS,MAAM,cAAc,WAAW,SAAS,IAAI;EACxF,MAAM,KAAK,uBAAuB,GAAG,YAAY,OAAO,CAAC;CAC1D;CACA,OAAO,MAAM,KAAK,IAAI;AACvB"}

package/dist/migration-graph-tarTxJ99-BrGBANeE.d.mts

@@ -0,0 +1,124 @@
+import { n as MigrationGraph, t as MigrationEdge } from "./graph-bDjJ4GL9-BhFevsJS.mjs";
+import { n as OnDiskMigrationPackage } from "./package-CfWiDNrr-ZR4HM_Iz.mjs";
+//#region ../../../1-framework/3-tooling/migration/dist/migration-graph-tarTxJ99.d.mts
+//#region src/migration-graph.d.ts
+declare function reconstructGraph(packages: readonly OnDiskMigrationPackage[]): MigrationGraph;
+/**
+ * Find the shortest path from `fromHash` to `toHash` using BFS over the
+ * contract-hash graph. Returns the ordered list of edges, or null if no path
+ * exists. Returns an empty array when `fromHash === toHash` (no-op).
+ *
+ * Neighbor ordering is deterministic via the tie-break sort key:
+ * createdAt → to → migrationHash.
+ */
+declare function findPath(graph: MigrationGraph, fromHash: string, toHash: string): readonly MigrationEdge[] | null;
+/**
+ * Find the shortest path from `fromHash` to `toHash` whose edges collectively
+ * cover every invariant in `required`. Returns `null` when no such path exists
+ * (either `fromHash`→`toHash` is structurally unreachable, or every reachable
+ * path leaves at least one required invariant uncovered). When `required` is
+ * empty, delegates to `findPath` so the result is byte-identical for that case.
+ *
+ * Algorithm: BFS over `(node, coveredSubset)` states with state-level dedup.
+ * The covered subset is a `Set<string>` of invariant ids; the state's dedup
+ * key is `${node}\0${[...covered].sort().join('\0')}`. State keys distinguish
+ * distinct `(node, covered)` tuples regardless of node-name length because
+ * `\0` cannot appear in any invariant id (validation rejects whitespace and
+ * control chars at authoring time).
+ *
+ * Neighbour ordering when `required ≠ ∅`: edges covering ≥1 still-needed
+ * invariant come first, with `createdAt → to → migrationHash` as the
+ * secondary key. The heuristic steers BFS toward the satisfying path;
+ * correctness (shortest, deterministic) does not depend on it.
+ */
+declare function findPathWithInvariants(graph: MigrationGraph, fromHash: string, toHash: string, required: ReadonlySet<string>): readonly MigrationEdge[] | null;
+interface PathDecision {
+  readonly selectedPath: readonly MigrationEdge[];
+  readonly fromHash: string;
+  readonly toHash: string;
+  readonly alternativeCount: number;
+  readonly tieBreakReasons: readonly string[];
+  readonly refName?: string;
+  /** The caller-supplied required invariant set, sorted ascending. */
+  readonly requiredInvariants: readonly string[];
+  /**
+   * The subset of `requiredInvariants` actually covered by edges on
+   * `selectedPath`. Always a subset of `requiredInvariants` (when the path
+   * is satisfying, equal to it); always derived from `selectedPath`.
+   */
+  readonly satisfiedInvariants: readonly string[];
+}
+/**
+ * Outcome of {@link findPathWithDecision}. The pathfinder distinguishes
+ * three cases up front so callers don't re-derive structural reachability:
+ *
+ * - `ok` — a path covering `required` exists; `decision` carries the
+ *   selection metadata and per-edge invariants.
+ * - `unreachable` — `from`→`to` has no structural path. Mapped by callers
+ *   to the existing no-path / `NO_TARGET` diagnostic.
+ * - `unsatisfiable` — `from`→`to` is structurally reachable but no path
+ *   covers every required invariant. `structuralPath` is the
+ *   `findPath(graph, from, to)` result, included so callers don't have to
+ *   recompute it when raising `MIGRATION.NO_INVARIANT_PATH`. `missing` is
+ *   the subset of `required` that the structural path does *not* cover —
+ *   correctly accounts for partial coverage when some required invariants
+ *   are met by the fallback path. Only emitted when `required` is
+ *   non-empty.
+ */
+type FindPathOutcome = {
+  readonly kind: 'ok';
+  readonly decision: PathDecision;
+} | {
+  readonly kind: 'unreachable';
+} | {
+  readonly kind: 'unsatisfiable';
+  readonly structuralPath: readonly MigrationEdge[];
+  readonly missing: readonly string[];
+};
+/**
+ * Routing context for {@link findPathWithDecision}. Both fields are optional;
+ * `refName` is only used to decorate the resulting `PathDecision` for the
+ * JSON envelope, and `required` defaults to an empty set (purely structural
+ * routing). They are passed via a single options object so the call sites
+ * cannot silently swap two adjacent string parameters.
+ */
+interface FindPathWithDecisionOptions {
+  readonly refName?: string;
+  readonly required?: ReadonlySet<string>;
+}
+/**
+ * Find the shortest path from `fromHash` to `toHash` and return structured
+ * path-decision metadata for machine-readable output. When `required` is
+ * non-empty, the returned path is the shortest one whose edges collectively
+ * cover every required invariant.
+ *
+ * The discriminated return type tells the caller *why* a path could not be
+ * found, so the CLI can pick the right structured error without re-running
+ * a structural BFS.
+ */
+declare function findPathWithDecision(graph: MigrationGraph, fromHash: string, toHash: string, options?: FindPathWithDecisionOptions): FindPathOutcome;
+/**
+ * Find all branch tips (nodes with no outgoing edges) reachable from
+ * `fromHash` via forward edges.
+ */
+declare function findReachableLeaves(graph: MigrationGraph, fromHash: string): readonly string[];
+/**
+ * Find the target contract hash of the migration graph reachable from
+ * EMPTY_CONTRACT_HASH. Returns `null` for a graph that has no target
+ * state (either empty, or containing only the root with no outgoing
+ * edges). Throws NO_INITIAL_MIGRATION if the graph has nodes but none
+ * originate from the empty hash, and AMBIGUOUS_TARGET if multiple
+ * branch tips exist.
+ */
+declare function findLeaf(graph: MigrationGraph): string | null;
+/**
+ * Find the latest migration entry by traversing from EMPTY_CONTRACT_HASH
+ * to the single target. Returns null for an empty graph.
+ * Throws AMBIGUOUS_TARGET if the graph has multiple branch tips.
+ */
+declare function findLatestMigration(graph: MigrationGraph): MigrationEdge | null;
+declare function detectCycles(graph: MigrationGraph): readonly string[][];
+declare function detectOrphans(graph: MigrationGraph): readonly MigrationEdge[];
+//#endregion
+export { findLeaf as a, findPathWithInvariants as c, findLatestMigration as i, findReachableLeaves as l, detectCycles as n, findPath as o, detectOrphans as r, findPathWithDecision as s, PathDecision as t, reconstructGraph as u };
+//# sourceMappingURL=migration-graph-tarTxJ99-BrGBANeE.d.mts.map

package/dist/migration-graph-tarTxJ99-BrGBANeE.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"migration-graph-tarTxJ99-BrGBANeE.d.mts","names":[],"sources":["../../../../1-framework/3-tooling/migration/dist/migration-graph-tarTxJ99.d.mts"],"mappings":";;;;iBAGiB,iBAAiB,mBAAmB,2BAA2B;;;;;;;;;iBAS/D,SAAS,OAAO,gBAAgB,kBAAkB,0BAA0B;;;;;;;;;;;;;;;;;;;;iBAoB5E,uBAAuB,OAAO,gBAAgB,kBAAkB,gBAAgB,UAAU,+BAA+B;UAChI;WACC,uBAAuB;WACvB;WACA;WACA;WACA;WACA;;WAEA;;;;;;WAMA;;;;;;;;;;;;;;;;;;;KAmBN;WACM;WACA,UAAU;;WAEV;;WAEA;WACA,yBAAyB;WACzB;;;;;;;;;UASD;WACC;WACA,WAAW;;;;;;;;;;;;iBAYL,qBAAqB,OAAO,gBAAgB,kBAAkB,gBAAgB,UAAU,8BAA8B;;;;;iBAKtH,oBAAoB,OAAO,gBAAgB;;;;;;;;;iBAS3C,SAAS,OAAO;;;;;;iBAMhB,oBAAoB,OAAO,iBAAiB;iBAC5C,aAAa,OAAO;iBACpB,cAAc,OAAO,0BAA0B"}