@prisma-next/migration-tools 0.11.0-dev.47 → 0.11.0-dev.49

package/dist/exports/aggregate.d.mts

@@ -1,9 +1,9 @@
-import { n as OnDiskMigrationPackage } from "../package-Ca-J_z_0.mjs";
-import { n as RefLoadProblem, r as Refs } from "../refs-B33AsTjk.mjs";
-import { t as ContractSpaceHeadRecord } from "../verify-contract-spaces-BdysZdQk.mjs";
-import { n as MigrationGraph } from "../graph-3dLMZp5l.mjs";
-import { t as PackageLoadProblem } from "../io-BH4G3F-i.mjs";
-import { t as PathDecision } from "../migration-graph-CWEM2SLR.mjs";
+import { n as OnDiskMigrationPackage } from "../package-DIttKL7X.mjs";
+import { n as RefLoadProblem, r as Refs } from "../refs-C8f2IGM8.mjs";
+import { t as ContractSpaceHeadRecord } from "../verify-contract-spaces-T0aiJlBS.mjs";
+import { n as MigrationGraph } from "../graph-BUZuUeBC.mjs";
+import { t as PackageLoadProblem } from "../io-nqFXSSTN.mjs";
+import { t as PathDecision } from "../migration-graph-DtNT-cqc.mjs";
 import { ControlFamilyInstance, MigrationOperationPolicy, MigrationPlan, MigrationPlanOperation, MigrationPlannerConflict, TargetMigrationsCapability } from "@prisma-next/framework-components/control";
 import { Result } from "@prisma-next/utils/result";
 import { Contract } from "@prisma-next/contract/types";

package/dist/exports/aggregate.mjs

@@ -4,7 +4,7 @@ import { t as EMPTY_CONTRACT_HASH } from "../constants-DWV9_o2Z.mjs";
 import { l as reconstructGraph, o as findPathWithDecision } from "../migration-graph-kGBkIZDa.mjs";
 import { a as readRefsTolerant, t as HEAD_REF_NAME } from "../refs-BBKNL45K.mjs";
 import { c as spaceMigrationDirectory, i as RESERVED_SPACE_SUBDIR_NAMES, l as spaceRefsDirectory, r as APP_SPACE_ID, s as isValidSpaceId, t as listContractSpaceDirectories } from "../verify-contract-spaces-BJX5gqtD.mjs";
-import { n as readContractSpaceHeadRef, t as readContractSpaceContract } from "../read-contract-space-contract-7-OB-ykY.mjs";
+import { n as readContractSpaceHeadRef, t as readContractSpaceContract } from "../read-contract-space-contract-BS5Oxbgw.mjs";
 import { notOk, ok } from "@prisma-next/utils/result";
 //#region src/aggregate/aggregate.ts
 /**

package/dist/exports/enumerate-migration-spaces.d.mts

@@ -1,4 +1,4 @@
-import { r as MigrationSpaceListEntry } from "../migration-list-types-0YjFETIv.mjs";
+import { r as MigrationSpaceListEntry } from "../migration-list-types-BRTuXR8i.mjs";
 
 //#region src/enumerate-migration-spaces.d.ts
 /**

package/dist/exports/graph.d.mts

@@ -1,2 +1,2 @@
-import { n as MigrationGraph, t as MigrationEdge } from "../graph-3dLMZp5l.mjs";
+import { n as MigrationGraph, t as MigrationEdge } from "../graph-BUZuUeBC.mjs";
 export { type MigrationEdge, type MigrationGraph };

package/dist/exports/hash.d.mts

@@ -1,5 +1,5 @@
-import { n as OnDiskMigrationPackage, t as MigrationOps } from "../package-Ca-J_z_0.mjs";
-import { t as MigrationMetadata } from "../metadata-CGkJF4L6.mjs";
+import { n as OnDiskMigrationPackage, t as MigrationOps } from "../package-DIttKL7X.mjs";
+import { t as MigrationMetadata } from "../metadata-Bp9X04gM.mjs";
 
 //#region src/hash.d.ts
 interface VerifyResult {

package/dist/exports/invariants.d.mts

@@ -1,4 +1,4 @@
-import { t as MigrationOps } from "../package-Ca-J_z_0.mjs";
+import { t as MigrationOps } from "../package-DIttKL7X.mjs";
 
 //#region src/invariants.d.ts
 /**

package/dist/exports/io.d.mts

@@ -1,2 +1,2 @@
-import { a as materialiseExtensionMigrationPackageIfMissing, c as readMigrationsDir, d as writeMigrationPackage, i as formatMigrationDirName, l as writeMigrationMetadata, n as ReadMigrationsDirResult, o as materialiseMigrationPackage, r as copyFilesWithRename, s as readMigrationPackage, t as PackageLoadProblem, u as writeMigrationOps } from "../io-BH4G3F-i.mjs";
+import { a as materialiseExtensionMigrationPackageIfMissing, c as readMigrationsDir, d as writeMigrationPackage, i as formatMigrationDirName, l as writeMigrationMetadata, n as ReadMigrationsDirResult, o as materialiseMigrationPackage, r as copyFilesWithRename, s as readMigrationPackage, t as PackageLoadProblem, u as writeMigrationOps } from "../io-nqFXSSTN.mjs";
 export { type PackageLoadProblem, type ReadMigrationsDirResult, copyFilesWithRename, formatMigrationDirName, materialiseExtensionMigrationPackageIfMissing, materialiseMigrationPackage, readMigrationPackage, readMigrationsDir, writeMigrationMetadata, writeMigrationOps, writeMigrationPackage };

package/dist/exports/metadata.d.mts

@@ -1,2 +1,2 @@
-import { t as MigrationMetadata } from "../metadata-CGkJF4L6.mjs";
+import { t as MigrationMetadata } from "../metadata-Bp9X04gM.mjs";
 export { type MigrationMetadata };

package/dist/exports/migration-graph.d.mts

@@ -1,5 +1,5 @@
-import { n as MigrationGraph } from "../graph-3dLMZp5l.mjs";
-import { a as findLeaf, c as findPathWithInvariants, i as findLatestMigration, l as findReachableLeaves, n as detectCycles, o as findPath, r as detectOrphans, s as findPathWithDecision, t as PathDecision, u as reconstructGraph } from "../migration-graph-CWEM2SLR.mjs";
+import { n as MigrationGraph } from "../graph-BUZuUeBC.mjs";
+import { a as findLeaf, c as findPathWithInvariants, i as findLatestMigration, l as findReachableLeaves, n as detectCycles, o as findPath, r as detectOrphans, s as findPathWithDecision, t as PathDecision, u as reconstructGraph } from "../migration-graph-DtNT-cqc.mjs";
 
 //#region src/graph-membership.d.ts
 declare function isGraphNode(hash: string, graph: MigrationGraph): boolean;

package/dist/exports/migration-list-graph-topology.d.mts

@@ -1,2 +1,13 @@
-import { n as MigrationGraphTopology, r as classifyMigrationListGraphTopology, t as EdgeKind } from "../migration-list-graph-topology-Be1d8Y89.mjs";
-export { type EdgeKind, type MigrationGraphTopology, classifyMigrationListGraphTopology };
+import { t as MigrationListEntry } from "../migration-list-types-BRTuXR8i.mjs";
+
+//#region src/migration-list-graph-topology.d.ts
+type MigrationEdgeKind = 'forward' | 'rollback' | 'self';
+interface MigrationListGraphTopology {
+  readonly kindByMigrationHash: ReadonlyMap<string, MigrationEdgeKind>;
+  readonly forwardInDegree: ReadonlyMap<string, number>;
+  readonly forwardOutDegree: ReadonlyMap<string, number>;
+}
+declare function classifyMigrationListGraphTopology(entries: readonly MigrationListEntry[]): MigrationListGraphTopology;
+//#endregion
+export { type MigrationEdgeKind, type MigrationListGraphTopology, classifyMigrationListGraphTopology };
+//# sourceMappingURL=migration-list-graph-topology.d.mts.map

package/dist/exports/migration-list-graph-topology.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"migration-list-graph-topology.d.mts","names":[],"sources":["../../src/migration-list-graph-topology.ts"],"mappings":";;;KAGY,iBAAA;AAAA,UAEK,0BAAA;EAAA,SACN,mBAAA,EAAqB,WAAA,SAAoB,iBAAA;EAAA,SACzC,eAAA,EAAiB,WAAA;EAAA,SACjB,gBAAA,EAAkB,WAAA;AAAA;AAAA,iBAqBb,kCAAA,CACd,OAAA,WAAkB,kBAAA,KACjB,0BAA0B"}

package/dist/exports/migration-list-graph-topology.mjs

@@ -1,2 +1,105 @@
-import { t as classifyMigrationListGraphTopology } from "../migration-list-graph-topology-BtFzbZ9L.mjs";
+import "../constants-DWV9_o2Z.mjs";
+//#region src/migration-list-graph-topology.ts
+function canonicalFrom(from) {
+	return from ?? "sha256:empty";
+}
+function compareDirNameDesc(a, b) {
+	return b.dirName.localeCompare(a.dirName);
+}
+function bumpDegree(map, key) {
+	map.set(key, (map.get(key) ?? 0) + 1);
+}
+function classifyMigrationListGraphTopology(entries) {
+	const nodes = /* @__PURE__ */ new Set();
+	const kindByMigrationHash = /* @__PURE__ */ new Map();
+	const outgoingByFrom = /* @__PURE__ */ new Map();
+	for (const entry of entries) {
+		const from = canonicalFrom(entry.from);
+		const to = entry.to;
+		nodes.add(from);
+		nodes.add(to);
+		if (from === to) {
+			kindByMigrationHash.set(entry.migrationHash, "self");
+			continue;
+		}
+		const bucket = outgoingByFrom.get(from);
+		const edge = {
+			entry,
+			from,
+			to
+		};
+		if (bucket) bucket.push(edge);
+		else outgoingByFrom.set(from, [edge]);
+	}
+	for (const bucket of outgoingByFrom.values()) bucket.sort((a, b) => compareDirNameDesc(a.entry, b.entry));
+	const nonSelfInDegree = /* @__PURE__ */ new Map();
+	for (const node of nodes) nonSelfInDegree.set(node, 0);
+	for (const bucket of outgoingByFrom.values()) for (const edge of bucket) bumpDegree(nonSelfInDegree, edge.to);
+	const dfsRoots = [];
+	for (const node of nodes) if ((nonSelfInDegree.get(node) ?? 0) === 0) dfsRoots.push(node);
+	dfsRoots.sort((a, b) => {
+		if (a === "sha256:empty") return -1;
+		if (b === "sha256:empty") return 1;
+		return a.localeCompare(b);
+	});
+	if (dfsRoots.length === 0) dfsRoots.push(...[...nodes].sort((a, b) => a.localeCompare(b)));
+	const WHITE = 0;
+	const GRAY = 1;
+	const BLACK = 2;
+	const color = /* @__PURE__ */ new Map();
+	for (const node of nodes) color.set(node, WHITE);
+	const stack = [];
+	function pushFrame(node) {
+		color.set(node, GRAY);
+		stack.push({
+			node,
+			outgoing: outgoingByFrom.get(node) ?? [],
+			index: 0
+		});
+	}
+	function runDfsFrom(root) {
+		if (color.get(root) !== WHITE) return;
+		pushFrame(root);
+		while (stack.length > 0) {
+			const frame = stack[stack.length - 1];
+			if (frame === void 0) break;
+			if (frame.index >= frame.outgoing.length) {
+				color.set(frame.node, BLACK);
+				stack.pop();
+				continue;
+			}
+			const edge = frame.outgoing[frame.index];
+			frame.index += 1;
+			if (edge === void 0) continue;
+			const v = edge.to;
+			const vColor = color.get(v);
+			if (vColor === GRAY) kindByMigrationHash.set(edge.entry.migrationHash, "rollback");
+			else {
+				kindByMigrationHash.set(edge.entry.migrationHash, "forward");
+				if (vColor === WHITE) pushFrame(v);
+			}
+		}
+	}
+	for (const root of dfsRoots) runDfsFrom(root);
+	const remainingWhite = [...nodes].filter((node) => color.get(node) === WHITE);
+	remainingWhite.sort((a, b) => a.localeCompare(b));
+	for (const root of remainingWhite) runDfsFrom(root);
+	const forwardInDegree = /* @__PURE__ */ new Map();
+	const forwardOutDegree = /* @__PURE__ */ new Map();
+	for (const entry of entries) {
+		if (kindByMigrationHash.get(entry.migrationHash) !== "forward") continue;
+		const from = canonicalFrom(entry.from);
+		const to = entry.to;
+		bumpDegree(forwardOutDegree, from);
+		bumpDegree(forwardInDegree, to);
+	}
+	return {
+		kindByMigrationHash,
+		forwardInDegree,
+		forwardOutDegree
+	};
+}
+//#endregion
 export { classifyMigrationListGraphTopology };
+
+//# sourceMappingURL=migration-list-graph-topology.mjs.map

