prisma-next 0.12.0-dev.2 → 0.12.0-dev.21

package/dist/migration-graph-D7DVUElV.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"migration-graph-D7DVUElV.mjs","names":[],"sources":["../src/utils/formatters/migration-graph-layout.ts","../src/utils/formatters/migration-graph-rows.ts","../src/utils/formatters/migration-graph-tree-render.ts","../src/commands/migration-graph.ts"],"sourcesContent":["import { EMPTY_CONTRACT_HASH } from '@prisma-next/migration-tools/constants';\nimport type { ClassifiedEdge, MigrationGraphRowModel } from './migration-graph-rows';\nimport type { MigrationEdgeKind } from './migration-list-graph-topology';\n\nexport type EdgeAdjacency = 'adjacent' | 'node-skipping-forward' | 'node-skipping-rollback';\n\nexport type StructuralCell =\n  | { readonly kind: 'empty' }\n  | {\n      readonly kind: 'node';\n      readonly contractHash: string;\n      readonly arcTee?: boolean;\n      readonly arcLand?: boolean;\n    }\n  | { readonly kind: 'vertical-pass' }\n  | { readonly kind: 'horizontal-pass' }\n  | { readonly kind: 'branch-tee' }\n  | { readonly kind: 'branch-corner' }\n  | { readonly kind: 'merge-tee' }\n  | { readonly kind: 'merge-corner' }\n  | { readonly kind: 'arc-branch-corner' }\n  | { readonly kind: 'arc-branch-tee' }\n  | { readonly kind: 'arc-land-corner' }\n  | { readonly kind: 'arc-crossing' }\n  | { readonly kind: 'arc-land-bridge' }\n  | {\n      readonly kind: 'edge-lane';\n      readonly migrationHash: string;\n      readonly edgeKind: MigrationEdgeKind;\n      readonly ownsLabel: boolean;\n      readonly adjacency: EdgeAdjacency;\n    };\n\nexport type GridRowKind =\n  | 'node'\n  | 'edge'\n  | 'branch-connector'\n  | 'merge-connector'\n  | 'component-separator';\n\nexport interface MigrationGraphGridRow {\n  readonly kind: GridRowKind;\n  readonly contractHash?: string;\n  readonly edge?: ClassifiedEdge;\n  readonly laneIndex?: number;\n  readonly passThroughLanes?: readonly number[];\n  readonly startLane?: number;\n  readonly endLane?: number;\n  readonly branchCount?: number;\n  readonly convergenceProducer?: boolean;\n  readonly cells: readonly StructuralCell[];\n}\n\nexport interface MigrationGraphGridModel {\n  readonly rows: readonly MigrationGraphGridRow[];\n  readonly nodeColumn: ReadonlyMap<string, number>;\n  readonly edgeColumn: ReadonlyMap<string, number>;\n}\n\n// ---------------------------------------------------------------------------\n// Edge bucketing helpers\n// ---------------------------------------------------------------------------\n\nfunction forwardEdges(edges: readonly ClassifiedEdge[]): ClassifiedEdge[] {\n  return edges.filter((e) => e.kind === 'forward');\n}\n\nfunction buildForwardProducersByTo(\n  edges: readonly ClassifiedEdge[],\n): Map<string, ClassifiedEdge[]> {\n  const byTo = new Map<string, ClassifiedEdge[]>();\n  for (const edge of edges) {\n    if (edge.kind !== 'forward') continue;\n    const bucket = byTo.get(edge.to);\n    if (bucket) bucket.push(edge);\n    else byTo.set(edge.to, [edge]);\n  }\n  return byTo;\n}\n\nfunction buildForwardOutDegree(edges: readonly ClassifiedEdge[]): Map<string, number> {\n  const out = new Map<string, number>();\n  for (const edge of edges) {\n    if (edge.kind !== 'forward' || edge.from === edge.to) continue;\n    out.set(edge.from, (out.get(edge.from) ?? 0) + 1);\n  }\n  return out;\n}\n\nfunction buildForwardInDegree(edges: readonly ClassifiedEdge[]): Map<string, number> {\n  const indeg = new Map<string, number>();\n  for (const edge of forwardEdges(edges)) {\n    if (edge.from === edge.to) continue;\n    indeg.set(edge.to, (indeg.get(edge.to) ?? 0) + 1);\n  }\n  return indeg;\n}\n\n/**\n * Distinct source contracts among a contract's forward producers. A contract is\n * a *convergence* when this count is >= 2. Multiple migrations sharing one\n * source (a multi-edge) count once — they stack in a single lane rather than\n * fanning into a convergence.\n */\nfunction buildDistinctSourceCountByTo(edges: readonly ClassifiedEdge[]): Map<string, number> {\n  const sources = new Map<string, Set<string>>();\n  for (const edge of edges) {\n    if (edge.kind !== 'forward' || edge.from === edge.to) continue;\n    const set = sources.get(edge.to);\n    if (set) set.add(edge.from);\n    else sources.set(edge.to, new Set([edge.from]));\n  }\n  const counts = new Map<string, number>();\n  for (const [to, set] of sources) counts.set(to, set.size);\n  return counts;\n}\n\nfunction splitComponents(nodes: readonly (string | null)[]): readonly (readonly string[])[] {\n  const components: string[][] = [];\n  let current: string[] = [];\n  for (const node of nodes) {\n    if (node === null) {\n      if (current.length > 0) {\n        components.push(current);\n        current = [];\n      }\n      continue;\n    }\n    current.push(node);\n  }\n  if (current.length > 0) components.push(current);\n  return components;\n}\n\n// ---------------------------------------------------------------------------\n// Adjacency refinement (operates on the emitted rows)\n// ---------------------------------------------------------------------------\n\nfunction classifyForwardShortConvergenceAdjacency(\n  rows: readonly MigrationGraphGridRow[],\n  edgeRowIndex: number,\n  edge: ClassifiedEdge,\n  laneIndex: number,\n): EdgeAdjacency {\n  for (let index = edgeRowIndex + 1; index < rows.length; index++) {\n    const row = rows[index];\n    if (row === undefined) break;\n    if (row.kind === 'component-separator' || row.kind === 'branch-connector') continue;\n    if (row.kind === 'merge-connector') continue;\n    if (row.kind === 'edge') {\n      if (row.laneIndex === laneIndex) return 'node-skipping-forward';\n      continue;\n    }\n    if (row.kind === 'node' && row.contractHash === edge.from) {\n      return 'adjacent';\n    }\n  }\n  return 'node-skipping-forward';\n}\n\nfunction convergenceProducerUsesShortAdjacency(\n  edge: ClassifiedEdge,\n  laneIndex: number,\n  forwardProducersByTo: ReadonlyMap<string, readonly ClassifiedEdge[]>,\n  producerLaneByHash: ReadonlyMap<string, number>,\n): boolean {\n  const producers = (forwardProducersByTo.get(edge.to) ?? []).filter(\n    (candidate) => candidate.kind === 'forward',\n  );\n  if (producers.length < 2) return false;\n\n  const fanLanes = [\n    ...new Set(\n      producers\n        .map((producer) => producerLaneByHash.get(producer.migrationHash))\n        .filter((candidate): candidate is number => candidate !== undefined),\n    ),\n  ].sort((a, b) => a - b);\n  const fanStart = fanLanes[0];\n  if (fanStart === undefined) return false;\n\n  return laneIndex === fanStart;\n}\n\nfunction classifyForwardLayoutAdjacency(\n  rows: readonly MigrationGraphGridRow[],\n  edgeRowIndex: number,\n  edge: ClassifiedEdge,\n  laneIndex: number,\n  passThroughLanes: readonly number[],\n  nodeColumn: ReadonlyMap<string, number>,\n  convergenceProducer: boolean,\n  divergenceBranchEdge: boolean,\n): EdgeAdjacency {\n  let sawObstruction = false;\n  const passThroughLaneSet = new Set(passThroughLanes);\n\n  for (let index = edgeRowIndex + 1; index < rows.length; index++) {\n    const row = rows[index];\n    if (row === undefined) break;\n    if (row.kind === 'component-separator') continue;\n    if (row.kind === 'merge-connector') {\n      if (convergenceProducer) {\n        if (row.contractHash === edge.from) sawObstruction = true;\n      } else if (!divergenceBranchEdge && row.contractHash !== edge.from) {\n        sawObstruction = true;\n      }\n      continue;\n    }\n    if (row.kind === 'branch-connector') continue;\n    if (row.kind === 'edge') {\n      if (row.laneIndex === laneIndex) return 'node-skipping-forward';\n      if (!divergenceBranchEdge && row.edge !== undefined && row.edge.to !== edge.to) {\n        sawObstruction = true;\n      }\n      continue;\n    }\n    if (row.kind === 'node' && row.contractHash !== undefined) {\n      if (row.contractHash === edge.from) {\n        return sawObstruction ? 'node-skipping-forward' : 'adjacent';\n      }\n      const nodeCol = nodeColumn.get(row.contractHash) ?? 0;\n      // A divergence-branch lane runs unobstructed to its convergence point;\n      // sibling-branch nodes sit in parallel lanes and never block it.\n      if (!divergenceBranchEdge && !passThroughLaneSet.has(nodeCol)) {\n        sawObstruction = true;\n      }\n    }\n  }\n\n  return 'node-skipping-forward';\n}\n\nfunction classifyLayoutAdjacency(\n  rows: readonly MigrationGraphGridRow[],\n  edgeRowIndex: number,\n  edge: ClassifiedEdge,\n  laneIndex: number,\n  passThroughLanes: readonly number[],\n  nodeColumn: ReadonlyMap<string, number>,\n  position: ReadonlyMap<string, number>,\n  forwardInDegree: ReadonlyMap<string, number>,\n  convergenceProducer: boolean,\n  divergenceBranchEdge: boolean,\n): EdgeAdjacency {\n  if (edge.kind === 'self') return 'adjacent';\n\n  const fromPos = position.get(edge.from);\n  const toPos = position.get(edge.to);\n\n  if (edge.kind === 'forward') {\n    const inDegree = forwardInDegree.get(edge.to) ?? 0;\n    if (inDegree <= 1 && fromPos !== undefined && toPos !== undefined && fromPos === toPos + 1) {\n      return 'adjacent';\n    }\n    return classifyForwardLayoutAdjacency(\n      rows,\n      edgeRowIndex,\n      edge,\n      laneIndex,\n      passThroughLanes,\n      nodeColumn,\n      convergenceProducer,\n      divergenceBranchEdge,\n    );\n  }\n\n  if (fromPos !== undefined && toPos !== undefined && toPos === fromPos + 1) {\n    return 'adjacent';\n  }\n\n  for (let index = edgeRowIndex + 1; index < rows.length; index++) {\n    const row = rows[index];\n    if (row === undefined) break;\n    if (\n      row.kind === 'component-separator' ||\n      row.kind === 'branch-connector' ||\n      row.kind === 'merge-connector'\n    ) {\n      continue;\n    }\n    if (row.kind === 'edge') continue;\n    if (row.kind === 'node') {\n      return row.contractHash === edge.to ? 'adjacent' : 'node-skipping-rollback';\n    }\n  }\n  return 'node-skipping-rollback';\n}\n\nfunction refineAdjacency(\n  rows: readonly MigrationGraphGridRow[],\n  nodeColumn: ReadonlyMap<string, number>,\n  position: ReadonlyMap<string, number>,\n  forwardInDegree: ReadonlyMap<string, number>,\n  forwardOutDegree: ReadonlyMap<string, number>,\n  edges: readonly ClassifiedEdge[],\n  producerLaneByHash: ReadonlyMap<string, number>,\n): MigrationGraphGridRow[] {\n  const forwardProducersByTo = buildForwardProducersByTo(edges);\n  function branchLaneForEdge(producer: ClassifiedEdge): number | undefined {\n    const children = edges.filter(\n      (edge) => edge.from === producer.from && edge.kind === 'forward' && edge.from !== edge.to,\n    );\n    if (children.length < 2) return undefined;\n    const index = children.findIndex((child) => child.migrationHash === producer.migrationHash);\n    return index >= 0 ? index : undefined;\n  }\n\n  return rows.map((row, rowIndex) => {\n    if (row.kind !== 'edge' || row.edge === undefined || row.laneIndex === undefined) {\n      return row;\n    }\n    const divergenceBranchEdge =\n      row.edge.kind === 'forward' &&\n      !(row.convergenceProducer ?? false) &&\n      (forwardOutDegree.get(row.edge.from) ?? 0) >= 2 &&\n      branchLaneForEdge(row.edge) !== undefined;\n    const adjacency =\n      row.convergenceProducer === true &&\n      convergenceProducerUsesShortAdjacency(\n        row.edge,\n        row.laneIndex,\n        forwardProducersByTo,\n        producerLaneByHash,\n      )\n        ? classifyForwardShortConvergenceAdjacency(rows, rowIndex, row.edge, row.laneIndex)\n        : classifyLayoutAdjacency(\n            rows,\n            rowIndex,\n            row.edge,\n            row.laneIndex,\n            row.passThroughLanes ?? [],\n            nodeColumn,\n            position,\n            forwardInDegree,\n            row.convergenceProducer ?? false,\n            divergenceBranchEdge,\n          );\n    return {\n      ...row,\n      cells: buildEdgeCells(\n        row.edge,\n        row.laneIndex,\n        row.passThroughLanes ?? [],\n        adjacency,\n        row.cells.length,\n      ),\n    };\n  });\n}\n\nfunction classifyEdgeAdjacency(\n  edge: ClassifiedEdge,\n  position: ReadonlyMap<string, number>,\n): EdgeAdjacency {\n  if (edge.kind === 'self') return 'adjacent';\n\n  const fromPos = position.get(edge.from);\n  const toPos = position.get(edge.to);\n  if (fromPos === undefined || toPos === undefined) return 'adjacent';\n\n  if (edge.kind === 'forward') {\n    if (toPos >= fromPos) return 'adjacent';\n    return fromPos === toPos + 1 ? 'adjacent' : 'node-skipping-forward';\n  }\n\n  if (toPos <= fromPos) return 'adjacent';\n  return toPos === fromPos + 1 ? 'adjacent' : 'node-skipping-rollback';\n}\n\n// ---------------------------------------------------------------------------\n// Cell builders\n// ---------------------------------------------------------------------------\n\nfunction emptyCells(width: number): StructuralCell[] {\n  return Array.from({ length: width }, () => ({ kind: 'empty' as const }));\n}\n\nfunction buildBranchConnectorCells(\n  startLane: number,\n  endLane: number,\n  activeLanes: ReadonlySet<number>,\n  gridWidth: number,\n): StructuralCell[] {\n  const cells = emptyCells(gridWidth);\n  for (let lane = 0; lane < gridWidth; lane++) {\n    if (activeLanes.has(lane) && (lane < startLane || lane > endLane)) {\n      cells[lane] = { kind: 'vertical-pass' };\n      continue;\n    }\n    if (lane === startLane) {\n      cells[lane] = { kind: 'branch-tee' };\n    } else if (lane === endLane) {\n      cells[lane] = { kind: 'branch-corner' };\n    } else if (lane > startLane && lane < endLane) {\n      cells[lane] = { kind: 'branch-tee' };\n    }\n  }\n  return cells;\n}\n\nfunction buildMergeConnectorCells(\n  startLane: number,\n  endLane: number,\n  activeLanes: ReadonlySet<number>,\n  gridWidth: number,\n): StructuralCell[] {\n  const cells = emptyCells(gridWidth);\n  for (let lane = 0; lane < gridWidth; lane++) {\n    if (activeLanes.has(lane) && (lane < startLane || lane > endLane)) {\n      cells[lane] = { kind: 'vertical-pass' };\n      continue;\n    }\n    if (lane === startLane) {\n      cells[lane] = { kind: 'merge-tee' };\n    } else if (lane === endLane) {\n      cells[lane] = { kind: 'merge-corner' };\n    } else if (lane > startLane && lane < endLane) {\n      cells[lane] = activeLanes.has(lane) ? { kind: 'merge-tee' } : { kind: 'horizontal-pass' };\n    }\n  }\n  return cells;\n}\n\nfunction buildNodeCells(\n  contractHash: string,\n  nodeColumn: number,\n  activeLanes: readonly number[],\n  gridWidth: number,\n): StructuralCell[] {\n  const cells = emptyCells(gridWidth);\n  for (const lane of activeLanes) {\n    if (lane !== nodeColumn && lane < gridWidth) {\n      cells[lane] = { kind: 'vertical-pass' };\n    }\n  }\n  if (nodeColumn < gridWidth) {\n    cells[nodeColumn] = { kind: 'node', contractHash };\n  }\n  return cells;\n}\n\nfunction buildEdgeCells(\n  edge: ClassifiedEdge,\n  laneIndex: number,\n  passThroughLanes: readonly number[],\n  adjacency: EdgeAdjacency,\n  gridWidth: number,\n): StructuralCell[] {\n  const cells = emptyCells(gridWidth);\n  for (const lane of passThroughLanes) {\n    if (lane < gridWidth) cells[lane] = { kind: 'vertical-pass' };\n  }\n  if (laneIndex < gridWidth) {\n    cells[laneIndex] = {\n      kind: 'edge-lane',\n      migrationHash: edge.migrationHash,\n      edgeKind: edge.kind,\n      ownsLabel: true,\n      adjacency,\n    };\n  }\n  return cells;\n}\n\n// ---------------------------------------------------------------------------\n// Vertical ordering: tips-first DFS post-order over forward edges\n// ---------------------------------------------------------------------------\n\n/**\n * Compute the vertical node order for a component: tips at the top (index 0),\n * roots at the bottom. This is a DFS post-order over forward edges starting\n * from forward roots, visiting children in their input (insertion) order. A\n * node is emitted only after all of its forward children, so convergence nodes\n * sit below every branch that feeds them and the longest contiguous chain reads\n * top-to-bottom without braiding.\n */\nfunction computeVerticalOrder(\n  componentNodes: readonly string[],\n  forwardChildren: ReadonlyMap<string, readonly ClassifiedEdge[]>,\n  forwardInDegree: ReadonlyMap<string, number>,\n): string[] {\n  const WHITE = 0;\n  const GRAY = 1;\n  const BLACK = 2;\n  const color = new Map<string, number>();\n  for (const node of componentNodes) color.set(node, WHITE);\n\n  const sortRoots = (roots: readonly string[]): string[] =>\n    [...roots].sort((a, b) => {\n      if (a === EMPTY_CONTRACT_HASH) return -1;\n      if (b === EMPTY_CONTRACT_HASH) return 1;\n      return a.localeCompare(b);\n    });\n\n  let roots = sortRoots(componentNodes.filter((n) => (forwardInDegree.get(n) ?? 0) === 0));\n  if (roots.length === 0) roots = sortRoots(componentNodes);\n\n  const result: string[] = [];\n\n  interface Frame {\n    node: string;\n    children: readonly ClassifiedEdge[];\n    index: number;\n  }\n\n  function runDfs(root: string): void {\n    if (color.get(root) !== WHITE) return;\n    const stack: Frame[] = [{ node: root, children: forwardChildren.get(root) ?? [], index: 0 }];\n    color.set(root, GRAY);\n\n    while (stack.length > 0) {\n      const frame = stack[stack.length - 1];\n      if (frame === undefined) break;\n      if (frame.index >= frame.children.length) {\n        color.set(frame.node, BLACK);\n        result.push(frame.node);\n        stack.pop();\n        continue;\n      }\n      const child = frame.children[frame.index];\n      frame.index += 1;\n      if (child === undefined) continue;\n      if (color.get(child.to) === WHITE) {\n        color.set(child.to, GRAY);\n        stack.push({ node: child.to, children: forwardChildren.get(child.to) ?? [], index: 0 });\n      }\n    }\n  }\n\n  for (const root of roots) runDfs(root);\n  // Nodes unreachable via forward edges (e.g. rollback-only sources) follow in\n  // component order.\n  for (const node of componentNodes) {\n    if (color.get(node) === WHITE) runDfs(node);\n  }\n\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Routed back-arcs for node-skipping rollbacks\n// ---------------------------------------------------------------------------\n\ninterface SkipRollbackRoute {\n  readonly edge: ClassifiedEdge;\n  readonly backLane: number;\n}\n\nfunction rollbackSpan(\n  edge: ClassifiedEdge,\n  position: ReadonlyMap<string, number>,\n): { readonly top: number; readonly bottom: number } {\n  const top = position.get(edge.from) ?? 0;\n  const bottom = position.get(edge.to) ?? top;\n  return { top, bottom };\n}\n\nfunction spansOverlap(\n  a: { readonly top: number; readonly bottom: number },\n  b: { readonly top: number; readonly bottom: number },\n): boolean {\n  return a.top <= b.bottom && b.top <= a.bottom;\n}\n\nfunction forwardMaxLane(\n  rows: readonly MigrationGraphGridRow[],\n  skipMigrationHashes: ReadonlySet<string>,\n): number {\n  let max = 0;\n  for (const row of rows) {\n    if (\n      row.kind === 'edge' &&\n      row.edge !== undefined &&\n      skipMigrationHashes.has(row.edge.migrationHash)\n    ) {\n      continue;\n    }\n    max = Math.max(max, row.laneIndex ?? 0);\n    for (const lane of row.passThroughLanes ?? []) {\n      max = Math.max(max, lane);\n    }\n    if (row.startLane !== undefined) {\n      max = Math.max(max, row.startLane, row.endLane ?? row.startLane);\n    }\n  }\n  return max;\n}\n\nfunction allocateSkipRollbackBackLanes(\n  skipRollbacks: readonly ClassifiedEdge[],\n  position: ReadonlyMap<string, number>,\n  forwardMax: number,\n): Map<string, number> {\n  const sorted = [...skipRollbacks].sort((a, b) => {\n    const aTop = position.get(a.from) ?? 0;\n    const bTop = position.get(b.from) ?? 0;\n    if (aTop !== bTop) return aTop - bTop;\n    return b.dirName.localeCompare(a.dirName);\n  });\n\n  const occupied: { readonly top: number; readonly bottom: number; readonly lane: number }[] = [];\n  const lanes = new Map<string, number>();\n  let nextLane = forwardMax + 1;\n\n  for (const edge of sorted) {\n    const span = rollbackSpan(edge, position);\n    let lane = nextLane;\n    while (occupied.some((entry) => entry.lane === lane && spansOverlap(entry, span))) {\n      lane += 1;\n    }\n    occupied.push({ ...span, lane });\n    lanes.set(edge.migrationHash, lane);\n    nextLane = Math.max(nextLane, lane + 1);\n  }\n\n  return lanes;\n}\n\nfunction findNodeRowIndex(rows: readonly MigrationGraphGridRow[], contractHash: string): number {\n  return rows.findIndex((row) => row.kind === 'node' && row.contractHash === contractHash);\n}\n\nfunction findEdgeRowIndex(rows: readonly MigrationGraphGridRow[], migrationHash: string): number {\n  return rows.findIndex((row) => row.kind === 'edge' && row.edge?.migrationHash === migrationHash);\n}\n\n// A grid row with a mutable `cells` array. The routing pass clones the\n// immutable rows into this shape so it can paint arc cells in place without\n// stripping `readonly` with a cast.\ntype MutableGridRow = Omit<MigrationGraphGridRow, 'cells'> & { cells: StructuralCell[] };\n\nfunction ensureCellWidth(cells: StructuralCell[], width: number): void {\n  while (cells.length < width) {\n    cells.push({ kind: 'empty' });\n  }\n}\n\nfunction cloneRow(row: MigrationGraphGridRow): MutableGridRow {\n  return { ...row, cells: [...row.cells] };\n}\n\nfunction routeCrossesRow(\n  route: SkipRollbackRoute,\n  rowIndex: number,\n  rows: readonly MigrationGraphGridRow[],\n): boolean {\n  const sourceRow = findNodeRowIndex(rows, route.edge.from);\n  const targetRow = findNodeRowIndex(rows, route.edge.to);\n  if (sourceRow < 0 || targetRow < 0) return false;\n  return rowIndex > sourceRow && rowIndex <= targetRow;\n}\n\nfunction applySkipRollbackRouting(\n  rows: readonly MigrationGraphGridRow[],\n  skipRollbacks: readonly ClassifiedEdge[],\n  position: ReadonlyMap<string, number>,\n  nodeColumn: ReadonlyMap<string, number>,\n  edgeColumn: Map<string, number>,\n): MigrationGraphGridRow[] {\n  if (skipRollbacks.length === 0) return [...rows];\n\n  const skipHashes = new Set(skipRollbacks.map((edge) => edge.migrationHash));\n  const forwardMax = forwardMaxLane(rows, skipHashes);\n  const backLaneByHash = allocateSkipRollbackBackLanes(skipRollbacks, position, forwardMax);\n  const routes: SkipRollbackRoute[] = skipRollbacks.map((edge) => ({\n    edge,\n    backLane: backLaneByHash.get(edge.migrationHash) ?? forwardMax + 1,\n  }));\n\n  const result = rows.map(cloneRow);\n\n  for (const route of routes) {\n    const { edge, backLane } = route;\n    const nodeCol = nodeColumn.get(edge.from) ?? 0;\n    const targetCol = nodeColumn.get(edge.to) ?? 0;\n    const sourceRowIndex = findNodeRowIndex(result, edge.from);\n    const targetRowIndex = findNodeRowIndex(result, edge.to);\n    const edgeRowIndex = findEdgeRowIndex(result, edge.migrationHash);\n    if (sourceRowIndex < 0 || targetRowIndex < 0 || edgeRowIndex < 0) continue;\n\n    edgeColumn.set(edge.migrationHash, backLane);\n\n    // Back-lanes of arcs that tee off this same source node. They share the\n    // node's tee row, so each inner lane reads as a `┬` junction and only the\n    // outermost gets the closing `╮`.\n    const coSourcedLanes = routes\n      .filter((other) => other.edge.from === edge.from)\n      .map((other) => other.backLane);\n    const maxCoSourcedLane = Math.max(...coSourcedLanes);\n\n    const sourceRow = result[sourceRowIndex];\n    if (sourceRow !== undefined) {\n      const cells = sourceRow.cells;\n      ensureCellWidth(cells, backLane + 1);\n      const contractHash = sourceRow.contractHash ?? EMPTY_CONTRACT_HASH;\n      cells[nodeCol] = { kind: 'node', contractHash, arcTee: true };\n      for (let lane = nodeCol + 1; lane < backLane; lane += 1) {\n        if (coSourcedLanes.includes(lane)) {\n          cells[lane] = { kind: 'arc-branch-tee' };\n          continue;\n        }\n        const existing = cells[lane];\n        const occupied =\n          existing !== undefined &&\n          existing.kind !== 'empty' &&\n          existing.kind !== 'horizontal-pass' &&\n          existing.kind !== 'arc-land-bridge';\n        const crossed =\n          occupied ||\n          routes.some(\n            (other) =>\n              other.edge.migrationHash !== edge.migrationHash &&\n              other.backLane === lane &&\n              routeCrossesRow(other, sourceRowIndex, result),\n          );\n        cells[lane] = crossed ? { kind: 'arc-crossing' } : { kind: 'horizontal-pass' };\n      }\n      cells[backLane] =\n        backLane < maxCoSourcedLane ? { kind: 'arc-branch-tee' } : { kind: 'arc-branch-corner' };\n    }\n\n    const edgeRow = result[edgeRowIndex];\n    if (edgeRow !== undefined) {\n      // Mutate in place rather than rebuild from empty: a co-sourced arc's body\n      // lane may already cross this row, and rebuilding would clobber it.\n      const cells = edgeRow.cells;\n      ensureCellWidth(cells, backLane + 1);\n      cells[nodeCol] = { kind: 'vertical-pass' };\n      cells[backLane] = {\n        kind: 'edge-lane',\n        migrationHash: edge.migrationHash,\n        edgeKind: edge.kind,\n        ownsLabel: true,\n        adjacency: 'node-skipping-rollback',\n      };\n      result[edgeRowIndex] = { ...edgeRow, laneIndex: backLane, passThroughLanes: [nodeCol] };\n    }\n\n    // Fill the arc body vertically from just below the source tee down to the\n    // row above the landing, skipping the rollback's own labelled edge row.\n    // Starting below the source (rather than below the edge row) keeps a\n    // co-sourced arc's lane connected across an earlier co-sourced edge row.\n    for (let index = sourceRowIndex + 1; index < targetRowIndex; index += 1) {\n      if (index === edgeRowIndex) continue;\n      const row = result[index];\n      if (row === undefined) continue;\n      const cells = row.cells;\n      ensureCellWidth(cells, backLane + 1);\n      const existing = cells[backLane];\n      if (\n        existing?.kind !== 'arc-land-corner' &&\n        existing?.kind !== 'arc-land-bridge' &&\n        existing?.kind !== 'arc-branch-corner' &&\n        existing?.kind !== 'arc-branch-tee' &&\n        existing?.kind !== 'arc-crossing'\n      ) {\n        cells[backLane] = { kind: 'vertical-pass' };\n      }\n    }\n\n    const targetRow = result[targetRowIndex];\n    if (targetRow !== undefined) {\n      const cells = targetRow.cells;\n      ensureCellWidth(cells, backLane + 1);\n      const contractHash = targetRow.contractHash ?? EMPTY_CONTRACT_HASH;\n      cells[targetCol] = { kind: 'node', contractHash, arcLand: true };\n      for (let lane = targetCol + 1; lane < backLane; lane += 1) {\n        // A bridged lane that carries another arc OR a forward vertical still\n        // active at this row must cross over it (`┼`) rather than overwrite it\n        // with a bare bridge (`──`).\n        const existing = cells[lane];\n        const occupied =\n          existing !== undefined &&\n          existing.kind !== 'empty' &&\n          existing.kind !== 'horizontal-pass' &&\n          existing.kind !== 'arc-land-bridge';\n        const crossed =\n          occupied ||\n          routes.some(\n            (other) =>\n              other.edge.migrationHash !== edge.migrationHash &&\n              other.backLane === lane &&\n              routeCrossesRow(other, targetRowIndex, result),\n          );\n        cells[lane] = crossed ? { kind: 'arc-crossing' } : { kind: 'arc-land-bridge' };\n      }\n      cells[backLane] = { kind: 'arc-land-corner' };\n      for (const other of routes) {\n        if (other.backLane <= backLane) continue;\n        if (!routeCrossesRow(other, targetRowIndex, result)) continue;\n        ensureCellWidth(cells, other.backLane + 1);\n        const existing = cells[other.backLane];\n        if (\n          existing?.kind !== 'arc-land-corner' &&\n          existing?.kind !== 'arc-land-bridge' &&\n          existing?.kind !== 'node'\n        ) {\n          cells[other.backLane] = { kind: 'vertical-pass' };\n        }\n      }\n    }\n  }\n\n  return result;\n}\n\nfunction collectNodeSkippingRollbacks(\n  edges: readonly ClassifiedEdge[],\n  position: ReadonlyMap<string, number>,\n): ClassifiedEdge[] {\n  return edges.filter(\n    (edge) =>\n      edge.kind === 'rollback' &&\n      classifyEdgeAdjacency(edge, position) === 'node-skipping-rollback',\n  );\n}\n\n// ---------------------------------------------------------------------------\n// Lane allocation: one rule for all topologies\n// ---------------------------------------------------------------------------\n\ninterface DownwardGroup {\n  readonly target: string;\n  readonly edges: ClassifiedEdge[];\n}\n\nfunction layoutComponent(\n  componentNodes: readonly string[],\n  allEdges: readonly ClassifiedEdge[],\n): {\n  rows: MigrationGraphGridRow[];\n  nodeColumn: Map<string, number>;\n  edgeColumn: Map<string, number>;\n} {\n  const componentSet = new Set(componentNodes);\n  const edges = allEdges.filter((e) => componentSet.has(e.from) && componentSet.has(e.to));\n\n  const forwardChildren = new Map<string, ClassifiedEdge[]>();\n  const producersByTo = new Map<string, ClassifiedEdge[]>();\n  const rollbacksByFrom = new Map<string, ClassifiedEdge[]>();\n  const selfByFrom = new Map<string, ClassifiedEdge[]>();\n  for (const edge of edges) {\n    if (edge.kind === 'self' || edge.from === edge.to) {\n      const bucket = selfByFrom.get(edge.from);\n      if (bucket) bucket.push(edge);\n      else selfByFrom.set(edge.from, [edge]);\n      continue;\n    }\n    if (edge.kind === 'forward') {\n      const children = forwardChildren.get(edge.from);\n      if (children) children.push(edge);\n      else forwardChildren.set(edge.from, [edge]);\n      const producers = producersByTo.get(edge.to);\n      if (producers) producers.push(edge);\n      else producersByTo.set(edge.to, [edge]);\n      continue;\n    }\n    // rollback\n    const bucket = rollbacksByFrom.get(edge.from);\n    if (bucket) bucket.push(edge);\n    else rollbacksByFrom.set(edge.from, [edge]);\n  }\n\n  const forwardInDegree = buildForwardInDegree(edges);\n  const forwardOutDegree = buildForwardOutDegree(edges);\n  const distinctSourceCountByTo = buildDistinctSourceCountByTo(edges);\n\n  const order = computeVerticalOrder(componentNodes, forwardChildren, forwardInDegree);\n  const position = new Map<string, number>();\n  for (let index = 0; index < order.length; index++) {\n    const node = order[index];\n    if (node !== undefined) position.set(node, index);\n  }\n\n  const lanes: (string | null)[] = [];\n  const rows: MigrationGraphGridRow[] = [];\n  const nodeColumn = new Map<string, number>();\n  const edgeColumn = new Map<string, number>();\n  const producerLaneByHash = new Map<string, number>();\n  let gridWidth = 1;\n\n  function ensureGridWidth(minWidth: number): void {\n    if (minWidth > gridWidth) gridWidth = minWidth;\n  }\n\n  function setLane(index: number, want: string | null): void {\n    while (lanes.length <= index) lanes.push(null);\n    lanes[index] = want;\n    if (want !== null) ensureGridWidth(index + 1);\n  }\n\n  function activeLaneIndices(): number[] {\n    const indices: number[] = [];\n    for (let index = 0; index < lanes.length; index++) {\n      if (lanes[index] !== null) indices.push(index);\n    }\n    return indices;\n  }\n\n  function passThroughExcept(lane: number): number[] {\n    return activeLaneIndices().filter((index) => index !== lane);\n  }\n\n  function leftmostFreeLane(): number {\n    for (let index = 0; index < lanes.length; index++) {\n      if (lanes[index] === null) return index;\n    }\n    return lanes.length;\n  }\n\n  function lanesWanting(contract: string): number[] {\n    const indices: number[] = [];\n    for (let index = 0; index < lanes.length; index++) {\n      if (lanes[index] === contract) indices.push(index);\n    }\n    return indices;\n  }\n\n  function emitMergeConnector(contractHash: string, laneIndices: readonly number[]): number {\n    const startLane = Math.min(...laneIndices);\n    const endLane = Math.max(...laneIndices);\n    ensureGridWidth(endLane + 1);\n    const activeLanes = new Set(activeLaneIndices());\n    rows.push({\n      kind: 'merge-connector',\n      contractHash,\n      startLane,\n      endLane,\n      branchCount: laneIndices.length,\n      cells: buildMergeConnectorCells(startLane, endLane, activeLanes, gridWidth),\n    });\n    for (const index of laneIndices) {\n      if (index !== startLane) setLane(index, null);\n    }\n    return startLane;\n  }\n\n  function emitBranchConnector(\n    contractHash: string,\n    startLane: number,\n    endLane: number,\n    branchCount: number,\n  ): void {\n    ensureGridWidth(endLane + 1);\n    const activeLanes = new Set(activeLaneIndices());\n    rows.push({\n      kind: 'branch-connector',\n      contractHash,\n      startLane,\n      endLane,\n      branchCount,\n      cells: buildBranchConnectorCells(startLane, endLane, activeLanes, gridWidth),\n    });\n  }\n\n  function emitEdgeRow(edge: ClassifiedEdge, lane: number, convergenceProducer: boolean): void {\n    const passThrough = passThroughExcept(lane);\n    const adjacency = classifyEdgeAdjacency(edge, position);\n    ensureGridWidth(Math.max(lane, ...passThrough, 0) + 1);\n    const row: MigrationGraphGridRow = {\n      kind: 'edge',\n      edge,\n      laneIndex: lane,\n      passThroughLanes: passThrough,\n      cells: buildEdgeCells(edge, lane, passThrough, adjacency, gridWidth),\n    };\n    rows.push(convergenceProducer ? { ...row, convergenceProducer: true } : row);\n    edgeColumn.set(edge.migrationHash, lane);\n    if (convergenceProducer) producerLaneByHash.set(edge.migrationHash, lane);\n  }\n\n  function emitNodeRow(contractHash: string, column: number): void {\n    ensureGridWidth(column + 1);\n    const passThrough = activeLaneIndices().filter((index) => index !== column);\n    rows.push({\n      kind: 'node',\n      contractHash,\n      cells: buildNodeCells(contractHash, column, passThrough, gridWidth),\n    });\n    nodeColumn.set(contractHash, column);\n  }\n\n  function producerGroups(node: string): DownwardGroup[] {\n    const byTarget = new Map<string, DownwardGroup>();\n    for (const producer of producersByTo.get(node) ?? []) {\n      const group = byTarget.get(producer.from);\n      if (group) group.edges.push(producer);\n      else byTarget.set(producer.from, { target: producer.from, edges: [producer] });\n    }\n    const groups = [...byTarget.values()];\n    // Lanes are ordered by where their target node lands vertically (soonest →\n    // leftmost), which keeps lanes from crossing.\n    groups.sort((a, b) => (position.get(a.target) ?? 0) - (position.get(b.target) ?? 0));\n    for (const group of groups) {\n      group.edges.sort((a, b) => b.dirName.localeCompare(a.dirName));\n    }\n    return groups;\n  }\n\n  function processNode(node: string): void {\n    const wanting = lanesWanting(node);\n    let column: number;\n    if (wanting.length >= 2) {\n      column = emitMergeConnector(node, wanting);\n    } else if (wanting.length === 1) {\n      column = wanting[0] ?? 0;\n    } else {\n      column = leftmostFreeLane();\n    }\n\n    // Self-edges sit immediately above their node, in its column.\n    const selfEdges = [...(selfByFrom.get(node) ?? [])].sort((a, b) =>\n      b.dirName.localeCompare(a.dirName),\n    );\n    for (const selfEdge of selfEdges) emitEdgeRow(selfEdge, column, false);\n\n    emitNodeRow(node, column);\n\n    const rollbacks = [...(rollbacksByFrom.get(node) ?? [])].sort((a, b) =>\n      b.dirName.localeCompare(a.dirName),\n    );\n    const skipRollbacks: ClassifiedEdge[] = [];\n    const adjacentRollbacks: ClassifiedEdge[] = [];\n    for (const rollback of rollbacks) {\n      if (classifyEdgeAdjacency(rollback, position) === 'node-skipping-rollback') {\n        skipRollbacks.push(rollback);\n      } else {\n        adjacentRollbacks.push(rollback);\n      }\n    }\n    for (const rollback of skipRollbacks) {\n      emitEdgeRow(rollback, column, false);\n    }\n\n    const groups = producerGroups(node);\n    const isConvergence = (distinctSourceCountByTo.get(node) ?? 0) >= 2;\n    const laneForGroup: number[] = [];\n    for (let groupIndex = 0; groupIndex < groups.length; groupIndex++) {\n      const group = groups[groupIndex];\n      if (group === undefined) continue;\n      const lane = groupIndex === 0 ? column : leftmostFreeLane();\n      laneForGroup[groupIndex] = lane;\n      setLane(lane, group.target);\n    }\n\n    if (groups.length >= 2) {\n      const endLane = Math.max(...laneForGroup);\n      emitBranchConnector(node, column, endLane, groups.length);\n    }\n\n    for (let groupIndex = 0; groupIndex < groups.length; groupIndex++) {\n      const group = groups[groupIndex];\n      const lane = laneForGroup[groupIndex];\n      if (group === undefined || lane === undefined) continue;\n      for (const edge of group.edges) {\n        emitEdgeRow(edge, lane, isConvergence);\n      }\n    }\n\n    for (const rollback of adjacentRollbacks) {\n      emitEdgeRow(rollback, column, false);\n    }\n\n    if (groups.length === 0) {\n      // A root / leaf: its column lane terminates here.\n      setLane(column, null);\n    }\n  }\n\n  for (const node of order) processNode(node);\n\n  const refined = refineAdjacency(\n    rows,\n    nodeColumn,\n    position,\n    forwardInDegree,\n    forwardOutDegree,\n    edges,\n    producerLaneByHash,\n  );\n  const skipRollbacks = collectNodeSkippingRollbacks(edges, position);\n  const routed = applySkipRollbackRouting(refined, skipRollbacks, position, nodeColumn, edgeColumn);\n\n  return {\n    rows: routed,\n    nodeColumn,\n    edgeColumn,\n  };\n}\n\nexport function buildMigrationGraphLayout(\n  rowModel: MigrationGraphRowModel,\n): MigrationGraphGridModel {\n  if (rowModel.nodes.length === 0) {\n    return { rows: [], nodeColumn: new Map(), edgeColumn: new Map() };\n  }\n\n  const components = splitComponents(rowModel.nodes);\n  const allRows: MigrationGraphGridRow[] = [];\n  const nodeColumn = new Map<string, number>();\n  const edgeColumn = new Map<string, number>();\n\n  for (let componentIndex = 0; componentIndex < components.length; componentIndex++) {\n    if (componentIndex > 0) {\n      allRows.push({ kind: 'component-separator', cells: [] });\n    }\n\n    const component = components[componentIndex];\n    if (component === undefined || component.length === 0) continue;\n\n    const result = layoutComponent(component, rowModel.edges);\n    allRows.push(...result.rows);\n    for (const [hash, column] of result.nodeColumn) nodeColumn.set(hash, column);\n    for (const [hash, column] of result.edgeColumn) edgeColumn.set(hash, column);\n  }\n\n  return { rows: allRows, nodeColumn, edgeColumn };\n}\n","import { EMPTY_CONTRACT_HASH } from '@prisma-next/migration-tools/constants';\nimport type { MigrationGraph } from '@prisma-next/migration-tools/graph';\nimport {\n  classifyMigrationGraphTopology,\n  type MigrationEdgeKind,\n  type MigrationListGraphTopology,\n} from './migration-list-graph-topology';\n\n// ---------------------------------------------------------------------------\n// Public types\n// ---------------------------------------------------------------------------\n\n/**\n * A migration edge with its forward/rollback/self classification resolved.\n * `from` and `to` are contract hashes (EMPTY_CONTRACT_HASH for the baseline).\n */\nexport interface ClassifiedEdge {\n  readonly migrationHash: string;\n  readonly from: string;\n  readonly to: string;\n  readonly dirName: string;\n  readonly kind: MigrationEdgeKind;\n}\n\n/**\n * The pure-data output of the row-model stage.\n *\n * `nodes` is the vertical ordering of contract nodes: index 0 is the topmost\n * row (the tip), the last non-null entry is the bottommost root. `null`\n * sentinels separate disjoint components (the blank row in the rendered\n * output). Ordering within each component is deterministic: longest forward-\n * path rank from forward roots (tips at rank max, roots at 0), with lex-\n * ascending tie-break among same-rank siblings.\n *\n * `edges` carries every classified migration. `edgesByFrom` and `edgesByTo`\n * are pre-built lookup maps for the column allocator.\n */\nexport interface MigrationGraphRowModel {\n  readonly nodes: readonly (string | null)[];\n  readonly edges: readonly ClassifiedEdge[];\n  readonly edgesByFrom: ReadonlyMap<string, readonly ClassifiedEdge[]>;\n  readonly edgesByTo: ReadonlyMap<string, readonly ClassifiedEdge[]>;\n}\n\nexport interface BuildMigrationGraphRowsOptions {\n  readonly contractHash?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Weak connectivity — identify disjoint components\n// ---------------------------------------------------------------------------\n\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: MigrationGraph): readonly ReadonlySet<string>[] {\n  const visited = new Set<string>();\n  const adjacency = new Map<string, string[]>();\n\n  function addAdjacent(a: string, b: string): void {\n    const aList = adjacency.get(a);\n    if (aList) aList.push(b);\n    else adjacency.set(a, [b]);\n    const bList = adjacency.get(b);\n    if (bList) bList.push(a);\n    else adjacency.set(b, [a]);\n  }\n\n  for (const edges of graph.forwardChain.values()) {\n    for (const edge of edges) {\n      if (edge.from !== edge.to) {\n        addAdjacent(edge.from, edge.to);\n      }\n    }\n  }\n\n  // Ensure all nodes (including isolated self-loops) are reachable\n  for (const node of graph.nodes) {\n    if (!adjacency.has(node)) {\n      adjacency.set(node, []);\n    }\n  }\n\n  const components: Set<string>[] = [];\n\n  function bfsComponent(start: string): Set<string> {\n    const component = new Set<string>();\n    const queue = [start];\n    while (queue.length > 0) {\n      const node = queue.shift();\n      if (node === undefined || visited.has(node)) continue;\n      visited.add(node);\n      component.add(node);\n      for (const neighbor of adjacency.get(node) ?? []) {\n        if (!visited.has(neighbor)) {\n          queue.push(neighbor);\n        }\n      }\n    }\n    return component;\n  }\n\n  // Deterministic: visit nodes in a fixed order (EMPTY first, then lex)\n  const allNodes = [...graph.nodes].sort((a, b) => {\n    if (a === EMPTY_CONTRACT_HASH) return -1;\n    if (b === EMPTY_CONTRACT_HASH) return 1;\n    return a.localeCompare(b);\n  });\n\n  for (const node of allNodes) {\n    if (!visited.has(node)) {\n      components.push(bfsComponent(node));\n    }\n  }\n\n  // Order: EMPTY component first, others by lex-smallest node hash\n  components.sort((a, b) => {\n    const aHasEmpty = a.has(EMPTY_CONTRACT_HASH);\n    const bHasEmpty = b.has(EMPTY_CONTRACT_HASH);\n    if (aHasEmpty && !bHasEmpty) return -1;\n    if (!aHasEmpty && bHasEmpty) return 1;\n    const aMin = [...a].sort((x, y) => x.localeCompare(y))[0] ?? '';\n    const bMin = [...b].sort((x, y) => x.localeCompare(y))[0] ?? '';\n    return aMin.localeCompare(bMin);\n  });\n\n  return components;\n}\n\n// ---------------------------------------------------------------------------\n// Longest forward-path node ordering within a component\n// ---------------------------------------------------------------------------\n\nfunction forwardRootsInComponent(\n  componentNodes: ReadonlySet<string>,\n  topology: MigrationListGraphTopology,\n): readonly string[] {\n  const roots: string[] = [];\n  for (const node of componentNodes) {\n    if ((topology.forwardInDegree.get(node) ?? 0) === 0) {\n      roots.push(node);\n    }\n  }\n  roots.sort((a, b) => {\n    if (a === EMPTY_CONTRACT_HASH) return -1;\n    if (b === EMPTY_CONTRACT_HASH) return 1;\n    return a.localeCompare(b);\n  });\n  if (roots.length > 0) return roots;\n\n  return [...componentNodes].sort((a, b) => {\n    if (a === EMPTY_CONTRACT_HASH) return -1;\n    if (b === EMPTY_CONTRACT_HASH) return 1;\n    return a.localeCompare(b);\n  });\n}\n\nfunction compareNodesTipsFirst(a: string, b: string, rank: ReadonlyMap<string, number>): number {\n  const rankA = rank.get(a) ?? 0;\n  const rankB = rank.get(b) ?? 0;\n  if (rankA !== rankB) return rankB - rankA;\n  if (a === EMPTY_CONTRACT_HASH) return 1;\n  if (b === EMPTY_CONTRACT_HASH) return -1;\n  return a.localeCompare(b);\n}\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 layerNodesByLongestForwardPath(\n  componentNodes: ReadonlySet<string>,\n  topology: MigrationListGraphTopology,\n  graph: MigrationGraph,\n): readonly string[] {\n  const forwardOut = new Map<string, string[]>();\n\n  for (const node of componentNodes) {\n    forwardOut.set(node, []);\n  }\n\n  for (const edges of graph.forwardChain.values()) {\n    for (const edge of edges) {\n      if (!componentNodes.has(edge.from) || !componentNodes.has(edge.to)) continue;\n      if (edge.from === edge.to) continue;\n      if (topology.kindByMigrationHash.get(edge.migrationHash) !== 'forward') continue;\n      const bucket = forwardOut.get(edge.from);\n      if (bucket) bucket.push(edge.to);\n    }\n  }\n\n  const roots = forwardRootsInComponent(componentNodes, topology);\n  const rank = new Map<string, number>();\n  for (const root of roots) {\n    rank.set(root, 0);\n  }\n\n  const maxPasses = componentNodes.size;\n  for (let pass = 0; pass < maxPasses; pass++) {\n    let changed = false;\n    for (const node of componentNodes) {\n      const base = rank.get(node);\n      if (base === undefined) continue;\n      for (const to of forwardOut.get(node) ?? []) {\n        const next = base + 1;\n        const prev = rank.get(to) ?? -1;\n        if (next > prev) {\n          rank.set(to, next);\n          changed = true;\n        }\n      }\n    }\n    if (!changed) break;\n  }\n\n  for (const node of componentNodes) {\n    if (!rank.has(node)) {\n      rank.set(node, 0);\n    }\n  }\n\n  return [...componentNodes].sort((a, b) => compareNodesTipsFirst(a, b, rank));\n}\n\n// ---------------------------------------------------------------------------\n// Public builder\n// ---------------------------------------------------------------------------\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(\n  graph: MigrationGraph,\n  contractHash: string | undefined,\n): string | undefined {\n  return contractHash !== undefined &&\n    contractHash !== EMPTY_CONTRACT_HASH &&\n    !graph.nodes.has(contractHash)\n    ? contractHash\n    : undefined;\n}\n\nexport function buildMigrationGraphRows(\n  graph: MigrationGraph,\n  options: BuildMigrationGraphRowsOptions = {},\n): MigrationGraphRowModel {\n  const emptyModel: MigrationGraphRowModel = {\n    nodes: [],\n    edges: [],\n    edgesByFrom: new Map(),\n    edgesByTo: new Map(),\n  };\n\n  if (graph.nodes.size === 0) {\n    const detached = detachedContractHash(graph, options.contractHash);\n    return detached !== undefined ? { ...emptyModel, nodes: [detached] } : emptyModel;\n  }\n\n  // 1. Classify all edges (shared classifier: DFS plus a peel pass that demotes\n  //    node-skipping rollbacks, so the forward subgraph is acyclic)\n  const topology = classifyMigrationGraphTopology(graph);\n\n  // 2. Build classified edge list\n  const edges: ClassifiedEdge[] = [];\n  const edgesByFrom = new Map<string, ClassifiedEdge[]>();\n  const edgesByTo = new Map<string, ClassifiedEdge[]>();\n\n  for (const edgeList of graph.forwardChain.values()) {\n    for (const edge of edgeList) {\n      const kind = topology.kindByMigrationHash.get(edge.migrationHash) ?? 'forward';\n      const classified: ClassifiedEdge = {\n        migrationHash: edge.migrationHash,\n        from: edge.from,\n        to: edge.to,\n        dirName: edge.dirName,\n        kind,\n      };\n      edges.push(classified);\n\n      const fromBucket = edgesByFrom.get(edge.from);\n      if (fromBucket) fromBucket.push(classified);\n      else edgesByFrom.set(edge.from, [classified]);\n\n      const toBucket = edgesByTo.get(edge.to);\n      if (toBucket) toBucket.push(classified);\n      else edgesByTo.set(edge.to, [classified]);\n    }\n  }\n\n  // 3. Find weakly-connected components (ordered: EMPTY first, then lex)\n  const components = weaklyConnectedComponents(graph);\n\n  // 4. Layer nodes by longest forward path per component, separate with null\n  const nodes: (string | null)[] = [];\n  for (let i = 0; i < components.length; i++) {\n    if (i > 0) nodes.push(null);\n    const component = components[i];\n    if (component === undefined) continue;\n    const ordered = layerNodesByLongestForwardPath(component, topology, graph);\n    for (const node of ordered) {\n      nodes.push(node);\n    }\n  }\n\n  const detached = detachedContractHash(graph, options.contractHash);\n  if (detached !== undefined) {\n    if (nodes.length > 0) {\n      nodes.unshift(null);\n    }\n    nodes.unshift(detached);\n  }\n\n  return { nodes, edges, edgesByFrom, edgesByTo };\n}\n","import { EMPTY_CONTRACT_HASH } from '@prisma-next/migration-tools/constants';\nimport { bold } from 'colorette';\nimport stringWidth from 'string-width';\nimport type { GlyphMode } from '../glyph-mode';\nimport type {\n  MigrationGraphGridModel,\n  MigrationGraphGridRow,\n  StructuralCell,\n} from './migration-graph-layout';\nimport type { ClassifiedEdge } from './migration-graph-rows';\nimport {\n  MIGRATION_LIST_HASH_WIDTH,\n  migrationListEmptySource,\n  migrationListForwardArrow,\n} from './migration-list-data-column';\nimport type { MigrationEdgeKind } from './migration-list-graph-topology';\nimport type { MigrationListStyler } from './migration-list-render';\nimport { CONTRACT_MARKER_NAME, createAnsiMigrationListStyler } from './migration-list-styler';\n\nconst LABEL_GAP = 2;\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\nexport interface RenderMigrationGraphTreeOptions {\n  readonly refsByHash?: ReadonlyMap<string, readonly string[]>;\n  readonly dbHash?: string;\n  readonly contractHash?: string;\n  readonly activeRefName?: string;\n  readonly hashLength?: number;\n  readonly colorize: boolean;\n  readonly glyphMode?: GlyphMode;\n}\n\ninterface MigrationGraphTreeGlyphPalette {\n  readonly node: string;\n  readonly arcLand: string;\n  readonly arcTee: string;\n  readonly verticalPass: string;\n  readonly branchTee: string;\n  readonly mergeTee: string;\n  readonly branchCorner: string;\n  readonly mergeCorner: string;\n  readonly arcBranchCorner: string;\n  readonly arcBranchTee: string;\n  readonly arcLandCorner: string;\n  readonly arcCrossing: string;\n  readonly arcLandBridge: string;\n  readonly horizontalPass: string;\n  readonly connectorBranchTee: string;\n  readonly connectorBranchTeeCo: string;\n  readonly connectorMergeTeeCo: string;\n  readonly edgeArrow: Readonly<Record<MigrationEdgeKind, string>>;\n  readonly forwardArrow: string;\n  readonly emptySource: string;\n}\n\nconst UNICODE_PALETTE: MigrationGraphTreeGlyphPalette = {\n  node: '○ ',\n  arcLand: '○◂',\n  arcTee: '○─',\n  verticalPass: '│ ',\n  branchTee: '├─',\n  mergeTee: '├─',\n  branchCorner: '╮ ',\n  mergeCorner: '╯ ',\n  arcBranchCorner: '╮ ',\n  arcBranchTee: '┬─',\n  arcLandCorner: '╯ ',\n  arcCrossing: '┼─',\n  arcLandBridge: '──',\n  horizontalPass: '──',\n  connectorBranchTee: '├─',\n  connectorBranchTeeCo: '┬─',\n  connectorMergeTeeCo: '┴─',\n  edgeArrow: { forward: '↑', rollback: '↓', self: '⟲' },\n  forwardArrow: migrationListForwardArrow('unicode'),\n  emptySource: migrationListEmptySource('unicode'),\n};\n\nconst ASCII_PALETTE: MigrationGraphTreeGlyphPalette = {\n  node: '* ',\n  arcLand: '*<',\n  arcTee: '*-',\n  verticalPass: '| ',\n  branchTee: '+-',\n  mergeTee: '+-',\n  branchCorner: '\\\\ ',\n  mergeCorner: '/ ',\n  arcBranchCorner: '\\\\ ',\n  arcBranchTee: '+-',\n  arcLandCorner: '/ ',\n  arcCrossing: '+-',\n  arcLandBridge: '--',\n  horizontalPass: '--',\n  connectorBranchTee: '+-',\n  connectorBranchTeeCo: '+-',\n  connectorMergeTeeCo: '+-',\n  edgeArrow: { forward: '^', rollback: 'v', self: '@' },\n  forwardArrow: migrationListForwardArrow('ascii'),\n  emptySource: migrationListEmptySource('ascii'),\n};\n\nfunction paletteFor(mode: GlyphMode): MigrationGraphTreeGlyphPalette {\n  return mode === 'ascii' ? ASCII_PALETTE : UNICODE_PALETTE;\n}\n\nfunction arrowForEdgeKind(\n  kind: MigrationEdgeKind,\n  palette: MigrationGraphTreeGlyphPalette,\n): string {\n  return palette.edgeArrow[kind];\n}\n\n/**\n * A node-marker glyph pair (`○◂`, `○─`, `*<`, `*-`) is the contract node\n * marker (`○` / `*`) followed by an arc connector (`◂` / `─` / `<` / `-`).\n * The marker is the signal and stays bright (`style.kind`); the connector is\n * gutter and stays dim (`style.lane`) — consistent with the plain node marker,\n * which is never dimmed.\n */\nfunction renderNodeMarkerPair(pair: string, style: MigrationListStyler): string {\n  return style.kind(pair.slice(0, 1)) + style.lane(pair.slice(1));\n}\n\nfunction renderCellPair(\n  cell: StructuralCell,\n  style: MigrationListStyler,\n  palette: MigrationGraphTreeGlyphPalette,\n): string {\n  switch (cell.kind) {\n    case 'node':\n      if (cell.arcLand === true) return renderNodeMarkerPair(palette.arcLand, style);\n      if (cell.arcTee === true) return renderNodeMarkerPair(palette.arcTee, style);\n      return style.kind(palette.node);\n    case 'vertical-pass':\n      return style.lane(palette.verticalPass);\n    case 'edge-lane':\n      // The lane stays dim; the direction arrow (↑ / ↓ / ⟲) is the signal and\n      // stays bright, like the contract-node marker.\n      return cell.ownsLabel\n        ? style.lane(palette.verticalPass.trimEnd()) +\n            style.kind(arrowForEdgeKind(cell.edgeKind, palette))\n        : style.lane(palette.verticalPass);\n    case 'branch-tee':\n      return style.lane(palette.branchTee);\n    case 'merge-tee':\n      return style.lane(palette.mergeTee);\n    case 'branch-corner':\n      return style.lane(palette.branchCorner);\n    case 'merge-corner':\n      return style.lane(palette.mergeCorner);\n    case 'arc-branch-corner':\n      return style.lane(palette.arcBranchCorner);\n    case 'arc-branch-tee':\n      return style.lane(palette.arcBranchTee);\n    case 'arc-land-corner':\n      return style.lane(palette.arcLandCorner);\n    case 'arc-crossing':\n      return style.lane(palette.arcCrossing);\n    case 'arc-land-bridge':\n      return style.lane(palette.arcLandBridge);\n    case 'horizontal-pass':\n      return style.lane(palette.horizontalPass);\n    case 'empty':\n      return '  ';\n  }\n}\n\nfunction renderConnectorRow(\n  row: MigrationGraphGridRow,\n  gridWidth: number,\n  style: MigrationListStyler,\n  palette: MigrationGraphTreeGlyphPalette,\n): string {\n  const isMerge = row.kind === 'merge-connector';\n  if (row.cells.length > 0) {\n    let seenTee = false;\n    let out = '';\n    for (const cell of row.cells) {\n      switch (cell.kind) {\n        case 'branch-tee':\n          out += style.lane(seenTee ? palette.connectorBranchTeeCo : palette.connectorBranchTee);\n          seenTee = true;\n          break;\n        case 'merge-tee':\n          out += style.lane(seenTee ? palette.connectorMergeTeeCo : palette.connectorBranchTee);\n          seenTee = true;\n          break;\n        case 'branch-corner':\n          out += style.lane(palette.branchCorner);\n          break;\n        case 'merge-corner':\n          out += style.lane(palette.mergeCorner);\n          break;\n        case 'vertical-pass':\n          out += style.lane(palette.verticalPass);\n          break;\n        case 'horizontal-pass':\n          out += style.lane(palette.horizontalPass);\n          break;\n        default:\n          out += '  ';\n      }\n    }\n    // The cells array is sized to the grid width at emit time; a back-arc lane\n    // allocated by a later row can push the grid wider afterwards, so pad any\n    // trailing columns rather than dropping the lanes that pass through here.\n    for (let column = row.cells.length; column < gridWidth; column++) {\n      out += '  ';\n    }\n    return out;\n  }\n\n  const start = row.startLane ?? 0;\n  const end = row.endLane ?? start;\n  let out = '';\n  for (let column = 0; column < gridWidth; column++) {\n    if (column < start || column > end) out += '  ';\n    else if (column === start) out += style.lane(palette.connectorBranchTee);\n    else if (column === end)\n      out += style.lane(isMerge ? palette.mergeCorner : palette.branchCorner);\n    else out += style.lane(isMerge ? palette.connectorMergeTeeCo : palette.connectorBranchTeeCo);\n  }\n  return out;\n}\n\nfunction abbreviateHash(hash: string, hashLength: number, emptySource: string): string {\n  if (hash === EMPTY_CONTRACT_HASH) {\n    return emptySource;\n  }\n  const stripped = hash.startsWith('sha256:') ? hash.slice(7) : hash;\n  return stripped.slice(0, hashLength);\n}\n\nconst MIN_HASH_DATA_COLUMN = 25;\n\nfunction overlayNamesForContract(\n  contractHash: string,\n  opts: RenderMigrationGraphTreeOptions,\n): readonly string[] {\n  const names: string[] = [];\n  const userRefs = opts.refsByHash?.get(contractHash);\n  if (userRefs) {\n    names.push(...[...userRefs].sort((a, b) => a.localeCompare(b)));\n  }\n  if (opts.dbHash === contractHash) {\n    names.push(DB_MARKER_NAME);\n  }\n  if (opts.contractHash === contractHash && contractHash !== EMPTY_CONTRACT_HASH) {\n    names.push(CONTRACT_MARKER_NAME);\n  }\n  return names;\n}\n\nfunction createTreeStyler(opts: RenderMigrationGraphTreeOptions): MigrationListStyler {\n  const base = createAnsiMigrationListStyler({ useColor: opts.colorize });\n  const activeRefName = opts.activeRefName;\n  if (!opts.colorize || activeRefName === undefined) {\n    return base;\n  }\n  return {\n    ...base,\n    refs: (names) => {\n      const styledNames = names.map((name) => (name === activeRefName ? bold(name) : name));\n      return base.refs(styledNames);\n    },\n  };\n}\n\nfunction formatEdgeHashColumn(\n  edge: ClassifiedEdge,\n  style: MigrationListStyler,\n  hashLength: number,\n  palette: MigrationGraphTreeGlyphPalette,\n): string {\n  if (edge.kind === 'self') {\n    const hash = abbreviateHash(edge.from, hashLength, palette.emptySource);\n    return `${style.sourceHash(hash)} ${style.glyph(palette.forwardArrow)} ${style.destHash(hash)}`;\n  }\n  const source =\n    edge.from === EMPTY_CONTRACT_HASH\n      ? style.glyph(palette.emptySource) +\n        ' '.repeat(Math.max(0, hashLength - palette.emptySource.length))\n      : style.sourceHash(abbreviateHash(edge.from, hashLength, palette.emptySource));\n  const arrow = style.glyph(palette.forwardArrow);\n  const dest = style.destHash(abbreviateHash(edge.to, hashLength, palette.emptySource));\n  return `${source} ${arrow} ${dest}`;\n}\n\nfunction padVisible(text: string, targetWidth: number): string {\n  const padding = Math.max(0, targetWidth - stringWidth(text));\n  return text + ' '.repeat(padding);\n}\n\nfunction gridWidthForModel(rows: readonly MigrationGraphGridRow[]): number {\n  return rows.reduce(\n    (max, row) =>\n      row.kind === 'node' || row.kind === 'edge' ? Math.max(max, row.cells.length) : max,\n    1,\n  );\n}\n\nfunction maxDirNameLength(edges: readonly ClassifiedEdge[]): number {\n  if (edges.length === 0) return 0;\n  return Math.max(...edges.map((edge) => edge.dirName.length));\n}\n\nfunction rowDirNameWidth(labelColumn: number, maxDirNameLen: number, dirNameGap: number): number {\n  return Math.max(maxDirNameLen + dirNameGap, MIN_HASH_DATA_COLUMN - labelColumn);\n}\n\nfunction gridUsesSkipRollbackArcs(rows: readonly MigrationGraphGridRow[]): boolean {\n  return rows.some((row) =>\n    row.cells.some(\n      (cell) => cell.kind === 'edge-lane' && cell.adjacency === 'node-skipping-rollback',\n    ),\n  );\n}\n\nfunction edgeLabelColumn(row: MigrationGraphGridRow, wideLabelColumn: number | undefined): number {\n  if (wideLabelColumn !== undefined) {\n    return wideLabelColumn;\n  }\n  const laneIndex = row.laneIndex ?? 0;\n  if (row.edge?.from === EMPTY_CONTRACT_HASH && laneIndex === 0) {\n    return (laneIndex + 1) * 2 + LABEL_GAP;\n  }\n  const usesFullRowGutter = row.cells.some(\n    (cell, index) => index > laneIndex && cell.kind === 'vertical-pass',\n  );\n  return usesFullRowGutter ? row.cells.length * 2 + LABEL_GAP : (laneIndex + 1) * 2 + LABEL_GAP;\n}\n\nfunction nodeHasArcDecoration(row: MigrationGraphGridRow): boolean {\n  return row.cells.some(\n    (cell) => cell.kind === 'node' && (cell.arcTee === true || cell.arcLand === true),\n  );\n}\n\nexport function renderMigrationGraphTree(\n  model: MigrationGraphGridModel,\n  opts: RenderMigrationGraphTreeOptions,\n): string {\n  const glyphMode = opts.glyphMode ?? 'unicode';\n  const palette = paletteFor(glyphMode);\n  const style = createTreeStyler(opts);\n  const hashLength = opts.hashLength ?? MIGRATION_LIST_HASH_WIDTH;\n  const gridWidth = gridWidthForModel(model.rows);\n  const wideLabelColumn = gridUsesSkipRollbackArcs(model.rows) ? gridWidth * 2 + 4 : undefined;\n  const dirNameGap = wideLabelColumn !== undefined ? 3 : LABEL_GAP;\n  const allEdges = model.rows\n    .filter(\n      (row): row is MigrationGraphGridRow & { edge: ClassifiedEdge } =>\n        row.kind === 'edge' && row.edge !== undefined,\n    )\n    .map((row) => row.edge);\n  const maxDirNameLen = maxDirNameLength(allEdges);\n\n  const lines: string[] = [];\n\n  for (let rowIndex = 0; rowIndex < model.rows.length; rowIndex++) {\n    const row = model.rows[rowIndex];\n    if (row === undefined) continue;\n\n    if (row.kind === 'component-separator') {\n      lines.push('');\n      continue;\n    }\n\n    if (row.kind === 'branch-connector' || row.kind === 'merge-connector') {\n      lines.push(renderConnectorRow(row, gridWidth, style, palette).replace(/\\s+$/, ''));\n      continue;\n    }\n\n    let gutter = row.cells.map((cell) => renderCellPair(cell, style, palette)).join('');\n    const prevRow = model.rows[rowIndex - 1];\n    let laneSpan = row.cells.length;\n    if (row.kind === 'node') {\n      const contractHash = row.contractHash ?? EMPTY_CONTRACT_HASH;\n      if (prevRow?.kind === 'merge-connector' || contractHash === EMPTY_CONTRACT_HASH) {\n        laneSpan = 1;\n      } else {\n        laneSpan = row.cells.length;\n      }\n    }\n    const labelColumn =\n      row.kind === 'edge'\n        ? edgeLabelColumn(row, wideLabelColumn)\n        : wideLabelColumn !== undefined &&\n            (nodeHasArcDecoration(row) || row.contractHash !== undefined)\n          ? wideLabelColumn\n          : laneSpan * 2 + LABEL_GAP;\n    if (\n      row.kind === 'edge' &&\n      row.edge?.from === EMPTY_CONTRACT_HASH &&\n      (row.laneIndex ?? 0) === 0\n    ) {\n      gutter = row.cells\n        .slice(0, 1)\n        .map((cell) => renderCellPair(cell, style, palette))\n        .join('');\n    } else if (row.kind === 'node' && laneSpan < row.cells.length && !nodeHasArcDecoration(row)) {\n      gutter = row.cells\n        .slice(0, laneSpan)\n        .map((cell) => renderCellPair(cell, style, palette))\n        .join('');\n    } else if (gutter.length < laneSpan * 2) {\n      gutter = gutter.padEnd(laneSpan * 2, ' ');\n    }\n    const dirNameWidth = rowDirNameWidth(labelColumn, maxDirNameLen, dirNameGap);\n    const dataColumn = labelColumn + dirNameWidth;\n    const gutterPad = padVisible(gutter, labelColumn);\n\n    if (row.kind === 'node') {\n      const contractHash = row.contractHash ?? EMPTY_CONTRACT_HASH;\n      if (contractHash === EMPTY_CONTRACT_HASH) {\n        const trailingLanes = row.cells\n          .slice(1)\n          .map((cell) => renderCellPair(cell, style, palette))\n          .join('');\n        const emptyGutter = palette.emptySource.padEnd(2, ' ') + trailingLanes;\n        const overlayNames = overlayNamesForContract(contractHash, opts);\n        if (overlayNames.length === 0) {\n          lines.push(emptyGutter.replace(/\\s+$/, ''));\n          continue;\n        }\n        const overlay = style.refs(overlayNames);\n        lines.push(`${padVisible(emptyGutter, dataColumn)}${overlay}`.replace(/\\s+$/, ''));\n        continue;\n      }\n      const hashText = style.sourceHash(\n        abbreviateHash(contractHash, hashLength, palette.emptySource),\n      );\n      const overlayNames = overlayNamesForContract(contractHash, opts);\n      const overlayPad =\n        overlayNames.length > 0\n          ? ' '.repeat(Math.max(0, dataColumn - labelColumn - stringWidth(hashText)))\n          : '';\n      const overlay = overlayNames.length > 0 ? style.refs(overlayNames) : '';\n      lines.push(`${gutterPad}${hashText}${overlayPad}${overlay}`.replace(/\\s+$/, ''));\n      continue;\n    }\n\n    const edge = row.edge;\n    if (edge === undefined) continue;\n\n    const dirNamePadding = ' '.repeat(Math.max(0, dirNameWidth - edge.dirName.length));\n    const dirName = `${style.dirName(edge.dirName)}${dirNamePadding}`;\n    const hashColumn = formatEdgeHashColumn(edge, style, hashLength, palette);\n    lines.push(`${gutterPad}${dirName}${hashColumn}`.replace(/\\s+$/, ''));\n  }\n\n  return lines.join('\\n');\n}\n","import { EMPTY_CONTRACT_HASH } from '@prisma-next/migration-tools/constants';\nimport type { MigrationGraph } from '@prisma-next/migration-tools/graph';\nimport { ok, type Result } from '@prisma-next/utils/result';\nimport { Command } from 'commander';\nimport { loadConfig } from '../config-loader';\nimport type { CliStructuredError } from '../utils/cli-errors';\nimport {\n  addGlobalOptions,\n  resolveMigrationPaths,\n  setCommandDescriptions,\n  setCommandExamples,\n  setCommandSeeAlso,\n} from '../utils/command-helpers';\nimport { buildReadAggregate } from '../utils/contract-space-aggregate-loader';\nimport { migrationGraphToRenderInput } from '../utils/formatters/graph-migration-mapper';\nimport { graphRenderer } from '../utils/formatters/graph-render';\nimport { buildMigrationGraphLayout } from '../utils/formatters/migration-graph-layout';\nimport { buildMigrationGraphRows } from '../utils/formatters/migration-graph-rows';\nimport { renderMigrationGraphTree } from '../utils/formatters/migration-graph-tree-render';\nimport { formatStyledHeader } from '../utils/formatters/styled';\nimport type { CommonCommandOptions } from '../utils/global-flags';\nimport { type GlobalFlags, parseGlobalFlagsOrExit } from '../utils/global-flags';\nimport type { StatusRef } from '../utils/migration-types';\nimport { handleResult } from '../utils/result-handler';\nimport { createTerminalUI, type TerminalUI } from '../utils/terminal-ui';\n\ninterface MigrationGraphOptions extends CommonCommandOptions {\n  readonly config?: string;\n  readonly dot?: boolean;\n  readonly tree?: boolean;\n  readonly ascii?: boolean;\n}\n\nexport interface MigrationGraphResult {\n  readonly ok: true;\n  readonly graph: MigrationGraph;\n  readonly contractHash: string | null;\n  readonly refs: readonly StatusRef[];\n  readonly summary: string;\n}\n\nexport async function executeMigrationGraphCommand(\n  options: MigrationGraphOptions,\n  flags: GlobalFlags,\n  ui: TerminalUI,\n): Promise<Result<MigrationGraphResult, CliStructuredError>> {\n  const config = await loadConfig(options.config);\n  const { configPath, appMigrationsRelative, migrationsDir } = resolveMigrationPaths(\n    options.config,\n    config,\n  );\n\n  if (!flags.json && !flags.quiet) {\n    const header = formatStyledHeader({\n      command: 'migration graph',\n      description: 'Show the migration graph topology',\n      details: [\n        { label: 'config', value: configPath },\n        { label: 'migrations', value: appMigrationsRelative },\n      ],\n      flags,\n    });\n    ui.stderr(header);\n  }\n\n  const loaded = await buildReadAggregate(config, { migrationsDir });\n  if (!loaded.ok) {\n    return loaded;\n  }\n\n  const { aggregate, contractHash } = loaded.value;\n  const graph = aggregate.app.graph();\n  const refs: readonly StatusRef[] = Object.entries(aggregate.app.refs).map(([name, entry]) => ({\n    name,\n    hash: entry.hash,\n    active: false,\n  }));\n\n  return ok({\n    ok: true,\n    graph,\n    contractHash,\n    refs,\n    summary: `${graph.nodes.size} node(s), ${graph.migrationByHash.size} edge(s)`,\n  });\n}\n\nexport function createMigrationGraphCommand(): Command {\n  const command = new Command('graph');\n  setCommandDescriptions(\n    command,\n    'Show the migration graph topology',\n    'Renders the migration graph topology. Offline — does not consult\\n' +\n      'the database. Use --tree for the condensed annotated tree\\n' +\n      '(--ascii swaps box-drawing for pipe-friendly ASCII glyphs),\\n' +\n      '--json for machine-readable output, or --dot for Graphviz DOT\\n' +\n      'format.',\n  );\n  setCommandExamples(command, [\n    'prisma-next migration graph',\n    'prisma-next migration graph --json',\n    'prisma-next migration graph --dot',\n    'prisma-next migration graph --tree',\n    'prisma-next migration graph --tree --ascii',\n  ]);\n  setCommandSeeAlso(command, [\n    { verb: 'migration status', oneLiner: 'Show migration path and pending status' },\n    { verb: 'migration log', oneLiner: 'Show executed migration history' },\n    { verb: 'migration list', oneLiner: 'List on-disk migrations' },\n    { verb: 'migration show', oneLiner: 'Display migration package contents' },\n  ]);\n  addGlobalOptions(command)\n    .option('--config <path>', 'Path to prisma-next.config.ts')\n    .option('--dot', 'Output in Graphviz DOT format')\n    .option('--tree', 'Experimental condensed annotated tree renderer')\n    .option('--ascii', 'Use ASCII glyphs for --tree (pipe-friendly)')\n    .action(async (options: MigrationGraphOptions) => {\n      const flags = parseGlobalFlagsOrExit(options);\n      const ui = createTerminalUI(flags);\n      const result = await executeMigrationGraphCommand(options, flags, ui);\n      const exitCode = handleResult(result, flags, ui, (graphResult) => {\n        // Explicit format flags win over the auto-JSON default. `flags.json`\n        // is auto-enabled when stdout is non-TTY (per CLI Style Guide §\n        // JSON Semantics); without this ordering, `migration graph --dot |\n        // dot -Tsvg` pipes JSON into the GraphViz binary, which then\n        // errors. `--dot` is the more specific instruction; honour it.\n        if (options.dot) {\n          const lines = ['digraph migrations {'];\n          for (const edge of graphResult.graph.migrationByHash.values()) {\n            const from = edge.from.slice(0, 12);\n            const to = edge.to.slice(0, 12);\n            lines.push(`  \"${from}\" -> \"${to}\" [label=\"${edge.dirName}\"];`);\n          }\n          lines.push('}');\n          ui.output(lines.join('\\n'));\n        } else if (flags.json) {\n          const nodes = [...graphResult.graph.nodes];\n          const edges = [...graphResult.graph.migrationByHash.values()].map((e) => ({\n            dirName: e.dirName,\n            from: e.from,\n            to: e.to,\n            migrationHash: e.migrationHash,\n          }));\n          ui.output(\n            JSON.stringify({ ok: true, nodes, edges, summary: graphResult.summary }, null, 2),\n          );\n        } else if (!flags.quiet) {\n          if (options.tree) {\n            const refsByHash = new Map<string, string[]>();\n            for (const ref of graphResult.refs) {\n              const existing = refsByHash.get(ref.hash);\n              refsByHash.set(ref.hash, existing ? [...existing, ref.name] : [ref.name]);\n            }\n            const rowModel = buildMigrationGraphRows(graphResult.graph, {\n              ...(graphResult.contractHash !== null\n                ? { contractHash: graphResult.contractHash }\n                : {}),\n            });\n            const layout = buildMigrationGraphLayout(rowModel);\n            const activeRef = graphResult.refs.find((ref) => ref.active);\n            const treeOutput = renderMigrationGraphTree(layout, {\n              refsByHash,\n              ...(graphResult.contractHash !== null\n                ? { contractHash: graphResult.contractHash }\n                : {}),\n              ...(activeRef !== undefined ? { activeRefName: activeRef.name } : {}),\n              colorize: flags.color !== false,\n              glyphMode: ui.resolveGlyphMode(options.ascii === true),\n            });\n            // Emit the rendered tree to stdout (same stream as flat `migration list`),\n            // not through clack's `log.message` rail: the graph is the command's\n            // result (and its own box-drawing is the only vertical structure it\n            // should carry), not a status line that needs the prompt gutter.\n            ui.output(treeOutput);\n            ui.output(`\\n${graphResult.summary}`);\n          } else {\n            const renderInput = migrationGraphToRenderInput({\n              graph: graphResult.graph,\n              mode: 'offline',\n              markerHash: undefined,\n              contractHash: graphResult.contractHash ?? EMPTY_CONTRACT_HASH,\n              refs: graphResult.refs,\n              activeRefHash: undefined,\n              activeRefName: undefined,\n              edgeStatuses: [],\n            });\n            const graphOutput = graphRenderer.render(renderInput.graph, {\n              ...renderInput.options,\n              colorize: flags.color !== false,\n            });\n            ui.log(graphOutput);\n            ui.log(`\\n${graphResult.summary}`);\n          }\n        }\n      });\n      process.exit(exitCode);\n    });\n  return command;\n}\n"],"mappings":";;;;;;;;;;;AA+DA,SAAS,aAAa,OAAoD;CACxE,OAAO,MAAM,QAAQ,MAAM,EAAE,SAAS,SAAS;AACjD;AAEA,SAAS,0BACP,OAC+B;CAC/B,MAAM,uBAAO,IAAI,IAA8B;CAC/C,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,SAAS,WAAW;EAC7B,MAAM,SAAS,KAAK,IAAI,KAAK,EAAE;EAC/B,IAAI,QAAQ,OAAO,KAAK,IAAI;OACvB,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;CAC/B;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,OAAuD;CACpF,MAAM,sBAAM,IAAI,IAAoB;CACpC,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,SAAS,aAAa,KAAK,SAAS,KAAK,IAAI;EACtD,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,CAAC;CAClD;CACA,OAAO;AACT;AAEA,SAAS,qBAAqB,OAAuD;CACnF,MAAM,wBAAQ,IAAI,IAAoB;CACtC,KAAK,MAAM,QAAQ,aAAa,KAAK,GAAG;EACtC,IAAI,KAAK,SAAS,KAAK,IAAI;EAC3B,MAAM,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,EAAE,KAAK,KAAK,CAAC;CAClD;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,6BAA6B,OAAuD;CAC3F,MAAM,0BAAU,IAAI,IAAyB;CAC7C,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,SAAS,aAAa,KAAK,SAAS,KAAK,IAAI;EACtD,MAAM,MAAM,QAAQ,IAAI,KAAK,EAAE;EAC/B,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI;OACrB,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;CAChD;CACA,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,CAAC,IAAI,QAAQ,SAAS,OAAO,IAAI,IAAI,IAAI,IAAI;CACxD,OAAO;AACT;AAEA,SAAS,gBAAgB,OAAmE;CAC1F,MAAM,aAAyB,CAAC;CAChC,IAAI,UAAoB,CAAC;CACzB,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,SAAS,MAAM;GACjB,IAAI,QAAQ,SAAS,GAAG;IACtB,WAAW,KAAK,OAAO;IACvB,UAAU,CAAC;GACb;GACA;EACF;EACA,QAAQ,KAAK,IAAI;CACnB;CACA,IAAI,QAAQ,SAAS,GAAG,WAAW,KAAK,OAAO;CAC/C,OAAO;AACT;AAMA,SAAS,yCACP,MACA,cACA,MACA,WACe;CACf,KAAK,IAAI,QAAQ,eAAe,GAAG,QAAQ,KAAK,QAAQ,SAAS;EAC/D,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,KAAA,GAAW;EACvB,IAAI,IAAI,SAAS,yBAAyB,IAAI,SAAS,oBAAoB;EAC3E,IAAI,IAAI,SAAS,mBAAmB;EACpC,IAAI,IAAI,SAAS,QAAQ;GACvB,IAAI,IAAI,cAAc,WAAW,OAAO;GACxC;EACF;EACA,IAAI,IAAI,SAAS,UAAU,IAAI,iBAAiB,KAAK,MACnD,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAS,sCACP,MACA,WACA,sBACA,oBACS;CACT,MAAM,aAAa,qBAAqB,IAAI,KAAK,EAAE,KAAK,CAAC,GAAG,QACzD,cAAc,UAAU,SAAS,SACpC;CACA,IAAI,UAAU,SAAS,GAAG,OAAO;CASjC,MAAM,WAPW,CACf,GAAG,IAAI,IACL,UACG,KAAK,aAAa,mBAAmB,IAAI,SAAS,aAAa,CAAC,EAChE,QAAQ,cAAmC,cAAc,KAAA,CAAS,CACvE,CACF,EAAE,MAAM,GAAG,MAAM,IAAI,CACG,EAAE;CAC1B,IAAI,aAAa,KAAA,GAAW,OAAO;CAEnC,OAAO,cAAc;AACvB;AAEA,SAAS,+BACP,MACA,cACA,MACA,WACA,kBACA,YACA,qBACA,sBACe;CACf,IAAI,iBAAiB;CACrB,MAAM,qBAAqB,IAAI,IAAI,gBAAgB;CAEnD,KAAK,IAAI,QAAQ,eAAe,GAAG,QAAQ,KAAK,QAAQ,SAAS;EAC/D,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,KAAA,GAAW;EACvB,IAAI,IAAI,SAAS,uBAAuB;EACxC,IAAI,IAAI,SAAS,mBAAmB;GAClC,IAAI;QACE,IAAI,iBAAiB,KAAK,MAAM,iBAAiB;GAAA,OAChD,IAAI,CAAC,wBAAwB,IAAI,iBAAiB,KAAK,MAC5D,iBAAiB;GAEnB;EACF;EACA,IAAI,IAAI,SAAS,oBAAoB;EACrC,IAAI,IAAI,SAAS,QAAQ;GACvB,IAAI,IAAI,cAAc,WAAW,OAAO;GACxC,IAAI,CAAC,wBAAwB,IAAI,SAAS,KAAA,KAAa,IAAI,KAAK,OAAO,KAAK,IAC1E,iBAAiB;GAEnB;EACF;EACA,IAAI,IAAI,SAAS,UAAU,IAAI,iBAAiB,KAAA,GAAW;GACzD,IAAI,IAAI,iBAAiB,KAAK,MAC5B,OAAO,iBAAiB,0BAA0B;GAEpD,MAAM,UAAU,WAAW,IAAI,IAAI,YAAY,KAAK;GAGpD,IAAI,CAAC,wBAAwB,CAAC,mBAAmB,IAAI,OAAO,GAC1D,iBAAiB;EAErB;CACF;CAEA,OAAO;AACT;AAEA,SAAS,wBACP,MACA,cACA,MACA,WACA,kBACA,YACA,UACA,iBACA,qBACA,sBACe;CACf,IAAI,KAAK,SAAS,QAAQ,OAAO;CAEjC,MAAM,UAAU,SAAS,IAAI,KAAK,IAAI;CACtC,MAAM,QAAQ,SAAS,IAAI,KAAK,EAAE;CAElC,IAAI,KAAK,SAAS,WAAW;EAE3B,KADiB,gBAAgB,IAAI,KAAK,EAAE,KAAK,MACjC,KAAK,YAAY,KAAA,KAAa,UAAU,KAAA,KAAa,YAAY,QAAQ,GACvF,OAAO;EAET,OAAO,+BACL,MACA,cACA,MACA,WACA,kBACA,YACA,qBACA,oBACF;CACF;CAEA,IAAI,YAAY,KAAA,KAAa,UAAU,KAAA,KAAa,UAAU,UAAU,GACtE,OAAO;CAGT,KAAK,IAAI,QAAQ,eAAe,GAAG,QAAQ,KAAK,QAAQ,SAAS;EAC/D,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,KAAA,GAAW;EACvB,IACE,IAAI,SAAS,yBACb,IAAI,SAAS,sBACb,IAAI,SAAS,mBAEb;EAEF,IAAI,IAAI,SAAS,QAAQ;EACzB,IAAI,IAAI,SAAS,QACf,OAAO,IAAI,iBAAiB,KAAK,KAAK,aAAa;CAEvD;CACA,OAAO;AACT;AAEA,SAAS,gBACP,MACA,YACA,UACA,iBACA,kBACA,OACA,oBACyB;CACzB,MAAM,uBAAuB,0BAA0B,KAAK;CAC5D,SAAS,kBAAkB,UAA8C;EACvE,MAAM,WAAW,MAAM,QACpB,SAAS,KAAK,SAAS,SAAS,QAAQ,KAAK,SAAS,aAAa,KAAK,SAAS,KAAK,EACzF;EACA,IAAI,SAAS,SAAS,GAAG,OAAO,KAAA;EAChC,MAAM,QAAQ,SAAS,WAAW,UAAU,MAAM,kBAAkB,SAAS,aAAa;EAC1F,OAAO,SAAS,IAAI,QAAQ,KAAA;CAC9B;CAEA,OAAO,KAAK,KAAK,KAAK,aAAa;EACjC,IAAI,IAAI,SAAS,UAAU,IAAI,SAAS,KAAA,KAAa,IAAI,cAAc,KAAA,GACrE,OAAO;EAET,MAAM,uBACJ,IAAI,KAAK,SAAS,aAClB,EAAE,IAAI,uBAAuB,WAC5B,iBAAiB,IAAI,IAAI,KAAK,IAAI,KAAK,MAAM,KAC9C,kBAAkB,IAAI,IAAI,MAAM,KAAA;EAClC,MAAM,YACJ,IAAI,wBAAwB,QAC5B,sCACE,IAAI,MACJ,IAAI,WACJ,sBACA,kBACF,IACI,yCAAyC,MAAM,UAAU,IAAI,MAAM,IAAI,SAAS,IAChF,wBACE,MACA,UACA,IAAI,MACJ,IAAI,WACJ,IAAI,oBAAoB,CAAC,GACzB,YACA,UACA,iBACA,IAAI,uBAAuB,OAC3B,oBACF;EACN,OAAO;GACL,GAAG;GACH,OAAO,eACL,IAAI,MACJ,IAAI,WACJ,IAAI,oBAAoB,CAAC,GACzB,WACA,IAAI,MAAM,MACZ;EACF;CACF,CAAC;AACH;AAEA,SAAS,sBACP,MACA,UACe;CACf,IAAI,KAAK,SAAS,QAAQ,OAAO;CAEjC,MAAM,UAAU,SAAS,IAAI,KAAK,IAAI;CACtC,MAAM,QAAQ,SAAS,IAAI,KAAK,EAAE;CAClC,IAAI,YAAY,KAAA,KAAa,UAAU,KAAA,GAAW,OAAO;CAEzD,IAAI,KAAK,SAAS,WAAW;EAC3B,IAAI,SAAS,SAAS,OAAO;EAC7B,OAAO,YAAY,QAAQ,IAAI,aAAa;CAC9C;CAEA,IAAI,SAAS,SAAS,OAAO;CAC7B,OAAO,UAAU,UAAU,IAAI,aAAa;AAC9C;AAMA,SAAS,WAAW,OAAiC;CACnD,OAAO,MAAM,KAAK,EAAE,QAAQ,MAAM,UAAU,EAAE,MAAM,QAAiB,EAAE;AACzE;AAEA,SAAS,0BACP,WACA,SACA,aACA,WACkB;CAClB,MAAM,QAAQ,WAAW,SAAS;CAClC,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,YAAY,IAAI,IAAI,MAAM,OAAO,aAAa,OAAO,UAAU;GACjE,MAAM,QAAQ,EAAE,MAAM,gBAAgB;GACtC;EACF;EACA,IAAI,SAAS,WACX,MAAM,QAAQ,EAAE,MAAM,aAAa;OAC9B,IAAI,SAAS,SAClB,MAAM,QAAQ,EAAE,MAAM,gBAAgB;OACjC,IAAI,OAAO,aAAa,OAAO,SACpC,MAAM,QAAQ,EAAE,MAAM,aAAa;CAEvC;CACA,OAAO;AACT;AAEA,SAAS,yBACP,WACA,SACA,aACA,WACkB;CAClB,MAAM,QAAQ,WAAW,SAAS;CAClC,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,YAAY,IAAI,IAAI,MAAM,OAAO,aAAa,OAAO,UAAU;GACjE,MAAM,QAAQ,EAAE,MAAM,gBAAgB;GACtC;EACF;EACA,IAAI,SAAS,WACX,MAAM,QAAQ,EAAE,MAAM,YAAY;OAC7B,IAAI,SAAS,SAClB,MAAM,QAAQ,EAAE,MAAM,eAAe;OAChC,IAAI,OAAO,aAAa,OAAO,SACpC,MAAM,QAAQ,YAAY,IAAI,IAAI,IAAI,EAAE,MAAM,YAAY,IAAI,EAAE,MAAM,kBAAkB;CAE5F;CACA,OAAO;AACT;AAEA,SAAS,eACP,cACA,YACA,aACA,WACkB;CAClB,MAAM,QAAQ,WAAW,SAAS;CAClC,KAAK,MAAM,QAAQ,aACjB,IAAI,SAAS,cAAc,OAAO,WAChC,MAAM,QAAQ,EAAE,MAAM,gBAAgB;CAG1C,IAAI,aAAa,WACf,MAAM,cAAc;EAAE,MAAM;EAAQ;CAAa;CAEnD,OAAO;AACT;AAEA,SAAS,eACP,MACA,WACA,kBACA,WACA,WACkB;CAClB,MAAM,QAAQ,WAAW,SAAS;CAClC,KAAK,MAAM,QAAQ,kBACjB,IAAI,OAAO,WAAW,MAAM,QAAQ,EAAE,MAAM,gBAAgB;CAE9D,IAAI,YAAY,WACd,MAAM,aAAa;EACjB,MAAM;EACN,eAAe,KAAK;EACpB,UAAU,KAAK;EACf,WAAW;EACX;CACF;CAEF,OAAO;AACT;;;;;;;;;AAcA,SAAS,qBACP,gBACA,iBACA,iBACU;CACV,MAAM,QAAQ;CACd,MAAM,OAAO;CACb,MAAM,QAAQ;CACd,MAAM,wBAAQ,IAAI,IAAoB;CACtC,KAAK,MAAM,QAAQ,gBAAgB,MAAM,IAAI,MAAM,KAAK;CAExD,MAAM,aAAa,UACjB,CAAC,GAAG,KAAK,EAAE,MAAM,GAAG,MAAM;EACxB,IAAI,MAAM,qBAAqB,OAAO;EACtC,IAAI,MAAM,qBAAqB,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;CAEH,IAAI,QAAQ,UAAU,eAAe,QAAQ,OAAO,gBAAgB,IAAI,CAAC,KAAK,OAAO,CAAC,CAAC;CACvF,IAAI,MAAM,WAAW,GAAG,QAAQ,UAAU,cAAc;CAExD,MAAM,SAAmB,CAAC;CAQ1B,SAAS,OAAO,MAAoB;EAClC,IAAI,MAAM,IAAI,IAAI,MAAM,OAAO;EAC/B,MAAM,QAAiB,CAAC;GAAE,MAAM;GAAM,UAAU,gBAAgB,IAAI,IAAI,KAAK,CAAC;GAAG,OAAO;EAAE,CAAC;EAC3F,MAAM,IAAI,MAAM,IAAI;EAEpB,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,QAAQ,MAAM,MAAM,SAAS;GACnC,IAAI,UAAU,KAAA,GAAW;GACzB,IAAI,MAAM,SAAS,MAAM,SAAS,QAAQ;IACxC,MAAM,IAAI,MAAM,MAAM,KAAK;IAC3B,OAAO,KAAK,MAAM,IAAI;IACtB,MAAM,IAAI;IACV;GACF;GACA,MAAM,QAAQ,MAAM,SAAS,MAAM;GACnC,MAAM,SAAS;GACf,IAAI,UAAU,KAAA,GAAW;GACzB,IAAI,MAAM,IAAI,MAAM,EAAE,MAAM,OAAO;IACjC,MAAM,IAAI,MAAM,IAAI,IAAI;IACxB,MAAM,KAAK;KAAE,MAAM,MAAM;KAAI,UAAU,gBAAgB,IAAI,MAAM,EAAE,KAAK,CAAC;KAAG,OAAO;IAAE,CAAC;GACxF;EACF;CACF;CAEA,KAAK,MAAM,QAAQ,OAAO,OAAO,IAAI;CAGrC,KAAK,MAAM,QAAQ,gBACjB,IAAI,MAAM,IAAI,IAAI,MAAM,OAAO,OAAO,IAAI;CAG5C,OAAO;AACT;AAWA,SAAS,aACP,MACA,UACmD;CACnD,MAAM,MAAM,SAAS,IAAI,KAAK,IAAI,KAAK;CAEvC,OAAO;EAAE;EAAK,QADC,SAAS,IAAI,KAAK,EAAE,KAAK;CACnB;AACvB;AAEA,SAAS,aACP,GACA,GACS;CACT,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE;AACzC;AAEA,SAAS,eACP,MACA,qBACQ;CACR,IAAI,MAAM;CACV,KAAK,MAAM,OAAO,MAAM;EACtB,IACE,IAAI,SAAS,UACb,IAAI,SAAS,KAAA,KACb,oBAAoB,IAAI,IAAI,KAAK,aAAa,GAE9C;EAEF,MAAM,KAAK,IAAI,KAAK,IAAI,aAAa,CAAC;EACtC,KAAK,MAAM,QAAQ,IAAI,oBAAoB,CAAC,GAC1C,MAAM,KAAK,IAAI,KAAK,IAAI;EAE1B,IAAI,IAAI,cAAc,KAAA,GACpB,MAAM,KAAK,IAAI,KAAK,IAAI,WAAW,IAAI,WAAW,IAAI,SAAS;CAEnE;CACA,OAAO;AACT;AAEA,SAAS,8BACP,eACA,UACA,YACqB;CACrB,MAAM,SAAS,CAAC,GAAG,aAAa,EAAE,MAAM,GAAG,MAAM;EAC/C,MAAM,OAAO,SAAS,IAAI,EAAE,IAAI,KAAK;EACrC,MAAM,OAAO,SAAS,IAAI,EAAE,IAAI,KAAK;EACrC,IAAI,SAAS,MAAM,OAAO,OAAO;EACjC,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO;CAC1C,CAAC;CAED,MAAM,WAAuF,CAAC;CAC9F,MAAM,wBAAQ,IAAI,IAAoB;CACtC,IAAI,WAAW,aAAa;CAE5B,KAAK,MAAM,QAAQ,QAAQ;EACzB,MAAM,OAAO,aAAa,MAAM,QAAQ;EACxC,IAAI,OAAO;EACX,OAAO,SAAS,MAAM,UAAU,MAAM,SAAS,QAAQ,aAAa,OAAO,IAAI,CAAC,GAC9E,QAAQ;EAEV,SAAS,KAAK;GAAE,GAAG;GAAM;EAAK,CAAC;EAC/B,MAAM,IAAI,KAAK,eAAe,IAAI;EAClC,WAAW,KAAK,IAAI,UAAU,OAAO,CAAC;CACxC;CAEA,OAAO;AACT;AAEA,SAAS,iBAAiB,MAAwC,cAA8B;CAC9F,OAAO,KAAK,WAAW,QAAQ,IAAI,SAAS,UAAU,IAAI,iBAAiB,YAAY;AACzF;AAEA,SAAS,iBAAiB,MAAwC,eAA+B;CAC/F,OAAO,KAAK,WAAW,QAAQ,IAAI,SAAS,UAAU,IAAI,MAAM,kBAAkB,aAAa;AACjG;AAOA,SAAS,gBAAgB,OAAyB,OAAqB;CACrE,OAAO,MAAM,SAAS,OACpB,MAAM,KAAK,EAAE,MAAM,QAAQ,CAAC;AAEhC;AAEA,SAAS,SAAS,KAA4C;CAC5D,OAAO;EAAE,GAAG;EAAK,OAAO,CAAC,GAAG,IAAI,KAAK;CAAE;AACzC;AAEA,SAAS,gBACP,OACA,UACA,MACS;CACT,MAAM,YAAY,iBAAiB,MAAM,MAAM,KAAK,IAAI;CACxD,MAAM,YAAY,iBAAiB,MAAM,MAAM,KAAK,EAAE;CACtD,IAAI,YAAY,KAAK,YAAY,GAAG,OAAO;CAC3C,OAAO,WAAW,aAAa,YAAY;AAC7C;AAEA,SAAS,yBACP,MACA,eACA,UACA,YACA,YACyB;CACzB,IAAI,cAAc,WAAW,GAAG,OAAO,CAAC,GAAG,IAAI;CAG/C,MAAM,aAAa,eAAe,MAAM,IADjB,IAAI,cAAc,KAAK,SAAS,KAAK,aAAa,CACxB,CAAC;CAClD,MAAM,iBAAiB,8BAA8B,eAAe,UAAU,UAAU;CACxF,MAAM,SAA8B,cAAc,KAAK,UAAU;EAC/D;EACA,UAAU,eAAe,IAAI,KAAK,aAAa,KAAK,aAAa;CACnE,EAAE;CAEF,MAAM,SAAS,KAAK,IAAI,QAAQ;CAEhC,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,EAAE,MAAM,aAAa;EAC3B,MAAM,UAAU,WAAW,IAAI,KAAK,IAAI,KAAK;EAC7C,MAAM,YAAY,WAAW,IAAI,KAAK,EAAE,KAAK;EAC7C,MAAM,iBAAiB,iBAAiB,QAAQ,KAAK,IAAI;EACzD,MAAM,iBAAiB,iBAAiB,QAAQ,KAAK,EAAE;EACvD,MAAM,eAAe,iBAAiB,QAAQ,KAAK,aAAa;EAChE,IAAI,iBAAiB,KAAK,iBAAiB,KAAK,eAAe,GAAG;EAElE,WAAW,IAAI,KAAK,eAAe,QAAQ;EAK3C,MAAM,iBAAiB,OACpB,QAAQ,UAAU,MAAM,KAAK,SAAS,KAAK,IAAI,EAC/C,KAAK,UAAU,MAAM,QAAQ;EAChC,MAAM,mBAAmB,KAAK,IAAI,GAAG,cAAc;EAEnD,MAAM,YAAY,OAAO;EACzB,IAAI,cAAc,KAAA,GAAW;GAC3B,MAAM,QAAQ,UAAU;GACxB,gBAAgB,OAAO,WAAW,CAAC;GAEnC,MAAM,WAAW;IAAE,MAAM;IAAQ,cADZ,UAAU,gBAAgB;IACA,QAAQ;GAAK;GAC5D,KAAK,IAAI,OAAO,UAAU,GAAG,OAAO,UAAU,QAAQ,GAAG;IACvD,IAAI,eAAe,SAAS,IAAI,GAAG;KACjC,MAAM,QAAQ,EAAE,MAAM,iBAAiB;KACvC;IACF;IACA,MAAM,WAAW,MAAM;IAcvB,MAAM,QAZJ,aAAa,KAAA,KACb,SAAS,SAAS,WAClB,SAAS,SAAS,qBAClB,SAAS,SAAS,qBAGlB,OAAO,MACJ,UACC,MAAM,KAAK,kBAAkB,KAAK,iBAClC,MAAM,aAAa,QACnB,gBAAgB,OAAO,gBAAgB,MAAM,CACjD,IACsB,EAAE,MAAM,eAAe,IAAI,EAAE,MAAM,kBAAkB;GAC/E;GACA,MAAM,YACJ,WAAW,mBAAmB,EAAE,MAAM,iBAAiB,IAAI,EAAE,MAAM,oBAAoB;EAC3F;EAEA,MAAM,UAAU,OAAO;EACvB,IAAI,YAAY,KAAA,GAAW;GAGzB,MAAM,QAAQ,QAAQ;GACtB,gBAAgB,OAAO,WAAW,CAAC;GACnC,MAAM,WAAW,EAAE,MAAM,gBAAgB;GACzC,MAAM,YAAY;IAChB,MAAM;IACN,eAAe,KAAK;IACpB,UAAU,KAAK;IACf,WAAW;IACX,WAAW;GACb;GACA,OAAO,gBAAgB;IAAE,GAAG;IAAS,WAAW;IAAU,kBAAkB,CAAC,OAAO;GAAE;EACxF;EAMA,KAAK,IAAI,QAAQ,iBAAiB,GAAG,QAAQ,gBAAgB,SAAS,GAAG;GACvE,IAAI,UAAU,cAAc;GAC5B,MAAM,MAAM,OAAO;GACnB,IAAI,QAAQ,KAAA,GAAW;GACvB,MAAM,QAAQ,IAAI;GAClB,gBAAgB,OAAO,WAAW,CAAC;GACnC,MAAM,WAAW,MAAM;GACvB,IACE,UAAU,SAAS,qBACnB,UAAU,SAAS,qBACnB,UAAU,SAAS,uBACnB,UAAU,SAAS,oBACnB,UAAU,SAAS,gBAEnB,MAAM,YAAY,EAAE,MAAM,gBAAgB;EAE9C;EAEA,MAAM,YAAY,OAAO;EACzB,IAAI,cAAc,KAAA,GAAW;GAC3B,MAAM,QAAQ,UAAU;GACxB,gBAAgB,OAAO,WAAW,CAAC;GAEnC,MAAM,aAAa;IAAE,MAAM;IAAQ,cADd,UAAU,gBAAgB;IACE,SAAS;GAAK;GAC/D,KAAK,IAAI,OAAO,YAAY,GAAG,OAAO,UAAU,QAAQ,GAAG;IAIzD,MAAM,WAAW,MAAM;IAcvB,MAAM,QAZJ,aAAa,KAAA,KACb,SAAS,SAAS,WAClB,SAAS,SAAS,qBAClB,SAAS,SAAS,qBAGlB,OAAO,MACJ,UACC,MAAM,KAAK,kBAAkB,KAAK,iBAClC,MAAM,aAAa,QACnB,gBAAgB,OAAO,gBAAgB,MAAM,CACjD,IACsB,EAAE,MAAM,eAAe,IAAI,EAAE,MAAM,kBAAkB;GAC/E;GACA,MAAM,YAAY,EAAE,MAAM,kBAAkB;GAC5C,KAAK,MAAM,SAAS,QAAQ;IAC1B,IAAI,MAAM,YAAY,UAAU;IAChC,IAAI,CAAC,gBAAgB,OAAO,gBAAgB,MAAM,GAAG;IACrD,gBAAgB,OAAO,MAAM,WAAW,CAAC;IACzC,MAAM,WAAW,MAAM,MAAM;IAC7B,IACE,UAAU,SAAS,qBACnB,UAAU,SAAS,qBACnB,UAAU,SAAS,QAEnB,MAAM,MAAM,YAAY,EAAE,MAAM,gBAAgB;GAEpD;EACF;CACF;CAEA,OAAO;AACT;AAEA,SAAS,6BACP,OACA,UACkB;CAClB,OAAO,MAAM,QACV,SACC,KAAK,SAAS,cACd,sBAAsB,MAAM,QAAQ,MAAM,wBAC9C;AACF;AAWA,SAAS,gBACP,gBACA,UAKA;CACA,MAAM,eAAe,IAAI,IAAI,cAAc;CAC3C,MAAM,QAAQ,SAAS,QAAQ,MAAM,aAAa,IAAI,EAAE,IAAI,KAAK,aAAa,IAAI,EAAE,EAAE,CAAC;CAEvF,MAAM,kCAAkB,IAAI,IAA8B;CAC1D,MAAM,gCAAgB,IAAI,IAA8B;CACxD,MAAM,kCAAkB,IAAI,IAA8B;CAC1D,MAAM,6BAAa,IAAI,IAA8B;CACrD,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,SAAS,UAAU,KAAK,SAAS,KAAK,IAAI;GACjD,MAAM,SAAS,WAAW,IAAI,KAAK,IAAI;GACvC,IAAI,QAAQ,OAAO,KAAK,IAAI;QACvB,WAAW,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;GACrC;EACF;EACA,IAAI,KAAK,SAAS,WAAW;GAC3B,MAAM,WAAW,gBAAgB,IAAI,KAAK,IAAI;GAC9C,IAAI,UAAU,SAAS,KAAK,IAAI;QAC3B,gBAAgB,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;GAC1C,MAAM,YAAY,cAAc,IAAI,KAAK,EAAE;GAC3C,IAAI,WAAW,UAAU,KAAK,IAAI;QAC7B,cAAc,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;GACtC;EACF;EAEA,MAAM,SAAS,gBAAgB,IAAI,KAAK,IAAI;EAC5C,IAAI,QAAQ,OAAO,KAAK,IAAI;OACvB,gBAAgB,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;CAC5C;CAEA,MAAM,kBAAkB,qBAAqB,KAAK;CAClD,MAAM,mBAAmB,sBAAsB,KAAK;CACpD,MAAM,0BAA0B,6BAA6B,KAAK;CAElE,MAAM,QAAQ,qBAAqB,gBAAgB,iBAAiB,eAAe;CACnF,MAAM,2BAAW,IAAI,IAAoB;CACzC,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;EACjD,MAAM,OAAO,MAAM;EACnB,IAAI,SAAS,KAAA,GAAW,SAAS,IAAI,MAAM,KAAK;CAClD;CAEA,MAAM,QAA2B,CAAC;CAClC,MAAM,OAAgC,CAAC;CACvC,MAAM,6BAAa,IAAI,IAAoB;CAC3C,MAAM,6BAAa,IAAI,IAAoB;CAC3C,MAAM,qCAAqB,IAAI,IAAoB;CACnD,IAAI,YAAY;CAEhB,SAAS,gBAAgB,UAAwB;EAC/C,IAAI,WAAW,WAAW,YAAY;CACxC;CAEA,SAAS,QAAQ,OAAe,MAA2B;EACzD,OAAO,MAAM,UAAU,OAAO,MAAM,KAAK,IAAI;EAC7C,MAAM,SAAS;EACf,IAAI,SAAS,MAAM,gBAAgB,QAAQ,CAAC;CAC9C;CAEA,SAAS,oBAA8B;EACrC,MAAM,UAAoB,CAAC;EAC3B,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SACxC,IAAI,MAAM,WAAW,MAAM,QAAQ,KAAK,KAAK;EAE/C,OAAO;CACT;CAEA,SAAS,kBAAkB,MAAwB;EACjD,OAAO,kBAAkB,EAAE,QAAQ,UAAU,UAAU,IAAI;CAC7D;CAEA,SAAS,mBAA2B;EAClC,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SACxC,IAAI,MAAM,WAAW,MAAM,OAAO;EAEpC,OAAO,MAAM;CACf;CAEA,SAAS,aAAa,UAA4B;EAChD,MAAM,UAAoB,CAAC;EAC3B,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SACxC,IAAI,MAAM,WAAW,UAAU,QAAQ,KAAK,KAAK;EAEnD,OAAO;CACT;CAEA,SAAS,mBAAmB,cAAsB,aAAwC;EACxF,MAAM,YAAY,KAAK,IAAI,GAAG,WAAW;EACzC,MAAM,UAAU,KAAK,IAAI,GAAG,WAAW;EACvC,gBAAgB,UAAU,CAAC;EAC3B,MAAM,cAAc,IAAI,IAAI,kBAAkB,CAAC;EAC/C,KAAK,KAAK;GACR,MAAM;GACN;GACA;GACA;GACA,aAAa,YAAY;GACzB,OAAO,yBAAyB,WAAW,SAAS,aAAa,SAAS;EAC5E,CAAC;EACD,KAAK,MAAM,SAAS,aAClB,IAAI,UAAU,WAAW,QAAQ,OAAO,IAAI;EAE9C,OAAO;CACT;CAEA,SAAS,oBACP,cACA,WACA,SACA,aACM;EACN,gBAAgB,UAAU,CAAC;EAC3B,MAAM,cAAc,IAAI,IAAI,kBAAkB,CAAC;EAC/C,KAAK,KAAK;GACR,MAAM;GACN;GACA;GACA;GACA;GACA,OAAO,0BAA0B,WAAW,SAAS,aAAa,SAAS;EAC7E,CAAC;CACH;CAEA,SAAS,YAAY,MAAsB,MAAc,qBAAoC;EAC3F,MAAM,cAAc,kBAAkB,IAAI;EAC1C,MAAM,YAAY,sBAAsB,MAAM,QAAQ;EACtD,gBAAgB,KAAK,IAAI,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC;EACrD,MAAM,MAA6B;GACjC,MAAM;GACN;GACA,WAAW;GACX,kBAAkB;GAClB,OAAO,eAAe,MAAM,MAAM,aAAa,WAAW,SAAS;EACrE;EACA,KAAK,KAAK,sBAAsB;GAAE,GAAG;GAAK,qBAAqB;EAAK,IAAI,GAAG;EAC3E,WAAW,IAAI,KAAK,eAAe,IAAI;EACvC,IAAI,qBAAqB,mBAAmB,IAAI,KAAK,eAAe,IAAI;CAC1E;CAEA,SAAS,YAAY,cAAsB,QAAsB;EAC/D,gBAAgB,SAAS,CAAC;EAC1B,MAAM,cAAc,kBAAkB,EAAE,QAAQ,UAAU,UAAU,MAAM;EAC1E,KAAK,KAAK;GACR,MAAM;GACN;GACA,OAAO,eAAe,cAAc,QAAQ,aAAa,SAAS;EACpE,CAAC;EACD,WAAW,IAAI,cAAc,MAAM;CACrC;CAEA,SAAS,eAAe,MAA+B;EACrD,MAAM,2BAAW,IAAI,IAA2B;EAChD,KAAK,MAAM,YAAY,cAAc,IAAI,IAAI,KAAK,CAAC,GAAG;GACpD,MAAM,QAAQ,SAAS,IAAI,SAAS,IAAI;GACxC,IAAI,OAAO,MAAM,MAAM,KAAK,QAAQ;QAC/B,SAAS,IAAI,SAAS,MAAM;IAAE,QAAQ,SAAS;IAAM,OAAO,CAAC,QAAQ;GAAE,CAAC;EAC/E;EACA,MAAM,SAAS,CAAC,GAAG,SAAS,OAAO,CAAC;EAGpC,OAAO,MAAM,GAAG,OAAO,SAAS,IAAI,EAAE,MAAM,KAAK,MAAM,SAAS,IAAI,EAAE,MAAM,KAAK,EAAE;EACnF,KAAK,MAAM,SAAS,QAClB,MAAM,MAAM,MAAM,GAAG,MAAM,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;EAE/D,OAAO;CACT;CAEA,SAAS,YAAY,MAAoB;EACvC,MAAM,UAAU,aAAa,IAAI;EACjC,IAAI;EACJ,IAAI,QAAQ,UAAU,GACpB,SAAS,mBAAmB,MAAM,OAAO;OACpC,IAAI,QAAQ,WAAW,GAC5B,SAAS,QAAQ,MAAM;OAEvB,SAAS,iBAAiB;EAI5B,MAAM,YAAY,CAAC,GAAI,WAAW,IAAI,IAAI,KAAK,CAAC,CAAE,EAAE,MAAM,GAAG,MAC3D,EAAE,QAAQ,cAAc,EAAE,OAAO,CACnC;EACA,KAAK,MAAM,YAAY,WAAW,YAAY,UAAU,QAAQ,KAAK;EAErE,YAAY,MAAM,MAAM;EAExB,MAAM,YAAY,CAAC,GAAI,gBAAgB,IAAI,IAAI,KAAK,CAAC,CAAE,EAAE,MAAM,GAAG,MAChE,EAAE,QAAQ,cAAc,EAAE,OAAO,CACnC;EACA,MAAM,gBAAkC,CAAC;EACzC,MAAM,oBAAsC,CAAC;EAC7C,KAAK,MAAM,YAAY,WACrB,IAAI,sBAAsB,UAAU,QAAQ,MAAM,0BAChD,cAAc,KAAK,QAAQ;OAE3B,kBAAkB,KAAK,QAAQ;EAGnC,KAAK,MAAM,YAAY,eACrB,YAAY,UAAU,QAAQ,KAAK;EAGrC,MAAM,SAAS,eAAe,IAAI;EAClC,MAAM,iBAAiB,wBAAwB,IAAI,IAAI,KAAK,MAAM;EAClE,MAAM,eAAyB,CAAC;EAChC,KAAK,IAAI,aAAa,GAAG,aAAa,OAAO,QAAQ,cAAc;GACjE,MAAM,QAAQ,OAAO;GACrB,IAAI,UAAU,KAAA,GAAW;GACzB,MAAM,OAAO,eAAe,IAAI,SAAS,iBAAiB;GAC1D,aAAa,cAAc;GAC3B,QAAQ,MAAM,MAAM,MAAM;EAC5B;EAEA,IAAI,OAAO,UAAU,GAAG;GACtB,MAAM,UAAU,KAAK,IAAI,GAAG,YAAY;GACxC,oBAAoB,MAAM,QAAQ,SAAS,OAAO,MAAM;EAC1D;EAEA,KAAK,IAAI,aAAa,GAAG,aAAa,OAAO,QAAQ,cAAc;GACjE,MAAM,QAAQ,OAAO;GACrB,MAAM,OAAO,aAAa;GAC1B,IAAI,UAAU,KAAA,KAAa,SAAS,KAAA,GAAW;GAC/C,KAAK,MAAM,QAAQ,MAAM,OACvB,YAAY,MAAM,MAAM,aAAa;EAEzC;EAEA,KAAK,MAAM,YAAY,mBACrB,YAAY,UAAU,QAAQ,KAAK;EAGrC,IAAI,OAAO,WAAW,GAEpB,QAAQ,QAAQ,IAAI;CAExB;CAEA,KAAK,MAAM,QAAQ,OAAO,YAAY,IAAI;CAc1C,OAAO;EACL,MAHa,yBAVC,gBACd,MACA,YACA,UACA,iBACA,kBACA,OACA,kBAG4C,GADxB,6BAA6B,OAAO,QACG,GAAG,UAAU,YAAY,UAGzE;EACX;EACA;CACF;AACF;AAEA,SAAgB,0BACd,UACyB;CACzB,IAAI,SAAS,MAAM,WAAW,GAC5B,OAAO;EAAE,MAAM,CAAC;EAAG,4BAAY,IAAI,IAAI;EAAG,4BAAY,IAAI,IAAI;CAAE;CAGlE,MAAM,aAAa,gBAAgB,SAAS,KAAK;CACjD,MAAM,UAAmC,CAAC;CAC1C,MAAM,6BAAa,IAAI,IAAoB;CAC3C,MAAM,6BAAa,IAAI,IAAoB;CAE3C,KAAK,IAAI,iBAAiB,GAAG,iBAAiB,WAAW,QAAQ,kBAAkB;EACjF,IAAI,iBAAiB,GACnB,QAAQ,KAAK;GAAE,MAAM;GAAuB,OAAO,CAAC;EAAE,CAAC;EAGzD,MAAM,YAAY,WAAW;EAC7B,IAAI,cAAc,KAAA,KAAa,UAAU,WAAW,GAAG;EAEvD,MAAM,SAAS,gBAAgB,WAAW,SAAS,KAAK;EACxD,QAAQ,KAAK,GAAG,OAAO,IAAI;EAC3B,KAAK,MAAM,CAAC,MAAM,WAAW,OAAO,YAAY,WAAW,IAAI,MAAM,MAAM;EAC3E,KAAK,MAAM,CAAC,MAAM,WAAW,OAAO,YAAY,WAAW,IAAI,MAAM,MAAM;CAC7E;CAEA,OAAO;EAAE,MAAM;EAAS;EAAY;CAAW;AACjD;;;;;;;;ACriCA,SAAS,0BAA0B,OAAuD;CACxF,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,4BAAY,IAAI,IAAsB;CAE5C,SAAS,YAAY,GAAW,GAAiB;EAC/C,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;CAC3B;CAEA,KAAK,MAAM,SAAS,MAAM,aAAa,OAAO,GAC5C,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,SAAS,KAAK,IACrB,YAAY,KAAK,MAAM,KAAK,EAAE;CAMpC,KAAK,MAAM,QAAQ,MAAM,OACvB,IAAI,CAAC,UAAU,IAAI,IAAI,GACrB,UAAU,IAAI,MAAM,CAAC,CAAC;CAI1B,MAAM,aAA4B,CAAC;CAEnC,SAAS,aAAa,OAA4B;EAChD,MAAM,4BAAY,IAAI,IAAY;EAClC,MAAM,QAAQ,CAAC,KAAK;EACpB,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,OAAO,MAAM,MAAM;GACzB,IAAI,SAAS,KAAA,KAAa,QAAQ,IAAI,IAAI,GAAG;GAC7C,QAAQ,IAAI,IAAI;GAChB,UAAU,IAAI,IAAI;GAClB,KAAK,MAAM,YAAY,UAAU,IAAI,IAAI,KAAK,CAAC,GAC7C,IAAI,CAAC,QAAQ,IAAI,QAAQ,GACvB,MAAM,KAAK,QAAQ;EAGzB;EACA,OAAO;CACT;CAGA,MAAM,WAAW,CAAC,GAAG,MAAM,KAAK,EAAE,MAAM,GAAG,MAAM;EAC/C,IAAI,MAAM,qBAAqB,OAAO;EACtC,IAAI,MAAM,qBAAqB,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;CAED,KAAK,MAAM,QAAQ,UACjB,IAAI,CAAC,QAAQ,IAAI,IAAI,GACnB,WAAW,KAAK,aAAa,IAAI,CAAC;CAKtC,WAAW,MAAM,GAAG,MAAM;EACxB,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,EAAE,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,EAAE,MAAM;EAC7D,MAAM,OAAO,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,EAAE,MAAM;EAC7D,OAAO,KAAK,cAAc,IAAI;CAChC,CAAC;CAED,OAAO;AACT;AAMA,SAAS,wBACP,gBACA,UACmB;CACnB,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,QAAQ,gBACjB,KAAK,SAAS,gBAAgB,IAAI,IAAI,KAAK,OAAO,GAChD,MAAM,KAAK,IAAI;CAGnB,MAAM,MAAM,GAAG,MAAM;EACnB,IAAI,MAAM,qBAAqB,OAAO;EACtC,IAAI,MAAM,qBAAqB,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;CACD,IAAI,MAAM,SAAS,GAAG,OAAO;CAE7B,OAAO,CAAC,GAAG,cAAc,EAAE,MAAM,GAAG,MAAM;EACxC,IAAI,MAAM,qBAAqB,OAAO;EACtC,IAAI,MAAM,qBAAqB,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;AACH;AAEA,SAAS,sBAAsB,GAAW,GAAW,MAA2C;CAC9F,MAAM,QAAQ,KAAK,IAAI,CAAC,KAAK;CAC7B,MAAM,QAAQ,KAAK,IAAI,CAAC,KAAK;CAC7B,IAAI,UAAU,OAAO,OAAO,QAAQ;CACpC,IAAI,MAAM,qBAAqB,OAAO;CACtC,IAAI,MAAM,qBAAqB,OAAO;CACtC,OAAO,EAAE,cAAc,CAAC;AAC1B;;;;;;;;AASA,SAAS,+BACP,gBACA,UACA,OACmB;CACnB,MAAM,6BAAa,IAAI,IAAsB;CAE7C,KAAK,MAAM,QAAQ,gBACjB,WAAW,IAAI,MAAM,CAAC,CAAC;CAGzB,KAAK,MAAM,SAAS,MAAM,aAAa,OAAO,GAC5C,KAAK,MAAM,QAAQ,OAAO;EACxB,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;CACjC;CAGF,MAAM,QAAQ,wBAAwB,gBAAgB,QAAQ;CAC9D,MAAM,uBAAO,IAAI,IAAoB;CACrC,KAAK,MAAM,QAAQ,OACjB,KAAK,IAAI,MAAM,CAAC;CAGlB,MAAM,YAAY,eAAe;CACjC,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,UAAU;EACd,KAAK,MAAM,QAAQ,gBAAgB;GACjC,MAAM,OAAO,KAAK,IAAI,IAAI;GAC1B,IAAI,SAAS,KAAA,GAAW;GACxB,KAAK,MAAM,MAAM,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG;IAC3C,MAAM,OAAO,OAAO;IAEpB,IAAI,QADS,KAAK,IAAI,EAAE,KAAK,KACZ;KACf,KAAK,IAAI,IAAI,IAAI;KACjB,UAAU;IACZ;GACF;EACF;EACA,IAAI,CAAC,SAAS;CAChB;CAEA,KAAK,MAAM,QAAQ,gBACjB,IAAI,CAAC,KAAK,IAAI,IAAI,GAChB,KAAK,IAAI,MAAM,CAAC;CAIpB,OAAO,CAAC,GAAG,cAAc,EAAE,MAAM,GAAG,MAAM,sBAAsB,GAAG,GAAG,IAAI,CAAC;AAC7E;;;;;;;;;;;;;;;;;;;;;AA0BA,SAAS,qBACP,OACA,cACoB;CACpB,OAAO,iBAAiB,KAAA,KACtB,iBAAiB,uBACjB,CAAC,MAAM,MAAM,IAAI,YAAY,IAC3B,eACA,KAAA;AACN;AAEA,SAAgB,wBACd,OACA,UAA0C,CAAC,GACnB;CACxB,MAAM,aAAqC;EACzC,OAAO,CAAC;EACR,OAAO,CAAC;EACR,6BAAa,IAAI,IAAI;EACrB,2BAAW,IAAI,IAAI;CACrB;CAEA,IAAI,MAAM,MAAM,SAAS,GAAG;EAC1B,MAAM,WAAW,qBAAqB,OAAO,QAAQ,YAAY;EACjE,OAAO,aAAa,KAAA,IAAY;GAAE,GAAG;GAAY,OAAO,CAAC,QAAQ;EAAE,IAAI;CACzE;CAIA,MAAM,WAAW,+BAA+B,KAAK;CAGrD,MAAM,QAA0B,CAAC;CACjC,MAAM,8BAAc,IAAI,IAA8B;CACtD,MAAM,4BAAY,IAAI,IAA8B;CAEpD,KAAK,MAAM,YAAY,MAAM,aAAa,OAAO,GAC/C,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,OAAO,SAAS,oBAAoB,IAAI,KAAK,aAAa,KAAK;EACrE,MAAM,aAA6B;GACjC,eAAe,KAAK;GACpB,MAAM,KAAK;GACX,IAAI,KAAK;GACT,SAAS,KAAK;GACd;EACF;EACA,MAAM,KAAK,UAAU;EAErB,MAAM,aAAa,YAAY,IAAI,KAAK,IAAI;EAC5C,IAAI,YAAY,WAAW,KAAK,UAAU;OACrC,YAAY,IAAI,KAAK,MAAM,CAAC,UAAU,CAAC;EAE5C,MAAM,WAAW,UAAU,IAAI,KAAK,EAAE;EACtC,IAAI,UAAU,SAAS,KAAK,UAAU;OACjC,UAAU,IAAI,KAAK,IAAI,CAAC,UAAU,CAAC;CAC1C;CAIF,MAAM,aAAa,0BAA0B,KAAK;CAGlD,MAAM,QAA2B,CAAC;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,IAAI,IAAI,GAAG,MAAM,KAAK,IAAI;EAC1B,MAAM,YAAY,WAAW;EAC7B,IAAI,cAAc,KAAA,GAAW;EAC7B,MAAM,UAAU,+BAA+B,WAAW,UAAU,KAAK;EACzE,KAAK,MAAM,QAAQ,SACjB,MAAM,KAAK,IAAI;CAEnB;CAEA,MAAM,WAAW,qBAAqB,OAAO,QAAQ,YAAY;CACjE,IAAI,aAAa,KAAA,GAAW;EAC1B,IAAI,MAAM,SAAS,GACjB,MAAM,QAAQ,IAAI;EAEpB,MAAM,QAAQ,QAAQ;CACxB;CAEA,OAAO;EAAE;EAAO;EAAO;EAAa;CAAU;AAChD;;;AC5TA,MAAM,YAAY;;;;;;AAOlB,MAAM,iBAAiB;AAmCvB,MAAM,kBAAkD;CACtD,MAAM;CACN,SAAS;CACT,QAAQ;CACR,cAAc;CACd,WAAW;CACX,UAAU;CACV,cAAc;CACd,aAAa;CACb,iBAAiB;CACjB,cAAc;CACd,eAAe;CACf,aAAa;CACb,eAAe;CACf,gBAAgB;CAChB,oBAAoB;CACpB,sBAAsB;CACtB,qBAAqB;CACrB,WAAW;EAAE,SAAS;EAAK,UAAU;EAAK,MAAM;CAAI;CACpD,cAAc,0BAA0B,SAAS;CACjD,aAAa,yBAAyB,SAAS;AACjD;AAEA,MAAM,gBAAgD;CACpD,MAAM;CACN,SAAS;CACT,QAAQ;CACR,cAAc;CACd,WAAW;CACX,UAAU;CACV,cAAc;CACd,aAAa;CACb,iBAAiB;CACjB,cAAc;CACd,eAAe;CACf,aAAa;CACb,eAAe;CACf,gBAAgB;CAChB,oBAAoB;CACpB,sBAAsB;CACtB,qBAAqB;CACrB,WAAW;EAAE,SAAS;EAAK,UAAU;EAAK,MAAM;CAAI;CACpD,cAAc,0BAA0B,OAAO;CAC/C,aAAa,yBAAyB,OAAO;AAC/C;AAEA,SAAS,WAAW,MAAiD;CACnE,OAAO,SAAS,UAAU,gBAAgB;AAC5C;AAEA,SAAS,iBACP,MACA,SACQ;CACR,OAAO,QAAQ,UAAU;AAC3B;;;;;;;;AASA,SAAS,qBAAqB,MAAc,OAAoC;CAC9E,OAAO,MAAM,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,KAAK,KAAK,MAAM,CAAC,CAAC;AAChE;AAEA,SAAS,eACP,MACA,OACA,SACQ;CACR,QAAQ,KAAK,MAAb;EACE,KAAK;GACH,IAAI,KAAK,YAAY,MAAM,OAAO,qBAAqB,QAAQ,SAAS,KAAK;GAC7E,IAAI,KAAK,WAAW,MAAM,OAAO,qBAAqB,QAAQ,QAAQ,KAAK;GAC3E,OAAO,MAAM,KAAK,QAAQ,IAAI;EAChC,KAAK,iBACH,OAAO,MAAM,KAAK,QAAQ,YAAY;EACxC,KAAK,aAGH,OAAO,KAAK,YACR,MAAM,KAAK,QAAQ,aAAa,QAAQ,CAAC,IACvC,MAAM,KAAK,iBAAiB,KAAK,UAAU,OAAO,CAAC,IACrD,MAAM,KAAK,QAAQ,YAAY;EACrC,KAAK,cACH,OAAO,MAAM,KAAK,QAAQ,SAAS;EACrC,KAAK,aACH,OAAO,MAAM,KAAK,QAAQ,QAAQ;EACpC,KAAK,iBACH,OAAO,MAAM,KAAK,QAAQ,YAAY;EACxC,KAAK,gBACH,OAAO,MAAM,KAAK,QAAQ,WAAW;EACvC,KAAK,qBACH,OAAO,MAAM,KAAK,QAAQ,eAAe;EAC3C,KAAK,kBACH,OAAO,MAAM,KAAK,QAAQ,YAAY;EACxC,KAAK,mBACH,OAAO,MAAM,KAAK,QAAQ,aAAa;EACzC,KAAK,gBACH,OAAO,MAAM,KAAK,QAAQ,WAAW;EACvC,KAAK,mBACH,OAAO,MAAM,KAAK,QAAQ,aAAa;EACzC,KAAK,mBACH,OAAO,MAAM,KAAK,QAAQ,cAAc;EAC1C,KAAK,SACH,OAAO;CACX;AACF;AAEA,SAAS,mBACP,KACA,WACA,OACA,SACQ;CACR,MAAM,UAAU,IAAI,SAAS;CAC7B,IAAI,IAAI,MAAM,SAAS,GAAG;EACxB,IAAI,UAAU;EACd,IAAI,MAAM;EACV,KAAK,MAAM,QAAQ,IAAI,OACrB,QAAQ,KAAK,MAAb;GACE,KAAK;IACH,OAAO,MAAM,KAAK,UAAU,QAAQ,uBAAuB,QAAQ,kBAAkB;IACrF,UAAU;IACV;GACF,KAAK;IACH,OAAO,MAAM,KAAK,UAAU,QAAQ,sBAAsB,QAAQ,kBAAkB;IACpF,UAAU;IACV;GACF,KAAK;IACH,OAAO,MAAM,KAAK,QAAQ,YAAY;IACtC;GACF,KAAK;IACH,OAAO,MAAM,KAAK,QAAQ,WAAW;IACrC;GACF,KAAK;IACH,OAAO,MAAM,KAAK,QAAQ,YAAY;IACtC;GACF,KAAK;IACH,OAAO,MAAM,KAAK,QAAQ,cAAc;IACxC;GACF,SACE,OAAO;EACX;EAKF,KAAK,IAAI,SAAS,IAAI,MAAM,QAAQ,SAAS,WAAW,UACtD,OAAO;EAET,OAAO;CACT;CAEA,MAAM,QAAQ,IAAI,aAAa;CAC/B,MAAM,MAAM,IAAI,WAAW;CAC3B,IAAI,MAAM;CACV,KAAK,IAAI,SAAS,GAAG,SAAS,WAAW,UACvC,IAAI,SAAS,SAAS,SAAS,KAAK,OAAO;MACtC,IAAI,WAAW,OAAO,OAAO,MAAM,KAAK,QAAQ,kBAAkB;MAClE,IAAI,WAAW,KAClB,OAAO,MAAM,KAAK,UAAU,QAAQ,cAAc,QAAQ,YAAY;MACnE,OAAO,MAAM,KAAK,UAAU,QAAQ,sBAAsB,QAAQ,oBAAoB;CAE7F,OAAO;AACT;AAEA,SAAS,eAAe,MAAc,YAAoB,aAA6B;CACrF,IAAI,SAAS,qBACX,OAAO;CAGT,QADiB,KAAK,WAAW,SAAS,IAAI,KAAK,MAAM,CAAC,IAAI,MAC9C,MAAM,GAAG,UAAU;AACrC;AAEA,MAAM,uBAAuB;AAE7B,SAAS,wBACP,cACA,MACmB;CACnB,MAAM,QAAkB,CAAC;CACzB,MAAM,WAAW,KAAK,YAAY,IAAI,YAAY;CAClD,IAAI,UACF,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;CAEhE,IAAI,KAAK,WAAW,cAClB,MAAM,KAAK,cAAc;CAE3B,IAAI,KAAK,iBAAiB,gBAAgB,iBAAiB,qBACzD,MAAM,KAAK,oBAAoB;CAEjC,OAAO;AACT;AAEA,SAAS,iBAAiB,MAA4D;CACpF,MAAM,OAAO,8BAA8B,EAAE,UAAU,KAAK,SAAS,CAAC;CACtE,MAAM,gBAAgB,KAAK;CAC3B,IAAI,CAAC,KAAK,YAAY,kBAAkB,KAAA,GACtC,OAAO;CAET,OAAO;EACL,GAAG;EACH,OAAO,UAAU;GACf,MAAM,cAAc,MAAM,KAAK,SAAU,SAAS,gBAAgB,KAAK,IAAI,IAAI,IAAK;GACpF,OAAO,KAAK,KAAK,WAAW;EAC9B;CACF;AACF;AAEA,SAAS,qBACP,MACA,OACA,YACA,SACQ;CACR,IAAI,KAAK,SAAS,QAAQ;EACxB,MAAM,OAAO,eAAe,KAAK,MAAM,YAAY,QAAQ,WAAW;EACtE,OAAO,GAAG,MAAM,WAAW,IAAI,EAAE,GAAG,MAAM,MAAM,QAAQ,YAAY,EAAE,GAAG,MAAM,SAAS,IAAI;CAC9F;CAQA,OAAO,GANL,KAAK,SAAS,sBACV,MAAM,MAAM,QAAQ,WAAW,IAC/B,IAAI,OAAO,KAAK,IAAI,GAAG,aAAa,QAAQ,YAAY,MAAM,CAAC,IAC/D,MAAM,WAAW,eAAe,KAAK,MAAM,YAAY,QAAQ,WAAW,CAAC,EAGhE,GAFH,MAAM,MAAM,QAAQ,YAEV,EAAE,GADb,MAAM,SAAS,eAAe,KAAK,IAAI,YAAY,QAAQ,WAAW,CACnD;AAClC;AAEA,SAAS,WAAW,MAAc,aAA6B;CAC7D,MAAM,UAAU,KAAK,IAAI,GAAG,cAAc,YAAY,IAAI,CAAC;CAC3D,OAAO,OAAO,IAAI,OAAO,OAAO;AAClC;AAEA,SAAS,kBAAkB,MAAgD;CACzE,OAAO,KAAK,QACT,KAAK,QACJ,IAAI,SAAS,UAAU,IAAI,SAAS,SAAS,KAAK,IAAI,KAAK,IAAI,MAAM,MAAM,IAAI,KACjF,CACF;AACF;AAEA,SAAS,iBAAiB,OAA0C;CAClE,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,OAAO,KAAK,IAAI,GAAG,MAAM,KAAK,SAAS,KAAK,QAAQ,MAAM,CAAC;AAC7D;AAEA,SAAS,gBAAgB,aAAqB,eAAuB,YAA4B;CAC/F,OAAO,KAAK,IAAI,gBAAgB,YAAY,uBAAuB,WAAW;AAChF;AAEA,SAAS,yBAAyB,MAAiD;CACjF,OAAO,KAAK,MAAM,QAChB,IAAI,MAAM,MACP,SAAS,KAAK,SAAS,eAAe,KAAK,cAAc,wBAC5D,CACF;AACF;AAEA,SAAS,gBAAgB,KAA4B,iBAA6C;CAChG,IAAI,oBAAoB,KAAA,GACtB,OAAO;CAET,MAAM,YAAY,IAAI,aAAa;CACnC,IAAI,IAAI,MAAM,SAAS,uBAAuB,cAAc,GAC1D,QAAQ,YAAY,KAAK,IAAI;CAK/B,OAH0B,IAAI,MAAM,MACjC,MAAM,UAAU,QAAQ,aAAa,KAAK,SAAS,eAE/B,IAAI,IAAI,MAAM,SAAS,IAAI,aAAa,YAAY,KAAK,IAAI;AACtF;AAEA,SAAS,qBAAqB,KAAqC;CACjE,OAAO,IAAI,MAAM,MACd,SAAS,KAAK,SAAS,WAAW,KAAK,WAAW,QAAQ,KAAK,YAAY,KAC9E;AACF;AAEA,SAAgB,yBACd,OACA,MACQ;CAER,MAAM,UAAU,WADE,KAAK,aAAa,SACA;CACpC,MAAM,QAAQ,iBAAiB,IAAI;CACnC,MAAM,aAAa,KAAK,cAAA;CACxB,MAAM,YAAY,kBAAkB,MAAM,IAAI;CAC9C,MAAM,kBAAkB,yBAAyB,MAAM,IAAI,IAAI,YAAY,IAAI,IAAI,KAAA;CACnF,MAAM,aAAa,oBAAoB,KAAA,IAAY,IAAI;CAOvD,MAAM,gBAAgB,iBANL,MAAM,KACpB,QACE,QACC,IAAI,SAAS,UAAU,IAAI,SAAS,KAAA,CACxC,EACC,KAAK,QAAQ,IAAI,IAC0B,CAAC;CAE/C,MAAM,QAAkB,CAAC;CAEzB,KAAK,IAAI,WAAW,GAAG,WAAW,MAAM,KAAK,QAAQ,YAAY;EAC/D,MAAM,MAAM,MAAM,KAAK;EACvB,IAAI,QAAQ,KAAA,GAAW;EAEvB,IAAI,IAAI,SAAS,uBAAuB;GACtC,MAAM,KAAK,EAAE;GACb;EACF;EAEA,IAAI,IAAI,SAAS,sBAAsB,IAAI,SAAS,mBAAmB;GACrE,MAAM,KAAK,mBAAmB,KAAK,WAAW,OAAO,OAAO,EAAE,QAAQ,QAAQ,EAAE,CAAC;GACjF;EACF;EAEA,IAAI,SAAS,IAAI,MAAM,KAAK,SAAS,eAAe,MAAM,OAAO,OAAO,CAAC,EAAE,KAAK,EAAE;EAClF,MAAM,UAAU,MAAM,KAAK,WAAW;EACtC,IAAI,WAAW,IAAI,MAAM;EACzB,IAAI,IAAI,SAAS,QAAQ;GACvB,MAAM,eAAe,IAAI,gBAAgB;GACzC,IAAI,SAAS,SAAS,qBAAqB,iBAAiB,qBAC1D,WAAW;QAEX,WAAW,IAAI,MAAM;EAEzB;EACA,MAAM,cACJ,IAAI,SAAS,SACT,gBAAgB,KAAK,eAAe,IACpC,oBAAoB,KAAA,MACjB,qBAAqB,GAAG,KAAK,IAAI,iBAAiB,KAAA,KACnD,kBACA,WAAW,IAAI;EACvB,IACE,IAAI,SAAS,UACb,IAAI,MAAM,SAAS,wBAClB,IAAI,aAAa,OAAO,GAEzB,SAAS,IAAI,MACV,MAAM,GAAG,CAAC,EACV,KAAK,SAAS,eAAe,MAAM,OAAO,OAAO,CAAC,EAClD,KAAK,EAAE;OACL,IAAI,IAAI,SAAS,UAAU,WAAW,IAAI,MAAM,UAAU,CAAC,qBAAqB,GAAG,GACxF,SAAS,IAAI,MACV,MAAM,GAAG,QAAQ,EACjB,KAAK,SAAS,eAAe,MAAM,OAAO,OAAO,CAAC,EAClD,KAAK,EAAE;OACL,IAAI,OAAO,SAAS,WAAW,GACpC,SAAS,OAAO,OAAO,WAAW,GAAG,GAAG;EAE1C,MAAM,eAAe,gBAAgB,aAAa,eAAe,UAAU;EAC3E,MAAM,aAAa,cAAc;EACjC,MAAM,YAAY,WAAW,QAAQ,WAAW;EAEhD,IAAI,IAAI,SAAS,QAAQ;GACvB,MAAM,eAAe,IAAI,gBAAgB;GACzC,IAAI,iBAAiB,qBAAqB;IACxC,MAAM,gBAAgB,IAAI,MACvB,MAAM,CAAC,EACP,KAAK,SAAS,eAAe,MAAM,OAAO,OAAO,CAAC,EAClD,KAAK,EAAE;IACV,MAAM,cAAc,QAAQ,YAAY,OAAO,GAAG,GAAG,IAAI;IACzD,MAAM,eAAe,wBAAwB,cAAc,IAAI;IAC/D,IAAI,aAAa,WAAW,GAAG;KAC7B,MAAM,KAAK,YAAY,QAAQ,QAAQ,EAAE,CAAC;KAC1C;IACF;IACA,MAAM,UAAU,MAAM,KAAK,YAAY;IACvC,MAAM,KAAK,GAAG,WAAW,aAAa,UAAU,IAAI,UAAU,QAAQ,QAAQ,EAAE,CAAC;IACjF;GACF;GACA,MAAM,WAAW,MAAM,WACrB,eAAe,cAAc,YAAY,QAAQ,WAAW,CAC9D;GACA,MAAM,eAAe,wBAAwB,cAAc,IAAI;GAC/D,MAAM,aACJ,aAAa,SAAS,IAClB,IAAI,OAAO,KAAK,IAAI,GAAG,aAAa,cAAc,YAAY,QAAQ,CAAC,CAAC,IACxE;GACN,MAAM,UAAU,aAAa,SAAS,IAAI,MAAM,KAAK,YAAY,IAAI;GACrE,MAAM,KAAK,GAAG,YAAY,WAAW,aAAa,UAAU,QAAQ,QAAQ,EAAE,CAAC;GAC/E;EACF;EAEA,MAAM,OAAO,IAAI;EACjB,IAAI,SAAS,KAAA,GAAW;EAExB,MAAM,iBAAiB,IAAI,OAAO,KAAK,IAAI,GAAG,eAAe,KAAK,QAAQ,MAAM,CAAC;EACjF,MAAM,UAAU,GAAG,MAAM,QAAQ,KAAK,OAAO,IAAI;EACjD,MAAM,aAAa,qBAAqB,MAAM,OAAO,YAAY,OAAO;EACxE,MAAM,KAAK,GAAG,YAAY,UAAU,aAAa,QAAQ,QAAQ,EAAE,CAAC;CACtE;CAEA,OAAO,MAAM,KAAK,IAAI;AACxB;;;ACjaA,eAAsB,6BACpB,SACA,OACA,IAC2D;CAC3D,MAAM,SAAS,MAAM,WAAW,QAAQ,MAAM;CAC9C,MAAM,EAAE,YAAY,uBAAuB,kBAAkB,sBAC3D,QAAQ,QACR,MACF;CAEA,IAAI,CAAC,MAAM,QAAQ,CAAC,MAAM,OAAO;EAC/B,MAAM,SAAS,mBAAmB;GAChC,SAAS;GACT,aAAa;GACb,SAAS,CACP;IAAE,OAAO;IAAU,OAAO;GAAW,GACrC;IAAE,OAAO;IAAc,OAAO;GAAsB,CACtD;GACA;EACF,CAAC;EACD,GAAG,OAAO,MAAM;CAClB;CAEA,MAAM,SAAS,MAAM,mBAAmB,QAAQ,EAAE,cAAc,CAAC;CACjE,IAAI,CAAC,OAAO,IACV,OAAO;CAGT,MAAM,EAAE,WAAW,iBAAiB,OAAO;CAC3C,MAAM,QAAQ,UAAU,IAAI,MAAM;CAOlC,OAAO,GAAG;EACR,IAAI;EACJ;EACA;EACA,MAViC,OAAO,QAAQ,UAAU,IAAI,IAAI,EAAE,KAAK,CAAC,MAAM,YAAY;GAC5F;GACA,MAAM,MAAM;GACZ,QAAQ;EACV,EAMK;EACH,SAAS,GAAG,MAAM,MAAM,KAAK,YAAY,MAAM,gBAAgB,KAAK;CACtE,CAAC;AACH;AAEA,SAAgB,8BAAuC;CACrD,MAAM,UAAU,IAAI,QAAQ,OAAO;CACnC,uBACE,SACA,qCACA,kQAKF;CACA,mBAAmB,SAAS;EAC1B;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,kBAAkB,SAAS;EACzB;GAAE,MAAM;GAAoB,UAAU;EAAyC;EAC/E;GAAE,MAAM;GAAiB,UAAU;EAAkC;EACrE;GAAE,MAAM;GAAkB,UAAU;EAA0B;EAC9D;GAAE,MAAM;GAAkB,UAAU;EAAqC;CAC3E,CAAC;CACD,iBAAiB,OAAO,EACrB,OAAO,mBAAmB,+BAA+B,EACzD,OAAO,SAAS,+BAA+B,EAC/C,OAAO,UAAU,gDAAgD,EACjE,OAAO,WAAW,6CAA6C,EAC/D,OAAO,OAAO,YAAmC;EAChD,MAAM,QAAQ,uBAAuB,OAAO;EAC5C,MAAM,KAAK,iBAAiB,KAAK;EAEjC,MAAM,WAAW,aAAa,MADT,6BAA6B,SAAS,OAAO,EAAE,GAC9B,OAAO,KAAK,gBAAgB;GAMhE,IAAI,QAAQ,KAAK;IACf,MAAM,QAAQ,CAAC,sBAAsB;IACrC,KAAK,MAAM,QAAQ,YAAY,MAAM,gBAAgB,OAAO,GAAG;KAC7D,MAAM,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE;KAClC,MAAM,KAAK,KAAK,GAAG,MAAM,GAAG,EAAE;KAC9B,MAAM,KAAK,MAAM,KAAK,QAAQ,GAAG,YAAY,KAAK,QAAQ,IAAI;IAChE;IACA,MAAM,KAAK,GAAG;IACd,GAAG,OAAO,MAAM,KAAK,IAAI,CAAC;GAC5B,OAAO,IAAI,MAAM,MAAM;IACrB,MAAM,QAAQ,CAAC,GAAG,YAAY,MAAM,KAAK;IACzC,MAAM,QAAQ,CAAC,GAAG,YAAY,MAAM,gBAAgB,OAAO,CAAC,EAAE,KAAK,OAAO;KACxE,SAAS,EAAE;KACX,MAAM,EAAE;KACR,IAAI,EAAE;KACN,eAAe,EAAE;IACnB,EAAE;IACF,GAAG,OACD,KAAK,UAAU;KAAE,IAAI;KAAM;KAAO;KAAO,SAAS,YAAY;IAAQ,GAAG,MAAM,CAAC,CAClF;GACF,OAAO,IAAI,CAAC,MAAM,OAChB,IAAI,QAAQ,MAAM;IAChB,MAAM,6BAAa,IAAI,IAAsB;IAC7C,KAAK,MAAM,OAAO,YAAY,MAAM;KAClC,MAAM,WAAW,WAAW,IAAI,IAAI,IAAI;KACxC,WAAW,IAAI,IAAI,MAAM,WAAW,CAAC,GAAG,UAAU,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;IAC1E;IAMA,MAAM,SAAS,0BALE,wBAAwB,YAAY,OAAO,EAC1D,GAAI,YAAY,iBAAiB,OAC7B,EAAE,cAAc,YAAY,aAAa,IACzC,CAAC,EACP,CACgD,CAAC;IACjD,MAAM,YAAY,YAAY,KAAK,MAAM,QAAQ,IAAI,MAAM;IAC3D,MAAM,aAAa,yBAAyB,QAAQ;KAClD;KACA,GAAI,YAAY,iBAAiB,OAC7B,EAAE,cAAc,YAAY,aAAa,IACzC,CAAC;KACL,GAAI,cAAc,KAAA,IAAY,EAAE,eAAe,UAAU,KAAK,IAAI,CAAC;KACnE,UAAU,MAAM,UAAU;KAC1B,WAAW,GAAG,iBAAiB,QAAQ,UAAU,IAAI;IACvD,CAAC;IAKD,GAAG,OAAO,UAAU;IACpB,GAAG,OAAO,KAAK,YAAY,SAAS;GACtC,OAAO;IACL,MAAM,cAAc,4BAA4B;KAC9C,OAAO,YAAY;KACnB,MAAM;KACN,YAAY,KAAA;KACZ,cAAc,YAAY,gBAAgB;KAC1C,MAAM,YAAY;KAClB,eAAe,KAAA;KACf,eAAe,KAAA;KACf,cAAc,CAAC;IACjB,CAAC;IACD,MAAM,cAAc,cAAc,OAAO,YAAY,OAAO;KAC1D,GAAG,YAAY;KACf,UAAU,MAAM,UAAU;IAC5B,CAAC;IACD,GAAG,IAAI,WAAW;IAClB,GAAG,IAAI,KAAK,YAAY,SAAS;GACnC;EAEJ,CAAC;EACD,QAAQ,KAAK,QAAQ;CACvB,CAAC;CACH,OAAO;AACT"}

