prisma-next 0.12.0-dev.20 → 0.12.0-dev.22

package/dist/{migration-list-styler-COQbZmXk.mjs → migration-list-styler-CsMECsY4.mjs}

@@ -409,6 +409,6 @@ function createAnsiMigrationListStyler(opts) {
 	};
 }
 //#endregion
-export { migrationListEmptySource as a, renderMigrationListWithStyle as i, createAnsiMigrationListStyler as n, migrationListForwardArrow as o, buildMigrationListTopologyBySpace as r, classifyMigrationGraphTopology as s, CONTRACT_MARKER_NAME as t };
+export { renderMigrationListWithStyle as a, migrationListForwardArrow as c, buildMigrationListTopologyBySpace as i, classifyMigrationGraphTopology as l, createAnsiMigrationListStyler as n, abbreviateContractHash as o, IDENTITY_MIGRATION_LIST_STYLER as r, migrationListEmptySource as s, CONTRACT_MARKER_NAME as t };
 
-//# sourceMappingURL=migration-list-styler-COQbZmXk.mjs.map
+//# sourceMappingURL=migration-list-styler-CsMECsY4.mjs.map

package/dist/{migration-list-styler-COQbZmXk.mjs.map → migration-list-styler-CsMECsY4.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"migration-list-styler-COQbZmXk.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 compareNodesRootFirst(a: string, b: string): number {\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 * Shortest-path distance of each node from the forward roots, over the given\n * candidate edges. Roots are the in-degree-0 nodes (baseline first, then lex);\n * a rooted component therefore distances every node by how many forward steps\n * it sits from a root. A component with no root (a pure cycle) is seeded from\n * its single lexically-smallest node so the cycle still gets a stable layering.\n *\n * Crucially this is *shortest* path, not longest: a backward (rollback) edge\n * `deep → shallow` never offers a shorter route to the already-shallower\n * target, so it is inert here. Distances are thus stable whether or not the\n * rollbacks are still in the candidate set — which is what lets the peel below\n * tell a genuine back-edge (target strictly shallower than source) apart from a\n * forward edge that merely happens to share the back-edge's cycle.\n */\nfunction forwardDistances(\n  nodes: ReadonlySet<string>,\n  candidates: readonly NormalizedEdge[],\n): Map<string, number> {\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 = [...nodes].filter((node) => (inDegree.get(node) ?? 0) === 0);\n  roots.sort(compareNodesRootFirst);\n  const seeds = roots.length > 0 ? roots : [...nodes].sort(compareNodesRootFirst).slice(0, 1);\n\n  const dist = new Map<string, number>();\n  for (const seed of seeds) {\n    dist.set(seed, 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 = dist.get(edge.from);\n      if (base === undefined) continue;\n      const next = base + 1;\n      if (next < (dist.get(edge.to) ?? Number.POSITIVE_INFINITY)) {\n        dist.set(edge.to, next);\n        changed = true;\n      }\n    }\n    if (!changed) break;\n  }\n\n  for (const node of nodes) {\n    if (!dist.has(node)) {\n      dist.set(node, 0);\n    }\n  }\n\n  return dist;\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\n/**\n * Demote node-skipping rollbacks left forward by the DFS. An edge `from → to`\n * is a rollback exactly when both hold:\n *   1. `to` is a forward-ancestor of `from` — `to` can still reach `from` over\n *      the other forward edges, so the edge closes a cycle; and\n *   2. `to` is strictly shallower than `from` (smaller forward distance) — the\n *      edge points back toward the root rather than advancing history.\n *\n * Condition 2 is the discriminator: in a cycle created by a rollback every edge\n * satisfies condition 1, but only the rollback itself runs deep → shallow. The\n * forward chain edges run shallow → deep and are never peeled, however many\n * rollbacks converge on the same target. Tight back-edges whose source and\n * target sit at the same distance (mutual two-node cycles) are already resolved\n * by the DFS immediate-parent rule, so they never reach this pass. One edge is\n * peeled per iteration (dirName-descending tie-break) and distances/reachability\n * are recomputed, making the outcome independent of edge input order.\n */\nfunction peelNodeSkippingRollbacks(\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 dist = forwardDistances(nodes, candidates);\n    const backEdges = candidates.filter((edge) => {\n      const toDist = dist.get(edge.to) ?? 0;\n      const fromDist = dist.get(edge.from) ?? 0;\n      if (toDist >= fromDist) return false;\n      const without = candidates.filter((candidate) => candidate !== edge);\n      return canReachForward(edge.to, edge.from, without);\n    });\n    if (backEdges.length === 0) break;\n\n    backEdges.sort(compareDirNameDesc);\n    const rollback = backEdges[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 demotes node-skipping rollbacks (target is\n * a forward-ancestor of the source and sits strictly shallower than it).\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  peelNodeSkippingRollbacks(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,sBAAsB,GAAW,GAAmB;CAC3D,IAAI,MAAM,qBAAqB,OAAO;CACtC,IAAI,MAAM,qBAAqB,OAAO;CACtC,OAAO,EAAE,cAAc,CAAC;AAC1B;;;;;;;;;;;;;;;AAgBA,SAAS,iBACP,OACA,YACqB;CACrB,MAAM,2BAAW,IAAI,IAAoB;CACzC,KAAK,MAAM,QAAQ,OACjB,SAAS,IAAI,MAAM,CAAC;CAEtB,KAAK,MAAM,QAAQ,YACjB,WAAW,UAAU,KAAK,EAAE;CAG9B,MAAM,QAAQ,CAAC,GAAG,KAAK,EAAE,QAAQ,UAAU,SAAS,IAAI,IAAI,KAAK,OAAO,CAAC;CACzE,MAAM,KAAK,qBAAqB;CAChC,MAAM,QAAQ,MAAM,SAAS,IAAI,QAAQ,CAAC,GAAG,KAAK,EAAE,KAAK,qBAAqB,EAAE,MAAM,GAAG,CAAC;CAE1F,MAAM,uBAAO,IAAI,IAAoB;CACrC,KAAK,MAAM,QAAQ,OACjB,KAAK,IAAI,MAAM,CAAC;CAGlB,MAAM,YAAY,MAAM;CACxB,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,UAAU;EACd,KAAK,MAAM,QAAQ,YAAY;GAC7B,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI;GAC/B,IAAI,SAAS,KAAA,GAAW;GACxB,MAAM,OAAO,OAAO;GACpB,IAAI,QAAQ,KAAK,IAAI,KAAK,EAAE,KAAK,OAAO,oBAAoB;IAC1D,KAAK,IAAI,KAAK,IAAI,IAAI;IACtB,UAAU;GACZ;EACF;EACA,IAAI,CAAC,SAAS;CAChB;CAEA,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,KAAK,IAAI,IAAI,GAChB,KAAK,IAAI,MAAM,CAAC;CAIpB,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;;;;;;;;;;;;;;;;;;AAmBA,SAAS,0BACP,OACA,qBACA,SACM;CACN,IAAI,aAAa,QAAQ,QAAQ,SAAS,oBAAoB,IAAI,KAAK,IAAI,MAAM,SAAS;CAE1F,OAAO,WAAW,SAAS,GAAG;EAC5B,MAAM,OAAO,iBAAiB,OAAO,UAAU;EAC/C,MAAM,YAAY,WAAW,QAAQ,SAAS;GAG5C,KAFe,KAAK,IAAI,KAAK,EAAE,KAAK,OACnB,KAAK,IAAI,KAAK,IAAI,KAAK,IAChB,OAAO;GAC/B,MAAM,UAAU,WAAW,QAAQ,cAAc,cAAc,IAAI;GACnE,OAAO,gBAAgB,KAAK,IAAI,KAAK,MAAM,OAAO;EACpD,CAAC;EACD,IAAI,UAAU,WAAW,GAAG;EAE5B,UAAU,KAAK,kBAAkB;EACjC,MAAM,WAAW,UAAU;EAC3B,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,0BAA0B,OAAO,qBAAqB,OAAO;CAE7D,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;ACnVA,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"}
+{"version":3,"file":"migration-list-styler-CsMECsY4.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 compareNodesRootFirst(a: string, b: string): number {\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 * Shortest-path distance of each node from the forward roots, over the given\n * candidate edges. Roots are the in-degree-0 nodes (baseline first, then lex);\n * a rooted component therefore distances every node by how many forward steps\n * it sits from a root. A component with no root (a pure cycle) is seeded from\n * its single lexically-smallest node so the cycle still gets a stable layering.\n *\n * Crucially this is *shortest* path, not longest: a backward (rollback) edge\n * `deep → shallow` never offers a shorter route to the already-shallower\n * target, so it is inert here. Distances are thus stable whether or not the\n * rollbacks are still in the candidate set — which is what lets the peel below\n * tell a genuine back-edge (target strictly shallower than source) apart from a\n * forward edge that merely happens to share the back-edge's cycle.\n */\nfunction forwardDistances(\n  nodes: ReadonlySet<string>,\n  candidates: readonly NormalizedEdge[],\n): Map<string, number> {\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 = [...nodes].filter((node) => (inDegree.get(node) ?? 0) === 0);\n  roots.sort(compareNodesRootFirst);\n  const seeds = roots.length > 0 ? roots : [...nodes].sort(compareNodesRootFirst).slice(0, 1);\n\n  const dist = new Map<string, number>();\n  for (const seed of seeds) {\n    dist.set(seed, 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 = dist.get(edge.from);\n      if (base === undefined) continue;\n      const next = base + 1;\n      if (next < (dist.get(edge.to) ?? Number.POSITIVE_INFINITY)) {\n        dist.set(edge.to, next);\n        changed = true;\n      }\n    }\n    if (!changed) break;\n  }\n\n  for (const node of nodes) {\n    if (!dist.has(node)) {\n      dist.set(node, 0);\n    }\n  }\n\n  return dist;\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\n/**\n * Demote node-skipping rollbacks left forward by the DFS. An edge `from → to`\n * is a rollback exactly when both hold:\n *   1. `to` is a forward-ancestor of `from` — `to` can still reach `from` over\n *      the other forward edges, so the edge closes a cycle; and\n *   2. `to` is strictly shallower than `from` (smaller forward distance) — the\n *      edge points back toward the root rather than advancing history.\n *\n * Condition 2 is the discriminator: in a cycle created by a rollback every edge\n * satisfies condition 1, but only the rollback itself runs deep → shallow. The\n * forward chain edges run shallow → deep and are never peeled, however many\n * rollbacks converge on the same target. Tight back-edges whose source and\n * target sit at the same distance (mutual two-node cycles) are already resolved\n * by the DFS immediate-parent rule, so they never reach this pass. One edge is\n * peeled per iteration (dirName-descending tie-break) and distances/reachability\n * are recomputed, making the outcome independent of edge input order.\n */\nfunction peelNodeSkippingRollbacks(\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 dist = forwardDistances(nodes, candidates);\n    const backEdges = candidates.filter((edge) => {\n      const toDist = dist.get(edge.to) ?? 0;\n      const fromDist = dist.get(edge.from) ?? 0;\n      if (toDist >= fromDist) return false;\n      const without = candidates.filter((candidate) => candidate !== edge);\n      return canReachForward(edge.to, edge.from, without);\n    });\n    if (backEdges.length === 0) break;\n\n    backEdges.sort(compareDirNameDesc);\n    const rollback = backEdges[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 demotes node-skipping rollbacks (target is\n * a forward-ancestor of the source and sits strictly shallower than it).\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  peelNodeSkippingRollbacks(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,sBAAsB,GAAW,GAAmB;CAC3D,IAAI,MAAM,qBAAqB,OAAO;CACtC,IAAI,MAAM,qBAAqB,OAAO;CACtC,OAAO,EAAE,cAAc,CAAC;AAC1B;;;;;;;;;;;;;;;AAgBA,SAAS,iBACP,OACA,YACqB;CACrB,MAAM,2BAAW,IAAI,IAAoB;CACzC,KAAK,MAAM,QAAQ,OACjB,SAAS,IAAI,MAAM,CAAC;CAEtB,KAAK,MAAM,QAAQ,YACjB,WAAW,UAAU,KAAK,EAAE;CAG9B,MAAM,QAAQ,CAAC,GAAG,KAAK,EAAE,QAAQ,UAAU,SAAS,IAAI,IAAI,KAAK,OAAO,CAAC;CACzE,MAAM,KAAK,qBAAqB;CAChC,MAAM,QAAQ,MAAM,SAAS,IAAI,QAAQ,CAAC,GAAG,KAAK,EAAE,KAAK,qBAAqB,EAAE,MAAM,GAAG,CAAC;CAE1F,MAAM,uBAAO,IAAI,IAAoB;CACrC,KAAK,MAAM,QAAQ,OACjB,KAAK,IAAI,MAAM,CAAC;CAGlB,MAAM,YAAY,MAAM;CACxB,KAAK,IAAI,OAAO,GAAG,OAAO,WAAW,QAAQ;EAC3C,IAAI,UAAU;EACd,KAAK,MAAM,QAAQ,YAAY;GAC7B,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI;GAC/B,IAAI,SAAS,KAAA,GAAW;GACxB,MAAM,OAAO,OAAO;GACpB,IAAI,QAAQ,KAAK,IAAI,KAAK,EAAE,KAAK,OAAO,oBAAoB;IAC1D,KAAK,IAAI,KAAK,IAAI,IAAI;IACtB,UAAU;GACZ;EACF;EACA,IAAI,CAAC,SAAS;CAChB;CAEA,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,KAAK,IAAI,IAAI,GAChB,KAAK,IAAI,MAAM,CAAC;CAIpB,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;;;;;;;;;;;;;;;;;;AAmBA,SAAS,0BACP,OACA,qBACA,SACM;CACN,IAAI,aAAa,QAAQ,QAAQ,SAAS,oBAAoB,IAAI,KAAK,IAAI,MAAM,SAAS;CAE1F,OAAO,WAAW,SAAS,GAAG;EAC5B,MAAM,OAAO,iBAAiB,OAAO,UAAU;EAC/C,MAAM,YAAY,WAAW,QAAQ,SAAS;GAG5C,KAFe,KAAK,IAAI,KAAK,EAAE,KAAK,OACnB,KAAK,IAAI,KAAK,IAAI,KAAK,IAChB,OAAO;GAC/B,MAAM,UAAU,WAAW,QAAQ,cAAc,cAAc,IAAI;GACnE,OAAO,gBAAgB,KAAK,IAAI,KAAK,MAAM,OAAO;EACpD,CAAC;EACD,IAAI,UAAU,WAAW,GAAG;EAE5B,UAAU,KAAK,kBAAkB;EACjC,MAAM,WAAW,UAAU;EAC3B,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,0BAA0B,OAAO,qBAAqB,OAAO;CAE7D,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;ACnVA,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"}