package/dist/exports/migration-list-graph-topology.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"migration-list-graph-topology.mjs","names":[],"sources":["../../src/migration-list-graph-topology.ts"],"sourcesContent":["import { EMPTY_CONTRACT_HASH } from './constants';\nimport type { MigrationListEntry } from './migration-list-types';\n\nexport type MigrationEdgeKind = 'forward' | 'rollback' | 'self';\n\nexport interface MigrationListGraphTopology {\n  readonly kindByMigrationHash: ReadonlyMap<string, MigrationEdgeKind>;\n  readonly forwardInDegree: ReadonlyMap<string, number>;\n  readonly forwardOutDegree: ReadonlyMap<string, number>;\n}\n\ninterface NonSelfEdge {\n  readonly entry: MigrationListEntry;\n  readonly from: string;\n  readonly to: string;\n}\n\nfunction canonicalFrom(from: string | null): string {\n  return from ?? EMPTY_CONTRACT_HASH;\n}\n\nfunction compareDirNameDesc(a: MigrationListEntry, b: MigrationListEntry): number {\n  return b.dirName.localeCompare(a.dirName);\n}\n\nfunction bumpDegree(map: Map<string, number>, key: string): void {\n  map.set(key, (map.get(key) ?? 0) + 1);\n}\n\nexport function classifyMigrationListGraphTopology(\n  entries: readonly MigrationListEntry[],\n): MigrationListGraphTopology {\n  const nodes = new Set<string>();\n  const kindByMigrationHash = new Map<string, MigrationEdgeKind>();\n  const outgoingByFrom = new Map<string, NonSelfEdge[]>();\n\n  for (const entry of entries) {\n    const from = canonicalFrom(entry.from);\n    const to = entry.to;\n    nodes.add(from);\n    nodes.add(to);\n\n    if (from === to) {\n      kindByMigrationHash.set(entry.migrationHash, 'self');\n      continue;\n    }\n\n    const bucket = outgoingByFrom.get(from);\n    const edge: NonSelfEdge = { entry, from, to };\n    if (bucket) bucket.push(edge);\n    else outgoingByFrom.set(from, [edge]);\n  }\n\n  for (const bucket of outgoingByFrom.values()) {\n    bucket.sort((a, b) => compareDirNameDesc(a.entry, b.entry));\n  }\n\n  const nonSelfInDegree = new Map<string, number>();\n  for (const node of nodes) {\n    nonSelfInDegree.set(node, 0);\n  }\n  for (const bucket of outgoingByFrom.values()) {\n    for (const edge of bucket) {\n      bumpDegree(nonSelfInDegree, edge.to);\n    }\n  }\n\n  const dfsRoots: string[] = [];\n  for (const node of nodes) {\n    if ((nonSelfInDegree.get(node) ?? 0) === 0) {\n      dfsRoots.push(node);\n    }\n  }\n  dfsRoots.sort((a, b) => {\n    if (a === EMPTY_CONTRACT_HASH) return -1;\n    if (b === EMPTY_CONTRACT_HASH) return 1;\n    return a.localeCompare(b);\n  });\n  if (dfsRoots.length === 0) {\n    dfsRoots.push(...[...nodes].sort((a, b) => a.localeCompare(b)));\n  }\n\n  const WHITE = 0;\n  const GRAY = 1;\n  const BLACK = 2;\n  const color = new Map<string, number>();\n  for (const node of nodes) {\n    color.set(node, WHITE);\n  }\n\n  interface Frame {\n    node: string;\n    outgoing: readonly NonSelfEdge[];\n    index: number;\n  }\n  const stack: Frame[] = [];\n\n  function pushFrame(node: string): void {\n    color.set(node, GRAY);\n    stack.push({ node, outgoing: outgoingByFrom.get(node) ?? [], index: 0 });\n  }\n\n  function runDfsFrom(root: string): void {\n    if (color.get(root) !== WHITE) return;\n    pushFrame(root);\n\n    while (stack.length > 0) {\n      const frame = stack[stack.length - 1];\n      if (frame === undefined) break;\n      if (frame.index >= frame.outgoing.length) {\n        color.set(frame.node, BLACK);\n        stack.pop();\n        continue;\n      }\n\n      const edge = frame.outgoing[frame.index];\n      frame.index += 1;\n      if (edge === undefined) continue;\n\n      const v = edge.to;\n      const vColor = color.get(v);\n      if (vColor === GRAY) {\n        kindByMigrationHash.set(edge.entry.migrationHash, 'rollback');\n      } else {\n        kindByMigrationHash.set(edge.entry.migrationHash, 'forward');\n        if (vColor === WHITE) {\n          pushFrame(v);\n        }\n      }\n    }\n  }\n\n  for (const root of dfsRoots) {\n    runDfsFrom(root);\n  }\n  const remainingWhite = [...nodes].filter((node) => color.get(node) === WHITE);\n  remainingWhite.sort((a, b) => a.localeCompare(b));\n  for (const root of remainingWhite) {\n    runDfsFrom(root);\n  }\n\n  const forwardInDegree = new Map<string, number>();\n  const forwardOutDegree = new Map<string, number>();\n\n  for (const entry of entries) {\n    if (kindByMigrationHash.get(entry.migrationHash) !== 'forward') continue;\n    const from = canonicalFrom(entry.from);\n    const to = entry.to;\n    bumpDegree(forwardOutDegree, from);\n    bumpDegree(forwardInDegree, to);\n  }\n\n  return {\n    kindByMigrationHash,\n    forwardInDegree,\n    forwardOutDegree,\n  };\n}\n"],"mappings":";;AAiBA,SAAS,cAAc,MAA6B;CAClD,OAAO,QAAA;AACT;AAEA,SAAS,mBAAmB,GAAuB,GAA+B;CAChF,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO;AAC1C;AAEA,SAAS,WAAW,KAA0B,KAAmB;CAC/D,IAAI,IAAI,MAAM,IAAI,IAAI,GAAG,KAAK,KAAK,CAAC;AACtC;AAEA,SAAgB,mCACd,SAC4B;CAC5B,MAAM,wBAAQ,IAAI,IAAY;CAC9B,MAAM,sCAAsB,IAAI,IAA+B;CAC/D,MAAM,iCAAiB,IAAI,IAA2B;CAEtD,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,OAAO,cAAc,MAAM,IAAI;EACrC,MAAM,KAAK,MAAM;EACjB,MAAM,IAAI,IAAI;EACd,MAAM,IAAI,EAAE;EAEZ,IAAI,SAAS,IAAI;GACf,oBAAoB,IAAI,MAAM,eAAe,MAAM;GACnD;EACF;EAEA,MAAM,SAAS,eAAe,IAAI,IAAI;EACtC,MAAM,OAAoB;GAAE;GAAO;GAAM;EAAG;EAC5C,IAAI,QAAQ,OAAO,KAAK,IAAI;OACvB,eAAe,IAAI,MAAM,CAAC,IAAI,CAAC;CACtC;CAEA,KAAK,MAAM,UAAU,eAAe,OAAO,GACzC,OAAO,MAAM,GAAG,MAAM,mBAAmB,EAAE,OAAO,EAAE,KAAK,CAAC;CAG5D,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,QAAQ,OACjB,gBAAgB,IAAI,MAAM,CAAC;CAE7B,KAAK,MAAM,UAAU,eAAe,OAAO,GACzC,KAAK,MAAM,QAAQ,QACjB,WAAW,iBAAiB,KAAK,EAAE;CAIvC,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,QAAQ,OACjB,KAAK,gBAAgB,IAAI,IAAI,KAAK,OAAO,GACvC,SAAS,KAAK,IAAI;CAGtB,SAAS,MAAM,GAAG,MAAM;EACtB,IAAI,MAAA,gBAA2B,OAAO;EACtC,IAAI,MAAA,gBAA2B,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;CACD,IAAI,SAAS,WAAW,GACtB,SAAS,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;CAGhE,MAAM,QAAQ;CACd,MAAM,OAAO;CACb,MAAM,QAAQ;CACd,MAAM,wBAAQ,IAAI,IAAoB;CACtC,KAAK,MAAM,QAAQ,OACjB,MAAM,IAAI,MAAM,KAAK;CAQvB,MAAM,QAAiB,CAAC;CAExB,SAAS,UAAU,MAAoB;EACrC,MAAM,IAAI,MAAM,IAAI;EACpB,MAAM,KAAK;GAAE;GAAM,UAAU,eAAe,IAAI,IAAI,KAAK,CAAC;GAAG,OAAO;EAAE,CAAC;CACzE;CAEA,SAAS,WAAW,MAAoB;EACtC,IAAI,MAAM,IAAI,IAAI,MAAM,OAAO;EAC/B,UAAU,IAAI;EAEd,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,QAAQ,MAAM,MAAM,SAAS;GACnC,IAAI,UAAU,KAAA,GAAW;GACzB,IAAI,MAAM,SAAS,MAAM,SAAS,QAAQ;IACxC,MAAM,IAAI,MAAM,MAAM,KAAK;IAC3B,MAAM,IAAI;IACV;GACF;GAEA,MAAM,OAAO,MAAM,SAAS,MAAM;GAClC,MAAM,SAAS;GACf,IAAI,SAAS,KAAA,GAAW;GAExB,MAAM,IAAI,KAAK;GACf,MAAM,SAAS,MAAM,IAAI,CAAC;GAC1B,IAAI,WAAW,MACb,oBAAoB,IAAI,KAAK,MAAM,eAAe,UAAU;QACvD;IACL,oBAAoB,IAAI,KAAK,MAAM,eAAe,SAAS;IAC3D,IAAI,WAAW,OACb,UAAU,CAAC;GAEf;EACF;CACF;CAEA,KAAK,MAAM,QAAQ,UACjB,WAAW,IAAI;CAEjB,MAAM,iBAAiB,CAAC,GAAG,KAAK,EAAE,QAAQ,SAAS,MAAM,IAAI,IAAI,MAAM,KAAK;CAC5E,eAAe,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC;CAChD,KAAK,MAAM,QAAQ,gBACjB,WAAW,IAAI;CAGjB,MAAM,kCAAkB,IAAI,IAAoB;CAChD,MAAM,mCAAmB,IAAI,IAAoB;CAEjD,KAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,oBAAoB,IAAI,MAAM,aAAa,MAAM,WAAW;EAChE,MAAM,OAAO,cAAc,MAAM,IAAI;EACrC,MAAM,KAAK,MAAM;EACjB,WAAW,kBAAkB,IAAI;EACjC,WAAW,iBAAiB,EAAE;CAChC;CAEA,OAAO;EACL;EACA;EACA;CACF;AACF"}

package/dist/exports/migration-list-types.d.mts

@@ -1,2 +1,2 @@
-import { n as MigrationListResult, r as MigrationSpaceListEntry, t as MigrationListEntry } from "../migration-list-types-0YjFETIv.mjs";
+import { n as MigrationListResult, r as MigrationSpaceListEntry, t as MigrationListEntry } from "../migration-list-types-BRTuXR8i.mjs";
 export { type MigrationListEntry, type MigrationListResult, type MigrationSpaceListEntry };

package/dist/exports/migration.d.mts

@@ -1,4 +1,4 @@
-import { t as MigrationMetadata$1 } from "../metadata-CGkJF4L6.mjs";
+import { t as MigrationMetadata$1 } from "../metadata-Bp9X04gM.mjs";
 import { ControlStack, MigrationPlan, MigrationPlanOperation } from "@prisma-next/framework-components/control";
 
 //#region src/migration-base.d.ts

package/dist/exports/package.d.mts

@@ -1,3 +1,3 @@
-import { n as OnDiskMigrationPackage, t as MigrationOps } from "../package-Ca-J_z_0.mjs";
+import { n as OnDiskMigrationPackage, t as MigrationOps } from "../package-DIttKL7X.mjs";
 import { MigrationPackage } from "@prisma-next/framework-components/control";
 export { type MigrationOps, type MigrationPackage, type OnDiskMigrationPackage };

package/dist/exports/ref-resolution.d.mts

@@ -1,5 +1,5 @@
-import { r as Refs } from "../refs-B33AsTjk.mjs";
-import { n as MigrationGraph, t as MigrationEdge } from "../graph-3dLMZp5l.mjs";
+import { r as Refs } from "../refs-C8f2IGM8.mjs";
+import { n as MigrationGraph, t as MigrationEdge } from "../graph-BUZuUeBC.mjs";
 import { Result } from "@prisma-next/utils/result";
 
 //#region src/refs/types.d.ts

package/dist/exports/refs.d.mts

