@voltro/database 0.55.0 → 0.56.0

package/dist/sql.js

@@ -1,13 +1,13 @@
 import { $ as e, $t as t, Ht as n, Ut as r, a as i, at as a, c as o, d as s, en as c, et as l, g as u, h as d, i as f, it as p, o as m, r as h, s as g, tt as _, u as v, vt as y, wt as b, y as x } from "./frameworkLiveTables-CwDemhjW.js";
 import { Effect as S, Schedule as C } from "effect";
-import { createHash as ee } from "node:crypto";
-import { createLogger as te } from "@voltro/logger";
-import { SqlClient as w } from "@effect/sql";
-import { promises as ne } from "node:fs";
-import { join as re } from "node:path";
-import { pathToFileURL as ie } from "node:url";
+import { createHash as w } from "node:crypto";
+import { createLogger as T } from "@voltro/logger";
+import { SqlClient as E } from "@effect/sql";
+import { promises as ee } from "node:fs";
+import { join as te } from "node:path";
+import { pathToFileURL as ne } from "node:url";
 //#region src/migrations/ddlError.ts
-var ae = (e, t, n, r = 400) => {
+var re = (e, t, n, r = 400) => {
 	let i = n, a = i.cause ?? {}, o = (e) => {
 		let t = a[e];
 		return t == null || t === "" ? void 0 : String(t);
@@ -38,21 +38,21 @@ var ae = (e, t, n, r = 400) => {
 		let t = o(e);
 		t !== void 0 && s.push(`db.${e}: ${t}`);
 	}
-	let c = oe(o("code"));
+	let c = ie(o("code"));
 	return c !== void 0 && s.push("", c), s.push(""), s.join("\n");
-}, oe = (e) => e === "3F000" ? "remedy: the connection's search_path names a schema that does not exist. Voltro sets it from DB_SCHEMA — create the schema (`CREATE SCHEMA \"<name>\"`) or unset DB_SCHEMA to use the connection default. Voltro creates TABLES, never the schema itself: that is a namespace decision, and inventing one from a typo is how a migration lands somewhere nobody is looking." : void 0, se = (e) => e.unique === !0 && typeof e.where == "string" && e.where.length > 0, ce = (e) => e.replace(/"/g, "`"), le = (e) => typeof e == "string" ? e : e.name ?? String(e), ue = (e, t) => `_ua_${t}_${e}`.slice(0, 64), de = (e, t) => {
-	if (t !== "mysql" && t !== "mariadb" || !e.appliedIndexes.some(se)) return e;
+}, ie = (e) => e === "3F000" ? "remedy: the connection's search_path names a schema that does not exist. Voltro sets it from DB_SCHEMA — create the schema (`CREATE SCHEMA \"<name>\"`) or unset DB_SCHEMA to use the connection default. Voltro creates TABLES, never the schema itself: that is a namespace decision, and inventing one from a typo is how a migration lands somewhere nobody is looking." : void 0, ae = (e) => e.unique === !0 && typeof e.where == "string" && e.where.length > 0, oe = (e) => e.replace(/"/g, "`"), se = (e) => typeof e == "string" ? e : e.name ?? String(e), ce = (e, t) => `_ua_${t}_${e}`.slice(0, 64), le = (e, t) => {
+	if (t !== "mysql" && t !== "mariadb" || !e.appliedIndexes.some(ae)) return e;
 	let n = { ...e.fields }, r = [], i = [];
 	for (let t of e.appliedIndexes) {
-		if (!se(t)) {
+		if (!ae(t)) {
 			r.push(t);
 			continue;
 		}
-		let a = ce(t.where), o = [];
+		let a = oe(t.where), o = [];
 		for (let r of t.fields) {
-			let i = le(r);
+			let i = se(r);
 			if (!(i in e.fields)) throw Error(`@voltro/migrate: uniqueActive '${t.name}' on '${e.tableName}' references unknown column '${i}'.`);
-			let s = ue(t.name, i);
+			let s = ce(t.name, i);
 			o.push(s), n[s] = {
 				type: "text",
 				nullable: !0,
@@ -75,73 +75,73 @@ var ae = (e, t, n, r = 400) => {
 		appliedIndexes: r,
 		appliedUniques: [...e.appliedUniques ?? [], ...i]
 	};
-}, T = (e, t) => `${e}::${t}`, fe = (e, t) => {
+}, D = (e, t) => `${e}::${t}`, ue = (e, t) => {
 	let n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = (e) => {
 		n.add(e);
 		let o = [...t(e)].filter((t) => t.target !== e).sort((e, t) => e.column.localeCompare(t.column));
-		for (let t of o) n.has(t.target) ? i.add(T(e, t.column)) : r.has(t.target) || a(t.target);
+		for (let t of o) n.has(t.target) ? i.add(D(e, t.column)) : r.has(t.target) || a(t.target);
 		n.delete(e), r.add(e);
 	};
 	for (let t of [...e].sort()) r.has(t) || a(t);
 	return i;
-}, pe = 6322741009312437n, me = (e) => {
+}, de = 6322741009312437n, fe = (e) => {
 	let t = e?.trim();
 	return t === void 0 || t === "" || t === "public" ? void 0 : t;
-}, he = (e) => e?.schema === void 0 ? me(process.env.DB_SCHEMA) : me(e.schema), ge = 14695981039346656037n, _e = 1099511628211n, ve = 18446744073709551615n, ye = (e) => {
-	let t = ge;
-	for (let n of new TextEncoder().encode(e)) t ^= BigInt(n), t = t * _e & ve;
+}, pe = (e) => e?.schema === void 0 ? fe(process.env.DB_SCHEMA) : fe(e.schema), me = 14695981039346656037n, he = 1099511628211n, ge = 18446744073709551615n, _e = (e) => {
+	let t = me;
+	for (let n of new TextEncoder().encode(e)) t ^= BigInt(n), t = t * he & ge;
 	return t;
-}, be = (e) => {
-	let t = me(e);
-	return t === void 0 ? pe : ye(`voltro_migration_lock:${t}`) & 9223372036854775807n;
-}, E = (e) => {
-	let t = `voltro_migration_${pe.toString(36)}`, n = me(e);
+}, ve = (e) => {
+	let t = fe(e);
+	return t === void 0 ? de : _e(`voltro_migration_lock:${t}`) & 9223372036854775807n;
+}, ye = (e) => {
+	let t = `voltro_migration_${de.toString(36)}`, n = fe(e);
 	if (n === void 0) return t;
 	let r = `${t}_${n}`;
-	return /^[A-Za-z0-9_]+$/.test(n) && r.length <= 64 ? r : `${t}_h${(ye(`voltro_migration_lock:${n}`) & ve).toString(16)}`;
-}, xe = 250, Se = () => {
+	return /^[A-Za-z0-9_]+$/.test(n) && r.length <= 64 ? r : `${t}_h${(_e(`voltro_migration_lock:${n}`) & ge).toString(16)}`;
+}, be = 250, xe = () => {
 	let e = Number(process.env.VOLTRO_MIGRATION_LOCK_TIMEOUT_MS);
 	return Number.isFinite(e) && e > 0 ? e : 3e4;
-}, Ce = (e, t) => S.gen(function* () {
-	let n = Se(), r = Date.now();
+}, Se = (e, t) => S.gen(function* () {
+	let n = xe(), r = Date.now();
 	for (;;) {
 		if ((yield* e`
         SELECT pg_try_advisory_lock(${t.toString()}::bigint) AS got`)[0]?.got) return;
-		Date.now() - r >= n && (yield* S.die(/* @__PURE__ */ Error(`could not acquire the postgres migration advisory lock within ${Math.round(n / 1e3)}s. Another migration is in progress, or a prior boot crashed while holding it. (A crashed process's session-level advisory lock is released once its DB connection closes; if this persists, find + terminate the holder via pg_stat_activity, or raise VOLTRO_MIGRATION_LOCK_TIMEOUT_MS.)`))), yield* S.sleep(`${xe} millis`);
+		Date.now() - r >= n && (yield* S.die(/* @__PURE__ */ Error(`could not acquire the postgres migration advisory lock within ${Math.round(n / 1e3)}s. Another migration is in progress, or a prior boot crashed while holding it. (A crashed process's session-level advisory lock is released once its DB connection closes; if this persists, find + terminate the holder via pg_stat_activity, or raise VOLTRO_MIGRATION_LOCK_TIMEOUT_MS.)`))), yield* S.sleep(`${be} millis`);
 	}
-}), we = (e, t) => S.gen(function* () {
+}), Ce = (e, t) => S.gen(function* () {
 	yield* e`SELECT pg_advisory_unlock(${t.toString()}::bigint)`;
-}), Te = 30, Ee = (e, t) => S.gen(function* () {
+}), we = 30, Te = (e, t) => S.gen(function* () {
 	(yield* e`
-      SELECT GET_LOCK(${t}, ${Te}) AS got`)[0]?.got !== 1 && (yield* S.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' within ${Te}s (another migration is in progress, or a prior one left it held).`)));
-}), De = (e, t) => S.gen(function* () {
+      SELECT GET_LOCK(${t}, ${we}) AS got`)[0]?.got !== 1 && (yield* S.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' within ${we}s (another migration is in progress, or a prior one left it held).`)));
+}), Ee = (e, t) => S.gen(function* () {
 	yield* e`SELECT RELEASE_LOCK(${t})`;
-}), Oe = 3e4, ke = (e, t) => S.gen(function* () {
+}), De = 3e4, Oe = (e, t) => S.gen(function* () {
 	let n = yield* e`
       DECLARE @res int;
       EXEC @res = sp_getapplock @Resource = ${t}, @LockMode = 'Exclusive',
-        @LockOwner = 'Session', @LockTimeout = ${Oe};
+        @LockOwner = 'Session', @LockTimeout = ${De};
       SELECT @res AS res`;
 	(n[0]?.res ?? -999) < 0 && (yield* S.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' (sp_getapplock returned ${n[0]?.res ?? "no row"}; another migration is in progress).`)));
-}), Ae = (e, t) => S.gen(function* () {
+}), ke = (e, t) => S.gen(function* () {
 	yield* e`EXEC sp_releaseapplock @Resource = ${t}, @LockOwner = 'Session'`;
-}), je = S.void, D = (e, t) => {
-	let n = he(t);
+}), Ae = S.void, je = (e, t) => {
+	let n = pe(t);
 	return e.onDialectOrElse({
-		mysql: () => Ee(e, E(n)),
-		mssql: () => ke(e, E(n)),
-		sqlite: () => je,
-		orElse: () => Ce(e, be(n))
+		mysql: () => Te(e, ye(n)),
+		mssql: () => Oe(e, ye(n)),
+		sqlite: () => Ae,
+		orElse: () => Se(e, ve(n))
 	});
 }, O = (e, t) => {
-	let n = he(t);
+	let n = pe(t);
 	return e.onDialectOrElse({
-		mysql: () => De(e, E(n)),
-		mssql: () => Ae(e, E(n)),
-		sqlite: () => je,
-		orElse: () => we(e, be(n))
+		mysql: () => Ee(e, ye(n)),
+		mssql: () => ke(e, ye(n)),
+		sqlite: () => Ae,
+		orElse: () => Ce(e, ve(n))
 	});
-}, Me = (e, t, n) => S.acquireUseRelease(D(e, n), () => t, () => O(e, n).pipe(S.orDie)), Ne = (e) => e.onDialectOrElse({
+}, Me = (e, t, n) => S.acquireUseRelease(je(e, n), () => t, () => O(e, n).pipe(S.orDie)), Ne = (e) => e.onDialectOrElse({
 	pg: () => "postgres",
 	mysql: () => "mysql",
 	mssql: () => "mssql",
@@ -217,7 +217,7 @@ var ae = (e, t, n, r = 400) => {
 Object.keys(Pe);
 //#endregion
 //#region src/migrations/reactiveTriggerName.ts
-var A = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "framework_changes" ? `${qe}${e}` : `${qe}${t}_${e}`, Ye = (e) => e === "framework_changes" ? "framework_notify_change" : `framework_notify_change_${e}`, Xe = "voltro:notify:v2", Ze = te({ scope: "voltro:migrate" }), j = (e) => {
+var A = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "framework_changes" ? `${qe}${e}` : `${qe}${t}_${e}`, Ye = (e) => e === "framework_changes" ? "framework_notify_change" : `framework_notify_change_${e}`, Xe = "voltro:notify:v2", Ze = T({ scope: "voltro:migrate" }), j = (e) => {
 	Ze.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
 }, M = (e, t) => {
 	let n = e.type;
@@ -615,7 +615,7 @@ $$ LANGUAGE plpgsql;
 	for (let n of e.stale) r.push(`DROP TRIGGER IF EXISTS ${Je(n, t)} ON "${n}"`), r.push(`ALTER TABLE "${n}" REPLICA IDENTITY DEFAULT`);
 	return r;
 }, mt = (e) => e.some((e) => Object.values(e.fields).some((e) => e.type === "vector")), ht = (e) => e.some((e) => Object.values(e.fields).some((e) => e.spatial !== void 0)), gt = (e) => {
-	let t = new Map(e.map((e) => [e.tableName, e])), n = fe(e.map((e) => e.tableName), (e) => {
+	let t = new Map(e.map((e) => [e.tableName, e])), n = ue(e.map((e) => e.tableName), (e) => {
 		let n = t.get(e);
 		return n ? Object.entries(n.fields).flatMap(([e, n]) => {
 			if (n.type !== "reference" || !n.references) return [];
@@ -626,7 +626,7 @@ $$ LANGUAGE plpgsql;
 			}] : [];
 		}) : [];
 	}), r = [];
-	for (let t of e) for (let [e, i] of Object.entries(t.fields)) i.type !== "reference" || !i.references || n.has(T(t.tableName, e)) && r.push({
+	for (let t of e) for (let [e, i] of Object.entries(t.fields)) i.type !== "reference" || !i.references || n.has(D(t.tableName, e)) && r.push({
 		table: t.tableName,
 		column: e,
 		targetTable: i.references().tableName,
@@ -637,7 +637,7 @@ $$ LANGUAGE plpgsql;
 		if (!(i.has(e.tableName) || a.has(e.tableName))) {
 			a.add(e.tableName);
 			for (let [r, i] of Object.entries(e.fields)) {
-				if (i.type !== "reference" || !i.references || n.has(T(e.tableName, r))) continue;
+				if (i.type !== "reference" || !i.references || n.has(D(e.tableName, r))) continue;
 				let a = i.references();
 				if (a.tableName === e.tableName) continue;
 				let o = t.get(a.tableName);
@@ -712,7 +712,7 @@ BEGIN
 		views: n
 	};
 }, St = (e, t, n = A) => {
-	let { tables: r, views: i } = xt(e), { sorted: a, cyclic: o } = gt(r.map((e) => de(e, t))), s = vt(o, t), c = [];
+	let { tables: r, views: i } = xt(e), { sorted: a, cyclic: o } = gt(r.map((e) => le(e, t))), s = vt(o, t), c = [];
 	t === "postgres" && mt(a) && c.push("CREATE EXTENSION IF NOT EXISTS vector;"), t === "postgres" && ht(a) && c.push("CREATE EXTENSION IF NOT EXISTS postgis;");
 	let u = bt(a, t);
 	u && c.push(u);
@@ -758,7 +758,7 @@ BEGIN
 	for (let e of i) o.push(_t(e, t));
 	return o.push(...lt(r, t, n)), o.join("\n\n") + "\n";
 }, Et = (e, t = "postgres", n = A, r = {}) => S.gen(function* () {
-	let i = yield* w.SqlClient;
+	let i = yield* E.SqlClient;
 	yield* Me(i, Nt(i, St(e, t, n), t, r.retryFilter), { schema: r.lockSchema }).pipe(S.orDie);
 }), Dt = (e, t) => {
 	let n = t.cause ?? {};
@@ -781,17 +781,17 @@ BEGIN
 		this.statement = e, this.error = t;
 	}
 }, Mt = (e, t, n) => S.gen(function* () {
-	let r = yield* w.SqlClient, i = n !== void 0 && Fe(t) === "per-operation";
+	let r = yield* E.SqlClient, i = n !== void 0 && Fe(t) === "per-operation";
 	for (let a of Pt(e)) {
 		process.env.VOLTRO_MIGRATE_DEBUG === "1" && Ze.debug(`EXEC: ${a.replace(/\s+/g, " ").slice(0, 180)}`);
 		let e = r.unsafe(a).pipe(S.catchIf((e) => Dt(a, e), () => S.succeed([])), S.tapError((e) => S.sync(() => {
-			Ze.error(ae("migrate: statement failed", a, e, 200));
+			Ze.error(re("migrate: statement failed", a, e, 200));
 		})));
 		yield* (i && n !== void 0 && Ot(a, t) ? e.pipe(S.retry(At((e) => n(e) === "retry"))) : e).pipe(S.mapError((e) => new jt(a, e)));
 	}
 }), Nt = (e, t, n, r) => {
 	let i = n === "turso" ? Mt(t, n, r) : e.withTransaction(Mt(t, n, r)), a = (e) => e instanceof jt ? e.error : e;
-	return (r !== void 0 && Fe(n) === "plan-transactional" ? i.pipe(S.retry(At((e) => r(a(e)) === "retry"))) : i).pipe(S.orDieWith((e) => e instanceof jt ? Error(ae("migrate: statement failed", e.statement, e.error, 400).trim()) : e));
+	return (r !== void 0 && Fe(n) === "plan-transactional" ? i.pipe(S.retry(At((e) => r(a(e)) === "retry"))) : i).pipe(S.orDieWith((e) => e instanceof jt ? Error(re("migrate: statement failed", e.statement, e.error, 400).trim()) : e));
 }, Pt = (e) => {
 	let t = [], n = "", r = !1;
 	for (let i = 0; i < e.length; i++) {
@@ -810,7 +810,7 @@ BEGIN
 }, Ft = async (e, t, n = "postgres", r = {}) => {
 	await S.runPromise(Et(e, n, void 0, r).pipe(S.provide(t)));
 }, It = (e, t, n = "postgres", r = {}) => S.gen(function* () {
-	let i = wt(e, n, t), a = yield* w.SqlClient;
+	let i = wt(e, n, t), a = yield* E.SqlClient;
 	yield* Me(a, Nt(a, i, n, r.retryFilter), { schema: r.lockSchema }).pipe(S.orDie);
 }), Lt = async (e, t, n, r = "postgres", i = {}) => {
 	await S.runPromise(It(e, t, r, i).pipe(S.provide(n))), await s({
@@ -819,7 +819,7 @@ BEGIN
 	});
 }, Rt = async (e, t, n = "postgres", r = {}) => {
 	await S.runPromise(S.gen(function* () {
-		let t = Tt(e, n), i = yield* w.SqlClient;
+		let t = Tt(e, n), i = yield* E.SqlClient;
 		yield* Me(i, Nt(i, t, n, r.retryFilter), { schema: r.lockSchema }).pipe(S.orDie);
 	}).pipe(S.provide(t)));
 }, zt = (e) => {
@@ -842,7 +842,7 @@ BEGIN
 	indexes: Ht(e.indexes)
 })).sort((e, t) => e.name.localeCompare(t.name)), Wt = (e) => {
 	let t = { tables: Ut(e.tables) }, n = JSON.stringify(zt(t));
-	return ee("sha256").update(n).digest("hex");
+	return w("sha256").update(n).digest("hex");
 }, Gt = (e) => e.slice(0, 16), Kt = (e, t) => {
 	let n = t.references ? {
 		table: t.references().tableName,
@@ -956,7 +956,7 @@ BEGIN
 		t.set(e.name, n.name);
 	}
 }, I = (e, t) => {
-	let n = e.filter((e) => !i(e.tableName)).map((e) => Jt(de(e, t)));
+	let n = e.filter((e) => !i(e.tableName)).map((e) => Jt(le(e, t)));
 	return Yt(n), { tables: n };
 }, Xt = (e, t, n = A) => S.gen(function* () {
 	let r = (yield* e`
@@ -1475,8 +1475,8 @@ BEGIN
 			column: e.name,
 			target: e.references.table
 		}] : []) : [];
-	}, d = fe([...c], u), p = [];
-	for (let e of t.tables) if (c.has(e.name)) for (let t of e.columns) !t.references || !d.has(T(e.name, t.name)) || p.push(R({
+	}, d = ue([...c], u), p = [];
+	for (let e of t.tables) if (c.has(e.name)) for (let t of e.columns) !t.references || !d.has(D(e.name, t.name)) || p.push(R({
 		kind: "add-foreign-key",
 		table: e.name,
 		column: t.name,
@@ -1491,8 +1491,8 @@ BEGIN
 			let n = a[t];
 			if (n.op.kind !== "create-table") continue;
 			let r = n.op;
-			if (!r.columns.some((e) => d.has(T(r.table, e.name)))) continue;
-			let i = r.columns.map((t) => d.has(T(r.table, t.name)) ? e(t) : t);
+			if (!r.columns.some((e) => d.has(D(r.table, e.name)))) continue;
+			let i = r.columns.map((t) => d.has(D(r.table, t.name)) ? e(t) : t);
 			a[t] = {
 				...n,
 				op: {
@@ -1512,7 +1512,7 @@ BEGIN
 		let i = new Set(t).add(e), a = 0;
 		for (let t of r.columns) {
 			let n = t.references?.table;
-			n && n !== e && !d.has(T(e, t.name)) && (a = Math.max(a, _(n, i) + 1));
+			n && n !== e && !d.has(D(e, t.name)) && (a = Math.max(a, _(n, i) + 1));
 		}
 		return g.set(e, a), a;
 	}, v = (e) => e === "rename-table" ? -1 : e === "create-table" ? 0 : e === "drop-table" ? 2 : 1, y = (e) => {
@@ -1721,18 +1721,18 @@ BEGIN
 			let t = v.get(e.table_name);
 			t || (t = /* @__PURE__ */ new Set(), v.set(e.table_name, t)), t.add(e.column_name);
 		}
-		let ee = /* @__PURE__ */ new Map();
+		let w = /* @__PURE__ */ new Map();
 		for (let e of f) {
-			let t = `${e.table_name}\u0000${e.constraint_name}`, n = ee.get(t);
+			let t = `${e.table_name}\u0000${e.constraint_name}`, n = w.get(t);
 			n || (n = {
 				table: e.table_name,
 				columns: []
-			}, ee.set(t, n)), n.columns.push({
+			}, w.set(t, n)), n.columns.push({
 				name: e.column_name,
 				position: e.position
 			});
 		}
-		for (let [e, t] of ee) {
+		for (let [e, t] of w) {
 			let n = [...t.columns].sort((e, t) => e.position - t.position).map((e) => e.name);
 			if (n.length === 1) {
 				let e = y.get(t.table);
@@ -1757,7 +1757,7 @@ BEGIN
 			let n = t.get(e.index_name);
 			n || (n = [], t.set(e.index_name, n)), n.push(e);
 		}
-		let te = [];
+		let T = [];
 		for (let e of c) {
 			let t = /* @__PURE__ */ new Set(), n = (_.get(e.table_name) ?? []).filter((e) => !t.has(e.column_name) && (t.add(e.column_name), !0)), r = v.get(e.table_name) ?? /* @__PURE__ */ new Set(), i = y.get(e.table_name) ?? /* @__PURE__ */ new Set(), a = x.get(e.table_name) ?? [], o = new Map(a.map((e) => [e.source_column, e])), s = new Set(n.filter((e) => e.udt_name === "tsvector").map((e) => e.column_name)), c = n.filter((e) => !s.has(e.column_name)).map((t) => {
 				let n = r.has(t.column_name) && r.size === 1, a = o.get(t.column_name), s = a ? "reference" : n && t.column_name === "id" ? "id" : Fn(t.data_type, t.udt_name), c = a ? {
@@ -1802,14 +1802,14 @@ BEGIN
 				unique: !0
 			});
 			let d = Number(e.row_count ?? 0);
-			te.push({
+			T.push({
 				name: e.table_name,
 				columns: c,
 				indexes: l,
 				...d > 0 ? { rowCount: d } : {}
 			});
 		}
-		return { tables: te };
+		return { tables: T };
 	});
 	return (t > 0 ? e.withTransaction(n) : n).pipe(S.catchAll((e) => {
 		let n = `${String(e)} ${String(e.cause ?? "")}`.toLowerCase();
@@ -2567,9 +2567,9 @@ BEGIN
 		};
 	};
 }, X = (e, t, n, r = []) => e.unsafe(t).pipe(S.catchIf((e) => ar(e, r), () => S.void), S.tapError((e) => S.sync(() => {
-	process.stderr.write(ae(`applier: statement failed (op=${n})`, t, e, 400));
+	process.stderr.write(re(`applier: statement failed (op=${n})`, t, e, 400));
 })), S.mapError((e) => {
-	let r = ae(`applier: statement failed (op=${n})`, t, e, 400).trim();
+	let r = re(`applier: statement failed (op=${n})`, t, e, 400).trim();
 	return Object.assign(e, { message: r });
 }), S.map(() => void 0)), Z = (e, t, n) => S.forEach(t, (t) => X(e, t, n), { discard: !0 }), Q = (e, t) => e.literal(`LIMIT ${Math.max(1, Math.floor(Number.isFinite(t) ? t : 1))}`), $ = (e, t, n, r) => e.unsafe(`SELECT ${r === void 0 ? "*" : _(r, t)} FROM ${_(n, t)} WHERE 1=0`).pipe(S.as(!0), S.catchAll(() => S.succeed(!1))), Ai = (e, t) => S.gen(function* () {
 	let n = I([Ie], t).tables[0];
@@ -2909,69 +2909,89 @@ BEGIN
 			planned: e.planned
 		}))
 	});
-}), zi = (e, t, n) => S.gen(function* () {
+}), zi = (e) => {
+	let t = e.op, n = (e) => typeof t[e] == "string" ? t[e] : "";
+	return [
+		t.kind,
+		n("table"),
+		n("column"),
+		n("name"),
+		n("to")
+	].join("\0");
+}, Bi = (e, t, n) => S.gen(function* () {
 	let r = t.operations.filter((e) => e.blocked);
 	if (r.length > 0) return yield* S.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — ${r.length} blocked operations. Run \`voltro db plan\` to see the fixes.`));
-	yield* D(e, { schema: n.lockSchema });
-	let i = Date.now(), a = [], o = Ne(e), s = Fe(o) === "plan-transactional", c = s ? t.operations.filter((e) => e.classification !== "online-required") : [], l = s ? t.operations.filter((e) => e.classification === "online-required") : t.operations, u = `plan_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 8)}`, d = l.map((e, t) => ({
+	yield* je(e, { schema: n.lockSchema });
+	let i = Date.now(), a = [], o = Ne(e), s = yield* n.replan(e), c = new Set(t.operations.filter((e) => !e.blocked).map((e) => zi(e))), l = {
+		...s,
+		operations: s.operations.map((e) => {
+			if (!e.blocked || !c.has(zi(e))) return e;
+			let { blocked: t, ...n } = e;
+			return n;
+		})
+	};
+	(l.operations.length !== t.operations.length || l.toFingerprint !== t.toFingerprint) && (yield* S.logInfo(`migration: re-planned under the lock — ${t.operations.length} operation(s) became ${l.operations.length}. Another writer changed the schema while this plan waited.`).pipe(S.annotateLogs({ scope: "voltro:migrate" })));
+	let u = l.operations.filter((e) => e.blocked);
+	if (u.length > 0) return yield* O(e, { schema: n.lockSchema }).pipe(S.orDie), yield* S.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — re-planning under the migration lock found ${u.length} blocked operation(s). Run \`voltro db plan\` to see the fixes.`));
+	let d = Fe(o) === "plan-transactional", f = d ? l.operations.filter((e) => e.classification !== "online-required") : [], p = d ? l.operations.filter((e) => e.classification === "online-required") : l.operations, m = `plan_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 8)}`, h = p.map((e, t) => ({
 		index: t,
 		planned: e
-	})), f = "fresh";
+	})), g = "fresh";
 	try {
 		yield* Ai(e, o);
-		let r = yield* ji(e);
-		if (r.length > 0) {
-			let n = yield* Ri(e, o, t, r);
-			n.kind === "resume" ? (u = n.runId, d = n.ops, f = "resume") : (yield* S.logWarning(`migration resume: discarding the ledger of run ${n.runId} — ${n.why}`).pipe(S.annotateLogs({ scope: "voltro:migrate" })), yield* Fi(e, n.runId));
+		let t = yield* ji(e);
+		if (t.length > 0) {
+			let n = yield* Ri(e, o, l, t);
+			n.kind === "resume" ? (m = n.runId, h = n.ops, g = "resume") : (yield* S.logWarning(`migration resume: discarding the ledger of run ${n.runId} — ${n.why}`).pipe(S.annotateLogs({ scope: "voltro:migrate" })), yield* Fi(e, n.runId));
 		}
-		f === "fresh" && d.length > 0 && (yield* Mi(e, u, t.toFingerprint, d)), c.length > 0 && (yield* e.withTransaction(S.gen(function* () {
-			let e = yield* w.SqlClient;
-			for (let t of c) a.push(yield* Li(e, t, n));
+		g === "fresh" && h.length > 0 && (yield* Mi(e, m, l.toFingerprint, h)), f.length > 0 && (yield* e.withTransaction(S.gen(function* () {
+			let e = yield* E.SqlClient;
+			for (let t of f) a.push(yield* Li(e, t, n));
 		})));
-		for (let { index: t, planned: r } of d) {
-			yield* Ni(e, u, t, "started");
-			let i = a.length, o = yield* Li(e, r, n, f).pipe(S.mapError((e) => Object.assign(e, { message: `${String(e?.message ?? e)}\n\n  progress: ${i} of ${d.length + c.length} operation(s) applied before this one${c.length > 0 ? ` (${c.length} of them in a transaction)` : ""}.\n` + (s ? "  This dialect applies a plan atomically, so the run is rolled back.\n" : `  This dialect does NOT apply a plan atomically: those ${i} are COMMITTED and there is no rollback.\n  The next \`voltro db apply\` resumes from operation ${t} — the ledger records the sequence.\n`) })));
-			a.push(o), yield* Ni(e, u, t, "applied", o.durationMs);
+		for (let { index: t, planned: r } of h) {
+			yield* Ni(e, m, t, "started");
+			let i = a.length, o = yield* Li(e, r, n, g).pipe(S.mapError((e) => Object.assign(e, { message: `${String(e?.message ?? e)}\n\n  progress: ${i} of ${h.length + f.length} operation(s) applied before this one${f.length > 0 ? ` (${f.length} of them in a transaction)` : ""}.\n` + (d ? "  This dialect applies a plan atomically, so the run is rolled back.\n" : `  This dialect does NOT apply a plan atomically: those ${i} are COMMITTED and there is no rollback.\n  The next \`voltro db apply\` resumes from operation ${t} — the ledger records the sequence.\n`) })));
+			a.push(o), yield* Ni(e, m, t, "applied", o.durationMs);
 		}
 	} finally {
 		yield* O(e, { schema: n.lockSchema }).pipe(S.orDie);
 	}
-	let p = yield* n.replan(e);
-	if (p.operations.length > 0) {
-		let e = p.operations.slice(0, 10).map((e) => `  - ${e.op.kind} ${"table" in e.op ? e.op.table : ""}${"column" in e.op ? `.${String(e.op.column)}` : ""}`).join("\n");
-		return yield* S.die(/* @__PURE__ */ Error(`applyPlan: the migration did not converge. ${t.operations.length} operation(s) were executed without error, but re-planning against the live schema still finds ${p.operations.length}:\n${e}${p.operations.length > 10 ? `\n  … and ${p.operations.length - 10} more` : ""}\nNo fingerprint was recorded — recording one would make the next boot report "schema up to date" for a schema that was never applied. This is a framework bug; the schema is unchanged and safe.\nTwo causes look identical from here, so read the list before assuming either:\n  - the DDL for those operations is a no-op (it succeeded and changed nothing), or\n  - the planner cannot see what the DDL did, so it proposes the same work again — which is what an\n    operation naming an object a PREVIOUS operation created or renamed usually means.\nReport the operation kinds above with the column types involved.`));
+	let _ = yield* n.replan(e);
+	if (_.operations.length > 0) {
+		let e = _.operations.slice(0, 10).map((e) => `  - ${e.op.kind} ${"table" in e.op ? e.op.table : ""}${"column" in e.op ? `.${String(e.op.column)}` : ""}`).join("\n");
+		return yield* S.die(/* @__PURE__ */ Error(`applyPlan: the migration did not converge. ${l.operations.length} operation(s) were executed without error, but re-planning against the live schema still finds ${_.operations.length}:\n${e}${_.operations.length > 10 ? `\n  … and ${_.operations.length - 10} more` : ""}\nNo fingerprint was recorded — recording one would make the next boot report "schema up to date" for a schema that was never applied. This is a framework bug; the schema is unchanged and safe.\nTwo causes look identical from here, so read the list before assuming either:\n  - the DDL for those operations is a no-op (it succeeded and changed nothing), or\n  - the planner cannot see what the DDL did, so it proposes the same work again — which is what an\n    operation naming an object a PREVIOUS operation created or renamed usually means.\nReport the operation kinds above with the column types involved.`));
 	}
-	let m = a.filter((e) => e.status === "applied").length, h = Date.now() - i, g = u, _ = (/* @__PURE__ */ new Date()).toISOString(), y = yield* W(e, _), b = [...c, ...d.map((e) => e.planned)];
+	let y = a.filter((e) => e.status === "applied").length, b = Date.now() - i, x = m, C = (/* @__PURE__ */ new Date()).toISOString(), w = yield* W(e, C), T = [...f, ...h.map((e) => e.planned)];
 	yield* e`
       INSERT INTO ${e("_voltro_migration_plans")}
         (${e("id")}, ${e("fingerprint")}, ${e("liveFingerprint")}, ${e("operations")},
          ${e("appliedBy")}, ${e("environment")}, ${e("source")},
          ${e("durationMs")}, ${e("appliedAt")}, ${e("notes")})
       VALUES
-        (${g}, ${t.toFingerprint}, ${p.fromFingerprint}, ${JSON.stringify(b)},
+        (${x}, ${l.toFingerprint}, ${_.fromFingerprint}, ${JSON.stringify(T)},
          ${n.appliedBy}, ${n.environment}, ${n.source},
-         ${h}, ${y}, ${n.notes ?? null})
-    `, yield* Fi(e, u);
-	let x = [...new Set(b.flatMap((e) => e.op.kind === "rename-table" ? [e.op.to] : [e.op.table]))];
-	return yield* S.promise(() => v({ changedTables: x }).catch(() => {})), {
-		id: g,
-		appliedAt: _,
-		fingerprint: t.toFingerprint,
-		operations: b,
+         ${b}, ${w}, ${n.notes ?? null})
+    `, yield* Fi(e, m);
+	let ee = [...new Set(T.flatMap((e) => e.op.kind === "rename-table" ? [e.op.to] : [e.op.table]))];
+	return yield* S.promise(() => v({ changedTables: ee }).catch(() => {})), {
+		id: x,
+		appliedAt: C,
+		fingerprint: l.toFingerprint,
+		operations: T,
 		appliedBy: n.appliedBy,
 		environment: n.environment,
-		durationMs: h,
-		appliedOps: m,
+		durationMs: b,
+		appliedOps: y,
 		source: n.source,
 		...n.notes ? { notes: n.notes } : {}
 	};
-}), Bi = (e) => e.operations.filter((e) => e.blocked).map((e) => `  - ${e.op.kind} ${"table" in e.op ? `[${e.op.table}]` : ""}: ${e.reason ?? "<no reason>"}\n    fix: ${e.blocked?.fix ?? "<no fix>"}`).join("\n"), Vi = (e) => e`
+}), Vi = (e) => e.operations.filter((e) => e.blocked).map((e) => `  - ${e.op.kind} ${"table" in e.op ? `[${e.op.table}]` : ""}: ${e.reason ?? "<no reason>"}\n    fix: ${e.blocked?.fix ?? "<no fix>"}`).join("\n"), Hi = (e) => e`
     SELECT fingerprint
     FROM _voltro_migration_plans
     ORDER BY ${e("appliedAt")} DESC
     LIMIT 1
-  `.pipe(S.map((e) => e.length > 0 ? e[0].fingerprint : void 0), S.catchAll(() => S.succeed(void 0))), Hi = (e, t, n) => S.gen(function* () {
-	if ((yield* Vi(e)) === t.toFingerprint) return "already-current";
+  `.pipe(S.map((e) => e.length > 0 ? e[0].fingerprint : void 0), S.catchAll(() => S.succeed(void 0))), Ui = (e, t, n) => S.gen(function* () {
+	if ((yield* Hi(e)) === t.toFingerprint) return "already-current";
 	let r = `plan_${Date.now().toString(36)}`, i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
 	return yield* e`
       INSERT INTO ${e("_voltro_migration_plans")}
@@ -2983,8 +3003,8 @@ BEGIN
          ${n.appliedBy}, ${n.environment}, ${n.source},
          ${0}, ${i}, ${"no DDL — the declared schema already matched the database"})
     `, "recorded";
-}).pipe(S.catchAll(() => S.succeed("already-current"))), Ui = (e, t) => S.gen(function* () {
-	let n = Wt(I(t, Ne(e))), r = yield* Vi(e);
+}).pipe(S.catchAll(() => S.succeed("already-current"))), Wi = (e, t) => S.gen(function* () {
+	let n = Wt(I(t, Ne(e))), r = yield* Hi(e);
 	return r === n ? {
 		kind: "up-to-date",
 		fingerprint: n
@@ -2993,23 +3013,23 @@ BEGIN
 		expected: n,
 		...r === void 0 ? {} : { actual: r }
 	};
-}), Wi = [
+}), Gi = [
 	"pgeagertest_",
 	"mig_e2e_",
 	"mig_test_",
 	"mysqleagertest_",
 	"mssqleagertest_",
 	"sqliteeagertest_"
-], Gi = (e) => Wi.some((t) => e.startsWith(t)), Ki = (e, t) => S.gen(function* () {
+], Ki = (e) => Gi.some((t) => e.startsWith(t)), qi = (e, t) => S.gen(function* () {
 	if (process.env.VOLTRO_TEST_FIXTURE_GC === "off") return [];
-	let n = t.filter((e) => Gi(e.name)).map((e) => e.name);
+	let n = t.filter((e) => Ki(e.name)).map((e) => e.name);
 	if (n.length === 0) return [];
 	for (let t of n) yield* e.unsafe(`DROP TABLE IF EXISTS "${t}" CASCADE`).pipe(S.catchAll(() => S.void));
 	return n;
-}), qi = () => {
+}), Ji = () => {
 	let e = (process.env.VOLTRO_DB_IGNORE_TABLES ?? "").split(",").map((e) => e.trim()).filter((e) => e.length > 0);
 	return e.length > 0 ? { ignoreTables: e } : {};
-}, Ji = (e) => {
+}, Yi = (e) => {
 	if (e === void 0) return;
 	let t = e.trim();
 	if (t === "") return;
@@ -3019,30 +3039,30 @@ BEGIN
 		kind: "tables",
 		tables: new Set(n)
 	} : void 0;
-}, Yi = (e) => typeof e.table == "string" ? e.table : void 0, Xi = (e, t = { kind: "all" }) => ({
+}, Xi = (e) => typeof e.table == "string" ? e.table : void 0, Zi = (e, t = { kind: "all" }) => ({
 	...e,
 	operations: e.operations.map((e) => {
 		if (!e.blocked || e.classification !== "lossy") return e;
 		if (t?.kind === "tables") {
-			let n = Yi(e.op);
+			let n = Xi(e.op);
 			if (n === void 0 || !t.tables.has(n)) return e;
 		}
 		let { blocked: n, ...r } = e;
 		return r;
 	})
-}), Zi = (e, t, n) => t === "postgres" ? Xt(e, n).pipe(S.flatMap((e) => {
+}), Qi = (e, t, n) => t === "postgres" ? Xt(e, n).pipe(S.flatMap((e) => {
 	let t = Zt(e);
 	return t === void 0 ? S.void : S.logWarning(`auto-migrate: ${t}`).pipe(S.annotateLogs({ scope: "voltro:migrate" }));
-}), S.catchAll(() => S.void)) : S.void, Qi = (e, t, n) => S.gen(function* () {
+}), S.catchAll(() => S.void)) : S.void, $i = (e, t, n) => S.gen(function* () {
 	let r = Ne(e), i = t;
 	if (process.env.VOLTRO_MIGRATE_FORCE !== "1") {
 		let t = Wt(I(i, r));
-		if ((yield* Vi(e)) === t) return yield* Zi(e, r, i), {
+		if ((yield* Hi(e)) === t) return yield* Qi(e, r, i), {
 			kind: "up-to-date",
 			fingerprint: t
 		};
 	}
-	let a = yield* $n(e), o = yield* Ki(e, a.tables);
+	let a = yield* $n(e), o = yield* qi(e, a.tables);
 	o.length > 0 && (yield* S.logInfo(`auto-migrate: reaped ${o.length} test-fixture leftover(s)`).pipe(S.annotateLogs({
 		scope: "voltro:migrate",
 		count: o.length
@@ -3051,16 +3071,16 @@ BEGIN
 		declared: i,
 		live: { tables: c(a.tables) },
 		dialect: r,
-		...qi()
+		...Ji()
 	});
 	if (l.summary.blocked > 0) {
-		let e = l.operations.filter((e) => e.blocked).every((e) => e.classification === "lossy"), t = Ji(process.env.VOLTRO_DESTRUCTIVE_OK);
-		if (t === void 0 || !e || (l = Xi(l, t), l.operations.some((e) => e.blocked))) return {
+		let e = l.operations.filter((e) => e.blocked).every((e) => e.classification === "lossy"), t = Yi(process.env.VOLTRO_DESTRUCTIVE_OK);
+		if (t === void 0 || !e || (l = Zi(l, t), l.operations.some((e) => e.blocked))) return {
 			kind: "refused-blocked",
 			plan: l
 		};
 	}
-	return l.operations.length === 0 ? (yield* Hi(e, l, {
+	return l.operations.length === 0 ? (yield* Ui(e, l, {
 		appliedBy: n.appliedBy,
 		environment: n.environment === "prod" ? "dev" : n.environment,
 		source: "auto-diff"
@@ -3069,7 +3089,7 @@ BEGIN
 		fingerprint: l.toFingerprint
 	}) : {
 		kind: "applied",
-		applied: yield* zi(e, l, {
+		applied: yield* Bi(e, l, {
 			declared: t,
 			appliedBy: n.appliedBy,
 			environment: n.environment === "prod" ? "dev" : n.environment,
@@ -3080,16 +3100,16 @@ BEGIN
 					declared: i,
 					live: { tables: c(t.tables) },
 					dialect: r,
-					...qi()
+					...Ji()
 				});
 			})
 		}),
 		plan: l
 	};
-}), $i = (e, t, n) => process.env.VOLTRO_AUTO_MIGRATE === "0" ? S.succeed({
+}), ea = (e, t, n) => process.env.VOLTRO_AUTO_MIGRATE === "0" ? S.succeed({
 	kind: "skipped",
 	reason: "VOLTRO_AUTO_MIGRATE=0"
-}) : n.environment === "prod" ? Ui(e, t) : Qi(e, t, n), ea = (e, t) => {
+}) : n.environment === "prod" ? Wi(e, t) : $i(e, t, n), ta = (e, t) => {
 	switch (e.kind) {
 		case "skipped": return `auto-migrate: skipped (${e.reason})`;
 		case "up-to-date": return `auto-migrate: schema up to date (${t}, fingerprint=${Gt(e.fingerprint)})`;
@@ -3099,7 +3119,7 @@ BEGIN
 		}
 		case "prod-mismatch": return `auto-migrate: SCHEMA FINGERPRINT MISMATCH — declared=${Gt(e.expected)}` + (e.actual ? ` live=${Gt(e.actual)}` : " live=<no _voltro_migration_plans row>") + ". Run `voltro db apply --plan plan.json` from the deploy pipeline before serving.";
 		case "refused-blocked": {
-			let t = e.plan.operations.filter((e) => e.blocked), n = t.filter((e) => e.op.kind === "drop-table").length, r = t.filter((e) => e.op.kind === "drop-table").map((e) => "table" in e.op ? e.op.table : "").filter(Boolean), i = t.filter((e) => e.op.kind === "add-column").length, a = t.filter((e) => e.op.kind === "drop-column").length, o = t.filter((e) => e.classification === "needs-rename-annotation").length, s = `auto-migrate: REFUSED — ${e.plan.summary.blocked} blocked operation(s):\n` + Bi(e.plan), c = [""];
+			let t = e.plan.operations.filter((e) => e.blocked), n = t.filter((e) => e.op.kind === "drop-table").length, r = t.filter((e) => e.op.kind === "drop-table").map((e) => "table" in e.op ? e.op.table : "").filter(Boolean), i = t.filter((e) => e.op.kind === "add-column").length, a = t.filter((e) => e.op.kind === "drop-column").length, o = t.filter((e) => e.classification === "needs-rename-annotation").length, s = `auto-migrate: REFUSED — ${e.plan.summary.blocked} blocked operation(s):\n` + Vi(e.plan), c = [""];
 			if (n > 0 && c.push(`${n} table(s) exist in the live DB but aren't in your declared schema.`, "This is usually one of three things:", "  (a) You're iterating on the schema — the table file got renamed, moved, or temporarily commented out.", "      → Restore the declaration. Your data stays intact.", "  (b) You want to KEEP the table but NOT manage it with Voltro (a leftover from another tool —", "      a Strapi/Rails/legacy migration artifact, or an externally-owned table).", `      → Set \`VOLTRO_DB_IGNORE_TABLES=${r.join(",")}\` (comma-separated).`, "        The planner excludes those tables from the diff entirely — it never drops them, and they", "        stop blocking your OTHER (additive) changes. This is the fix when a leftover freezes your schema.", "  (c) You actually want to drop the table.", `      → Set \`VOLTRO_DESTRUCTIVE_OK=${r.join(",")}\` for ONE run — it acknowledges`, "        the data loss for THOSE tables only; every other lossy op in this plan stays blocked.", "        (`VOLTRO_DESTRUCTIVE_OK=1` acknowledges all of them, which is rarely what you mean.)", "      There is deliberately no `dropped()` marker for a TABLE, unlike for a column: a", "      dropped column leaves a slot worth documenting in the declaration, a dropped table", "      leaves nothing — the marker would be a dead entry you must remember to delete.", "  Soft-drop: set `VOLTRO_SOFT_DROP=1` alongside DESTRUCTIVE_OK to RENAME instead of DROP", "  (data survives as `<name>__dropped_<ts>` for ~7d; restorable via `voltro db restore-snapshot`)."), i > 0 && c.push(`${i} required column(s) need a backfill strategy before adding to a populated table.`, "  → Annotate the column: `.backfill(sql`<expr>`)` or `.backfill(row => <fn>)` or `.default(<value>)`.", "  Existing rows get the backfill value; the column then lands as NOT NULL."), a > 0) {
 				let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map();
 				for (let r of e.plan.operations) {
@@ -3116,7 +3136,7 @@ BEGIN
 			return o > 0 && c.push(`${o} column(s) look like renames (one column gone + a new one of same shape appeared).`, "  → On the NEW column add `.renamedFrom('<oldName>')` so the planner emits RENAME instead of DROP+ADD."), c.push("", "See `voltro db plan` for the full machine-readable diff."), s + "\n" + c.join("\n");
 		}
 	}
-}, ta = /* @__PURE__ */ new Set([
+}, na = /* @__PURE__ */ new Set([
 	"node_modules",
 	"dist",
 	"build",
@@ -3125,12 +3145,12 @@ BEGIN
 	".next",
 	".git",
 	".framework"
-]), na = async (e) => {
+]), ra = async (e) => {
 	let t = [], n = async (e) => {
-		let r = await ne.readdir(e, { withFileTypes: !0 }).catch(() => []);
+		let r = await ee.readdir(e, { withFileTypes: !0 }).catch(() => []);
 		for (let i of r) {
-			if (ta.has(i.name)) continue;
-			let r = re(e, i.name);
+			if (na.has(i.name)) continue;
+			let r = te(e, i.name);
 			i.isDirectory() ? await n(r) : i.isFile() && m.test(i.name) && t.push(r);
 		}
 	};
@@ -3138,10 +3158,10 @@ BEGIN
 		let n = e.split("/").pop() ?? e, r = t.split("/").pop() ?? t;
 		return n.localeCompare(r);
 	});
-}, ra = async (e) => {
+}, ia = async (e) => {
 	let t = [];
 	for (let n of e) {
-		let e = (await import(ie(n).href)).default;
+		let e = (await import(ne(n).href)).default;
 		if (!g(e)) {
 			process.stderr.write(`[voltro:migrate] ${n} has no default-exported \`migration(...)\` — skipped\n`);
 			continue;
@@ -3152,11 +3172,11 @@ BEGIN
 		});
 	}
 	return t;
-}, ia = (e) => e`
+}, aa = (e) => e`
     SELECT ${e("id")}
     FROM ${e("_voltro_migration_plans")}
     WHERE ${e("source")} = 'file'
-  `.pipe(S.map((e) => e.map((e) => e.id)), S.catchAll(() => S.succeed([]))), aa = class extends Error {
+  `.pipe(S.map((e) => e.map((e) => e.id)), S.catchAll(() => S.succeed([]))), oa = class extends Error {
 	migrationId;
 	file;
 	cause;
@@ -3164,7 +3184,7 @@ BEGIN
 	constructor(e, t, n) {
 		super(`migration ${e}: up() SUCCEEDED but the ledger row could not be written.\n  The change IS in the database. It is NOT recorded, so the next run would apply it AGAIN.\n  Do not re-run ${t} until this is resolved.\n  Cause: ${n instanceof Error ? n.message : String(n)}`), this.migrationId = e, this.file = t, this.cause = n, this.name = "FileMigrationLedgerError";
 	}
-}, oa = (e, t, n, r) => S.gen(function* () {
+}, sa = (e, t, n, r) => S.gen(function* () {
 	let i = Date.now(), a = (/* @__PURE__ */ new Date()).toISOString(), o = {
 		sql: e,
 		log: {
@@ -3198,10 +3218,10 @@ BEGIN
 	}])},
          ${r}, ${n}, ${"file"},
          ${c}, ${l}, ${t.migration.description})
-    `.pipe(S.mapError((e) => new aa(t.migration.id, t.file, e))), { durationMs: c };
-}), sa = (e, t) => S.gen(function* () {
+    `.pipe(S.mapError((e) => new oa(t.migration.id, t.file, e))), { durationMs: c };
+}), ca = (e, t) => S.gen(function* () {
 	let n = yield* S.tryPromise({
-		try: () => na(re(t, "migrations")),
+		try: () => ra(te(t, "migrations")),
 		catch: (e) => e
 	});
 	if (n.length === 0) return {
@@ -3209,25 +3229,25 @@ BEGIN
 		skipped: []
 	};
 	let r = yield* S.tryPromise({
-		try: () => ra(n),
+		try: () => ia(n),
 		catch: (e) => e
 	});
 	if (r.length === 0) return {
 		pending: [],
 		skipped: []
 	};
-	let i = new Set(yield* ia(e));
+	let i = new Set(yield* aa(e));
 	return {
 		pending: r.filter((e) => !i.has(e.migration.id)),
 		skipped: r.filter((e) => i.has(e.migration.id)).map((e) => e.migration.id)
 	};
-}), ca = (e, t) => sa(e, t).pipe(S.map((e) => e.pending.map((e) => e.migration.id))), la = (e, t) => S.gen(function* () {
-	let { pending: n, skipped: r } = yield* sa(e, t.projectRoot);
+}), la = (e, t) => ca(e, t).pipe(S.map((e) => e.pending.map((e) => e.migration.id))), ua = (e, t) => S.gen(function* () {
+	let { pending: n, skipped: r } = yield* ca(e, t.projectRoot);
 	if (n.length === 0) return {
 		applied: [],
 		skipped: r
 	};
-	yield* D(e, { schema: t.lockSchema });
+	yield* je(e, { schema: t.lockSchema });
 	let i = [];
 	try {
 		for (let r of n) {
@@ -3236,7 +3256,7 @@ BEGIN
 				id: r.migration.id,
 				file: r.file
 			}));
-			let { durationMs: n } = yield* oa(e, r, t.env, t.appliedBy);
+			let { durationMs: n } = yield* sa(e, r, t.env, t.appliedBy);
 			i.push({
 				id: r.migration.id,
 				durationMs: n
@@ -3253,22 +3273,22 @@ BEGIN
 		applied: i,
 		skipped: r
 	};
-}), ua = (e, t) => e`
+}), da = (e, t) => e`
     SELECT ${e("id")}
     FROM ${e("_voltro_migration_plans")}
     WHERE ${e("id")} = ${t} AND ${e("source")} = 'file'
     LIMIT 1
-  `, da = (e, t) => S.gen(function* () {
-	if (!(yield* ua(e, t.id))[0]) return yield* S.fail(/* @__PURE__ */ Error(`rollback: ${t.id} not found in _voltro_migration_plans (file source)`));
+  `, fa = (e, t) => S.gen(function* () {
+	if (!(yield* da(e, t.id))[0]) return yield* S.fail(/* @__PURE__ */ Error(`rollback: ${t.id} not found in _voltro_migration_plans (file source)`));
 	let n = yield* S.tryPromise({
-		try: () => na(re(t.projectRoot, "migrations")),
+		try: () => ra(te(t.projectRoot, "migrations")),
 		catch: (e) => e
 	}), r = (yield* S.tryPromise({
-		try: () => ra(n),
+		try: () => ia(n),
 		catch: (e) => e
 	})).find((e) => e.migration.id === t.id);
 	if (!r) return yield* S.fail(/* @__PURE__ */ Error(`rollback: file for migration ${t.id} not found on disk under ${t.projectRoot}/migrations/`));
-	yield* D(e, { schema: t.lockSchema });
+	yield* je(e, { schema: t.lockSchema });
 	let i = Date.now();
 	try {
 		let n = {
@@ -3297,8 +3317,8 @@ BEGIN
 	} finally {
 		yield* O(e, { schema: t.lockSchema }).pipe(S.orDie);
 	}
-}), fa = (e) => S.gen(function* () {
-	let t = yield* w.SqlClient, n = yield* t`
+}), pa = (e) => S.gen(function* () {
+	let t = yield* E.SqlClient, n = yield* t`
       SELECT id, fingerprint, appliedAt FROM _voltro_migration_plans
       WHERE source = 'auto-diff'
         AND squashedAt IS NULL
@@ -3342,7 +3362,7 @@ BEGIN
 		snapshotFingerprint: e.fingerprint,
 		snapshotId: i
 	};
-}), pa = { safe: !0 }, ma = (e) => {
+}), ma = { safe: !0 }, ha = (e) => {
 	switch (e.kind) {
 		case "drop-column": return {
 			safe: !1,
@@ -3369,7 +3389,7 @@ BEGIN
 			reason: `old instances read/write "${e.table}"."${e.column}" as ${e.from}; the new ${e.to} type can reject their writes or fail to decode their reads`,
 			remedy: "add a new column of the target type + backfill + dual-write, cut code over, then drop the old column in a LATER deploy"
 		};
-		case "alter-column-nullability": return e.toNullable ? pa : {
+		case "alter-column-nullability": return e.toNullable ? ma : {
 			safe: !1,
 			reason: `old instances may INSERT "${e.table}" without (or with NULL in) "${e.column}", which the new NOT NULL rejects`,
 			remedy: `make code always write "${e.column}" and deploy that first; add NOT NULL in a LATER deploy (with a default to cover the gap)`
@@ -3399,12 +3419,12 @@ BEGIN
 		case "drop-unique":
 		case "drop-unique-composite":
 		case "drop-foreign-key":
-		case "drop-check": return pa;
+		case "drop-check": return ma;
 	}
-}, ha = (e) => {
+}, ga = (e) => {
 	let t = [];
 	for (let n of e) {
-		let e = ma(n.op);
+		let e = ha(n.op);
 		e.safe || t.push({
 			op: n,
 			reason: e.reason,
@@ -3412,7 +3432,7 @@ BEGIN
 		});
 	}
 	return t;
-}, ga = (e) => {
+}, _a = (e) => {
 	if (!e.enabled || e.unsafeCount === 0) return {
 		refuse: !1,
 		warnForced: !1,
@@ -3428,18 +3448,18 @@ BEGIN
 		warnForced: !1,
 		message: `${t}. Old instances would break against the new schema mid-rollout. Split into expand → deploy → contract (see the ⚠ list above), deploy with no overlap (maintenance window / scale-to-zero), or pass --force to override.`
 	};
-}, _a = (e) => {
+}, va = (e) => {
 	let t = e.table;
 	if (typeof t == "string") return t;
 	let n = e.from;
 	return typeof n == "string" ? n : void 0;
-}, va = (e) => ({
+}, ya = (e) => ({
 	kind: e.op.kind,
-	table: _a(e.op),
+	table: va(e.op),
 	classification: e.classification,
 	reason: e.reason,
 	blockedFix: e.blocked?.fix
-}), ya = (e) => e.operations.map(va), ba = async (e) => {
+}), ba = (e) => e.operations.map(ya), xa = async (e) => {
 	let t = e.log ?? (() => {}), n = {
 		branchId: e.branchId,
 		mechanism: e.mechanism,
@@ -3458,10 +3478,10 @@ BEGIN
 			applied: !1,
 			converged: !1,
 			residual: r,
-			infidelity: ya(o)
+			infidelity: ba(o)
 		};
 		else {
-			let i = await e.plan(), o = ya(i), s = o.filter((e) => e.classification === "lossy"), c = Xi(i), l = c.operations.filter((e) => e.blocked !== void 0).map(va);
+			let i = await e.plan(), o = ba(i), s = o.filter((e) => e.classification === "lossy"), c = Zi(i), l = c.operations.filter((e) => e.blocked !== void 0).map(ya);
 			if (l.length > 0) a = {
 				...n,
 				outcome: "blocked",
@@ -3486,7 +3506,7 @@ BEGIN
 			};
 			else {
 				await e.apply(c), t(`branch ${e.branchId}: applied ${o.length} operation(s)`);
-				let i = ya(await e.replan());
+				let i = ba(await e.replan());
 				a = {
 					...n,
 					outcome: i.length > 0 ? "diverged" : s.length > 0 ? "lossy" : "clean",
@@ -3524,7 +3544,7 @@ BEGIN
 		...a,
 		tornDown: o
 	};
-}, xa = (e) => {
+}, Sa = (e) => {
 	switch (e.outcome) {
 		case "clean": return 0;
 		case "lossy": return 2;
@@ -3533,22 +3553,22 @@ BEGIN
 		case "infidelity": return 1;
 		case "failed": return 1;
 	}
-}, Sa = (e) => `    ${e.classification === "lossy" ? "✗" : "•"} ${e.kind}${e.table ? ` ${e.table}` : ""} [${e.classification}]${e.reason ? ` — ${e.reason}` : ""}${e.blockedFix ? `\n        ! ${e.blockedFix}` : ""}`, Ca = (e) => {
+}, Ca = (e) => `    ${e.classification === "lossy" ? "✗" : "•"} ${e.kind}${e.table ? ` ${e.table}` : ""} [${e.classification}]${e.reason ? ` — ${e.reason}` : ""}${e.blockedFix ? `\n        ! ${e.blockedFix}` : ""}`, wa = (e) => {
 	let t = [];
 	if (t.push(`branch rehearsal · ${e.branchId} · mechanism ${e.mechanism}`), t.push(`  branched ${e.branchedTables} table(s), replayed ${e.replayedForeignKeys} foreign key(s)`), e.outcome === "failed") t.push(`  FAILED: ${e.error ?? "unknown error"}`);
 	else if (e.outcome === "infidelity") {
 		t.push("  BRANCH IS NOT A FAITHFUL COPY of the parent — the rehearsal proves nothing about your migration."), t.push("  The parent's own schema still differs from the branch by:");
-		for (let n of e.infidelity) t.push(Sa(n));
+		for (let n of e.infidelity) t.push(Ca(n));
 	} else {
 		t.push(`  plan: ${e.operations.length} operation(s), ${e.lossy.length} lossy, ${e.blocked.length} refused`);
-		for (let n of e.operations) t.push(Sa(n));
-		if (e.lossy.length > 0 && (t.push(""), t.push(`  ⚠ ${e.lossy.length} operation(s) DESTROY DATA. They were executed on the branch (it is`), t.push("    disposable) so they are rehearsed, but production refuses them until you set"), t.push("    VOLTRO_DESTRUCTIVE_OK — naming the tables, not `1`.")), e.blocked.length > 0 && (t.push(""), t.push(`  ${e.blocked.length} operation(s) the planner will not auto-apply anywhere — the plan was NOT executed.`)), e.applied && (t.push(""), t.push(e.converged ? "  ✓ applied on the branch, and the re-plan is EMPTY (the migration converges)." : `  ✗ applied, but the re-plan STILL proposes ${e.residual.length} operation(s) — this migration does not converge:`), !e.converged)) for (let n of e.residual) t.push(Sa(n));
+		for (let n of e.operations) t.push(Ca(n));
+		if (e.lossy.length > 0 && (t.push(""), t.push(`  ⚠ ${e.lossy.length} operation(s) DESTROY DATA. They were executed on the branch (it is`), t.push("    disposable) so they are rehearsed, but production refuses them until you set"), t.push("    VOLTRO_DESTRUCTIVE_OK — naming the tables, not `1`.")), e.blocked.length > 0 && (t.push(""), t.push(`  ${e.blocked.length} operation(s) the planner will not auto-apply anywhere — the plan was NOT executed.`)), e.applied && (t.push(""), t.push(e.converged ? "  ✓ applied on the branch, and the re-plan is EMPTY (the migration converges)." : `  ✗ applied, but the re-plan STILL proposes ${e.residual.length} operation(s) — this migration does not converge:`), !e.converged)) for (let n of e.residual) t.push(Ca(n));
 	}
 	return t.push(e.tornDown ? `  branch ${e.branchId} torn down.` : `  branch ${e.branchId} KEPT — drop it when you are done.`), t.join("\n");
-}, wa = (e, ...t) => ({
+}, Ta = (e, ...t) => ({
 	_tag: "RawSqlFragment",
 	strings: [...e],
 	values: [...t]
-}), Ta = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
+}), Ea = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
 //#endregion
-export { A as DEFAULT_CDC_CHANNEL, m as FILE_MIGRATION_PATTERN, aa as FileMigrationLedgerError, qe as REACTIVE_TRIGGER_PREFIX, pe as VOLTRO_MIGRATION_LOCK_KEY, D as acquireMigrationLock, W as appliedAtValue, It as applyNamespacedSchema, zi as applyPlan, Et as applySchema, ga as assessRollingDeployGate, xa as branchRehearsalExitCode, Vn as chunkTables, ma as classifyRollingDeploySafety, I as declaredSnapshot, $e as defaultArrayClause, Qe as defaultClause, N as defaultJsonClause, ea as describeOutcome, Ji as destructiveScope, Xt as detectReactiveTriggerDrift, ni as emitAddIndexMysql, Lr as emitCreateTableMysql, _r as emitDropColumnDdl, vr as emitDropColumnDdlMysql, Tt as emitFrameworkBootstrapSql, Ct as emitNamespaceProvisionDdl, wt as emitNamespacedSchemaSql, St as emitSchemaSql, er as engineFromVersion, Wt as fingerprintSchema, ye as fnv1a64, Ca as formatBranchRehearsal, Zt as formatReactiveTriggerDrift, qi as ignoreTablesFromEnv, $n as introspectSchema, ar as isAlreadySatisfied, g as isFileMigration, Ta as isRawSqlFragment, Ot as isReRunSafeDdl, Fn as mapPgType, o as migration, be as migrationLockKeyForSchema, E as migrationLockNameForSchema, Qr as mysqlIndexPrefixFor, Ye as notifyFunctionName, P as numericIdSql, Pn as parseEnumCheck, ca as pendingFileMigrationIds, Nn as planMigrations, Lt as provisionTenantNamespace, Je as reactiveTriggerName, pt as reactiveTriggerRepairSql, Hi as recordUpToDate, ba as rehearseMigrationOnBranch, va as rehearsedOperation, O as releaseMigrationLock, Fr as renderColumnMysql, Ar as renderColumnPg, he as resolveMigrationLockSchema, U as resolveMysqlEngine, da as rollbackFileBasedMigration, ha as rollingDeployUnsafeOps, la as runFileBasedMigrations, Rt as runFrameworkBootstrap, Ft as runMigrate, $i as runPlannedMigrations, Gt as shortFingerprint, Kt as snapshotColumn, wa as sql, M as sqlType, fa as squashMigrationPlans, Xi as unblockLossy, Me as withMigrationLock };
+export { A as DEFAULT_CDC_CHANNEL, m as FILE_MIGRATION_PATTERN, oa as FileMigrationLedgerError, qe as REACTIVE_TRIGGER_PREFIX, de as VOLTRO_MIGRATION_LOCK_KEY, je as acquireMigrationLock, W as appliedAtValue, It as applyNamespacedSchema, Bi as applyPlan, Et as applySchema, _a as assessRollingDeployGate, Sa as branchRehearsalExitCode, Vn as chunkTables, ha as classifyRollingDeploySafety, I as declaredSnapshot, $e as defaultArrayClause, Qe as defaultClause, N as defaultJsonClause, ta as describeOutcome, Yi as destructiveScope, Xt as detectReactiveTriggerDrift, ni as emitAddIndexMysql, Lr as emitCreateTableMysql, _r as emitDropColumnDdl, vr as emitDropColumnDdlMysql, Tt as emitFrameworkBootstrapSql, Ct as emitNamespaceProvisionDdl, wt as emitNamespacedSchemaSql, St as emitSchemaSql, er as engineFromVersion, Wt as fingerprintSchema, _e as fnv1a64, wa as formatBranchRehearsal, Zt as formatReactiveTriggerDrift, Ji as ignoreTablesFromEnv, $n as introspectSchema, ar as isAlreadySatisfied, g as isFileMigration, Ea as isRawSqlFragment, Ot as isReRunSafeDdl, Fn as mapPgType, o as migration, ve as migrationLockKeyForSchema, ye as migrationLockNameForSchema, Qr as mysqlIndexPrefixFor, Ye as notifyFunctionName, P as numericIdSql, Pn as parseEnumCheck, la as pendingFileMigrationIds, Nn as planMigrations, Lt as provisionTenantNamespace, Je as reactiveTriggerName, pt as reactiveTriggerRepairSql, Ui as recordUpToDate, xa as rehearseMigrationOnBranch, ya as rehearsedOperation, O as releaseMigrationLock, Fr as renderColumnMysql, Ar as renderColumnPg, pe as resolveMigrationLockSchema, U as resolveMysqlEngine, fa as rollbackFileBasedMigration, ga as rollingDeployUnsafeOps, ua as runFileBasedMigrations, Rt as runFrameworkBootstrap, Ft as runMigrate, ea as runPlannedMigrations, Gt as shortFingerprint, Kt as snapshotColumn, Ta as sql, M as sqlType, pa as squashMigrationPlans, Zi as unblockLossy, Me as withMigrationLock };