package/dist/migration-log-Cj-T-r0o.mjs

@@ -0,0 +1,203 @@
+import { t as loadConfig } from "./config-loader-B6sJjXTv.mjs";
+import { E as formatStyledHeader, I as errorDatabaseConnectionRequired, R as errorDriverRequired, _ as parseGlobalFlagsOrExit, b as handleResult, d as setCommandSeeAlso, f as targetSupportsMigrations, i as maskConnectionUrl, j as CliStructuredError, l as setCommandDescriptions, nt as errorUnexpected, rt as mapMigrationToolsError, s as resolveMigrationPaths, t as addGlobalOptions, u as setCommandExamples, v as createTerminalUI } from "./command-helpers-Cmdqyhz9.mjs";
+import { t as createControlClient } from "./client-BHe8szOW.mjs";
+import { n as createAnsiMigrationListStyler, o as abbreviateContractHash, r as IDENTITY_MIGRATION_LIST_STYLER } from "./migration-list-styler-CsMECsY4.mjs";
+import { Command } from "commander";
+import { notOk, ok } from "@prisma-next/utils/result";
+import stringWidth from "string-width";
+import { MigrationToolsError } from "@prisma-next/migration-tools/errors";
+//#region src/utils/formatters/migration-log-table.ts
+const HEADING_APPLIED_AT = "Applied at";
+const HEADING_SPACE = "Space";
+const HEADING_MIGRATION = "Migration";
+const HEADING_CHANGE = "Change";
+const HEADING_OPS = "Ops";
+const COLUMN_SEPARATOR = " ";
+const DIVIDER_CHAR = "─";
+function sortLedgerEntries(entries) {
+	return [...entries].sort((left, right) => {
+		const timeDiff = left.appliedAt.getTime() - right.appliedAt.getTime();
+		if (timeDiff !== 0) return timeDiff;
+		const spaceDiff = left.space.localeCompare(right.space);
+		if (spaceDiff !== 0) return spaceDiff;
+		return left.migrationName.localeCompare(right.migrationName);
+	});
+}
+function pad2(value) {
+	return String(value).padStart(2, "0");
+}
+function formatLedgerAppliedAt(date, mode) {
+	if (mode === "iso") return date.toISOString();
+	if (mode === "utc") return `${date.getUTCFullYear()}-${pad2(date.getUTCMonth() + 1)}-${pad2(date.getUTCDate())} ${pad2(date.getUTCHours())}:${pad2(date.getUTCMinutes())}:${pad2(date.getUTCSeconds())}Z`;
+	const offsetMinutes = -date.getTimezoneOffset();
+	const sign = offsetMinutes >= 0 ? "+" : "-";
+	const absoluteOffset = Math.abs(offsetMinutes);
+	const offsetHours = pad2(Math.floor(absoluteOffset / 60));
+	const offsetMins = pad2(absoluteOffset % 60);
+	return `${date.getFullYear()}-${pad2(date.getMonth() + 1)}-${pad2(date.getDate())} ${pad2(date.getHours())}:${pad2(date.getMinutes())}:${pad2(date.getSeconds())} ${sign}${offsetHours}:${offsetMins}`;
+}
+function formatHashEndpoint(hash) {
+	if (hash === null) return "∅";
+	return abbreviateContractHash(hash);
+}
+function formatHashTransition(from, to) {
+	return `${formatHashEndpoint(from)} → ${abbreviateContractHash(to)}`;
+}
+function styleHashTransition(from, to, styler) {
+	return `${from === null ? styler.glyph("∅") : styler.sourceHash(abbreviateContractHash(from))} ${styler.glyph("→")} ${styler.destHash(abbreviateContractHash(to))}`;
+}
+function padVisible(text, targetWidth) {
+	const padding = Math.max(0, targetWidth - stringWidth(text));
+	return text + " ".repeat(padding);
+}
+function columnWidth(values) {
+	return values.reduce((max, value) => Math.max(max, stringWidth(value)), 0);
+}
+function padDividerCell(valueWidth) {
+	return DIVIDER_CHAR.repeat(valueWidth + 2);
+}
+function padTextCell(value, valueWidth) {
+	return ` ${padVisible(value, valueWidth)} `;
+}
+function padOpsCell(value, valueWidth) {
+	const padding = Math.max(0, valueWidth - stringWidth(value));
+	return ` ${" ".repeat(padding)}${value} `;
+}
+function renderMigrationLogTable(entries, options = {}) {
+	const sorted = sortLedgerEntries(entries);
+	if (sorted.length === 0) return "";
+	const styler = options.styler ?? IDENTITY_MIGRATION_LIST_STYLER;
+	const showSpace = new Set(sorted.map((entry) => entry.space)).size > 1;
+	const timestampMode = options.utc ? "utc" : "local";
+	const rows = sorted.map((entry) => ({
+		appliedAt: formatLedgerAppliedAt(entry.appliedAt, timestampMode),
+		space: entry.space,
+		migrationName: entry.migrationName,
+		transition: formatHashTransition(entry.from, entry.to),
+		ops: `${entry.operationCount} ops`,
+		from: entry.from,
+		to: entry.to
+	}));
+	const appliedAtWidth = columnWidth([HEADING_APPLIED_AT, ...rows.map((row) => row.appliedAt)]);
+	const spaceWidth = showSpace ? columnWidth([HEADING_SPACE, ...rows.map((row) => row.space)]) : 0;
+	const nameWidth = columnWidth([HEADING_MIGRATION, ...rows.map((row) => row.migrationName)]);
+	const transitionWidth = columnWidth([HEADING_CHANGE, ...rows.map((row) => row.transition)]);
+	const opsWidth = columnWidth([HEADING_OPS, ...rows.map((row) => row.ops)]);
+	const headingParts = [padTextCell(HEADING_APPLIED_AT, appliedAtWidth)];
+	if (showSpace) headingParts.push(padTextCell(HEADING_SPACE, spaceWidth));
+	headingParts.push(padTextCell(HEADING_MIGRATION, nameWidth), padTextCell(HEADING_CHANGE, transitionWidth), padOpsCell(HEADING_OPS, opsWidth));
+	const heading = headingParts.join(COLUMN_SEPARATOR);
+	const dividerParts = [padDividerCell(appliedAtWidth)];
+	if (showSpace) dividerParts.push(padDividerCell(spaceWidth));
+	dividerParts.push(padDividerCell(nameWidth), padDividerCell(transitionWidth), padDividerCell(opsWidth));
+	return [
+		heading,
+		dividerParts.map((cell) => styler.summary(cell)).join(COLUMN_SEPARATOR),
+		...rows.map((row) => {
+			const parts = [padTextCell(row.appliedAt, appliedAtWidth)];
+			if (showSpace) parts.push(padTextCell(row.space, spaceWidth));
+			parts.push(padTextCell(styler.dirName(row.migrationName), nameWidth), padTextCell(styleHashTransition(row.from, row.to, styler), transitionWidth), padOpsCell(row.ops, opsWidth));
+			return parts.join(COLUMN_SEPARATOR);
+		})
+	].join("\n");
+}
+function serializeLedgerEntriesForJson(entries) {
+	return sortLedgerEntries(entries).map(({ appliedAt, ...rest }) => ({
+		...rest,
+		appliedAt: formatLedgerAppliedAt(appliedAt, "iso")
+	}));
+}
+const MIGRATION_LOG_EMPTY_MESSAGE = "No migrations have been applied to this database.";
+//#endregion
+//#region src/commands/migration-log.ts
+async function executeMigrationLogCommand(options, flags, ui) {
+	const config = await loadConfig(options.config);
+	const { configPath } = resolveMigrationPaths(options.config, config);
+	const dbConnection = options.db ?? config.db?.connection;
+	if (!dbConnection) return notOk(errorDatabaseConnectionRequired({
+		why: `Database connection is required for migration log (set db.connection in ${configPath}, or pass --db <url>)`,
+		commandName: "migration log"
+	}));
+	if (!config.driver) return notOk(errorDriverRequired({ why: "Config.driver is required for migration log" }));
+	if (!targetSupportsMigrations(config.target)) return notOk(errorUnexpected("Target does not support migrations"));
+	if (!flags.json && !flags.quiet) {
+		const header = formatStyledHeader({
+			command: "migration log",
+			description: "Show executed migration history from the database ledger",
+			details: [{
+				label: "config",
+				value: configPath
+			}, ...typeof dbConnection === "string" ? [{
+				label: "database",
+				value: maskConnectionUrl(dbConnection)
+			}] : []],
+			flags
+		});
+		ui.stderr(header);
+	}
+	const client = createControlClient({
+		family: config.family,
+		target: config.target,
+		adapter: config.adapter,
+		driver: config.driver,
+		extensionPacks: config.extensionPacks ?? []
+	});
+	try {
+		await client.connect(dbConnection);
+		return ok(await client.readLedger());
+	} catch (error) {
+		if (CliStructuredError.is(error)) return notOk(error);
+		if (MigrationToolsError.is(error)) return notOk(mapMigrationToolsError(error));
+		return notOk(errorUnexpected(error instanceof Error ? error.message : String(error), { why: `Failed to read migration log: ${error instanceof Error ? error.message : String(error)}` }));
+	} finally {
+		await client.close();
+	}
+}
+function createMigrationLogCommand() {
+	const command = new Command("log");
+	setCommandDescriptions(command, "Show executed migration history", "Reads the database ledger and displays every applied migration edge\nin chronological order, including rollbacks and re-applies.");
+	setCommandExamples(command, [
+		"prisma-next migration log --db $DATABASE_URL",
+		"prisma-next migration log --utc --db $DATABASE_URL",
+		"prisma-next migration log --json --db $DATABASE_URL"
+	]);
+	setCommandSeeAlso(command, [
+		{
+			verb: "migration status",
+			oneLiner: "Show migration path and pending status"
+		},
+		{
+			verb: "migration list",
+			oneLiner: "List on-disk migrations"
+		},
+		{
+			verb: "migration graph",
+			oneLiner: "Show the migration graph topology"
+		},
+		{
+			verb: "migration show",
+			oneLiner: "Display migration package contents"
+		}
+	]);
+	addGlobalOptions(command).option("--db <url>", "Database connection string").option("--config <path>", "Path to prisma-next.config.ts").option("--utc", "Render human timestamps in UTC instead of local time").action(async (options) => {
+		const flags = parseGlobalFlagsOrExit(options);
+		const ui = createTerminalUI(flags);
+		const exitCode = handleResult(await executeMigrationLogCommand(options, flags, ui), flags, ui, (entries) => {
+			if (flags.json) ui.output(JSON.stringify(serializeLedgerEntriesForJson(entries), null, 2));
+			else if (!flags.quiet) if (entries.length === 0) ui.output(MIGRATION_LOG_EMPTY_MESSAGE);
+			else {
+				const styler = createAnsiMigrationListStyler({ useColor: ui.useColor });
+				ui.output(renderMigrationLogTable(entries, {
+					utc: options.utc === true,
+					styler
+				}));
+			}
+		});
+		process.exit(exitCode);
+	});
+	return command;
+}
+//#endregion
+export { executeMigrationLogCommand as n, createMigrationLogCommand as t };
+
+//# sourceMappingURL=migration-log-Cj-T-r0o.mjs.map

