prisma-next 0.11.0-dev.7 → 0.11.0-dev.70

package/dist/commands/migration-status.mjs

@@ -1,21 +1,20 @@
 import { t as loadConfig } from "../config-loader-B6sJjXTv.mjs";
-import { b as mapMigrationToolsError, g as errorRuntime, t as CliStructuredError, x as mapRefResolutionError, y as errorUnexpected } from "../cli-errors-Djtz98Vm.mjs";
-import { t as createTerminalUI } from "../terminal-ui-BiB_8KNo.mjs";
-import { S as formatStyledHeader, a as loadMigrationPackages, d as setCommandDescriptions, f as setCommandExamples, g as toStructuralEdge, h as toPathDecisionResult, l as resolveMigrationPaths, n as collectDeclaredInvariants, o as maskConnectionUrl, p as setCommandSeeAlso, s as readContractEnvelope, t as addGlobalOptions, v as parseGlobalFlagsOrExit, y as handleResult } from "../command-helpers-DtavI0wJ.mjs";
-import { t as createControlClient } from "../client-oXO2WCPD.mjs";
-import { t as buildContractSpaceAggregate } from "../contract-space-aggregate-loader-BmNQwlws.mjs";
-import { i as migrationGraphToRenderInput, n as graphRenderer, r as isLinearGraph, t as extractRelevantSubgraph } from "../graph-render-DJVv0_uf.mjs";
+import { A as CliStructuredError, T as formatStyledHeader, X as errorRuntime, _ as createTerminalUI, a as readContractEnvelope, d as setCommandSeeAlso, g as parseGlobalFlagsOrExit, i as maskConnectionUrl, l as setCommandDescriptions, m as toStructuralEdge, n as collectDeclaredInvariants, nt as mapMigrationToolsError, p as toPathDecisionResult, rt as mapRefResolutionError, s as resolveMigrationPaths, t as addGlobalOptions, tt as errorUnexpected, u as setCommandExamples, y as handleResult } from "../command-helpers-CoceqqMl.mjs";
+import { t as createControlClient } from "../client-6WehTnUh.mjs";
+import { t as toDeclaredExtensionsFromRaw } from "../extension-pack-inputs-IDvjRCi3.mjs";
+import { i as loadContractRawSafely, o as refuseContractSpaceIntegrity, s as refusePackageCorruptionOnAggregate, t as appContractStandInFromIdentity } from "../contract-space-aggregate-loader-lafgkTwG.mjs";
+import { i as migrationGraphToRenderInput, n as graphRenderer, r as isLinearGraph, t as extractRelevantSubgraph } from "../graph-render-rFAqZujX.mjs";
 import { Command } from "commander";
 import { ifDefined } from "@prisma-next/utils/defined";
 import { notOk, ok } from "@prisma-next/utils/result";
 import { createControlStack } from "@prisma-next/framework-components/control";
-import { findPath, findPathWithDecision, findReachableLeaves } from "@prisma-next/migration-tools/migration-graph";
 import { cyan, dim, magenta, yellow } from "colorette";
-import { graphWalkStrategy } from "@prisma-next/migration-tools/aggregate";
+import { graphWalkStrategy, loadContractSpaceAggregate, requireHeadRef } from "@prisma-next/migration-tools/aggregate";
 import { EMPTY_CONTRACT_HASH } from "@prisma-next/migration-tools/constants";
 import { MigrationToolsError, errorNoInvariantPath, errorUnknownInvariant } from "@prisma-next/migration-tools/errors";
-import { parseContractRef } from "@prisma-next/migration-tools/ref-resolution";
+import { findPath, findPathWithDecision, findReachableLeaves } from "@prisma-next/migration-tools/migration-graph";
 import { readRefs } from "@prisma-next/migration-tools/refs";