@@ -1,4 +1,4 @@
-import { a as readRef, c as validateRefName, i as deleteRef, l as validateRefValue, o as readRefs, r as Refs, s as resolveRef, t as RefEntry, u as writeRef } from "../refs-B33AsTjk.mjs";
+import { a as readRef, c as validateRefName, i as deleteRef, l as validateRefValue, o as readRefs, r as Refs, s as resolveRef, t as RefEntry, u as writeRef } from "../refs-C8f2IGM8.mjs";
 
 //#region src/refs/snapshot.d.ts
 interface ContractIR {

package/dist/exports/spaces.d.mts

@@ -1,5 +1,5 @@
-import { t as MigrationOps } from "../package-Ca-J_z_0.mjs";
-import { a as VerifyContractSpacesResult, i as VerifyContractSpacesInputs, n as SpaceMarkerRecord, o as listContractSpaceDirectories, r as SpaceVerifierViolation, s as verifyContractSpaces, t as ContractSpaceHeadRecord } from "../verify-contract-spaces-BdysZdQk.mjs";
+import { t as MigrationOps } from "../package-DIttKL7X.mjs";
+import { a as VerifyContractSpacesResult, i as VerifyContractSpacesInputs, n as SpaceMarkerRecord, o as listContractSpaceDirectories, r as SpaceVerifierViolation, s as verifyContractSpaces, t as ContractSpaceHeadRecord } from "../verify-contract-spaces-T0aiJlBS.mjs";
 import { APP_SPACE_ID, ContractSpace, ContractSpaceHeadRef, ContractSpaceHeadRef as ContractSpaceHeadRef$1 } from "@prisma-next/framework-components/control";
 import { Contract } from "@prisma-next/contract/types";
 

package/dist/exports/spaces.mjs

@@ -3,7 +3,7 @@ import { s as readMigrationsDir } from "../io-BHl0amF0.mjs";
 import "../constants-DWV9_o2Z.mjs";
 import { l as reconstructGraph, o as findPathWithDecision } from "../migration-graph-kGBkIZDa.mjs";
 import { a as SPACE_REFS_DIRNAME, c as spaceMigrationDirectory, i as RESERVED_SPACE_SUBDIR_NAMES, l as spaceRefsDirectory, n as verifyContractSpaces, o as assertValidSpaceId, r as APP_SPACE_ID, s as isValidSpaceId, t as listContractSpaceDirectories } from "../verify-contract-spaces-BJX5gqtD.mjs";
-import { n as readContractSpaceHeadRef, t as readContractSpaceContract } from "../read-contract-space-contract-7-OB-ykY.mjs";
+import { n as readContractSpaceHeadRef, t as readContractSpaceContract } from "../read-contract-space-contract-BS5Oxbgw.mjs";
 import { join } from "pathe";
 import { mkdir, writeFile } from "node:fs/promises";
 import { canonicalizeJson } from "@prisma-next/framework-components/utils";

package/dist/{graph-3dLMZp5l.d.mts → graph-BUZuUeBC.d.mts}

@@ -24,4 +24,4 @@ interface MigrationGraph {
 }
 //#endregion
 export { MigrationGraph as n, MigrationEdge as t };
-//# sourceMappingURL=graph-3dLMZp5l.d.mts.map
+//# sourceMappingURL=graph-BUZuUeBC.d.mts.map

package/dist/{graph-3dLMZp5l.d.mts.map → graph-BUZuUeBC.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"graph-3dLMZp5l.d.mts","names":[],"sources":["../src/graph.ts"],"mappings":";;AAIA;;;UAAiB,aAAA;EAAA,SACN,IAAA;EAAA,SACA,EAAA;EAAA,SACA,aAAA;EAAA,SACA,OAAA;EAAA,SACA,SAAA;EAMA;;AAAU;AAGrB;;EAHW,SAAA,UAAA;AAAA;AAAA,UAGM,cAAA;EAAA,SACN,KAAA,EAAO,WAAA;EAAA,SACP,YAAA,EAAc,WAAA,kBAA6B,aAAA;EAAA,SAC3C,YAAA,EAAc,WAAA,kBAA6B,aAAA;EAAA,SAC3C,eAAA,EAAiB,WAAA,SAAoB,aAAA;AAAA"}
+{"version":3,"file":"graph-BUZuUeBC.d.mts","names":[],"sources":["../src/graph.ts"],"mappings":";;AAIA;;;UAAiB,aAAA;EAAA,SACN,IAAA;EAAA,SACA,EAAA;EAAA,SACA,aAAA;EAAA,SACA,OAAA;EAAA,SACA,SAAA;EAMA;;AAAU;AAGrB;;EAHW,SAAA,UAAA;AAAA;AAAA,UAGM,cAAA;EAAA,SACN,KAAA,EAAO,WAAA;EAAA,SACP,YAAA,EAAc,WAAA,kBAA6B,aAAA;EAAA,SAC3C,YAAA,EAAc,WAAA,kBAA6B,aAAA;EAAA,SAC3C,eAAA,EAAiB,WAAA,SAAoB,aAAA;AAAA"}

package/dist/{io-BH4G3F-i.d.mts → io-nqFXSSTN.d.mts}

@@ -1,4 +1,4 @@
-import { n as OnDiskMigrationPackage, t as MigrationOps } from "./package-Ca-J_z_0.mjs";
+import { n as OnDiskMigrationPackage, t as MigrationOps } from "./package-DIttKL7X.mjs";
 import { MigrationMetadata, MigrationPackage } from "@prisma-next/framework-components/control";
 
 //#region src/io.d.ts
@@ -121,4 +121,4 @@ declare function readMigrationsDir(migrationsRoot: string): Promise<ReadMigratio
 declare function formatMigrationDirName(timestamp: Date, slug: string): string;
 //#endregion
 export { materialiseExtensionMigrationPackageIfMissing as a, readMigrationsDir as c, writeMigrationPackage as d, formatMigrationDirName as i, writeMigrationMetadata as l, ReadMigrationsDirResult as n, materialiseMigrationPackage as o, copyFilesWithRename as r, readMigrationPackage as s, PackageLoadProblem as t, writeMigrationOps as u };
-//# sourceMappingURL=io-BH4G3F-i.d.mts.map
+//# sourceMappingURL=io-nqFXSSTN.d.mts.map

package/dist/{io-BH4G3F-i.d.mts.map → io-nqFXSSTN.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"io-BH4G3F-i.d.mts","names":[],"sources":["../src/io.ts"],"mappings":";;;;iBAwCsB,qBAAA,CACpB,GAAA,UACA,QAAA,EAAU,iBAAA,EACV,GAAA,EAAK,YAAA,GACJ,OAAA;AAJH;;;;;;;;;;;;;;;AAIU;AAgDV;;;;;;;;;AAGU;AA2BV;;;;AAlFA,iBAoDsB,2BAAA,CACpB,SAAA,UACA,GAAA,EAAK,gBAAA,GACJ,OAAO;;;;;;AA8BmB;AA6B7B;;;;;;;;;;AAGU;AAUV;;;;iBA7CsB,6CAAA,CACpB,SAAA,UACA,GAAA,EAAK,gBAAA,GACJ,OAAO;EAAA,SAAY,OAAA;AAAA;;;AA6CZ;AAIV;;;;;;;;iBApBsB,mBAAA,CACpB,OAAA,UACA,KAAA;EAAA,SAA2B,UAAA;EAAA,SAA6B,QAAA;AAAA,MACvD,OAAO;AAAA,iBAUY,sBAAA,CACpB,GAAA,UACA,QAAA,EAAU,iBAAA,GACT,OAAO;AAAA,iBAIY,iBAAA,CAAkB,GAAA,UAAa,GAAA,EAAK,YAAA,GAAe,OAAO;AAAA,iBAI1D,oBAAA,CAAqB,GAAA,WAAc,OAAO,CAAC,sBAAA;;;;AAAsB;AAsKvF;;;;;;;;;;;KAAY,kBAAA;EAAA,SAEG,IAAA;EAAA,SACA,OAAA;EAAA,SACA,MAAA;EAAA,SACA,QAAA;AAAA;EAAA,SAEA,IAAA;EAAA,SAA6C,OAAA;AAAA;EAAA,SAC7C,IAAA;EAAA,SAAoC,OAAA;EAAA,SAA0B,MAAA;AAAA;AAa7B;AAShD;;;;;;;;AATgD,UAF/B,uBAAA;EAAA,SACN,QAAA,WAAmB,sBAAA;EAAA,SACnB,QAAA,WAAmB,kBAAkB;AAAA;AAAA,iBAS1B,iBAAA,CAAkB,cAAA,WAAyB,OAAO,CAAC,uBAAA;AAAA,iBAkEzD,sBAAA,CAAuB,SAAA,EAAW,IAAI,EAAE,IAAA"}
+{"version":3,"file":"io-nqFXSSTN.d.mts","names":[],"sources":["../src/io.ts"],"mappings":";;;;iBAwCsB,qBAAA,CACpB,GAAA,UACA,QAAA,EAAU,iBAAA,EACV,GAAA,EAAK,YAAA,GACJ,OAAA;AAJH;;;;;;;;;;;;;;;AAIU;AAgDV;;;;;;;;;AAGU;AA2BV;;;;AAlFA,iBAoDsB,2BAAA,CACpB,SAAA,UACA,GAAA,EAAK,gBAAA,GACJ,OAAO;;;;;;AA8BmB;AA6B7B;;;;;;;;;;AAGU;AAUV;;;;iBA7CsB,6CAAA,CACpB,SAAA,UACA,GAAA,EAAK,gBAAA,GACJ,OAAO;EAAA,SAAY,OAAA;AAAA;;;AA6CZ;AAIV;;;;;;;;iBApBsB,mBAAA,CACpB,OAAA,UACA,KAAA;EAAA,SAA2B,UAAA;EAAA,SAA6B,QAAA;AAAA,MACvD,OAAO;AAAA,iBAUY,sBAAA,CACpB,GAAA,UACA,QAAA,EAAU,iBAAA,GACT,OAAO;AAAA,iBAIY,iBAAA,CAAkB,GAAA,UAAa,GAAA,EAAK,YAAA,GAAe,OAAO;AAAA,iBAI1D,oBAAA,CAAqB,GAAA,WAAc,OAAO,CAAC,sBAAA;;;;AAAsB;AAsKvF;;;;;;;;;;;KAAY,kBAAA;EAAA,SAEG,IAAA;EAAA,SACA,OAAA;EAAA,SACA,MAAA;EAAA,SACA,QAAA;AAAA;EAAA,SAEA,IAAA;EAAA,SAA6C,OAAA;AAAA;EAAA,SAC7C,IAAA;EAAA,SAAoC,OAAA;EAAA,SAA0B,MAAA;AAAA;AAa7B;AAShD;;;;;;;;AATgD,UAF/B,uBAAA;EAAA,SACN,QAAA,WAAmB,sBAAA;EAAA,SACnB,QAAA,WAAmB,kBAAkB;AAAA;AAAA,iBAS1B,iBAAA,CAAkB,cAAA,WAAyB,OAAO,CAAC,uBAAA;AAAA,iBAkEzD,sBAAA,CAAuB,SAAA,EAAW,IAAI,EAAE,IAAA"}

package/dist/{migration-graph-CWEM2SLR.d.mts → migration-graph-DtNT-cqc.d.mts}

@@ -1,5 +1,5 @@
-import { n as OnDiskMigrationPackage } from "./package-Ca-J_z_0.mjs";
-import { n as MigrationGraph, t as MigrationEdge } from "./graph-3dLMZp5l.mjs";
+import { n as OnDiskMigrationPackage } from "./package-DIttKL7X.mjs";
+import { n as MigrationGraph, t as MigrationEdge } from "./graph-BUZuUeBC.mjs";
 
 //#region src/migration-graph.d.ts
 declare function reconstructGraph(packages: readonly OnDiskMigrationPackage[]): MigrationGraph;
@@ -121,4 +121,4 @@ declare function detectCycles(graph: MigrationGraph): readonly string[][];
 declare function detectOrphans(graph: MigrationGraph): readonly MigrationEdge[];
 //#endregion
 export { findLeaf as a, findPathWithInvariants as c, findLatestMigration as i, findReachableLeaves as l, detectCycles as n, findPath as o, detectOrphans as r, findPathWithDecision as s, PathDecision as t, reconstructGraph as u };
-//# sourceMappingURL=migration-graph-CWEM2SLR.d.mts.map
+//# sourceMappingURL=migration-graph-DtNT-cqc.d.mts.map

package/dist/{migration-graph-CWEM2SLR.d.mts.map → migration-graph-DtNT-cqc.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"migration-graph-CWEM2SLR.d.mts","names":[],"sources":["../src/migration-graph.ts"],"mappings":";;;;iBAgCgB,gBAAA,CAAiB,QAAA,WAAmB,sBAAA,KAA2B,cAAc;;AAA7F;;;;;;;iBA+DgB,QAAA,CACd,KAAA,EAAO,cAAA,EACP,QAAA,UACA,MAAA,oBACU,aAAa;AAnEoE;AA+D7F;;;;;;;;;;AAIyB;AA4CzB;;;;;;;AA/G6F,iBA+G7E,sBAAA,CACd,KAAA,EAAO,cAAA,EACP,QAAA,UACA,MAAA,UACA,QAAA,EAAU,WAAA,oBACA,aAAA;AAAA,UAsFK,YAAA;EAAA,SACN,YAAA,WAAuB,aAAa;EAAA,SACpC,QAAA;EAAA,SACA,MAAA;EAAA,SACA,gBAAA;EAAA,SACA,eAAA;EAAA,SACA,OAAA;EA5Fc;EAAA,SA8Fd,kBAAA;EARM;;;;;EAAA,SAcN,mBAAA;AAAA;;;;;;;;AAAmB;AAoB9B;;;;;;;;;KAAY,eAAA;EAAA,SACG,IAAA;EAAA,SAAqB,QAAA,EAAU,YAAA;AAAA;EAAA,SAC/B,IAAA;AAAA;EAAA,SAEA,IAAA;EAAA,SACA,cAAA,WAAyB,aAAa;EAAA,SACtC,OAAA;AAAA;;;;AAYkB;AAajC;;;UAfiB,2BAAA;EAAA,SACN,OAAA;EAAA,SACA,QAAA,GAAW,WAAW;AAAA;;;;;;;;;;AAkBf;iBALF,oBAAA,CACd,KAAA,EAAO,cAAA,EACP,QAAA,UACA,MAAA,UACA,OAAA,GAAS,2BAAA,GACR,eAAA;;;;;iBAqLa,mBAAA,CAAoB,KAAA,EAAO,cAAc,EAAE,QAAA;;;AAAgB;AAkB3E;;;;AAA8C;iBAA9B,QAAA,CAAS,KAAqB,EAAd,cAAc;;;;;;iBAwC9B,mBAAA,CAAoB,KAAA,EAAO,cAAA,GAAiB,aAAa;AAAA,iBAQzD,YAAA,CAAa,KAAqB,EAAd,cAAc;AAAA,iBA8DlC,aAAA,CAAc,KAAA,EAAO,cAAA,YAA0B,aAAa"}
+{"version":3,"file":"migration-graph-DtNT-cqc.d.mts","names":[],"sources":["../src/migration-graph.ts"],"mappings":";;;;iBAgCgB,gBAAA,CAAiB,QAAA,WAAmB,sBAAA,KAA2B,cAAc;;AAA7F;;;;;;;iBA+DgB,QAAA,CACd,KAAA,EAAO,cAAA,EACP,QAAA,UACA,MAAA,oBACU,aAAa;AAnEoE;AA+D7F;;;;;;;;;;AAIyB;AA4CzB;;;;;;;AA/G6F,iBA+G7E,sBAAA,CACd,KAAA,EAAO,cAAA,EACP,QAAA,UACA,MAAA,UACA,QAAA,EAAU,WAAA,oBACA,aAAA;AAAA,UAsFK,YAAA;EAAA,SACN,YAAA,WAAuB,aAAa;EAAA,SACpC,QAAA;EAAA,SACA,MAAA;EAAA,SACA,gBAAA;EAAA,SACA,eAAA;EAAA,SACA,OAAA;EA5Fc;EAAA,SA8Fd,kBAAA;EARM;;;;;EAAA,SAcN,mBAAA;AAAA;;;;;;;;AAAmB;AAoB9B;;;;;;;;;KAAY,eAAA;EAAA,SACG,IAAA;EAAA,SAAqB,QAAA,EAAU,YAAA;AAAA;EAAA,SAC/B,IAAA;AAAA;EAAA,SAEA,IAAA;EAAA,SACA,cAAA,WAAyB,aAAa;EAAA,SACtC,OAAA;AAAA;;;;AAYkB;AAajC;;;UAfiB,2BAAA;EAAA,SACN,OAAA;EAAA,SACA,QAAA,GAAW,WAAW;AAAA;;;;;;;;;;AAkBf;iBALF,oBAAA,CACd,KAAA,EAAO,cAAA,EACP,QAAA,UACA,MAAA,UACA,OAAA,GAAS,2BAAA,GACR,eAAA;;;;;iBAqLa,mBAAA,CAAoB,KAAA,EAAO,cAAc,EAAE,QAAA;;;AAAgB;AAkB3E;;;;AAA8C;iBAA9B,QAAA,CAAS,KAAqB,EAAd,cAAc;;;;;;iBAwC9B,mBAAA,CAAoB,KAAA,EAAO,cAAA,GAAiB,aAAa;AAAA,iBAQzD,YAAA,CAAa,KAAqB,EAAd,cAAc;AAAA,iBA8DlC,aAAA,CAAc,KAAA,EAAO,cAAA,YAA0B,aAAa"}

package/dist/{migration-list-types-0YjFETIv.d.mts → migration-list-types-BRTuXR8i.d.mts}

@@ -20,4 +20,4 @@ interface MigrationListResult {
 }
 //#endregion
 export { MigrationListResult as n, MigrationSpaceListEntry as r, MigrationListEntry as t };
-//# sourceMappingURL=migration-list-types-0YjFETIv.d.mts.map
+//# sourceMappingURL=migration-list-types-BRTuXR8i.d.mts.map

package/dist/{migration-list-types-0YjFETIv.d.mts.map → migration-list-types-BRTuXR8i.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"migration-list-types-0YjFETIv.d.mts","names":[],"sources":["../src/migration-list-types.ts"],"mappings":";UAAiB,kBAAA;EAAA,SACN,OAAA;EAAA,SACA,IAAA;EAAA,SACA,EAAA;EAAA,SACA,aAAA;EAAA,SACA,cAAA;EAAA,SACA,SAAA;EAAA,SACA,IAAA;EAAA,SACA,kBAAA;AAAA;AAAA,UAGM,uBAAA;EAAA,SACN,OAAA;EAAA,SACA,UAAA,WAAqB,kBAAkB;AAAA;AAAA,UAGjC,mBAAA;EAAA,SACN,EAAA;EAAA,SACA,MAAA,WAAiB,uBAAuB;EAAA,SACxC,OAAA;AAAA"}
+{"version":3,"file":"migration-list-types-BRTuXR8i.d.mts","names":[],"sources":["../src/migration-list-types.ts"],"mappings":";UAAiB,kBAAA;EAAA,SACN,OAAA;EAAA,SACA,IAAA;EAAA,SACA,EAAA;EAAA,SACA,aAAA;EAAA,SACA,cAAA;EAAA,SACA,SAAA;EAAA,SACA,IAAA;EAAA,SACA,kBAAA;AAAA;AAAA,UAGM,uBAAA;EAAA,SACN,OAAA;EAAA,SACA,UAAA,WAAqB,kBAAkB;AAAA;AAAA,UAGjC,mBAAA;EAAA,SACN,EAAA;EAAA,SACA,MAAA,WAAiB,uBAAuB;EAAA,SACxC,OAAA;AAAA"}

package/dist/{package-Ca-J_z_0.d.mts → package-DIttKL7X.d.mts}

@@ -18,4 +18,4 @@ interface OnDiskMigrationPackage extends MigrationPackage {
 }
 //#endregion
 export { OnDiskMigrationPackage as n, MigrationOps as t };
-//# sourceMappingURL=package-Ca-J_z_0.d.mts.map
+//# sourceMappingURL=package-DIttKL7X.d.mts.map

package/dist/{package-Ca-J_z_0.d.mts.map → package-DIttKL7X.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"package-Ca-J_z_0.d.mts","names":[],"sources":["../src/package.ts"],"mappings":";;;KAKY,YAAA,YAAwB,sBAAsB;;AAA1D;;;;AAA0D;AAa1D;;;;AACkB;UADD,sBAAA,SAA+B,gBAAgB;EAAA,SACrD,OAAO;AAAA"}
+{"version":3,"file":"package-DIttKL7X.d.mts","names":[],"sources":["../src/package.ts"],"mappings":";;;KAKY,YAAA,YAAwB,sBAAsB;;AAA1D;;;;AAA0D;AAa1D;;;;AACkB;UADD,sBAAA,SAA+B,gBAAgB;EAAA,SACrD,OAAO;AAAA"}

package/dist/{read-contract-space-contract-7-OB-ykY.mjs → read-contract-space-contract-BS5Oxbgw.mjs}

@@ -79,4 +79,4 @@ async function readContractSpaceContract(projectMigrationsDir, spaceId) {
 //#endregion
 export { readContractSpaceHeadRef as n, readContractSpaceContract as t };
 
-//# sourceMappingURL=read-contract-space-contract-7-OB-ykY.mjs.map
+//# sourceMappingURL=read-contract-space-contract-BS5Oxbgw.mjs.map

package/dist/{read-contract-space-contract-7-OB-ykY.mjs.map → read-contract-space-contract-BS5Oxbgw.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"read-contract-space-contract-7-OB-ykY.mjs","names":["hasErrnoCode"],"sources":["../src/read-contract-space-head-ref.ts","../src/read-contract-space-contract.ts"],"sourcesContent":["import { readFile } from 'node:fs/promises';\nimport type { ContractSpaceHeadRef } from '@prisma-next/framework-components/control';\nimport { join } from 'pathe';\nimport { errorInvalidJson, errorInvalidRefFile } from './errors';\nimport { assertValidSpaceId, spaceMigrationDirectory, spaceRefsDirectory } from './space-layout';\n\nexport type { ContractSpaceHeadRef };\n\nfunction hasErrnoCode(error: unknown, code: string): boolean {\n  return error instanceof Error && (error as { code?: string }).code === code;\n}\n\n/**\n * Read the head ref (`hash` + `invariants`) for a contract space from\n * `<projectMigrationsDir>/<spaceId>/refs/head.json`.\n *\n * Returns `null` when the file does not exist (first emit). Surfaces\n * `MIGRATION.INVALID_JSON` / `MIGRATION.INVALID_REF_FILE` on a corrupt\n * `refs/head.json` so callers can distinguish \"no head ref on disk\"\n * (returns `null`) from \"head ref present but unreadable\" (throws).\n *\n * Validates the space id against `[a-z][a-z0-9_-]{0,63}` for the same\n * filesystem-safety reasons as the rest of the per-space helpers. The\n * helper is uniform across the app and extension spaces.\n */\nexport async function readContractSpaceHeadRef(\n  projectMigrationsDir: string,\n  spaceId: string,\n): Promise<ContractSpaceHeadRef | null> {\n  assertValidSpaceId(spaceId);\n\n  const filePath = join(\n    spaceRefsDirectory(spaceMigrationDirectory(projectMigrationsDir, spaceId)),\n    'head.json',\n  );\n\n  let raw: string;\n  try {\n    raw = await readFile(filePath, 'utf-8');\n  } catch (error) {\n    if (hasErrnoCode(error, 'ENOENT')) {\n      return null;\n    }\n    throw error;\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw);\n  } catch (e) {\n    throw errorInvalidJson(filePath, e instanceof Error ? e.message : String(e));\n  }\n\n  if (typeof parsed !== 'object' || parsed === null) {\n    throw errorInvalidRefFile(filePath, 'expected an object');\n  }\n  const obj = parsed as { hash?: unknown; invariants?: unknown };\n  if (typeof obj.hash !== 'string') {\n    throw errorInvalidRefFile(filePath, 'expected an object with a string `hash` field');\n  }\n  if (!Array.isArray(obj.invariants) || obj.invariants.some((value) => typeof value !== 'string')) {\n    throw errorInvalidRefFile(filePath, 'expected an object with an `invariants` array of strings');\n  }\n\n  return { hash: obj.hash, invariants: obj.invariants as readonly string[] };\n}\n","import { readFile } from 'node:fs/promises';\nimport { join } from 'pathe';\nimport { errorInvalidJson, errorMissingFile } from './errors';\nimport { assertValidSpaceId } from './space-layout';\n\nfunction hasErrnoCode(error: unknown, code: string): boolean {\n  return error instanceof Error && (error as { code?: string }).code === code;\n}\n\n/**\n * Read the on-disk contract value for a contract space\n * (`<projectMigrationsDir>/<spaceId>/contract.json`). Returns the parsed\n * JSON value as `unknown` — callers that need a typed contract validate\n * via their family's `deserializeContract` to surface schema issues.\n *\n * Companion to {@link import('./read-contract-space-head-ref').readContractSpaceHeadRef}\n * — same ENOENT-throws / corrupt-file-error semantics. Returns the\n * canonical-JSON value the framework wrote during emit, so re-running\n * this helper across machines / runs yields a byte-identical value.\n */\nexport async function readContractSpaceContract(\n  projectMigrationsDir: string,\n  spaceId: string,\n): Promise<unknown> {\n  assertValidSpaceId(spaceId);\n\n  const filePath = join(projectMigrationsDir, spaceId, 'contract.json');\n\n  let raw: string;\n  try {\n    raw = await readFile(filePath, 'utf-8');\n  } catch (error) {\n    if (hasErrnoCode(error, 'ENOENT')) {\n      throw errorMissingFile('contract.json', join(projectMigrationsDir, spaceId));\n    }\n    throw error;\n  }\n\n  try {\n    return JSON.parse(raw);\n  } catch (e) {\n    throw errorInvalidJson(filePath, e instanceof Error ? e.message : String(e));\n  }\n}\n"],"mappings":";;;;;AAQA,SAASA,eAAa,OAAgB,MAAuB;CAC3D,OAAO,iBAAiB,SAAU,MAA4B,SAAS;AACzE;;;;;;;;;;;;;;AAeA,eAAsB,yBACpB,sBACA,SACsC;CACtC,mBAAmB,OAAO;CAE1B,MAAM,WAAW,KACf,mBAAmB,wBAAwB,sBAAsB,OAAO,CAAC,GACzE,WACF;CAEA,IAAI;CACJ,IAAI;EACF,MAAM,MAAM,SAAS,UAAU,OAAO;CACxC,SAAS,OAAO;EACd,IAAIA,eAAa,OAAO,QAAQ,GAC9B,OAAO;EAET,MAAM;CACR;CAEA,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,GAAG;CACzB,SAAS,GAAG;EACV,MAAM,iBAAiB,UAAU,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;CAC7E;CAEA,IAAI,OAAO,WAAW,YAAY,WAAW,MAC3C,MAAM,oBAAoB,UAAU,oBAAoB;CAE1D,MAAM,MAAM;CACZ,IAAI,OAAO,IAAI,SAAS,UACtB,MAAM,oBAAoB,UAAU,+CAA+C;CAErF,IAAI,CAAC,MAAM,QAAQ,IAAI,UAAU,KAAK,IAAI,WAAW,MAAM,UAAU,OAAO,UAAU,QAAQ,GAC5F,MAAM,oBAAoB,UAAU,0DAA0D;CAGhG,OAAO;EAAE,MAAM,IAAI;EAAM,YAAY,IAAI;CAAgC;AAC3E;;;AC5DA,SAAS,aAAa,OAAgB,MAAuB;CAC3D,OAAO,iBAAiB,SAAU,MAA4B,SAAS;AACzE;;;;;;;;;;;;AAaA,eAAsB,0BACpB,sBACA,SACkB;CAClB,mBAAmB,OAAO;CAE1B,MAAM,WAAW,KAAK,sBAAsB,SAAS,eAAe;CAEpE,IAAI;CACJ,IAAI;EACF,MAAM,MAAM,SAAS,UAAU,OAAO;CACxC,SAAS,OAAO;EACd,IAAI,aAAa,OAAO,QAAQ,GAC9B,MAAM,iBAAiB,iBAAiB,KAAK,sBAAsB,OAAO,CAAC;EAE7E,MAAM;CACR;CAEA,IAAI;EACF,OAAO,KAAK,MAAM,GAAG;CACvB,SAAS,GAAG;EACV,MAAM,iBAAiB,UAAU,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;CAC7E;AACF"}
+{"version":3,"file":"read-contract-space-contract-BS5Oxbgw.mjs","names":["hasErrnoCode"],"sources":["../src/read-contract-space-head-ref.ts","../src/read-contract-space-contract.ts"],"sourcesContent":["import { readFile } from 'node:fs/promises';\nimport type { ContractSpaceHeadRef } from '@prisma-next/framework-components/control';\nimport { join } from 'pathe';\nimport { errorInvalidJson, errorInvalidRefFile } from './errors';\nimport { assertValidSpaceId, spaceMigrationDirectory, spaceRefsDirectory } from './space-layout';\n\nexport type { ContractSpaceHeadRef };\n\nfunction hasErrnoCode(error: unknown, code: string): boolean {\n  return error instanceof Error && (error as { code?: string }).code === code;\n}\n\n/**\n * Read the head ref (`hash` + `invariants`) for a contract space from\n * `<projectMigrationsDir>/<spaceId>/refs/head.json`.\n *\n * Returns `null` when the file does not exist (first emit). Surfaces\n * `MIGRATION.INVALID_JSON` / `MIGRATION.INVALID_REF_FILE` on a corrupt\n * `refs/head.json` so callers can distinguish \"no head ref on disk\"\n * (returns `null`) from \"head ref present but unreadable\" (throws).\n *\n * Validates the space id against `[a-z][a-z0-9_-]{0,63}` for the same\n * filesystem-safety reasons as the rest of the per-space helpers. The\n * helper is uniform across the app and extension spaces.\n */\nexport async function readContractSpaceHeadRef(\n  projectMigrationsDir: string,\n  spaceId: string,\n): Promise<ContractSpaceHeadRef | null> {\n  assertValidSpaceId(spaceId);\n\n  const filePath = join(\n    spaceRefsDirectory(spaceMigrationDirectory(projectMigrationsDir, spaceId)),\n    'head.json',\n  );\n\n  let raw: string;\n  try {\n    raw = await readFile(filePath, 'utf-8');\n  } catch (error) {\n    if (hasErrnoCode(error, 'ENOENT')) {\n      return null;\n    }\n    throw error;\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw);\n  } catch (e) {\n    throw errorInvalidJson(filePath, e instanceof Error ? e.message : String(e));\n  }\n\n  if (typeof parsed !== 'object' || parsed === null) {\n    throw errorInvalidRefFile(filePath, 'expected an object');\n  }\n  const obj = parsed as { hash?: unknown; invariants?: unknown };\n  if (typeof obj.hash !== 'string') {\n    throw errorInvalidRefFile(filePath, 'expected an object with a string `hash` field');\n  }\n  if (!Array.isArray(obj.invariants) || obj.invariants.some((value) => typeof value !== 'string')) {\n    throw errorInvalidRefFile(filePath, 'expected an object with an `invariants` array of strings');\n  }\n\n  return { hash: obj.hash, invariants: obj.invariants as readonly string[] };\n}\n","import { readFile } from 'node:fs/promises';\nimport { join } from 'pathe';\nimport { errorInvalidJson, errorMissingFile } from './errors';\nimport { assertValidSpaceId } from './space-layout';\n\nfunction hasErrnoCode(error: unknown, code: string): boolean {\n  return error instanceof Error && (error as { code?: string }).code === code;\n}\n\n/**\n * Read the on-disk contract value for a contract space\n * (`<projectMigrationsDir>/<spaceId>/contract.json`). Returns the parsed\n * JSON value as `unknown` — callers that need a typed contract validate\n * via their family's `deserializeContract` to surface schema issues.\n *\n * Companion to {@link import('./read-contract-space-head-ref').readContractSpaceHeadRef}\n * — same ENOENT-throws / corrupt-file-error semantics. Returns the\n * canonical-JSON value the framework wrote during emit, so re-running\n * this helper across machines / runs yields a byte-identical value.\n */\nexport async function readContractSpaceContract(\n  projectMigrationsDir: string,\n  spaceId: string,\n): Promise<unknown> {\n  assertValidSpaceId(spaceId);\n\n  const filePath = join(projectMigrationsDir, spaceId, 'contract.json');\n\n  let raw: string;\n  try {\n    raw = await readFile(filePath, 'utf-8');\n  } catch (error) {\n    if (hasErrnoCode(error, 'ENOENT')) {\n      throw errorMissingFile('contract.json', join(projectMigrationsDir, spaceId));\n    }\n    throw error;\n  }\n\n  try {\n    return JSON.parse(raw);\n  } catch (e) {\n    throw errorInvalidJson(filePath, e instanceof Error ? e.message : String(e));\n  }\n}\n"],"mappings":";;;;;AAQA,SAASA,eAAa,OAAgB,MAAuB;CAC3D,OAAO,iBAAiB,SAAU,MAA4B,SAAS;AACzE;;;;;;;;;;;;;;AAeA,eAAsB,yBACpB,sBACA,SACsC;CACtC,mBAAmB,OAAO;CAE1B,MAAM,WAAW,KACf,mBAAmB,wBAAwB,sBAAsB,OAAO,CAAC,GACzE,WACF;CAEA,IAAI;CACJ,IAAI;EACF,MAAM,MAAM,SAAS,UAAU,OAAO;CACxC,SAAS,OAAO;EACd,IAAIA,eAAa,OAAO,QAAQ,GAC9B,OAAO;EAET,MAAM;CACR;CAEA,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,GAAG;CACzB,SAAS,GAAG;EACV,MAAM,iBAAiB,UAAU,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;CAC7E;CAEA,IAAI,OAAO,WAAW,YAAY,WAAW,MAC3C,MAAM,oBAAoB,UAAU,oBAAoB;CAE1D,MAAM,MAAM;CACZ,IAAI,OAAO,IAAI,SAAS,UACtB,MAAM,oBAAoB,UAAU,+CAA+C;CAErF,IAAI,CAAC,MAAM,QAAQ,IAAI,UAAU,KAAK,IAAI,WAAW,MAAM,UAAU,OAAO,UAAU,QAAQ,GAC5F,MAAM,oBAAoB,UAAU,0DAA0D;CAGhG,OAAO;EAAE,MAAM,IAAI;EAAM,YAAY,IAAI;CAAgC;AAC3E;;;AC5DA,SAAS,aAAa,OAAgB,MAAuB;CAC3D,OAAO,iBAAiB,SAAU,MAA4B,SAAS;AACzE;;;;;;;;;;;;AAaA,eAAsB,0BACpB,sBACA,SACkB;CAClB,mBAAmB,OAAO;CAE1B,MAAM,WAAW,KAAK,sBAAsB,SAAS,eAAe;CAEpE,IAAI;CACJ,IAAI;EACF,MAAM,MAAM,SAAS,UAAU,OAAO;CACxC,SAAS,OAAO;EACd,IAAI,aAAa,OAAO,QAAQ,GAC9B,MAAM,iBAAiB,iBAAiB,KAAK,sBAAsB,OAAO,CAAC;EAE7E,MAAM;CACR;CAEA,IAAI;EACF,OAAO,KAAK,MAAM,GAAG;CACvB,SAAS,GAAG;EACV,MAAM,iBAAiB,UAAU,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;CAC7E;AACF"}

package/dist/{refs-B33AsTjk.d.mts → refs-C8f2IGM8.d.mts}

@@ -23,4 +23,4 @@ declare function deleteRef(refsDir: string, name: string): Promise<void>;
 declare function resolveRef(refs: Refs, name: string): RefEntry;
 //#endregion
 export { readRef as a, validateRefName as c, deleteRef as i, validateRefValue as l, RefLoadProblem as n, readRefs as o, Refs as r, resolveRef as s, RefEntry as t, writeRef as u };
-//# sourceMappingURL=refs-B33AsTjk.d.mts.map
+//# sourceMappingURL=refs-C8f2IGM8.d.mts.map

package/dist/{refs-B33AsTjk.d.mts.map → refs-C8f2IGM8.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"refs-B33AsTjk.d.mts","names":[],"sources":["../src/refs.ts"],"mappings":";UAUiB,QAAA;EAAA,SACN,IAAA;EAAA,SACA,UAAU;AAAA;AAAA,KAGT,IAAA,GAAO,QAAA,CAAS,MAAA,SAAe,QAAA;;;;;;;UAe1B,cAAA;EAAA,SACN,OAAA;EAAA,SACA,MAAM;AAAA;AAAA,iBAWD,eAAA,CAAgB,IAAY;AAAA,iBAQ5B,gBAAA,CAAiB,KAAa;AAAA,iBAsBxB,OAAA,CAAQ,OAAA,UAAiB,IAAA,WAAe,OAAO,CAAC,QAAA;AAAA,iBAmChD,QAAA,CAAS,OAAA,WAAkB,OAAO,CAAC,IAAA;AAAA,iBA4HnC,QAAA,CAAS,OAAA,UAAiB,IAAA,UAAc,KAAA,EAAO,QAAA,GAAW,OAAO;AAAA,iBAoBjE,SAAA,CAAU,OAAA,UAAiB,IAAA,WAAe,OAAO;AAAA,iBAsCvD,UAAA,CAAW,IAAA,EAAM,IAAA,EAAM,IAAA,WAAe,QAAQ"}
+{"version":3,"file":"refs-C8f2IGM8.d.mts","names":[],"sources":["../src/refs.ts"],"mappings":";UAUiB,QAAA;EAAA,SACN,IAAA;EAAA,SACA,UAAU;AAAA;AAAA,KAGT,IAAA,GAAO,QAAA,CAAS,MAAA,SAAe,QAAA;;;;;;;UAe1B,cAAA;EAAA,SACN,OAAA;EAAA,SACA,MAAM;AAAA;AAAA,iBAWD,eAAA,CAAgB,IAAY;AAAA,iBAQ5B,gBAAA,CAAiB,KAAa;AAAA,iBAsBxB,OAAA,CAAQ,OAAA,UAAiB,IAAA,WAAe,OAAO,CAAC,QAAA;AAAA,iBAmChD,QAAA,CAAS,OAAA,WAAkB,OAAO,CAAC,IAAA;AAAA,iBA4HnC,QAAA,CAAS,OAAA,UAAiB,IAAA,UAAc,KAAA,EAAO,QAAA,GAAW,OAAO;AAAA,iBAoBjE,SAAA,CAAU,OAAA,UAAiB,IAAA,WAAe,OAAO;AAAA,iBAsCvD,UAAA,CAAW,IAAA,EAAM,IAAA,EAAM,IAAA,WAAe,QAAQ"}

package/dist/{verify-contract-spaces-BdysZdQk.d.mts → verify-contract-spaces-T0aiJlBS.d.mts}

@@ -129,4 +129,4 @@ type VerifyContractSpacesResult = {
 declare function verifyContractSpaces(inputs: VerifyContractSpacesInputs): VerifyContractSpacesResult;
 //#endregion
 export { VerifyContractSpacesResult as a, VerifyContractSpacesInputs as i, SpaceMarkerRecord as n, listContractSpaceDirectories as o, SpaceVerifierViolation as r, verifyContractSpaces as s, ContractSpaceHeadRecord as t };
-//# sourceMappingURL=verify-contract-spaces-BdysZdQk.d.mts.map
+//# sourceMappingURL=verify-contract-spaces-T0aiJlBS.d.mts.map

package/dist/{verify-contract-spaces-BdysZdQk.d.mts.map → verify-contract-spaces-T0aiJlBS.d.mts.map}

@@ -1 +1 @@
-{"version":3,"file":"verify-contract-spaces-BdysZdQk.d.mts","names":[],"sources":["../src/verify-contract-spaces.ts"],"mappings":";;AAyBA;;;;AAEU;AAyCV;;;;AAEqB;AAQrB;;;;AAEqB;iBAvDC,4BAAA,CACpB,oBAAA,WACC,OAAO;;;;;;;UAyCO,uBAAA;EAAA,SACN,IAAA;EAAA,SACA,UAAU;AAAA;;;;;;UAQJ,iBAAA;EAAA,SACN,IAAA;EAAA,SACA,UAAU;AAAA;AAAA,UAGJ,0BAAA;EAiCL;;;;;;;EAAA,SAzBD,YAAA,EAAc,WAAA;EAiCV;;;;;EAAA,SA1BJ,eAAA;EAoCI;;;;;;;EAAA,SA3BJ,eAAA,EAAiB,WAAA,SAAoB,uBAAA;EAqCjC;;AAAW;AAG1B;EAHe,SA/BJ,iBAAA,EAAmB,WAAA,SAAoB,iBAAA;AAAA;AAAA,KAGtC,sBAAA;EAAA,SAEG,IAAA;EAAA,SACA,OAAA;EAAA,SACA,WAAA;AAAA;EAAA,SAGA,IAAA;EAAA,SACA,OAAA;EAAA,SACA,WAAA;AAAA;EAAA,SAGA,IAAA;EAAA,SACA,OAAA;EAAA,SACA,WAAA;AAAA;EAAA,SAGA,IAAA;EAAA,SACA,OAAA;EAAA,SACA,aAAA;EAAA,SACA,UAAA;EAAA,SACA,WAAA;AAAA;EAAA,SAGA,IAAA;EAAA,SACA,OAAA;EAAA,SACA,gBAAA;EAAA,SACA,gBAAA;EAAA,SACA,WAAA;AAAA;AAAA,KAGH,0BAAA;EAAA,SACG,EAAA;AAAA;EAAA,SACA,EAAA;EAAA,SAAoB,UAAA,WAAqB,sBAAsB;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAiC9D,oBAAA,CACd,MAAA,EAAQ,0BAAA,GACP,0BAA0B"}
+{"version":3,"file":"verify-contract-spaces-T0aiJlBS.d.mts","names":[],"sources":["../src/verify-contract-spaces.ts"],"mappings":";;AAyBA;;;;AAEU;AAyCV;;;;AAEqB;AAQrB;;;;AAEqB;iBAvDC,4BAAA,CACpB,oBAAA,WACC,OAAO;;;;;;;UAyCO,uBAAA;EAAA,SACN,IAAA;EAAA,SACA,UAAU;AAAA;;;;;;UAQJ,iBAAA;EAAA,SACN,IAAA;EAAA,SACA,UAAU;AAAA;AAAA,UAGJ,0BAAA;EAiCL;;;;;;;EAAA,SAzBD,YAAA,EAAc,WAAA;EAiCV;;;;;EAAA,SA1BJ,eAAA;EAoCI;;;;;;;EAAA,SA3BJ,eAAA,EAAiB,WAAA,SAAoB,uBAAA;EAqCjC;;AAAW;AAG1B;EAHe,SA/BJ,iBAAA,EAAmB,WAAA,SAAoB,iBAAA;AAAA;AAAA,KAGtC,sBAAA;EAAA,SAEG,IAAA;EAAA,SACA,OAAA;EAAA,SACA,WAAA;AAAA;EAAA,SAGA,IAAA;EAAA,SACA,OAAA;EAAA,SACA,WAAA;AAAA;EAAA,SAGA,IAAA;EAAA,SACA,OAAA;EAAA,SACA,WAAA;AAAA;EAAA,SAGA,IAAA;EAAA,SACA,OAAA;EAAA,SACA,aAAA;EAAA,SACA,UAAA;EAAA,SACA,WAAA;AAAA;EAAA,SAGA,IAAA;EAAA,SACA,OAAA;EAAA,SACA,gBAAA;EAAA,SACA,gBAAA;EAAA,SACA,WAAA;AAAA;AAAA,KAGH,0BAAA;EAAA,SACG,EAAA;AAAA;EAAA,SACA,EAAA;EAAA,SAAoB,UAAA,WAAqB,sBAAsB;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAiC9D,oBAAA,CACd,MAAA,EAAQ,0BAAA,GACP,0BAA0B"}

package/package.json

@@ -1,21 +1,21 @@
 {
   "name": "@prisma-next/migration-tools",
-  "version": "0.11.0-dev.47",
+  "version": "0.11.0-dev.49",
   "license": "Apache-2.0",
   "type": "module",
   "sideEffects": false,
   "description": "On-disk migration persistence, hash verification, and chain reconstruction for Prisma Next",
   "dependencies": {
-    "@prisma-next/contract": "0.11.0-dev.47",
-    "@prisma-next/framework-components": "0.11.0-dev.47",
-    "@prisma-next/utils": "0.11.0-dev.47",
+    "@prisma-next/contract": "0.11.0-dev.49",
+    "@prisma-next/framework-components": "0.11.0-dev.49",
+    "@prisma-next/utils": "0.11.0-dev.49",
     "arktype": "^2.2.0",
     "pathe": "^2.0.3",
     "prettier": "^3.8.3"
   },
   "devDependencies": {
-    "@prisma-next/tsconfig": "0.11.0-dev.47",
-    "@prisma-next/tsdown": "0.11.0-dev.47",
+    "@prisma-next/tsconfig": "0.11.0-dev.49",
+    "@prisma-next/tsdown": "0.11.0-dev.49",
     "tsdown": "0.22.0",
     "typescript": "5.9.3",
     "vitest": "4.1.6"
@@ -72,10 +72,6 @@
       "types": "./dist/exports/migration-list-graph-topology.d.mts",
       "import": "./dist/exports/migration-list-graph-topology.mjs"
     },
-    "./migration-list-graph-layout": {
-      "types": "./dist/exports/migration-list-graph-layout.d.mts",
-      "import": "./dist/exports/migration-list-graph-layout.mjs"
-    },
     "./refs": {
       "types": "./dist/exports/refs.d.mts",
       "import": "./dist/exports/refs.mjs"

package/src/exports/migration-list-graph-topology.ts

@@ -1,2 +1,5 @@
-export type { EdgeKind, MigrationGraphTopology } from '../migration-list-graph-topology';
+export type {
+  MigrationEdgeKind,
+  MigrationListGraphTopology,
+} from '../migration-list-graph-topology';
 export { classifyMigrationListGraphTopology } from '../migration-list-graph-topology';

package/src/migration-list-graph-topology.ts

@@ -1,10 +1,10 @@
 import { EMPTY_CONTRACT_HASH } from './constants';
 import type { MigrationListEntry } from './migration-list-types';
 
-export type EdgeKind = 'forward' | 'rollback' | 'self';
+export type MigrationEdgeKind = 'forward' | 'rollback' | 'self';
 
-export interface MigrationGraphTopology {
-  readonly kindByMigrationHash: ReadonlyMap<string, EdgeKind>;
+export interface MigrationListGraphTopology {
+  readonly kindByMigrationHash: ReadonlyMap<string, MigrationEdgeKind>;
   readonly forwardInDegree: ReadonlyMap<string, number>;
   readonly forwardOutDegree: ReadonlyMap<string, number>;
 }
@@ -29,9 +29,9 @@ function bumpDegree(map: Map<string, number>, key: string): void {
 
 export function classifyMigrationListGraphTopology(
   entries: readonly MigrationListEntry[],
-): MigrationGraphTopology {
+): MigrationListGraphTopology {
   const nodes = new Set<string>();
-  const kindByMigrationHash = new Map<string, EdgeKind>();
+  const kindByMigrationHash = new Map<string, MigrationEdgeKind>();
   const outgoingByFrom = new Map<string, NonSelfEdge[]>();
 
   for (const entry of entries) {
@@ -133,7 +133,9 @@ export function classifyMigrationListGraphTopology(
   for (const root of dfsRoots) {
     runDfsFrom(root);
   }
-  for (const root of nodes) {
+  const remainingWhite = [...nodes].filter((node) => color.get(node) === WHITE);
+  remainingWhite.sort((a, b) => a.localeCompare(b));
+  for (const root of remainingWhite) {
     runDfsFrom(root);
   }
 

package/dist/exports/migration-list-graph-layout.d.mts

@@ -1,34 +0,0 @@
-import { t as MigrationListEntry } from "../migration-list-types-0YjFETIv.mjs";
-import { t as EdgeKind } from "../migration-list-graph-topology-Be1d8Y89.mjs";
-
-//#region src/migration-list-graph-layout.d.ts
-type ConnectorKind = 'fanBelow' | 'joinBelow';
-interface MigrationLayoutRow {
-  readonly kind: 'migration';
-  readonly entry: MigrationListEntry;
-  readonly edgeKind: EdgeKind;
-  readonly laneIndex: number;
-  readonly passThroughLanes: readonly number[];
-  readonly woven: boolean;
-}
-interface NodeLineLayoutRow {
-  readonly kind: 'nodeLine';
-  readonly contractHash: string;
-  readonly laneIndex: number;
-}
-interface ConnectorLayoutRow {
-  readonly kind: 'connector';
-  readonly connectorKind: ConnectorKind;
-  readonly contractHash: string;
-  readonly startLane: number;
-  readonly endLane: number;
-  readonly branchCount: number;
-}
-type LayoutRow = MigrationLayoutRow | NodeLineLayoutRow | ConnectorLayoutRow;
-interface MigrationListGraphLayout {
-  readonly rows: readonly LayoutRow[];
-}
-declare function computeMigrationListGraphLayout(entries: readonly MigrationListEntry[]): MigrationListGraphLayout;
-//#endregion
-export { type ConnectorKind, type ConnectorLayoutRow, type LayoutRow, type MigrationLayoutRow, type MigrationListGraphLayout, type NodeLineLayoutRow, computeMigrationListGraphLayout };
-//# sourceMappingURL=migration-list-graph-layout.d.mts.map

package/dist/exports/migration-list-graph-layout.d.mts.map

@@ -1 +0,0 @@
-{"version":3,"file":"migration-list-graph-layout.d.mts","names":[],"sources":["../../src/migration-list-graph-layout.ts"],"mappings":";;;;KAIY,aAAA;AAAA,UAEK,kBAAA;EAAA,SACN,IAAA;EAAA,SACA,KAAA,EAAO,kBAAA;EAAA,SACP,QAAA,EAAU,QAAQ;EAAA,SAClB,SAAA;EAAA,SACA,gBAAA;EAAA,SACA,KAAA;AAAA;AAAA,UAGM,iBAAA;EAAA,SACN,IAAA;EAAA,SACA,YAAA;EAAA,SACA,SAAA;AAAA;AAAA,UAGM,kBAAA;EAAA,SACN,IAAA;EAAA,SACA,aAAA,EAAe,aAAa;EAAA,SAC5B,YAAA;EAAA,SACA,SAAA;EAAA,SACA,OAAA;EAAA,SACA,WAAA;AAAA;AAAA,KAGC,SAAA,GAAY,kBAAA,GAAqB,iBAAA,GAAoB,kBAAA;AAAA,UAEhD,wBAAA;EAAA,SACN,IAAA,WAAe,SAAS;AAAA;AAAA,iBAoDnB,+BAAA,CACd,OAAA,WAAkB,kBAAA,KACjB,wBAAwB"}

package/dist/exports/migration-list-graph-layout.mjs

@@ -1,170 +0,0 @@
-import "../constants-DWV9_o2Z.mjs";
-import { t as classifyMigrationListGraphTopology } from "../migration-list-graph-topology-BtFzbZ9L.mjs";
-//#region src/migration-list-graph-layout.ts
-function canonicalFrom(from) {
-	return from ?? "sha256:empty";
-}
-function canonicalTo(entry) {
-	return entry.to;
-}
-function forwardInDegree(topology, hash) {
-	return topology.forwardInDegree.get(hash) ?? 0;
-}
-function forwardOutDegree(topology, hash) {
-	return topology.forwardOutDegree.get(hash) ?? 0;
-}
-function buildForwardProducersByTo(entries, kindByMigrationHash) {
-	const byTo = /* @__PURE__ */ new Map();
-	for (const entry of entries) {
-		if (kindByMigrationHash.get(entry.migrationHash) !== "forward") continue;
-		const to = canonicalTo(entry);
-		const bucket = byTo.get(to);
-		if (bucket) bucket.push(entry);
-		else byTo.set(to, [entry]);
-	}
-	return byTo;
-}
-function countForwardProducersTo(forwardProducersByTo, contract) {
-	return forwardProducersByTo.get(contract)?.length ?? 0;
-}
-function computeMigrationListGraphLayout(entries) {
-	const topology = classifyMigrationListGraphTopology(entries);
-	const { kindByMigrationHash } = topology;
-	const forwardProducersByTo = buildForwardProducersByTo(entries, kindByMigrationHash);
-	const convergencesEmitted = /* @__PURE__ */ new Set();
-	const producerLaneByHash = /* @__PURE__ */ new Map();
-	const lanes = [];
-	const rows = [];
-	function emitNodeLine(contractHash) {
-		rows.push({
-			kind: "nodeLine",
-			contractHash,
-			laneIndex: 0
-		});
-	}
-	function emitConnector(connectorKind, contractHash, startLane, endLane, branchCount) {
-		rows.push({
-			kind: "connector",
-			connectorKind,
-			contractHash,
-			startLane,
-			endLane,
-			branchCount
-		});
-	}
-	function activeLaneIndices() {
-		const indices = [];
-		for (let index = 0; index < lanes.length; index++) if (lanes[index]?.active) indices.push(index);
-		return indices;
-	}
-	function lanesWanting(contract) {
-		const indices = [];
-		for (let index = 0; index < lanes.length; index++) {
-			const lane = lanes[index];
-			if (lane?.active && lane.want === contract) indices.push(index);
-		}
-		return indices;
-	}
-	function ensureLane(index) {
-		while (lanes.length <= index) lanes.push({
-			want: "",
-			active: false
-		});
-	}
-	function openLaneAtRight(want) {
-		const index = lanes.length;
-		lanes.push({
-			want,
-			active: true
-		});
-		return index;
-	}
-	function closeLane(index) {
-		ensureLane(index);
-		const lane = lanes[index];
-		if (lane) lane.active = false;
-	}
-	function emitJoinBelow(contractHash, laneIndices) {
-		if (laneIndices.length < 2) return;
-		const startLane = Math.min(...laneIndices);
-		emitConnector("joinBelow", contractHash, startLane, Math.max(...laneIndices), laneIndices.length);
-		for (const index of laneIndices) if (index !== startLane) closeLane(index);
-	}
-	function emitConvergencePreamble(contract) {
-		if (convergencesEmitted.has(contract)) return;
-		if (forwardInDegree(topology, contract) < 2) return;
-		const consumersWanting = lanesWanting(contract);
-		if (forwardOutDegree(topology, contract) >= 2 && consumersWanting.length >= 2) emitJoinBelow(contract, consumersWanting);
-		emitNodeLine(contract);
-		const producers = forwardProducersByTo.get(contract) ?? [];
-		if (producers.length >= 2) emitConnector("fanBelow", contract, 0, producers.length - 1, producers.length);
-		for (const [producerIndex, producer] of producers.entries()) {
-			ensureLane(producerIndex);
-			lanes[producerIndex] = {
-				want: canonicalFrom(producer.from),
-				active: true
-			};
-			producerLaneByHash.set(producer.migrationHash, producerIndex);
-		}
-		convergencesEmitted.add(contract);
-	}
-	function assignProducerLane(entry) {
-		const preset = producerLaneByHash.get(entry.migrationHash);
-		if (preset !== void 0) return preset;
-	}
-	function placeWoven(entry, edgeKind, laneIndex) {
-		const passThroughLanes = activeLaneIndices().filter((index) => index !== laneIndex);
-		rows.push({
-			kind: "migration",
-			entry,
-			edgeKind,
-			laneIndex,
-			passThroughLanes,
-			woven: true
-		});
-		ensureLane(laneIndex);
-		lanes[laneIndex] = {
-			want: canonicalFrom(entry.from),
-			active: true
-		};
-	}
-	function placeUnwoven(entry, edgeKind) {
-		const passThroughLanes = activeLaneIndices();
-		const laneIndex = passThroughLanes.length === 0 ? 0 : Math.max(...passThroughLanes) + 1;
-		rows.push({
-			kind: "migration",
-			entry,
-			edgeKind,
-			laneIndex,
-			passThroughLanes,
-			woven: false
-		});
-	}
-	for (const entry of entries) {
-		const edgeKind = kindByMigrationHash.get(entry.migrationHash) ?? "forward";
-		const to = canonicalTo(entry);
-		if (edgeKind !== "forward") {
-			placeUnwoven(entry, edgeKind);
-			continue;
-		}
-		if (forwardInDegree(topology, to) >= 2 && !convergencesEmitted.has(to)) emitConvergencePreamble(to);
-		const presetLane = assignProducerLane(entry);
-		const wantingTo = lanesWanting(to);
-		if (wantingTo.length >= 2 && countForwardProducersTo(forwardProducersByTo, to) === 1) emitJoinBelow(to, wantingTo);
-		if (presetLane !== void 0) {
-			placeWoven(entry, edgeKind, presetLane);
-			continue;
-		}
-		const firstWanting = wantingTo[0];
-		if (firstWanting !== void 0) {
-			placeWoven(entry, edgeKind, firstWanting);
-			continue;
-		}
-		placeWoven(entry, edgeKind, openLaneAtRight(canonicalFrom(entry.from)));
-	}
-	return { rows };
-}
-//#endregion
-export { computeMigrationListGraphLayout };
-
-//# sourceMappingURL=migration-list-graph-layout.mjs.map

package/dist/exports/migration-list-graph-layout.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"migration-list-graph-layout.mjs","names":[],"sources":["../../src/migration-list-graph-layout.ts"],"sourcesContent":["import { EMPTY_CONTRACT_HASH } from './constants';\nimport { classifyMigrationListGraphTopology, type EdgeKind } from './migration-list-graph-topology';\nimport type { MigrationListEntry } from './migration-list-types';\n\nexport type ConnectorKind = 'fanBelow' | 'joinBelow';\n\nexport interface MigrationLayoutRow {\n  readonly kind: 'migration';\n  readonly entry: MigrationListEntry;\n  readonly edgeKind: EdgeKind;\n  readonly laneIndex: number;\n  readonly passThroughLanes: readonly number[];\n  readonly woven: boolean;\n}\n\nexport interface NodeLineLayoutRow {\n  readonly kind: 'nodeLine';\n  readonly contractHash: string;\n  readonly laneIndex: number;\n}\n\nexport interface ConnectorLayoutRow {\n  readonly kind: 'connector';\n  readonly connectorKind: ConnectorKind;\n  readonly contractHash: string;\n  readonly startLane: number;\n  readonly endLane: number;\n  readonly branchCount: number;\n}\n\nexport type LayoutRow = MigrationLayoutRow | NodeLineLayoutRow | ConnectorLayoutRow;\n\nexport interface MigrationListGraphLayout {\n  readonly rows: readonly LayoutRow[];\n}\n\ninterface LaneState {\n  want: string;\n  active: boolean;\n}\n\nfunction canonicalFrom(from: string | null): string {\n  return from ?? EMPTY_CONTRACT_HASH;\n}\n\nfunction canonicalTo(entry: MigrationListEntry): string {\n  return entry.to;\n}\n\nfunction forwardInDegree(\n  topology: ReturnType<typeof classifyMigrationListGraphTopology>,\n  hash: string,\n): number {\n  return topology.forwardInDegree.get(hash) ?? 0;\n}\n\nfunction forwardOutDegree(\n  topology: ReturnType<typeof classifyMigrationListGraphTopology>,\n  hash: string,\n): number {\n  return topology.forwardOutDegree.get(hash) ?? 0;\n}\n\nfunction buildForwardProducersByTo(\n  entries: readonly MigrationListEntry[],\n  kindByMigrationHash: ReadonlyMap<string, EdgeKind>,\n): Map<string, MigrationListEntry[]> {\n  const byTo = new Map<string, MigrationListEntry[]>();\n  for (const entry of entries) {\n    if (kindByMigrationHash.get(entry.migrationHash) !== 'forward') continue;\n    const to = canonicalTo(entry);\n    const bucket = byTo.get(to);\n    if (bucket) bucket.push(entry);\n    else byTo.set(to, [entry]);\n  }\n  return byTo;\n}\n\nfunction countForwardProducersTo(\n  forwardProducersByTo: Map<string, MigrationListEntry[]>,\n  contract: string,\n): number {\n  return forwardProducersByTo.get(contract)?.length ?? 0;\n}\n\nexport function computeMigrationListGraphLayout(\n  entries: readonly MigrationListEntry[],\n): MigrationListGraphLayout {\n  const topology = classifyMigrationListGraphTopology(entries);\n  const { kindByMigrationHash } = topology;\n  const forwardProducersByTo = buildForwardProducersByTo(entries, kindByMigrationHash);\n  const convergencesEmitted = new Set<string>();\n  const producerLaneByHash = new Map<string, number>();\n  const lanes: LaneState[] = [];\n  const rows: LayoutRow[] = [];\n\n  function emitNodeLine(contractHash: string): void {\n    rows.push({ kind: 'nodeLine', contractHash, laneIndex: 0 });\n  }\n\n  function emitConnector(\n    connectorKind: ConnectorKind,\n    contractHash: string,\n    startLane: number,\n    endLane: number,\n    branchCount: number,\n  ): void {\n    rows.push({\n      kind: 'connector',\n      connectorKind,\n      contractHash,\n      startLane,\n      endLane,\n      branchCount,\n    });\n  }\n\n  function activeLaneIndices(): number[] {\n    const indices: number[] = [];\n    for (let index = 0; index < lanes.length; index++) {\n      if (lanes[index]?.active) indices.push(index);\n    }\n    return indices;\n  }\n\n  function lanesWanting(contract: string): number[] {\n    const indices: number[] = [];\n    for (let index = 0; index < lanes.length; index++) {\n      const lane = lanes[index];\n      if (lane?.active && lane.want === contract) indices.push(index);\n    }\n    return indices;\n  }\n\n  function ensureLane(index: number): void {\n    while (lanes.length <= index) {\n      lanes.push({ want: '', active: false });\n    }\n  }\n\n  function openLaneAtRight(want: string): number {\n    const index = lanes.length;\n    lanes.push({ want, active: true });\n    return index;\n  }\n\n  function closeLane(index: number): void {\n    ensureLane(index);\n    const lane = lanes[index];\n    if (lane) lane.active = false;\n  }\n\n  function emitJoinBelow(contractHash: string, laneIndices: readonly number[]): void {\n    if (laneIndices.length < 2) return;\n    const startLane = Math.min(...laneIndices);\n    const endLane = Math.max(...laneIndices);\n    emitConnector('joinBelow', contractHash, startLane, endLane, laneIndices.length);\n    for (const index of laneIndices) {\n      if (index !== startLane) closeLane(index);\n    }\n  }\n\n  function emitConvergencePreamble(contract: string): void {\n    if (convergencesEmitted.has(contract)) return;\n    if (forwardInDegree(topology, contract) < 2) return;\n\n    const consumersWanting = lanesWanting(contract);\n    if (forwardOutDegree(topology, contract) >= 2 && consumersWanting.length >= 2) {\n      emitJoinBelow(contract, consumersWanting);\n    }\n\n    emitNodeLine(contract);\n    const producers = forwardProducersByTo.get(contract) ?? [];\n    if (producers.length >= 2) {\n      emitConnector('fanBelow', contract, 0, producers.length - 1, producers.length);\n    }\n\n    for (const [producerIndex, producer] of producers.entries()) {\n      ensureLane(producerIndex);\n      lanes[producerIndex] = { want: canonicalFrom(producer.from), active: true };\n      producerLaneByHash.set(producer.migrationHash, producerIndex);\n    }\n\n    convergencesEmitted.add(contract);\n  }\n\n  function assignProducerLane(entry: MigrationListEntry): number | undefined {\n    const preset = producerLaneByHash.get(entry.migrationHash);\n    if (preset !== undefined) return preset;\n    return undefined;\n  }\n\n  function placeWoven(entry: MigrationListEntry, edgeKind: EdgeKind, laneIndex: number): void {\n    const passThroughLanes = activeLaneIndices().filter((index) => index !== laneIndex);\n    rows.push({\n      kind: 'migration',\n      entry,\n      edgeKind,\n      laneIndex,\n      passThroughLanes,\n      woven: true,\n    });\n    ensureLane(laneIndex);\n    lanes[laneIndex] = { want: canonicalFrom(entry.from), active: true };\n  }\n\n  function placeUnwoven(entry: MigrationListEntry, edgeKind: EdgeKind): void {\n    const passThroughLanes = activeLaneIndices();\n    const laneIndex = passThroughLanes.length === 0 ? 0 : Math.max(...passThroughLanes) + 1;\n    rows.push({\n      kind: 'migration',\n      entry,\n      edgeKind,\n      laneIndex,\n      passThroughLanes,\n      woven: false,\n    });\n  }\n\n  for (const entry of entries) {\n    const edgeKind = kindByMigrationHash.get(entry.migrationHash) ?? 'forward';\n    const to = canonicalTo(entry);\n\n    if (edgeKind !== 'forward') {\n      placeUnwoven(entry, edgeKind);\n      continue;\n    }\n\n    if (forwardInDegree(topology, to) >= 2 && !convergencesEmitted.has(to)) {\n      emitConvergencePreamble(to);\n    }\n\n    const presetLane = assignProducerLane(entry);\n    const wantingTo = lanesWanting(to);\n\n    if (wantingTo.length >= 2 && countForwardProducersTo(forwardProducersByTo, to) === 1) {\n      emitJoinBelow(to, wantingTo);\n    }\n\n    if (presetLane !== undefined) {\n      placeWoven(entry, edgeKind, presetLane);\n      continue;\n    }\n\n    const firstWanting = wantingTo[0];\n    if (firstWanting !== undefined) {\n      placeWoven(entry, edgeKind, firstWanting);\n      continue;\n    }\n\n    const tipLaneIndex = openLaneAtRight(canonicalFrom(entry.from));\n    placeWoven(entry, edgeKind, tipLaneIndex);\n  }\n\n  return { rows };\n}\n"],"mappings":";;;AAyCA,SAAS,cAAc,MAA6B;CAClD,OAAO,QAAA;AACT;AAEA,SAAS,YAAY,OAAmC;CACtD,OAAO,MAAM;AACf;AAEA,SAAS,gBACP,UACA,MACQ;CACR,OAAO,SAAS,gBAAgB,IAAI,IAAI,KAAK;AAC/C;AAEA,SAAS,iBACP,UACA,MACQ;CACR,OAAO,SAAS,iBAAiB,IAAI,IAAI,KAAK;AAChD;AAEA,SAAS,0BACP,SACA,qBACmC;CACnC,MAAM,uBAAO,IAAI,IAAkC;CACnD,KAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,oBAAoB,IAAI,MAAM,aAAa,MAAM,WAAW;EAChE,MAAM,KAAK,YAAY,KAAK;EAC5B,MAAM,SAAS,KAAK,IAAI,EAAE;EAC1B,IAAI,QAAQ,OAAO,KAAK,KAAK;OACxB,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;CAC3B;CACA,OAAO;AACT;AAEA,SAAS,wBACP,sBACA,UACQ;CACR,OAAO,qBAAqB,IAAI,QAAQ,GAAG,UAAU;AACvD;AAEA,SAAgB,gCACd,SAC0B;CAC1B,MAAM,WAAW,mCAAmC,OAAO;CAC3D,MAAM,EAAE,wBAAwB;CAChC,MAAM,uBAAuB,0BAA0B,SAAS,mBAAmB;CACnF,MAAM,sCAAsB,IAAI,IAAY;CAC5C,MAAM,qCAAqB,IAAI,IAAoB;CACnD,MAAM,QAAqB,CAAC;CAC5B,MAAM,OAAoB,CAAC;CAE3B,SAAS,aAAa,cAA4B;EAChD,KAAK,KAAK;GAAE,MAAM;GAAY;GAAc,WAAW;EAAE,CAAC;CAC5D;CAEA,SAAS,cACP,eACA,cACA,WACA,SACA,aACM;EACN,KAAK,KAAK;GACR,MAAM;GACN;GACA;GACA;GACA;GACA;EACF,CAAC;CACH;CAEA,SAAS,oBAA8B;EACrC,MAAM,UAAoB,CAAC;EAC3B,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SACxC,IAAI,MAAM,QAAQ,QAAQ,QAAQ,KAAK,KAAK;EAE9C,OAAO;CACT;CAEA,SAAS,aAAa,UAA4B;EAChD,MAAM,UAAoB,CAAC;EAC3B,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;GACjD,MAAM,OAAO,MAAM;GACnB,IAAI,MAAM,UAAU,KAAK,SAAS,UAAU,QAAQ,KAAK,KAAK;EAChE;EACA,OAAO;CACT;CAEA,SAAS,WAAW,OAAqB;EACvC,OAAO,MAAM,UAAU,OACrB,MAAM,KAAK;GAAE,MAAM;GAAI,QAAQ;EAAM,CAAC;CAE1C;CAEA,SAAS,gBAAgB,MAAsB;EAC7C,MAAM,QAAQ,MAAM;EACpB,MAAM,KAAK;GAAE;GAAM,QAAQ;EAAK,CAAC;EACjC,OAAO;CACT;CAEA,SAAS,UAAU,OAAqB;EACtC,WAAW,KAAK;EAChB,MAAM,OAAO,MAAM;EACnB,IAAI,MAAM,KAAK,SAAS;CAC1B;CAEA,SAAS,cAAc,cAAsB,aAAsC;EACjF,IAAI,YAAY,SAAS,GAAG;EAC5B,MAAM,YAAY,KAAK,IAAI,GAAG,WAAW;EAEzC,cAAc,aAAa,cAAc,WADzB,KAAK,IAAI,GAAG,WAC8B,GAAG,YAAY,MAAM;EAC/E,KAAK,MAAM,SAAS,aAClB,IAAI,UAAU,WAAW,UAAU,KAAK;CAE5C;CAEA,SAAS,wBAAwB,UAAwB;EACvD,IAAI,oBAAoB,IAAI,QAAQ,GAAG;EACvC,IAAI,gBAAgB,UAAU,QAAQ,IAAI,GAAG;EAE7C,MAAM,mBAAmB,aAAa,QAAQ;EAC9C,IAAI,iBAAiB,UAAU,QAAQ,KAAK,KAAK,iBAAiB,UAAU,GAC1E,cAAc,UAAU,gBAAgB;EAG1C,aAAa,QAAQ;EACrB,MAAM,YAAY,qBAAqB,IAAI,QAAQ,KAAK,CAAC;EACzD,IAAI,UAAU,UAAU,GACtB,cAAc,YAAY,UAAU,GAAG,UAAU,SAAS,GAAG,UAAU,MAAM;EAG/E,KAAK,MAAM,CAAC,eAAe,aAAa,UAAU,QAAQ,GAAG;GAC3D,WAAW,aAAa;GACxB,MAAM,iBAAiB;IAAE,MAAM,cAAc,SAAS,IAAI;IAAG,QAAQ;GAAK;GAC1E,mBAAmB,IAAI,SAAS,eAAe,aAAa;EAC9D;EAEA,oBAAoB,IAAI,QAAQ;CAClC;CAEA,SAAS,mBAAmB,OAA+C;EACzE,MAAM,SAAS,mBAAmB,IAAI,MAAM,aAAa;EACzD,IAAI,WAAW,KAAA,GAAW,OAAO;CAEnC;CAEA,SAAS,WAAW,OAA2B,UAAoB,WAAyB;EAC1F,MAAM,mBAAmB,kBAAkB,EAAE,QAAQ,UAAU,UAAU,SAAS;EAClF,KAAK,KAAK;GACR,MAAM;GACN;GACA;GACA;GACA;GACA,OAAO;EACT,CAAC;EACD,WAAW,SAAS;EACpB,MAAM,aAAa;GAAE,MAAM,cAAc,MAAM,IAAI;GAAG,QAAQ;EAAK;CACrE;CAEA,SAAS,aAAa,OAA2B,UAA0B;EACzE,MAAM,mBAAmB,kBAAkB;EAC3C,MAAM,YAAY,iBAAiB,WAAW,IAAI,IAAI,KAAK,IAAI,GAAG,gBAAgB,IAAI;EACtF,KAAK,KAAK;GACR,MAAM;GACN;GACA;GACA;GACA;GACA,OAAO;EACT,CAAC;CACH;CAEA,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,WAAW,oBAAoB,IAAI,MAAM,aAAa,KAAK;EACjE,MAAM,KAAK,YAAY,KAAK;EAE5B,IAAI,aAAa,WAAW;GAC1B,aAAa,OAAO,QAAQ;GAC5B;EACF;EAEA,IAAI,gBAAgB,UAAU,EAAE,KAAK,KAAK,CAAC,oBAAoB,IAAI,EAAE,GACnE,wBAAwB,EAAE;EAG5B,MAAM,aAAa,mBAAmB,KAAK;EAC3C,MAAM,YAAY,aAAa,EAAE;EAEjC,IAAI,UAAU,UAAU,KAAK,wBAAwB,sBAAsB,EAAE,MAAM,GACjF,cAAc,IAAI,SAAS;EAG7B,IAAI,eAAe,KAAA,GAAW;GAC5B,WAAW,OAAO,UAAU,UAAU;GACtC;EACF;EAEA,MAAM,eAAe,UAAU;EAC/B,IAAI,iBAAiB,KAAA,GAAW;GAC9B,WAAW,OAAO,UAAU,YAAY;GACxC;EACF;EAGA,WAAW,OAAO,UADG,gBAAgB,cAAc,MAAM,IAAI,CACtB,CAAC;CAC1C;CAEA,OAAO,EAAE,KAAK;AAChB"}

package/dist/migration-list-graph-topology-Be1d8Y89.d.mts

@@ -1,13 +0,0 @@
-import { t as MigrationListEntry } from "./migration-list-types-0YjFETIv.mjs";
-
-//#region src/migration-list-graph-topology.d.ts
-type EdgeKind = 'forward' | 'rollback' | 'self';
-interface MigrationGraphTopology {
-  readonly kindByMigrationHash: ReadonlyMap<string, EdgeKind>;
-  readonly forwardInDegree: ReadonlyMap<string, number>;
-  readonly forwardOutDegree: ReadonlyMap<string, number>;
-}
-declare function classifyMigrationListGraphTopology(entries: readonly MigrationListEntry[]): MigrationGraphTopology;
-//#endregion
-export { MigrationGraphTopology as n, classifyMigrationListGraphTopology as r, EdgeKind as t };
-//# sourceMappingURL=migration-list-graph-topology-Be1d8Y89.d.mts.map

package/dist/migration-list-graph-topology-Be1d8Y89.d.mts.map

@@ -1 +0,0 @@
-{"version":3,"file":"migration-list-graph-topology-Be1d8Y89.d.mts","names":[],"sources":["../src/migration-list-graph-topology.ts"],"mappings":";;;KAGY,QAAA;AAAA,UAEK,sBAAA;EAAA,SACN,mBAAA,EAAqB,WAAA,SAAoB,QAAA;EAAA,SACzC,eAAA,EAAiB,WAAA;EAAA,SACjB,gBAAA,EAAkB,WAAA;AAAA;AAAA,iBAqBb,kCAAA,CACd,OAAA,WAAkB,kBAAA,KACjB,sBAAsB"}

package/dist/migration-list-graph-topology-BtFzbZ9L.mjs

@@ -1,103 +0,0 @@
-import "./constants-DWV9_o2Z.mjs";
-//#region src/migration-list-graph-topology.ts
-function canonicalFrom(from) {
-	return from ?? "sha256:empty";
-}
-function compareDirNameDesc(a, b) {
-	return b.dirName.localeCompare(a.dirName);
-}
-function bumpDegree(map, key) {
-	map.set(key, (map.get(key) ?? 0) + 1);
-}
-function classifyMigrationListGraphTopology(entries) {
-	const nodes = /* @__PURE__ */ new Set();
-	const kindByMigrationHash = /* @__PURE__ */ new Map();
-	const outgoingByFrom = /* @__PURE__ */ new Map();
-	for (const entry of entries) {
-		const from = canonicalFrom(entry.from);
-		const to = entry.to;
-		nodes.add(from);
-		nodes.add(to);
-		if (from === to) {
-			kindByMigrationHash.set(entry.migrationHash, "self");
-			continue;
-		}
-		const bucket = outgoingByFrom.get(from);
-		const edge = {
-			entry,
-			from,
-			to
-		};
-		if (bucket) bucket.push(edge);
-		else outgoingByFrom.set(from, [edge]);
-	}
-	for (const bucket of outgoingByFrom.values()) bucket.sort((a, b) => compareDirNameDesc(a.entry, b.entry));
-	const nonSelfInDegree = /* @__PURE__ */ new Map();
-	for (const node of nodes) nonSelfInDegree.set(node, 0);
-	for (const bucket of outgoingByFrom.values()) for (const edge of bucket) bumpDegree(nonSelfInDegree, edge.to);
-	const dfsRoots = [];
-	for (const node of nodes) if ((nonSelfInDegree.get(node) ?? 0) === 0) dfsRoots.push(node);
-	dfsRoots.sort((a, b) => {
-		if (a === "sha256:empty") return -1;
-		if (b === "sha256:empty") return 1;
-		return a.localeCompare(b);
-	});
-	if (dfsRoots.length === 0) dfsRoots.push(...[...nodes].sort((a, b) => a.localeCompare(b)));
-	const WHITE = 0;
-	const GRAY = 1;
-	const BLACK = 2;
-	const color = /* @__PURE__ */ new Map();
-	for (const node of nodes) color.set(node, WHITE);
-	const stack = [];
-	function pushFrame(node) {
-		color.set(node, GRAY);
-		stack.push({
-			node,
-			outgoing: outgoingByFrom.get(node) ?? [],
-			index: 0
-		});
-	}
-	function runDfsFrom(root) {
-		if (color.get(root) !== WHITE) return;
-		pushFrame(root);
-		while (stack.length > 0) {
-			const frame = stack[stack.length - 1];
-			if (frame === void 0) break;
-			if (frame.index >= frame.outgoing.length) {
-				color.set(frame.node, BLACK);
-				stack.pop();
-				continue;
-			}
-			const edge = frame.outgoing[frame.index];
-			frame.index += 1;
-			if (edge === void 0) continue;
-			const v = edge.to;
-			const vColor = color.get(v);
-			if (vColor === GRAY) kindByMigrationHash.set(edge.entry.migrationHash, "rollback");
-			else {
-				kindByMigrationHash.set(edge.entry.migrationHash, "forward");
-				if (vColor === WHITE) pushFrame(v);
-			}
-		}
-	}
-	for (const root of dfsRoots) runDfsFrom(root);
-	for (const root of nodes) runDfsFrom(root);
-	const forwardInDegree = /* @__PURE__ */ new Map();
-	const forwardOutDegree = /* @__PURE__ */ new Map();
-	for (const entry of entries) {
-		if (kindByMigrationHash.get(entry.migrationHash) !== "forward") continue;
-		const from = canonicalFrom(entry.from);
-		const to = entry.to;
-		bumpDegree(forwardOutDegree, from);
-		bumpDegree(forwardInDegree, to);
-	}
-	return {
-		kindByMigrationHash,
-		forwardInDegree,
-		forwardOutDegree
-	};
-}
-//#endregion
-export { classifyMigrationListGraphTopology as t };
-
-//# sourceMappingURL=migration-list-graph-topology-BtFzbZ9L.mjs.map

package/dist/migration-list-graph-topology-BtFzbZ9L.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"migration-list-graph-topology-BtFzbZ9L.mjs","names":[],"sources":["../src/migration-list-graph-topology.ts"],"sourcesContent":["import { EMPTY_CONTRACT_HASH } from './constants';\nimport type { MigrationListEntry } from './migration-list-types';\n\nexport type EdgeKind = 'forward' | 'rollback' | 'self';\n\nexport interface MigrationGraphTopology {\n  readonly kindByMigrationHash: ReadonlyMap<string, EdgeKind>;\n  readonly forwardInDegree: ReadonlyMap<string, number>;\n  readonly forwardOutDegree: ReadonlyMap<string, number>;\n}\n\ninterface NonSelfEdge {\n  readonly entry: MigrationListEntry;\n  readonly from: string;\n  readonly to: string;\n}\n\nfunction canonicalFrom(from: string | null): string {\n  return from ?? EMPTY_CONTRACT_HASH;\n}\n\nfunction compareDirNameDesc(a: MigrationListEntry, b: MigrationListEntry): number {\n  return b.dirName.localeCompare(a.dirName);\n}\n\nfunction bumpDegree(map: Map<string, number>, key: string): void {\n  map.set(key, (map.get(key) ?? 0) + 1);\n}\n\nexport function classifyMigrationListGraphTopology(\n  entries: readonly MigrationListEntry[],\n): MigrationGraphTopology {\n  const nodes = new Set<string>();\n  const kindByMigrationHash = new Map<string, EdgeKind>();\n  const outgoingByFrom = new Map<string, NonSelfEdge[]>();\n\n  for (const entry of entries) {\n    const from = canonicalFrom(entry.from);\n    const to = entry.to;\n    nodes.add(from);\n    nodes.add(to);\n\n    if (from === to) {\n      kindByMigrationHash.set(entry.migrationHash, 'self');\n      continue;\n    }\n\n    const bucket = outgoingByFrom.get(from);\n    const edge: NonSelfEdge = { entry, from, to };\n    if (bucket) bucket.push(edge);\n    else outgoingByFrom.set(from, [edge]);\n  }\n\n  for (const bucket of outgoingByFrom.values()) {\n    bucket.sort((a, b) => compareDirNameDesc(a.entry, b.entry));\n  }\n\n  const nonSelfInDegree = new Map<string, number>();\n  for (const node of nodes) {\n    nonSelfInDegree.set(node, 0);\n  }\n  for (const bucket of outgoingByFrom.values()) {\n    for (const edge of bucket) {\n      bumpDegree(nonSelfInDegree, edge.to);\n    }\n  }\n\n  const dfsRoots: string[] = [];\n  for (const node of nodes) {\n    if ((nonSelfInDegree.get(node) ?? 0) === 0) {\n      dfsRoots.push(node);\n    }\n  }\n  dfsRoots.sort((a, b) => {\n    if (a === EMPTY_CONTRACT_HASH) return -1;\n    if (b === EMPTY_CONTRACT_HASH) return 1;\n    return a.localeCompare(b);\n  });\n  if (dfsRoots.length === 0) {\n    dfsRoots.push(...[...nodes].sort((a, b) => a.localeCompare(b)));\n  }\n\n  const WHITE = 0;\n  const GRAY = 1;\n  const BLACK = 2;\n  const color = new Map<string, number>();\n  for (const node of nodes) {\n    color.set(node, WHITE);\n  }\n\n  interface Frame {\n    node: string;\n    outgoing: readonly NonSelfEdge[];\n    index: number;\n  }\n  const stack: Frame[] = [];\n\n  function pushFrame(node: string): void {\n    color.set(node, GRAY);\n    stack.push({ node, outgoing: outgoingByFrom.get(node) ?? [], index: 0 });\n  }\n\n  function runDfsFrom(root: string): void {\n    if (color.get(root) !== WHITE) return;\n    pushFrame(root);\n\n    while (stack.length > 0) {\n      const frame = stack[stack.length - 1];\n      if (frame === undefined) break;\n      if (frame.index >= frame.outgoing.length) {\n        color.set(frame.node, BLACK);\n        stack.pop();\n        continue;\n      }\n\n      const edge = frame.outgoing[frame.index];\n      frame.index += 1;\n      if (edge === undefined) continue;\n\n      const v = edge.to;\n      const vColor = color.get(v);\n      if (vColor === GRAY) {\n        kindByMigrationHash.set(edge.entry.migrationHash, 'rollback');\n      } else {\n        kindByMigrationHash.set(edge.entry.migrationHash, 'forward');\n        if (vColor === WHITE) {\n          pushFrame(v);\n        }\n      }\n    }\n  }\n\n  for (const root of dfsRoots) {\n    runDfsFrom(root);\n  }\n  for (const root of nodes) {\n    runDfsFrom(root);\n  }\n\n  const forwardInDegree = new Map<string, number>();\n  const forwardOutDegree = new Map<string, number>();\n\n  for (const entry of entries) {\n    if (kindByMigrationHash.get(entry.migrationHash) !== 'forward') continue;\n    const from = canonicalFrom(entry.from);\n    const to = entry.to;\n    bumpDegree(forwardOutDegree, from);\n    bumpDegree(forwardInDegree, to);\n  }\n\n  return {\n    kindByMigrationHash,\n    forwardInDegree,\n    forwardOutDegree,\n  };\n}\n"],"mappings":";;AAiBA,SAAS,cAAc,MAA6B;CAClD,OAAO,QAAA;AACT;AAEA,SAAS,mBAAmB,GAAuB,GAA+B;CAChF,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO;AAC1C;AAEA,SAAS,WAAW,KAA0B,KAAmB;CAC/D,IAAI,IAAI,MAAM,IAAI,IAAI,GAAG,KAAK,KAAK,CAAC;AACtC;AAEA,SAAgB,mCACd,SACwB;CACxB,MAAM,wBAAQ,IAAI,IAAY;CAC9B,MAAM,sCAAsB,IAAI,IAAsB;CACtD,MAAM,iCAAiB,IAAI,IAA2B;CAEtD,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,OAAO,cAAc,MAAM,IAAI;EACrC,MAAM,KAAK,MAAM;EACjB,MAAM,IAAI,IAAI;EACd,MAAM,IAAI,EAAE;EAEZ,IAAI,SAAS,IAAI;GACf,oBAAoB,IAAI,MAAM,eAAe,MAAM;GACnD;EACF;EAEA,MAAM,SAAS,eAAe,IAAI,IAAI;EACtC,MAAM,OAAoB;GAAE;GAAO;GAAM;EAAG;EAC5C,IAAI,QAAQ,OAAO,KAAK,IAAI;OACvB,eAAe,IAAI,MAAM,CAAC,IAAI,CAAC;CACtC;CAEA,KAAK,MAAM,UAAU,eAAe,OAAO,GACzC,OAAO,MAAM,GAAG,MAAM,mBAAmB,EAAE,OAAO,EAAE,KAAK,CAAC;CAG5D,MAAM,kCAAkB,IAAI,IAAoB;CAChD,KAAK,MAAM,QAAQ,OACjB,gBAAgB,IAAI,MAAM,CAAC;CAE7B,KAAK,MAAM,UAAU,eAAe,OAAO,GACzC,KAAK,MAAM,QAAQ,QACjB,WAAW,iBAAiB,KAAK,EAAE;CAIvC,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,QAAQ,OACjB,KAAK,gBAAgB,IAAI,IAAI,KAAK,OAAO,GACvC,SAAS,KAAK,IAAI;CAGtB,SAAS,MAAM,GAAG,MAAM;EACtB,IAAI,MAAA,gBAA2B,OAAO;EACtC,IAAI,MAAA,gBAA2B,OAAO;EACtC,OAAO,EAAE,cAAc,CAAC;CAC1B,CAAC;CACD,IAAI,SAAS,WAAW,GACtB,SAAS,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;CAGhE,MAAM,QAAQ;CACd,MAAM,OAAO;CACb,MAAM,QAAQ;CACd,MAAM,wBAAQ,IAAI,IAAoB;CACtC,KAAK,MAAM,QAAQ,OACjB,MAAM,IAAI,MAAM,KAAK;CAQvB,MAAM,QAAiB,CAAC;CAExB,SAAS,UAAU,MAAoB;EACrC,MAAM,IAAI,MAAM,IAAI;EACpB,MAAM,KAAK;GAAE;GAAM,UAAU,eAAe,IAAI,IAAI,KAAK,CAAC;GAAG,OAAO;EAAE,CAAC;CACzE;CAEA,SAAS,WAAW,MAAoB;EACtC,IAAI,MAAM,IAAI,IAAI,MAAM,OAAO;EAC/B,UAAU,IAAI;EAEd,OAAO,MAAM,SAAS,GAAG;GACvB,MAAM,QAAQ,MAAM,MAAM,SAAS;GACnC,IAAI,UAAU,KAAA,GAAW;GACzB,IAAI,MAAM,SAAS,MAAM,SAAS,QAAQ;IACxC,MAAM,IAAI,MAAM,MAAM,KAAK;IAC3B,MAAM,IAAI;IACV;GACF;GAEA,MAAM,OAAO,MAAM,SAAS,MAAM;GAClC,MAAM,SAAS;GACf,IAAI,SAAS,KAAA,GAAW;GAExB,MAAM,IAAI,KAAK;GACf,MAAM,SAAS,MAAM,IAAI,CAAC;GAC1B,IAAI,WAAW,MACb,oBAAoB,IAAI,KAAK,MAAM,eAAe,UAAU;QACvD;IACL,oBAAoB,IAAI,KAAK,MAAM,eAAe,SAAS;IAC3D,IAAI,WAAW,OACb,UAAU,CAAC;GAEf;EACF;CACF;CAEA,KAAK,MAAM,QAAQ,UACjB,WAAW,IAAI;CAEjB,KAAK,MAAM,QAAQ,OACjB,WAAW,IAAI;CAGjB,MAAM,kCAAkB,IAAI,IAAoB;CAChD,MAAM,mCAAmB,IAAI,IAAoB;CAEjD,KAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,oBAAoB,IAAI,MAAM,aAAa,MAAM,WAAW;EAChE,MAAM,OAAO,cAAc,MAAM,IAAI;EACrC,MAAM,KAAK,MAAM;EACjB,WAAW,kBAAkB,IAAI;EACjC,WAAW,iBAAiB,EAAE;CAChC;CAEA,OAAO;EACL;EACA;EACA;CACF;AACF"}

package/src/exports/migration-list-graph-layout.ts

@@ -1,9 +0,0 @@
-export type {
-  ConnectorKind,
-  ConnectorLayoutRow,
-  LayoutRow,
-  MigrationLayoutRow,
-  MigrationListGraphLayout,
-  NodeLineLayoutRow,
-} from '../migration-list-graph-layout';
-export { computeMigrationListGraphLayout } from '../migration-list-graph-layout';

package/src/migration-list-graph-layout.ts

@@ -1,256 +0,0 @@
-import { EMPTY_CONTRACT_HASH } from './constants';
-import { classifyMigrationListGraphTopology, type EdgeKind } from './migration-list-graph-topology';
-import type { MigrationListEntry } from './migration-list-types';
-
-export type ConnectorKind = 'fanBelow' | 'joinBelow';
-
-export interface MigrationLayoutRow {
-  readonly kind: 'migration';
-  readonly entry: MigrationListEntry;
-  readonly edgeKind: EdgeKind;
-  readonly laneIndex: number;
-  readonly passThroughLanes: readonly number[];
-  readonly woven: boolean;
-}
-
-export interface NodeLineLayoutRow {
-  readonly kind: 'nodeLine';
-  readonly contractHash: string;
-  readonly laneIndex: number;
-}
-
-export interface ConnectorLayoutRow {
-  readonly kind: 'connector';
-  readonly connectorKind: ConnectorKind;
-  readonly contractHash: string;
-  readonly startLane: number;
-  readonly endLane: number;
-  readonly branchCount: number;
-}
-
-export type LayoutRow = MigrationLayoutRow | NodeLineLayoutRow | ConnectorLayoutRow;
-
-export interface MigrationListGraphLayout {
-  readonly rows: readonly LayoutRow[];
-}
-
-interface LaneState {
-  want: string;
-  active: boolean;
-}
-
-function canonicalFrom(from: string | null): string {
-  return from ?? EMPTY_CONTRACT_HASH;
-}
-
-function canonicalTo(entry: MigrationListEntry): string {
-  return entry.to;
-}
-
-function forwardInDegree(
-  topology: ReturnType<typeof classifyMigrationListGraphTopology>,
-  hash: string,
-): number {
-  return topology.forwardInDegree.get(hash) ?? 0;
-}
-
-function forwardOutDegree(
-  topology: ReturnType<typeof classifyMigrationListGraphTopology>,
-  hash: string,
-): number {
-  return topology.forwardOutDegree.get(hash) ?? 0;
-}
-
-function buildForwardProducersByTo(
-  entries: readonly MigrationListEntry[],
-  kindByMigrationHash: ReadonlyMap<string, EdgeKind>,
-): Map<string, MigrationListEntry[]> {
-  const byTo = new Map<string, MigrationListEntry[]>();
-  for (const entry of entries) {
-    if (kindByMigrationHash.get(entry.migrationHash) !== 'forward') continue;
-    const to = canonicalTo(entry);
-    const bucket = byTo.get(to);
-    if (bucket) bucket.push(entry);
-    else byTo.set(to, [entry]);
-  }
-  return byTo;
-}
-
-function countForwardProducersTo(
-  forwardProducersByTo: Map<string, MigrationListEntry[]>,
-  contract: string,
-): number {
-  return forwardProducersByTo.get(contract)?.length ?? 0;
-}
-
-export function computeMigrationListGraphLayout(
-  entries: readonly MigrationListEntry[],
-): MigrationListGraphLayout {
-  const topology = classifyMigrationListGraphTopology(entries);
-  const { kindByMigrationHash } = topology;
-  const forwardProducersByTo = buildForwardProducersByTo(entries, kindByMigrationHash);
-  const convergencesEmitted = new Set<string>();
-  const producerLaneByHash = new Map<string, number>();
-  const lanes: LaneState[] = [];
-  const rows: LayoutRow[] = [];
-
-  function emitNodeLine(contractHash: string): void {
-    rows.push({ kind: 'nodeLine', contractHash, laneIndex: 0 });
-  }
-
-  function emitConnector(
-    connectorKind: ConnectorKind,
-    contractHash: string,
-    startLane: number,
-    endLane: number,
-    branchCount: number,
-  ): void {
-    rows.push({
-      kind: 'connector',
-      connectorKind,
-      contractHash,
-      startLane,
-      endLane,
-      branchCount,
-    });
-  }
-
-  function activeLaneIndices(): number[] {
-    const indices: number[] = [];
-    for (let index = 0; index < lanes.length; index++) {
-      if (lanes[index]?.active) indices.push(index);
-    }
-    return indices;
-  }
-
-  function lanesWanting(contract: string): number[] {
-    const indices: number[] = [];
-    for (let index = 0; index < lanes.length; index++) {
-      const lane = lanes[index];
-      if (lane?.active && lane.want === contract) indices.push(index);
-    }
-    return indices;
-  }
-
-  function ensureLane(index: number): void {
-    while (lanes.length <= index) {
-      lanes.push({ want: '', active: false });
-    }
-  }
-
-  function openLaneAtRight(want: string): number {
-    const index = lanes.length;
-    lanes.push({ want, active: true });
-    return index;
-  }
-
-  function closeLane(index: number): void {
-    ensureLane(index);
-    const lane = lanes[index];
-    if (lane) lane.active = false;
-  }
-
-  function emitJoinBelow(contractHash: string, laneIndices: readonly number[]): void {
-    if (laneIndices.length < 2) return;
-    const startLane = Math.min(...laneIndices);
-    const endLane = Math.max(...laneIndices);
-    emitConnector('joinBelow', contractHash, startLane, endLane, laneIndices.length);
-    for (const index of laneIndices) {
-      if (index !== startLane) closeLane(index);
-    }
-  }
-
-  function emitConvergencePreamble(contract: string): void {
-    if (convergencesEmitted.has(contract)) return;
-    if (forwardInDegree(topology, contract) < 2) return;
-
-    const consumersWanting = lanesWanting(contract);
-    if (forwardOutDegree(topology, contract) >= 2 && consumersWanting.length >= 2) {
-      emitJoinBelow(contract, consumersWanting);
-    }
-
-    emitNodeLine(contract);
-    const producers = forwardProducersByTo.get(contract) ?? [];
-    if (producers.length >= 2) {
-      emitConnector('fanBelow', contract, 0, producers.length - 1, producers.length);
-    }
-
-    for (const [producerIndex, producer] of producers.entries()) {
-      ensureLane(producerIndex);
-      lanes[producerIndex] = { want: canonicalFrom(producer.from), active: true };
-      producerLaneByHash.set(producer.migrationHash, producerIndex);
-    }
-
-    convergencesEmitted.add(contract);
-  }
-
-  function assignProducerLane(entry: MigrationListEntry): number | undefined {
-    const preset = producerLaneByHash.get(entry.migrationHash);
-    if (preset !== undefined) return preset;
-    return undefined;
-  }
-
-  function placeWoven(entry: MigrationListEntry, edgeKind: EdgeKind, laneIndex: number): void {
-    const passThroughLanes = activeLaneIndices().filter((index) => index !== laneIndex);
-    rows.push({
-      kind: 'migration',
-      entry,
-      edgeKind,
-      laneIndex,
-      passThroughLanes,
-      woven: true,
-    });
-    ensureLane(laneIndex);
-    lanes[laneIndex] = { want: canonicalFrom(entry.from), active: true };
-  }
-
-  function placeUnwoven(entry: MigrationListEntry, edgeKind: EdgeKind): void {
-    const passThroughLanes = activeLaneIndices();
-    const laneIndex = passThroughLanes.length === 0 ? 0 : Math.max(...passThroughLanes) + 1;
-    rows.push({
-      kind: 'migration',
-      entry,
-      edgeKind,
-      laneIndex,
-      passThroughLanes,
-      woven: false,
-    });
-  }
-
-  for (const entry of entries) {
-    const edgeKind = kindByMigrationHash.get(entry.migrationHash) ?? 'forward';
-    const to = canonicalTo(entry);
-
-    if (edgeKind !== 'forward') {
-      placeUnwoven(entry, edgeKind);
-      continue;
-    }
-
-    if (forwardInDegree(topology, to) >= 2 && !convergencesEmitted.has(to)) {
-      emitConvergencePreamble(to);
-    }
-
-    const presetLane = assignProducerLane(entry);
-    const wantingTo = lanesWanting(to);
-
-    if (wantingTo.length >= 2 && countForwardProducersTo(forwardProducersByTo, to) === 1) {
-      emitJoinBelow(to, wantingTo);
-    }
-
-    if (presetLane !== undefined) {
-      placeWoven(entry, edgeKind, presetLane);
-      continue;
-    }
-
-    const firstWanting = wantingTo[0];
-    if (firstWanting !== undefined) {
-      placeWoven(entry, edgeKind, firstWanting);
-      continue;
-    }
-
-    const tipLaneIndex = openLaneAtRight(canonicalFrom(entry.from));
-    placeWoven(entry, edgeKind, tipLaneIndex);
-  }
-
-  return { rows };
-}