package/dist/migration-log-Cj-T-r0o.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"migration-log-Cj-T-r0o.mjs","names":[],"sources":["../src/utils/formatters/migration-log-table.ts","../src/commands/migration-log.ts"],"sourcesContent":["import type { LedgerEntryRecord } from '@prisma-next/contract/types';\nimport stringWidth from 'string-width';\nimport {\n  abbreviateContractHash,\n  MIGRATION_LIST_EMPTY_SOURCE,\n  MIGRATION_LIST_FORWARD_EDGE_GLYPH,\n} from './migration-list-data-column';\nimport { IDENTITY_MIGRATION_LIST_STYLER, type MigrationListStyler } from './migration-list-render';\n\nexport type LedgerTimestampMode = 'local' | 'utc' | 'iso';\n\nexport interface RenderMigrationLogTableOptions {\n  readonly utc?: boolean;\n  readonly styler?: MigrationListStyler;\n}\n\nexport interface SerializedLedgerEntryRecord {\n  readonly space: string;\n  readonly migrationName: string;\n  readonly migrationHash: string;\n  readonly from: string | null;\n  readonly to: string;\n  readonly appliedAt: string;\n  readonly operationCount: number;\n}\n\nconst HEADING_APPLIED_AT = 'Applied at';\nconst HEADING_SPACE = 'Space';\nconst HEADING_MIGRATION = 'Migration';\nconst HEADING_CHANGE = 'Change';\nconst HEADING_OPS = 'Ops';\nconst COLUMN_SEPARATOR = ' ';\nconst DIVIDER_CHAR = '─';\n\nexport function sortLedgerEntries(entries: readonly LedgerEntryRecord[]): LedgerEntryRecord[] {\n  return [...entries].sort((left, right) => {\n    const timeDiff = left.appliedAt.getTime() - right.appliedAt.getTime();\n    if (timeDiff !== 0) {\n      return timeDiff;\n    }\n    const spaceDiff = left.space.localeCompare(right.space);\n    if (spaceDiff !== 0) {\n      return spaceDiff;\n    }\n    return left.migrationName.localeCompare(right.migrationName);\n  });\n}\n\nfunction pad2(value: number): string {\n  return String(value).padStart(2, '0');\n}\n\nexport function formatLedgerAppliedAt(date: Date, mode: LedgerTimestampMode): string {\n  if (mode === 'iso') {\n    return date.toISOString();\n  }\n  if (mode === 'utc') {\n    return `${date.getUTCFullYear()}-${pad2(date.getUTCMonth() + 1)}-${pad2(date.getUTCDate())} ${pad2(date.getUTCHours())}:${pad2(date.getUTCMinutes())}:${pad2(date.getUTCSeconds())}Z`;\n  }\n  const offsetMinutes = -date.getTimezoneOffset();\n  const sign = offsetMinutes >= 0 ? '+' : '-';\n  const absoluteOffset = Math.abs(offsetMinutes);\n  const offsetHours = pad2(Math.floor(absoluteOffset / 60));\n  const offsetMins = pad2(absoluteOffset % 60);\n  return `${date.getFullYear()}-${pad2(date.getMonth() + 1)}-${pad2(date.getDate())} ${pad2(date.getHours())}:${pad2(date.getMinutes())}:${pad2(date.getSeconds())} ${sign}${offsetHours}:${offsetMins}`;\n}\n\nexport function formatHashEndpoint(hash: string | null): string {\n  if (hash === null) {\n    return MIGRATION_LIST_EMPTY_SOURCE;\n  }\n  return abbreviateContractHash(hash);\n}\n\nexport function formatHashTransition(from: string | null, to: string): string {\n  return `${formatHashEndpoint(from)} ${MIGRATION_LIST_FORWARD_EDGE_GLYPH} ${abbreviateContractHash(to)}`;\n}\n\nexport function styleHashTransition(\n  from: string | null,\n  to: string,\n  styler: MigrationListStyler,\n): string {\n  const fromPart =\n    from === null\n      ? styler.glyph(MIGRATION_LIST_EMPTY_SOURCE)\n      : styler.sourceHash(abbreviateContractHash(from));\n  const arrow = styler.glyph(MIGRATION_LIST_FORWARD_EDGE_GLYPH);\n  const dest = styler.destHash(abbreviateContractHash(to));\n  return `${fromPart} ${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 columnWidth(values: readonly string[]): number {\n  return values.reduce((max, value) => Math.max(max, stringWidth(value)), 0);\n}\n\nfunction padDividerCell(valueWidth: number): string {\n  return DIVIDER_CHAR.repeat(valueWidth + 2);\n}\n\nfunction padTextCell(value: string, valueWidth: number): string {\n  return ` ${padVisible(value, valueWidth)} `;\n}\n\nfunction padOpsCell(value: string, valueWidth: number): string {\n  const padding = Math.max(0, valueWidth - stringWidth(value));\n  return ` ${' '.repeat(padding)}${value} `;\n}\n\nexport function renderMigrationLogTable(\n  entries: readonly LedgerEntryRecord[],\n  options: RenderMigrationLogTableOptions = {},\n): string {\n  const sorted = sortLedgerEntries(entries);\n  if (sorted.length === 0) {\n    return '';\n  }\n\n  const styler = options.styler ?? IDENTITY_MIGRATION_LIST_STYLER;\n  const showSpace = new Set(sorted.map((entry) => entry.space)).size > 1;\n  const timestampMode: LedgerTimestampMode = options.utc ? 'utc' : 'local';\n  const rows = sorted.map((entry) => ({\n    appliedAt: formatLedgerAppliedAt(entry.appliedAt, timestampMode),\n    space: entry.space,\n    migrationName: entry.migrationName,\n    transition: formatHashTransition(entry.from, entry.to),\n    ops: `${entry.operationCount} ops`,\n    from: entry.from,\n    to: entry.to,\n  }));\n\n  const appliedAtWidth = columnWidth([HEADING_APPLIED_AT, ...rows.map((row) => row.appliedAt)]);\n  const spaceWidth = showSpace ? columnWidth([HEADING_SPACE, ...rows.map((row) => row.space)]) : 0;\n  const nameWidth = columnWidth([HEADING_MIGRATION, ...rows.map((row) => row.migrationName)]);\n  const transitionWidth = columnWidth([HEADING_CHANGE, ...rows.map((row) => row.transition)]);\n  const opsWidth = columnWidth([HEADING_OPS, ...rows.map((row) => row.ops)]);\n\n  const headingParts = [padTextCell(HEADING_APPLIED_AT, appliedAtWidth)];\n  if (showSpace) {\n    headingParts.push(padTextCell(HEADING_SPACE, spaceWidth));\n  }\n  headingParts.push(\n    padTextCell(HEADING_MIGRATION, nameWidth),\n    padTextCell(HEADING_CHANGE, transitionWidth),\n    padOpsCell(HEADING_OPS, opsWidth),\n  );\n  const heading = headingParts.join(COLUMN_SEPARATOR);\n\n  const dividerParts = [padDividerCell(appliedAtWidth)];\n  if (showSpace) {\n    dividerParts.push(padDividerCell(spaceWidth));\n  }\n  dividerParts.push(\n    padDividerCell(nameWidth),\n    padDividerCell(transitionWidth),\n    padDividerCell(opsWidth),\n  );\n  const divider = dividerParts.map((cell) => styler.summary(cell)).join(COLUMN_SEPARATOR);\n\n  const dataRows = rows.map((row) => {\n    const parts = [padTextCell(row.appliedAt, appliedAtWidth)];\n    if (showSpace) {\n      parts.push(padTextCell(row.space, spaceWidth));\n    }\n    parts.push(\n      padTextCell(styler.dirName(row.migrationName), nameWidth),\n      padTextCell(styleHashTransition(row.from, row.to, styler), transitionWidth),\n      padOpsCell(row.ops, opsWidth),\n    );\n    return parts.join(COLUMN_SEPARATOR);\n  });\n\n  return [heading, divider, ...dataRows].join('\\n');\n}\n\nexport function serializeLedgerEntriesForJson(\n  entries: readonly LedgerEntryRecord[],\n): SerializedLedgerEntryRecord[] {\n  return sortLedgerEntries(entries).map(({ appliedAt, ...rest }) => ({\n    ...rest,\n    appliedAt: formatLedgerAppliedAt(appliedAt, 'iso'),\n  }));\n}\n\nexport const MIGRATION_LOG_EMPTY_MESSAGE = 'No migrations have been applied to this database.';\n","import type { LedgerEntryRecord } from '@prisma-next/contract/types';\nimport { MigrationToolsError } from '@prisma-next/migration-tools/errors';\nimport { notOk, ok, type Result } from '@prisma-next/utils/result';\nimport { Command } from 'commander';\nimport { loadConfig } from '../config-loader';\nimport { createControlClient } from '../control-api/client';\nimport {\n  CliStructuredError,\n  errorDatabaseConnectionRequired,\n  errorDriverRequired,\n  errorUnexpected,\n  mapMigrationToolsError,\n} from '../utils/cli-errors';\nimport {\n  addGlobalOptions,\n  maskConnectionUrl,\n  resolveMigrationPaths,\n  setCommandDescriptions,\n  setCommandExamples,\n  setCommandSeeAlso,\n  targetSupportsMigrations,\n} from '../utils/command-helpers';\nimport { createAnsiMigrationListStyler } from '../utils/formatters/migration-list-styler';\nimport {\n  MIGRATION_LOG_EMPTY_MESSAGE,\n  renderMigrationLogTable,\n  serializeLedgerEntriesForJson,\n} from '../utils/formatters/migration-log-table';\nimport { formatStyledHeader } from '../utils/formatters/styled';\nimport type { CommonCommandOptions } from '../utils/global-flags';\nimport { type GlobalFlags, parseGlobalFlagsOrExit } from '../utils/global-flags';\nimport { handleResult } from '../utils/result-handler';\nimport { createTerminalUI, type TerminalUI } from '../utils/terminal-ui';\n\ninterface MigrationLogOptions extends CommonCommandOptions {\n  readonly db?: string;\n  readonly config?: string;\n  readonly utc?: boolean;\n}\n\nexport async function executeMigrationLogCommand(\n  options: MigrationLogOptions,\n  flags: GlobalFlags,\n  ui: TerminalUI,\n): Promise<Result<readonly LedgerEntryRecord[], CliStructuredError>> {\n  const config = await loadConfig(options.config);\n  const { configPath } = resolveMigrationPaths(options.config, config);\n\n  const dbConnection = options.db ?? config.db?.connection;\n  if (!dbConnection) {\n    return notOk(\n      errorDatabaseConnectionRequired({\n        why: `Database connection is required for migration log (set db.connection in ${configPath}, or pass --db <url>)`,\n        commandName: 'migration log',\n      }),\n    );\n  }\n  if (!config.driver) {\n    return notOk(errorDriverRequired({ why: 'Config.driver is required for migration log' }));\n  }\n  if (!targetSupportsMigrations(config.target)) {\n    return notOk(errorUnexpected('Target does not support migrations'));\n  }\n\n  if (!flags.json && !flags.quiet) {\n    const header = formatStyledHeader({\n      command: 'migration log',\n      description: 'Show executed migration history from the database ledger',\n      details: [\n        { label: 'config', value: configPath },\n        ...(typeof dbConnection === 'string'\n          ? [{ label: 'database', value: maskConnectionUrl(dbConnection) }]\n          : []),\n      ],\n      flags,\n    });\n    ui.stderr(header);\n  }\n\n  const client = createControlClient({\n    family: config.family,\n    target: config.target,\n    adapter: config.adapter,\n    driver: config.driver,\n    extensionPacks: config.extensionPacks ?? [],\n  });\n\n  try {\n    await client.connect(dbConnection);\n    const ledger = await client.readLedger();\n    return ok(ledger);\n  } catch (error) {\n    if (CliStructuredError.is(error)) return notOk(error);\n    if (MigrationToolsError.is(error)) return notOk(mapMigrationToolsError(error));\n    return notOk(\n      errorUnexpected(error instanceof Error ? error.message : String(error), {\n        why: `Failed to read migration log: ${error instanceof Error ? error.message : String(error)}`,\n      }),\n    );\n  } finally {\n    await client.close();\n  }\n}\n\nexport function createMigrationLogCommand(): Command {\n  const command = new Command('log');\n  setCommandDescriptions(\n    command,\n    'Show executed migration history',\n    'Reads the database ledger and displays every applied migration edge\\n' +\n      'in chronological order, including rollbacks and re-applies.',\n  );\n  setCommandExamples(command, [\n    'prisma-next migration log --db $DATABASE_URL',\n    'prisma-next migration log --utc --db $DATABASE_URL',\n    'prisma-next migration log --json --db $DATABASE_URL',\n  ]);\n  setCommandSeeAlso(command, [\n    { verb: 'migration status', oneLiner: 'Show migration path and pending status' },\n    { verb: 'migration list', oneLiner: 'List on-disk migrations' },\n    { verb: 'migration graph', oneLiner: 'Show the migration graph topology' },\n    { verb: 'migration show', oneLiner: 'Display migration package contents' },\n  ]);\n  addGlobalOptions(command)\n    .option('--db <url>', 'Database connection string')\n    .option('--config <path>', 'Path to prisma-next.config.ts')\n    .option('--utc', 'Render human timestamps in UTC instead of local time')\n    .action(async (options: MigrationLogOptions) => {\n      const flags = parseGlobalFlagsOrExit(options);\n      const ui = createTerminalUI(flags);\n      const result = await executeMigrationLogCommand(options, flags, ui);\n      const exitCode = handleResult(result, flags, ui, (entries) => {\n        if (flags.json) {\n          ui.output(JSON.stringify(serializeLedgerEntriesForJson(entries), null, 2));\n        } else if (!flags.quiet) {\n          if (entries.length === 0) {\n            ui.output(MIGRATION_LOG_EMPTY_MESSAGE);\n          } else {\n            const styler = createAnsiMigrationListStyler({ useColor: ui.useColor });\n            ui.output(renderMigrationLogTable(entries, { utc: options.utc === true, styler }));\n          }\n        }\n      });\n      process.exit(exitCode);\n    });\n  return command;\n}\n"],"mappings":";;;;;;;;;AA0BA,MAAM,qBAAqB;AAC3B,MAAM,gBAAgB;AACtB,MAAM,oBAAoB;AAC1B,MAAM,iBAAiB;AACvB,MAAM,cAAc;AACpB,MAAM,mBAAmB;AACzB,MAAM,eAAe;AAErB,SAAgB,kBAAkB,SAA4D;CAC5F,OAAO,CAAC,GAAG,OAAO,EAAE,MAAM,MAAM,UAAU;EACxC,MAAM,WAAW,KAAK,UAAU,QAAQ,IAAI,MAAM,UAAU,QAAQ;EACpE,IAAI,aAAa,GACf,OAAO;EAET,MAAM,YAAY,KAAK,MAAM,cAAc,MAAM,KAAK;EACtD,IAAI,cAAc,GAChB,OAAO;EAET,OAAO,KAAK,cAAc,cAAc,MAAM,aAAa;CAC7D,CAAC;AACH;AAEA,SAAS,KAAK,OAAuB;CACnC,OAAO,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG;AACtC;AAEA,SAAgB,sBAAsB,MAAY,MAAmC;CACnF,IAAI,SAAS,OACX,OAAO,KAAK,YAAY;CAE1B,IAAI,SAAS,OACX,OAAO,GAAG,KAAK,eAAe,EAAE,GAAG,KAAK,KAAK,YAAY,IAAI,CAAC,EAAE,GAAG,KAAK,KAAK,WAAW,CAAC,EAAE,GAAG,KAAK,KAAK,YAAY,CAAC,EAAE,GAAG,KAAK,KAAK,cAAc,CAAC,EAAE,GAAG,KAAK,KAAK,cAAc,CAAC,EAAE;CAErL,MAAM,gBAAgB,CAAC,KAAK,kBAAkB;CAC9C,MAAM,OAAO,iBAAiB,IAAI,MAAM;CACxC,MAAM,iBAAiB,KAAK,IAAI,aAAa;CAC7C,MAAM,cAAc,KAAK,KAAK,MAAM,iBAAiB,EAAE,CAAC;CACxD,MAAM,aAAa,KAAK,iBAAiB,EAAE;CAC3C,OAAO,GAAG,KAAK,YAAY,EAAE,GAAG,KAAK,KAAK,SAAS,IAAI,CAAC,EAAE,GAAG,KAAK,KAAK,QAAQ,CAAC,EAAE,GAAG,KAAK,KAAK,SAAS,CAAC,EAAE,GAAG,KAAK,KAAK,WAAW,CAAC,EAAE,GAAG,KAAK,KAAK,WAAW,CAAC,EAAE,GAAG,OAAO,YAAY,GAAG;AAC5L;AAEA,SAAgB,mBAAmB,MAA6B;CAC9D,IAAI,SAAS,MACX,OAAA;CAEF,OAAO,uBAAuB,IAAI;AACpC;AAEA,SAAgB,qBAAqB,MAAqB,IAAoB;CAC5E,OAAO,GAAG,mBAAmB,IAAI,EAAE,KAAwC,uBAAuB,EAAE;AACtG;AAEA,SAAgB,oBACd,MACA,IACA,QACQ;CAOR,OAAO,GALL,SAAS,OACL,OAAO,MAAA,GAAiC,IACxC,OAAO,WAAW,uBAAuB,IAAI,CAAC,EAGjC,GAFL,OAAO,MAAA,GAEK,EAAE,GADf,OAAO,SAAS,uBAAuB,EAAE,CACpB;AACpC;AAEA,SAAS,WAAW,MAAc,aAA6B;CAC7D,MAAM,UAAU,KAAK,IAAI,GAAG,cAAc,YAAY,IAAI,CAAC;CAC3D,OAAO,OAAO,IAAI,OAAO,OAAO;AAClC;AAEA,SAAS,YAAY,QAAmC;CACtD,OAAO,OAAO,QAAQ,KAAK,UAAU,KAAK,IAAI,KAAK,YAAY,KAAK,CAAC,GAAG,CAAC;AAC3E;AAEA,SAAS,eAAe,YAA4B;CAClD,OAAO,aAAa,OAAO,aAAa,CAAC;AAC3C;AAEA,SAAS,YAAY,OAAe,YAA4B;CAC9D,OAAO,IAAI,WAAW,OAAO,UAAU,EAAE;AAC3C;AAEA,SAAS,WAAW,OAAe,YAA4B;CAC7D,MAAM,UAAU,KAAK,IAAI,GAAG,aAAa,YAAY,KAAK,CAAC;CAC3D,OAAO,IAAI,IAAI,OAAO,OAAO,IAAI,MAAM;AACzC;AAEA,SAAgB,wBACd,SACA,UAA0C,CAAC,GACnC;CACR,MAAM,SAAS,kBAAkB,OAAO;CACxC,IAAI,OAAO,WAAW,GACpB,OAAO;CAGT,MAAM,SAAS,QAAQ,UAAU;CACjC,MAAM,YAAY,IAAI,IAAI,OAAO,KAAK,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO;CACrE,MAAM,gBAAqC,QAAQ,MAAM,QAAQ;CACjE,MAAM,OAAO,OAAO,KAAK,WAAW;EAClC,WAAW,sBAAsB,MAAM,WAAW,aAAa;EAC/D,OAAO,MAAM;EACb,eAAe,MAAM;EACrB,YAAY,qBAAqB,MAAM,MAAM,MAAM,EAAE;EACrD,KAAK,GAAG,MAAM,eAAe;EAC7B,MAAM,MAAM;EACZ,IAAI,MAAM;CACZ,EAAE;CAEF,MAAM,iBAAiB,YAAY,CAAC,oBAAoB,GAAG,KAAK,KAAK,QAAQ,IAAI,SAAS,CAAC,CAAC;CAC5F,MAAM,aAAa,YAAY,YAAY,CAAC,eAAe,GAAG,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,CAAC,IAAI;CAC/F,MAAM,YAAY,YAAY,CAAC,mBAAmB,GAAG,KAAK,KAAK,QAAQ,IAAI,aAAa,CAAC,CAAC;CAC1F,MAAM,kBAAkB,YAAY,CAAC,gBAAgB,GAAG,KAAK,KAAK,QAAQ,IAAI,UAAU,CAAC,CAAC;CAC1F,MAAM,WAAW,YAAY,CAAC,aAAa,GAAG,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC,CAAC;CAEzE,MAAM,eAAe,CAAC,YAAY,oBAAoB,cAAc,CAAC;CACrE,IAAI,WACF,aAAa,KAAK,YAAY,eAAe,UAAU,CAAC;CAE1D,aAAa,KACX,YAAY,mBAAmB,SAAS,GACxC,YAAY,gBAAgB,eAAe,GAC3C,WAAW,aAAa,QAAQ,CAClC;CACA,MAAM,UAAU,aAAa,KAAK,gBAAgB;CAElD,MAAM,eAAe,CAAC,eAAe,cAAc,CAAC;CACpD,IAAI,WACF,aAAa,KAAK,eAAe,UAAU,CAAC;CAE9C,aAAa,KACX,eAAe,SAAS,GACxB,eAAe,eAAe,GAC9B,eAAe,QAAQ,CACzB;CAgBA,OAAO;EAAC;EAfQ,aAAa,KAAK,SAAS,OAAO,QAAQ,IAAI,CAAC,EAAE,KAAK,gBAe/C;EAAG,GAbT,KAAK,KAAK,QAAQ;GACjC,MAAM,QAAQ,CAAC,YAAY,IAAI,WAAW,cAAc,CAAC;GACzD,IAAI,WACF,MAAM,KAAK,YAAY,IAAI,OAAO,UAAU,CAAC;GAE/C,MAAM,KACJ,YAAY,OAAO,QAAQ,IAAI,aAAa,GAAG,SAAS,GACxD,YAAY,oBAAoB,IAAI,MAAM,IAAI,IAAI,MAAM,GAAG,eAAe,GAC1E,WAAW,IAAI,KAAK,QAAQ,CAC9B;GACA,OAAO,MAAM,KAAK,gBAAgB;EACpC,CAEoC;CAAC,EAAE,KAAK,IAAI;AAClD;AAEA,SAAgB,8BACd,SAC+B;CAC/B,OAAO,kBAAkB,OAAO,EAAE,KAAK,EAAE,WAAW,GAAG,YAAY;EACjE,GAAG;EACH,WAAW,sBAAsB,WAAW,KAAK;CACnD,EAAE;AACJ;AAEA,MAAa,8BAA8B;;;ACrJ3C,eAAsB,2BACpB,SACA,OACA,IACmE;CACnE,MAAM,SAAS,MAAM,WAAW,QAAQ,MAAM;CAC9C,MAAM,EAAE,eAAe,sBAAsB,QAAQ,QAAQ,MAAM;CAEnE,MAAM,eAAe,QAAQ,MAAM,OAAO,IAAI;CAC9C,IAAI,CAAC,cACH,OAAO,MACL,gCAAgC;EAC9B,KAAK,2EAA2E,WAAW;EAC3F,aAAa;CACf,CAAC,CACH;CAEF,IAAI,CAAC,OAAO,QACV,OAAO,MAAM,oBAAoB,EAAE,KAAK,8CAA8C,CAAC,CAAC;CAE1F,IAAI,CAAC,yBAAyB,OAAO,MAAM,GACzC,OAAO,MAAM,gBAAgB,oCAAoC,CAAC;CAGpE,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,GAAI,OAAO,iBAAiB,WACxB,CAAC;IAAE,OAAO;IAAY,OAAO,kBAAkB,YAAY;GAAE,CAAC,IAC9D,CAAC,CACP;GACA;EACF,CAAC;EACD,GAAG,OAAO,MAAM;CAClB;CAEA,MAAM,SAAS,oBAAoB;EACjC,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,SAAS,OAAO;EAChB,QAAQ,OAAO;EACf,gBAAgB,OAAO,kBAAkB,CAAC;CAC5C,CAAC;CAED,IAAI;EACF,MAAM,OAAO,QAAQ,YAAY;EAEjC,OAAO,GAAG,MADW,OAAO,WAAW,CACvB;CAClB,SAAS,OAAO;EACd,IAAI,mBAAmB,GAAG,KAAK,GAAG,OAAO,MAAM,KAAK;EACpD,IAAI,oBAAoB,GAAG,KAAK,GAAG,OAAO,MAAM,uBAAuB,KAAK,CAAC;EAC7E,OAAO,MACL,gBAAgB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAAG,EACtE,KAAK,iCAAiC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,IAC7F,CAAC,CACH;CACF,UAAU;EACR,MAAM,OAAO,MAAM;CACrB;AACF;AAEA,SAAgB,4BAAqC;CACnD,MAAM,UAAU,IAAI,QAAQ,KAAK;CACjC,uBACE,SACA,mCACA,kIAEF;CACA,mBAAmB,SAAS;EAC1B;EACA;EACA;CACF,CAAC;CACD,kBAAkB,SAAS;EACzB;GAAE,MAAM;GAAoB,UAAU;EAAyC;EAC/E;GAAE,MAAM;GAAkB,UAAU;EAA0B;EAC9D;GAAE,MAAM;GAAmB,UAAU;EAAoC;EACzE;GAAE,MAAM;GAAkB,UAAU;EAAqC;CAC3E,CAAC;CACD,iBAAiB,OAAO,EACrB,OAAO,cAAc,4BAA4B,EACjD,OAAO,mBAAmB,+BAA+B,EACzD,OAAO,SAAS,sDAAsD,EACtE,OAAO,OAAO,YAAiC;EAC9C,MAAM,QAAQ,uBAAuB,OAAO;EAC5C,MAAM,KAAK,iBAAiB,KAAK;EAEjC,MAAM,WAAW,aAAa,MADT,2BAA2B,SAAS,OAAO,EAAE,GAC5B,OAAO,KAAK,YAAY;GAC5D,IAAI,MAAM,MACR,GAAG,OAAO,KAAK,UAAU,8BAA8B,OAAO,GAAG,MAAM,CAAC,CAAC;QACpE,IAAI,CAAC,MAAM,OAChB,IAAI,QAAQ,WAAW,GACrB,GAAG,OAAO,2BAA2B;QAChC;IACL,MAAM,SAAS,8BAA8B,EAAE,UAAU,GAAG,SAAS,CAAC;IACtE,GAAG,OAAO,wBAAwB,SAAS;KAAE,KAAK,QAAQ,QAAQ;KAAM;IAAO,CAAC,CAAC;GACnF;EAEJ,CAAC;EACD,QAAQ,KAAK,QAAQ;CACvB,CAAC;CACH,OAAO;AACT"}

package/dist/{migration-plan-CaeKCKp4.mjs → migration-plan-BQAbZkj_.mjs}

@@ -765,4 +765,4 @@ function resolveBundleByPrefix(bundles, needle) {
 //#endregion
 export { formatMigrationPlanOutput as n, resolveBundleByPrefix as r, createMigrationPlanCommand as t };
 
-//# sourceMappingURL=migration-plan-CaeKCKp4.mjs.map
+//# sourceMappingURL=migration-plan-BQAbZkj_.mjs.map