+import { parseContractRef } from "@prisma-next/migration-tools/ref-resolution";
 //#region src/commands/migration-status.ts
 /**
 * Sum per-space `pendingCount` into a cross-space total, but only when
@@ -178,37 +177,34 @@ function resolveDisplayChain(graph, targetHash, markerHash) {
 /**
 * Build the aggregate enumeration of contract spaces for the status
 * output. Loads the aggregate from disk (lossy on failure — extension
-* spaces are simply omitted, the existing single-space app behaviour
-* keeps working), reads per-space marker rows when online, and uses
+* spaces are simply omitted, the app member's output keeps working),
+* reads per-space marker rows when online, and uses
 * {@link graphWalkStrategy} to compute each space's pending count.
 *
-* Sub-spec § `migration status` semantics — the aggregate-walking
-* version reports per-space marker + pending state alongside the
-* cross-space totals.
+* The aggregate-walking status reports per-space marker + pending
+* state alongside the cross-space totals.
 */
 async function loadAggregateStatusSpaces(args) {
-	const loaded = await buildContractSpaceAggregate({
-		targetId: args.targetId,
-		migrationsDir: args.migrationsDir,
-		appContract: args.deserializeContract(args.appContractRaw),
-		extensionPacks: args.extensionPacks,
-		deserializeContract: args.deserializeContract
-	});
-	if (!loaded.ok) return [];
-	const aggregate = loaded.value;
+	const declaredExtensions = toDeclaredExtensionsFromRaw(args.extensionPacks);
+	if (refuseContractSpaceIntegrity(args.aggregate, {
+		declaredExtensions,
+		checkContracts: true
+	})) return [];
+	const aggregate = args.aggregate;
 	const orderedMembers = [...aggregate.extensions, aggregate.app];
 	const rows = [];
 	for (const member of orderedMembers) {
 		const liveMarker = args.markersBySpace?.get(member.spaceId) ?? null;
 		const isApp = member.spaceId === aggregate.app.spaceId;
-		if (member.migrations.graph.nodes.size === 0) {
+		const headRef = requireHeadRef(member);
+		if (member.graph().nodes.size === 0) {
 			rows.push({
 				spaceId: member.spaceId,
 				kind: isApp ? "app" : "extension",
-				headHash: member.headRef.hash,
+				headHash: headRef.hash,
 				...args.markersBySpace !== null ? {
 					markerHash: liveMarker?.storageHash ?? null,
-					status: member.headRef.hash === EMPTY_CONTRACT_HASH ? "up-to-date" : "never-planned",
+					status: headRef.hash === EMPTY_CONTRACT_HASH ? "up-to-date" : "never-planned",
 					pendingCount: 0
 				} : {}
 			});
@@ -218,7 +214,7 @@ async function loadAggregateStatusSpaces(args) {
 			rows.push({
 				spaceId: member.spaceId,
 				kind: isApp ? "app" : "extension",
-				headHash: member.headRef.hash
+				headHash: headRef.hash
 			});
 			continue;
 		}
@@ -237,7 +233,7 @@ async function loadAggregateStatusSpaces(args) {
 		rows.push({
 			spaceId: member.spaceId,
 			kind: isApp ? "app" : "extension",
-			headHash: member.headRef.hash,
+			headHash: headRef.hash,
 			markerHash: liveMarker?.storageHash ?? null,
 			pendingCount,
 			...status ? { status } : {}
@@ -251,15 +247,6 @@ async function loadAggregateStatusSpaces(args) {
 * the existing `readContractEnvelope` path will report the same
 * problem via a status diagnostic, no need to double-surface.
 */
-async function loadContractRawSafely(config) {
-	try {
-		const path = (await import("../command-helpers-DtavI0wJ.mjs").then((n) => n.r)).resolveContractPath(config);
-		const raw = await (await import("node:fs/promises")).readFile(path, "utf-8");
-		return JSON.parse(raw);
-	} catch {
-		return null;
-	}
-}
 async function validateOnlineMarkerRead(config, dbConnection) {
 	const driver = config.driver;
 	if (!driver) return ok(void 0);
@@ -283,7 +270,7 @@ async function validateOnlineMarkerRead(config, dbConnection) {
 }
 async function executeMigrationStatusCommand(options, flags, ui) {
 	const config = await loadConfig(options.config);
-	const { configPath, appMigrationsDir, appMigrationsRelative, migrationsDir, refsDir } = resolveMigrationPaths(options.config, config);
+	const { configPath, appMigrationsRelative, migrationsDir, refsDir } = resolveMigrationPaths(options.config, config);
 	const dbConnection = options.db ?? config.db?.connection;
 	const hasDriver = !!config.driver;
 	let activeRefName;
@@ -296,12 +283,58 @@ async function executeMigrationStatusCommand(options, flags, ui) {
 		if (MigrationToolsError.is(error)) return notOk(mapMigrationToolsError(error));
 		throw error;
 	}
+	const diagnostics = [];
+	let contractHash = EMPTY_CONTRACT_HASH;
+	try {
+		contractHash = (await readContractEnvelope(config)).storageHash;
+	} catch (error) {
+		diagnostics.push({
+			code: "CONTRACT.UNREADABLE",
+			severity: "warn",
+			message: `Could not read contract: ${error instanceof Error ? error.message : "unknown error"}`,
+			hints: ["Run 'prisma-next contract emit' to generate a valid contract"]
+		});
+	}
+	const contractRawForAggregate = await loadContractRawSafely(config);
+	const stack = createControlStack(config);
+	const familyInstance = config.family.create(stack);
+	const deserializeContract = (json) => familyInstance.deserializeContract(json);
+	let appContractForLoad = appContractStandInFromIdentity({
+		contractHash,
+		targetId: config.target.id,
+		targetFamily: config.target.familyId
+	});
+	if (contractRawForAggregate !== null) try {
+		appContractForLoad = deserializeContract(contractRawForAggregate);
+	} catch (error) {
+		diagnostics.push({
+			code: "CONTRACT.UNREADABLE",
+			severity: "warn",
+			message: `Could not deserialize contract: ${error instanceof Error ? error.message : "unknown error"}`,
+			hints: ["Run 'prisma-next contract emit' to generate a valid contract"]
+		});
+	}
+	let aggregate;
+	try {
+		aggregate = await loadContractSpaceAggregate({
+			migrationsDir,
+			deserializeContract,
+			appContract: appContractForLoad
+		});
+	} catch (error) {
+		if (MigrationToolsError.is(error)) return notOk(mapMigrationToolsError(error));
+		return notOk(errorUnexpected(error instanceof Error ? error.message : String(error), { why: `Failed to read migrations directory: ${error instanceof Error ? error.message : String(error)}` }));
+	}
+	if (contractRawForAggregate !== null) {
+		const corruptionFailure = refusePackageCorruptionOnAggregate(aggregate);
+		if (corruptionFailure) return notOk(corruptionFailure);
+	}
+	const appGraph = aggregate.app.graph();
 	let fromOverrideHash;
-	if (options.to || options.from) try {
-		const { graph: earlyGraph } = await loadMigrationPackages(appMigrationsDir);
+	if (options.to || options.from) {
 		if (options.to) {
 			const refResult = parseContractRef(options.to, {
-				graph: earlyGraph,
+				graph: appGraph,
 				refs: allRefs
 			});
 			if (!refResult.ok) return notOk(mapRefResolutionError(refResult.failure));
@@ -314,15 +347,12 @@ async function executeMigrationStatusCommand(options, flags, ui) {
 		}
 		if (options.from) {
 			const fromResult = parseContractRef(options.from, {
-				graph: earlyGraph,
+				graph: appGraph,
 				refs: allRefs
 			});
 			if (!fromResult.ok) return notOk(mapRefResolutionError(fromResult.failure));
 			fromOverrideHash = fromResult.value.hash;
 		}
-	} catch (error) {
-		if (MigrationToolsError.is(error)) return notOk(mapMigrationToolsError(error));
-		throw error;
 	}
 	const requiredInvariants = [...activeRefEntry?.invariants ?? []].sort();
 	const statusRefs = Object.entries(allRefs).map(([name, entry]) => ({
@@ -362,26 +392,8 @@ async function executeMigrationStatusCommand(options, flags, ui) {
 		});
 		ui.stderr(header);
 	}
-	const diagnostics = [];
-	let contractHash = EMPTY_CONTRACT_HASH;
-	try {
-		contractHash = (await readContractEnvelope(config)).storageHash;
-	} catch (error) {
-		diagnostics.push({
-			code: "CONTRACT.UNREADABLE",
-			severity: "warn",
-			message: `Could not read contract: ${error instanceof Error ? error.message : "unknown error"}`,
-			hints: ["Run 'prisma-next contract emit' to generate a valid contract"]
-		});
-	}
-	let bundles;
-	let graph;
-	try {
-		({bundles, graph} = await loadMigrationPackages(appMigrationsDir));
-	} catch (error) {
-		if (MigrationToolsError.is(error)) return notOk(mapMigrationToolsError(error));
-		return notOk(errorUnexpected(error instanceof Error ? error.message : String(error), { why: `Failed to read migrations directory: ${error instanceof Error ? error.message : String(error)}` }));
-	}
+	const bundles = aggregate.app.packages;
+	const graph = appGraph;
 	if (bundles.length === 0) {
 		if (dbConnection && hasDriver) {
 			const markerProbe = await validateOnlineMarkerRead(config, dbConnection);
@@ -449,23 +461,15 @@ async function executeMigrationStatusCommand(options, flags, ui) {
 		mode = "offline";
 		allMarkers = null;
 	}
-	const contractRawForAggregate = await loadContractRawSafely(config);
 	let aggregateSpaces = [];
-	if (contractRawForAggregate !== null) {
-		const stack = createControlStack(config);
-		const familyInstance = config.family.create(stack);
-		try {
-			aggregateSpaces = await loadAggregateStatusSpaces({
-				targetId: config.target.targetId,
-				migrationsDir,
-				appContractRaw: contractRawForAggregate,
-				extensionPacks: config.extensionPacks ?? [],
-				deserializeContract: (json) => familyInstance.deserializeContract(json),
-				markersBySpace: allMarkers
-			});
-		} catch {
-			aggregateSpaces = [];
-		}
+	if (contractRawForAggregate !== null) try {
+		aggregateSpaces = await loadAggregateStatusSpaces({
+			aggregate,
+			extensionPacks: config.extensionPacks ?? [],
+			markersBySpace: allMarkers
+		});
+	} catch {
+		aggregateSpaces = [];
 	}
 	const totalPendingAcrossSpaces = computeTotalPendingAcrossSpaces(aggregateSpaces);
 	if (activeRefEntry && activeRefEntry.invariants.length > 0) {

package/dist/commands/migration-status.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"migration-status.mjs","names":[],"sources":["../../src/commands/migration-status.ts"],"sourcesContent":["import {\n  createControlStack,\n  type MigrationPlanOperation,\n} from '@prisma-next/framework-components/control';\nimport {\n  type ContractMarkerRecordLike,\n  graphWalkStrategy,\n} from '@prisma-next/migration-tools/aggregate';\nimport { EMPTY_CONTRACT_HASH } from '@prisma-next/migration-tools/constants';\nimport {\n  errorNoInvariantPath,\n  errorUnknownInvariant,\n  MigrationToolsError,\n} from '@prisma-next/migration-tools/errors';\nimport type { MigrationEdge, MigrationGraph } from '@prisma-next/migration-tools/graph';\nimport {\n  findPath,\n  findPathWithDecision,\n  findReachableLeaves,\n} from '@prisma-next/migration-tools/migration-graph';\nimport type { OnDiskMigrationPackage } from '@prisma-next/migration-tools/package';\nimport { parseContractRef } from '@prisma-next/migration-tools/ref-resolution';\nimport type { RefEntry, Refs } from '@prisma-next/migration-tools/refs';\nimport { readRefs } from '@prisma-next/migration-tools/refs';\nimport { ifDefined } from '@prisma-next/utils/defined';\nimport { notOk, ok, type Result } from '@prisma-next/utils/result';\nimport { cyan, dim, magenta, yellow } from 'colorette';\nimport { Command } from 'commander';\n\nimport { loadConfig } from '../config-loader';\nimport { createControlClient } from '../control-api/client';\nimport {\n  CliStructuredError,\n  errorRuntime,\n  errorUnexpected,\n  mapMigrationToolsError,\n  mapRefResolutionError,\n} from '../utils/cli-errors';\nimport {\n  addGlobalOptions,\n  collectDeclaredInvariants,\n  loadMigrationPackages,\n  maskConnectionUrl,\n  readContractEnvelope,\n  resolveMigrationPaths,\n  setCommandDescriptions,\n  setCommandExamples,\n  setCommandSeeAlso,\n  toPathDecisionResult,\n  toStructuralEdge,\n} from '../utils/command-helpers';\nimport {\n  type BuildAggregateInputs,\n  buildContractSpaceAggregate,\n} from '../utils/contract-space-aggregate-loader';\nimport {\n  type EdgeStatus,\n  type EdgeStatusKind,\n  migrationGraphToRenderInput,\n} from '../utils/formatters/graph-migration-mapper';\nimport {\n  extractRelevantSubgraph,\n  graphRenderer,\n  isLinearGraph,\n} from '../utils/formatters/graph-render';\nimport { formatStyledHeader } from '../utils/formatters/styled';\nimport type { CommonCommandOptions } from '../utils/global-flags';\nimport { type GlobalFlags, parseGlobalFlagsOrExit } from '../utils/global-flags';\nimport type { StatusDiagnostic, StatusRef } from '../utils/migration-types';\nimport { handleResult } from '../utils/result-handler';\nimport { createTerminalUI, type TerminalUI } from '../utils/terminal-ui';\n\ninterface MigrationStatusOptions extends CommonCommandOptions {\n  readonly db?: string;\n  readonly config?: string;\n  readonly to?: string;\n  readonly from?: string;\n}\n\nexport interface MigrationStatusEntry {\n  readonly dirName: string;\n  readonly from: string;\n  readonly to: string;\n  readonly migrationHash: string;\n  readonly operationCount: number;\n  readonly operationSummary: string;\n  readonly hasDestructive: boolean;\n  readonly status: EdgeStatusKind | 'unknown';\n}\n\n/**\n * Per-space status row in the aggregate-shaped status output.\n *\n * Surfaces, for each contract space:\n *\n * - `headHash`: the on-disk head ref's hash (where the space is going).\n * - `markerHash`: the live marker hash for the space, or null if no\n *    marker has been written yet (greenfield, or pre-`migrate`).\n * - `pendingCount`: number of migration edges between marker and head.\n *    Computed via {@link graphWalkStrategy}; 0 means the space is\n *    already at head.\n * - `status`: convenience tag the formatter uses to pick a glyph.\n *    `'never-planned'` is reserved for spaces with non-empty head but\n *    no on-disk migrations — which shouldn't happen if the loader's\n *    integrity check passes.\n *\n * Online-only fields (`markerHash`, `status`) are absent when the\n * command runs without a database connection.\n */\nexport interface MigrationStatusSpaceEntry {\n  readonly spaceId: string;\n  readonly kind: 'app' | 'extension';\n  readonly headHash: string;\n  readonly markerHash?: string | null;\n  readonly pendingCount?: number;\n  readonly status?: 'up-to-date' | 'pending' | 'no-marker' | 'never-planned' | 'unreachable';\n}\n\n/**\n * Sum per-space `pendingCount` into a cross-space total, but only when\n * every loaded space reports a defined `pendingCount`. Returns\n * `undefined` if any space is on the marker-unknown / offline path\n * (where `pendingCount` is intentionally absent), so JSON consumers can\n * distinguish \"no pending\" from \"unknown\".\n */\nexport function computeTotalPendingAcrossSpaces(\n  spaces: readonly MigrationStatusSpaceEntry[],\n): number | undefined {\n  if (spaces.length === 0) return undefined;\n  let total = 0;\n  for (const s of spaces) {\n    if (s.pendingCount === undefined) return undefined;\n    total += s.pendingCount;\n  }\n  return total;\n}\n\nexport type { StatusDiagnostic, StatusRef } from '../utils/migration-types';\n\nexport interface MigrationStatusResult {\n  readonly ok: true;\n  readonly mode: 'online' | 'offline';\n  readonly migrations: readonly MigrationStatusEntry[];\n  readonly markerHash?: string;\n  readonly targetHash: string;\n  readonly contractHash: string;\n  readonly refs?: readonly StatusRef[];\n  /** Required invariants from the active ref, sorted ascending. Always present (`[]` when no `--ref` or the ref declares none) — knowable offline. */\n  readonly requiredInvariants: readonly string[];\n  /**\n   * Invariants the marker has applied at least once, intersected with\n   * `requiredInvariants` for display relevance. JSON consumers see only the\n   * subset overlapping the active ref's required set — the full unfiltered\n   * marker invariant list lives on `marker.invariants` (control plane) and\n   * is not surfaced here. Present only in `mode === 'online'`; absent when\n   * offline (the marker is unknown, not empty).\n   */\n  readonly appliedInvariants?: readonly string[];\n  /** required − applied. Present only in `mode === 'online'`; absent when offline. */\n  readonly missingInvariants?: readonly string[];\n  readonly pathDecision?: {\n    readonly fromHash: string;\n    readonly toHash: string;\n    readonly alternativeCount: number;\n    readonly tieBreakReasons: readonly string[];\n    readonly refName?: string;\n    readonly requiredInvariants: readonly string[];\n    readonly satisfiedInvariants: readonly string[];\n    readonly selectedPath: readonly {\n      readonly dirName: string;\n      readonly migrationHash: string;\n      readonly from: string;\n      readonly to: string;\n      readonly invariants: readonly string[];\n    }[];\n  };\n  readonly summary: string;\n  readonly diagnostics: readonly StatusDiagnostic[];\n  /**\n   * Aggregate enumeration of every on-disk contract space (app +\n   * extensions), in canonical schedule order (extensions\n   * alphabetically, then app). Present whenever the aggregate loader\n   * succeeded; absent in early-error returns (e.g. unreadable\n   * migrations directory) where the existing diagnostics already\n   * surface the failure.\n   *\n   * The legacy top-level fields (`migrations`, `markerHash`,\n   * `targetHash`, `pathDecision`, …) describe the **app member**\n   * specifically — back-compat with single-space callers. Per-space\n   * detail for extension members lives only on this list.\n   */\n  readonly spaces?: readonly MigrationStatusSpaceEntry[];\n  /** Cross-space pending-migration total (sum of `spaces[].pendingCount`). Present when `spaces` is. */\n  readonly totalPendingAcrossSpaces?: number;\n  readonly graph?: MigrationGraph;\n  readonly bundles?: readonly OnDiskMigrationPackage[];\n  readonly edgeStatuses?: readonly EdgeStatus[];\n  readonly activeRefHash?: string;\n  readonly activeRefName?: string;\n  readonly diverged?: boolean;\n}\n\nfunction summarizeOps(ops: readonly MigrationPlanOperation[]): {\n  summary: string;\n  hasDestructive: boolean;\n} {\n  if (ops.length === 0) return { summary: '0 ops', hasDestructive: false };\n\n  const classes = new Map<string, number>();\n  for (const op of ops) {\n    classes.set(op.operationClass, (classes.get(op.operationClass) ?? 0) + 1);\n  }\n\n  const hasDestructive = classes.has('destructive');\n  const count = ops.length;\n  const noun = count === 1 ? 'op' : 'ops';\n\n  if (classes.size === 1) {\n    const cls = [...classes.keys()][0]!;\n    return { summary: `${count} ${noun} (all ${cls})`, hasDestructive };\n  }\n\n  const destructiveCount = classes.get('destructive');\n  if (destructiveCount) {\n    return { summary: `${count} ${noun} (${destructiveCount} destructive)`, hasDestructive };\n  }\n\n  const parts = [...classes.entries()].map(([cls, n]) => `${n} ${cls}`);\n  return { summary: `${count} ${noun} (${parts.join(', ')})`, hasDestructive };\n}\n\n/**\n * Derive per-edge status across the full graph using path analysis.\n *\n * - **applied**: edge is on the path from root to the DB marker\n * - **pending**: edge is on the path from the DB marker to the target\n *   (and the marker is reachable from root, i.e. it's on the same branch)\n * - **unreachable**: edge is on the path from root to the target but the DB\n *   marker is on a different branch — `apply` can't reach these edges\n *   without the DB first moving to this branch\n *\n * Returns statuses only for edges that have a known status (skips offline\n * and edges not on any relevant path).\n *\n * @internal Exported for testing only.\n */\nexport function deriveEdgeStatuses(\n  graph: MigrationGraph,\n  targetHash: string,\n  contractHash: string,\n  markerHash: string | undefined,\n  mode: 'online' | 'offline',\n): EdgeStatus[] {\n  if (mode === 'offline') return [];\n\n  const edgeKey = (e: MigrationEdge) => `${e.from}\\0${e.to}`;\n\n  // No marker = empty DB — treat root as the marker (nothing applied, everything pending)\n  const effectiveMarker = markerHash ?? EMPTY_CONTRACT_HASH;\n\n  const appliedPath =\n    markerHash !== undefined ? findPath(graph, EMPTY_CONTRACT_HASH, markerHash) : null;\n\n  const pendingPath = findPath(graph, effectiveMarker, targetHash);\n  const targetPath = findPath(graph, EMPTY_CONTRACT_HASH, targetHash);\n\n  const statuses: EdgeStatus[] = [];\n  const assignedKeys = new Set<string>();\n\n  // Applied edges (root → marker)\n  if (appliedPath) {\n    for (const e of appliedPath) {\n      assignedKeys.add(edgeKey(e));\n      statuses.push({ dirName: e.dirName, status: 'applied' });\n    }\n  }\n\n  // Pending edges (marker → target)\n  if (pendingPath) {\n    for (const e of pendingPath) {\n      assignedKeys.add(edgeKey(e));\n      statuses.push({ dirName: e.dirName, status: 'pending' });\n    }\n  }\n\n  // Pending edges beyond the target: target → contract (when target is a ref\n  // and the contract is reachable from it)\n  if (\n    contractHash !== EMPTY_CONTRACT_HASH &&\n    contractHash !== targetHash &&\n    graph.nodes.has(contractHash)\n  ) {\n    const beyondTarget = findPath(graph, targetHash, contractHash);\n    if (beyondTarget) {\n      for (const e of beyondTarget) {\n        if (!assignedKeys.has(edgeKey(e))) {\n          assignedKeys.add(edgeKey(e));\n          statuses.push({ dirName: e.dirName, status: 'pending' });\n        }\n      }\n    }\n  }\n\n  // Unreachable edges: on the path from root to the target but neither applied\n  // nor pending. This covers two cases:\n  //  1. Marker can't reach target at all (different branch entirely)\n  //  2. Marker reaches target via a different route, leaving some root→target\n  //     edges orphaned (e.g. a fork where one branch was applied and apply\n  //     will continue through the other)\n  if (targetPath) {\n    for (const e of targetPath) {\n      if (!assignedKeys.has(edgeKey(e))) {\n        statuses.push({ dirName: e.dirName, status: 'unreachable' });\n      }\n    }\n  }\n\n  return statuses;\n}\n\n/**\n * @param mode    — 'online' if we connected to the database, 'offline' otherwise\n * @param markerHash — the marker hash from the database, or undefined if no marker row / offline\n */\nfunction buildMigrationEntries(\n  chain: readonly MigrationEdge[],\n  packages: readonly OnDiskMigrationPackage[],\n  mode: 'online' | 'offline',\n  markerHash: string | undefined,\n  edgeStatuses?: readonly EdgeStatus[],\n): MigrationStatusEntry[] {\n  const pkgByDirName = new Map(packages.map((p) => [p.dirName, p]));\n  const statusByDirName = edgeStatuses\n    ? new Map(edgeStatuses.map((e) => [e.dirName, e.status]))\n    : undefined;\n\n  const markerInChain = markerHash === undefined || chain.some((e) => e.to === markerHash);\n\n  const entries: MigrationStatusEntry[] = [];\n  let reachedMarker = mode === 'online' && markerHash === undefined;\n\n  for (const migration of chain) {\n    const pkg = pkgByDirName.get(migration.dirName);\n    const ops = (pkg?.ops ?? []) as readonly MigrationPlanOperation[];\n    const { summary, hasDestructive } = summarizeOps(ops);\n\n    let status: EdgeStatusKind | 'unknown';\n    const edgeStatus = statusByDirName?.get(migration.dirName);\n    if (edgeStatus) {\n      status = edgeStatus;\n    } else if (mode === 'offline' || !markerInChain) {\n      status = 'unknown';\n    } else if (reachedMarker) {\n      status = 'pending';\n    } else {\n      status = 'applied';\n    }\n\n    entries.push({\n      dirName: migration.dirName,\n      from: migration.from,\n      to: migration.to,\n      migrationHash: migration.migrationHash,\n      operationCount: ops.length,\n      operationSummary: summary,\n      hasDestructive,\n      status,\n    });\n\n    if (!reachedMarker && migration.to === markerHash) {\n      reachedMarker = true;\n    }\n  }\n\n  return entries;\n}\n\n/**\n * Resolve the migration chain to display in status output.\n *\n * When offline or the marker is at EMPTY, the chain is simply the shortest\n * path from EMPTY to the target — all structural paths are equivalent per\n * the spec, so the deterministic shortest path is the canonical display.\n *\n * When online with a non-empty marker, the chain routes *through* the marker:\n * EMPTY→marker (applied history) + marker→target (pending edges). This ensures\n * the displayed chain includes the marker node so applied/pending status is\n * correct. Without this, BFS from EMPTY to target could pick a shortest path\n * that bypasses the marker entirely (e.g. in a diamond graph), causing the\n * marker to appear \"diverged\" when it isn't.\n */\nfunction resolveDisplayChain(\n  graph: MigrationGraph,\n  targetHash: string,\n  markerHash: string | undefined,\n): readonly MigrationEdge[] | null {\n  if (markerHash === undefined) {\n    return findPath(graph, EMPTY_CONTRACT_HASH, targetHash);\n  }\n\n  const toMarker = findPath(graph, EMPTY_CONTRACT_HASH, markerHash);\n  // Marker unreachable from EMPTY — show the target chain anyway.\n  // The caller detects this via markerInChain and emits a divergence diagnostic.\n  if (!toMarker) return findPath(graph, EMPTY_CONTRACT_HASH, targetHash);\n\n  if (markerHash === targetHash) return toMarker;\n\n  const fromMarker = findPath(graph, markerHash, targetHash);\n  if (fromMarker) return [...toMarker, ...fromMarker];\n\n  // Marker is ahead of target (or on a disconnected branch).\n  // Try the inverse: target→marker. If it succeeds, the marker is ahead —\n  // show the full chain from EMPTY through the target and on to the marker.\n  const toTarget = findPath(graph, EMPTY_CONTRACT_HASH, targetHash);\n  if (!toTarget) return null;\n\n  const targetToMarker = findPath(graph, targetHash, markerHash);\n  if (targetToMarker) return [...toTarget, ...targetToMarker];\n\n  // Genuinely disconnected — show EMPTY→target; caller handles divergence diagnostic.\n  return toTarget;\n}\n\n/**\n * Build the aggregate enumeration of contract spaces for the status\n * output. Loads the aggregate from disk (lossy on failure — extension\n * spaces are simply omitted, the existing single-space app behaviour\n * keeps working), reads per-space marker rows when online, and uses\n * {@link graphWalkStrategy} to compute each space's pending count.\n *\n * Sub-spec § `migration status` semantics — the aggregate-walking\n * version reports per-space marker + pending state alongside the\n * cross-space totals.\n */\nexport async function loadAggregateStatusSpaces(args: {\n  readonly targetId: string;\n  readonly migrationsDir: string;\n  readonly appContractRaw: unknown;\n  readonly extensionPacks: BuildAggregateInputs<string, string>['extensionPacks'];\n  readonly deserializeContract: BuildAggregateInputs<string, string>['deserializeContract'];\n  readonly markersBySpace: ReadonlyMap<string, ContractMarkerRecordLike> | null;\n}): Promise<readonly MigrationStatusSpaceEntry[]> {\n  const loadInputs: BuildAggregateInputs<string, string> = {\n    targetId: args.targetId,\n    migrationsDir: args.migrationsDir,\n    appContract: args.deserializeContract(args.appContractRaw),\n    extensionPacks: args.extensionPacks,\n    deserializeContract: args.deserializeContract,\n  };\n\n  const loaded = await buildContractSpaceAggregate(loadInputs);\n  if (!loaded.ok) {\n    // Loader failure (drift, layout violation, etc.) — surfacing it\n    // as a status diagnostic would duplicate `migration plan`'s job.\n    // The single-space app pipeline still runs; extensions are simply\n    // not enumerated.\n    return [];\n  }\n  const aggregate = loaded.value;\n\n  const orderedMembers = [...aggregate.extensions, aggregate.app];\n  const rows: MigrationStatusSpaceEntry[] = [];\n  for (const member of orderedMembers) {\n    const liveMarker = args.markersBySpace?.get(member.spaceId) ?? null;\n    const isApp = member.spaceId === aggregate.app.spaceId;\n\n    if (member.migrations.graph.nodes.size === 0) {\n      rows.push({\n        spaceId: member.spaceId,\n        kind: isApp ? 'app' : 'extension',\n        headHash: member.headRef.hash,\n        ...(args.markersBySpace !== null\n          ? {\n              markerHash: liveMarker?.storageHash ?? null,\n              status: member.headRef.hash === EMPTY_CONTRACT_HASH ? 'up-to-date' : 'never-planned',\n              pendingCount: 0,\n            }\n          : {}),\n      });\n      continue;\n    }\n\n    if (args.markersBySpace === null) {\n      rows.push({\n        spaceId: member.spaceId,\n        kind: isApp ? 'app' : 'extension',\n        headHash: member.headRef.hash,\n      });\n      continue;\n    }\n\n    const walked = graphWalkStrategy({\n      aggregateTargetId: aggregate.targetId,\n      member,\n      currentMarker: liveMarker,\n    });\n    let pendingCount = 0;\n    let status: MigrationStatusSpaceEntry['status'];\n    if (walked.kind === 'ok') {\n      // Count pending *migrations* (graph edges), not operations: a\n      // single authored migration that lowers to N ops or zero ops\n      // both count as exactly one pending unit of work for the user.\n      pendingCount = walked.result.migrationEdges?.length ?? 0;\n      if (liveMarker === null) {\n        status = pendingCount === 0 ? 'no-marker' : 'pending';\n      } else {\n        status = pendingCount === 0 ? 'up-to-date' : 'pending';\n      }\n    } else {\n      status = 'unreachable';\n    }\n\n    rows.push({\n      spaceId: member.spaceId,\n      kind: isApp ? 'app' : 'extension',\n      headHash: member.headRef.hash,\n      markerHash: liveMarker?.storageHash ?? null,\n      pendingCount,\n      ...(status ? { status } : {}),\n    });\n  }\n  return rows;\n}\n\n/**\n * Read the raw contract.json bytes from disk for the aggregate\n * loader. Returns `null` if the file is missing or unparseable —\n * the existing `readContractEnvelope` path will report the same\n * problem via a status diagnostic, no need to double-surface.\n */\nasync function loadContractRawSafely(config: {\n  contract?: { output?: string };\n}): Promise<unknown | null> {\n  try {\n    const path = (await import('../utils/command-helpers')).resolveContractPath(config);\n    const raw = await (await import('node:fs/promises')).readFile(path, 'utf-8');\n    return JSON.parse(raw) as unknown;\n  } catch {\n    return null;\n  }\n}\n\nasync function validateOnlineMarkerRead(\n  config: Awaited<ReturnType<typeof loadConfig>>,\n  dbConnection: unknown,\n): Promise<Result<void, CliStructuredError>> {\n  const driver = config.driver;\n  if (!driver) {\n    return ok(undefined);\n  }\n\n  const client = createControlClient({\n    family: config.family,\n    target: config.target,\n    adapter: config.adapter,\n    driver,\n    extensionPacks: config.extensionPacks ?? [],\n  });\n  try {\n    await client.connect(dbConnection);\n    await client.readMarker();\n    return ok(undefined);\n  } catch (error) {\n    if (CliStructuredError.is(error)) {\n      return notOk(error);\n    }\n    return notOk(\n      errorUnexpected(error instanceof Error ? error.message : String(error), {\n        why: `Failed to read database marker: ${error instanceof Error ? error.message : String(error)}`,\n      }),\n    );\n  } finally {\n    await client.close();\n  }\n}\n\nasync function executeMigrationStatusCommand(\n  options: MigrationStatusOptions,\n  flags: GlobalFlags,\n  ui: TerminalUI,\n): Promise<Result<MigrationStatusResult, CliStructuredError>> {\n  const config = await loadConfig(options.config);\n  const { configPath, appMigrationsDir, appMigrationsRelative, migrationsDir, refsDir } =\n    resolveMigrationPaths(options.config, config);\n\n  const dbConnection = options.db ?? config.db?.connection;\n  const hasDriver = !!config.driver;\n\n  let activeRefName: string | undefined;\n  let activeRefHash: string | undefined;\n  let activeRefEntry: RefEntry | undefined;\n  let allRefs: Refs = {};\n  try {\n    allRefs = await readRefs(refsDir);\n  } catch (error) {\n    if (MigrationToolsError.is(error)) {\n      return notOk(mapMigrationToolsError(error));\n    }\n    throw error;\n  }\n\n  let fromOverrideHash: string | undefined;\n\n  if (options.to || options.from) {\n    try {\n      const { graph: earlyGraph } = await loadMigrationPackages(appMigrationsDir);\n\n      if (options.to) {\n        const refResult = parseContractRef(options.to, { graph: earlyGraph, refs: allRefs });\n        if (!refResult.ok) {\n          return notOk(mapRefResolutionError(refResult.failure));\n        }\n        activeRefHash = refResult.value.hash;\n        if (refResult.value.provenance.kind === 'ref') {\n          const resolvedRefName = refResult.value.provenance.refName;\n          activeRefName = resolvedRefName;\n          activeRefEntry = allRefs[resolvedRefName];\n        }\n      }\n\n      if (options.from) {\n        const fromResult = parseContractRef(options.from, { graph: earlyGraph, refs: allRefs });\n        if (!fromResult.ok) {\n          return notOk(mapRefResolutionError(fromResult.failure));\n        }\n        fromOverrideHash = fromResult.value.hash;\n      }\n    } catch (error) {\n      if (MigrationToolsError.is(error)) {\n        return notOk(mapMigrationToolsError(error));\n      }\n      throw error;\n    }\n  }\n\n  const requiredInvariants: readonly string[] = [...(activeRefEntry?.invariants ?? [])].sort();\n\n  const statusRefs: StatusRef[] = Object.entries(allRefs).map(([name, entry]) => ({\n    name,\n    hash: entry.hash,\n    active: name === activeRefName,\n  }));\n\n  if (!flags.json && !flags.quiet) {\n    const details: Array<{ label: string; value: string }> = [\n      { label: 'config', value: configPath },\n      { label: 'migrations', value: appMigrationsRelative },\n    ];\n    if (dbConnection && hasDriver) {\n      details.push({ label: 'database', value: maskConnectionUrl(String(dbConnection)) });\n    }\n    if (activeRefName) {\n      details.push({ label: 'ref', value: activeRefName });\n    }\n    if (options.from) {\n      details.push({ label: 'from', value: options.from });\n    }\n    if (activeRefEntry && activeRefEntry.invariants.length > 0) {\n      details.push({\n        label: 'required',\n        value: formatInvariantList(activeRefEntry.invariants),\n      });\n    }\n    const header = formatStyledHeader({\n      command: 'migration status',\n      description: 'Show migration history and applied status',\n      details,\n      flags,\n    });\n    ui.stderr(header);\n  }\n\n  const diagnostics: StatusDiagnostic[] = [];\n  let contractHash: string = EMPTY_CONTRACT_HASH;\n  try {\n    const envelope = await readContractEnvelope(config);\n    contractHash = envelope.storageHash;\n  } catch (error) {\n    diagnostics.push({\n      code: 'CONTRACT.UNREADABLE',\n      severity: 'warn',\n      message: `Could not read contract: ${error instanceof Error ? error.message : 'unknown error'}`,\n      hints: [\"Run 'prisma-next contract emit' to generate a valid contract\"],\n    });\n  }\n\n  let bundles: readonly OnDiskMigrationPackage[];\n  let graph: MigrationGraph;\n  try {\n    ({ bundles, graph } = await loadMigrationPackages(appMigrationsDir));\n  } catch (error) {\n    if (MigrationToolsError.is(error)) {\n      return notOk(mapMigrationToolsError(error));\n    }\n    return notOk(\n      errorUnexpected(error instanceof Error ? error.message : String(error), {\n        why: `Failed to read migrations directory: ${error instanceof Error ? error.message : String(error)}`,\n      }),\n    );\n  }\n\n  if (bundles.length === 0) {\n    if (dbConnection && hasDriver) {\n      const markerProbe = await validateOnlineMarkerRead(config, dbConnection);\n      if (!markerProbe.ok) {\n        return markerProbe;\n      }\n    }\n    if (contractHash !== EMPTY_CONTRACT_HASH) {\n      diagnostics.push({\n        code: 'CONTRACT.AHEAD',\n        severity: 'warn',\n        message: 'No migration exists for the current contract',\n        hints: [\n          \"Run 'prisma-next migration plan' to generate a migration for the current contract\",\n        ],\n      });\n    }\n    return ok({\n      ok: true,\n      mode: dbConnection && hasDriver ? 'online' : 'offline',\n      migrations: [],\n      targetHash: EMPTY_CONTRACT_HASH,\n      contractHash,\n      summary: 'No migrations found',\n      diagnostics,\n      requiredInvariants,\n    });\n  }\n\n  let targetHash: string | undefined;\n\n  if (activeRefHash) {\n    targetHash = activeRefHash;\n  } else if (graph.nodes.has(contractHash)) {\n    targetHash = contractHash;\n  } else {\n    const leaves = findReachableLeaves(graph, EMPTY_CONTRACT_HASH);\n    if (leaves.length === 1) {\n      targetHash = leaves[0];\n    } else {\n      diagnostics.push({\n        code: 'MIGRATION.DIVERGED',\n        severity: 'warn',\n        message: 'There are multiple valid migration paths — you must select a target',\n        hints: [\n          \"Use '--to <contract>' to select a target\",\n          \"Or 'prisma-next ref set <name> <hash>' to create one\",\n        ],\n      });\n    }\n  }\n\n  let markerHash: string | undefined;\n  let markerInvariants: readonly string[] = [];\n  let mode: 'online' | 'offline' = 'offline';\n  let allMarkers: ReadonlyMap<string, ContractMarkerRecordLike> | null = null;\n\n  if (dbConnection && hasDriver) {\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    try {\n      await client.connect(dbConnection);\n      const marker = await client.readMarker();\n      markerHash = marker?.storageHash;\n      markerInvariants = marker?.invariants ?? [];\n      mode = 'online';\n      // Read every space's marker so the aggregate enumeration can\n      // surface per-space marker state. `readAllMarkers` mirrors what\n      // `db init` / `db update` already use to drive the multi-space\n      // planner; here it powers the aggregate status output.\n      //\n      // Probe for the method first so we only swallow the\n      // unsupported-method case: older family instances may not\n      // implement `readAllMarkers` (per-space enumeration then falls\n      // back to \"marker unknown\"). Real query / runtime errors from\n      // an instance that *does* expose the method must propagate up\n      // — otherwise transient DB failures would silently degrade\n      // status to \"markers unknown\".\n      if (typeof client.readAllMarkers === 'function') {\n        allMarkers = await client.readAllMarkers();\n      } else {\n        // Leaving `allMarkers` as `null` signals \"unknown\" to the\n        // aggregate loader (an empty `Map` would instead mean \"every\n        // space has no marker\", which is a different condition).\n        allMarkers = null;\n      }\n    } catch (error) {\n      if (CliStructuredError.is(error)) {\n        return notOk(error);\n      }\n      if (!flags.json && !flags.quiet) {\n        ui.warn('Could not connect to database — showing offline status');\n      }\n    } finally {\n      await client.close();\n    }\n  }\n\n  if (fromOverrideHash !== undefined) {\n    markerHash = fromOverrideHash;\n    mode = 'offline';\n    allMarkers = null;\n  }\n\n  // Build the aggregate enumeration of contract spaces. Lossy on\n  // failure (extensions are simply omitted) so the existing\n  // single-space app pipeline below still runs even if extensions\n  // can't be loaded — a strict failure here would degrade the\n  // load-bearing app-space output for unrelated reasons.\n  const contractRawForAggregate = await loadContractRawSafely(config);\n  let aggregateSpaces: readonly MigrationStatusSpaceEntry[] = [];\n  if (contractRawForAggregate !== null) {\n    // The aggregate loader needs a typed-Contract producer. Build a\n    // real control stack so `deserializeContract` runs against a fully\n    // composed family instance — descriptors that read stack members\n    // during construction (e.g. codec lookups) get a consistent view.\n    const stack = createControlStack(config);\n    const familyInstance = config.family.create(stack);\n    try {\n      aggregateSpaces = await loadAggregateStatusSpaces({\n        targetId: config.target.targetId,\n        migrationsDir,\n        appContractRaw: contractRawForAggregate,\n        extensionPacks: config.extensionPacks ?? [],\n        deserializeContract: (json: unknown) => familyInstance.deserializeContract(json),\n        markersBySpace: allMarkers,\n      });\n    } catch {\n      // Loader failure short-circuits silently — the existing\n      // single-space app pipeline below still runs.\n      aggregateSpaces = [];\n    }\n  }\n  const totalPendingAcrossSpaces = computeTotalPendingAcrossSpaces(aggregateSpaces);\n\n  // Pre-check unknown invariants. Online: union the graph's declared\n  // invariants with the marker's recorded set so a retired-but-applied\n  // invariant doesn't surface as MIGRATION.UNKNOWN_INVARIANT — apply would\n  // route fine because marker subtraction empties `effectiveRequired`.\n  // Offline: keep the check graph-strict (the marker is unknown, and a\n  // missing declarer is the dominant signal we can offer).\n  if (activeRefEntry && activeRefEntry.invariants.length > 0) {\n    const declared = collectDeclaredInvariants(graph);\n    const known = new Set<string>(declared);\n    if (mode === 'online') {\n      for (const id of markerInvariants) known.add(id);\n    }\n    const unknown = activeRefEntry.invariants.filter((id) => !known.has(id));\n    if (unknown.length > 0) {\n      return notOk(\n        mapMigrationToolsError(\n          errorUnknownInvariant({\n            ...ifDefined('refName', activeRefName),\n            unknown,\n            declared: [...declared].sort(),\n          }),\n        ),\n      );\n    }\n  }\n\n  // Marker exists but is not in the migration graph and doesn't match the\n  // contract hash. The DB is at an unknown state relative to the graph.\n  // Bail out early with a clear diagnostic instead of rendering a confusing\n  // graph with no statuses.\n  //\n  // When marker === contract (both off-graph), the DB matches the current\n  // contract — proceed normally; the detached contract node will carry both\n  // the db and contract markers.\n  if (\n    mode === 'online' &&\n    markerHash !== undefined &&\n    !graph.nodes.has(markerHash) &&\n    markerHash !== contractHash\n  ) {\n    const hints: string[] = [];\n    if (graph.nodes.has(contractHash)) {\n      hints.push(\n        \"Run 'prisma-next db sign' to overwrite the marker if the database already matches the contract\",\n        \"Run 'prisma-next db update' to push the current contract to the database\",\n        \"Run 'prisma-next contract infer' to make your contract match the database\",\n        \"Run 'prisma-next db verify' to inspect the database state\",\n      );\n    } else {\n      hints.push(\n        \"Run 'prisma-next db update' to push the current contract to the database\",\n        \"Run 'prisma-next contract infer' to make your contract match the database\",\n        \"Run 'prisma-next db verify' to inspect the database state\",\n      );\n    }\n    diagnostics.push({\n      code: 'MIGRATION.MARKER_NOT_IN_HISTORY',\n      severity: 'warn',\n      message:\n        'Database was updated outside the migration system (marker does not match any migration)',\n      hints,\n    });\n    return ok({\n      ok: true,\n      mode,\n      migrations: [],\n      targetHash: EMPTY_CONTRACT_HASH,\n      contractHash,\n      summary: `${bundles.length} migration(s) on disk`,\n      diagnostics,\n      markerHash,\n      requiredInvariants,\n      ...(statusRefs.length > 0 ? { refs: statusRefs } : {}),\n    });\n  }\n\n  if (mode === 'online' && markerHash === undefined) {\n    diagnostics.push({\n      code: 'MIGRATION.NO_MARKER',\n      severity: 'warn',\n      message: 'Database has not been initialized — no migration marker found',\n      hints: [\"Run 'prisma-next migrate' to apply pending migrations\"],\n    });\n  }\n\n  // Contract diagnostic — fires when no migration produces the current contract hash.\n  // Suppressed when: (a) graph is diverged (MIGRATION.DIVERGED already guides the user),\n  // (b) marker === contract and both off-graph (marker-not-in-graph diagnostic covers it).\n  if (\n    targetHash &&\n    contractHash !== EMPTY_CONTRACT_HASH &&\n    !graph.nodes.has(contractHash) &&\n    markerHash !== contractHash\n  ) {\n    diagnostics.push({\n      code: 'CONTRACT.AHEAD',\n      severity: 'warn',\n      message: 'Contract has changed since the last migration was planned',\n      hints: [\"Run 'prisma-next migration plan' to generate a migration for the current contract\"],\n    });\n  }\n\n  if (!targetHash) {\n    return ok({\n      ok: true,\n      mode,\n      migrations: [],\n      targetHash: EMPTY_CONTRACT_HASH,\n      contractHash,\n      summary: `${bundles.length} migration(s) on disk`,\n      diagnostics,\n      ...ifDefined('markerHash', markerHash),\n      requiredInvariants,\n      ...(statusRefs.length > 0 ? { refs: statusRefs } : {}),\n      graph,\n      bundles,\n      diverged: true,\n    });\n  }\n\n  const chain = resolveDisplayChain(graph, targetHash, markerHash);\n\n  if (!chain) {\n    return notOk(\n      errorRuntime('Cannot reconstruct migration history', {\n        why: `No path from ${EMPTY_CONTRACT_HASH} to target ${targetHash}`,\n        fix: 'The migration history may have gaps. Check the migrations directory for missing or corrupted packages.',\n      }),\n    );\n  }\n\n  const edgeStatuses = deriveEdgeStatuses(graph, targetHash, contractHash, markerHash, mode);\n  const entries = buildMigrationEntries(chain, bundles, mode, markerHash, edgeStatuses);\n\n  const pendingCount = edgeStatuses.filter((e) => e.status === 'pending').length;\n  const appliedCount = edgeStatuses.filter((e) => e.status === 'applied').length;\n\n  let appliedInvariants: readonly string[] | undefined;\n  let missingInvariants: readonly string[] | undefined;\n  let effectiveRequired = new Set<string>();\n  if (mode === 'online') {\n    // Mirrors `migrate.ts`: compute `effectiveRequired = required −\n    // marker.invariants` directly, then derive the display fields from it.\n    // `appliedInvariants` is the intersection (`required ∩ marker`), which\n    // is what JSON consumers see for the active ref; the unfiltered set\n    // lives on `marker.invariants`.\n    const markerSet = new Set(markerInvariants);\n    effectiveRequired = new Set(requiredInvariants.filter((id) => !markerSet.has(id)));\n    appliedInvariants = requiredInvariants.filter((id) => markerSet.has(id));\n    missingInvariants = [...effectiveRequired].sort();\n  }\n\n  // The marker can match the structural target while still missing required\n  // invariants — for example, a self-edge that provides X, applied via a ref\n  // declaring X. `pendingCount` (structural) says zero in that case but\n  // `effectiveRequired` is non-empty, so up-to-date messaging would mislead.\n  const hasInvariantWork = effectiveRequired.size > 0;\n  const missingList = [...effectiveRequired].sort().join(', ');\n\n  let summary: string;\n  if (mode === 'online') {\n    if (markerHash !== undefined && !graph.nodes.has(markerHash) && markerHash === contractHash) {\n      summary = `${bundles.length} migration(s) on disk`;\n    } else if (activeRefHash && activeRefName && markerHash !== undefined) {\n      const distance = summarizeRefDistance(graph, markerHash, activeRefHash, activeRefName);\n      summary = hasInvariantWork ? `${distance} — missing invariant(s): ${missingList}` : distance;\n    } else if (pendingCount === 0 && !hasInvariantWork) {\n      summary = `Database is up to date (${appliedCount} migration${appliedCount !== 1 ? 's' : ''} applied)`;\n    } else if (pendingCount === 0 && hasInvariantWork) {\n      summary = `Missing invariant(s): ${missingList} — run 'prisma-next migrate --to ${activeRefName ?? '<ref>'}' to apply`;\n    } else if (markerHash === undefined) {\n      summary = `${pendingCount} pending migration(s) — database has no marker`;\n    } else {\n      summary = `${pendingCount} pending migration(s) — run 'prisma-next migrate' to apply`;\n    }\n  } else {\n    summary = `${entries.length} migration(s) on disk`;\n  }\n\n  let pathDecision: MigrationStatusResult['pathDecision'];\n  let routingUnreachable = false;\n  if (mode === 'online') {\n    const originHash = markerHash ?? EMPTY_CONTRACT_HASH;\n    const outcome = findPathWithDecision(graph, originHash, targetHash, {\n      ...ifDefined('refName', activeRefName),\n      required: effectiveRequired,\n    });\n    if (outcome.kind === 'ok') {\n      pathDecision = toPathDecisionResult(outcome.decision);\n    } else if (outcome.kind === 'unsatisfiable') {\n      return notOk(\n        mapMigrationToolsError(\n          errorNoInvariantPath({\n            ...ifDefined('refName', activeRefName),\n            required: [...effectiveRequired].sort(),\n            missing: outcome.missing,\n            structuralPath: outcome.structuralPath.map(toStructuralEdge),\n          }),\n        ),\n      );\n    } else {\n      // outcome.kind === 'unreachable' — origin (marker) has no structural\n      // path to the active target. `pendingCount` and `hasInvariantWork`\n      // both report zero in this case, but emitting MIGRATION.UP_TO_DATE\n      // would be wrong: the database simply cannot reach the requested\n      // ref/contract from its current state. Suppress UP_TO_DATE below.\n      routingUnreachable = true;\n    }\n  }\n\n  if (mode === 'online') {\n    if (markerHash !== undefined && !graph.nodes.has(markerHash) && markerHash === contractHash) {\n      diagnostics.push({\n        code: 'MIGRATION.MARKER_NOT_IN_HISTORY',\n        severity: 'warn',\n        message: 'Database matches the current contract but was updated directly (not via migrate)',\n        hints: [\"Run 'prisma-next migration plan' to plan a migration to your current contract\"],\n      });\n    } else if (pendingCount > 0) {\n      diagnostics.push({\n        code: 'MIGRATION.DATABASE_BEHIND',\n        severity: 'info',\n        message: `${pendingCount} migration(s) pending`,\n        hints: [\"Run 'prisma-next migrate' to apply pending migrations\"],\n      });\n    } else if (hasInvariantWork) {\n      diagnostics.push({\n        code: 'MIGRATION.INVARIANTS_PENDING',\n        severity: 'info',\n        message: `Missing required invariant(s): ${missingList}`,\n        hints: [\n          `Run 'prisma-next migrate --to ${activeRefName ?? '<ref>'}' to apply a path that covers the required invariants`,\n        ],\n      });\n    } else if (!routingUnreachable) {\n      diagnostics.push({\n        code: 'MIGRATION.UP_TO_DATE',\n        severity: 'info',\n        message: 'Database is up to date',\n        hints: [],\n      });\n    }\n  }\n\n  const result: MigrationStatusResult = {\n    ok: true,\n    mode,\n    migrations: entries,\n    targetHash,\n    contractHash,\n    summary,\n    diagnostics,\n    ...ifDefined('markerHash', markerHash),\n    requiredInvariants,\n    ...ifDefined('appliedInvariants', appliedInvariants),\n    ...ifDefined('missingInvariants', missingInvariants),\n    ...(statusRefs.length > 0 ? { refs: statusRefs } : {}),\n    ...ifDefined('pathDecision', pathDecision),\n    graph,\n    bundles,\n    edgeStatuses,\n    ...ifDefined('activeRefHash', activeRefHash),\n    ...ifDefined('activeRefName', activeRefName),\n    spaces: aggregateSpaces,\n    ...ifDefined('totalPendingAcrossSpaces', totalPendingAcrossSpaces),\n  };\n  return ok(result);\n}\n\nexport function createMigrationStatusCommand(): Command {\n  const command = new Command('status');\n  setCommandDescriptions(\n    command,\n    'Show migration path and pending status',\n    'Shows which migrations are pending between the database marker and\\n' +\n      'the target contract. Requires a database connection for live status.\\n' +\n      'Use `migration graph` for topology, `migration log` for history,\\n' +\n      'and `migration list` for on-disk enumeration.',\n  );\n  setCommandExamples(command, [\n    'prisma-next migration status --db $DATABASE_URL',\n    'prisma-next migration status --to production --db $DATABASE_URL',\n  ]);\n  setCommandSeeAlso(command, [\n    { verb: 'migration log', oneLiner: 'Show executed migration history' },\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(\n      '--to <contract>',\n      'Target contract reference (hash, prefix, ref name, migration dir name, <dir>^, or ./path)',\n    )\n    .option(\n      '--from <contract>',\n      'Origin contract reference; same grammar as --to. Supplying --from switches to offline path computation.',\n    )\n    .action(async (options: MigrationStatusOptions) => {\n      const flags = parseGlobalFlagsOrExit(options);\n      const ui = createTerminalUI(flags);\n\n      const result = await executeMigrationStatusCommand(options, flags, ui);\n\n      const exitCode = handleResult(result, flags, ui, (statusResult) => {\n        if (flags.json) {\n          const {\n            graph: _graph,\n            bundles: _bundles,\n            edgeStatuses: _edgeStatuses,\n            activeRefHash: _activeRefHash,\n            activeRefName: _activeRefName,\n            diverged: _diverged,\n            ...jsonResult\n          } = statusResult;\n          ui.output(JSON.stringify(jsonResult, null, 2));\n        } else if (!flags.quiet) {\n          const colorize = flags.color !== false;\n\n          if (statusResult.graph) {\n            const renderInput = migrationGraphToRenderInput({\n              graph: statusResult.graph,\n              mode: statusResult.mode,\n              markerHash: statusResult.markerHash,\n              contractHash: statusResult.contractHash,\n              refs: statusResult.refs,\n              activeRefHash: statusResult.activeRefHash,\n              activeRefName: statusResult.activeRefName,\n              edgeStatuses: statusResult.edgeStatuses,\n            });\n\n            const graphToRender = statusResult.diverged\n              ? renderInput.graph\n              : extractRelevantSubgraph(renderInput.graph, renderInput.relevantPaths);\n            const dagreOptions = isLinearGraph(graphToRender) ? { ranksep: 1 } : undefined;\n            const renderOptions = {\n              ...renderInput.options,\n              colorize,\n              ...ifDefined('dagreOptions', dagreOptions),\n            };\n            const graphOutput = graphRenderer.render(graphToRender, renderOptions);\n            ui.log(graphOutput);\n            if (statusResult.mode === 'online') {\n              ui.log(formatLegend(colorize));\n            }\n          }\n          ui.log('');\n          ui.log(formatStatusSummary(statusResult, colorize));\n        }\n      });\n\n      process.exit(exitCode);\n    });\n\n  return command;\n}\n\nfunction formatLegend(colorize: boolean): string {\n  const c = (fn: (s: string) => string, s: string) => (colorize ? fn(s) : s);\n  const parts = [\n    `${c(cyan, '✓')} applied`,\n    `${c(yellow, '⧗')} pending`,\n    `${c(magenta, '✗')} unreachable`,\n  ];\n  return c(dim, parts.join('  '));\n}\n\nexport function formatStatusSummary(result: MigrationStatusResult, colorize: boolean): string {\n  const c = (fn: (s: string) => string, s: string) => (colorize ? fn(s) : s);\n  const lines: string[] = [];\n\n  const hasUnknown = result.migrations.some((e) => e.status === 'unknown');\n  const pendingCount = result.migrations.filter((e) => e.status === 'pending').length;\n\n  const hasWarnings = result.diagnostics?.some((d) => d.severity === 'warn') ?? false;\n  // INVARIANTS_PENDING is filed at severity 'info' (per ADR 208) so the\n  // warn-severity check above doesn't see it. It still represents pending\n  // work, so it must promote the summary off the success icon.\n  const hasInvariantPending =\n    result.diagnostics?.some((d) => d.code === 'MIGRATION.INVARIANTS_PENDING') ?? false;\n\n  if (result.mode === 'online') {\n    if (hasUnknown || hasWarnings) {\n      lines.push(`${c(yellow, '⚠')} ${result.summary}`);\n    } else if (pendingCount === 0 && !hasInvariantPending) {\n      lines.push(`${c(cyan, '✔')} ${result.summary}`);\n    } else {\n      lines.push(`${c(yellow, '⧗')} ${result.summary}`);\n    }\n  } else {\n    lines.push(result.summary);\n  }\n\n  if (result.requiredInvariants.length > 0) {\n    if (result.appliedInvariants !== undefined && result.missingInvariants !== undefined) {\n      lines.push(`${c(dim, 'applied  ')}${formatInvariantList(result.appliedInvariants)}`);\n      lines.push(`${c(dim, 'missing  ')}${formatInvariantList(result.missingInvariants)}`);\n    } else {\n      lines.push(`${c(dim, 'applied  ')}(unknown — connect a database to evaluate)`);\n    }\n  }\n\n  const warnings = result.diagnostics?.filter((d) => d.severity === 'warn') ?? [];\n  for (const diag of warnings) {\n    lines.push(`${c(yellow, '⚠')} ${diag.message}`);\n    for (const hint of diag.hints) {\n      lines.push(`  ${c(dim, hint)}`);\n    }\n  }\n\n  // Per-space section. Suppressed when there's no extension space —\n  // the legacy single-space output already covers the app member.\n  // When extensions exist, render every space (including the app)\n  // for consistency, plus a cross-space pending total + apply hint.\n  if (result.spaces?.some((s) => s.kind === 'extension')) {\n    const total = result.totalPendingAcrossSpaces ?? 0;\n    lines.push('');\n    lines.push(c(dim, 'spaces'));\n    for (const space of result.spaces) {\n      lines.push(formatSpaceLine(space, c));\n    }\n    if (total > 0) {\n      lines.push('');\n      lines.push(\n        `${c(yellow, '⧗')} ${total} pending migration(s) across ${result.spaces.length} space(s) — run 'prisma-next migrate' to apply`,\n      );\n    }\n  }\n\n  return lines.join('\\n');\n}\n\nfunction formatSpaceLine(\n  space: MigrationStatusSpaceEntry,\n  c: (fn: (s: string) => string, s: string) => string,\n): string {\n  const glyph = (() => {\n    if (space.status === 'up-to-date' || space.status === 'no-marker') return c(cyan, '✓');\n    if (space.status === 'pending') return c(yellow, '⧗');\n    if (space.status === 'unreachable' || space.status === 'never-planned') return c(magenta, '✗');\n    return ' ';\n  })();\n  const tag = space.kind === 'app' ? '[app]' : '[ext]';\n  const head = space.headHash.slice(0, 8);\n  const marker =\n    space.markerHash === undefined\n      ? '(unknown)'\n      : space.markerHash === null\n        ? '(no marker)'\n        : space.markerHash.slice(0, 8);\n  const pending =\n    space.pendingCount === undefined\n      ? ''\n      : space.pendingCount === 0\n        ? c(dim, ' (up to date)')\n        : c(yellow, ` (${space.pendingCount} pending)`);\n  return `  ${glyph} ${c(dim, tag)} ${space.spaceId} → head ${c(dim, head)}, marker ${c(dim, marker)}${pending}`;\n}\n\nfunction formatInvariantList(ids: readonly string[]): string {\n  return ids.length === 0 ? '(none)' : ids.join(', ');\n}\n\nfunction summarizeRefDistance(\n  graph: MigrationGraph,\n  markerHash: string,\n  refHash: string,\n  refName: string,\n): string {\n  if (markerHash === refHash) return `At ref \"${refName}\" target`;\n\n  const pathToRef = findPath(graph, markerHash, refHash);\n  if (pathToRef) return `${pathToRef.length} migration(s) behind ref \"${refName}\"`;\n\n  const pathFromRef = findPath(graph, refHash, markerHash);\n  if (pathFromRef) return `${pathFromRef.length} migration(s) ahead of ref \"${refName}\"`;\n\n  return `No path between database marker and ref \"${refName}\" target`;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AA6HA,SAAgB,gCACd,QACoB;CACpB,IAAI,OAAO,WAAW,GAAG,OAAO,KAAA;CAChC,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,QAAQ;EACtB,IAAI,EAAE,iBAAiB,KAAA,GAAW,OAAO,KAAA;EACzC,SAAS,EAAE;;CAEb,OAAO;;AAoET,SAAS,aAAa,KAGpB;CACA,IAAI,IAAI,WAAW,GAAG,OAAO;EAAE,SAAS;EAAS,gBAAgB;EAAO;CAExE,MAAM,0BAAU,IAAI,KAAqB;CACzC,KAAK,MAAM,MAAM,KACf,QAAQ,IAAI,GAAG,iBAAiB,QAAQ,IAAI,GAAG,eAAe,IAAI,KAAK,EAAE;CAG3E,MAAM,iBAAiB,QAAQ,IAAI,cAAc;CACjD,MAAM,QAAQ,IAAI;CAClB,MAAM,OAAO,UAAU,IAAI,OAAO;CAElC,IAAI,QAAQ,SAAS,GAEnB,OAAO;EAAE,SAAS,GAAG,MAAM,GAAG,KAAK,QADvB,CAAC,GAAG,QAAQ,MAAM,CAAC,CAAC,GACe;EAAI;EAAgB;CAGrE,MAAM,mBAAmB,QAAQ,IAAI,cAAc;CACnD,IAAI,kBACF,OAAO;EAAE,SAAS,GAAG,MAAM,GAAG,KAAK,IAAI,iBAAiB;EAAgB;EAAgB;CAI1F,OAAO;EAAE,SAAS,GAAG,MAAM,GAAG,KAAK,IADrB,CAAC,GAAG,QAAQ,SAAS,CAAC,CAAC,KAAK,CAAC,KAAK,OAAO,GAAG,EAAE,GAAG,MACnB,CAAC,KAAK,KAAK,CAAC;EAAI;EAAgB;;;;;;;;;;;;;;;;;AAkB9E,SAAgB,mBACd,OACA,YACA,cACA,YACA,MACc;CACd,IAAI,SAAS,WAAW,OAAO,EAAE;CAEjC,MAAM,WAAW,MAAqB,GAAG,EAAE,KAAK,IAAI,EAAE;CAGtD,MAAM,kBAAkB,cAAc;CAEtC,MAAM,cACJ,eAAe,KAAA,IAAY,SAAS,OAAO,qBAAqB,WAAW,GAAG;CAEhF,MAAM,cAAc,SAAS,OAAO,iBAAiB,WAAW;CAChE,MAAM,aAAa,SAAS,OAAO,qBAAqB,WAAW;CAEnE,MAAM,WAAyB,EAAE;CACjC,MAAM,+BAAe,IAAI,KAAa;CAGtC,IAAI,aACF,KAAK,MAAM,KAAK,aAAa;EAC3B,aAAa,IAAI,QAAQ,EAAE,CAAC;EAC5B,SAAS,KAAK;GAAE,SAAS,EAAE;GAAS,QAAQ;GAAW,CAAC;;CAK5D,IAAI,aACF,KAAK,MAAM,KAAK,aAAa;EAC3B,aAAa,IAAI,QAAQ,EAAE,CAAC;EAC5B,SAAS,KAAK;GAAE,SAAS,EAAE;GAAS,QAAQ;GAAW,CAAC;;CAM5D,IACE,iBAAiB,uBACjB,iBAAiB,cACjB,MAAM,MAAM,IAAI,aAAa,EAC7B;EACA,MAAM,eAAe,SAAS,OAAO,YAAY,aAAa;EAC9D,IAAI;QACG,MAAM,KAAK,cACd,IAAI,CAAC,aAAa,IAAI,QAAQ,EAAE,CAAC,EAAE;IACjC,aAAa,IAAI,QAAQ,EAAE,CAAC;IAC5B,SAAS,KAAK;KAAE,SAAS,EAAE;KAAS,QAAQ;KAAW,CAAC;;;;CAYhE,IAAI;OACG,MAAM,KAAK,YACd,IAAI,CAAC,aAAa,IAAI,QAAQ,EAAE,CAAC,EAC/B,SAAS,KAAK;GAAE,SAAS,EAAE;GAAS,QAAQ;GAAe,CAAC;;CAKlE,OAAO;;;;;;AAOT,SAAS,sBACP,OACA,UACA,MACA,YACA,cACwB;CACxB,MAAM,eAAe,IAAI,IAAI,SAAS,KAAK,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;CACjE,MAAM,kBAAkB,eACpB,IAAI,IAAI,aAAa,KAAK,MAAM,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,GACvD,KAAA;CAEJ,MAAM,gBAAgB,eAAe,KAAA,KAAa,MAAM,MAAM,MAAM,EAAE,OAAO,WAAW;CAExF,MAAM,UAAkC,EAAE;CAC1C,IAAI,gBAAgB,SAAS,YAAY,eAAe,KAAA;CAExD,KAAK,MAAM,aAAa,OAAO;EAE7B,MAAM,MADM,aAAa,IAAI,UAAU,QACvB,EAAE,OAAO,EAAE;EAC3B,MAAM,EAAE,SAAS,mBAAmB,aAAa,IAAI;EAErD,IAAI;EACJ,MAAM,aAAa,iBAAiB,IAAI,UAAU,QAAQ;EAC1D,IAAI,YACF,SAAS;OACJ,IAAI,SAAS,aAAa,CAAC,eAChC,SAAS;OACJ,IAAI,eACT,SAAS;OAET,SAAS;EAGX,QAAQ,KAAK;GACX,SAAS,UAAU;GACnB,MAAM,UAAU;GAChB,IAAI,UAAU;GACd,eAAe,UAAU;GACzB,gBAAgB,IAAI;GACpB,kBAAkB;GAClB;GACA;GACD,CAAC;EAEF,IAAI,CAAC,iBAAiB,UAAU,OAAO,YACrC,gBAAgB;;CAIpB,OAAO;;;;;;;;;;;;;;;;AAiBT,SAAS,oBACP,OACA,YACA,YACiC;CACjC,IAAI,eAAe,KAAA,GACjB,OAAO,SAAS,OAAO,qBAAqB,WAAW;CAGzD,MAAM,WAAW,SAAS,OAAO,qBAAqB,WAAW;CAGjE,IAAI,CAAC,UAAU,OAAO,SAAS,OAAO,qBAAqB,WAAW;CAEtE,IAAI,eAAe,YAAY,OAAO;CAEtC,MAAM,aAAa,SAAS,OAAO,YAAY,WAAW;CAC1D,IAAI,YAAY,OAAO,CAAC,GAAG,UAAU,GAAG,WAAW;CAKnD,MAAM,WAAW,SAAS,OAAO,qBAAqB,WAAW;CACjE,IAAI,CAAC,UAAU,OAAO;CAEtB,MAAM,iBAAiB,SAAS,OAAO,YAAY,WAAW;CAC9D,IAAI,gBAAgB,OAAO,CAAC,GAAG,UAAU,GAAG,eAAe;CAG3D,OAAO;;;;;;;;;;;;;AAcT,eAAsB,0BAA0B,MAOE;CAShD,MAAM,SAAS,MAAM,4BAA4B;EAP/C,UAAU,KAAK;EACf,eAAe,KAAK;EACpB,aAAa,KAAK,oBAAoB,KAAK,eAAe;EAC1D,gBAAgB,KAAK;EACrB,qBAAqB,KAAK;EAG+B,CAAC;CAC5D,IAAI,CAAC,OAAO,IAKV,OAAO,EAAE;CAEX,MAAM,YAAY,OAAO;CAEzB,MAAM,iBAAiB,CAAC,GAAG,UAAU,YAAY,UAAU,IAAI;CAC/D,MAAM,OAAoC,EAAE;CAC5C,KAAK,MAAM,UAAU,gBAAgB;EACnC,MAAM,aAAa,KAAK,gBAAgB,IAAI,OAAO,QAAQ,IAAI;EAC/D,MAAM,QAAQ,OAAO,YAAY,UAAU,IAAI;EAE/C,IAAI,OAAO,WAAW,MAAM,MAAM,SAAS,GAAG;GAC5C,KAAK,KAAK;IACR,SAAS,OAAO;IAChB,MAAM,QAAQ,QAAQ;IACtB,UAAU,OAAO,QAAQ;IACzB,GAAI,KAAK,mBAAmB,OACxB;KACE,YAAY,YAAY,eAAe;KACvC,QAAQ,OAAO,QAAQ,SAAS,sBAAsB,eAAe;KACrE,cAAc;KACf,GACD,EAAE;IACP,CAAC;GACF;;EAGF,IAAI,KAAK,mBAAmB,MAAM;GAChC,KAAK,KAAK;IACR,SAAS,OAAO;IAChB,MAAM,QAAQ,QAAQ;IACtB,UAAU,OAAO,QAAQ;IAC1B,CAAC;GACF;;EAGF,MAAM,SAAS,kBAAkB;GAC/B,mBAAmB,UAAU;GAC7B;GACA,eAAe;GAChB,CAAC;EACF,IAAI,eAAe;EACnB,IAAI;EACJ,IAAI,OAAO,SAAS,MAAM;GAIxB,eAAe,OAAO,OAAO,gBAAgB,UAAU;GACvD,IAAI,eAAe,MACjB,SAAS,iBAAiB,IAAI,cAAc;QAE5C,SAAS,iBAAiB,IAAI,eAAe;SAG/C,SAAS;EAGX,KAAK,KAAK;GACR,SAAS,OAAO;GAChB,MAAM,QAAQ,QAAQ;GACtB,UAAU,OAAO,QAAQ;GACzB,YAAY,YAAY,eAAe;GACvC;GACA,GAAI,SAAS,EAAE,QAAQ,GAAG,EAAE;GAC7B,CAAC;;CAEJ,OAAO;;;;;;;;AAST,eAAe,sBAAsB,QAET;CAC1B,IAAI;EACF,MAAM,QAAQ,MAAM,OAAO,mCAAA,MAAA,MAAA,EAAA,EAAA,EAA6B,oBAAoB,OAAO;EACnF,MAAM,MAAM,OAAO,MAAM,OAAO,qBAAqB,SAAS,MAAM,QAAQ;EAC5E,OAAO,KAAK,MAAM,IAAI;SAChB;EACN,OAAO;;;AAIX,eAAe,yBACb,QACA,cAC2C;CAC3C,MAAM,SAAS,OAAO;CACtB,IAAI,CAAC,QACH,OAAO,GAAG,KAAA,EAAU;CAGtB,MAAM,SAAS,oBAAoB;EACjC,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,SAAS,OAAO;EAChB;EACA,gBAAgB,OAAO,kBAAkB,EAAE;EAC5C,CAAC;CACF,IAAI;EACF,MAAM,OAAO,QAAQ,aAAa;EAClC,MAAM,OAAO,YAAY;EACzB,OAAO,GAAG,KAAA,EAAU;UACb,OAAO;EACd,IAAI,mBAAmB,GAAG,MAAM,EAC9B,OAAO,MAAM,MAAM;EAErB,OAAO,MACL,gBAAgB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,MAAM,EAAE,EACtE,KAAK,mCAAmC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,MAAM,IAC/F,CAAC,CACH;WACO;EACR,MAAM,OAAO,OAAO;;;AAIxB,eAAe,8BACb,SACA,OACA,IAC4D;CAC5D,MAAM,SAAS,MAAM,WAAW,QAAQ,OAAO;CAC/C,MAAM,EAAE,YAAY,kBAAkB,uBAAuB,eAAe,YAC1E,sBAAsB,QAAQ,QAAQ,OAAO;CAE/C,MAAM,eAAe,QAAQ,MAAM,OAAO,IAAI;CAC9C,MAAM,YAAY,CAAC,CAAC,OAAO;CAE3B,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,UAAgB,EAAE;CACtB,IAAI;EACF,UAAU,MAAM,SAAS,QAAQ;UAC1B,OAAO;EACd,IAAI,oBAAoB,GAAG,MAAM,EAC/B,OAAO,MAAM,uBAAuB,MAAM,CAAC;EAE7C,MAAM;;CAGR,IAAI;CAEJ,IAAI,QAAQ,MAAM,QAAQ,MACxB,IAAI;EACF,MAAM,EAAE,OAAO,eAAe,MAAM,sBAAsB,iBAAiB;EAE3E,IAAI,QAAQ,IAAI;GACd,MAAM,YAAY,iBAAiB,QAAQ,IAAI;IAAE,OAAO;IAAY,MAAM;IAAS,CAAC;GACpF,IAAI,CAAC,UAAU,IACb,OAAO,MAAM,sBAAsB,UAAU,QAAQ,CAAC;GAExD,gBAAgB,UAAU,MAAM;GAChC,IAAI,UAAU,MAAM,WAAW,SAAS,OAAO;IAC7C,MAAM,kBAAkB,UAAU,MAAM,WAAW;IACnD,gBAAgB;IAChB,iBAAiB,QAAQ;;;EAI7B,IAAI,QAAQ,MAAM;GAChB,MAAM,aAAa,iBAAiB,QAAQ,MAAM;IAAE,OAAO;IAAY,MAAM;IAAS,CAAC;GACvF,IAAI,CAAC,WAAW,IACd,OAAO,MAAM,sBAAsB,WAAW,QAAQ,CAAC;GAEzD,mBAAmB,WAAW,MAAM;;UAE/B,OAAO;EACd,IAAI,oBAAoB,GAAG,MAAM,EAC/B,OAAO,MAAM,uBAAuB,MAAM,CAAC;EAE7C,MAAM;;CAIV,MAAM,qBAAwC,CAAC,GAAI,gBAAgB,cAAc,EAAE,CAAE,CAAC,MAAM;CAE5F,MAAM,aAA0B,OAAO,QAAQ,QAAQ,CAAC,KAAK,CAAC,MAAM,YAAY;EAC9E;EACA,MAAM,MAAM;EACZ,QAAQ,SAAS;EAClB,EAAE;CAEH,IAAI,CAAC,MAAM,QAAQ,CAAC,MAAM,OAAO;EAC/B,MAAM,UAAmD,CACvD;GAAE,OAAO;GAAU,OAAO;GAAY,EACtC;GAAE,OAAO;GAAc,OAAO;GAAuB,CACtD;EACD,IAAI,gBAAgB,WAClB,QAAQ,KAAK;GAAE,OAAO;GAAY,OAAO,kBAAkB,OAAO,aAAa,CAAC;GAAE,CAAC;EAErF,IAAI,eACF,QAAQ,KAAK;GAAE,OAAO;GAAO,OAAO;GAAe,CAAC;EAEtD,IAAI,QAAQ,MACV,QAAQ,KAAK;GAAE,OAAO;GAAQ,OAAO,QAAQ;GAAM,CAAC;EAEtD,IAAI,kBAAkB,eAAe,WAAW,SAAS,GACvD,QAAQ,KAAK;GACX,OAAO;GACP,OAAO,oBAAoB,eAAe,WAAW;GACtD,CAAC;EAEJ,MAAM,SAAS,mBAAmB;GAChC,SAAS;GACT,aAAa;GACb;GACA;GACD,CAAC;EACF,GAAG,OAAO,OAAO;;CAGnB,MAAM,cAAkC,EAAE;CAC1C,IAAI,eAAuB;CAC3B,IAAI;EAEF,gBAAe,MADQ,qBAAqB,OAAO,EAC3B;UACjB,OAAO;EACd,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS,4BAA4B,iBAAiB,QAAQ,MAAM,UAAU;GAC9E,OAAO,CAAC,+DAA+D;GACxE,CAAC;;CAGJ,IAAI;CACJ,IAAI;CACJ,IAAI;EACF,CAAC,CAAE,SAAS,SAAU,MAAM,sBAAsB,iBAAiB;UAC5D,OAAO;EACd,IAAI,oBAAoB,GAAG,MAAM,EAC/B,OAAO,MAAM,uBAAuB,MAAM,CAAC;EAE7C,OAAO,MACL,gBAAgB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,MAAM,EAAE,EACtE,KAAK,wCAAwC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,MAAM,IACpG,CAAC,CACH;;CAGH,IAAI,QAAQ,WAAW,GAAG;EACxB,IAAI,gBAAgB,WAAW;GAC7B,MAAM,cAAc,MAAM,yBAAyB,QAAQ,aAAa;GACxE,IAAI,CAAC,YAAY,IACf,OAAO;;EAGX,IAAI,iBAAiB,qBACnB,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO,CACL,oFACD;GACF,CAAC;EAEJ,OAAO,GAAG;GACR,IAAI;GACJ,MAAM,gBAAgB,YAAY,WAAW;GAC7C,YAAY,EAAE;GACd,YAAY;GACZ;GACA,SAAS;GACT;GACA;GACD,CAAC;;CAGJ,IAAI;CAEJ,IAAI,eACF,aAAa;MACR,IAAI,MAAM,MAAM,IAAI,aAAa,EACtC,aAAa;MACR;EACL,MAAM,SAAS,oBAAoB,OAAO,oBAAoB;EAC9D,IAAI,OAAO,WAAW,GACpB,aAAa,OAAO;OAEpB,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO,CACL,4CACA,uDACD;GACF,CAAC;;CAIN,IAAI;CACJ,IAAI,mBAAsC,EAAE;CAC5C,IAAI,OAA6B;CACjC,IAAI,aAAmE;CAEvE,IAAI,gBAAgB,WAAW;EAC7B,MAAM,SAAS,oBAAoB;GACjC,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf,SAAS,OAAO;GAChB,QAAQ,OAAO;GACf,gBAAgB,OAAO,kBAAkB,EAAE;GAC5C,CAAC;EACF,IAAI;GACF,MAAM,OAAO,QAAQ,aAAa;GAClC,MAAM,SAAS,MAAM,OAAO,YAAY;GACxC,aAAa,QAAQ;GACrB,mBAAmB,QAAQ,cAAc,EAAE;GAC3C,OAAO;GAaP,IAAI,OAAO,OAAO,mBAAmB,YACnC,aAAa,MAAM,OAAO,gBAAgB;QAK1C,aAAa;WAER,OAAO;GACd,IAAI,mBAAmB,GAAG,MAAM,EAC9B,OAAO,MAAM,MAAM;GAErB,IAAI,CAAC,MAAM,QAAQ,CAAC,MAAM,OACxB,GAAG,KAAK,yDAAyD;YAE3D;GACR,MAAM,OAAO,OAAO;;;CAIxB,IAAI,qBAAqB,KAAA,GAAW;EAClC,aAAa;EACb,OAAO;EACP,aAAa;;CAQf,MAAM,0BAA0B,MAAM,sBAAsB,OAAO;CACnE,IAAI,kBAAwD,EAAE;CAC9D,IAAI,4BAA4B,MAAM;EAKpC,MAAM,QAAQ,mBAAmB,OAAO;EACxC,MAAM,iBAAiB,OAAO,OAAO,OAAO,MAAM;EAClD,IAAI;GACF,kBAAkB,MAAM,0BAA0B;IAChD,UAAU,OAAO,OAAO;IACxB;IACA,gBAAgB;IAChB,gBAAgB,OAAO,kBAAkB,EAAE;IAC3C,sBAAsB,SAAkB,eAAe,oBAAoB,KAAK;IAChF,gBAAgB;IACjB,CAAC;UACI;GAGN,kBAAkB,EAAE;;;CAGxB,MAAM,2BAA2B,gCAAgC,gBAAgB;CAQjF,IAAI,kBAAkB,eAAe,WAAW,SAAS,GAAG;EAC1D,MAAM,WAAW,0BAA0B,MAAM;EACjD,MAAM,QAAQ,IAAI,IAAY,SAAS;EACvC,IAAI,SAAS,UACX,KAAK,MAAM,MAAM,kBAAkB,MAAM,IAAI,GAAG;EAElD,MAAM,UAAU,eAAe,WAAW,QAAQ,OAAO,CAAC,MAAM,IAAI,GAAG,CAAC;EACxE,IAAI,QAAQ,SAAS,GACnB,OAAO,MACL,uBACE,sBAAsB;GACpB,GAAG,UAAU,WAAW,cAAc;GACtC;GACA,UAAU,CAAC,GAAG,SAAS,CAAC,MAAM;GAC/B,CAAC,CACH,CACF;;CAYL,IACE,SAAS,YACT,eAAe,KAAA,KACf,CAAC,MAAM,MAAM,IAAI,WAAW,IAC5B,eAAe,cACf;EACA,MAAM,QAAkB,EAAE;EAC1B,IAAI,MAAM,MAAM,IAAI,aAAa,EAC/B,MAAM,KACJ,kGACA,4EACA,6EACA,4DACD;OAED,MAAM,KACJ,4EACA,6EACA,4DACD;EAEH,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SACE;GACF;GACD,CAAC;EACF,OAAO,GAAG;GACR,IAAI;GACJ;GACA,YAAY,EAAE;GACd,YAAY;GACZ;GACA,SAAS,GAAG,QAAQ,OAAO;GAC3B;GACA;GACA;GACA,GAAI,WAAW,SAAS,IAAI,EAAE,MAAM,YAAY,GAAG,EAAE;GACtD,CAAC;;CAGJ,IAAI,SAAS,YAAY,eAAe,KAAA,GACtC,YAAY,KAAK;EACf,MAAM;EACN,UAAU;EACV,SAAS;EACT,OAAO,CAAC,wDAAwD;EACjE,CAAC;CAMJ,IACE,cACA,iBAAiB,uBACjB,CAAC,MAAM,MAAM,IAAI,aAAa,IAC9B,eAAe,cAEf,YAAY,KAAK;EACf,MAAM;EACN,UAAU;EACV,SAAS;EACT,OAAO,CAAC,oFAAoF;EAC7F,CAAC;CAGJ,IAAI,CAAC,YACH,OAAO,GAAG;EACR,IAAI;EACJ;EACA,YAAY,EAAE;EACd,YAAY;EACZ;EACA,SAAS,GAAG,QAAQ,OAAO;EAC3B;EACA,GAAG,UAAU,cAAc,WAAW;EACtC;EACA,GAAI,WAAW,SAAS,IAAI,EAAE,MAAM,YAAY,GAAG,EAAE;EACrD;EACA;EACA,UAAU;EACX,CAAC;CAGJ,MAAM,QAAQ,oBAAoB,OAAO,YAAY,WAAW;CAEhE,IAAI,CAAC,OACH,OAAO,MACL,aAAa,wCAAwC;EACnD,KAAK,gBAAgB,oBAAoB,aAAa;EACtD,KAAK;EACN,CAAC,CACH;CAGH,MAAM,eAAe,mBAAmB,OAAO,YAAY,cAAc,YAAY,KAAK;CAC1F,MAAM,UAAU,sBAAsB,OAAO,SAAS,MAAM,YAAY,aAAa;CAErF,MAAM,eAAe,aAAa,QAAQ,MAAM,EAAE,WAAW,UAAU,CAAC;CACxE,MAAM,eAAe,aAAa,QAAQ,MAAM,EAAE,WAAW,UAAU,CAAC;CAExE,IAAI;CACJ,IAAI;CACJ,IAAI,oCAAoB,IAAI,KAAa;CACzC,IAAI,SAAS,UAAU;EAMrB,MAAM,YAAY,IAAI,IAAI,iBAAiB;EAC3C,oBAAoB,IAAI,IAAI,mBAAmB,QAAQ,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC,CAAC;EAClF,oBAAoB,mBAAmB,QAAQ,OAAO,UAAU,IAAI,GAAG,CAAC;EACxE,oBAAoB,CAAC,GAAG,kBAAkB,CAAC,MAAM;;CAOnD,MAAM,mBAAmB,kBAAkB,OAAO;CAClD,MAAM,cAAc,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,KAAK,KAAK;CAE5D,IAAI;CACJ,IAAI,SAAS,UACX,IAAI,eAAe,KAAA,KAAa,CAAC,MAAM,MAAM,IAAI,WAAW,IAAI,eAAe,cAC7E,UAAU,GAAG,QAAQ,OAAO;MACvB,IAAI,iBAAiB,iBAAiB,eAAe,KAAA,GAAW;EACrE,MAAM,WAAW,qBAAqB,OAAO,YAAY,eAAe,cAAc;EACtF,UAAU,mBAAmB,GAAG,SAAS,2BAA2B,gBAAgB;QAC/E,IAAI,iBAAiB,KAAK,CAAC,kBAChC,UAAU,2BAA2B,aAAa,YAAY,iBAAiB,IAAI,MAAM,GAAG;MACvF,IAAI,iBAAiB,KAAK,kBAC/B,UAAU,yBAAyB,YAAY,mCAAmC,iBAAiB,QAAQ;MACtG,IAAI,eAAe,KAAA,GACxB,UAAU,GAAG,aAAa;MAE1B,UAAU,GAAG,aAAa;MAG5B,UAAU,GAAG,QAAQ,OAAO;CAG9B,IAAI;CACJ,IAAI,qBAAqB;CACzB,IAAI,SAAS,UAAU;EAErB,MAAM,UAAU,qBAAqB,OADlB,cAAc,qBACuB,YAAY;GAClE,GAAG,UAAU,WAAW,cAAc;GACtC,UAAU;GACX,CAAC;EACF,IAAI,QAAQ,SAAS,MACnB,eAAe,qBAAqB,QAAQ,SAAS;OAChD,IAAI,QAAQ,SAAS,iBAC1B,OAAO,MACL,uBACE,qBAAqB;GACnB,GAAG,UAAU,WAAW,cAAc;GACtC,UAAU,CAAC,GAAG,kBAAkB,CAAC,MAAM;GACvC,SAAS,QAAQ;GACjB,gBAAgB,QAAQ,eAAe,IAAI,iBAAiB;GAC7D,CAAC,CACH,CACF;OAOD,qBAAqB;;CAIzB,IAAI,SAAS;MACP,eAAe,KAAA,KAAa,CAAC,MAAM,MAAM,IAAI,WAAW,IAAI,eAAe,cAC7E,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO,CAAC,gFAAgF;GACzF,CAAC;OACG,IAAI,eAAe,GACxB,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS,GAAG,aAAa;GACzB,OAAO,CAAC,wDAAwD;GACjE,CAAC;OACG,IAAI,kBACT,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS,kCAAkC;GAC3C,OAAO,CACL,iCAAiC,iBAAiB,QAAQ,uDAC3D;GACF,CAAC;OACG,IAAI,CAAC,oBACV,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO,EAAE;GACV,CAAC;;CA0BN,OAAO,GAAG;EArBR,IAAI;EACJ;EACA,YAAY;EACZ;EACA;EACA;EACA;EACA,GAAG,UAAU,cAAc,WAAW;EACtC;EACA,GAAG,UAAU,qBAAqB,kBAAkB;EACpD,GAAG,UAAU,qBAAqB,kBAAkB;EACpD,GAAI,WAAW,SAAS,IAAI,EAAE,MAAM,YAAY,GAAG,EAAE;EACrD,GAAG,UAAU,gBAAgB,aAAa;EAC1C;EACA;EACA;EACA,GAAG,UAAU,iBAAiB,cAAc;EAC5C,GAAG,UAAU,iBAAiB,cAAc;EAC5C,QAAQ;EACR,GAAG,UAAU,4BAA4B,yBAAyB;EAEpD,CAAC;;AAGnB,SAAgB,+BAAwC;CACtD,MAAM,UAAU,IAAI,QAAQ,SAAS;CACrC,uBACE,SACA,0CACA,4PAID;CACD,mBAAmB,SAAS,CAC1B,mDACA,kEACD,CAAC;CACF,kBAAkB,SAAS;EACzB;GAAE,MAAM;GAAiB,UAAU;GAAmC;EACtE;GAAE,MAAM;GAAkB,UAAU;GAA2B;EAC/D;GAAE,MAAM;GAAmB,UAAU;GAAqC;EAC1E;GAAE,MAAM;GAAkB,UAAU;GAAsC;EAC3E,CAAC;CACF,iBAAiB,QAAQ,CACtB,OAAO,cAAc,6BAA6B,CAClD,OAAO,mBAAmB,gCAAgC,CAC1D,OACC,mBACA,4FACD,CACA,OACC,qBACA,0GACD,CACA,OAAO,OAAO,YAAoC;EACjD,MAAM,QAAQ,uBAAuB,QAAQ;EAC7C,MAAM,KAAK,iBAAiB,MAAM;EAIlC,MAAM,WAAW,aAAa,MAFT,8BAA8B,SAAS,OAAO,GAAG,EAEhC,OAAO,KAAK,iBAAiB;GACjE,IAAI,MAAM,MAAM;IACd,MAAM,EACJ,OAAO,QACP,SAAS,UACT,cAAc,eACd,eAAe,gBACf,eAAe,gBACf,UAAU,WACV,GAAG,eACD;IACJ,GAAG,OAAO,KAAK,UAAU,YAAY,MAAM,EAAE,CAAC;UACzC,IAAI,CAAC,MAAM,OAAO;IACvB,MAAM,WAAW,MAAM,UAAU;IAEjC,IAAI,aAAa,OAAO;KACtB,MAAM,cAAc,4BAA4B;MAC9C,OAAO,aAAa;MACpB,MAAM,aAAa;MACnB,YAAY,aAAa;MACzB,cAAc,aAAa;MAC3B,MAAM,aAAa;MACnB,eAAe,aAAa;MAC5B,eAAe,aAAa;MAC5B,cAAc,aAAa;MAC5B,CAAC;KAEF,MAAM,gBAAgB,aAAa,WAC/B,YAAY,QACZ,wBAAwB,YAAY,OAAO,YAAY,cAAc;KACzE,MAAM,eAAe,cAAc,cAAc,GAAG,EAAE,SAAS,GAAG,GAAG,KAAA;KACrE,MAAM,gBAAgB;MACpB,GAAG,YAAY;MACf;MACA,GAAG,UAAU,gBAAgB,aAAa;MAC3C;KACD,MAAM,cAAc,cAAc,OAAO,eAAe,cAAc;KACtE,GAAG,IAAI,YAAY;KACnB,IAAI,aAAa,SAAS,UACxB,GAAG,IAAI,aAAa,SAAS,CAAC;;IAGlC,GAAG,IAAI,GAAG;IACV,GAAG,IAAI,oBAAoB,cAAc,SAAS,CAAC;;IAErD;EAEF,QAAQ,KAAK,SAAS;GACtB;CAEJ,OAAO;;AAGT,SAAS,aAAa,UAA2B;CAC/C,MAAM,KAAK,IAA2B,MAAe,WAAW,GAAG,EAAE,GAAG;CAMxE,OAAO,EAAE,KAAK;EAJZ,GAAG,EAAE,MAAM,IAAI,CAAC;EAChB,GAAG,EAAE,QAAQ,IAAI,CAAC;EAClB,GAAG,EAAE,SAAS,IAAI,CAAC;EAEF,CAAC,KAAK,KAAK,CAAC;;AAGjC,SAAgB,oBAAoB,QAA+B,UAA2B;CAC5F,MAAM,KAAK,IAA2B,MAAe,WAAW,GAAG,EAAE,GAAG;CACxE,MAAM,QAAkB,EAAE;CAE1B,MAAM,aAAa,OAAO,WAAW,MAAM,MAAM,EAAE,WAAW,UAAU;CACxE,MAAM,eAAe,OAAO,WAAW,QAAQ,MAAM,EAAE,WAAW,UAAU,CAAC;CAE7E,MAAM,cAAc,OAAO,aAAa,MAAM,MAAM,EAAE,aAAa,OAAO,IAAI;CAI9E,MAAM,sBACJ,OAAO,aAAa,MAAM,MAAM,EAAE,SAAS,+BAA+B,IAAI;CAEhF,IAAI,OAAO,SAAS,UAClB,IAAI,cAAc,aAChB,MAAM,KAAK,GAAG,EAAE,QAAQ,IAAI,CAAC,GAAG,OAAO,UAAU;MAC5C,IAAI,iBAAiB,KAAK,CAAC,qBAChC,MAAM,KAAK,GAAG,EAAE,MAAM,IAAI,CAAC,GAAG,OAAO,UAAU;MAE/C,MAAM,KAAK,GAAG,EAAE,QAAQ,IAAI,CAAC,GAAG,OAAO,UAAU;MAGnD,MAAM,KAAK,OAAO,QAAQ;CAG5B,IAAI,OAAO,mBAAmB,SAAS,GACrC,IAAI,OAAO,sBAAsB,KAAA,KAAa,OAAO,sBAAsB,KAAA,GAAW;EACpF,MAAM,KAAK,GAAG,EAAE,KAAK,YAAY,GAAG,oBAAoB,OAAO,kBAAkB,GAAG;EACpF,MAAM,KAAK,GAAG,EAAE,KAAK,YAAY,GAAG,oBAAoB,OAAO,kBAAkB,GAAG;QAEpF,MAAM,KAAK,GAAG,EAAE,KAAK,YAAY,CAAC,4CAA4C;CAIlF,MAAM,WAAW,OAAO,aAAa,QAAQ,MAAM,EAAE,aAAa,OAAO,IAAI,EAAE;CAC/E,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,KAAK,GAAG,EAAE,QAAQ,IAAI,CAAC,GAAG,KAAK,UAAU;EAC/C,KAAK,MAAM,QAAQ,KAAK,OACtB,MAAM,KAAK,KAAK,EAAE,KAAK,KAAK,GAAG;;CAQnC,IAAI,OAAO,QAAQ,MAAM,MAAM,EAAE,SAAS,YAAY,EAAE;EACtD,MAAM,QAAQ,OAAO,4BAA4B;EACjD,MAAM,KAAK,GAAG;EACd,MAAM,KAAK,EAAE,KAAK,SAAS,CAAC;EAC5B,KAAK,MAAM,SAAS,OAAO,QACzB,MAAM,KAAK,gBAAgB,OAAO,EAAE,CAAC;EAEvC,IAAI,QAAQ,GAAG;GACb,MAAM,KAAK,GAAG;GACd,MAAM,KACJ,GAAG,EAAE,QAAQ,IAAI,CAAC,GAAG,MAAM,+BAA+B,OAAO,OAAO,OAAO,gDAChF;;;CAIL,OAAO,MAAM,KAAK,KAAK;;AAGzB,SAAS,gBACP,OACA,GACQ;CACR,MAAM,eAAe;EACnB,IAAI,MAAM,WAAW,gBAAgB,MAAM,WAAW,aAAa,OAAO,EAAE,MAAM,IAAI;EACtF,IAAI,MAAM,WAAW,WAAW,OAAO,EAAE,QAAQ,IAAI;EACrD,IAAI,MAAM,WAAW,iBAAiB,MAAM,WAAW,iBAAiB,OAAO,EAAE,SAAS,IAAI;EAC9F,OAAO;KACL;CACJ,MAAM,MAAM,MAAM,SAAS,QAAQ,UAAU;CAC7C,MAAM,OAAO,MAAM,SAAS,MAAM,GAAG,EAAE;CACvC,MAAM,SACJ,MAAM,eAAe,KAAA,IACjB,cACA,MAAM,eAAe,OACnB,gBACA,MAAM,WAAW,MAAM,GAAG,EAAE;CACpC,MAAM,UACJ,MAAM,iBAAiB,KAAA,IACnB,KACA,MAAM,iBAAiB,IACrB,EAAE,KAAK,gBAAgB,GACvB,EAAE,QAAQ,KAAK,MAAM,aAAa,WAAW;CACrD,OAAO,KAAK,MAAM,GAAG,EAAE,KAAK,IAAI,CAAC,GAAG,MAAM,QAAQ,UAAU,EAAE,KAAK,KAAK,CAAC,WAAW,EAAE,KAAK,OAAO,GAAG;;AAGvG,SAAS,oBAAoB,KAAgC;CAC3D,OAAO,IAAI,WAAW,IAAI,WAAW,IAAI,KAAK,KAAK;;AAGrD,SAAS,qBACP,OACA,YACA,SACA,SACQ;CACR,IAAI,eAAe,SAAS,OAAO,WAAW,QAAQ;CAEtD,MAAM,YAAY,SAAS,OAAO,YAAY,QAAQ;CACtD,IAAI,WAAW,OAAO,GAAG,UAAU,OAAO,4BAA4B,QAAQ;CAE9E,MAAM,cAAc,SAAS,OAAO,SAAS,WAAW;CACxD,IAAI,aAAa,OAAO,GAAG,YAAY,OAAO,8BAA8B,QAAQ;CAEpF,OAAO,4CAA4C,QAAQ"}
+{"version":3,"file":"migration-status.mjs","names":[],"sources":["../../src/commands/migration-status.ts"],"sourcesContent":["import type { Contract } from '@prisma-next/contract/types';\nimport {\n  createControlStack,\n  type MigrationPlanOperation,\n} from '@prisma-next/framework-components/control';\nimport {\n  type ContractMarkerRecordLike,\n  type ContractSpaceAggregate,\n  graphWalkStrategy,\n  loadContractSpaceAggregate,\n  requireHeadRef,\n} from '@prisma-next/migration-tools/aggregate';\nimport { EMPTY_CONTRACT_HASH } from '@prisma-next/migration-tools/constants';\nimport {\n  errorNoInvariantPath,\n  errorUnknownInvariant,\n  MigrationToolsError,\n} from '@prisma-next/migration-tools/errors';\nimport type { MigrationEdge, MigrationGraph } from '@prisma-next/migration-tools/graph';\nimport {\n  findPath,\n  findPathWithDecision,\n  findReachableLeaves,\n} from '@prisma-next/migration-tools/migration-graph';\nimport type { OnDiskMigrationPackage } from '@prisma-next/migration-tools/package';\nimport { parseContractRef } from '@prisma-next/migration-tools/ref-resolution';\nimport type { RefEntry, Refs } from '@prisma-next/migration-tools/refs';\nimport { readRefs } from '@prisma-next/migration-tools/refs';\nimport { ifDefined } from '@prisma-next/utils/defined';\nimport { notOk, ok, type Result } from '@prisma-next/utils/result';\nimport { cyan, dim, magenta, yellow } from 'colorette';\nimport { Command } from 'commander';\n\nimport { loadConfig } from '../config-loader';\nimport { createControlClient } from '../control-api/client';\nimport {\n  CliStructuredError,\n  errorRuntime,\n  errorUnexpected,\n  mapMigrationToolsError,\n  mapRefResolutionError,\n} from '../utils/cli-errors';\nimport {\n  addGlobalOptions,\n  collectDeclaredInvariants,\n  maskConnectionUrl,\n  readContractEnvelope,\n  resolveMigrationPaths,\n  setCommandDescriptions,\n  setCommandExamples,\n  setCommandSeeAlso,\n  toPathDecisionResult,\n  toStructuralEdge,\n} from '../utils/command-helpers';\nimport {\n  appContractStandInFromIdentity,\n  loadContractRawSafely,\n  refuseContractSpaceIntegrity,\n  refusePackageCorruptionOnAggregate,\n} from '../utils/contract-space-aggregate-loader';\nimport { toDeclaredExtensionsFromRaw } from '../utils/extension-pack-inputs';\nimport {\n  type EdgeStatus,\n  type EdgeStatusKind,\n  migrationGraphToRenderInput,\n} from '../utils/formatters/graph-migration-mapper';\nimport {\n  extractRelevantSubgraph,\n  graphRenderer,\n  isLinearGraph,\n} from '../utils/formatters/graph-render';\nimport { formatStyledHeader } from '../utils/formatters/styled';\nimport type { CommonCommandOptions } from '../utils/global-flags';\nimport { type GlobalFlags, parseGlobalFlagsOrExit } from '../utils/global-flags';\nimport type { StatusDiagnostic, StatusRef } from '../utils/migration-types';\nimport { handleResult } from '../utils/result-handler';\nimport { createTerminalUI, type TerminalUI } from '../utils/terminal-ui';\n\ninterface MigrationStatusOptions extends CommonCommandOptions {\n  readonly db?: string;\n  readonly config?: string;\n  readonly to?: string;\n  readonly from?: string;\n}\n\nexport interface MigrationStatusEntry {\n  readonly dirName: string;\n  readonly from: string;\n  readonly to: string;\n  readonly migrationHash: string;\n  readonly operationCount: number;\n  readonly operationSummary: string;\n  readonly hasDestructive: boolean;\n  readonly status: EdgeStatusKind | 'unknown';\n}\n\n/**\n * Per-space status row in the aggregate-shaped status output.\n *\n * Surfaces, for each contract space:\n *\n * - `headHash`: the on-disk head ref's hash (where the space is going).\n * - `markerHash`: the live marker hash for the space, or null if no\n *    marker has been written yet (greenfield, or pre-`migrate`).\n * - `pendingCount`: number of migration edges between marker and head.\n *    Computed via {@link graphWalkStrategy}; 0 means the space is\n *    already at head.\n * - `status`: convenience tag the formatter uses to pick a glyph.\n *    `'never-planned'` is reserved for spaces with non-empty head but\n *    no on-disk migrations — which shouldn't happen if the loader's\n *    integrity check passes.\n *\n * Online-only fields (`markerHash`, `status`) are absent when the\n * command runs without a database connection.\n */\nexport interface MigrationStatusSpaceEntry {\n  readonly spaceId: string;\n  readonly kind: 'app' | 'extension';\n  readonly headHash: string;\n  readonly markerHash?: string | null;\n  readonly pendingCount?: number;\n  readonly status?: 'up-to-date' | 'pending' | 'no-marker' | 'never-planned' | 'unreachable';\n}\n\n/**\n * Sum per-space `pendingCount` into a cross-space total, but only when\n * every loaded space reports a defined `pendingCount`. Returns\n * `undefined` if any space is on the marker-unknown / offline path\n * (where `pendingCount` is intentionally absent), so JSON consumers can\n * distinguish \"no pending\" from \"unknown\".\n */\nexport function computeTotalPendingAcrossSpaces(\n  spaces: readonly MigrationStatusSpaceEntry[],\n): number | undefined {\n  if (spaces.length === 0) return undefined;\n  let total = 0;\n  for (const s of spaces) {\n    if (s.pendingCount === undefined) return undefined;\n    total += s.pendingCount;\n  }\n  return total;\n}\n\nexport type { StatusDiagnostic, StatusRef } from '../utils/migration-types';\n\nexport interface MigrationStatusResult {\n  readonly ok: true;\n  readonly mode: 'online' | 'offline';\n  readonly migrations: readonly MigrationStatusEntry[];\n  readonly markerHash?: string;\n  readonly targetHash: string;\n  readonly contractHash: string;\n  readonly refs?: readonly StatusRef[];\n  /** Required invariants from the active ref, sorted ascending. Always present (`[]` when no `--ref` or the ref declares none) — knowable offline. */\n  readonly requiredInvariants: readonly string[];\n  /**\n   * Invariants the marker has applied at least once, intersected with\n   * `requiredInvariants` for display relevance. JSON consumers see only the\n   * subset overlapping the active ref's required set — the full unfiltered\n   * marker invariant list lives on `marker.invariants` (control plane) and\n   * is not surfaced here. Present only in `mode === 'online'`; absent when\n   * offline (the marker is unknown, not empty).\n   */\n  readonly appliedInvariants?: readonly string[];\n  /** required − applied. Present only in `mode === 'online'`; absent when offline. */\n  readonly missingInvariants?: readonly string[];\n  readonly pathDecision?: {\n    readonly fromHash: string;\n    readonly toHash: string;\n    readonly alternativeCount: number;\n    readonly tieBreakReasons: readonly string[];\n    readonly refName?: string;\n    readonly requiredInvariants: readonly string[];\n    readonly satisfiedInvariants: readonly string[];\n    readonly selectedPath: readonly {\n      readonly dirName: string;\n      readonly migrationHash: string;\n      readonly from: string;\n      readonly to: string;\n      readonly invariants: readonly string[];\n    }[];\n  };\n  readonly summary: string;\n  readonly diagnostics: readonly StatusDiagnostic[];\n  /**\n   * Aggregate enumeration of every on-disk contract space (app +\n   * extensions), in canonical schedule order (extensions\n   * alphabetically, then app). Present whenever the aggregate loader\n   * succeeded; absent in early-error returns (e.g. unreadable\n   * migrations directory) where the existing diagnostics already\n   * surface the failure.\n   *\n   * The top-level fields (`migrations`, `markerHash`, `targetHash`,\n   * `pathDecision`, …) describe the **app member** specifically.\n   * Per-space detail for extension members lives only on this list.\n   */\n  readonly spaces?: readonly MigrationStatusSpaceEntry[];\n  /** Cross-space pending-migration total (sum of `spaces[].pendingCount`). Present when `spaces` is. */\n  readonly totalPendingAcrossSpaces?: number;\n  readonly graph?: MigrationGraph;\n  readonly bundles?: readonly OnDiskMigrationPackage[];\n  readonly edgeStatuses?: readonly EdgeStatus[];\n  readonly activeRefHash?: string;\n  readonly activeRefName?: string;\n  readonly diverged?: boolean;\n}\n\nfunction summarizeOps(ops: readonly MigrationPlanOperation[]): {\n  summary: string;\n  hasDestructive: boolean;\n} {\n  if (ops.length === 0) return { summary: '0 ops', hasDestructive: false };\n\n  const classes = new Map<string, number>();\n  for (const op of ops) {\n    classes.set(op.operationClass, (classes.get(op.operationClass) ?? 0) + 1);\n  }\n\n  const hasDestructive = classes.has('destructive');\n  const count = ops.length;\n  const noun = count === 1 ? 'op' : 'ops';\n\n  if (classes.size === 1) {\n    const cls = [...classes.keys()][0]!;\n    return { summary: `${count} ${noun} (all ${cls})`, hasDestructive };\n  }\n\n  const destructiveCount = classes.get('destructive');\n  if (destructiveCount) {\n    return { summary: `${count} ${noun} (${destructiveCount} destructive)`, hasDestructive };\n  }\n\n  const parts = [...classes.entries()].map(([cls, n]) => `${n} ${cls}`);\n  return { summary: `${count} ${noun} (${parts.join(', ')})`, hasDestructive };\n}\n\n/**\n * Derive per-edge status across the full graph using path analysis.\n *\n * - **applied**: edge is on the path from root to the DB marker\n * - **pending**: edge is on the path from the DB marker to the target\n *   (and the marker is reachable from root, i.e. it's on the same branch)\n * - **unreachable**: edge is on the path from root to the target but the DB\n *   marker is on a different branch — `apply` can't reach these edges\n *   without the DB first moving to this branch\n *\n * Returns statuses only for edges that have a known status (skips offline\n * and edges not on any relevant path).\n *\n * @internal Exported for testing only.\n */\nexport function deriveEdgeStatuses(\n  graph: MigrationGraph,\n  targetHash: string,\n  contractHash: string,\n  markerHash: string | undefined,\n  mode: 'online' | 'offline',\n): EdgeStatus[] {\n  if (mode === 'offline') return [];\n\n  const edgeKey = (e: MigrationEdge) => `${e.from}\\0${e.to}`;\n\n  // No marker = empty DB — treat root as the marker (nothing applied, everything pending)\n  const effectiveMarker = markerHash ?? EMPTY_CONTRACT_HASH;\n\n  const appliedPath =\n    markerHash !== undefined ? findPath(graph, EMPTY_CONTRACT_HASH, markerHash) : null;\n\n  const pendingPath = findPath(graph, effectiveMarker, targetHash);\n  const targetPath = findPath(graph, EMPTY_CONTRACT_HASH, targetHash);\n\n  const statuses: EdgeStatus[] = [];\n  const assignedKeys = new Set<string>();\n\n  // Applied edges (root → marker)\n  if (appliedPath) {\n    for (const e of appliedPath) {\n      assignedKeys.add(edgeKey(e));\n      statuses.push({ dirName: e.dirName, status: 'applied' });\n    }\n  }\n\n  // Pending edges (marker → target)\n  if (pendingPath) {\n    for (const e of pendingPath) {\n      assignedKeys.add(edgeKey(e));\n      statuses.push({ dirName: e.dirName, status: 'pending' });\n    }\n  }\n\n  // Pending edges beyond the target: target → contract (when target is a ref\n  // and the contract is reachable from it)\n  if (\n    contractHash !== EMPTY_CONTRACT_HASH &&\n    contractHash !== targetHash &&\n    graph.nodes.has(contractHash)\n  ) {\n    const beyondTarget = findPath(graph, targetHash, contractHash);\n    if (beyondTarget) {\n      for (const e of beyondTarget) {\n        if (!assignedKeys.has(edgeKey(e))) {\n          assignedKeys.add(edgeKey(e));\n          statuses.push({ dirName: e.dirName, status: 'pending' });\n        }\n      }\n    }\n  }\n\n  // Unreachable edges: on the path from root to the target but neither applied\n  // nor pending. This covers two cases:\n  //  1. Marker can't reach target at all (different branch entirely)\n  //  2. Marker reaches target via a different route, leaving some root→target\n  //     edges orphaned (e.g. a fork where one branch was applied and apply\n  //     will continue through the other)\n  if (targetPath) {\n    for (const e of targetPath) {\n      if (!assignedKeys.has(edgeKey(e))) {\n        statuses.push({ dirName: e.dirName, status: 'unreachable' });\n      }\n    }\n  }\n\n  return statuses;\n}\n\n/**\n * @param mode    — 'online' if we connected to the database, 'offline' otherwise\n * @param markerHash — the marker hash from the database, or undefined if no marker row / offline\n */\nfunction buildMigrationEntries(\n  chain: readonly MigrationEdge[],\n  packages: readonly OnDiskMigrationPackage[],\n  mode: 'online' | 'offline',\n  markerHash: string | undefined,\n  edgeStatuses?: readonly EdgeStatus[],\n): MigrationStatusEntry[] {\n  const pkgByDirName = new Map(packages.map((p) => [p.dirName, p]));\n  const statusByDirName = edgeStatuses\n    ? new Map(edgeStatuses.map((e) => [e.dirName, e.status]))\n    : undefined;\n\n  const markerInChain = markerHash === undefined || chain.some((e) => e.to === markerHash);\n\n  const entries: MigrationStatusEntry[] = [];\n  let reachedMarker = mode === 'online' && markerHash === undefined;\n\n  for (const migration of chain) {\n    const pkg = pkgByDirName.get(migration.dirName);\n    const ops = (pkg?.ops ?? []) as readonly MigrationPlanOperation[];\n    const { summary, hasDestructive } = summarizeOps(ops);\n\n    let status: EdgeStatusKind | 'unknown';\n    const edgeStatus = statusByDirName?.get(migration.dirName);\n    if (edgeStatus) {\n      status = edgeStatus;\n    } else if (mode === 'offline' || !markerInChain) {\n      status = 'unknown';\n    } else if (reachedMarker) {\n      status = 'pending';\n    } else {\n      status = 'applied';\n    }\n\n    entries.push({\n      dirName: migration.dirName,\n      from: migration.from,\n      to: migration.to,\n      migrationHash: migration.migrationHash,\n      operationCount: ops.length,\n      operationSummary: summary,\n      hasDestructive,\n      status,\n    });\n\n    if (!reachedMarker && migration.to === markerHash) {\n      reachedMarker = true;\n    }\n  }\n\n  return entries;\n}\n\n/**\n * Resolve the migration chain to display in status output.\n *\n * When offline or the marker is at EMPTY, the chain is simply the shortest\n * path from EMPTY to the target — all structural paths are equivalent per\n * the spec, so the deterministic shortest path is the canonical display.\n *\n * When online with a non-empty marker, the chain routes *through* the marker:\n * EMPTY→marker (applied history) + marker→target (pending edges). This ensures\n * the displayed chain includes the marker node so applied/pending status is\n * correct. Without this, BFS from EMPTY to target could pick a shortest path\n * that bypasses the marker entirely (e.g. in a diamond graph), causing the\n * marker to appear \"diverged\" when it isn't.\n */\nfunction resolveDisplayChain(\n  graph: MigrationGraph,\n  targetHash: string,\n  markerHash: string | undefined,\n): readonly MigrationEdge[] | null {\n  if (markerHash === undefined) {\n    return findPath(graph, EMPTY_CONTRACT_HASH, targetHash);\n  }\n\n  const toMarker = findPath(graph, EMPTY_CONTRACT_HASH, markerHash);\n  // Marker unreachable from EMPTY — show the target chain anyway.\n  // The caller detects this via markerInChain and emits a divergence diagnostic.\n  if (!toMarker) return findPath(graph, EMPTY_CONTRACT_HASH, targetHash);\n\n  if (markerHash === targetHash) return toMarker;\n\n  const fromMarker = findPath(graph, markerHash, targetHash);\n  if (fromMarker) return [...toMarker, ...fromMarker];\n\n  // Marker is ahead of target (or on a disconnected branch).\n  // Try the inverse: target→marker. If it succeeds, the marker is ahead —\n  // show the full chain from EMPTY through the target and on to the marker.\n  const toTarget = findPath(graph, EMPTY_CONTRACT_HASH, targetHash);\n  if (!toTarget) return null;\n\n  const targetToMarker = findPath(graph, targetHash, markerHash);\n  if (targetToMarker) return [...toTarget, ...targetToMarker];\n\n  // Genuinely disconnected — show EMPTY→target; caller handles divergence diagnostic.\n  return toTarget;\n}\n\n/**\n * Build the aggregate enumeration of contract spaces for the status\n * output. Loads the aggregate from disk (lossy on failure — extension\n * spaces are simply omitted, the app member's output keeps working),\n * reads per-space marker rows when online, and uses\n * {@link graphWalkStrategy} to compute each space's pending count.\n *\n * The aggregate-walking status reports per-space marker + pending\n * state alongside the cross-space totals.\n */\nexport async function loadAggregateStatusSpaces(args: {\n  readonly aggregate: ContractSpaceAggregate;\n  readonly extensionPacks: ReadonlyArray<unknown>;\n  readonly markersBySpace: ReadonlyMap<string, ContractMarkerRecordLike> | null;\n}): Promise<readonly MigrationStatusSpaceEntry[]> {\n  const declaredExtensions = toDeclaredExtensionsFromRaw(args.extensionPacks);\n  if (\n    refuseContractSpaceIntegrity(args.aggregate, {\n      declaredExtensions,\n      checkContracts: true,\n    })\n  ) {\n    // Full integrity refusal (drift, layout violation, etc.) — surfacing\n    // it as a status diagnostic would duplicate `migration plan`'s job.\n    // The app pipeline still runs; extensions are simply not enumerated.\n    return [];\n  }\n  const aggregate = args.aggregate;\n\n  const orderedMembers = [...aggregate.extensions, aggregate.app];\n  const rows: MigrationStatusSpaceEntry[] = [];\n  for (const member of orderedMembers) {\n    const liveMarker = args.markersBySpace?.get(member.spaceId) ?? null;\n    const isApp = member.spaceId === aggregate.app.spaceId;\n    // The aggregate passed the integrity gate above, so every member has\n    // a resolved head ref (a missing one would have refused the load).\n    const headRef = requireHeadRef(member);\n\n    if (member.graph().nodes.size === 0) {\n      rows.push({\n        spaceId: member.spaceId,\n        kind: isApp ? 'app' : 'extension',\n        headHash: headRef.hash,\n        ...(args.markersBySpace !== null\n          ? {\n              markerHash: liveMarker?.storageHash ?? null,\n              status: headRef.hash === EMPTY_CONTRACT_HASH ? 'up-to-date' : 'never-planned',\n              pendingCount: 0,\n            }\n          : {}),\n      });\n      continue;\n    }\n\n    if (args.markersBySpace === null) {\n      rows.push({\n        spaceId: member.spaceId,\n        kind: isApp ? 'app' : 'extension',\n        headHash: headRef.hash,\n      });\n      continue;\n    }\n\n    const walked = graphWalkStrategy({\n      aggregateTargetId: aggregate.targetId,\n      member,\n      currentMarker: liveMarker,\n    });\n    let pendingCount = 0;\n    let status: MigrationStatusSpaceEntry['status'];\n    if (walked.kind === 'ok') {\n      // Count pending *migrations* (graph edges), not operations: a\n      // single authored migration that lowers to N ops or zero ops\n      // both count as exactly one pending unit of work for the user.\n      pendingCount = walked.result.migrationEdges?.length ?? 0;\n      if (liveMarker === null) {\n        status = pendingCount === 0 ? 'no-marker' : 'pending';\n      } else {\n        status = pendingCount === 0 ? 'up-to-date' : 'pending';\n      }\n    } else {\n      status = 'unreachable';\n    }\n\n    rows.push({\n      spaceId: member.spaceId,\n      kind: isApp ? 'app' : 'extension',\n      headHash: headRef.hash,\n      markerHash: liveMarker?.storageHash ?? null,\n      pendingCount,\n      ...(status ? { status } : {}),\n    });\n  }\n  return rows;\n}\n\n/**\n * Read the raw contract.json bytes from disk for the aggregate\n * loader. Returns `null` if the file is missing or unparseable —\n * the existing `readContractEnvelope` path will report the same\n * problem via a status diagnostic, no need to double-surface.\n */\n\nasync function validateOnlineMarkerRead(\n  config: Awaited<ReturnType<typeof loadConfig>>,\n  dbConnection: unknown,\n): Promise<Result<void, CliStructuredError>> {\n  const driver = config.driver;\n  if (!driver) {\n    return ok(undefined);\n  }\n\n  const client = createControlClient({\n    family: config.family,\n    target: config.target,\n    adapter: config.adapter,\n    driver,\n    extensionPacks: config.extensionPacks ?? [],\n  });\n  try {\n    await client.connect(dbConnection);\n    await client.readMarker();\n    return ok(undefined);\n  } catch (error) {\n    if (CliStructuredError.is(error)) {\n      return notOk(error);\n    }\n    return notOk(\n      errorUnexpected(error instanceof Error ? error.message : String(error), {\n        why: `Failed to read database marker: ${error instanceof Error ? error.message : String(error)}`,\n      }),\n    );\n  } finally {\n    await client.close();\n  }\n}\n\nasync function executeMigrationStatusCommand(\n  options: MigrationStatusOptions,\n  flags: GlobalFlags,\n  ui: TerminalUI,\n): Promise<Result<MigrationStatusResult, CliStructuredError>> {\n  const config = await loadConfig(options.config);\n  const { configPath, appMigrationsRelative, migrationsDir, refsDir } = resolveMigrationPaths(\n    options.config,\n    config,\n  );\n\n  const dbConnection = options.db ?? config.db?.connection;\n  const hasDriver = !!config.driver;\n\n  let activeRefName: string | undefined;\n  let activeRefHash: string | undefined;\n  let activeRefEntry: RefEntry | undefined;\n  let allRefs: Refs = {};\n  try {\n    allRefs = await readRefs(refsDir);\n  } catch (error) {\n    if (MigrationToolsError.is(error)) {\n      return notOk(mapMigrationToolsError(error));\n    }\n    throw error;\n  }\n\n  const diagnostics: StatusDiagnostic[] = [];\n  let contractHash: string = EMPTY_CONTRACT_HASH;\n  try {\n    const envelope = await readContractEnvelope(config);\n    contractHash = envelope.storageHash;\n  } catch (error) {\n    diagnostics.push({\n      code: 'CONTRACT.UNREADABLE',\n      severity: 'warn',\n      message: `Could not read contract: ${error instanceof Error ? error.message : 'unknown error'}`,\n      hints: [\"Run 'prisma-next contract emit' to generate a valid contract\"],\n    });\n  }\n\n  const contractRawForAggregate = await loadContractRawSafely(config);\n  const stack = createControlStack(config);\n  const familyInstance = config.family.create(stack);\n  const deserializeContract = (json: unknown): Contract => familyInstance.deserializeContract(json);\n  const appContractStandIn = appContractStandInFromIdentity({\n    contractHash,\n    targetId: config.target.id,\n    targetFamily: config.target.familyId,\n  });\n  let appContractForLoad: Contract = appContractStandIn;\n  if (contractRawForAggregate !== null) {\n    try {\n      appContractForLoad = deserializeContract(contractRawForAggregate);\n    } catch (error) {\n      diagnostics.push({\n        code: 'CONTRACT.UNREADABLE',\n        severity: 'warn',\n        message: `Could not deserialize contract: ${error instanceof Error ? error.message : 'unknown error'}`,\n        hints: [\"Run 'prisma-next contract emit' to generate a valid contract\"],\n      });\n    }\n  }\n\n  let aggregate: ContractSpaceAggregate;\n  try {\n    aggregate = await loadContractSpaceAggregate({\n      migrationsDir,\n      deserializeContract,\n      appContract: appContractForLoad,\n    });\n  } catch (error) {\n    if (MigrationToolsError.is(error)) {\n      return notOk(mapMigrationToolsError(error));\n    }\n    return notOk(\n      errorUnexpected(error instanceof Error ? error.message : String(error), {\n        why: `Failed to read migrations directory: ${error instanceof Error ? error.message : String(error)}`,\n      }),\n    );\n  }\n\n  if (contractRawForAggregate !== null) {\n    const corruptionFailure = refusePackageCorruptionOnAggregate(aggregate);\n    if (corruptionFailure) {\n      return notOk(corruptionFailure);\n    }\n  }\n\n  const appGraph = aggregate.app.graph();\n\n  let fromOverrideHash: string | undefined;\n\n  if (options.to || options.from) {\n    if (options.to) {\n      const refResult = parseContractRef(options.to, { graph: appGraph, refs: allRefs });\n      if (!refResult.ok) {\n        return notOk(mapRefResolutionError(refResult.failure));\n      }\n      activeRefHash = refResult.value.hash;\n      if (refResult.value.provenance.kind === 'ref') {\n        const resolvedRefName = refResult.value.provenance.refName;\n        activeRefName = resolvedRefName;\n        activeRefEntry = allRefs[resolvedRefName];\n      }\n    }\n\n    if (options.from) {\n      const fromResult = parseContractRef(options.from, { graph: appGraph, refs: allRefs });\n      if (!fromResult.ok) {\n        return notOk(mapRefResolutionError(fromResult.failure));\n      }\n      fromOverrideHash = fromResult.value.hash;\n    }\n  }\n\n  const requiredInvariants: readonly string[] = [...(activeRefEntry?.invariants ?? [])].sort();\n\n  const statusRefs: StatusRef[] = Object.entries(allRefs).map(([name, entry]) => ({\n    name,\n    hash: entry.hash,\n    active: name === activeRefName,\n  }));\n\n  if (!flags.json && !flags.quiet) {\n    const details: Array<{ label: string; value: string }> = [\n      { label: 'config', value: configPath },\n      { label: 'migrations', value: appMigrationsRelative },\n    ];\n    if (dbConnection && hasDriver) {\n      details.push({ label: 'database', value: maskConnectionUrl(String(dbConnection)) });\n    }\n    if (activeRefName) {\n      details.push({ label: 'ref', value: activeRefName });\n    }\n    if (options.from) {\n      details.push({ label: 'from', value: options.from });\n    }\n    if (activeRefEntry && activeRefEntry.invariants.length > 0) {\n      details.push({\n        label: 'required',\n        value: formatInvariantList(activeRefEntry.invariants),\n      });\n    }\n    const header = formatStyledHeader({\n      command: 'migration status',\n      description: 'Show migration history and applied status',\n      details,\n      flags,\n    });\n    ui.stderr(header);\n  }\n\n  const bundles = aggregate.app.packages;\n  const graph = appGraph;\n\n  if (bundles.length === 0) {\n    if (dbConnection && hasDriver) {\n      const markerProbe = await validateOnlineMarkerRead(config, dbConnection);\n      if (!markerProbe.ok) {\n        return markerProbe;\n      }\n    }\n    if (contractHash !== EMPTY_CONTRACT_HASH) {\n      diagnostics.push({\n        code: 'CONTRACT.AHEAD',\n        severity: 'warn',\n        message: 'No migration exists for the current contract',\n        hints: [\n          \"Run 'prisma-next migration plan' to generate a migration for the current contract\",\n        ],\n      });\n    }\n    return ok({\n      ok: true,\n      mode: dbConnection && hasDriver ? 'online' : 'offline',\n      migrations: [],\n      targetHash: EMPTY_CONTRACT_HASH,\n      contractHash,\n      summary: 'No migrations found',\n      diagnostics,\n      requiredInvariants,\n    });\n  }\n\n  let targetHash: string | undefined;\n\n  if (activeRefHash) {\n    targetHash = activeRefHash;\n  } else if (graph.nodes.has(contractHash)) {\n    targetHash = contractHash;\n  } else {\n    const leaves = findReachableLeaves(graph, EMPTY_CONTRACT_HASH);\n    if (leaves.length === 1) {\n      targetHash = leaves[0];\n    } else {\n      diagnostics.push({\n        code: 'MIGRATION.DIVERGED',\n        severity: 'warn',\n        message: 'There are multiple valid migration paths — you must select a target',\n        hints: [\n          \"Use '--to <contract>' to select a target\",\n          \"Or 'prisma-next ref set <name> <hash>' to create one\",\n        ],\n      });\n    }\n  }\n\n  let markerHash: string | undefined;\n  let markerInvariants: readonly string[] = [];\n  let mode: 'online' | 'offline' = 'offline';\n  let allMarkers: ReadonlyMap<string, ContractMarkerRecordLike> | null = null;\n\n  if (dbConnection && hasDriver) {\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    try {\n      await client.connect(dbConnection);\n      const marker = await client.readMarker();\n      markerHash = marker?.storageHash;\n      markerInvariants = marker?.invariants ?? [];\n      mode = 'online';\n      // Read every space's marker so the aggregate enumeration can\n      // surface per-space marker state. `readAllMarkers` mirrors what\n      // `db init` / `db update` already use to drive the planner;\n      // here it powers the aggregate status output.\n      //\n      // Probe for the method first so we only swallow the\n      // unsupported-method case: older family instances may not\n      // implement `readAllMarkers` (per-space enumeration then falls\n      // back to \"marker unknown\"). Real query / runtime errors from\n      // an instance that *does* expose the method must propagate up\n      // — otherwise transient DB failures would silently degrade\n      // status to \"markers unknown\".\n      if (typeof client.readAllMarkers === 'function') {\n        allMarkers = await client.readAllMarkers();\n      } else {\n        // Leaving `allMarkers` as `null` signals \"unknown\" to the\n        // aggregate loader (an empty `Map` would instead mean \"every\n        // space has no marker\", which is a different condition).\n        allMarkers = null;\n      }\n    } catch (error) {\n      if (CliStructuredError.is(error)) {\n        return notOk(error);\n      }\n      if (!flags.json && !flags.quiet) {\n        ui.warn('Could not connect to database — showing offline status');\n      }\n    } finally {\n      await client.close();\n    }\n  }\n\n  if (fromOverrideHash !== undefined) {\n    markerHash = fromOverrideHash;\n    mode = 'offline';\n    allMarkers = null;\n  }\n\n  let aggregateSpaces: readonly MigrationStatusSpaceEntry[] = [];\n  if (contractRawForAggregate !== null) {\n    try {\n      aggregateSpaces = await loadAggregateStatusSpaces({\n        aggregate,\n        extensionPacks: config.extensionPacks ?? [],\n        markersBySpace: allMarkers,\n      });\n    } catch {\n      aggregateSpaces = [];\n    }\n  }\n  const totalPendingAcrossSpaces = computeTotalPendingAcrossSpaces(aggregateSpaces);\n\n  // Pre-check unknown invariants. Online: union the graph's declared\n  // invariants with the marker's recorded set so a retired-but-applied\n  // invariant doesn't surface as MIGRATION.UNKNOWN_INVARIANT — apply would\n  // route fine because marker subtraction empties `effectiveRequired`.\n  // Offline: keep the check graph-strict (the marker is unknown, and a\n  // missing declarer is the dominant signal we can offer).\n  if (activeRefEntry && activeRefEntry.invariants.length > 0) {\n    const declared = collectDeclaredInvariants(graph);\n    const known = new Set<string>(declared);\n    if (mode === 'online') {\n      for (const id of markerInvariants) known.add(id);\n    }\n    const unknown = activeRefEntry.invariants.filter((id) => !known.has(id));\n    if (unknown.length > 0) {\n      return notOk(\n        mapMigrationToolsError(\n          errorUnknownInvariant({\n            ...ifDefined('refName', activeRefName),\n            unknown,\n            declared: [...declared].sort(),\n          }),\n        ),\n      );\n    }\n  }\n\n  // Marker exists but is not in the migration graph and doesn't match the\n  // contract hash. The DB is at an unknown state relative to the graph.\n  // Bail out early with a clear diagnostic instead of rendering a confusing\n  // graph with no statuses.\n  //\n  // When marker === contract (both off-graph), the DB matches the current\n  // contract — proceed normally; the detached contract node will carry both\n  // the db and contract markers.\n  if (\n    mode === 'online' &&\n    markerHash !== undefined &&\n    !graph.nodes.has(markerHash) &&\n    markerHash !== contractHash\n  ) {\n    const hints: string[] = [];\n    if (graph.nodes.has(contractHash)) {\n      hints.push(\n        \"Run 'prisma-next db sign' to overwrite the marker if the database already matches the contract\",\n        \"Run 'prisma-next db update' to push the current contract to the database\",\n        \"Run 'prisma-next contract infer' to make your contract match the database\",\n        \"Run 'prisma-next db verify' to inspect the database state\",\n      );\n    } else {\n      hints.push(\n        \"Run 'prisma-next db update' to push the current contract to the database\",\n        \"Run 'prisma-next contract infer' to make your contract match the database\",\n        \"Run 'prisma-next db verify' to inspect the database state\",\n      );\n    }\n    diagnostics.push({\n      code: 'MIGRATION.MARKER_NOT_IN_HISTORY',\n      severity: 'warn',\n      message:\n        'Database was updated outside the migration system (marker does not match any migration)',\n      hints,\n    });\n    return ok({\n      ok: true,\n      mode,\n      migrations: [],\n      targetHash: EMPTY_CONTRACT_HASH,\n      contractHash,\n      summary: `${bundles.length} migration(s) on disk`,\n      diagnostics,\n      markerHash,\n      requiredInvariants,\n      ...(statusRefs.length > 0 ? { refs: statusRefs } : {}),\n    });\n  }\n\n  if (mode === 'online' && markerHash === undefined) {\n    diagnostics.push({\n      code: 'MIGRATION.NO_MARKER',\n      severity: 'warn',\n      message: 'Database has not been initialized — no migration marker found',\n      hints: [\"Run 'prisma-next migrate' to apply pending migrations\"],\n    });\n  }\n\n  // Contract diagnostic — fires when no migration produces the current contract hash.\n  // Suppressed when: (a) graph is diverged (MIGRATION.DIVERGED already guides the user),\n  // (b) marker === contract and both off-graph (marker-not-in-graph diagnostic covers it).\n  if (\n    targetHash &&\n    contractHash !== EMPTY_CONTRACT_HASH &&\n    !graph.nodes.has(contractHash) &&\n    markerHash !== contractHash\n  ) {\n    diagnostics.push({\n      code: 'CONTRACT.AHEAD',\n      severity: 'warn',\n      message: 'Contract has changed since the last migration was planned',\n      hints: [\"Run 'prisma-next migration plan' to generate a migration for the current contract\"],\n    });\n  }\n\n  if (!targetHash) {\n    return ok({\n      ok: true,\n      mode,\n      migrations: [],\n      targetHash: EMPTY_CONTRACT_HASH,\n      contractHash,\n      summary: `${bundles.length} migration(s) on disk`,\n      diagnostics,\n      ...ifDefined('markerHash', markerHash),\n      requiredInvariants,\n      ...(statusRefs.length > 0 ? { refs: statusRefs } : {}),\n      graph,\n      bundles,\n      diverged: true,\n    });\n  }\n\n  const chain = resolveDisplayChain(graph, targetHash, markerHash);\n\n  if (!chain) {\n    return notOk(\n      errorRuntime('Cannot reconstruct migration history', {\n        why: `No path from ${EMPTY_CONTRACT_HASH} to target ${targetHash}`,\n        fix: 'The migration history may have gaps. Check the migrations directory for missing or corrupted packages.',\n      }),\n    );\n  }\n\n  const edgeStatuses = deriveEdgeStatuses(graph, targetHash, contractHash, markerHash, mode);\n  const entries = buildMigrationEntries(chain, bundles, mode, markerHash, edgeStatuses);\n\n  const pendingCount = edgeStatuses.filter((e) => e.status === 'pending').length;\n  const appliedCount = edgeStatuses.filter((e) => e.status === 'applied').length;\n\n  let appliedInvariants: readonly string[] | undefined;\n  let missingInvariants: readonly string[] | undefined;\n  let effectiveRequired = new Set<string>();\n  if (mode === 'online') {\n    // Mirrors `migrate.ts`: compute `effectiveRequired = required −\n    // marker.invariants` directly, then derive the display fields from it.\n    // `appliedInvariants` is the intersection (`required ∩ marker`), which\n    // is what JSON consumers see for the active ref; the unfiltered set\n    // lives on `marker.invariants`.\n    const markerSet = new Set(markerInvariants);\n    effectiveRequired = new Set(requiredInvariants.filter((id) => !markerSet.has(id)));\n    appliedInvariants = requiredInvariants.filter((id) => markerSet.has(id));\n    missingInvariants = [...effectiveRequired].sort();\n  }\n\n  // The marker can match the structural target while still missing required\n  // invariants — for example, a self-edge that provides X, applied via a ref\n  // declaring X. `pendingCount` (structural) says zero in that case but\n  // `effectiveRequired` is non-empty, so up-to-date messaging would mislead.\n  const hasInvariantWork = effectiveRequired.size > 0;\n  const missingList = [...effectiveRequired].sort().join(', ');\n\n  let summary: string;\n  if (mode === 'online') {\n    if (markerHash !== undefined && !graph.nodes.has(markerHash) && markerHash === contractHash) {\n      summary = `${bundles.length} migration(s) on disk`;\n    } else if (activeRefHash && activeRefName && markerHash !== undefined) {\n      const distance = summarizeRefDistance(graph, markerHash, activeRefHash, activeRefName);\n      summary = hasInvariantWork ? `${distance} — missing invariant(s): ${missingList}` : distance;\n    } else if (pendingCount === 0 && !hasInvariantWork) {\n      summary = `Database is up to date (${appliedCount} migration${appliedCount !== 1 ? 's' : ''} applied)`;\n    } else if (pendingCount === 0 && hasInvariantWork) {\n      summary = `Missing invariant(s): ${missingList} — run 'prisma-next migrate --to ${activeRefName ?? '<ref>'}' to apply`;\n    } else if (markerHash === undefined) {\n      summary = `${pendingCount} pending migration(s) — database has no marker`;\n    } else {\n      summary = `${pendingCount} pending migration(s) — run 'prisma-next migrate' to apply`;\n    }\n  } else {\n    summary = `${entries.length} migration(s) on disk`;\n  }\n\n  let pathDecision: MigrationStatusResult['pathDecision'];\n  let routingUnreachable = false;\n  if (mode === 'online') {\n    const originHash = markerHash ?? EMPTY_CONTRACT_HASH;\n    const outcome = findPathWithDecision(graph, originHash, targetHash, {\n      ...ifDefined('refName', activeRefName),\n      required: effectiveRequired,\n    });\n    if (outcome.kind === 'ok') {\n      pathDecision = toPathDecisionResult(outcome.decision);\n    } else if (outcome.kind === 'unsatisfiable') {\n      return notOk(\n        mapMigrationToolsError(\n          errorNoInvariantPath({\n            ...ifDefined('refName', activeRefName),\n            required: [...effectiveRequired].sort(),\n            missing: outcome.missing,\n            structuralPath: outcome.structuralPath.map(toStructuralEdge),\n          }),\n        ),\n      );\n    } else {\n      // outcome.kind === 'unreachable' — origin (marker) has no structural\n      // path to the active target. `pendingCount` and `hasInvariantWork`\n      // both report zero in this case, but emitting MIGRATION.UP_TO_DATE\n      // would be wrong: the database simply cannot reach the requested\n      // ref/contract from its current state. Suppress UP_TO_DATE below.\n      routingUnreachable = true;\n    }\n  }\n\n  if (mode === 'online') {\n    if (markerHash !== undefined && !graph.nodes.has(markerHash) && markerHash === contractHash) {\n      diagnostics.push({\n        code: 'MIGRATION.MARKER_NOT_IN_HISTORY',\n        severity: 'warn',\n        message: 'Database matches the current contract but was updated directly (not via migrate)',\n        hints: [\"Run 'prisma-next migration plan' to plan a migration to your current contract\"],\n      });\n    } else if (pendingCount > 0) {\n      diagnostics.push({\n        code: 'MIGRATION.DATABASE_BEHIND',\n        severity: 'info',\n        message: `${pendingCount} migration(s) pending`,\n        hints: [\"Run 'prisma-next migrate' to apply pending migrations\"],\n      });\n    } else if (hasInvariantWork) {\n      diagnostics.push({\n        code: 'MIGRATION.INVARIANTS_PENDING',\n        severity: 'info',\n        message: `Missing required invariant(s): ${missingList}`,\n        hints: [\n          `Run 'prisma-next migrate --to ${activeRefName ?? '<ref>'}' to apply a path that covers the required invariants`,\n        ],\n      });\n    } else if (!routingUnreachable) {\n      diagnostics.push({\n        code: 'MIGRATION.UP_TO_DATE',\n        severity: 'info',\n        message: 'Database is up to date',\n        hints: [],\n      });\n    }\n  }\n\n  const result: MigrationStatusResult = {\n    ok: true,\n    mode,\n    migrations: entries,\n    targetHash,\n    contractHash,\n    summary,\n    diagnostics,\n    ...ifDefined('markerHash', markerHash),\n    requiredInvariants,\n    ...ifDefined('appliedInvariants', appliedInvariants),\n    ...ifDefined('missingInvariants', missingInvariants),\n    ...(statusRefs.length > 0 ? { refs: statusRefs } : {}),\n    ...ifDefined('pathDecision', pathDecision),\n    graph,\n    bundles,\n    edgeStatuses,\n    ...ifDefined('activeRefHash', activeRefHash),\n    ...ifDefined('activeRefName', activeRefName),\n    spaces: aggregateSpaces,\n    ...ifDefined('totalPendingAcrossSpaces', totalPendingAcrossSpaces),\n  };\n  return ok(result);\n}\n\nexport function createMigrationStatusCommand(): Command {\n  const command = new Command('status');\n  setCommandDescriptions(\n    command,\n    'Show migration path and pending status',\n    'Shows which migrations are pending between the database marker and\\n' +\n      'the target contract. Requires a database connection for live status.\\n' +\n      'Use `migration graph` for topology, `migration log` for history,\\n' +\n      'and `migration list` for on-disk enumeration.',\n  );\n  setCommandExamples(command, [\n    'prisma-next migration status --db $DATABASE_URL',\n    'prisma-next migration status --to production --db $DATABASE_URL',\n  ]);\n  setCommandSeeAlso(command, [\n    { verb: 'migration log', oneLiner: 'Show executed migration history' },\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(\n      '--to <contract>',\n      'Target contract reference (hash, prefix, ref name, migration dir name, <dir>^, or ./path)',\n    )\n    .option(\n      '--from <contract>',\n      'Origin contract reference; same grammar as --to. Supplying --from switches to offline path computation.',\n    )\n    .action(async (options: MigrationStatusOptions) => {\n      const flags = parseGlobalFlagsOrExit(options);\n      const ui = createTerminalUI(flags);\n\n      const result = await executeMigrationStatusCommand(options, flags, ui);\n\n      const exitCode = handleResult(result, flags, ui, (statusResult) => {\n        if (flags.json) {\n          const {\n            graph: _graph,\n            bundles: _bundles,\n            edgeStatuses: _edgeStatuses,\n            activeRefHash: _activeRefHash,\n            activeRefName: _activeRefName,\n            diverged: _diverged,\n            ...jsonResult\n          } = statusResult;\n          ui.output(JSON.stringify(jsonResult, null, 2));\n        } else if (!flags.quiet) {\n          const colorize = flags.color !== false;\n\n          if (statusResult.graph) {\n            const renderInput = migrationGraphToRenderInput({\n              graph: statusResult.graph,\n              mode: statusResult.mode,\n              markerHash: statusResult.markerHash,\n              contractHash: statusResult.contractHash,\n              refs: statusResult.refs,\n              activeRefHash: statusResult.activeRefHash,\n              activeRefName: statusResult.activeRefName,\n              edgeStatuses: statusResult.edgeStatuses,\n            });\n\n            const graphToRender = statusResult.diverged\n              ? renderInput.graph\n              : extractRelevantSubgraph(renderInput.graph, renderInput.relevantPaths);\n            const dagreOptions = isLinearGraph(graphToRender) ? { ranksep: 1 } : undefined;\n            const renderOptions = {\n              ...renderInput.options,\n              colorize,\n              ...ifDefined('dagreOptions', dagreOptions),\n            };\n            const graphOutput = graphRenderer.render(graphToRender, renderOptions);\n            ui.log(graphOutput);\n            if (statusResult.mode === 'online') {\n              ui.log(formatLegend(colorize));\n            }\n          }\n          ui.log('');\n          ui.log(formatStatusSummary(statusResult, colorize));\n        }\n      });\n\n      process.exit(exitCode);\n    });\n\n  return command;\n}\n\nfunction formatLegend(colorize: boolean): string {\n  const c = (fn: (s: string) => string, s: string) => (colorize ? fn(s) : s);\n  const parts = [\n    `${c(cyan, '✓')} applied`,\n    `${c(yellow, '⧗')} pending`,\n    `${c(magenta, '✗')} unreachable`,\n  ];\n  return c(dim, parts.join('  '));\n}\n\nexport function formatStatusSummary(result: MigrationStatusResult, colorize: boolean): string {\n  const c = (fn: (s: string) => string, s: string) => (colorize ? fn(s) : s);\n  const lines: string[] = [];\n\n  const hasUnknown = result.migrations.some((e) => e.status === 'unknown');\n  const pendingCount = result.migrations.filter((e) => e.status === 'pending').length;\n\n  const hasWarnings = result.diagnostics?.some((d) => d.severity === 'warn') ?? false;\n  // INVARIANTS_PENDING is filed at severity 'info' (per ADR 208) so the\n  // warn-severity check above doesn't see it. It still represents pending\n  // work, so it must promote the summary off the success icon.\n  const hasInvariantPending =\n    result.diagnostics?.some((d) => d.code === 'MIGRATION.INVARIANTS_PENDING') ?? false;\n\n  if (result.mode === 'online') {\n    if (hasUnknown || hasWarnings) {\n      lines.push(`${c(yellow, '⚠')} ${result.summary}`);\n    } else if (pendingCount === 0 && !hasInvariantPending) {\n      lines.push(`${c(cyan, '✔')} ${result.summary}`);\n    } else {\n      lines.push(`${c(yellow, '⧗')} ${result.summary}`);\n    }\n  } else {\n    lines.push(result.summary);\n  }\n\n  if (result.requiredInvariants.length > 0) {\n    if (result.appliedInvariants !== undefined && result.missingInvariants !== undefined) {\n      lines.push(`${c(dim, 'applied  ')}${formatInvariantList(result.appliedInvariants)}`);\n      lines.push(`${c(dim, 'missing  ')}${formatInvariantList(result.missingInvariants)}`);\n    } else {\n      lines.push(`${c(dim, 'applied  ')}(unknown — connect a database to evaluate)`);\n    }\n  }\n\n  const warnings = result.diagnostics?.filter((d) => d.severity === 'warn') ?? [];\n  for (const diag of warnings) {\n    lines.push(`${c(yellow, '⚠')} ${diag.message}`);\n    for (const hint of diag.hints) {\n      lines.push(`  ${c(dim, hint)}`);\n    }\n  }\n\n  // Per-space section. Suppressed when there's no extension space —\n  // the top-level output already covers the app member.\n  // When extensions exist, render every space (including the app)\n  // for consistency, plus a cross-space pending total + apply hint.\n  if (result.spaces?.some((s) => s.kind === 'extension')) {\n    const total = result.totalPendingAcrossSpaces ?? 0;\n    lines.push('');\n    lines.push(c(dim, 'spaces'));\n    for (const space of result.spaces) {\n      lines.push(formatSpaceLine(space, c));\n    }\n    if (total > 0) {\n      lines.push('');\n      lines.push(\n        `${c(yellow, '⧗')} ${total} pending migration(s) across ${result.spaces.length} space(s) — run 'prisma-next migrate' to apply`,\n      );\n    }\n  }\n\n  return lines.join('\\n');\n}\n\nfunction formatSpaceLine(\n  space: MigrationStatusSpaceEntry,\n  c: (fn: (s: string) => string, s: string) => string,\n): string {\n  const glyph = (() => {\n    if (space.status === 'up-to-date' || space.status === 'no-marker') return c(cyan, '✓');\n    if (space.status === 'pending') return c(yellow, '⧗');\n    if (space.status === 'unreachable' || space.status === 'never-planned') return c(magenta, '✗');\n    return ' ';\n  })();\n  const tag = space.kind === 'app' ? '[app]' : '[ext]';\n  const head = space.headHash.slice(0, 8);\n  const marker =\n    space.markerHash === undefined\n      ? '(unknown)'\n      : space.markerHash === null\n        ? '(no marker)'\n        : space.markerHash.slice(0, 8);\n  const pending =\n    space.pendingCount === undefined\n      ? ''\n      : space.pendingCount === 0\n        ? c(dim, ' (up to date)')\n        : c(yellow, ` (${space.pendingCount} pending)`);\n  return `  ${glyph} ${c(dim, tag)} ${space.spaceId} → head ${c(dim, head)}, marker ${c(dim, marker)}${pending}`;\n}\n\nfunction formatInvariantList(ids: readonly string[]): string {\n  return ids.length === 0 ? '(none)' : ids.join(', ');\n}\n\nfunction summarizeRefDistance(\n  graph: MigrationGraph,\n  markerHash: string,\n  refHash: string,\n  refName: string,\n): string {\n  if (markerHash === refHash) return `At ref \"${refName}\" target`;\n\n  const pathToRef = findPath(graph, markerHash, refHash);\n  if (pathToRef) return `${pathToRef.length} migration(s) behind ref \"${refName}\"`;\n\n  const pathFromRef = findPath(graph, refHash, markerHash);\n  if (pathFromRef) return `${pathFromRef.length} migration(s) ahead of ref \"${refName}\"`;\n\n  return `No path between database marker and ref \"${refName}\" target`;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAmIA,SAAgB,gCACd,QACoB;CACpB,IAAI,OAAO,WAAW,GAAG,OAAO,KAAA;CAChC,IAAI,QAAQ;CACZ,KAAK,MAAM,KAAK,QAAQ;EACtB,IAAI,EAAE,iBAAiB,KAAA,GAAW,OAAO,KAAA;EACzC,SAAS,EAAE;CACb;CACA,OAAO;AACT;AAkEA,SAAS,aAAa,KAGpB;CACA,IAAI,IAAI,WAAW,GAAG,OAAO;EAAE,SAAS;EAAS,gBAAgB;CAAM;CAEvE,MAAM,0BAAU,IAAI,IAAoB;CACxC,KAAK,MAAM,MAAM,KACf,QAAQ,IAAI,GAAG,iBAAiB,QAAQ,IAAI,GAAG,cAAc,KAAK,KAAK,CAAC;CAG1E,MAAM,iBAAiB,QAAQ,IAAI,aAAa;CAChD,MAAM,QAAQ,IAAI;CAClB,MAAM,OAAO,UAAU,IAAI,OAAO;CAElC,IAAI,QAAQ,SAAS,GAEnB,OAAO;EAAE,SAAS,GAAG,MAAM,GAAG,KAAK,QADvB,CAAC,GAAG,QAAQ,KAAK,CAAC,EAAE,GACe;EAAI;CAAe;CAGpE,MAAM,mBAAmB,QAAQ,IAAI,aAAa;CAClD,IAAI,kBACF,OAAO;EAAE,SAAS,GAAG,MAAM,GAAG,KAAK,IAAI,iBAAiB;EAAgB;CAAe;CAIzF,OAAO;EAAE,SAAS,GAAG,MAAM,GAAG,KAAK,IADrB,CAAC,GAAG,QAAQ,QAAQ,CAAC,EAAE,KAAK,CAAC,KAAK,OAAO,GAAG,EAAE,GAAG,KACpB,EAAE,KAAK,IAAI,EAAE;EAAI;CAAe;AAC7E;;;;;;;;;;;;;;;;AAiBA,SAAgB,mBACd,OACA,YACA,cACA,YACA,MACc;CACd,IAAI,SAAS,WAAW,OAAO,CAAC;CAEhC,MAAM,WAAW,MAAqB,GAAG,EAAE,KAAK,IAAI,EAAE;CAGtD,MAAM,kBAAkB,cAAc;CAEtC,MAAM,cACJ,eAAe,KAAA,IAAY,SAAS,OAAO,qBAAqB,UAAU,IAAI;CAEhF,MAAM,cAAc,SAAS,OAAO,iBAAiB,UAAU;CAC/D,MAAM,aAAa,SAAS,OAAO,qBAAqB,UAAU;CAElE,MAAM,WAAyB,CAAC;CAChC,MAAM,+BAAe,IAAI,IAAY;CAGrC,IAAI,aACF,KAAK,MAAM,KAAK,aAAa;EAC3B,aAAa,IAAI,QAAQ,CAAC,CAAC;EAC3B,SAAS,KAAK;GAAE,SAAS,EAAE;GAAS,QAAQ;EAAU,CAAC;CACzD;CAIF,IAAI,aACF,KAAK,MAAM,KAAK,aAAa;EAC3B,aAAa,IAAI,QAAQ,CAAC,CAAC;EAC3B,SAAS,KAAK;GAAE,SAAS,EAAE;GAAS,QAAQ;EAAU,CAAC;CACzD;CAKF,IACE,iBAAiB,uBACjB,iBAAiB,cACjB,MAAM,MAAM,IAAI,YAAY,GAC5B;EACA,MAAM,eAAe,SAAS,OAAO,YAAY,YAAY;EAC7D,IAAI;QACG,MAAM,KAAK,cACd,IAAI,CAAC,aAAa,IAAI,QAAQ,CAAC,CAAC,GAAG;IACjC,aAAa,IAAI,QAAQ,CAAC,CAAC;IAC3B,SAAS,KAAK;KAAE,SAAS,EAAE;KAAS,QAAQ;IAAU,CAAC;GACzD;;CAGN;CAQA,IAAI;OACG,MAAM,KAAK,YACd,IAAI,CAAC,aAAa,IAAI,QAAQ,CAAC,CAAC,GAC9B,SAAS,KAAK;GAAE,SAAS,EAAE;GAAS,QAAQ;EAAc,CAAC;CAAA;CAKjE,OAAO;AACT;;;;;AAMA,SAAS,sBACP,OACA,UACA,MACA,YACA,cACwB;CACxB,MAAM,eAAe,IAAI,IAAI,SAAS,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;CAChE,MAAM,kBAAkB,eACpB,IAAI,IAAI,aAAa,KAAK,MAAM,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,IACtD,KAAA;CAEJ,MAAM,gBAAgB,eAAe,KAAA,KAAa,MAAM,MAAM,MAAM,EAAE,OAAO,UAAU;CAEvF,MAAM,UAAkC,CAAC;CACzC,IAAI,gBAAgB,SAAS,YAAY,eAAe,KAAA;CAExD,KAAK,MAAM,aAAa,OAAO;EAE7B,MAAM,MADM,aAAa,IAAI,UAAU,OACxB,GAAG,OAAO,CAAC;EAC1B,MAAM,EAAE,SAAS,mBAAmB,aAAa,GAAG;EAEpD,IAAI;EACJ,MAAM,aAAa,iBAAiB,IAAI,UAAU,OAAO;EACzD,IAAI,YACF,SAAS;OACJ,IAAI,SAAS,aAAa,CAAC,eAChC,SAAS;OACJ,IAAI,eACT,SAAS;OAET,SAAS;EAGX,QAAQ,KAAK;GACX,SAAS,UAAU;GACnB,MAAM,UAAU;GAChB,IAAI,UAAU;GACd,eAAe,UAAU;GACzB,gBAAgB,IAAI;GACpB,kBAAkB;GAClB;GACA;EACF,CAAC;EAED,IAAI,CAAC,iBAAiB,UAAU,OAAO,YACrC,gBAAgB;CAEpB;CAEA,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAS,oBACP,OACA,YACA,YACiC;CACjC,IAAI,eAAe,KAAA,GACjB,OAAO,SAAS,OAAO,qBAAqB,UAAU;CAGxD,MAAM,WAAW,SAAS,OAAO,qBAAqB,UAAU;CAGhE,IAAI,CAAC,UAAU,OAAO,SAAS,OAAO,qBAAqB,UAAU;CAErE,IAAI,eAAe,YAAY,OAAO;CAEtC,MAAM,aAAa,SAAS,OAAO,YAAY,UAAU;CACzD,IAAI,YAAY,OAAO,CAAC,GAAG,UAAU,GAAG,UAAU;CAKlD,MAAM,WAAW,SAAS,OAAO,qBAAqB,UAAU;CAChE,IAAI,CAAC,UAAU,OAAO;CAEtB,MAAM,iBAAiB,SAAS,OAAO,YAAY,UAAU;CAC7D,IAAI,gBAAgB,OAAO,CAAC,GAAG,UAAU,GAAG,cAAc;CAG1D,OAAO;AACT;;;;;;;;;;;AAYA,eAAsB,0BAA0B,MAIE;CAChD,MAAM,qBAAqB,4BAA4B,KAAK,cAAc;CAC1E,IACE,6BAA6B,KAAK,WAAW;EAC3C;EACA,gBAAgB;CAClB,CAAC,GAKD,OAAO,CAAC;CAEV,MAAM,YAAY,KAAK;CAEvB,MAAM,iBAAiB,CAAC,GAAG,UAAU,YAAY,UAAU,GAAG;CAC9D,MAAM,OAAoC,CAAC;CAC3C,KAAK,MAAM,UAAU,gBAAgB;EACnC,MAAM,aAAa,KAAK,gBAAgB,IAAI,OAAO,OAAO,KAAK;EAC/D,MAAM,QAAQ,OAAO,YAAY,UAAU,IAAI;EAG/C,MAAM,UAAU,eAAe,MAAM;EAErC,IAAI,OAAO,MAAM,EAAE,MAAM,SAAS,GAAG;GACnC,KAAK,KAAK;IACR,SAAS,OAAO;IAChB,MAAM,QAAQ,QAAQ;IACtB,UAAU,QAAQ;IAClB,GAAI,KAAK,mBAAmB,OACxB;KACE,YAAY,YAAY,eAAe;KACvC,QAAQ,QAAQ,SAAS,sBAAsB,eAAe;KAC9D,cAAc;IAChB,IACA,CAAC;GACP,CAAC;GACD;EACF;EAEA,IAAI,KAAK,mBAAmB,MAAM;GAChC,KAAK,KAAK;IACR,SAAS,OAAO;IAChB,MAAM,QAAQ,QAAQ;IACtB,UAAU,QAAQ;GACpB,CAAC;GACD;EACF;EAEA,MAAM,SAAS,kBAAkB;GAC/B,mBAAmB,UAAU;GAC7B;GACA,eAAe;EACjB,CAAC;EACD,IAAI,eAAe;EACnB,IAAI;EACJ,IAAI,OAAO,SAAS,MAAM;GAIxB,eAAe,OAAO,OAAO,gBAAgB,UAAU;GACvD,IAAI,eAAe,MACjB,SAAS,iBAAiB,IAAI,cAAc;QAE5C,SAAS,iBAAiB,IAAI,eAAe;EAEjD,OACE,SAAS;EAGX,KAAK,KAAK;GACR,SAAS,OAAO;GAChB,MAAM,QAAQ,QAAQ;GACtB,UAAU,QAAQ;GAClB,YAAY,YAAY,eAAe;GACvC;GACA,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;EAC7B,CAAC;CACH;CACA,OAAO;AACT;;;;;;;AASA,eAAe,yBACb,QACA,cAC2C;CAC3C,MAAM,SAAS,OAAO;CACtB,IAAI,CAAC,QACH,OAAO,GAAG,KAAA,CAAS;CAGrB,MAAM,SAAS,oBAAoB;EACjC,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,SAAS,OAAO;EAChB;EACA,gBAAgB,OAAO,kBAAkB,CAAC;CAC5C,CAAC;CACD,IAAI;EACF,MAAM,OAAO,QAAQ,YAAY;EACjC,MAAM,OAAO,WAAW;EACxB,OAAO,GAAG,KAAA,CAAS;CACrB,SAAS,OAAO;EACd,IAAI,mBAAmB,GAAG,KAAK,GAC7B,OAAO,MAAM,KAAK;EAEpB,OAAO,MACL,gBAAgB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAAG,EACtE,KAAK,mCAAmC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,IAC/F,CAAC,CACH;CACF,UAAU;EACR,MAAM,OAAO,MAAM;CACrB;AACF;AAEA,eAAe,8BACb,SACA,OACA,IAC4D;CAC5D,MAAM,SAAS,MAAM,WAAW,QAAQ,MAAM;CAC9C,MAAM,EAAE,YAAY,uBAAuB,eAAe,YAAY,sBACpE,QAAQ,QACR,MACF;CAEA,MAAM,eAAe,QAAQ,MAAM,OAAO,IAAI;CAC9C,MAAM,YAAY,CAAC,CAAC,OAAO;CAE3B,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,UAAgB,CAAC;CACrB,IAAI;EACF,UAAU,MAAM,SAAS,OAAO;CAClC,SAAS,OAAO;EACd,IAAI,oBAAoB,GAAG,KAAK,GAC9B,OAAO,MAAM,uBAAuB,KAAK,CAAC;EAE5C,MAAM;CACR;CAEA,MAAM,cAAkC,CAAC;CACzC,IAAI,eAAuB;CAC3B,IAAI;EAEF,gBAAe,MADQ,qBAAqB,MAAM,GAC1B;CAC1B,SAAS,OAAO;EACd,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS,4BAA4B,iBAAiB,QAAQ,MAAM,UAAU;GAC9E,OAAO,CAAC,8DAA8D;EACxE,CAAC;CACH;CAEA,MAAM,0BAA0B,MAAM,sBAAsB,MAAM;CAClE,MAAM,QAAQ,mBAAmB,MAAM;CACvC,MAAM,iBAAiB,OAAO,OAAO,OAAO,KAAK;CACjD,MAAM,uBAAuB,SAA4B,eAAe,oBAAoB,IAAI;CAMhG,IAAI,qBALuB,+BAA+B;EACxD;EACA,UAAU,OAAO,OAAO;EACxB,cAAc,OAAO,OAAO;CAC9B,CACoD;CACpD,IAAI,4BAA4B,MAC9B,IAAI;EACF,qBAAqB,oBAAoB,uBAAuB;CAClE,SAAS,OAAO;EACd,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS,mCAAmC,iBAAiB,QAAQ,MAAM,UAAU;GACrF,OAAO,CAAC,8DAA8D;EACxE,CAAC;CACH;CAGF,IAAI;CACJ,IAAI;EACF,YAAY,MAAM,2BAA2B;GAC3C;GACA;GACA,aAAa;EACf,CAAC;CACH,SAAS,OAAO;EACd,IAAI,oBAAoB,GAAG,KAAK,GAC9B,OAAO,MAAM,uBAAuB,KAAK,CAAC;EAE5C,OAAO,MACL,gBAAgB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAAG,EACtE,KAAK,wCAAwC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,IACpG,CAAC,CACH;CACF;CAEA,IAAI,4BAA4B,MAAM;EACpC,MAAM,oBAAoB,mCAAmC,SAAS;EACtE,IAAI,mBACF,OAAO,MAAM,iBAAiB;CAElC;CAEA,MAAM,WAAW,UAAU,IAAI,MAAM;CAErC,IAAI;CAEJ,IAAI,QAAQ,MAAM,QAAQ,MAAM;EAC9B,IAAI,QAAQ,IAAI;GACd,MAAM,YAAY,iBAAiB,QAAQ,IAAI;IAAE,OAAO;IAAU,MAAM;GAAQ,CAAC;GACjF,IAAI,CAAC,UAAU,IACb,OAAO,MAAM,sBAAsB,UAAU,OAAO,CAAC;GAEvD,gBAAgB,UAAU,MAAM;GAChC,IAAI,UAAU,MAAM,WAAW,SAAS,OAAO;IAC7C,MAAM,kBAAkB,UAAU,MAAM,WAAW;IACnD,gBAAgB;IAChB,iBAAiB,QAAQ;GAC3B;EACF;EAEA,IAAI,QAAQ,MAAM;GAChB,MAAM,aAAa,iBAAiB,QAAQ,MAAM;IAAE,OAAO;IAAU,MAAM;GAAQ,CAAC;GACpF,IAAI,CAAC,WAAW,IACd,OAAO,MAAM,sBAAsB,WAAW,OAAO,CAAC;GAExD,mBAAmB,WAAW,MAAM;EACtC;CACF;CAEA,MAAM,qBAAwC,CAAC,GAAI,gBAAgB,cAAc,CAAC,CAAE,EAAE,KAAK;CAE3F,MAAM,aAA0B,OAAO,QAAQ,OAAO,EAAE,KAAK,CAAC,MAAM,YAAY;EAC9E;EACA,MAAM,MAAM;EACZ,QAAQ,SAAS;CACnB,EAAE;CAEF,IAAI,CAAC,MAAM,QAAQ,CAAC,MAAM,OAAO;EAC/B,MAAM,UAAmD,CACvD;GAAE,OAAO;GAAU,OAAO;EAAW,GACrC;GAAE,OAAO;GAAc,OAAO;EAAsB,CACtD;EACA,IAAI,gBAAgB,WAClB,QAAQ,KAAK;GAAE,OAAO;GAAY,OAAO,kBAAkB,OAAO,YAAY,CAAC;EAAE,CAAC;EAEpF,IAAI,eACF,QAAQ,KAAK;GAAE,OAAO;GAAO,OAAO;EAAc,CAAC;EAErD,IAAI,QAAQ,MACV,QAAQ,KAAK;GAAE,OAAO;GAAQ,OAAO,QAAQ;EAAK,CAAC;EAErD,IAAI,kBAAkB,eAAe,WAAW,SAAS,GACvD,QAAQ,KAAK;GACX,OAAO;GACP,OAAO,oBAAoB,eAAe,UAAU;EACtD,CAAC;EAEH,MAAM,SAAS,mBAAmB;GAChC,SAAS;GACT,aAAa;GACb;GACA;EACF,CAAC;EACD,GAAG,OAAO,MAAM;CAClB;CAEA,MAAM,UAAU,UAAU,IAAI;CAC9B,MAAM,QAAQ;CAEd,IAAI,QAAQ,WAAW,GAAG;EACxB,IAAI,gBAAgB,WAAW;GAC7B,MAAM,cAAc,MAAM,yBAAyB,QAAQ,YAAY;GACvE,IAAI,CAAC,YAAY,IACf,OAAO;EAEX;EACA,IAAI,iBAAiB,qBACnB,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO,CACL,mFACF;EACF,CAAC;EAEH,OAAO,GAAG;GACR,IAAI;GACJ,MAAM,gBAAgB,YAAY,WAAW;GAC7C,YAAY,CAAC;GACb,YAAY;GACZ;GACA,SAAS;GACT;GACA;EACF,CAAC;CACH;CAEA,IAAI;CAEJ,IAAI,eACF,aAAa;MACR,IAAI,MAAM,MAAM,IAAI,YAAY,GACrC,aAAa;MACR;EACL,MAAM,SAAS,oBAAoB,OAAO,mBAAmB;EAC7D,IAAI,OAAO,WAAW,GACpB,aAAa,OAAO;OAEpB,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO,CACL,4CACA,sDACF;EACF,CAAC;CAEL;CAEA,IAAI;CACJ,IAAI,mBAAsC,CAAC;CAC3C,IAAI,OAA6B;CACjC,IAAI,aAAmE;CAEvE,IAAI,gBAAgB,WAAW;EAC7B,MAAM,SAAS,oBAAoB;GACjC,QAAQ,OAAO;GACf,QAAQ,OAAO;GACf,SAAS,OAAO;GAChB,QAAQ,OAAO;GACf,gBAAgB,OAAO,kBAAkB,CAAC;EAC5C,CAAC;EACD,IAAI;GACF,MAAM,OAAO,QAAQ,YAAY;GACjC,MAAM,SAAS,MAAM,OAAO,WAAW;GACvC,aAAa,QAAQ;GACrB,mBAAmB,QAAQ,cAAc,CAAC;GAC1C,OAAO;GAaP,IAAI,OAAO,OAAO,mBAAmB,YACnC,aAAa,MAAM,OAAO,eAAe;QAKzC,aAAa;EAEjB,SAAS,OAAO;GACd,IAAI,mBAAmB,GAAG,KAAK,GAC7B,OAAO,MAAM,KAAK;GAEpB,IAAI,CAAC,MAAM,QAAQ,CAAC,MAAM,OACxB,GAAG,KAAK,wDAAwD;EAEpE,UAAU;GACR,MAAM,OAAO,MAAM;EACrB;CACF;CAEA,IAAI,qBAAqB,KAAA,GAAW;EAClC,aAAa;EACb,OAAO;EACP,aAAa;CACf;CAEA,IAAI,kBAAwD,CAAC;CAC7D,IAAI,4BAA4B,MAC9B,IAAI;EACF,kBAAkB,MAAM,0BAA0B;GAChD;GACA,gBAAgB,OAAO,kBAAkB,CAAC;GAC1C,gBAAgB;EAClB,CAAC;CACH,QAAQ;EACN,kBAAkB,CAAC;CACrB;CAEF,MAAM,2BAA2B,gCAAgC,eAAe;CAQhF,IAAI,kBAAkB,eAAe,WAAW,SAAS,GAAG;EAC1D,MAAM,WAAW,0BAA0B,KAAK;EAChD,MAAM,QAAQ,IAAI,IAAY,QAAQ;EACtC,IAAI,SAAS,UACX,KAAK,MAAM,MAAM,kBAAkB,MAAM,IAAI,EAAE;EAEjD,MAAM,UAAU,eAAe,WAAW,QAAQ,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;EACvE,IAAI,QAAQ,SAAS,GACnB,OAAO,MACL,uBACE,sBAAsB;GACpB,GAAG,UAAU,WAAW,aAAa;GACrC;GACA,UAAU,CAAC,GAAG,QAAQ,EAAE,KAAK;EAC/B,CAAC,CACH,CACF;CAEJ;CAUA,IACE,SAAS,YACT,eAAe,KAAA,KACf,CAAC,MAAM,MAAM,IAAI,UAAU,KAC3B,eAAe,cACf;EACA,MAAM,QAAkB,CAAC;EACzB,IAAI,MAAM,MAAM,IAAI,YAAY,GAC9B,MAAM,KACJ,kGACA,4EACA,6EACA,2DACF;OAEA,MAAM,KACJ,4EACA,6EACA,2DACF;EAEF,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SACE;GACF;EACF,CAAC;EACD,OAAO,GAAG;GACR,IAAI;GACJ;GACA,YAAY,CAAC;GACb,YAAY;GACZ;GACA,SAAS,GAAG,QAAQ,OAAO;GAC3B;GACA;GACA;GACA,GAAI,WAAW,SAAS,IAAI,EAAE,MAAM,WAAW,IAAI,CAAC;EACtD,CAAC;CACH;CAEA,IAAI,SAAS,YAAY,eAAe,KAAA,GACtC,YAAY,KAAK;EACf,MAAM;EACN,UAAU;EACV,SAAS;EACT,OAAO,CAAC,uDAAuD;CACjE,CAAC;CAMH,IACE,cACA,iBAAiB,uBACjB,CAAC,MAAM,MAAM,IAAI,YAAY,KAC7B,eAAe,cAEf,YAAY,KAAK;EACf,MAAM;EACN,UAAU;EACV,SAAS;EACT,OAAO,CAAC,mFAAmF;CAC7F,CAAC;CAGH,IAAI,CAAC,YACH,OAAO,GAAG;EACR,IAAI;EACJ;EACA,YAAY,CAAC;EACb,YAAY;EACZ;EACA,SAAS,GAAG,QAAQ,OAAO;EAC3B;EACA,GAAG,UAAU,cAAc,UAAU;EACrC;EACA,GAAI,WAAW,SAAS,IAAI,EAAE,MAAM,WAAW,IAAI,CAAC;EACpD;EACA;EACA,UAAU;CACZ,CAAC;CAGH,MAAM,QAAQ,oBAAoB,OAAO,YAAY,UAAU;CAE/D,IAAI,CAAC,OACH,OAAO,MACL,aAAa,wCAAwC;EACnD,KAAK,gBAAgB,oBAAoB,aAAa;EACtD,KAAK;CACP,CAAC,CACH;CAGF,MAAM,eAAe,mBAAmB,OAAO,YAAY,cAAc,YAAY,IAAI;CACzF,MAAM,UAAU,sBAAsB,OAAO,SAAS,MAAM,YAAY,YAAY;CAEpF,MAAM,eAAe,aAAa,QAAQ,MAAM,EAAE,WAAW,SAAS,EAAE;CACxE,MAAM,eAAe,aAAa,QAAQ,MAAM,EAAE,WAAW,SAAS,EAAE;CAExE,IAAI;CACJ,IAAI;CACJ,IAAI,oCAAoB,IAAI,IAAY;CACxC,IAAI,SAAS,UAAU;EAMrB,MAAM,YAAY,IAAI,IAAI,gBAAgB;EAC1C,oBAAoB,IAAI,IAAI,mBAAmB,QAAQ,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC;EACjF,oBAAoB,mBAAmB,QAAQ,OAAO,UAAU,IAAI,EAAE,CAAC;EACvE,oBAAoB,CAAC,GAAG,iBAAiB,EAAE,KAAK;CAClD;CAMA,MAAM,mBAAmB,kBAAkB,OAAO;CAClD,MAAM,cAAc,CAAC,GAAG,iBAAiB,EAAE,KAAK,EAAE,KAAK,IAAI;CAE3D,IAAI;CACJ,IAAI,SAAS,UACX,IAAI,eAAe,KAAA,KAAa,CAAC,MAAM,MAAM,IAAI,UAAU,KAAK,eAAe,cAC7E,UAAU,GAAG,QAAQ,OAAO;MACvB,IAAI,iBAAiB,iBAAiB,eAAe,KAAA,GAAW;EACrE,MAAM,WAAW,qBAAqB,OAAO,YAAY,eAAe,aAAa;EACrF,UAAU,mBAAmB,GAAG,SAAS,2BAA2B,gBAAgB;CACtF,OAAO,IAAI,iBAAiB,KAAK,CAAC,kBAChC,UAAU,2BAA2B,aAAa,YAAY,iBAAiB,IAAI,MAAM,GAAG;MACvF,IAAI,iBAAiB,KAAK,kBAC/B,UAAU,yBAAyB,YAAY,mCAAmC,iBAAiB,QAAQ;MACtG,IAAI,eAAe,KAAA,GACxB,UAAU,GAAG,aAAa;MAE1B,UAAU,GAAG,aAAa;MAG5B,UAAU,GAAG,QAAQ,OAAO;CAG9B,IAAI;CACJ,IAAI,qBAAqB;CACzB,IAAI,SAAS,UAAU;EAErB,MAAM,UAAU,qBAAqB,OADlB,cAAc,qBACuB,YAAY;GAClE,GAAG,UAAU,WAAW,aAAa;GACrC,UAAU;EACZ,CAAC;EACD,IAAI,QAAQ,SAAS,MACnB,eAAe,qBAAqB,QAAQ,QAAQ;OAC/C,IAAI,QAAQ,SAAS,iBAC1B,OAAO,MACL,uBACE,qBAAqB;GACnB,GAAG,UAAU,WAAW,aAAa;GACrC,UAAU,CAAC,GAAG,iBAAiB,EAAE,KAAK;GACtC,SAAS,QAAQ;GACjB,gBAAgB,QAAQ,eAAe,IAAI,gBAAgB;EAC7D,CAAC,CACH,CACF;OAOA,qBAAqB;CAEzB;CAEA,IAAI,SAAS;MACP,eAAe,KAAA,KAAa,CAAC,MAAM,MAAM,IAAI,UAAU,KAAK,eAAe,cAC7E,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO,CAAC,+EAA+E;EACzF,CAAC;OACI,IAAI,eAAe,GACxB,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS,GAAG,aAAa;GACzB,OAAO,CAAC,uDAAuD;EACjE,CAAC;OACI,IAAI,kBACT,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS,kCAAkC;GAC3C,OAAO,CACL,iCAAiC,iBAAiB,QAAQ,sDAC5D;EACF,CAAC;OACI,IAAI,CAAC,oBACV,YAAY,KAAK;GACf,MAAM;GACN,UAAU;GACV,SAAS;GACT,OAAO,CAAC;EACV,CAAC;CAAA;CA0BL,OAAO,GAAG;EArBR,IAAI;EACJ;EACA,YAAY;EACZ;EACA;EACA;EACA;EACA,GAAG,UAAU,cAAc,UAAU;EACrC;EACA,GAAG,UAAU,qBAAqB,iBAAiB;EACnD,GAAG,UAAU,qBAAqB,iBAAiB;EACnD,GAAI,WAAW,SAAS,IAAI,EAAE,MAAM,WAAW,IAAI,CAAC;EACpD,GAAG,UAAU,gBAAgB,YAAY;EACzC;EACA;EACA;EACA,GAAG,UAAU,iBAAiB,aAAa;EAC3C,GAAG,UAAU,iBAAiB,aAAa;EAC3C,QAAQ;EACR,GAAG,UAAU,4BAA4B,wBAAwB;CAEpD,CAAC;AAClB;AAEA,SAAgB,+BAAwC;CACtD,MAAM,UAAU,IAAI,QAAQ,QAAQ;CACpC,uBACE,SACA,0CACA,2PAIF;CACA,mBAAmB,SAAS,CAC1B,mDACA,iEACF,CAAC;CACD,kBAAkB,SAAS;EACzB;GAAE,MAAM;GAAiB,UAAU;EAAkC;EACrE;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,OACC,mBACA,2FACF,EACC,OACC,qBACA,yGACF,EACC,OAAO,OAAO,YAAoC;EACjD,MAAM,QAAQ,uBAAuB,OAAO;EAC5C,MAAM,KAAK,iBAAiB,KAAK;EAIjC,MAAM,WAAW,aAAa,MAFT,8BAA8B,SAAS,OAAO,EAAE,GAE/B,OAAO,KAAK,iBAAiB;GACjE,IAAI,MAAM,MAAM;IACd,MAAM,EACJ,OAAO,QACP,SAAS,UACT,cAAc,eACd,eAAe,gBACf,eAAe,gBACf,UAAU,WACV,GAAG,eACD;IACJ,GAAG,OAAO,KAAK,UAAU,YAAY,MAAM,CAAC,CAAC;GAC/C,OAAO,IAAI,CAAC,MAAM,OAAO;IACvB,MAAM,WAAW,MAAM,UAAU;IAEjC,IAAI,aAAa,OAAO;KACtB,MAAM,cAAc,4BAA4B;MAC9C,OAAO,aAAa;MACpB,MAAM,aAAa;MACnB,YAAY,aAAa;MACzB,cAAc,aAAa;MAC3B,MAAM,aAAa;MACnB,eAAe,aAAa;MAC5B,eAAe,aAAa;MAC5B,cAAc,aAAa;KAC7B,CAAC;KAED,MAAM,gBAAgB,aAAa,WAC/B,YAAY,QACZ,wBAAwB,YAAY,OAAO,YAAY,aAAa;KACxE,MAAM,eAAe,cAAc,aAAa,IAAI,EAAE,SAAS,EAAE,IAAI,KAAA;KACrE,MAAM,gBAAgB;MACpB,GAAG,YAAY;MACf;MACA,GAAG,UAAU,gBAAgB,YAAY;KAC3C;KACA,MAAM,cAAc,cAAc,OAAO,eAAe,aAAa;KACrE,GAAG,IAAI,WAAW;KAClB,IAAI,aAAa,SAAS,UACxB,GAAG,IAAI,aAAa,QAAQ,CAAC;IAEjC;IACA,GAAG,IAAI,EAAE;IACT,GAAG,IAAI,oBAAoB,cAAc,QAAQ,CAAC;GACpD;EACF,CAAC;EAED,QAAQ,KAAK,QAAQ;CACvB,CAAC;CAEH,OAAO;AACT;AAEA,SAAS,aAAa,UAA2B;CAC/C,MAAM,KAAK,IAA2B,MAAe,WAAW,GAAG,CAAC,IAAI;CAMxE,OAAO,EAAE,KAAK;EAJZ,GAAG,EAAE,MAAM,GAAG,EAAE;EAChB,GAAG,EAAE,QAAQ,GAAG,EAAE;EAClB,GAAG,EAAE,SAAS,GAAG,EAAE;CAEH,EAAE,KAAK,IAAI,CAAC;AAChC;AAEA,SAAgB,oBAAoB,QAA+B,UAA2B;CAC5F,MAAM,KAAK,IAA2B,MAAe,WAAW,GAAG,CAAC,IAAI;CACxE,MAAM,QAAkB,CAAC;CAEzB,MAAM,aAAa,OAAO,WAAW,MAAM,MAAM,EAAE,WAAW,SAAS;CACvE,MAAM,eAAe,OAAO,WAAW,QAAQ,MAAM,EAAE,WAAW,SAAS,EAAE;CAE7E,MAAM,cAAc,OAAO,aAAa,MAAM,MAAM,EAAE,aAAa,MAAM,KAAK;CAI9E,MAAM,sBACJ,OAAO,aAAa,MAAM,MAAM,EAAE,SAAS,8BAA8B,KAAK;CAEhF,IAAI,OAAO,SAAS,UAClB,IAAI,cAAc,aAChB,MAAM,KAAK,GAAG,EAAE,QAAQ,GAAG,EAAE,GAAG,OAAO,SAAS;MAC3C,IAAI,iBAAiB,KAAK,CAAC,qBAChC,MAAM,KAAK,GAAG,EAAE,MAAM,GAAG,EAAE,GAAG,OAAO,SAAS;MAE9C,MAAM,KAAK,GAAG,EAAE,QAAQ,GAAG,EAAE,GAAG,OAAO,SAAS;MAGlD,MAAM,KAAK,OAAO,OAAO;CAG3B,IAAI,OAAO,mBAAmB,SAAS,GACrC,IAAI,OAAO,sBAAsB,KAAA,KAAa,OAAO,sBAAsB,KAAA,GAAW;EACpF,MAAM,KAAK,GAAG,EAAE,KAAK,WAAW,IAAI,oBAAoB,OAAO,iBAAiB,GAAG;EACnF,MAAM,KAAK,GAAG,EAAE,KAAK,WAAW,IAAI,oBAAoB,OAAO,iBAAiB,GAAG;CACrF,OACE,MAAM,KAAK,GAAG,EAAE,KAAK,WAAW,EAAE,2CAA2C;CAIjF,MAAM,WAAW,OAAO,aAAa,QAAQ,MAAM,EAAE,aAAa,MAAM,KAAK,CAAC;CAC9E,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,KAAK,GAAG,EAAE,QAAQ,GAAG,EAAE,GAAG,KAAK,SAAS;EAC9C,KAAK,MAAM,QAAQ,KAAK,OACtB,MAAM,KAAK,KAAK,EAAE,KAAK,IAAI,GAAG;CAElC;CAMA,IAAI,OAAO,QAAQ,MAAM,MAAM,EAAE,SAAS,WAAW,GAAG;EACtD,MAAM,QAAQ,OAAO,4BAA4B;EACjD,MAAM,KAAK,EAAE;EACb,MAAM,KAAK,EAAE,KAAK,QAAQ,CAAC;EAC3B,KAAK,MAAM,SAAS,OAAO,QACzB,MAAM,KAAK,gBAAgB,OAAO,CAAC,CAAC;EAEtC,IAAI,QAAQ,GAAG;GACb,MAAM,KAAK,EAAE;GACb,MAAM,KACJ,GAAG,EAAE,QAAQ,GAAG,EAAE,GAAG,MAAM,+BAA+B,OAAO,OAAO,OAAO,+CACjF;EACF;CACF;CAEA,OAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,gBACP,OACA,GACQ;CACR,MAAM,eAAe;EACnB,IAAI,MAAM,WAAW,gBAAgB,MAAM,WAAW,aAAa,OAAO,EAAE,MAAM,GAAG;EACrF,IAAI,MAAM,WAAW,WAAW,OAAO,EAAE,QAAQ,GAAG;EACpD,IAAI,MAAM,WAAW,iBAAiB,MAAM,WAAW,iBAAiB,OAAO,EAAE,SAAS,GAAG;EAC7F,OAAO;CACT,GAAG;CACH,MAAM,MAAM,MAAM,SAAS,QAAQ,UAAU;CAC7C,MAAM,OAAO,MAAM,SAAS,MAAM,GAAG,CAAC;CACtC,MAAM,SACJ,MAAM,eAAe,KAAA,IACjB,cACA,MAAM,eAAe,OACnB,gBACA,MAAM,WAAW,MAAM,GAAG,CAAC;CACnC,MAAM,UACJ,MAAM,iBAAiB,KAAA,IACnB,KACA,MAAM,iBAAiB,IACrB,EAAE,KAAK,eAAe,IACtB,EAAE,QAAQ,KAAK,MAAM,aAAa,UAAU;CACpD,OAAO,KAAK,MAAM,GAAG,EAAE,KAAK,GAAG,EAAE,GAAG,MAAM,QAAQ,UAAU,EAAE,KAAK,IAAI,EAAE,WAAW,EAAE,KAAK,MAAM,IAAI;AACvG;AAEA,SAAS,oBAAoB,KAAgC;CAC3D,OAAO,IAAI,WAAW,IAAI,WAAW,IAAI,KAAK,IAAI;AACpD;AAEA,SAAS,qBACP,OACA,YACA,SACA,SACQ;CACR,IAAI,eAAe,SAAS,OAAO,WAAW,QAAQ;CAEtD,MAAM,YAAY,SAAS,OAAO,YAAY,OAAO;CACrD,IAAI,WAAW,OAAO,GAAG,UAAU,OAAO,4BAA4B,QAAQ;CAE9E,MAAM,cAAc,SAAS,OAAO,SAAS,UAAU;CACvD,IAAI,aAAa,OAAO,GAAG,YAAY,OAAO,8BAA8B,QAAQ;CAEpF,OAAO,4CAA4C,QAAQ;AAC7D"}

package/dist/commands/ref.d.mts

@@ -1,4 +1,4 @@
-import { t as CliStructuredError } from "../cli-errors-Czmx92Zy.mjs";
+import { N as CliStructuredError } from "../types-Ci7TndCS.mjs";
 import { Command } from "commander";
 import { Result } from "@prisma-next/utils/result";
 import { RefEntry } from "@prisma-next/migration-tools/refs";

package/dist/commands/ref.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"ref.d.mts","names":[],"sources":["../../src/commands/ref.ts"],"mappings":";;;;;;UA+BU,YAAA;EAAA,SACC,EAAA;EAAA,SACA,GAAA;EAAA,SACA,IAAA;EAAA,SACA,UAAA;AAAA;AAAA,UAGD,eAAA;EAAA,SACC,EAAA;EAAA,SACA,GAAA;EAAA,SACA,OAAA;AAAA;AAAA,UAGD,aAAA;EAAA,SACC,EAAA;EAAA,SACA,IAAA,EAAM,MAAA,SAAe,QAAA;AAAA;AAAA,iBAiBV,oBAAA,CACpB,IAAA,UACA,aAAA,UACA,OAAA;EAAW,MAAA;AAAA,IACV,OAAA,CAAQ,MAAA,CAAO,YAAA,EAAc,kBAAA;AAAA,iBA+BV,uBAAA,CACpB,IAAA,UACA,OAAA;EAAW,MAAA;AAAA,IACV,OAAA,CAAQ,MAAA,CAAO,eAAA,EAAiB,kBAAA;AAAA,iBAYb,qBAAA,CAAsB,OAAA;EAC1C,MAAA;AAAA,IACE,OAAA,CAAQ,MAAA,CAAO,aAAA,EAAe,kBAAA;AAAA,iBAyGlB,gBAAA,CAAA,GAAoB,OAAA"}
+{"version":3,"file":"ref.d.mts","names":[],"sources":["../../src/commands/ref.ts"],"mappings":";;;;;;UAwCU,YAAA;EAAA,SACC,EAAA;EAAA,SACA,GAAA;EAAA,SACA,IAAA;EAAA,SACA,UAAA;AAAA;AAAA,UAGD,eAAA;EAAA,SACC,EAAA;EAAA,SACA,GAAA;EAAA,SACA,OAAA;AAAA;AAAA,UAGD,aAAA;EAAA,SACC,EAAA;EAAA,SACA,IAAA,EAAM,MAAM,SAAS,QAAA;AAAA;AAAA,iBAiBV,oBAAA,CACpB,IAAA,UACA,aAAA,UACA,OAAA;EAAW,MAAA;AAAA,IACV,OAAA,CAAQ,MAAA,CAAO,YAAA,EAAc,kBAAA;AAAA,iBAmEV,uBAAA,CACpB,IAAA,UACA,OAAA;EAAW,MAAA;AAAA,IACV,OAAA,CAAQ,MAAA,CAAO,eAAA,EAAiB,kBAAA;AAAA,iBAYb,qBAAA,CAAsB,OAAA;EAC1C,MAAA;AAAA,IACE,OAAA,CAAQ,MAAA,CAAO,aAAA,EAAe,kBAAA;AAAA,iBAyGlB,gBAAA,CAAA,GAAoB,OAAO"}