package/dist/migration-list-styler-BRwF4-gy.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"migration-list-styler-BRwF4-gy.mjs","names":[],"sources":["../src/utils/formatters/migration-list-graph-topology.ts","../src/utils/formatters/migration-list-data-column.ts","../src/utils/formatters/migration-list-render.ts","../src/utils/formatters/migration-list-styler.ts"],"sourcesContent":["import { EMPTY_CONTRACT_HASH } from '@prisma-next/migration-tools/constants';\nimport type { MigrationGraph } from '@prisma-next/migration-tools/graph';\nimport type { MigrationListEntry } from './migration-list-types';\n\nexport type MigrationEdgeKind = 'forward' | 'rollback' | 'self';\n\nexport interface MigrationListGraphTopology {\n  readonly kindByMigrationHash: ReadonlyMap<string, MigrationEdgeKind>;\n  readonly forwardInDegree: ReadonlyMap<string, number>;\n  readonly forwardOutDegree: ReadonlyMap<string, number>;\n}\n\n// ---------------------------------------------------------------------------\n// Shared classifier — operates on a normalized edge shape common to both\n// MigrationListEntry (Tier-2) and MigrationEdge / MigrationGraph (Tier-3).\n// ---------------------------------------------------------------------------\n\ninterface NormalizedEdge {\n  readonly hash: string;\n  readonly from: string;\n  readonly to: string;\n  readonly dirName: string;\n}\n\nfunction compareDirNameDesc(a: NormalizedEdge, b: NormalizedEdge): number {\n  return b.dirName.localeCompare(a.dirName);\n}\n\nfunction bumpDegree(map: Map<string, number>, key: string): void {\n  map.set(key, (map.get(key) ?? 0) + 1);\n}\n\nfunction forwardRootsForDepth(\n  nodes: ReadonlySet<string>,\n  candidates: readonly NormalizedEdge[],\n): readonly string[] {\n  const inDegree = new Map<string, number>();\n  for (const node of nodes) {\n    inDegree.set(node, 0);\n  }\n  for (const edge of candidates) {\n    bumpDegree(inDegree, edge.to);\n  }\n\n  const roots: string[] = [];\n  for (const node of nodes) {\n    if ((inDegree.get(node) ?? 0) === 0) {\n      roots.push(node);\n    }\n  }\n  roots.sort((a, b) => {\n    if (a === EMPTY_CONTRACT_HASH) return -1;\n    if (b === EMPTY_CONTRACT_HASH) return 1;\n    return a.localeCompare(b);\n  });\n  if (roots.length > 0) return roots;\n\n  return [...nodes].sort((a, b) => {\n    if (a === EMPTY_CONTRACT_HASH) return -1;\n    if (b === EMPTY_CONTRACT_HASH) return 1;\n    return a.localeCompare(b);\n  });\n}\n\nfunction longestPathDepths(\n  nodes: ReadonlySet<string>,\n  candidates: readonly NormalizedEdge[],\n): Map<string, number> {\n  const depth = new Map<string, number>();\n  for (const root of forwardRootsForDepth(nodes, candidates)) {\n    depth.set(root, 0);\n  }\n\n  const maxPasses = nodes.size;\n  for (let pass = 0; pass < maxPasses; pass++) {\n    let changed = false;\n    for (const edge of candidates) {\n      const base = depth.get(edge.from);\n      if (base === undefined) continue;\n      const next = base + 1;\n      if (next > (depth.get(edge.to) ?? -1)) {\n        depth.set(edge.to, next);\n        changed = true;\n      }\n    }\n    if (!changed) break;\n  }\n\n  for (const node of nodes) {\n    if (!depth.has(node)) {\n      depth.set(node, 0);\n    }\n  }\n\n  return depth;\n}\n\nfunction canReachForward(\n  start: string,\n  goal: string,\n  candidates: readonly NormalizedEdge[],\n): boolean {\n  if (start === goal) return true;\n\n  const outgoing = new Map<string, string[]>();\n  for (const edge of candidates) {\n    const bucket = outgoing.get(edge.from);\n    if (bucket) bucket.push(edge.to);\n    else outgoing.set(edge.from, [edge.to]);\n  }\n\n  const visited = new Set<string>([start]);\n  const queue = [start];\n  while (queue.length > 0) {\n    const node = queue.shift();\n    if (node === undefined) continue;\n    for (const next of outgoing.get(node) ?? []) {\n      if (next === goal) return true;\n      if (!visited.has(next)) {\n        visited.add(next);\n        queue.push(next);\n      }\n    }\n  }\n\n  return false;\n}\n\nfunction isMarginalForwardEdge(\n  nodes: ReadonlySet<string>,\n  candidates: readonly NormalizedEdge[],\n  edge: NormalizedEdge,\n): boolean {\n  const without = candidates.filter((candidate) => candidate !== edge);\n  const depthWithout = longestPathDepths(nodes, without);\n  const depthWith = longestPathDepths(nodes, candidates);\n  const fromDepth = depthWithout.get(edge.from) ?? 0;\n  const toWith = depthWith.get(edge.to) ?? 0;\n  return toWith > fromDepth;\n}\n\n// The first branch is the load-bearing one: a forward edge `from → to` is a\n// disguised node-skipping rollback when, after removing it, `to` can still\n// reach `from` and `from` sits strictly deeper than `to + 1` (a longer path\n// already connects them). This branch fires on every cycle-closing edge, and\n// the caller peels exactly one edge (dirName-max) per iteration before\n// recomputing — so cycles are broken deterministically regardless of edge\n// order. `isMarginalForwardEdge` is only a fallback for the residual case and\n// is reached only while the candidate set is still cyclic.\nfunction shouldPeelForwardEdge(\n  nodes: ReadonlySet<string>,\n  candidates: readonly NormalizedEdge[],\n  edge: NormalizedEdge,\n): boolean {\n  const without = candidates.filter((candidate) => candidate !== edge);\n  const depthWithout = longestPathDepths(nodes, without);\n  const fromDepth = depthWithout.get(edge.from) ?? 0;\n  const toWithout = depthWithout.get(edge.to) ?? 0;\n\n  if (canReachForward(edge.to, edge.from, without) && fromDepth > toWithout + 1) {\n    return true;\n  }\n\n  return !isMarginalForwardEdge(nodes, candidates, edge);\n}\n\nfunction peelNonMarginalForwardEdges(\n  nodes: ReadonlySet<string>,\n  kindByMigrationHash: Map<string, MigrationEdgeKind>,\n  nonSelf: readonly NormalizedEdge[],\n): void {\n  let candidates = nonSelf.filter((edge) => kindByMigrationHash.get(edge.hash) === 'forward');\n\n  while (candidates.length > 0) {\n    const rollbackCandidates = candidates.filter((edge) =>\n      shouldPeelForwardEdge(nodes, candidates, edge),\n    );\n    if (rollbackCandidates.length === 0) break;\n\n    rollbackCandidates.sort(compareDirNameDesc);\n    const rollback = rollbackCandidates[0];\n    if (rollback === undefined) break;\n\n    kindByMigrationHash.set(rollback.hash, 'rollback');\n    candidates = candidates.filter((edge) => edge !== rollback);\n  }\n}\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 drops node-skipping rollbacks (target can\n * reach the source on the forward subgraph and sits more than one rank below).\n */\nfunction classifyNormalizedEdges(edges: readonly NormalizedEdge[]): MigrationListGraphTopology {\n  const nodes = new Set<string>();\n  const kindByMigrationHash = new Map<string, MigrationEdgeKind>();\n  const outgoingByFrom = new Map<string, NormalizedEdge[]>();\n  const nonSelf: NormalizedEdge[] = [];\n\n  for (const edge of edges) {\n    nodes.add(edge.from);\n    nodes.add(edge.to);\n\n    if (edge.from === edge.to) {\n      kindByMigrationHash.set(edge.hash, 'self');\n      continue;\n    }\n\n    nonSelf.push(edge);\n    const bucket = outgoingByFrom.get(edge.from);\n    if (bucket) bucket.push(edge);\n    else outgoingByFrom.set(edge.from, [edge]);\n  }\n\n  for (const bucket of outgoingByFrom.values()) {\n    bucket.sort(compareDirNameDesc);\n  }\n\n  const nonSelfInDegree = new Map<string, number>();\n  for (const node of nodes) {\n    nonSelfInDegree.set(node, 0);\n  }\n  for (const bucket of outgoingByFrom.values()) {\n    for (const edge of bucket) {\n      bumpDegree(nonSelfInDegree, edge.to);\n    }\n  }\n\n  const dfsRoots: string[] = [];\n  for (const node of nodes) {\n    if ((nonSelfInDegree.get(node) ?? 0) === 0) {\n      dfsRoots.push(node);\n    }\n  }\n  dfsRoots.sort((a, b) => {\n    if (a === EMPTY_CONTRACT_HASH) return -1;\n    if (b === EMPTY_CONTRACT_HASH) return 1;\n    return a.localeCompare(b);\n  });\n  if (dfsRoots.length === 0) {\n    dfsRoots.push(...[...nodes].sort((a, b) => a.localeCompare(b)));\n  }\n\n  const WHITE = 0;\n  const GRAY = 1;\n  const BLACK = 2;\n  const color = new Map<string, number>();\n  const dfsParent = new Map<string, string | undefined>();\n  for (const node of nodes) {\n    color.set(node, WHITE);\n  }\n\n  interface Frame {\n    node: string;\n    outgoing: readonly NormalizedEdge[];\n    index: number;\n  }\n  const stack: Frame[] = [];\n\n  function isImmediateDfsParent(ancestor: string, node: string): boolean {\n    return dfsParent.get(node) === ancestor;\n  }\n\n  function pushFrame(node: string, parent: string | undefined): void {\n    color.set(node, GRAY);\n    dfsParent.set(node, parent);\n    stack.push({ node, outgoing: outgoingByFrom.get(node) ?? [], index: 0 });\n  }\n\n  function runDfsFrom(root: string): void {\n    if (color.get(root) !== WHITE) return;\n    pushFrame(root, undefined);\n\n    while (stack.length > 0) {\n      const frame = stack[stack.length - 1];\n      if (frame === undefined) break;\n      if (frame.index >= frame.outgoing.length) {\n        color.set(frame.node, BLACK);\n        stack.pop();\n        continue;\n      }\n\n      const edge = frame.outgoing[frame.index];\n      frame.index += 1;\n      if (edge === undefined) continue;\n\n      const v = edge.to;\n      const vColor = color.get(v);\n      if (vColor === GRAY && isImmediateDfsParent(v, frame.node)) {\n        kindByMigrationHash.set(edge.hash, 'rollback');\n      } else {\n        kindByMigrationHash.set(edge.hash, 'forward');\n        if (vColor === WHITE) {\n          pushFrame(v, frame.node);\n        }\n      }\n    }\n  }\n\n  for (const root of dfsRoots) {\n    runDfsFrom(root);\n  }\n  const remainingWhite = [...nodes].filter((node) => color.get(node) === WHITE);\n  remainingWhite.sort((a, b) => a.localeCompare(b));\n  for (const root of remainingWhite) {\n    runDfsFrom(root);\n  }\n\n  peelNonMarginalForwardEdges(nodes, kindByMigrationHash, nonSelf);\n\n  const forwardInDegree = new Map<string, number>();\n  const forwardOutDegree = new Map<string, number>();\n\n  for (const edge of edges) {\n    if (kindByMigrationHash.get(edge.hash) !== 'forward') continue;\n    bumpDegree(forwardOutDegree, edge.from);\n    bumpDegree(forwardInDegree, edge.to);\n  }\n\n  return {\n    kindByMigrationHash,\n    forwardInDegree,\n    forwardOutDegree,\n  };\n}\n\nfunction canonicalFrom(from: string | null): string {\n  return from ?? EMPTY_CONTRACT_HASH;\n}\n\n/**\n * Classify forward/rollback/self for a Tier-2 `MigrationListEntry[]` edge set.\n * Returns the kind of each migration plus the forward in/out degree of each\n * contract node. This is the established Tier-2 surface; its behaviour is\n * unchanged — only its implementation now delegates to the shared classifier.\n */\nexport function classifyMigrationListGraphTopology(\n  entries: readonly MigrationListEntry[],\n): MigrationListGraphTopology {\n  const normalized: NormalizedEdge[] = entries.map((entry) => ({\n    hash: entry.migrationHash,\n    from: canonicalFrom(entry.from),\n    to: entry.to,\n    dirName: entry.dirName,\n  }));\n  return classifyNormalizedEdges(normalized);\n}\n\n/**\n * Classify forward/rollback/self for a `MigrationGraph` edge set (Tier-3).\n * Delegates to the same shared classifier as `classifyMigrationListGraphTopology`\n * so both tiers agree on forward/rollback/self without duplicating logic.\n */\nexport function classifyMigrationGraphTopology(graph: MigrationGraph): MigrationListGraphTopology {\n  const normalized: NormalizedEdge[] = [];\n  for (const edges of graph.forwardChain.values()) {\n    for (const edge of edges) {\n      normalized.push({\n        hash: edge.migrationHash,\n        from: edge.from,\n        to: edge.to,\n        dirName: edge.dirName,\n      });\n    }\n  }\n  return classifyNormalizedEdges(normalized);\n}\n","import type { GlyphMode } from '../glyph-mode';\nimport type { MigrationEdgeKind } from './migration-list-graph-topology';\nimport type { MigrationListStyler } from './migration-list-render';\nimport type { MigrationListEntry } from './migration-list-types';\n\nexport const MIGRATION_LIST_HASH_WIDTH = 7;\nexport const MIGRATION_LIST_EMPTY_SOURCE = '∅';\nexport const MIGRATION_LIST_ASCII_EMPTY_SOURCE = '-';\nexport const MIGRATION_LIST_FORWARD_EDGE_GLYPH = '→';\nexport const MIGRATION_LIST_ASCII_FORWARD_EDGE_GLYPH = '->';\nexport const MIGRATION_LIST_DECORATION_PREFIX = '  ';\n\nexport const MIGRATION_LIST_UNICODE_KIND_GLYPH: Record<MigrationEdgeKind, string> = {\n  forward: '*',\n  rollback: '↩',\n  self: '⟲',\n};\n\nexport const MIGRATION_LIST_ASCII_KIND_GLYPH: Record<MigrationEdgeKind, string> = {\n  forward: '*',\n  rollback: '<',\n  self: '~',\n};\n\nexport function migrationListKindGlyph(glyphMode: GlyphMode, edgeKind: MigrationEdgeKind): string {\n  return glyphMode === 'ascii'\n    ? MIGRATION_LIST_ASCII_KIND_GLYPH[edgeKind]\n    : MIGRATION_LIST_UNICODE_KIND_GLYPH[edgeKind];\n}\n\nexport function migrationListForwardArrow(glyphMode: GlyphMode): string {\n  return glyphMode === 'ascii'\n    ? MIGRATION_LIST_ASCII_FORWARD_EDGE_GLYPH\n    : MIGRATION_LIST_FORWARD_EDGE_GLYPH;\n}\n\nexport function migrationListEmptySource(glyphMode: GlyphMode): string {\n  return glyphMode === 'ascii' ? MIGRATION_LIST_ASCII_EMPTY_SOURCE : MIGRATION_LIST_EMPTY_SOURCE;\n}\n\nexport function abbreviateContractHash(hash: string): string {\n  const stripped = hash.startsWith('sha256:') ? hash.slice(7) : hash;\n  return stripped.slice(0, MIGRATION_LIST_HASH_WIDTH);\n}\n\nexport function computeMigrationDirNameWidth(migrations: readonly MigrationListEntry[]): number {\n  if (migrations.length === 0) return 0;\n  return Math.max(...migrations.map((entry) => entry.dirName.length)) + 2;\n}\n\nfunction formatSourceColumn(\n  from: string | null,\n  style: MigrationListStyler,\n  emptySource: string,\n): string {\n  if (from === null) {\n    return style.glyph(emptySource) + ' '.repeat(MIGRATION_LIST_HASH_WIDTH - emptySource.length);\n  }\n  return style.sourceHash(abbreviateContractHash(from));\n}\n\nexport function formatDecorations(\n  providedInvariants: readonly string[],\n  refs: readonly string[],\n  style: MigrationListStyler,\n): string {\n  const blocks: string[] = [];\n  if (providedInvariants.length > 0) {\n    blocks.push(style.invariants(providedInvariants));\n  }\n  if (refs.length > 0) {\n    blocks.push(style.refs(refs));\n  }\n  if (blocks.length === 0) return '';\n  return `${MIGRATION_LIST_DECORATION_PREFIX}${blocks.join(' ')}`;\n}\n\nexport interface MigrationDataColumnOptions {\n  readonly dirNameWidth: number;\n  readonly edgeKind: MigrationEdgeKind;\n  readonly style: MigrationListStyler;\n  readonly forwardArrow?: string;\n  readonly emptySource?: string;\n}\n\nexport function formatMigrationDataColumn(\n  migration: MigrationListEntry,\n  options: MigrationDataColumnOptions,\n): string {\n  const {\n    dirNameWidth,\n    edgeKind,\n    style,\n    forwardArrow = MIGRATION_LIST_FORWARD_EDGE_GLYPH,\n    emptySource = MIGRATION_LIST_EMPTY_SOURCE,\n  } = options;\n  const dirNamePadding = ' '.repeat(Math.max(0, dirNameWidth - migration.dirName.length));\n  const dirName = `${style.dirName(migration.dirName)}${dirNamePadding}`;\n  const decorations = formatDecorations(migration.providedInvariants, migration.refs, style);\n\n  if (edgeKind === 'self') {\n    const contractHash = migration.from ?? migration.to;\n    const hash = style.sourceHash(abbreviateContractHash(contractHash));\n    return `${dirName}${hash}${decorations}`;\n  }\n\n  const source = formatSourceColumn(migration.from, style, emptySource);\n  const arrow = style.glyph(forwardArrow);\n  const dest = style.destHash(abbreviateContractHash(migration.to));\n  return `${dirName}${source} ${arrow} ${dest}${decorations}`;\n}\n\nexport function formatNodeLineDataColumn(contractHash: string, style: MigrationListStyler): string {\n  return style.sourceHash(abbreviateContractHash(contractHash));\n}\n","import type { GlyphMode } from '../glyph-mode';\nimport {\n  computeMigrationDirNameWidth,\n  formatMigrationDataColumn,\n  migrationListEmptySource,\n  migrationListForwardArrow,\n  migrationListKindGlyph,\n} from './migration-list-data-column';\nimport {\n  classifyMigrationListGraphTopology,\n  type MigrationEdgeKind,\n  type MigrationListGraphTopology,\n} from './migration-list-graph-topology';\nimport type { MigrationListEntry, MigrationListResult } from './migration-list-types';\n\nexport type { GlyphMode } from '../glyph-mode';\nexport type { MigrationEdgeKind } from './migration-list-graph-topology';\nexport type {\n  MigrationListEntry,\n  MigrationListResult,\n  MigrationSpaceListEntry,\n} from './migration-list-types';\n\n/**\n * Semantic styler for `migration list` output tokens. Token-typed so\n * the renderer composes presentation-neutral fragments and the styler\n * decides how each token kind is decorated (ANSI codes, plain text,\n * etc.). The renderer pads with raw spaces *outside* styled tokens so\n * visible column widths stay stable regardless of what the styler\n * emits — adding ANSI escape sequences never disturbs alignment.\n *\n * `invariants` and `refs` receive the underlying string arrays rather\n * than a pre-joined string so per-element styling (e.g. distinguishing\n * the live-DB `db` marker from user-named refs) is possible without\n * having to re-parse a joined block.\n */\nexport interface MigrationListStyler {\n  kind(text: string): string;\n  dirName(text: string): string;\n  sourceHash(text: string): string;\n  destHash(text: string): string;\n  glyph(text: string): string;\n  lane(text: string): string;\n  invariants(ids: readonly string[]): string;\n  refs(names: readonly string[]): string;\n  spaceHeading(text: string): string;\n  summary(text: string): string;\n  emptyState(text: string): string;\n}\n\nexport const IDENTITY_MIGRATION_LIST_STYLER: MigrationListStyler = {\n  kind: (text) => text,\n  dirName: (text) => text,\n  sourceHash: (text) => text,\n  destHash: (text) => text,\n  glyph: (text) => text,\n  lane: (text) => text,\n  invariants: (ids) => `{${ids.join(', ')}}`,\n  refs: (names) => `(${names.join(', ')})`,\n  spaceHeading: (text) => text,\n  summary: (text) => text,\n  emptyState: (text) => text,\n};\n\nfunction resolveEdgeKind(\n  migrationHash: string,\n  kindByMigrationHash: ReadonlyMap<string, MigrationEdgeKind>,\n): MigrationEdgeKind {\n  return kindByMigrationHash.get(migrationHash) ?? 'forward';\n}\n\nfunction formatMigrationRow(\n  migration: MigrationListEntry,\n  dirNameWidth: number,\n  edgeKind: MigrationEdgeKind,\n  glyphMode: GlyphMode,\n  style: MigrationListStyler,\n): string {\n  const kindColumn = `${style.kind(migrationListKindGlyph(glyphMode, edgeKind))} `;\n  const data = formatMigrationDataColumn(migration, {\n    dirNameWidth,\n    edgeKind,\n    style,\n    forwardArrow: migrationListForwardArrow(glyphMode),\n    emptySource: migrationListEmptySource(glyphMode),\n  });\n  return `${kindColumn}${data}`;\n}\n\nfunction formatEmptyStateLine(spaceId: string, style: MigrationListStyler): string {\n  return style.emptyState(`There are no migrations in migrations/${spaceId}/ yet`);\n}\n\nfunction renderSpaceBlock(\n  spaceId: string,\n  migrations: readonly MigrationListEntry[],\n  multiSpace: boolean,\n  glyphMode: GlyphMode,\n  kindByMigrationHash: ReadonlyMap<string, MigrationEdgeKind>,\n  style: MigrationListStyler,\n): readonly string[] {\n  if (migrations.length === 0) {\n    const emptyLine = formatEmptyStateLine(spaceId, style);\n    if (!multiSpace) {\n      return [emptyLine];\n    }\n    return [style.spaceHeading(`${spaceId}:`), `  ${emptyLine}`];\n  }\n\n  const dirNameWidth = computeMigrationDirNameWidth(migrations);\n  const rows = migrations.map((entry) =>\n    formatMigrationRow(\n      entry,\n      dirNameWidth,\n      resolveEdgeKind(entry.migrationHash, kindByMigrationHash),\n      glyphMode,\n      style,\n    ),\n  );\n  if (!multiSpace) {\n    return rows;\n  }\n  return [style.spaceHeading(`${spaceId}:`), ...rows.map((row) => `  ${row}`)];\n}\n\nexport function buildMigrationListTopologyBySpace(\n  result: MigrationListResult,\n): ReadonlyMap<string, MigrationListGraphTopology> {\n  const topologyBySpaceId = new Map<string, MigrationListGraphTopology>();\n  for (const space of result.spaces) {\n    topologyBySpaceId.set(space.spaceId, classifyMigrationListGraphTopology(space.migrations));\n  }\n  return topologyBySpaceId;\n}\n\n/**\n * Compose the styled `migration list` output. The renderer is\n * presentation-neutral — every token passes through `style` before\n * landing in the output, so the same composition serves the pure-text\n * path ({@link renderMigrationList} via\n * {@link IDENTITY_MIGRATION_LIST_STYLER}) and the ANSI-styled CLI path\n * (via the ANSI styler the CLI shell wires up).\n */\nexport function renderMigrationListWithStyle(\n  result: MigrationListResult,\n  style: MigrationListStyler,\n  glyphMode: GlyphMode = 'unicode',\n  topologyBySpaceId: ReadonlyMap<\n    string,\n    MigrationListGraphTopology\n  > = buildMigrationListTopologyBySpace(result),\n): string {\n  const multiSpace = result.spaces.length > 1;\n  const lines: string[] = [];\n\n  for (let index = 0; index < result.spaces.length; index++) {\n    const space = result.spaces[index]!;\n    if (index > 0) {\n      lines.push('');\n    }\n    const topology = topologyBySpaceId.get(space.spaceId);\n    const kindByMigrationHash =\n      topology?.kindByMigrationHash ??\n      classifyMigrationListGraphTopology(space.migrations).kindByMigrationHash;\n    lines.push(\n      ...renderSpaceBlock(\n        space.spaceId,\n        space.migrations,\n        multiSpace,\n        glyphMode,\n        kindByMigrationHash,\n        style,\n      ),\n    );\n  }\n\n  const totalMigrations = result.spaces.reduce(\n    (count, space) => count + space.migrations.length,\n    0,\n  );\n  if (totalMigrations > 0) {\n    lines.push('');\n    lines.push(style.summary(result.summary));\n  }\n\n  return lines.join('\\n');\n}\n\nexport function renderMigrationList(result: MigrationListResult): string {\n  return renderMigrationListWithStyle(result, IDENTITY_MIGRATION_LIST_STYLER);\n}\n","import { bold, cyan, cyanBright, dim, green, yellow } from 'colorette';\nimport { IDENTITY_MIGRATION_LIST_STYLER, type MigrationListStyler } from './migration-list-render';\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 */\nexport const CONTRACT_MARKER_NAME = 'contract';\n\nfunction styleRefName(name: string): string {\n  return name === CONTRACT_MARKER_NAME ? bold(green(name)) : green(name);\n}\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 * - `refs` (`(...)`): green; the `contract` desired-state marker inside is\n *   green-bold (the active ref is bolded separately by the tree styler)\n * - `spaceHeading` (`<spaceId>:`): bold\n * - `summary`: dim\n * - `emptyState`: dim\n */\nexport function createAnsiMigrationListStyler(opts: {\n  readonly useColor: boolean;\n}): MigrationListStyler {\n  if (!opts.useColor) {\n    return IDENTITY_MIGRATION_LIST_STYLER;\n  }\n  return {\n    // Kind glyphs stay bright in both flat and graph views; lanes carry the dim gutter.\n    kind: (text) => text,\n    dirName: (text) => bold(text),\n    sourceHash: (text) => dim(cyan(text)),\n    destHash: (text) => cyanBright(text),\n    glyph: (text) => dim(text),\n    lane: (text) => dim(text),\n    invariants: (ids) => yellow(`{${ids.join(', ')}}`),\n    refs: (names) => {\n      const open = green('(');\n      const close = green(')');\n      const separator = green(', ');\n      return open + names.map(styleRefName).join(separator) + close;\n    },\n    spaceHeading: (text) => bold(text),\n    summary: (text) => dim(text),\n    emptyState: (text) => dim(text),\n  };\n}\n"],"mappings":";;;AAwBA,SAAS,mBAAmB,GAAmB,GAA2B;CACxE,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO;AAC1C;AAEA,SAAS,WAAW,KAA0B,KAAmB;CAC/D,IAAI,IAAI,MAAM,IAAI,IAAI,GAAG,KAAK,KAAK,CAAC;AACtC;AAEA,SAAS,qBACP,OACA,YACmB;CACnB,MAAM,2BAAW,IAAI,IAAoB;CACzC,KAAK,MAAM,QAAQ,OACjB,SAAS,IAAI,MAAM,CAAC;CAEtB,KAAK,MAAM,QAAQ,YACjB,WAAW,UAAU,KAAK,EAAE;CAG9B,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,QAAQ,OACjB,KAAK,SAAS,IAAI,IAAI,KAAK,OAAO,GAChC,MAAM,KAAK,IAAI;CAGnB,MAAM,MAAM,GAAG,MAAM;EACnB,IAAI,MAAM,qBAAqB,OAAO;EACtC,IAAI,MAAM,qBAAqB,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;CACD,IAAI,MAAM,SAAS,GAAG,OAAO;CAE7B,OAAO,CAAC,GAAG,KAAK,EAAE,MAAM,GAAG,MAAM;EAC/B,IAAI,MAAM,qBAAqB,OAAO;EACtC,IAAI,MAAM,qBAAqB,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;AACH;AAEA,SAAS,kBACP,OACA,YACqB;CACrB,MAAM,wBAAQ,IAAI,IAAoB;CACtC,KAAK,MAAM,QAAQ,qBAAqB,OAAO,UAAU,GACvD,MAAM,IAAI,MAAM,CAAC;CAGnB,MAAM,YAAY,MAAM;CACxB,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,UAAU;EACd,KAAK,MAAM,QAAQ,YAAY;GAC7B,MAAM,OAAO,MAAM,IAAI,KAAK,IAAI;GAChC,IAAI,SAAS,KAAA,GAAW;GACxB,MAAM,OAAO,OAAO;GACpB,IAAI,QAAQ,MAAM,IAAI,KAAK,EAAE,KAAK,KAAK;IACrC,MAAM,IAAI,KAAK,IAAI,IAAI;IACvB,UAAU;GACZ;EACF;EACA,IAAI,CAAC,SAAS;CAChB;CAEA,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,MAAM,IAAI,IAAI,GACjB,MAAM,IAAI,MAAM,CAAC;CAIrB,OAAO;AACT;AAEA,SAAS,gBACP,OACA,MACA,YACS;CACT,IAAI,UAAU,MAAM,OAAO;CAE3B,MAAM,2BAAW,IAAI,IAAsB;CAC3C,KAAK,MAAM,QAAQ,YAAY;EAC7B,MAAM,SAAS,SAAS,IAAI,KAAK,IAAI;EACrC,IAAI,QAAQ,OAAO,KAAK,KAAK,EAAE;OAC1B,SAAS,IAAI,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC;CACxC;CAEA,MAAM,UAAU,IAAI,IAAY,CAAC,KAAK,CAAC;CACvC,MAAM,QAAQ,CAAC,KAAK;CACpB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,OAAO,MAAM,MAAM;EACzB,IAAI,SAAS,KAAA,GAAW;EACxB,KAAK,MAAM,QAAQ,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG;GAC3C,IAAI,SAAS,MAAM,OAAO;GAC1B,IAAI,CAAC,QAAQ,IAAI,IAAI,GAAG;IACtB,QAAQ,IAAI,IAAI;IAChB,MAAM,KAAK,IAAI;GACjB;EACF;CACF;CAEA,OAAO;AACT;AAEA,SAAS,sBACP,OACA,YACA,MACS;CAET,MAAM,eAAe,kBAAkB,OADvB,WAAW,QAAQ,cAAc,cAAc,IACX,CAAC;CACrD,MAAM,YAAY,kBAAkB,OAAO,UAAU;CACrD,MAAM,YAAY,aAAa,IAAI,KAAK,IAAI,KAAK;CAEjD,QADe,UAAU,IAAI,KAAK,EAAE,KAAK,KACzB;AAClB;AAUA,SAAS,sBACP,OACA,YACA,MACS;CACT,MAAM,UAAU,WAAW,QAAQ,cAAc,cAAc,IAAI;CACnE,MAAM,eAAe,kBAAkB,OAAO,OAAO;CACrD,MAAM,YAAY,aAAa,IAAI,KAAK,IAAI,KAAK;CACjD,MAAM,YAAY,aAAa,IAAI,KAAK,EAAE,KAAK;CAE/C,IAAI,gBAAgB,KAAK,IAAI,KAAK,MAAM,OAAO,KAAK,YAAY,YAAY,GAC1E,OAAO;CAGT,OAAO,CAAC,sBAAsB,OAAO,YAAY,IAAI;AACvD;AAEA,SAAS,4BACP,OACA,qBACA,SACM;CACN,IAAI,aAAa,QAAQ,QAAQ,SAAS,oBAAoB,IAAI,KAAK,IAAI,MAAM,SAAS;CAE1F,OAAO,WAAW,SAAS,GAAG;EAC5B,MAAM,qBAAqB,WAAW,QAAQ,SAC5C,sBAAsB,OAAO,YAAY,IAAI,CAC/C;EACA,IAAI,mBAAmB,WAAW,GAAG;EAErC,mBAAmB,KAAK,kBAAkB;EAC1C,MAAM,WAAW,mBAAmB;EACpC,IAAI,aAAa,KAAA,GAAW;EAE5B,oBAAoB,IAAI,SAAS,MAAM,UAAU;EACjD,aAAa,WAAW,QAAQ,SAAS,SAAS,QAAQ;CAC5D;AACF;;;;;;;AAQA,SAAS,wBAAwB,OAA8D;CAC7F,MAAM,wBAAQ,IAAI,IAAY;CAC9B,MAAM,sCAAsB,IAAI,IAA+B;CAC/D,MAAM,iCAAiB,IAAI,IAA8B;CACzD,MAAM,UAA4B,CAAC;CAEnC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,IAAI,KAAK,IAAI;EACnB,MAAM,IAAI,KAAK,EAAE;EAEjB,IAAI,KAAK,SAAS,KAAK,IAAI;GACzB,oBAAoB,IAAI,KAAK,MAAM,MAAM;GACzC;EACF;EAEA,QAAQ,KAAK,IAAI;EACjB,MAAM,SAAS,eAAe,IAAI,KAAK,IAAI;EAC3C,IAAI,QAAQ,OAAO,KAAK,IAAI;OACvB,eAAe,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;CAC3C;CAEA,KAAK,MAAM,UAAU,eAAe,OAAO,GACzC,OAAO,KAAK,kBAAkB;CAGhC,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,QAAQ,OACjB,gBAAgB,IAAI,MAAM,CAAC;CAE7B,KAAK,MAAM,UAAU,eAAe,OAAO,GACzC,KAAK,MAAM,QAAQ,QACjB,WAAW,iBAAiB,KAAK,EAAE;CAIvC,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,QAAQ,OACjB,KAAK,gBAAgB,IAAI,IAAI,KAAK,OAAO,GACvC,SAAS,KAAK,IAAI;CAGtB,SAAS,MAAM,GAAG,MAAM;EACtB,IAAI,MAAM,qBAAqB,OAAO;EACtC,IAAI,MAAM,qBAAqB,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;CACD,IAAI,SAAS,WAAW,GACtB,SAAS,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;CAGhE,MAAM,QAAQ;CACd,MAAM,OAAO;CACb,MAAM,QAAQ;CACd,MAAM,wBAAQ,IAAI,IAAoB;CACtC,MAAM,4BAAY,IAAI,IAAgC;CACtD,KAAK,MAAM,QAAQ,OACjB,MAAM,IAAI,MAAM,KAAK;CAQvB,MAAM,QAAiB,CAAC;CAExB,SAAS,qBAAqB,UAAkB,MAAuB;EACrE,OAAO,UAAU,IAAI,IAAI,MAAM;CACjC;CAEA,SAAS,UAAU,MAAc,QAAkC;EACjE,MAAM,IAAI,MAAM,IAAI;EACpB,UAAU,IAAI,MAAM,MAAM;EAC1B,MAAM,KAAK;GAAE;GAAM,UAAU,eAAe,IAAI,IAAI,KAAK,CAAC;GAAG,OAAO;EAAE,CAAC;CACzE;CAEA,SAAS,WAAW,MAAoB;EACtC,IAAI,MAAM,IAAI,IAAI,MAAM,OAAO;EAC/B,UAAU,MAAM,KAAA,CAAS;EAEzB,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,QAAQ,MAAM,MAAM,SAAS;GACnC,IAAI,UAAU,KAAA,GAAW;GACzB,IAAI,MAAM,SAAS,MAAM,SAAS,QAAQ;IACxC,MAAM,IAAI,MAAM,MAAM,KAAK;IAC3B,MAAM,IAAI;IACV;GACF;GAEA,MAAM,OAAO,MAAM,SAAS,MAAM;GAClC,MAAM,SAAS;GACf,IAAI,SAAS,KAAA,GAAW;GAExB,MAAM,IAAI,KAAK;GACf,MAAM,SAAS,MAAM,IAAI,CAAC;GAC1B,IAAI,WAAW,QAAQ,qBAAqB,GAAG,MAAM,IAAI,GACvD,oBAAoB,IAAI,KAAK,MAAM,UAAU;QACxC;IACL,oBAAoB,IAAI,KAAK,MAAM,SAAS;IAC5C,IAAI,WAAW,OACb,UAAU,GAAG,MAAM,IAAI;GAE3B;EACF;CACF;CAEA,KAAK,MAAM,QAAQ,UACjB,WAAW,IAAI;CAEjB,MAAM,iBAAiB,CAAC,GAAG,KAAK,EAAE,QAAQ,SAAS,MAAM,IAAI,IAAI,MAAM,KAAK;CAC5E,eAAe,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;CAChD,KAAK,MAAM,QAAQ,gBACjB,WAAW,IAAI;CAGjB,4BAA4B,OAAO,qBAAqB,OAAO;CAE/D,MAAM,kCAAkB,IAAI,IAAoB;CAChD,MAAM,mCAAmB,IAAI,IAAoB;CAEjD,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,oBAAoB,IAAI,KAAK,IAAI,MAAM,WAAW;EACtD,WAAW,kBAAkB,KAAK,IAAI;EACtC,WAAW,iBAAiB,KAAK,EAAE;CACrC;CAEA,OAAO;EACL;EACA;EACA;CACF;AACF;AAEA,SAAS,cAAc,MAA6B;CAClD,OAAO,QAAQ;AACjB;;;;;;;AAQA,SAAgB,mCACd,SAC4B;CAO5B,OAAO,wBAN8B,QAAQ,KAAK,WAAW;EAC3D,MAAM,MAAM;EACZ,MAAM,cAAc,MAAM,IAAI;EAC9B,IAAI,MAAM;EACV,SAAS,MAAM;CACjB,EACwC,CAAC;AAC3C;;;;;;AAOA,SAAgB,+BAA+B,OAAmD;CAChG,MAAM,aAA+B,CAAC;CACtC,KAAK,MAAM,SAAS,MAAM,aAAa,OAAO,GAC5C,KAAK,MAAM,QAAQ,OACjB,WAAW,KAAK;EACd,MAAM,KAAK;EACX,MAAM,KAAK;EACX,IAAI,KAAK;EACT,SAAS,KAAK;CAChB,CAAC;CAGL,OAAO,wBAAwB,UAAU;AAC3C;ACnWA,MAAa,oCAAuE;CAClF,SAAS;CACT,UAAU;CACV,MAAM;AACR;AAEA,MAAa,kCAAqE;CAChF,SAAS;CACT,UAAU;CACV,MAAM;AACR;AAEA,SAAgB,uBAAuB,WAAsB,UAAqC;CAChG,OAAO,cAAc,UACjB,gCAAgC,YAChC,kCAAkC;AACxC;AAEA,SAAgB,0BAA0B,WAA8B;CACtE,OAAO,cAAc,UAAA,OAAA;AAGvB;AAEA,SAAgB,yBAAyB,WAA8B;CACrE,OAAO,cAAc,UAAA,MAAA;AACvB;AAEA,SAAgB,uBAAuB,MAAsB;CAE3D,QADiB,KAAK,WAAW,SAAS,IAAI,KAAK,MAAM,CAAC,IAAI,MAC9C,MAAM,GAAA,CAA4B;AACpD;AAEA,SAAgB,6BAA6B,YAAmD;CAC9F,IAAI,WAAW,WAAW,GAAG,OAAO;CACpC,OAAO,KAAK,IAAI,GAAG,WAAW,KAAK,UAAU,MAAM,QAAQ,MAAM,CAAC,IAAI;AACxE;AAEA,SAAS,mBACP,MACA,OACA,aACQ;CACR,IAAI,SAAS,MACX,OAAO,MAAM,MAAM,WAAW,IAAI,IAAI,OAAA,IAAmC,YAAY,MAAM;CAE7F,OAAO,MAAM,WAAW,uBAAuB,IAAI,CAAC;AACtD;AAEA,SAAgB,kBACd,oBACA,MACA,OACQ;CACR,MAAM,SAAmB,CAAC;CAC1B,IAAI,mBAAmB,SAAS,GAC9B,OAAO,KAAK,MAAM,WAAW,kBAAkB,CAAC;CAElD,IAAI,KAAK,SAAS,GAChB,OAAO,KAAK,MAAM,KAAK,IAAI,CAAC;CAE9B,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,OAAO,KAAsC,OAAO,KAAK,GAAG;AAC9D;AAUA,SAAgB,0BACd,WACA,SACQ;CACR,MAAM,EACJ,cACA,UACA,OACA,eAAA,KACA,cAAA,QACE;CACJ,MAAM,iBAAiB,IAAI,OAAO,KAAK,IAAI,GAAG,eAAe,UAAU,QAAQ,MAAM,CAAC;CACtF,MAAM,UAAU,GAAG,MAAM,QAAQ,UAAU,OAAO,IAAI;CACtD,MAAM,cAAc,kBAAkB,UAAU,oBAAoB,UAAU,MAAM,KAAK;CAEzF,IAAI,aAAa,QAAQ;EACvB,MAAM,eAAe,UAAU,QAAQ,UAAU;EAEjD,OAAO,GAAG,UADG,MAAM,WAAW,uBAAuB,YAAY,CAC1C,IAAI;CAC7B;CAKA,OAAO,GAAG,UAHK,mBAAmB,UAAU,MAAM,OAAO,WAGhC,EAAE,GAFb,MAAM,MAAM,YAEQ,EAAE,GADvB,MAAM,SAAS,uBAAuB,UAAU,EAAE,CACrB,IAAI;AAChD;;;AC5DA,MAAa,iCAAsD;CACjE,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;AACxB;AAEA,SAAS,gBACP,eACA,qBACmB;CACnB,OAAO,oBAAoB,IAAI,aAAa,KAAK;AACnD;AAEA,SAAS,mBACP,WACA,cACA,UACA,WACA,OACQ;CASR,OAAO,GAAG,GARY,MAAM,KAAK,uBAAuB,WAAW,QAAQ,CAAC,EAAE,KACjE,0BAA0B,WAAW;EAChD;EACA;EACA;EACA,cAAc,0BAA0B,SAAS;EACjD,aAAa,yBAAyB,SAAS;CACjD,CAC0B;AAC5B;AAEA,SAAS,qBAAqB,SAAiB,OAAoC;CACjF,OAAO,MAAM,WAAW,yCAAyC,QAAQ,MAAM;AACjF;AAEA,SAAS,iBACP,SACA,YACA,YACA,WACA,qBACA,OACmB;CACnB,IAAI,WAAW,WAAW,GAAG;EAC3B,MAAM,YAAY,qBAAqB,SAAS,KAAK;EACrD,IAAI,CAAC,YACH,OAAO,CAAC,SAAS;EAEnB,OAAO,CAAC,MAAM,aAAa,GAAG,QAAQ,EAAE,GAAG,KAAK,WAAW;CAC7D;CAEA,MAAM,eAAe,6BAA6B,UAAU;CAC5D,MAAM,OAAO,WAAW,KAAK,UAC3B,mBACE,OACA,cACA,gBAAgB,MAAM,eAAe,mBAAmB,GACxD,WACA,KACF,CACF;CACA,IAAI,CAAC,YACH,OAAO;CAET,OAAO,CAAC,MAAM,aAAa,GAAG,QAAQ,EAAE,GAAG,GAAG,KAAK,KAAK,QAAQ,KAAK,KAAK,CAAC;AAC7E;AAEA,SAAgB,kCACd,QACiD;CACjD,MAAM,oCAAoB,IAAI,IAAwC;CACtE,KAAK,MAAM,SAAS,OAAO,QACzB,kBAAkB,IAAI,MAAM,SAAS,mCAAmC,MAAM,UAAU,CAAC;CAE3F,OAAO;AACT;;;;;;;;;AAUA,SAAgB,6BACd,QACA,OACA,YAAuB,WACvB,oBAGI,kCAAkC,MAAM,GACpC;CACR,MAAM,aAAa,OAAO,OAAO,SAAS;CAC1C,MAAM,QAAkB,CAAC;CAEzB,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,OAAO,QAAQ,SAAS;EACzD,MAAM,QAAQ,OAAO,OAAO;EAC5B,IAAI,QAAQ,GACV,MAAM,KAAK,EAAE;EAGf,MAAM,sBADW,kBAAkB,IAAI,MAAM,OAEpC,GAAG,uBACV,mCAAmC,MAAM,UAAU,EAAE;EACvD,MAAM,KACJ,GAAG,iBACD,MAAM,SACN,MAAM,YACN,YACA,WACA,qBACA,KACF,CACF;CACF;CAMA,IAJwB,OAAO,OAAO,QACnC,OAAO,UAAU,QAAQ,MAAM,WAAW,QAC3C,CAEgB,IAAI,GAAG;EACvB,MAAM,KAAK,EAAE;EACb,MAAM,KAAK,MAAM,QAAQ,OAAO,OAAO,CAAC;CAC1C;CAEA,OAAO,MAAM,KAAK,IAAI;AACxB;;;;;;;;;ACjLA,MAAa,uBAAuB;AAEpC,SAAS,aAAa,MAAsB;CAC1C,OAAO,SAAA,aAAgC,KAAK,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI;AACvE;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,8BAA8B,MAEtB;CACtB,IAAI,CAAC,KAAK,UACR,OAAO;CAET,OAAO;EAEL,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,OAAO,UAAU;GACf,MAAM,OAAO,MAAM,GAAG;GACtB,MAAM,QAAQ,MAAM,GAAG;GACvB,MAAM,YAAY,MAAM,IAAI;GAC5B,OAAO,OAAO,MAAM,IAAI,YAAY,EAAE,KAAK,SAAS,IAAI;EAC1D;EACA,eAAe,SAAS,KAAK,IAAI;EACjC,UAAU,SAAS,IAAI,IAAI;EAC3B,aAAa,SAAS,IAAI,IAAI;CAChC;AACF"}