@voltro/database 0.43.0 → 0.43.1

package/dist/sql.js

@@ -94,67 +94,67 @@ var ae = (e, t, n, r = 400) => {
 }, be = (e) => {
 	let t = me(e);
 	return t === void 0 ? pe : ye(`voltro_migration_lock:${t}`) & 9223372036854775807n;
-}, T = (e) => {
+}, xe = (e) => {
 	let t = `voltro_migration_${pe.toString(36)}`, n = me(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 = () => {
+}, Se = 250, Ce = () => {
 	let e = Number(process.env.VOLTRO_MIGRATION_LOCK_TIMEOUT_MS);
 	return Number.isFinite(e) && e > 0 ? e : 3e4;
-}, Ce = (e, t) => x.gen(function* () {
-	let n = Se(), r = Date.now();
+}, we = (e, t) => x.gen(function* () {
+	let n = Ce(), 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* x.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* x.sleep(`${xe} millis`);
+		Date.now() - r >= n && (yield* x.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* x.sleep(`${Se} millis`);
 	}
-}), we = (e, t) => x.gen(function* () {
+}), Te = (e, t) => x.gen(function* () {
 	yield* e`SELECT pg_advisory_unlock(${t.toString()}::bigint)`;
-}), Te = 30, Ee = (e, t) => x.gen(function* () {
+}), Ee = 30, De = (e, t) => x.gen(function* () {
 	(yield* e`
-      SELECT GET_LOCK(${t}, ${Te}) AS got`)[0]?.got !== 1 && (yield* x.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) => x.gen(function* () {
+      SELECT GET_LOCK(${t}, ${Ee}) AS got`)[0]?.got !== 1 && (yield* x.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' within ${Ee}s (another migration is in progress, or a prior one left it held).`)));
+}), Oe = (e, t) => x.gen(function* () {
 	yield* e`SELECT RELEASE_LOCK(${t})`;
-}), Oe = 3e4, ke = (e, t) => x.gen(function* () {
+}), ke = 3e4, Ae = (e, t) => x.gen(function* () {
 	let n = yield* e`
       DECLARE @res int;
       EXEC @res = sp_getapplock @Resource = ${t}, @LockMode = 'Exclusive',
-        @LockOwner = 'Session', @LockTimeout = ${Oe};
+        @LockOwner = 'Session', @LockTimeout = ${ke};
       SELECT @res AS res`;
 	(n[0]?.res ?? -999) < 0 && (yield* x.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) => x.gen(function* () {
+}), je = (e, t) => x.gen(function* () {
 	yield* e`EXEC sp_releaseapplock @Resource = ${t}, @LockOwner = 'Session'`;
-}), je = x.void, E = (e, t) => {
+}), Me = x.void, T = (e, t) => {
 	let n = he(t);
 	return e.onDialectOrElse({
-		mysql: () => Ee(e, T(n)),
-		mssql: () => ke(e, T(n)),
-		sqlite: () => je,
-		orElse: () => Ce(e, be(n))
+		mysql: () => De(e, xe(n)),
+		mssql: () => Ae(e, xe(n)),
+		sqlite: () => Me,
+		orElse: () => we(e, be(n))
 	});
-}, D = (e, t) => {
+}, E = (e, t) => {
 	let n = he(t);
 	return e.onDialectOrElse({
-		mysql: () => De(e, T(n)),
-		mssql: () => Ae(e, T(n)),
-		sqlite: () => je,
-		orElse: () => we(e, be(n))
+		mysql: () => Oe(e, xe(n)),
+		mssql: () => je(e, xe(n)),
+		sqlite: () => Me,
+		orElse: () => Te(e, be(n))
 	});
-}, Me = (e, t, n) => x.acquireUseRelease(E(e, n), () => t, () => D(e, n).pipe(x.orDie)), Ne = (e) => e.onDialectOrElse({
+}, Ne = (e, t, n) => x.acquireUseRelease(T(e, n), () => t, () => E(e, n).pipe(x.orDie)), Pe = (e) => e.onDialectOrElse({
 	pg: () => "postgres",
 	mysql: () => "mysql",
 	mssql: () => "mssql",
 	sqlite: () => "sqlite",
 	orElse: () => "sqlite"
-}), Pe = {
+}), Fe = {
 	postgres: "plan-transactional",
 	mssql: "plan-transactional",
 	mysql: "per-operation",
 	mariadb: "per-operation",
 	sqlite: "per-operation",
 	turso: "per-operation"
-}, Fe = (e) => Pe[e], O = "_voltro_migration_ops", Ie = y(O, {
+}, Ie = (e) => Fe[e], D = "_voltro_migration_ops", Le = y(D, {
 	id: t({ prefix: "mop" }),
 	runId: e(),
 	planFingerprint: e(),
@@ -167,7 +167,7 @@ var ae = (e, t, n, r = 400) => {
 	appliedAt: a().nullable(),
 	durationMs: r().nullable(),
 	createdAt: a().default("now")
-}), Le = (e) => {
+}), Re = (e) => {
 	switch (e.kind) {
 		case "create-table": return /* @__PURE__ */ new Set([
 			`table:${e.table}`,
@@ -194,11 +194,11 @@ var ae = (e, t, n, r = 400) => {
 		case "add-unique-composite":
 		case "drop-unique-composite": return /* @__PURE__ */ new Set([`unique:${e.table}.${e.name}`]);
 	}
-}, Re = (e) => [...Le(e)].join(" "), ze = (e, t) => {
-	let n = Le(t);
-	for (let t of Le(e)) if (n.has(t)) return !0;
+}, ze = (e) => [...Re(e)].join(" "), Be = (e, t) => {
+	let n = Re(t);
+	for (let t of Re(e)) if (n.has(t)) return !0;
 	return !1;
-}, Be = (e, t) => e.operations.some((e) => ze(e.op, t)), Ve = "__voltro_rebuild", He = "__shadow", Ue = "__old", We = /* @__PURE__ */ new Set([
+}, Ve = (e, t) => e.operations.some((e) => Be(e.op, t)), He = "__voltro_rebuild", Ue = "__shadow", We = "__old", Ge = /* @__PURE__ */ new Set([
 	"add-unique",
 	"drop-unique",
 	"add-unique-composite",
@@ -210,16 +210,16 @@ var ae = (e, t, n, r = 400) => {
 	"alter-column-nullability",
 	"alter-column-type",
 	"alter-column-default"
-]), Ge = /* @__PURE__ */ new Set(["alter-column-default", "alter-column-nullability"]), Ke = (e, t, n) => {
+]), Ke = /* @__PURE__ */ new Set(["alter-column-default", "alter-column-nullability"]), qe = (e, t, n) => {
 	let r = n === "sqlite" || n === "turso";
-	return e.kind === "alter-column-type" && t === "online-required" || r && We.has(e.kind) ? "artefact-repair" : Ge.has(e.kind) ? "idempotent" : "probe-then-replay";
+	return e.kind === "alter-column-type" && t === "online-required" || r && Ge.has(e.kind) ? "artefact-repair" : Ke.has(e.kind) ? "idempotent" : "probe-then-replay";
 };
-Object.keys(Pe);
+Object.keys(Fe);
 //#endregion
 //#region src/migrations/reactiveTriggerName.ts
-var k = "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 = ee({ scope: "voltro:migrate" }), A = (e) => {
-	Ze.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
-}, j = (e, t) => {
+var O = "framework_changes", Je = "framework_changes_", Ye = (e, t) => t === "framework_changes" ? `${Je}${e}` : `${Je}${t}_${e}`, Xe = (e) => e === "framework_changes" ? "framework_notify_change" : `framework_notify_change_${e}`, Ze = "voltro:notify:v2", Qe = ee({ scope: "voltro:migrate" }), k = (e) => {
+	Qe.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
+}, A = (e, t) => {
 	let n = e.type;
 	if (e.spatial) {
 		if (t === "postgres") return `${e.spatial.kind}(${e.spatial.geomKind},${e.spatial.srid})`;
@@ -230,7 +230,7 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		return e.rawDdl;
 	}
 	if (n === "array" && e.arrayElement) {
-		if (t === "postgres") return `${j({
+		if (t === "postgres") return `${A({
 			...e,
 			type: e.arrayElement,
 			arrayElement: void 0
@@ -330,22 +330,22 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		case "array": return "TEXT[]";
 		case "interval": return "INTERVAL";
 	}
-}, Qe = (e, t) => {
+}, $e = (e, t) => {
 	if (!e.hasDefault || e.defaultFactory !== void 0) return null;
 	let n = e.defaultValue;
-	return n === "now" ? o(t) ? "DEFAULT CURRENT_TIMESTAMP" : t === "mssql" ? "DEFAULT SYSUTCDATETIME()" : t === "mysql" || t === "mariadb" ? "DEFAULT CURRENT_TIMESTAMP(6)" : "DEFAULT now()" : typeof n == "boolean" ? t === "postgres" ? `DEFAULT ${n}` : `DEFAULT ${+!!n}` : typeof n == "number" ? `DEFAULT ${n}` : typeof n == "string" ? `DEFAULT '${n.replace(/'/g, "''")}'` : Array.isArray(n) ? $e(n, e, t) : typeof n == "object" && n ? M(n, t) : null;
-}, $e = (e, t, n) => {
-	if (n !== "postgres" || t.type !== "array" || t.arrayElement === void 0) return M(e, n);
-	let r = j({
+	return n === "now" ? o(t) ? "DEFAULT CURRENT_TIMESTAMP" : t === "mssql" ? "DEFAULT SYSUTCDATETIME()" : t === "mysql" || t === "mariadb" ? "DEFAULT CURRENT_TIMESTAMP(6)" : "DEFAULT now()" : typeof n == "boolean" ? t === "postgres" ? `DEFAULT ${n}` : `DEFAULT ${+!!n}` : typeof n == "number" ? `DEFAULT ${n}` : typeof n == "string" ? `DEFAULT '${n.replace(/'/g, "''")}'` : Array.isArray(n) ? et(n, e, t) : typeof n == "object" && n ? j(n, t) : null;
+}, et = (e, t, n) => {
+	if (n !== "postgres" || t.type !== "array" || t.arrayElement === void 0) return j(e, n);
+	let r = A({
 		...t,
 		type: t.arrayElement,
 		arrayElement: void 0
 	}, n);
 	return `DEFAULT '{${e.map((e) => typeof e == "number" || typeof e == "boolean" ? String(e) : `"${String(e).replace(/\\/g, "\\\\").replace(/"/g, "\\\"")}"`).join(",").replace(/'/g, "''")}}'::${r}[]`;
-}, M = (e, t) => {
+}, j = (e, t) => {
 	let n = JSON.stringify(e).replace(/'/g, "''");
 	return t === "postgres" ? `DEFAULT '${n}'::jsonb` : t === "mysql" || t === "mariadb" ? `DEFAULT (CONVERT('${n}' USING utf8mb4))` : `DEFAULT '${n}'`;
-}, N = (e, t) => {
+}, M = (e, t) => {
 	switch (t) {
 		case "postgres": return `"${e}" BIGSERIAL PRIMARY KEY`;
 		case "mysql":
@@ -354,7 +354,7 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		case "sqlite": return `"${e}" INTEGER PRIMARY KEY AUTOINCREMENT`;
 		case "turso": return `"${e}" INTEGER PRIMARY KEY`;
 	}
-}, P = (e, t) => {
+}, N = (e, t) => {
 	if (e === "restrict" && t === "mssql") return "NO ACTION";
 	switch (e) {
 		case "cascade": return "CASCADE";
@@ -362,42 +362,42 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		case "setNull": return "SET NULL";
 		case "noAction": return "NO ACTION";
 	}
-}, et = (e, t, r) => r === null ? n(e, t) : `${n(r, t)}.${n(e, t)}`, tt = 191, nt = (e, t) => {
+}, tt = (e, t, r) => r === null ? n(e, t) : `${n(r, t)}.${n(e, t)}`, nt = 191, rt = (e, t) => {
 	if (!e || t !== "mysql" && t !== "mariadb") return !1;
-	let n = j(e, t).toUpperCase();
+	let n = A(e, t).toUpperCase();
 	return n.endsWith("TEXT") || n.endsWith("BLOB");
-}, rt = (e, t, r) => {
+}, it = (e, t, r) => {
 	let i = n(e, r);
 	if (r !== "mysql" && r !== "mariadb") return i;
 	let a = t[e];
 	if (!a) return i;
-	let o = j(a, r).toUpperCase();
-	return o.endsWith("TEXT") || o.endsWith("BLOB") ? `${i}(${tt})` : i;
-}, it = (e, t) => {
+	let o = A(a, r).toUpperCase();
+	return o.endsWith("TEXT") || o.endsWith("BLOB") ? `${i}(${nt})` : i;
+}, at = (e, t) => {
 	if (!e.generatedAs) return null;
 	let { expr: n, stored: r } = e.generatedAs;
-	if (t === "postgres") return r || A("[voltro:migrate] generated column requested as VIRTUAL but postgres only supports STORED — promoting"), `GENERATED ALWAYS AS (${n}) STORED`;
+	if (t === "postgres") return r || k("[voltro:migrate] generated column requested as VIRTUAL but postgres only supports STORED — promoting"), `GENERATED ALWAYS AS (${n}) STORED`;
 	if (t === "mysql" || t === "mariadb") return `GENERATED ALWAYS AS (${n}) ${r ? "STORED" : "VIRTUAL"}`;
 	if (t === "mssql") return `AS (${n})${r ? " PERSISTED" : ""}`;
 	if (t === "turso") throw Error("@voltro/sql-turso: generated columns (.generatedAs(...)) are not supported — Turso's MVCC mode (journal_mode=experimental_mvcc) rejects them. Drop the generated column, or use the 'sqlite' / 'postgres' dialect for this table.");
 	return `GENERATED ALWAYS AS (${n}) ${r ? "STORED" : "VIRTUAL"}`;
-}, at = (e, t, r, a, s = !1, c = !1) => {
-	if (t.type === "id" && t.idScheme?.kind === "numeric") return N(e, r);
-	let l = r === "mssql" && t.type === "text" && !t.generatedAs && t.maxLength === void 0 && a?.has(e) ? "NVARCHAR(450)" : j(t, r), u = [n(e, r), l];
+}, ot = (e, t, r, a, s = !1, c = !1) => {
+	if (t.type === "id" && t.idScheme?.kind === "numeric") return M(e, r);
+	let l = r === "mssql" && t.type === "text" && !t.generatedAs && t.maxLength === void 0 && a?.has(e) ? "NVARCHAR(450)" : A(t, r), u = [n(e, r), l];
 	t.type === "id" && !c && u.push("PRIMARY KEY");
-	let d = it(t, r);
+	let d = at(t, r);
 	if (d) u.push(d);
 	else {
-		t.nullable || u.push("NOT NULL"), t.unique && t.type !== "id" && !nt(t, r) && u.push("UNIQUE");
-		let e = Qe(t, r);
+		t.nullable || u.push("NOT NULL"), t.unique && t.type !== "id" && !rt(t, r) && u.push("UNIQUE");
+		let e = $e(t, r);
 		e && u.push(e);
 	}
 	if (t.type === "reference" && t.references && !s && !i(r)) {
 		let e = t.references();
 		u.push(`REFERENCES ${n(e.tableName, r)} (${n("id", r)})`);
-		let i = P(t.onDelete ?? "restrict", r);
+		let i = N(t.onDelete ?? "restrict", r);
 		u.push(`ON DELETE ${i}`);
-		let a = P(t.refOnUpdate ?? "noAction", r);
+		let a = N(t.refOnUpdate ?? "noAction", r);
 		a !== "NO ACTION" && u.push(`ON UPDATE ${a}`);
 	}
 	if (t.oneOf && t.oneOf.length > 0) {
@@ -414,23 +414,23 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		o(r) ? u.push(`CHECK (${t} IS NULL OR json_valid(${t}))`) : r === "mssql" && u.push(`CHECK (${t} IS NULL OR ISJSON(${t}) = 1)`);
 	}
 	return u.join(" ");
-}, ot = (e, t, r = null, a) => {
+}, st = (e, t, r = null, a) => {
 	let o = /* @__PURE__ */ new Set();
 	for (let t of e.appliedIndexes ?? []) for (let e of t.fields) typeof e == "string" && o.add(e);
 	for (let t of e.appliedUniques ?? []) for (let e of t.fields) typeof e == "string" && o.add(e);
-	let s = e.appliedPrimaryKey ?? [], c = s.length > 0, l = Object.entries(e.fields).map(([e, n]) => `  ${at(e, n, t, o, a?.has(e) ?? !1, c)}`).join(",\n"), u = (e.appliedUniques ?? []).map((r) => {
-		let i = r.fields.map((n) => rt(n, e.fields, t)).join(", ");
+	let s = e.appliedPrimaryKey ?? [], c = s.length > 0, l = Object.entries(e.fields).map(([e, n]) => `  ${ot(e, n, t, o, a?.has(e) ?? !1, c)}`).join(",\n"), u = (e.appliedUniques ?? []).map((r) => {
+		let i = r.fields.map((n) => it(n, e.fields, t)).join(", ");
 		return `  CONSTRAINT ${n(r.name, t)} UNIQUE (${i})`;
-	}), d = (e.appliedChecks ?? []).map((e) => `  CONSTRAINT ${n(e.name, t)} CHECK (${e.expr})`), f = c ? [`  PRIMARY KEY (${s.map((n) => rt(n, e.fields, t)).join(", ")})`] : [], p = i(t) ? Object.entries(e.fields).flatMap(([i, o]) => {
+	}), d = (e.appliedChecks ?? []).map((e) => `  CONSTRAINT ${n(e.name, t)} CHECK (${e.expr})`), f = c ? [`  PRIMARY KEY (${s.map((n) => it(n, e.fields, t)).join(", ")})`] : [], p = i(t) ? Object.entries(e.fields).flatMap(([i, o]) => {
 		if (o.type !== "reference" || !o.references || (a?.has(i) ?? !1)) return [];
-		let s = o.references(), c = P(o.onDelete ?? "restrict", t), l = P(o.refOnUpdate ?? "noAction", t);
-		return [`  CONSTRAINT ${n(`${e.tableName}_${i}_fkey`, t)} FOREIGN KEY (${n(i, t)}) REFERENCES ${et(s.tableName, t, r)} (${n("id", t)}) ON DELETE ${c}${l === "NO ACTION" ? "" : ` ON UPDATE ${l}`}`];
+		let s = o.references(), c = N(o.onDelete ?? "restrict", t), l = N(o.refOnUpdate ?? "noAction", t);
+		return [`  CONSTRAINT ${n(`${e.tableName}_${i}_fkey`, t)} FOREIGN KEY (${n(i, t)}) REFERENCES ${tt(s.tableName, t, r)} (${n("id", t)}) ON DELETE ${c}${l === "NO ACTION" ? "" : ` ON UPDATE ${l}`}`];
 	}) : [], m = [
 		...f,
 		...u,
 		...d,
 		...p
-	], h = m.length > 0 ? `${l},\n${m.join(",\n")}` : l, g = et(e.tableName, t, r);
+	], h = m.length > 0 ? `${l},\n${m.join(",\n")}` : l, g = tt(e.tableName, t, r);
 	if (t === "mssql") {
 		let t = r === null ? e.tableName : `${r}.${e.tableName}`, n = `CREATE TABLE ${g} (\n${h}\n)`;
 		return `IF OBJECT_ID('${t.replace(/'/g, "''")}', 'U') IS NULL EXEC(N'${n.replace(/'/g, "''")}');`;
@@ -440,10 +440,10 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		h,
 		");"
 	].join("\n");
-}, st = (e, t, r) => {
+}, ct = (e, t, r) => {
 	let i = `${e}_${t.name}_fts`, a = (e) => n(e, r), o = t.columns.map(a).join(", "), s = t.columns.map((e) => `new.${a(e)}`).join(", "), c = [];
 	return c.push(`CREATE VIRTUAL TABLE IF NOT EXISTS ${a(i)} USING fts5(${o}, row_id UNINDEXED, tokenize='porter');`), c.push(`CREATE TRIGGER IF NOT EXISTS ${a(`${i}_ai`)} AFTER INSERT ON ${a(e)} BEGIN\n  INSERT INTO ${a(i)} (${o}, row_id) VALUES (${s}, new.${a("id")});\nEND;`), c.push(`CREATE TRIGGER IF NOT EXISTS ${a(`${i}_ad`)} AFTER DELETE ON ${a(e)} BEGIN\n  DELETE FROM ${a(i)} WHERE row_id = old.${a("id")};\nEND;`), c.push(`CREATE TRIGGER IF NOT EXISTS ${a(`${i}_au`)} AFTER UPDATE ON ${a(e)} BEGIN\n  DELETE FROM ${a(i)} WHERE row_id = old.${a("id")};\n  INSERT INTO ${a(i)} (${o}, row_id) VALUES (${s}, new.${a("id")});\nEND;`), c;
-}, ct = (e, t, r = null) => {
+}, lt = (e, t, r = null) => {
 	let i = [], a = /* @__PURE__ */ new Set(), o = (e) => e.join("\0"), s = (e, n, r, i) => {
 		let a = {
 			using: "",
@@ -455,21 +455,21 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 			using: " USING GIST",
 			withSuffix: "",
 			skip: !1
-		} : (A(`[voltro:migrate] index '${e}' on '${n}': ${t} doesn't support GiST — falling back to btree. Spatial queries on this column will fall back to sequential scan.`), a);
+		} : (k(`[voltro:migrate] index '${e}' on '${n}': ${t} doesn't support GiST — falling back to btree. Spatial queries on this column will fall back to sequential scan.`), a);
 		if (r === "gin") return t === "postgres" ? {
 			using: " USING GIN",
 			withSuffix: "",
 			skip: !1
-		} : t === "mysql" || t === "mariadb" ? (A(`[voltro:migrate] gin index '${e}' on '${n}': ${t} has no GIN access method — skipping (a btree on a JSON/array column can't serve containment/membership queries). Add a generated column for the specific path you query, then index that with .expressionIndex(...).`), {
+		} : t === "mysql" || t === "mariadb" ? (k(`[voltro:migrate] gin index '${e}' on '${n}': ${t} has no GIN access method — skipping (a btree on a JSON/array column can't serve containment/membership queries). Add a generated column for the specific path you query, then index that with .expressionIndex(...).`), {
 			using: "",
 			withSuffix: "",
 			skip: !0
-		}) : (A(`[voltro:migrate] gin index '${e}' on '${n}': ${t} has no GIN access method — falling back to btree. Containment/membership queries won't use this index efficiently.`), a);
+		}) : (k(`[voltro:migrate] gin index '${e}' on '${n}': ${t} has no GIN access method — falling back to btree. Containment/membership queries won't use this index efficiently.`), a);
 		if (r === "brin") return t === "postgres" ? {
 			using: " USING BRIN",
 			withSuffix: "",
 			skip: !1
-		} : (A(`[voltro:migrate] brin index '${e}' on '${n}': ${t} has no BRIN access method — falling back to btree (larger on disk, but the range scan still works).`), a);
+		} : (k(`[voltro:migrate] brin index '${e}' on '${n}': ${t} has no BRIN access method — falling back to btree (larger on disk, but the range scan still works).`), a);
 		if (r === "hnsw") {
 			if (t === "postgres") {
 				let e = i?.hnsw?.m ?? 16, t = i?.hnsw?.efConstruction ?? 64, n = i?.hnsw?.opclass ?? h(i?.hnsw?.distance);
@@ -480,7 +480,7 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 					skip: !1
 				};
 			}
-			return A(`[voltro:migrate] hnsw index '${e}' on '${n}': ${t} has no pgvector / HNSW access method — skipping. Nearest-neighbour queries on this column fall back to a sequential scan.`), {
+			return k(`[voltro:migrate] hnsw index '${e}' on '${n}': ${t} has no pgvector / HNSW access method — skipping. Nearest-neighbour queries on this column fall back to a sequential scan.`), {
 				using: "",
 				withSuffix: "",
 				skip: !0
@@ -489,7 +489,7 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		return a;
 	}, c = (n, r) => {
 		let i = n.map((n) => {
-			if (typeof n == "string") return rt(n, e.fields, t);
+			if (typeof n == "string") return it(n, e.fields, t);
 			if ("jsonPath" in n) {
 				let { column: e, path: r, numeric: i } = n.jsonPath;
 				return `(${_(e, r, t, { numeric: i })})`;
@@ -500,11 +500,11 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 	}, l = (e, i, a, o, l, u = "", d = !1) => {
 		let f = s(e, i, o, l);
 		if (f.skip) return "";
-		let p = c(a, f.opclass), m = `${f.withSuffix}${u}`, h = et(i, t, r), g = d ? "UNIQUE " : "";
+		let p = c(a, f.opclass), m = `${f.withSuffix}${u}`, h = tt(i, t, r), g = d ? "UNIQUE " : "";
 		return t === "mssql" ? `IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = '${e}') CREATE ${g}INDEX ${n(e, t)} ON ${h}${f.using} (${p})${m};` : t === "mysql" ? `CREATE ${g}INDEX ${n(e, t)} ON ${h}${f.using} (${p})${m};` : `CREATE ${g}INDEX IF NOT EXISTS ${n(e, t)} ON ${h}${f.using} (${p})${m};`;
 	};
 	if (t === "mysql" || t === "mariadb") for (let [n, r] of Object.entries(e.fields)) {
-		if (!r.unique || r.type === "id" || !nt(r, t)) continue;
+		if (!r.unique || r.type === "id" || !rt(r, t)) continue;
 		let a = l(`${e.tableName}_${n}_key`, e.tableName, [n], void 0, void 0, "", !0);
 		a && i.push(a);
 	}
@@ -518,15 +518,15 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		let a = r.columns.map((e) => n(e, t)).join(", ");
 		i.push(`CREATE FULLTEXT INDEX ${n(r.name, t)} ON ${n(e.tableName, t)} (${a});`);
 	} else if (t === "turso") throw Error(`@voltro/sql-turso: full-text index '${r.name}' on '${e.tableName}' is not supported — Turso's MVCC mode has no FTS5 virtual tables. Drop .fullTextIndex(), or use the 'sqlite' / 'postgres' dialect for this table.`);
-	else t === "sqlite" ? i.push(...st(e.tableName, r, t)) : A(`[voltro:migrate] full-text index '${r.name}' on '${e.tableName}': ${t} uses a ranked LIKE search at query time (no native FTS catalog required).`);
+	else t === "sqlite" ? i.push(...ct(e.tableName, r, t)) : k(`[voltro:migrate] full-text index '${r.name}' on '${e.tableName}': ${t} uses a ranked LIKE search at query time (no native FTS catalog required).`);
 	for (let n of e.appliedIndexes) {
 		if ((t === "mariadb" || t === "mssql") && n.fields.some((e) => typeof e != "string" && "jsonPath" in e)) {
-			A(`[voltro:migrate] json-path index '${n.name}' on '${e.tableName}': ${t} cannot index a JSON expression directly — skipping. For an indexed JSON path on ${t}, add a generated column for the path (text().generatedAs(...) / .stored()) and .index([...]) it, then filter on that column instead of jsonField(...).`);
+			k(`[voltro:migrate] json-path index '${n.name}' on '${e.tableName}': ${t} cannot index a JSON expression directly — skipping. For an indexed JSON path on ${t}, add a generated column for the path (text().generatedAs(...) / .stored()) and .index([...]) it, then filter on that column instead of jsonField(...).`);
 			continue;
 		}
 		if (n.unique && n.where !== void 0 && n.where.length > 0 && (t === "mysql" || t === "mariadb")) throw Error(`@voltro/migrate: uniqueActive index '${n.name}' on '${e.tableName}' cannot be expressed on ${t} — it has no partial (WHERE) index support, and a full UNIQUE index would forbid re-creating a soft-deleted row. Use a generated STORED column (text().generatedAs("CASE WHEN \`deletedAt\` IS NULL THEN <key> ELSE NULL END", { stored: true })) + .unique([...]) on ${t}, or move this table to postgres/sqlite/mssql.`);
 		let r = "";
-		n.where !== void 0 && n.where.length > 0 && (t === "mysql" || t === "mariadb" ? A(`[voltro:migrate] partial index '${n.name}' on '${e.tableName}': ${t} does not support WHERE clauses on indexes — emitting a full index`) : r = ` WHERE ${n.where}`);
+		n.where !== void 0 && n.where.length > 0 && (t === "mysql" || t === "mariadb" ? k(`[voltro:migrate] partial index '${n.name}' on '${e.tableName}': ${t} does not support WHERE clauses on indexes — emitting a full index`) : r = ` WHERE ${n.where}`);
 		let s = l(n.name, e.tableName, n.fields, n.kind, n.kindOptions, r, n.unique === !0);
 		s !== "" && i.push(s), n.fields.every((e) => typeof e == "string") && a.add(o(n.fields));
 	}
@@ -536,17 +536,17 @@ var k = "framework_changes", qe = "framework_changes_", Je = (e, t) => t === "fr
 		i.push(l(r, e.tableName, [t])), a.add(o([t]));
 	}
 	return i.join("\n");
-}, lt = (e, t, n = k) => {
+}, ut = (e, t, n = O) => {
 	if (t !== "postgres") return [];
 	let r = e.filter((e) => e.isReactive !== !1);
-	return r.length === 0 ? [] : [ut(n), ...r.map((e) => ft(e, n))];
-}, ut = (e) => `
-CREATE OR REPLACE FUNCTION ${Ye(e)}() RETURNS trigger AS $$
+	return r.length === 0 ? [] : [dt(n), ...r.map((e) => pt(e, n))];
+}, dt = (e) => `
+CREATE OR REPLACE FUNCTION ${Xe(e)}() RETURNS trigger AS $$
 DECLARE
   payload TEXT;
   pk JSONB;
 BEGIN
-  -- ${Xe}
+  -- ${Ze}
   payload := json_build_object(
     'table',  TG_TABLE_NAME,
     -- The schema the write landed in. Under namespace isolation this is
@@ -600,21 +600,21 @@ BEGIN
   RETURN COALESCE(NEW, OLD);
 END;
 $$ LANGUAGE plpgsql;
-`.trim(), dt = (e, t) => {
-	let n = Je(e.tableName, t);
+`.trim(), ft = (e, t) => {
+	let n = Ye(e.tableName, t);
 	return [
 		`ALTER TABLE "${e.tableName}" REPLICA IDENTITY FULL`,
 		`DROP TRIGGER IF EXISTS ${n} ON "${e.tableName}"`,
-		`CREATE TRIGGER ${n}\nAFTER INSERT OR UPDATE OR DELETE ON "${e.tableName}"\nFOR EACH ROW EXECUTE FUNCTION ${Ye(t)}()`
+		`CREATE TRIGGER ${n}\nAFTER INSERT OR UPDATE OR DELETE ON "${e.tableName}"\nFOR EACH ROW EXECUTE FUNCTION ${Xe(t)}()`
 	];
-}, ft = (e, t) => dt(e, t).map((e) => `${e};`).join("\n"), pt = (e) => {
+}, pt = (e, t) => ft(e, t).map((e) => `${e};`).join("\n"), mt = (e) => {
 	if (e.dialect !== "postgres") return [];
 	let t = e.channel ?? "framework_changes", n = new Map(e.tables.map((e) => [e.tableName, e])), r = [], i = e.missing.filter((e) => n.has(e));
-	(i.length > 0 || e.functionOutdated === !0) && r.push(ut(t));
-	for (let e of i) r.push(...dt(n.get(e), t));
-	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`);
+	(i.length > 0 || e.functionOutdated === !0) && r.push(dt(t));
+	for (let e of i) r.push(...ft(n.get(e), t));
+	for (let n of e.stale) r.push(`DROP TRIGGER IF EXISTS ${Ye(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) => {
+}, ht = (e) => e.some((e) => Object.values(e.fields).some((e) => e.type === "vector")), gt = (e) => e.some((e) => Object.values(e.fields).some((e) => e.spatial !== void 0)), _t = (e) => {
 	let t = new Map(e.map((e) => [e.tableName, e])), n = fe(e.map((e) => e.tableName), (e) => {
 		let n = t.get(e);
 		return n ? Object.entries(n.fields).flatMap(([e, n]) => {
@@ -651,8 +651,8 @@ $$ LANGUAGE plpgsql;
 		sorted: o,
 		cyclic: r
 	};
-}, _t = (e, t, r = null) => {
-	let i = (e) => r ? `${n(r, t)}.${n(e, t)}` : n(e, t), a = `${e.table}_${e.column}_fkey`, o = P(e.onDelete, t), s = P(e.onUpdate, t), c = ` ON DELETE ${o}${s === "NO ACTION" ? "" : ` ON UPDATE ${s}`}`, l = (r) => `ADD CONSTRAINT ${n(a, t)} FOREIGN KEY ${r ? "IF NOT EXISTS " : ""}(${n(e.column, t)}) REFERENCES ${i(e.targetTable)} (${n("id", t)})${c}`;
+}, vt = (e, t, r = null) => {
+	let i = (e) => r ? `${n(r, t)}.${n(e, t)}` : n(e, t), a = `${e.table}_${e.column}_fkey`, o = N(e.onDelete, t), s = N(e.onUpdate, t), c = ` ON DELETE ${o}${s === "NO ACTION" ? "" : ` ON UPDATE ${s}`}`, l = (r) => `ADD CONSTRAINT ${n(a, t)} FOREIGN KEY ${r ? "IF NOT EXISTS " : ""}(${n(e.column, t)}) REFERENCES ${i(e.targetTable)} (${n("id", t)})${c}`;
 	switch (t) {
 		case "postgres": return [
 			"DO $$ BEGIN",
@@ -666,7 +666,7 @@ $$ LANGUAGE plpgsql;
 		case "mariadb": return `ALTER TABLE ${i(e.table)} ${l(!0)};`;
 		default: return `ALTER TABLE ${i(e.table)} ${l(!1)};`;
 	}
-}, vt = (e, t) => {
+}, yt = (e, t) => {
 	let n = /* @__PURE__ */ new Map();
 	if (o(t)) return n;
 	for (let t of e) {
@@ -674,7 +674,7 @@ $$ LANGUAGE plpgsql;
 		e.add(t.column), n.set(t.table, e);
 	}
 	return n;
-}, yt = (e, t) => {
+}, bt = (e, t) => {
 	if (t !== "postgres") return "";
 	let n = /* @__PURE__ */ new Map();
 	for (let t of e) for (let e of Object.values(t.fields)) {
@@ -690,7 +690,7 @@ $$ LANGUAGE plpgsql;
 		r.push(`DO $$ BEGIN\n  IF NOT EXISTS (SELECT 1 FROM pg_type WHERE typname = '${e.replace(/'/g, "''")}') THEN\n    CREATE TYPE "${e}" AS ENUM (${n});\n  END IF;\nEND $$;`);
 	}
 	return r.join("\n\n");
-}, bt = (e, t) => {
+}, xt = (e, t) => {
 	if (t !== "postgres") return "";
 	let n = /* @__PURE__ */ new Set();
 	for (let t of e) for (let e of Object.values(t.fields)) e.type === "enum" && e.enumName && n.add(e.enumName);
@@ -704,30 +704,30 @@ BEGIN
   SELECT oid INTO type_oid FROM pg_type WHERE typname = '${i}';\n  IF type_oid IS NOT NULL\n     AND EXISTS (SELECT 1 FROM pg_enum WHERE enumtypid = type_oid AND enumlabel = '${a}')\n     AND NOT EXISTS (SELECT 1 FROM pg_enum WHERE enumtypid = type_oid AND enumlabel = '${o}') THEN\n    IF current_setting('server_version_num')::int >= 140000 THEN\n      EXECUTE format('ALTER TYPE %I RENAME VALUE %L TO %L', '${i}', '${a}', '${o}');\n    ELSE\n      UPDATE pg_enum SET enumlabel = '${o}' WHERE enumtypid = type_oid AND enumlabel = '${a}';\n    END IF;\n  END IF;\nEND $$;`);
 	}
 	return r.join("\n\n");
-}, xt = (e) => {
+}, St = (e) => {
 	let t = [], n = [];
 	for (let r of e) p(r) ? n.push(r) : t.push(r);
 	return {
 		tables: t,
 		views: n
 	};
-}, St = (e, t, n = k) => {
-	let { tables: r, views: i } = xt(e), { sorted: a, cyclic: c } = gt(r.map((e) => de(e, t))), l = vt(c, t), u = [];
-	t === "postgres" && mt(a) && u.push("CREATE EXTENSION IF NOT EXISTS vector;"), t === "postgres" && ht(a) && u.push("CREATE EXTENSION IF NOT EXISTS postgis;");
-	let d = bt(a, t);
+}, Ct = (e, t, n = O) => {
+	let { tables: r, views: i } = St(e), { sorted: a, cyclic: c } = _t(r.map((e) => de(e, t))), l = yt(c, t), u = [];
+	t === "postgres" && ht(a) && u.push("CREATE EXTENSION IF NOT EXISTS vector;"), t === "postgres" && gt(a) && u.push("CREATE EXTENSION IF NOT EXISTS postgis;");
+	let d = xt(a, t);
 	d && u.push(d);
-	let f = yt(a, t);
+	let f = bt(a, t);
 	f && u.push(f);
-	for (let e of a) u.push(ot(e, t, null, l.get(e.tableName)));
-	if (!o(t)) for (let e of c) u.push(_t(e, t));
+	for (let e of a) u.push(st(e, t, null, l.get(e.tableName)));
+	if (!o(t)) for (let e of c) u.push(vt(e, t));
 	for (let e of a) {
-		let n = ct(e, t);
+		let n = lt(e, t);
 		n && u.push(n);
 	}
-	u.push(...lt(a, t, n));
+	u.push(...ut(a, t, n));
 	for (let e of i) u.push(s(e, t));
 	return u.join("\n\n") + "\n";
-}, Ct = (e, t, r) => {
+}, wt = (e, t, r) => {
 	let i = n(e, t);
 	switch (t) {
 		case "postgres": return `CREATE SCHEMA IF NOT EXISTS ${i};`;
@@ -737,62 +737,62 @@ BEGIN
 		case "turso":
 		case "sqlite": return `ATTACH DATABASE '${(r ?? `${e}.db`).replace(/'/g, "''")}' AS ${i};`;
 	}
-}, wt = (e, t, r, i) => {
-	let a = Ct(r, t, i), s = n(r, t);
-	if (t === "postgres") return `${a}\n\nSET search_path TO ${s};\n\n${St(e, t)}`;
-	if (t === "mysql" || t === "mariadb") return `${a}\n\nUSE ${s};\n\n${St(e, t)}`;
-	let { sorted: c, cyclic: l } = gt(e), u = vt(l, t), d = [a];
-	for (let e of c) d.push(ot(e, t, r, u.get(e.tableName)));
-	if (!o(t)) for (let e of l) d.push(_t(e, t, r));
+}, Tt = (e, t, r, i) => {
+	let a = wt(r, t, i), s = n(r, t);
+	if (t === "postgres") return `${a}\n\nSET search_path TO ${s};\n\n${Ct(e, t)}`;
+	if (t === "mysql" || t === "mariadb") return `${a}\n\nUSE ${s};\n\n${Ct(e, t)}`;
+	let { sorted: c, cyclic: l } = _t(e), u = yt(l, t), d = [a];
+	for (let e of c) d.push(st(e, t, r, u.get(e.tableName)));
+	if (!o(t)) for (let e of l) d.push(vt(e, t, r));
 	for (let e of c) {
-		let n = ct(e, t, r);
+		let n = lt(e, t, r);
 		n && d.push(n);
 	}
 	return d.join("\n\n") + "\n";
-}, Tt = (e, t, n = k) => {
-	let { sorted: r, cyclic: i } = gt(e), a = vt(i, t), o = [], s = bt(r, t);
+}, Et = (e, t, n = O) => {
+	let { sorted: r, cyclic: i } = _t(e), a = yt(i, t), o = [], s = xt(r, t);
 	s && o.push(s);
-	let c = yt(r, t);
+	let c = bt(r, t);
 	c && o.push(c);
-	for (let e of r) o.push(ot(e, t, null, a.get(e.tableName)));
-	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 = k, r = {}) => x.gen(function* () {
+	for (let e of r) o.push(st(e, t, null, a.get(e.tableName)));
+	for (let e of i) o.push(vt(e, t));
+	return o.push(...ut(r, t, n)), o.join("\n\n") + "\n";
+}, Dt = (e, t = "postgres", n = O, r = {}) => x.gen(function* () {
 	let i = yield* C.SqlClient;
-	yield* Me(i, Nt(i, St(e, t, n), t, r.retryFilter), { schema: r.lockSchema }).pipe(x.orDie);
-}), Dt = (e, t) => {
+	yield* Ne(i, Pt(i, Ct(e, t, n), t, r.retryFilter), { schema: r.lockSchema }).pipe(x.orDie);
+}), Ot = (e, t) => {
 	let n = t.cause ?? {};
 	return (n.errno === 1061 || n.code === "ER_DUP_KEYNAME") && /^\s*CREATE\s+(UNIQUE\s+|FULLTEXT\s+)?INDEX\b/i.test(e);
-}, Ot = (e, t) => {
+}, kt = (e, t) => {
 	let n = e.trimStart();
 	return !!(/\bIF NOT EXISTS\b/i.test(n) || /^CREATE OR REPLACE\b/i.test(n) || /^DROP\s[\s\S]*?\bIF EXISTS\b/i.test(n) || /^SET search_path\b/i.test(n) || /^USE[\s`"[]/i.test(n) || /^IF\s/i.test(n) || (t === "mysql" || t === "mariadb") && /^CREATE\s+(UNIQUE\s+|FULLTEXT\s+)?INDEX\b/i.test(n));
-}, kt = () => {
+}, At = () => {
 	let e = Number(process.env.VOLTRO_MIGRATION_DDL_RETRIES);
 	return Number.isInteger(e) && e >= 0 ? e : 4;
-}, At = (e) => ({
+}, jt = (e) => ({
 	while: e,
-	times: kt(),
+	times: At(),
 	schedule: S.jittered(S.exponential("50 millis"))
-}), jt = class {
+}), Mt = class {
 	statement;
 	error;
 	_tag = "DdlStatementFailed";
 	constructor(e, t) {
 		this.statement = e, this.error = t;
 	}
-}, Mt = (e, t, n) => x.gen(function* () {
-	let r = yield* C.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(x.catchIf((e) => Dt(a, e), () => x.succeed([])), x.tapError((e) => x.sync(() => {
-			Ze.error(ae("migrate: statement failed", a, e, 200));
+}, Nt = (e, t, n) => x.gen(function* () {
+	let r = yield* C.SqlClient, i = n !== void 0 && Ie(t) === "per-operation";
+	for (let a of Ft(e)) {
+		process.env.VOLTRO_MIGRATE_DEBUG === "1" && Qe.debug(`EXEC: ${a.replace(/\s+/g, " ").slice(0, 180)}`);
+		let e = r.unsafe(a).pipe(x.catchIf((e) => Ot(a, e), () => x.succeed([])), x.tapError((e) => x.sync(() => {
+			Qe.error(ae("migrate: statement failed", a, e, 200));
 		})));
-		yield* (i && n !== void 0 && Ot(a, t) ? e.pipe(x.retry(At((e) => n(e) === "retry"))) : e).pipe(x.mapError((e) => new jt(a, e)));
+		yield* (i && n !== void 0 && kt(a, t) ? e.pipe(x.retry(jt((e) => n(e) === "retry"))) : e).pipe(x.mapError((e) => new Mt(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(x.retry(At((e) => r(a(e)) === "retry"))) : i).pipe(x.orDieWith((e) => e instanceof jt ? Error(ae("migrate: statement failed", e.statement, e.error, 400).trim()) : e));
-}, Pt = (e) => {
+}), Pt = (e, t, n, r) => {
+	let i = n === "turso" ? Nt(t, n, r) : e.withTransaction(Nt(t, n, r)), a = (e) => e instanceof Mt ? e.error : e;
+	return (r !== void 0 && Ie(n) === "plan-transactional" ? i.pipe(x.retry(jt((e) => r(a(e)) === "retry"))) : i).pipe(x.orDieWith((e) => e instanceof Mt ? Error(ae("migrate: statement failed", e.statement, e.error, 400).trim()) : e));
+}, Ft = (e) => {
 	let t = [], n = "", r = !1;
 	for (let i = 0; i < e.length; i++) {
 		if (e.slice(i, i + 2) === "$$") {
@@ -807,43 +807,43 @@ BEGIN
 	}
 	let i = n.trim();
 	return i.length > 0 && t.push(i), t;
-}, Ft = async (e, t, n = "postgres", r = {}) => {
-	await x.runPromise(Et(e, n, void 0, r).pipe(x.provide(t)));
-}, It = (e, t, n = "postgres", r = {}) => x.gen(function* () {
-	let i = wt(e, n, t), a = yield* C.SqlClient;
-	yield* Me(a, Nt(a, i, n, r.retryFilter), { schema: r.lockSchema }).pipe(x.orDie);
-}), Lt = async (e, t, n, r = "postgres", i = {}) => {
-	await x.runPromise(It(e, t, r, i).pipe(x.provide(n))), await f({
+}, It = async (e, t, n = "postgres", r = {}) => {
+	await x.runPromise(Dt(e, n, void 0, r).pipe(x.provide(t)));
+}, Lt = (e, t, n = "postgres", r = {}) => x.gen(function* () {
+	let i = Tt(e, n, t), a = yield* C.SqlClient;
+	yield* Ne(a, Pt(a, i, n, r.retryFilter), { schema: r.lockSchema }).pipe(x.orDie);
+}), Rt = async (e, t, n, r = "postgres", i = {}) => {
+	await x.runPromise(Lt(e, t, r, i).pipe(x.provide(n))), await f({
 		namespace: t,
 		dialect: r
 	});
-}, Rt = async (e, t, n = "postgres", r = {}) => {
+}, zt = async (e, t, n = "postgres", r = {}) => {
 	await x.runPromise(x.gen(function* () {
-		let t = Tt(e, n), i = yield* C.SqlClient;
-		yield* Me(i, Nt(i, t, n, r.retryFilter), { schema: r.lockSchema }).pipe(x.orDie);
+		let t = Et(e, n), i = yield* C.SqlClient;
+		yield* Ne(i, Pt(i, t, n, r.retryFilter), { schema: r.lockSchema }).pipe(x.orDie);
 	}).pipe(x.provide(t)));
-}, zt = (e) => {
+}, Bt = (e) => {
 	if (e == null) return e;
-	if (Array.isArray(e)) return e.map(zt);
+	if (Array.isArray(e)) return e.map(Bt);
 	if (typeof e != "object") return e;
 	let t = {};
 	for (let n of Object.keys(e).sort()) {
 		let r = e[n];
-		r !== void 0 && (t[n] = zt(r));
+		r !== void 0 && (t[n] = Bt(r));
 	}
 	return t;
-}, Bt = (e) => {
+}, Vt = (e) => {
 	if (!e.idScheme && !e.sensitive && !e.safe && !e.generatedAs) return e;
 	let { idScheme: t, sensitive: n, safe: r, generatedAs: i, ...a } = e;
 	return a;
-}, Vt = (e) => [...e].map(Bt).sort((e, t) => e.name.localeCompare(t.name)), Ht = (e) => [...e].sort((e, t) => e.name.localeCompare(t.name)), Ut = (e) => [...e].map((e) => ({
+}, Ht = (e) => [...e].map(Vt).sort((e, t) => e.name.localeCompare(t.name)), Ut = (e) => [...e].sort((e, t) => e.name.localeCompare(t.name)), Wt = (e) => [...e].map((e) => ({
 	name: e.name,
-	columns: Vt(e.columns),
-	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));
+	columns: Ht(e.columns),
+	indexes: Ut(e.indexes)
+})).sort((e, t) => e.name.localeCompare(t.name)), P = (e) => {
+	let t = { tables: Wt(e.tables) }, n = JSON.stringify(Bt(t));
 	return te("sha256").update(n).digest("hex");
-}, F = (e) => e.slice(0, 16), Gt = (e, t) => {
+}, Gt = (e) => e.slice(0, 16), Kt = (e, t) => {
 	let n = t.references ? {
 		table: t.references().tableName,
 		column: "id",
@@ -882,7 +882,7 @@ BEGIN
 		...t.enumValues === void 0 ? {} : { enumValues: t.enumValues },
 		...t.spatial === void 0 ? {} : { spatial: t.spatial }
 	};
-}, Kt = (e) => {
+}, qt = (e) => {
 	let t = [], n = /* @__PURE__ */ new Set(), r = (e) => {
 		n.has(e.name) || (n.add(e.name), t.push(e));
 	}, i = e.appliedPrimaryKey ?? [];
@@ -930,11 +930,11 @@ BEGIN
 		});
 	}
 	return t;
-}, qt = (e) => {
+}, Jt = (e) => {
 	let t = new Set((e.appliedUniques ?? []).filter((e) => e.fields.length === 1).map((e) => e.fields[0])), n = [];
 	for (let [r, i] of Object.entries(e.fields)) {
 		if (i.dropped) continue;
-		let e = Gt(r, i);
+		let e = Kt(r, i);
 		n.push(t.has(r) ? {
 			...e,
 			unique: !0
@@ -944,27 +944,27 @@ BEGIN
 	return {
 		name: e.tableName,
 		columns: n,
-		indexes: Kt(e),
+		indexes: qt(e),
 		...r.length > 0 ? { primaryKey: [...r] } : {},
 		...i === void 0 ? {} : { renamedFrom: i }
 	};
-}, Jt = (e) => {
+}, Yt = (e) => {
 	let t = /* @__PURE__ */ new Map();
 	for (let n of e) for (let e of n.indexes) {
 		let r = t.get(e.name);
 		if (r !== void 0 && r !== n.name) throw Error(`duplicate index name '${e.name}' across tables '${r}' and '${n.name}'. Index names must be unique per SCHEMA, not just per table — the DB creates only one, so the other never applies and 'db plan' re-emits it forever. Give each an explicit, table-prefixed name (e.g. '${n.name}_${e.name}').`);
 		t.set(e.name, n.name);
 	}
-}, I = (e, t) => {
-	let n = e.map((e) => qt(de(e, t)));
-	return Jt(n), { tables: n };
-}, Yt = (e, t, n = k) => x.gen(function* () {
+}, F = (e, t) => {
+	let n = e.map((e) => Jt(de(e, t)));
+	return Yt(n), { tables: n };
+}, Xt = (e, t, n = O) => x.gen(function* () {
 	let r = (yield* e`
       SELECT p.prosrc
       FROM pg_proc p
       JOIN pg_namespace n ON n.oid = p.pronamespace
       WHERE n.nspname = current_schema()
-        AND p.proname = ${Ye(n)}
+        AND p.proname = ${Xe(n)}
     `)[0]?.prosrc, i = r !== void 0 && !r.includes("voltro:notify:v2"), a = t.filter((e) => !e.tableName.startsWith("_voltro_"));
 	if (a.length === 0) return {
 		missing: [],
@@ -978,10 +978,10 @@ BEGIN
       JOIN pg_namespace n ON n.oid = c.relnamespace
       WHERE NOT t.tgisinternal
         AND n.nspname = current_schema()
-        AND t.tgname LIKE ${`${qe}%`}
+        AND t.tgname LIKE ${`${Je}%`}
     `, s = new Set(o.map((e) => e.tgname)), c = [], l = [];
 	for (let e of a) {
-		let t = s.has(Je(e.tableName, n)), r = e.isReactive !== !1;
+		let t = s.has(Ye(e.tableName, n)), r = e.isReactive !== !1;
 		r && !t && c.push(e.tableName), !r && t && l.push(e.tableName);
 	}
 	return {
@@ -989,7 +989,7 @@ BEGIN
 		stale: l.sort(),
 		functionOutdated: i
 	};
-}), Xt = (e) => {
+}), Zt = (e) => {
 	let t = [];
 	if (e.missing.length > 0) {
 		let n = e.missing.slice(0, 8).join(", "), r = e.missing.length > 8 ? `, … (+${e.missing.length - 8})` : "";
@@ -1000,19 +1000,19 @@ BEGIN
 		t.push(`${e.stale.length} .nonReactive() table(s) still carry a change trigger — ${n}. They keep paying REPLICA IDENTITY FULL and a NOTIFY on every write for a subscription nobody receives. \`voltro db apply\` removes them.`);
 	}
 	return e.functionOutdated && t.push("The change-notify function in this database is OLDER than the framework installed here. Its triggers fire, so nothing looks wrong — but a row too large for a NOTIFY payload (postgres caps it at 8000 bytes) is emitted without its primary key, and a change that carries no key cannot be re-read: it reaches subscriptions as a re-query and reaches every TAP — search index, analytics mirror, cdc-out, row history — as nothing at all. Run `voltro db apply` to replace it."), t.length > 0 ? t.join("\n") : void 0;
-}, Zt = {
+}, Qt = {
 	postgres: !0,
 	mysql: !0,
 	mariadb: !0,
 	mssql: !0,
 	sqlite: !0
-}, Qt = {
+}, $t = {
 	postgres: !0,
 	mysql: !1,
 	mariadb: !1,
 	mssql: !0,
 	sqlite: !0
-}, $t = (e) => {
+}, en = (e) => {
 	switch (e) {
 		case "add-column":
 		case "drop-column":
@@ -1022,47 +1022,47 @@ BEGIN
 		case "add-foreign-key":
 		case "add-unique":
 		case "add-unique-composite":
-		case "add-check": return Qt;
-		default: return Zt;
+		case "add-check": return $t;
+		default: return Qt;
 	}
-}, en = (e, t) => {
+}, tn = (e, t) => {
 	let n = new Map(t.tables.map((e) => [e.name, e]));
 	return new Map(e.map((e) => [e.tableName, {
 		table: e,
 		snapshot: n.get(e.tableName),
 		columnDefs: e.fields
 	}]));
-}, L = (e) => {
+}, I = (e) => {
 	if (typeof e != "object" || !e) return JSON.stringify(e);
-	if (Array.isArray(e)) return `[${e.map(L).join(",")}]`;
+	if (Array.isArray(e)) return `[${e.map(I).join(",")}]`;
 	let t = e;
-	return `{${Object.keys(t).sort().map((e) => `${JSON.stringify(e)}:${L(t[e])}`).join(",")}}`;
-}, tn = (e) => {
+	return `{${Object.keys(t).sort().map((e) => `${JSON.stringify(e)}:${I(t[e])}`).join(",")}}`;
+}, nn = (e) => {
 	if (!e.hasDefault || e.defaultValue === void 0 || e.defaultValue === null) return null;
 	let t = e.defaultValue;
 	if (typeof t == "boolean") return t ? "__BOOL_TRUE__" : "__BOOL_FALSE__";
 	if (typeof t == "number") return String(t);
-	if (typeof t != "string") return L(t);
+	if (typeof t != "string") return I(t);
 	let n = t.trim(), r = n.toLowerCase().replace(/\s+/g, "");
 	if (r === "now" || r === "now()" || /^current_timestamp(\(\d*\))?$/.test(r) || r === "sysutcdatetime()" || r === "sysdatetime()" || r === "getutcdate()" || r === "getdate()") return "__NOW__";
 	let i = n.replace(/::[a-zA-Z0-9_ "]+$/, "").trim(), a = /^'(.*)'$/.test(i) ? i.slice(1, -1).replace(/''/g, "'") : i, o = /^cast\(\s*(?:_\w+\s*)?\\?'(.*?)\\?'\s+as\s+json\s*\)$/i.exec(a);
 	if (o) try {
-		return L(JSON.parse(o[1]));
+		return I(JSON.parse(o[1]));
 	} catch {}
 	let s = /^convert\(\s*(?:_\w+\s*)?\\?'(.*?)\\?'\s+using\s+[\w]+\s*\)$/i.exec(a);
 	if (s) try {
-		return L(JSON.parse(s[1]));
+		return I(JSON.parse(s[1]));
 	} catch {}
 	if (a.startsWith("{") || a.startsWith("[")) try {
-		return L(JSON.parse(a));
+		return I(JSON.parse(a));
 	} catch {}
 	return /^-?\d+(\.\d+)?$/.test(a) ? String(Number(a)) : a;
-}, nn = (e, t) => {
-	let n = tn(e), r = tn(t);
+}, rn = (e, t) => {
+	let n = nn(e), r = nn(t);
 	if (n === r) return !0;
 	let i = (e) => e === "1" || e === "true" ? "__BOOL_TRUE__" : e === "0" || e === "false" ? "__BOOL_FALSE__" : e;
 	return i(n) === i(r);
-}, rn = (e) => {
+}, an = (e) => {
 	if (!e) return null;
 	let t = (e) => e === "restrict" ? "noAction" : e;
 	return {
@@ -1071,25 +1071,25 @@ BEGIN
 		onDelete: t(e.onDelete),
 		onUpdate: t(e.onUpdate)
 	};
-}, an = (e, t) => {
+}, on = (e, t) => {
 	let n = e && e.length > 0 ? e : void 0, r = t && t.length > 0 ? t : void 0;
 	if (!n && !r) return !0;
 	if (!n || !r || n.length !== r.length) return !1;
 	let i = [...n].sort(), a = [...r].sort();
 	return i.every((e, t) => e === a[t]);
-}, on = (e, t) => {
+}, sn = (e, t) => {
 	try {
-		let n = /\((\d+)\)/.exec(j(e, t));
+		let n = /\((\d+)\)/.exec(A(e, t));
 		return n ? Number(n[1]) : void 0;
 	} catch {
 		return;
 	}
-}, sn = (e, t, n) => n === void 0 || o(n) ? !0 : e.type !== "text" || t.type !== "text" || on(e, n) === t.maxLength, cn = (e, t, n) => e.type === t.type && e.nullable === t.nullable && e.unique === t.unique && nn(e, t) && sn(e, t, n) && JSON.stringify(rn(e.references)) === JSON.stringify(rn(t.references)) && an(e.oneOf, t.oneOf), ln = (e, t) => t.oneOf && t.oneOf.length > 0 ? R({
+}, cn = (e, t, n) => n === void 0 || o(n) ? !0 : e.type !== "text" || t.type !== "text" || sn(e, n) === t.maxLength, ln = (e, t, n) => e.type === t.type && e.nullable === t.nullable && e.unique === t.unique && rn(e, t) && cn(e, t, n) && JSON.stringify(an(e.references)) === JSON.stringify(an(t.references)) && on(e.oneOf, t.oneOf), un = (e, t) => t.oneOf && t.oneOf.length > 0 ? L({
 	kind: "add-check",
 	table: e,
 	column: t.name,
 	values: t.oneOf
-}, "safe", `enum-membership CHECK on ${e}.${t.name}`) : void 0, un = (e, t) => e.unique === t.unique && (e.expression || t.expression ? !0 : e.columns.length === t.columns.length && e.columns.every((e, n) => e === t.columns[n])), dn = (e, t, n) => {
+}, "safe", `enum-membership CHECK on ${e}.${t.name}`) : void 0, dn = (e, t) => e.unique === t.unique && (e.expression || t.expression ? !0 : e.columns.length === t.columns.length && e.columns.every((e, n) => e === t.columns[n])), fn = (e, t, n) => {
 	let r = new Map(t.columns.map((e) => [e.name, e])), i = new Map(e.columns.map((e) => [e.name, e])), a = [], o = [], s = [];
 	for (let t of e.columns) {
 		let e = r.get(t.name);
@@ -1097,7 +1097,7 @@ BEGIN
 			a.push(t);
 			continue;
 		}
-		cn(t, e, n) || s.push({
+		ln(t, e, n) || s.push({
 			declared: t,
 			live: e
 		});
@@ -1108,47 +1108,47 @@ BEGIN
 		removed: o,
 		changed: s
 	};
-}, fn = (e, t) => {
+}, pn = (e, t) => {
 	let n = new Map(t.indexes.map((e) => [e.name, e])), r = new Map(e.indexes.map((e) => [e.name, e])), i = [], a = [];
 	for (let t of e.indexes) {
 		let e = n.get(t.name);
-		(!e || !un(t, e)) && i.push(t);
+		(!e || !dn(t, e)) && i.push(t);
 	}
 	for (let e of t.indexes) r.has(e.name) || a.push(e);
 	return {
 		added: i,
 		removed: a
 	};
-}, R = (e, t, n, r) => ({
+}, L = (e, t, n, r) => ({
 	op: e,
 	classification: t,
-	atomicByDialect: $t(e.kind),
+	atomicByDialect: en(e.kind),
 	...n ? { reason: n } : {},
 	...r ? { blocked: r } : {}
-}), pn = (e, t, n) => {
+}), mn = (e, t, n) => {
 	let r = {
 		kind: "add-column",
 		table: e,
 		column: t
 	};
-	return t.nullable ? R(r, "safe", "nullable column add — no backfill needed") : t.hasDefault && t.defaultValue !== void 0 ? R(r, "needs-default", "NOT NULL with literal default — DDL DEFAULT will populate existing rows") : n?.backfill ? R(r, "needs-backfill", `backfill declared (kind=${n.backfill.kind}) — applier will run 3-step add/update/set-not-null`) : R(r, "needs-backfill", "NOT NULL column on a table whose row count is unknown", { fix: `declare \`${t.name}: <type>().backfill(sql\`...\`)\` OR \`.default(value)\` so existing rows survive the migration` });
-}, mn = (e, t, n) => {
+	return t.nullable ? L(r, "safe", "nullable column add — no backfill needed") : t.hasDefault && t.defaultValue !== void 0 ? L(r, "needs-default", "NOT NULL with literal default — DDL DEFAULT will populate existing rows") : n?.backfill ? L(r, "needs-backfill", `backfill declared (kind=${n.backfill.kind}) — applier will run 3-step add/update/set-not-null`) : L(r, "needs-backfill", "NOT NULL column on a table whose row count is unknown", { fix: `declare \`${t.name}: <type>().backfill(sql\`...\`)\` OR \`.default(value)\` so existing rows survive the migration` });
+}, hn = (e, t, n) => {
 	let r = {
 		kind: "drop-column",
 		table: e,
 		column: t.name
 	};
-	return n?.dropped ? R(r, "lossy", `column dropped via \`${t.name}: dropped()\` marker — intentional`) : R(r, "lossy", "column missing from declared schema", { fix: `if intentional, add \`${t.name}: dropped()\` to the schema. If a typo, restore the field` });
-}, hn = (e, t, n, r, i) => R({
+	return n?.dropped ? L(r, "lossy", `column dropped via \`${t.name}: dropped()\` marker — intentional`) : L(r, "lossy", "column missing from declared schema", { fix: `if intentional, add \`${t.name}: dropped()\` to the schema. If a typo, restore the field` });
+}, gn = (e, t, n, r, i) => L({
 	kind: "create-table",
 	table: e,
 	columns: t,
 	indexes: n,
 	...r && r.length > 0 ? { primaryKey: r } : {}
-}, "safe", i ?? "new table — no data to preserve"), gn = (e) => R({
+}, "safe", i ?? "new table — no data to preserve"), _n = (e) => L({
 	kind: "drop-table",
 	table: e
-}, "lossy", "table missing from declared schema", { fix: "if intentional, set VOLTRO_DESTRUCTIVE_OK=1 OR add a file-based migration. If a typo, restore the table declaration" }), _n = 5e4, vn = (e, t, n, r) => {
+}, "lossy", "table missing from declared schema", { fix: "if intentional, set VOLTRO_DESTRUCTIVE_OK=1 OR add a file-based migration. If a typo, restore the table declaration" }), vn = 5e4, yn = (e, t, n, r) => {
 	let i = (n ?? 0) >= r, a;
 	return a = t.unique ? t.columns.length === 1 ? {
 		kind: "add-unique",
@@ -1163,16 +1163,16 @@ BEGIN
 		kind: "add-index",
 		table: e,
 		index: t
-	}, i ? R(a, "online-required", `online build on ${n} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : R(a, "safe", t.unique ? t.columns.length === 1 ? "add unique constraint" : "add composite UNIQUE constraint" : "add B-tree index");
-}, yn = (e, t) => t.unique && t.columns.length > 1 ? R({
+	}, i ? L(a, "online-required", `online build on ${n} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : L(a, "safe", t.unique ? t.columns.length === 1 ? "add unique constraint" : "add composite UNIQUE constraint" : "add B-tree index");
+}, bn = (e, t) => t.unique && t.columns.length > 1 ? L({
 	kind: "drop-unique-composite",
 	table: e,
 	name: t.name
-}, "safe", "drop composite UNIQUE constraint (no data loss — constraint is derived metadata)") : R({
+}, "safe", "drop composite UNIQUE constraint (no data loss — constraint is derived metadata)") : L({
 	kind: "drop-index",
 	table: e,
 	index: t.name
-}, "safe", "drop index (no data loss — index is derived data)"), bn = (e, t) => {
+}, "safe", "drop index (no data loss — index is derived data)"), xn = (e, t) => {
 	if (e === "reference") return "text";
 	switch (t) {
 		case "sqlite":
@@ -1180,10 +1180,10 @@ BEGIN
 		case "mssql": return e === "json" ? "text" : e;
 		default: return e;
 	}
-}, xn = (e, t, n) => {
+}, Sn = (e, t, n) => {
 	let r = `acknowledge it on the column: \`.narrowedFrom('${e}')\``;
 	return n === "postgres" ? `${r} — add \`{ using: '${t.name}::${t.type}' }\` when the cast is not implicit, or use a file-based migration` : `${r} — ${n === void 0 ? "this dialect" : n} converts in place (\`using\` is postgres-only and is ignored here), so verify the conversion is value-preserving for your data, or use a file-based migration`;
-}, Sn = (e, t, n, r, i, a) => {
+}, Cn = (e, t, n, r, i, a) => {
 	let s = [];
 	if (t.nullable !== n.nullable) {
 		let n = {
@@ -1192,7 +1192,7 @@ BEGIN
 			column: t.name,
 			toNullable: t.nullable
 		};
-		s.push(t.nullable ? R(n, "safe", `loosen ${e}.${t.name} to nullable`) : R(n, "needs-backfill", `tighten ${e}.${t.name} to NOT NULL — existing rows must already be non-null`));
+		s.push(t.nullable ? L(n, "safe", `loosen ${e}.${t.name} to nullable`) : L(n, "needs-backfill", `tighten ${e}.${t.name} to NOT NULL — existing rows must already be non-null`));
 	}
 	if (t.unique !== n.unique) {
 		if (t.unique) {
@@ -1201,14 +1201,14 @@ BEGIN
 				table: e,
 				column: t.name
 			}, r = (i ?? 0) >= a;
-			s.push(r ? R(n, "online-required", `online unique build on ${i} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : R(n, "safe", `add unique constraint on ${e}.${t.name} — existing rows must already be distinct (else the DB rejects at migrate)`));
-		} else s.push(R({
+			s.push(r ? L(n, "online-required", `online unique build on ${i} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : L(n, "safe", `add unique constraint on ${e}.${t.name} — existing rows must already be distinct (else the DB rejects at migrate)`));
+		} else s.push(L({
 			kind: "drop-unique",
 			table: e,
 			column: t.name
 		}, "safe", `drop unique constraint on ${e}.${t.name} — constraint is derived metadata, no data loss`));
 	}
-	if (bn(t.type, r) !== bn(n.type, r)) {
+	if (xn(t.type, r) !== xn(n.type, r)) {
 		let i = t.narrowedFrom;
 		if (i && i.from === n.type) {
 			let r = {
@@ -1219,7 +1219,7 @@ BEGIN
 				to: t.type,
 				...i.using === void 0 ? {} : { using: i.using }
 			};
-			s.push(R(r, "needs-backfill", `type change ${n.type} → ${t.type} on ${e}.${t.name} — narrowedFrom('${i.from}') declared` + (i.using ? ` with USING ${i.using}` : " (implicit cast)")));
+			s.push(L(r, "needs-backfill", `type change ${n.type} → ${t.type} on ${e}.${t.name} — narrowedFrom('${i.from}') declared` + (i.using ? ` with USING ${i.using}` : " (implicit cast)")));
 		} else {
 			let i = {
 				kind: "alter-column-type",
@@ -1228,12 +1228,12 @@ BEGIN
 				from: n.type,
 				to: t.type
 			};
-			s.push(R(i, "lossy", `type change ${n.type} → ${t.type} on ${e}.${t.name} may not be value-preserving`, { fix: xn(n.type, t, r) }));
+			s.push(L(i, "lossy", `type change ${n.type} → ${t.type} on ${e}.${t.name} may not be value-preserving`, { fix: Sn(n.type, t, r) }));
 		}
 	}
 	if (t.type === "text" && n.type === "text" && !o(r ?? "postgres") && t.maxLength !== n.maxLength) {
 		let r = t.maxLength === void 0 || n.maxLength !== void 0 && t.maxLength > n.maxLength, i = n.maxLength === void 0 ? "unbounded" : `varchar(${n.maxLength})`, a = t.maxLength === void 0 ? "unbounded" : `varchar(${t.maxLength})`;
-		s.push(R({
+		s.push(L({
 			kind: "alter-column-type",
 			table: e,
 			column: t.name,
@@ -1241,7 +1241,7 @@ BEGIN
 			to: "text"
 		}, r ? "safe" : "needs-backfill", r ? `text length ${i} → ${a} on ${e}.${t.name} — widening, no data can be lost` : `text length ${i} → ${a} on ${e}.${t.name} — NARROWING; the ALTER fails if any existing value is longer than ${String(t.maxLength)}. Check first: SELECT COUNT(*) FROM ${e} WHERE LENGTH(${t.name}) > ${String(t.maxLength)}`));
 	}
-	if (!nn(t, n)) {
+	if (!rn(t, n)) {
 		let n = {
 			kind: "alter-column-default",
 			table: e,
@@ -1249,23 +1249,23 @@ BEGIN
 			hasDefault: t.hasDefault,
 			...t.defaultValue === void 0 ? {} : { defaultValue: t.defaultValue }
 		};
-		s.push(R(n, "safe", `default change on ${e}.${t.name} affects only future inserts`));
+		s.push(L(n, "safe", `default change on ${e}.${t.name} affects only future inserts`));
 	}
-	if (!an(t.oneOf, n.oneOf)) {
-		n.oneOf && n.oneOf.length > 0 && s.push(R({
+	if (!on(t.oneOf, n.oneOf)) {
+		n.oneOf && n.oneOf.length > 0 && s.push(L({
 			kind: "drop-check",
 			table: e,
 			column: t.name
 		}, "safe", `drop stale enum CHECK on ${e}.${t.name}`));
-		let r = ln(e, t);
+		let r = un(e, t);
 		r && s.push(r);
 	}
-	return JSON.stringify(rn(t.references)) !== JSON.stringify(rn(n.references)) && (n.references && s.push(R({
+	return JSON.stringify(an(t.references)) !== JSON.stringify(an(n.references)) && (n.references && s.push(L({
 		kind: "drop-foreign-key",
 		table: e,
 		column: t.name
-	}, "safe", `drop FK on ${e}.${t.name} (→ ${n.references.table})`)), s.push(...Cn(e, t))), s;
-}, Cn = (e, t) => {
+	}, "safe", `drop FK on ${e}.${t.name} (→ ${n.references.table})`)), s.push(...wn(e, t))), s;
+}, wn = (e, t) => {
 	let n = [];
 	if (!t.references) return n;
 	let r = t.references.table, i = t.references.orphanPolicy ?? "fail", a = {
@@ -1277,15 +1277,15 @@ BEGIN
 		...t.references.onDelete ? { onDelete: t.references.onDelete } : {},
 		...t.references.onUpdate ? { onUpdate: t.references.onUpdate } : {}
 	};
-	return i === "null" && !t.nullable ? n.push(R(a, "lossy", `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' needs a nullable column (the NULL-out would violate NOT NULL)`, { fix: `make ${t.name} \`.nullable()\`, OR use \`orphanPolicy: 'delete'\`, OR clean the orphans and drop the policy` })) : i === "null" || i === "delete" ? n.push(R({
+	return i === "null" && !t.nullable ? n.push(L(a, "lossy", `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' needs a nullable column (the NULL-out would violate NOT NULL)`, { fix: `make ${t.name} \`.nullable()\`, OR use \`orphanPolicy: 'delete'\`, OR clean the orphans and drop the policy` })) : i === "null" || i === "delete" ? n.push(L({
 		...a,
 		orphanPolicy: i
-	}, "lossy", i === "delete" ? `add FK ${e}.${t.name} → ${r}: orphanPolicy 'delete' first DELETES rows whose ${t.name} points at a missing ${r}` : `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' first NULLs ${t.name} where it points at a missing ${r}`)) : n.push(R(a, "needs-backfill", `add FK ${e}.${t.name} → ${r} — existing rows must already reference a valid ${r} (else set orphanPolicy:'null'/'delete')`)), n;
-}, wn = (e, t, n) => {
+	}, "lossy", i === "delete" ? `add FK ${e}.${t.name} → ${r}: orphanPolicy 'delete' first DELETES rows whose ${t.name} points at a missing ${r}` : `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' first NULLs ${t.name} where it points at a missing ${r}`)) : n.push(L(a, "needs-backfill", `add FK ${e}.${t.name} → ${r} — existing rows must already reference a valid ${r} (else set orphanPolicy:'null'/'delete')`)), n;
+}, Tn = (e, t, n) => {
 	let r = [], i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = new Set(n.removed.map((e) => e.name)), s = new Set(n.added.map((e) => e.name));
 	for (let [n, c] of Object.entries(t)) {
 		let t = c.renamedFrom;
-		t && o.has(t) && s.has(n) && (i.add(n), a.add(t), r.push(R({
+		t && o.has(t) && s.has(n) && (i.add(n), a.add(t), r.push(L({
 			kind: "rename-column",
 			table: e.tableName,
 			from: t,
@@ -1297,26 +1297,26 @@ BEGIN
 		consumedAddedNames: i,
 		consumedRemovedNames: a
 	};
-}, Tn = /* @__PURE__ */ new Set([
+}, En = /* @__PURE__ */ new Set([
 	"postgres",
 	"mysql",
 	"mariadb",
 	"mssql"
-]), En = {
+]), Dn = {
 	ops: [],
 	consumedAddedNames: /* @__PURE__ */ new Set(),
 	consumedRemovedNames: /* @__PURE__ */ new Set()
-}, Dn = (e) => !e.unique && !e.expression, On = (e, t, n, r, i) => {
-	if (i === void 0 || !Tn.has(i)) return En;
-	let a = t.added.filter((e) => Dn(e) && !r.has(e.name));
-	if (a.length === 0) return En;
+}, On = (e) => !e.unique && !e.expression, kn = (e, t, n, r, i) => {
+	if (i === void 0 || !En.has(i)) return Dn;
+	let a = t.added.filter((e) => On(e) && !r.has(e.name));
+	if (a.length === 0) return Dn;
 	let o = (e) => e.columns.map((e) => n.get(e) ?? e).join("\0"), s = (e) => e.columns.join("\0"), c = [], l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Set();
 	for (let n of t.removed) {
-		if (!Dn(n)) continue;
+		if (!On(n)) continue;
 		let t = o(n), r = a.filter((e) => !l.has(e.name) && s(e) === t);
 		if (r.length !== 1) continue;
 		let i = r[0];
-		i.name !== n.name && (l.add(i.name), u.add(n.name), c.push(R({
+		i.name !== n.name && (l.add(i.name), u.add(n.name), c.push(L({
 			kind: "rename-index",
 			table: e,
 			from: n.name,
@@ -1328,7 +1328,7 @@ BEGIN
 		consumedAddedNames: l,
 		consumedRemovedNames: u
 	};
-}, kn = (e, t, n) => {
+}, An = (e, t, n) => {
 	let r = [], i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set();
 	for (let t of e.tables) t.renamedFrom !== void 0 && (s.set(t.renamedFrom, (s.get(t.renamedFrom) ?? 0) + 1), c.add(t.renamedFrom));
 	for (let c of e.tables) {
@@ -1339,7 +1339,7 @@ BEGIN
 				continue;
 			}
 			if (t.has(c.name)) {
-				r.push(R({
+				r.push(L({
 					kind: "rename-table",
 					from: e,
 					to: c.name
@@ -1347,14 +1347,14 @@ BEGIN
 				continue;
 			}
 			if ((s.get(e) ?? 0) !== 1) {
-				r.push(R({
+				r.push(L({
 					kind: "rename-table",
 					from: e,
 					to: c.name
 				}, "needs-rename-annotation", `.renamedFrom('${e}') is claimed by ${s.get(e)} tables — nothing says which receives its rows`, { fix: `remove the \`.renamedFrom('${e}')\` marker from all but one of them.` }));
 				continue;
 			}
-			i.set(c.name, e), a.add(e), r.push(R({
+			i.set(c.name, e), a.add(e), r.push(L({
 				kind: "rename-table",
 				from: e,
 				to: c.name
@@ -1368,19 +1368,19 @@ BEGIN
 		claimedOldNames: c,
 		refusals: o
 	};
-}, An = (e, t, n, r) => {
+}, jn = (e, t, n, r) => {
 	if (t === void 0) return {
 		live: e,
 		ops: []
 	};
-	let i = r !== void 0 && Tn.has(r), a = [], o = e.indexes.map((e) => {
+	let i = r !== void 0 && En.has(r), a = [], o = e.indexes.map((e) => {
 		if (!e.name.startsWith(t)) return e;
 		let r = `${n}${e.name.slice(t.length)}`;
 		return r === e.name ? e : e.name === `${t}_pkey` ? {
 			...e,
 			name: r,
 			table: n
-		} : i ? (a.push(R({
+		} : i ? (a.push(L({
 			kind: "rename-index",
 			table: n,
 			from: e.name,
@@ -1399,7 +1399,7 @@ BEGIN
 		},
 		ops: a
 	};
-}, jn = (e) => {
+}, Mn = (e) => {
 	let t = {
 		safe: 0,
 		needsDefault: 0,
@@ -1432,42 +1432,42 @@ BEGIN
 		case "multi-step": t.multiStep++;
 	}
 	return t;
-}, Mn = (e) => {
-	let t = I(e.declared, e.dialect), n = en(e.declared, t), r = new Map(e.live.tables.map((e) => [e.name, e])), i = e.onlineAfter ?? _n, a = [], o = kn(t, r, n);
+}, Nn = (e) => {
+	let t = F(e.declared, e.dialect), n = tn(e.declared, t), r = new Map(e.live.tables.map((e) => [e.name, e])), i = e.onlineAfter ?? vn, a = [], o = An(t, r, n);
 	a.push(...o.ops);
 	for (let e of t.tables) if (!o.renamedInto.has(e.name) && !r.has(e.name)) {
-		a.push(hn(e.name, e.columns, e.indexes, e.primaryKey, o.refusals.get(e.name)));
+		a.push(gn(e.name, e.columns, e.indexes, e.primaryKey, o.refusals.get(e.name)));
 		for (let t of e.columns) {
-			let n = ln(e.name, t);
+			let n = un(e.name, t);
 			n && a.push(n);
 		}
 	}
 	let s = new Set(e.ignoreTables ?? []);
-	for (let t of e.live.tables) n.has(t.name) || o.claimedOldNames.has(t.name) || m(t.name) || v(t.name) || s.has(t.name) || a.push(gn(t.name));
+	for (let t of e.live.tables) n.has(t.name) || o.claimedOldNames.has(t.name) || m(t.name) || v(t.name) || s.has(t.name) || a.push(_n(t.name));
 	for (let s of t.tables) {
 		let t = o.renamedInto.get(s.name), c = r.get(s.name) ?? (t === void 0 ? void 0 : r.get(t));
 		if (!c) continue;
-		let l = An(c, t, s.name, e.dialect);
+		let l = jn(c, t, s.name, e.dialect);
 		a.push(...l.ops);
-		let u = l.live, d = n.get(s.name), f = dn(s, u, e.dialect), p = fn(s, u), m = wn(d.table, d.columnDefs, f);
+		let u = l.live, d = n.get(s.name), f = fn(s, u, e.dialect), p = pn(s, u), m = Tn(d.table, d.columnDefs, f);
 		a.push(...m.ops);
 		for (let e of f.removed) {
 			if (m.consumedRemovedNames.has(e.name) || v(e.name)) continue;
 			let t = d.columnDefs[e.name];
-			a.push(mn(s.name, e, t));
+			a.push(hn(s.name, e, t));
 		}
 		for (let e of f.added) {
 			if (m.consumedAddedNames.has(e.name)) continue;
 			let t = d.columnDefs[e.name];
-			a.push(pn(s.name, e, t));
-			let n = ln(s.name, e);
-			n && a.push(n), a.push(...Cn(s.name, e));
+			a.push(mn(s.name, e, t));
+			let n = un(s.name, e);
+			n && a.push(n), a.push(...wn(s.name, e));
 		}
-		let h = new Map(m.ops.flatMap((e) => e.op.kind === "rename-column" ? [[e.op.from, e.op.to]] : [])), g = On(s.name, p, h, new Set(u.indexes.map((e) => e.name)), e.dialect);
+		let h = new Map(m.ops.flatMap((e) => e.op.kind === "rename-column" ? [[e.op.from, e.op.to]] : [])), g = kn(s.name, p, h, new Set(u.indexes.map((e) => e.name)), e.dialect);
 		a.push(...g.ops);
-		for (let e of p.added) g.consumedAddedNames.has(e.name) || a.push(vn(s.name, e, u.rowCount, i));
-		for (let e of p.removed) g.consumedRemovedNames.has(e.name) || a.push(yn(s.name, e));
-		for (let { declared: t, live: n } of f.changed) a.push(...Sn(s.name, t, n, e.dialect, u.rowCount, i));
+		for (let e of p.added) g.consumedAddedNames.has(e.name) || a.push(yn(s.name, e, u.rowCount, i));
+		for (let e of p.removed) g.consumedRemovedNames.has(e.name) || a.push(bn(s.name, e));
+		for (let { declared: t, live: n } of f.changed) a.push(...Cn(s.name, t, n, e.dialect, u.rowCount, i));
 	}
 	let c = new Set(a.flatMap((e) => e.op.kind === "create-table" ? [e.op.table] : [])), l = new Map(t.tables.map((e) => [e.name, e])), u = (e) => {
 		let t = l.get(e);
@@ -1476,7 +1476,7 @@ BEGIN
 			target: e.references.table
 		}] : []) : [];
 	}, d = fe([...c], u), f = [];
-	for (let e of t.tables) if (c.has(e.name)) for (let t of e.columns) !t.references || !d.has(w(e.name, t.name)) || f.push(R({
+	for (let e of t.tables) if (c.has(e.name)) for (let t of e.columns) !t.references || !d.has(w(e.name, t.name)) || f.push(L({
 		kind: "add-foreign-key",
 		table: e.name,
 		column: t.name,
@@ -1548,19 +1548,19 @@ BEGIN
 	});
 	return {
 		operations: S,
-		fromFingerprint: Wt(e.live),
-		toFingerprint: Wt(t),
-		summary: jn(S)
+		fromFingerprint: P(e.live),
+		toFingerprint: P(t),
+		summary: Mn(S)
 	};
-}, Nn = (e) => {
+}, Pn = (e) => {
 	let t = /[`"[]?([A-Za-z_][A-Za-z0-9_]*)[`"\]]?\s*(?:in\b|=)/i.exec(e);
 	if (!t) return null;
-	let n = [...e.replace(/\\'/g, "''").matchAll(/'((?:[^']|'')*)'/g)].map((e) => e[1].replace(/''/g, "'")).filter((e) => e.length > 0);
+	let n = [...e.replace(/\\'/g, "'").matchAll(/'((?:[^']|'')*)'/g)].map((e) => e[1].replace(/''/g, "'")).filter((e) => e.length > 0);
 	return n.length === 0 ? null : {
 		column: t[1],
 		values: n
 	};
-}, Pn = (e, t) => {
+}, Fn = (e, t) => {
 	if (t === "vector") return "vector";
 	switch (e) {
 		case "text":
@@ -1587,10 +1587,10 @@ BEGIN
 		case "USER-DEFINED": return "text";
 		default: return "text";
 	}
-}, Fn = (e, t) => e == null || e === "" ? void 0 : { generatedAs: {
+}, In = (e, t) => e == null || e === "" ? void 0 : { generatedAs: {
 	expr: e,
 	stored: t
-} }, z = (e) => {
+} }, R = (e) => {
 	switch (e.toUpperCase()) {
 		case "CASCADE": return "cascade";
 		case "RESTRICT": return "restrict";
@@ -1598,25 +1598,25 @@ BEGIN
 		case "SET DEFAULT": return "noAction";
 		default: return "noAction";
 	}
-}, In = (e, t) => {
+}, Ln = (e, t) => {
 	let n = e !== void 0 && e !== "" ? Number(e) : NaN;
 	return Number.isInteger(n) && n > 0 ? n : t;
-}, Ln = () => In(process.env.VOLTRO_INTROSPECT_BATCH, 20), Rn = 300, zn = () => {
+}, Rn = () => Ln(process.env.VOLTRO_INTROSPECT_BATCH, 20), zn = 300, Bn = () => {
 	let e = process.env.VOLTRO_INTROSPECT_TIMEOUT_MS;
-	return e !== void 0 && e.trim() === "0" ? 0 : In(e, 3e4);
-}, Bn = (e, t) => {
+	return e !== void 0 && e.trim() === "0" ? 0 : Ln(e, 3e4);
+}, Vn = (e, t) => {
 	let n = Number.isFinite(t) && t >= 1 ? Math.floor(t) : 1, r = [];
 	for (let t = 0; t < e.length; t += n) r.push(e.slice(t, t + n));
 	return r;
-}, Vn = (e) => {
-	let t = zn(), n = x.gen(function* () {
+}, Hn = (e) => {
+	let t = Bn(), n = x.gen(function* () {
 		t > 0 && (yield* e.unsafe(`SET LOCAL statement_timeout = ${t}`));
-		let n = (t) => e.unsafe("(" + t.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ") + ")"), r = (t) => e.unsafe(String(Math.max(0, Math.trunc(t)))), i = Ln(), a = (e, t) => x.gen(function* () {
+		let n = (t) => e.unsafe("(" + t.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ") + ")"), r = (t) => e.unsafe(String(Math.max(0, Math.trunc(t)))), i = Rn(), a = (e, t) => x.gen(function* () {
 			let r = [];
-			for (let a of Bn(e, i)) a.length !== 0 && r.push(...yield* t(n(a)));
+			for (let a of Vn(e, i)) a.length !== 0 && r.push(...yield* t(n(a)));
 			return r;
 		}), o = [];
-		for (let t = 0;; t += Rn) {
+		for (let t = 0;; t += zn) {
 			let n = yield* e`
         SELECT c.relname AS table_name,
                COALESCE(c.reltuples::bigint, 0) AS row_count
@@ -1624,9 +1624,9 @@ BEGIN
         JOIN pg_namespace n ON n.oid = c.relnamespace
         WHERE n.nspname = current_schema() AND c.relkind = 'r'
         ORDER BY c.relname
-        LIMIT ${r(Rn)} OFFSET ${r(t)}
+        LIMIT ${r(zn)} OFFSET ${r(t)}
       `;
-			if (o.push(...n), n.length < Rn) break;
+			if (o.push(...n), n.length < zn) break;
 		}
 		let s = /* @__PURE__ */ new Set(), c = [];
 		for (let e of o) s.has(e.table_name) || (s.add(e.table_name), c.push(e));
@@ -1760,23 +1760,23 @@ BEGIN
 		let te = [];
 		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 = S.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" : Pn(t.data_type, t.udt_name), c = a ? {
+				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 ? {
 					table: a.target_table,
 					column: a.target_column,
-					onDelete: z(a.delete_rule),
-					onUpdate: z(a.update_rule)
+					onDelete: R(a.delete_rule),
+					onUpdate: R(a.update_rule)
 				} : void 0, l = m.get(`${e.table_name}.${t.column_name}`);
 				return {
 					name: t.column_name,
 					type: s,
-					...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
+					...V(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: V(t.data_type, t.character_maximum_length) },
 					nullable: t.is_nullable === "YES",
 					unique: i.has(t.column_name) || n && t.column_name === "id",
 					hasDefault: t.column_default !== null,
 					...t.column_default === null ? {} : { defaultValue: t.column_default },
 					...c ? { references: c } : {},
 					...l ? { oneOf: l } : {},
-					...Fn(t.is_generated === "ALWAYS" ? t.generation_expression ?? "generated" : null, !0) ?? {}
+					...In(t.is_generated === "ALWAYS" ? t.generation_expression ?? "generated" : null, !0) ?? {}
 				};
 			}), l = [], u = ee.get(e.table_name);
 			if (u) for (let [t, n] of u) {
@@ -1815,7 +1815,7 @@ BEGIN
 		let n = `${String(e)} ${String(e.cause ?? "")}`.toLowerCase();
 		return n.includes("statement timeout") || n.includes("57014") ? x.die(/* @__PURE__ */ Error(`schema introspection exceeded VOLTRO_INTROSPECT_TIMEOUT_MS (${t}ms) — the schema is very large / FK-dense or the database is slow. Raise VOLTRO_INTROSPECT_TIMEOUT_MS, set it to 0 to disable the ceiling, or use DB_DIRECT_URL for a non-pooler connection.`)) : x.fail(e);
 	}));
-}, Hn = (e, t) => {
+}, Un = (e, t) => {
 	switch (e.toLowerCase()) {
 		case "varchar":
 		case "char":
@@ -1847,21 +1847,21 @@ BEGIN
 		case "json": return "json";
 		default: return "text";
 	}
-}, B = (e) => e.map((e) => {
+}, z = (e) => e.map((e) => {
 	let t = e, n = {};
 	for (let e of Object.keys(t)) n[e.toLowerCase()] = t[e];
 	return n;
-}), Un = (e) => x.gen(function* () {
-	let t = B(yield* e`
+}), Wn = (e) => x.gen(function* () {
+	let t = z(yield* e`
       SELECT table_name, COALESCE(table_rows, 0) AS table_rows
       FROM information_schema.tables
       WHERE table_schema = DATABASE() AND table_type = 'BASE TABLE'
-      ORDER BY table_name`), n = B(yield* e`
+      ORDER BY table_name`), n = z(yield* e`
       SELECT table_name, column_name, data_type, column_type, is_nullable, column_default, column_key,
              character_maximum_length, generation_expression, extra
       FROM information_schema.columns
       WHERE table_schema = DATABASE()
-      ORDER BY table_name, ordinal_position`), r = B(yield* e`
+      ORDER BY table_name, ordinal_position`), r = z(yield* e`
       SELECT k.table_name              AS source_table,
              k.column_name             AS source_column,
              k.referenced_table_name   AS target_table,
@@ -1871,66 +1871,69 @@ BEGIN
       JOIN information_schema.referential_constraints r
         ON k.constraint_name = r.constraint_name
        AND k.table_schema    = r.constraint_schema
-      WHERE k.table_schema = DATABASE() AND k.referenced_table_name IS NOT NULL`), i = B(yield* e`
+      WHERE k.table_schema = DATABASE() AND k.referenced_table_name IS NOT NULL`), i = z(yield* e`
       SELECT table_name, index_name, non_unique, column_name, seq_in_index
       FROM information_schema.statistics
       WHERE table_schema = DATABASE() AND index_name <> 'PRIMARY'
-      ORDER BY table_name, index_name, seq_in_index`), a = B(yield* e`
+      ORDER BY table_name, index_name, seq_in_index`), a = e`
+      SELECT cc.table_name AS table_name, cc.check_clause AS check_clause
+      FROM information_schema.check_constraints cc
+      WHERE cc.constraint_schema = DATABASE()`.unprepared, o = e`
       SELECT tc.table_name AS table_name, cc.check_clause AS check_clause
       FROM information_schema.check_constraints cc
       JOIN information_schema.table_constraints tc
         ON tc.constraint_schema = cc.constraint_schema
        AND tc.constraint_name   = cc.constraint_name
-      WHERE cc.constraint_schema = DATABASE()`.unprepared.pipe(x.orElseSucceed(() => []))), o = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map();
-	for (let e of a) {
+      WHERE cc.constraint_schema = DATABASE()`.unprepared, s = z(yield* a.pipe(x.orElse(() => o), x.orElseSucceed(() => []))), c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
+	for (let e of s) {
 		let t = /json_valid\(`?([^`)]+)`?\)/i.exec(e.check_clause);
 		if (t) {
-			o.add(`${e.table_name}.${t[1]}`);
+			c.add(`${e.table_name}.${t[1]}`);
 			continue;
 		}
-		let n = Nn(e.check_clause);
-		n && s.set(`${e.table_name}.${n.column}`, n.values);
+		let n = Pn(e.check_clause);
+		n && l.set(`${e.table_name}.${n.column}`, n.values);
 	}
-	let c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
+	let u = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map();
 	for (let e of n) {
-		let t = c.get(e.table_name) ?? [];
-		t.push(e), c.set(e.table_name, t);
+		let t = u.get(e.table_name) ?? [];
+		t.push(e), u.set(e.table_name, t);
 	}
 	for (let e of r) {
-		let t = l.get(e.source_table) ?? [];
-		t.push(e), l.set(e.source_table, t);
+		let t = d.get(e.source_table) ?? [];
+		t.push(e), d.set(e.source_table, t);
 	}
 	for (let e of i) {
-		let t = u.get(e.table_name);
-		t || (t = /* @__PURE__ */ new Map(), u.set(e.table_name, t));
+		let t = f.get(e.table_name);
+		t || (t = /* @__PURE__ */ new Map(), f.set(e.table_name, t));
 		let n = t.get(e.index_name) ?? [];
 		n.push(e), t.set(e.index_name, n);
 	}
-	let d = [];
+	let p = [];
 	for (let e of t) {
-		let t = c.get(e.table_name) ?? [], n = l.get(e.table_name) ?? [], r = new Map(n.map((e) => [e.source_column, e])), i = t.filter((e) => e.column_key === "PRI").map((e) => e.column_name), a = /* @__PURE__ */ new Set(), f = u.get(e.table_name);
-		if (f) for (let e of f.values()) e.length === 1 && e[0].non_unique === 0 && a.add(e[0].column_name);
-		let p = t.map((t) => {
-			let n = i.includes(t.column_name) && i.length === 1, c = r.get(t.column_name), l = c ? "reference" : n && t.column_name === "id" ? "id" : o.has(`${e.table_name}.${t.column_name}`) ? "json" : Hn(t.data_type, t.column_type), u = c ? {
-				table: c.target_table,
-				column: c.target_column,
-				onDelete: z(c.delete_rule),
-				onUpdate: z(c.update_rule)
-			} : void 0, d = a.has(t.column_name) || n && t.column_name === "id", f = t.column_default === "NULL" ? null : t.column_default, p = s.get(`${e.table_name}.${t.column_name}`);
+		let t = u.get(e.table_name) ?? [], n = d.get(e.table_name) ?? [], r = new Map(n.map((e) => [e.source_column, e])), i = t.filter((e) => e.column_key === "PRI").map((e) => e.column_name), a = /* @__PURE__ */ new Set(), o = f.get(e.table_name);
+		if (o) for (let e of o.values()) e.length === 1 && e[0].non_unique === 0 && a.add(e[0].column_name);
+		let s = t.map((t) => {
+			let n = i.includes(t.column_name) && i.length === 1, o = r.get(t.column_name), s = o ? "reference" : n && t.column_name === "id" ? "id" : c.has(`${e.table_name}.${t.column_name}`) ? "json" : Un(t.data_type, t.column_type), u = o ? {
+				table: o.target_table,
+				column: o.target_column,
+				onDelete: R(o.delete_rule),
+				onUpdate: R(o.update_rule)
+			} : void 0, d = a.has(t.column_name) || n && t.column_name === "id", f = t.column_default === "NULL" ? null : t.column_default, p = l.get(`${e.table_name}.${t.column_name}`);
 			return {
 				name: t.column_name,
-				type: l,
+				type: s,
 				nullable: t.is_nullable === "YES",
-				...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
+				...V(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: V(t.data_type, t.character_maximum_length) },
 				unique: d,
 				hasDefault: f !== null,
 				...f === null ? {} : { defaultValue: f },
 				...u ? { references: u } : {},
 				...p ? { oneOf: p } : {},
-				...Fn(t.generation_expression, /STORED/i.test(t.extra ?? "")) ?? {}
+				...In(t.generation_expression, /STORED/i.test(t.extra ?? "")) ?? {}
 			};
 		}), m = new Set(n.map((e) => e.source_column)), h = [];
-		if (f) for (let [t, n] of f) {
+		if (o) for (let [t, n] of o) {
 			let r = [...n].sort((e, t) => e.seq_in_index - t.seq_in_index);
 			(r.length !== 1 || r[0].non_unique !== 0) && (r.length === 1 && r[0].non_unique !== 0 && m.has(r[0].column_name) && t !== `${e.table_name}_${r[0].column_name}_idx` || h.push({
 				name: t,
@@ -1946,18 +1949,18 @@ BEGIN
 			unique: !0
 		});
 		let g = Number(e.table_rows ?? 0);
-		d.push({
+		p.push({
 			name: e.table_name,
-			columns: p,
+			columns: s,
 			indexes: h,
 			...g > 0 ? { rowCount: g } : {}
 		});
 	}
-	return { tables: d };
-}), Wn = (e) => {
+	return { tables: p };
+}), Gn = (e) => {
 	let t = e.toUpperCase();
 	return t.includes("INT") ? "integer" : t.includes("REAL") || t.includes("FLOA") || t.includes("DOUB") ? "real" : t.includes("BLOB") ? "bytes" : "text";
-}, Gn = (e) => x.gen(function* () {
+}, Kn = (e) => x.gen(function* () {
 	let t = yield* e`
       SELECT name, sql FROM sqlite_master
       WHERE type = 'table' AND name NOT LIKE 'sqlite_%'
@@ -1974,11 +1977,11 @@ BEGIN
 			d.set(t.name, r), t.unique === 1 && r.length === 1 && f.add(r[0]);
 		}
 		let p = o.map((e) => {
-			let n = u.length === 1 && u[0] === e.name, r = l.get(e.name), i = r ? "reference" : n && e.name === "id" ? "id" : Wn(e.type), a = r ? {
+			let n = u.length === 1 && u[0] === e.name, r = l.get(e.name), i = r ? "reference" : n && e.name === "id" ? "id" : Gn(e.type), a = r ? {
 				table: r.table,
 				column: r.to,
-				onDelete: z(r.on_delete),
-				onUpdate: z(r.on_update)
+				onDelete: R(r.on_delete),
+				onUpdate: R(r.on_update)
 			} : void 0, o = t.get(e.name);
 			return {
 				name: e.name,
@@ -1989,7 +1992,7 @@ BEGIN
 				...e.dflt_value === null ? {} : { defaultValue: e.dflt_value },
 				...a ? { references: a } : {},
 				...o ? { oneOf: o } : {},
-				...Fn(e.hidden === 2 || e.hidden === 3 ? "generated" : null, e.hidden === 3) ?? {}
+				...In(e.hidden === 2 || e.hidden === 3 ? "generated" : null, e.hidden === 3) ?? {}
 			};
 		}), m = new Set(s.map((e) => e.from)), h = [];
 		for (let e of c) {
@@ -2014,7 +2017,7 @@ BEGIN
 		});
 	}
 	return { tables: r };
-}), Kn = (e) => {
+}), qn = (e) => {
 	switch (e.toLowerCase()) {
 		case "int":
 		case "smallint":
@@ -2036,7 +2039,7 @@ BEGIN
 		case "image": return "bytes";
 		default: return "text";
 	}
-}, V = (e) => e === !0 || e === 1, qn = (e) => x.gen(function* () {
+}, B = (e) => e === !0 || e === 1, Jn = (e) => x.gen(function* () {
 	let t = yield* e`
       SELECT TABLE_NAME AS table_name FROM INFORMATION_SCHEMA.TABLES
       WHERE TABLE_TYPE = 'BASE TABLE' ORDER BY TABLE_NAME`, n = yield* e`
@@ -2098,36 +2101,36 @@ BEGIN
 		let t = l.get(e) ?? [], n = u.get(e) ?? [], r = new Map(n.map((e) => [e.source_column, e])), a = new Set(n.map((e) => e.source_column)), o = d.get(e), s = [], p = /* @__PURE__ */ new Set();
 		if (o) for (let [, e] of o) {
 			let t = [...e].sort((e, t) => e.key_ordinal - t.key_ordinal);
-			if (V(t[0].is_primary)) for (let e of t) s.push(e.column_name);
-			else V(t[0].is_unique) && t.length === 1 && p.add(t[0].column_name);
+			if (B(t[0].is_primary)) for (let e of t) s.push(e.column_name);
+			else B(t[0].is_unique) && t.length === 1 && p.add(t[0].column_name);
 		}
 		let m = t.map((t) => {
-			let n = s.length === 1 && s[0] === t.column_name, a = r.get(t.column_name), o = a ? "reference" : n && t.column_name === "id" ? "id" : Kn(t.data_type), l = a ? {
+			let n = s.length === 1 && s[0] === t.column_name, a = r.get(t.column_name), o = a ? "reference" : n && t.column_name === "id" ? "id" : qn(t.data_type), l = a ? {
 				table: a.target_table,
 				column: a.target_column,
-				onDelete: Jn(a.delete_rule),
-				onUpdate: Jn(a.update_rule)
-			} : void 0, u = t.column_default === null ? null : Yn(t.column_default), d = c.get(`${e}.${t.column_name}`);
+				onDelete: Yn(a.delete_rule),
+				onUpdate: Yn(a.update_rule)
+			} : void 0, u = t.column_default === null ? null : Xn(t.column_default), d = c.get(`${e}.${t.column_name}`);
 			return {
 				name: t.column_name,
 				type: o,
 				nullable: t.is_nullable === "YES",
-				...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
+				...V(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: V(t.data_type, t.character_maximum_length) },
 				unique: p.has(t.column_name) || n && t.column_name === "id",
 				hasDefault: u !== null,
 				...u === null ? {} : { defaultValue: u },
 				...l ? { references: l } : {},
 				...d ? { oneOf: d } : {},
-				...Fn(i.get(`${e}.${t.column_name}`)?.definition ?? null, V(i.get(`${e}.${t.column_name}`)?.is_persisted ?? !1)) ?? {}
+				...In(i.get(`${e}.${t.column_name}`)?.definition ?? null, B(i.get(`${e}.${t.column_name}`)?.is_persisted ?? !1)) ?? {}
 			};
 		}), h = [];
 		if (o) for (let [t, n] of o) {
 			let r = [...n].sort((e, t) => e.key_ordinal - t.key_ordinal);
-			V(r[0].is_primary) || r.length === 1 && V(r[0].is_unique) || r.length === 1 && !V(r[0].is_unique) && a.has(r[0].column_name) && t !== `${e}_${r[0].column_name}_idx` || h.push({
+			B(r[0].is_primary) || r.length === 1 && B(r[0].is_unique) || r.length === 1 && !B(r[0].is_unique) && a.has(r[0].column_name) && t !== `${e}_${r[0].column_name}_idx` || h.push({
 				name: t,
 				table: e,
 				columns: r.map((e) => e.column_name),
-				unique: V(r[0].is_unique)
+				unique: B(r[0].is_unique)
 			});
 		}
 		s.length > 0 && h.push({
@@ -2142,87 +2145,90 @@ BEGIN
 		});
 	}
 	return { tables: f };
-}), Jn = (e) => {
+}), Yn = (e) => {
 	switch (e.toUpperCase().replace(/_/g, " ")) {
 		case "CASCADE": return "cascade";
 		case "SET NULL": return "setNull";
 		case "SET DEFAULT": return "noAction";
 		default: return "noAction";
 	}
-}, Yn = (e) => {
+}, Xn = (e) => {
 	let t = e.trim();
 	for (; t.startsWith("(") && t.endsWith(")");) t = t.slice(1, -1).trim();
 	return t.startsWith("N'") && t.endsWith("'") ? t = t.slice(2, -1) : t.startsWith("'") && t.endsWith("'") && (t = t.slice(1, -1)), t;
-}, Xn = /* @__PURE__ */ new Set([
+}, Zn = /* @__PURE__ */ new Set([
 	"character varying",
 	"varchar",
 	"nvarchar",
 	"char",
 	"character",
 	"nchar"
-]), H = (e, t) => {
-	if (!Xn.has(e.toLowerCase())) return;
+]), V = (e, t) => {
+	if (!Zn.has(e.toLowerCase())) return;
 	let n = Number(t);
 	if (!(!Number.isFinite(n) || n <= 0)) return n;
-}, Zn = /* @__PURE__ */ new Set([O]), Qn = (e) => e.onDialectOrElse({
-	mysql: () => Un(e),
-	mssql: () => qn(e),
-	sqlite: () => Gn(e),
-	orElse: () => Vn(e)
+}, Qn = /* @__PURE__ */ new Set([D]), $n = (e) => e.onDialectOrElse({
+	mysql: () => Wn(e),
+	mssql: () => Jn(e),
+	sqlite: () => Kn(e),
+	orElse: () => Hn(e)
 }).pipe(x.map((e) => ({
 	...e,
-	tables: e.tables.filter((e) => !Zn.has(e.name))
-}))), $n = (e) => /mariadb/i.test(e) ? "mariadb" : "mysql", er = /* @__PURE__ */ new WeakMap(), U = (e) => x.suspend(() => {
-	let t = er.get(e);
-	return t === void 0 ? tr(e).pipe(x.tap((t) => x.sync(() => er.set(e, t)))) : x.succeed(t);
-}), tr = (e) => e.unsafe("SELECT VERSION() AS v").pipe(x.map((e) => {
+	tables: e.tables.filter((e) => !Qn.has(e.name))
+}))), er = (e) => /mariadb/i.test(e) ? "mariadb" : "mysql", tr = /* @__PURE__ */ new WeakMap(), H = (e) => x.suspend(() => {
+	let t = tr.get(e);
+	return t === void 0 ? nr(e).pipe(x.tap((t) => x.sync(() => tr.set(e, t)))) : x.succeed(t);
+}), nr = (e) => e.unsafe("SELECT VERSION() AS v").pipe(x.map((e) => {
 	let t = e[0]?.v;
-	return typeof t == "string" ? $n(t) : "mysql";
-}), x.catchAll(() => x.succeed("mysql"))), nr = (e) => {
+	return typeof t == "string" ? er(t) : "mysql";
+}), x.catchAll(() => x.succeed("mysql"))), rr = (e) => {
 	let t = e;
 	for (let e = 0; e < 6 && typeof t == "object" && t; e++) {
 		let e = t;
 		if (typeof e.errno == "number") return e.errno;
 		t = e.cause;
 	}
-}, rr = (e) => {
+}, ir = (e) => {
 	let t = [], n = e;
 	for (let e = 0; e < 6 && typeof n == "object" && n; e++) {
 		let e = n;
 		typeof e.message == "string" && t.push(e.message), n = e.cause;
 	}
 	return t.join(" | ");
-}, ir = (e, t) => {
+}, ar = (e, t) => {
 	if (t.length === 0) return !1;
-	let n = nr(e), r = rr(e);
+	let n = rr(e), r = ir(e);
 	return t.some((e) => e.errno !== void 0 && n !== void 0 && e.errno.includes(n) || e.messageIncludes !== void 0 && e.messageIncludes.some((e) => r.includes(e)));
-}, ar = {
+}, or = {
 	why: "mysql has no CREATE INDEX IF NOT EXISTS; 1061 is exactly that condition",
 	errno: [1061]
-}, or = {
+}, sr = {
 	why: "mysql has no DROP COLUMN IF EXISTS; 1091 is exactly that condition",
 	errno: [1091]
-}, sr = {
+}, cr = {
 	why: "sqlite has no DROP COLUMN IF EXISTS, and reports the absent column only in the message",
 	messageIncludes: ["no such column"]
-}, W = (e, t) => e.onDialectOrElse({
+}, lr = {
+	why: "mysql/mariadb DROP CONSTRAINT has no portable IF EXISTS; 1091 / 3940 are exactly \"already gone\"",
+	errno: [1091, 3940]
+}, U = (e, t) => e.onDialectOrElse({
 	mysql: () => x.succeed(t.replace("T", " ").replace("Z", "")),
 	orElse: () => x.succeed(t)
-}), cr = (e, t) => `${t}(${e.precision ?? 38}, ${e.scale ?? 0})`, lr = (e, t) => {
+}), ur = (e, t) => `${t}(${e.precision ?? 38}, ${e.scale ?? 0})`, dr = (e, t) => {
 	if ((e.type !== "text" || e.maxLength === void 0) && !e.spatial && e.type !== "vector" && e.type !== "array" && e.type !== "enum") return;
 	let n = e.type === "vector" && e.vectorDim === void 0 ? "vector dimension" : e.type === "array" && e.arrayElement === void 0 ? "array element type" : e.type === "enum" && e.enumName === void 0 && e.enumValues === void 0 ? "enum name/values" : void 0;
 	if (n !== void 0) throw Error(`migration applier: cannot render '${e.name}' (${e.type}) — the schema snapshot carries no ${n}. Rendering it as 'text' would emit DDL that applies successfully and changes nothing, so this fails instead. This is a framework bug: declaredSchema.ts must carry the parameter into the ColumnSnapshot.`);
-	return j(e, t);
-}, ur = (e) => {
-	let t = lr(e, "postgres");
-	return t === void 0 ? dr(e) : t;
-}, dr = (e) => {
+	return A(e, t);
+}, fr = (e) => {
+	let t = dr(e, "postgres");
+	return t === void 0 ? pr(e) : t;
+}, pr = (e) => {
 	switch (e.type) {
 		case "id": return "text";
 		case "text": return "text";
 		case "integer": return "integer";
 		case "real": return "double precision";
-		case "decimal": return cr(e, "NUMERIC");
+		case "decimal": return ur(e, "NUMERIC");
 		case "bigint": return "bigint";
 		case "boolean": return "boolean";
 		case "timestamp": return "timestamptz";
@@ -2236,15 +2242,15 @@ BEGIN
 		case "interval": return "interval";
 		case "raw": return e.rawDdl ?? "text";
 	}
-}, fr = (e) => {
-	let t = lr(e, "mariadb");
+}, mr = (e) => {
+	let t = dr(e, "mariadb");
 	if (t !== void 0) return t;
 	switch (e.type) {
 		case "id": return "VARCHAR(64)";
 		case "text": return e.hasDefault && e.defaultValue !== void 0 || e.oneOf && e.oneOf.length > 0 ? "VARCHAR(255)" : "LONGTEXT";
 		case "integer": return "INT";
 		case "real": return "DOUBLE";
-		case "decimal": return cr(e, "DECIMAL");
+		case "decimal": return ur(e, "DECIMAL");
 		case "bigint": return "BIGINT";
 		case "boolean": return "TINYINT(1)";
 		case "timestamp": return "DATETIME(6)";
@@ -2258,58 +2264,58 @@ BEGIN
 		case "interval": return "BIGINT";
 		case "raw": return e.rawDdl ?? "LONGTEXT";
 	}
-}, G = (e) => `"${e}"`, K = (e) => `\`${e.replace(/`/g, "``")}\``, pr = (e) => e === "mariadb" ? "IF NOT EXISTS " : "", mr = (e, t, n = !0) => `ALTER TABLE ${t(e.table)} DROP COLUMN ${n ? "IF EXISTS " : ""}${t(e.column)};`, hr = (e, t = "mariadb") => `ALTER TABLE ${K(e.table)} DROP COLUMN ${t === "mariadb" ? "IF EXISTS " : ""}${K(e.column)}, ALGORITHM=COPY;`, gr = (e, t) => `ALTER TABLE ${t(e.table)} RENAME COLUMN ${t(e.from)} TO ${t(e.to)};`, _r = (e, t, n) => `ALTER TABLE ${n(e.table)} RENAME COLUMN ${n(e.column)} TO ${n(`${e.column}${Gr(t)}`)};`, vr = (e, t, n) => e.hasDefault && e.defaultValue !== void 0 ? `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} SET ${yr(e, n)};` : `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} DROP DEFAULT;`, yr = (e, t) => {
+}, W = (e) => `"${e}"`, G = (e) => `\`${e.replace(/`/g, "``")}\``, hr = (e) => e === "mariadb" ? "IF NOT EXISTS " : "", gr = (e, t, n = !0) => `ALTER TABLE ${t(e.table)} DROP COLUMN ${n ? "IF EXISTS " : ""}${t(e.column)};`, _r = (e, t = "mariadb") => `ALTER TABLE ${G(e.table)} DROP COLUMN ${t === "mariadb" ? "IF EXISTS " : ""}${G(e.column)}, ALGORITHM=COPY;`, vr = (e, t) => `ALTER TABLE ${t(e.table)} RENAME COLUMN ${t(e.from)} TO ${t(e.to)};`, yr = (e, t, n) => `ALTER TABLE ${n(e.table)} RENAME COLUMN ${n(e.column)} TO ${n(`${e.column}${Kr(t)}`)};`, br = (e, t, n) => e.hasDefault && e.defaultValue !== void 0 ? `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} SET ${xr(e, n)};` : `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} DROP DEFAULT;`, xr = (e, t) => {
 	let n = t(e.defaultValue);
 	if (n === null) throw Error(`migration applier: cannot render the declared default for '${e.table}.${e.column}' (${JSON.stringify(e.defaultValue)}). Emitting 'DEFAULT NULL' would apply cleanly and drop the default silently, so this fails instead. This is a framework bug — report the column type + default.`);
 	return n;
-}, q = (e, t, n) => e.find((e) => e.tableName === t)?.fields[n], br = (e, t, n) => {
-	let r = q(e, t, n);
-	return r ? Gt(n, r) : void 0;
-}, xr = (e, t, n) => {
-	let r = n ?? e.nullable, i = Qe(e, "mariadb");
+}, K = (e, t, n) => e.find((e) => e.tableName === t)?.fields[n], Sr = (e, t, n) => {
+	let r = K(e, t, n);
+	return r ? Kt(n, r) : void 0;
+}, Cr = (e, t, n) => {
+	let r = n ?? e.nullable, i = $e(e, "mariadb");
 	return [
-		K(t),
-		j(e, "mariadb"),
+		G(t),
+		A(e, "mariadb"),
 		r ? null : "NOT NULL",
 		i
 	].filter(Boolean).join(" ");
-}, Sr = (e, t) => e == null ? null : Array.isArray(e) ? Cr(e, t, "mariadb") : e === "now" ? "DEFAULT CURRENT_TIMESTAMP(6)" : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? M(e, "mariadb") : null, Cr = (e, t, n) => $e(e, t ?? { type: "json" }, n), wr = (e, t) => e == null ? null : Array.isArray(e) ? Cr(e, t, "postgres") : e === "now" ? "DEFAULT now()" : typeof e == "boolean" || typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|::|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? M(e, "postgres") : null, Tr = (e, t) => {
+}, wr = (e, t) => e == null ? null : Array.isArray(e) ? Tr(e, t, "mariadb") : e === "now" ? "DEFAULT CURRENT_TIMESTAMP(6)" : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? j(e, "mariadb") : null, Tr = (e, t, n) => et(e, t ?? { type: "json" }, n), Er = (e, t) => e == null ? null : Array.isArray(e) ? Tr(e, t, "postgres") : e === "now" ? "DEFAULT now()" : typeof e == "boolean" || typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|::|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? j(e, "postgres") : null, q = (e, t) => {
 	if (!e.generatedAs) return null;
 	let { expr: n, stored: r } = e.generatedAs;
 	return t === "postgres" ? `GENERATED ALWAYS AS (${n}) STORED` : t === "mssql" ? `AS (${n})${r ? " PERSISTED" : ""}` : `GENERATED ALWAYS AS (${n}) ${r ? "STORED" : "VIRTUAL"}`;
-}, Er = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return N(e.name, "postgres");
-	let t = Tr(e, "postgres");
-	if (t) return `${G(e.name)} ${ur(e)} ${t}`;
-	let n = [G(e.name), ur(e)];
+}, Dr = (e) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return M(e.name, "postgres");
+	let t = q(e, "postgres");
+	if (t) return `${W(e.name)} ${fr(e)} ${t}`;
+	let n = [W(e.name), fr(e)];
 	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && n.push("UNIQUE"), e.hasDefault) {
-		let t = wr(e.defaultValue, e);
+		let t = Er(e.defaultValue, e);
 		t && n.push(t);
 	}
-	return e.references && (n.push(`REFERENCES ${G(e.references.table)} (${G(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${{
+	return e.references && (n.push(`REFERENCES ${W(e.references.table)} (${W(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${{
 		cascade: "CASCADE",
 		restrict: "RESTRICT",
 		setNull: "SET NULL",
 		noAction: "NO ACTION"
 	}[e.references.onDelete]}`)), n.join(" ");
-}, Dr = (e, t) => e.primaryKey && e.primaryKey.length > 0 ? `,\n  PRIMARY KEY (${e.primaryKey.map(t).join(", ")})` : "", Or = (e) => {
-	let t = e.columns.map((e) => `  ${Er(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${t}${Dr(e, G)}\n)`];
-	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${G(t.name)} ON ${G(e.table)} (${t.columns.map(Xr).join(", ")})`);
+}, Or = (e, t) => e.primaryKey && e.primaryKey.length > 0 ? `,\n  PRIMARY KEY (${e.primaryKey.map(t).join(", ")})` : "", kr = (e) => {
+	let t = e.columns.map((e) => `  ${Dr(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${W(e.table)} (\n${t}${Or(e, W)}\n)`];
+	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${W(t.name)} ON ${W(e.table)} (${t.columns.map(Zr).join(", ")})`);
 	return n;
-}, kr = 191, Ar = (e) => {
-	let t = fr(e).toUpperCase();
+}, Ar = 191, jr = (e) => {
+	let t = mr(e).toUpperCase();
 	return t.endsWith("TEXT") || t.endsWith("BLOB");
-}, jr = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return N(e.name, "mariadb");
-	let t = Tr(e, "mariadb");
-	if (t) return `${K(e.name)} ${fr(e)} ${t}`;
-	let n = [K(e.name), fr(e)];
-	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && !Ar(e) && n.push("UNIQUE"), e.hasDefault) {
-		let t = Sr(e.defaultValue, e);
+}, Mr = (e) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return M(e.name, "mariadb");
+	let t = q(e, "mariadb");
+	if (t) return `${G(e.name)} ${mr(e)} ${t}`;
+	let n = [G(e.name), mr(e)];
+	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && !jr(e) && n.push("UNIQUE"), e.hasDefault) {
+		let t = wr(e.defaultValue, e);
 		t && n.push(t);
 	}
 	return n.join(" ");
-}, Mr = (e) => e.columns.flatMap((t) => {
+}, Nr = (e) => e.columns.flatMap((t) => {
 	if (!t.references) return [];
 	let n = t.references.onDelete ? ` ON DELETE ${{
 		cascade: "CASCADE",
@@ -2317,27 +2323,27 @@ BEGIN
 		setNull: "SET NULL",
 		noAction: "NO ACTION"
 	}[t.references.onDelete]}` : "";
-	return [`  CONSTRAINT ${K(`${e.table}_${t.name}_fkey`)} FOREIGN KEY (${K(t.name)}) REFERENCES ${K(t.references.table)} (${K(t.references.column)})${n}`];
-}), Nr = (e, t = "mariadb") => {
+	return [`  CONSTRAINT ${G(`${e.table}_${t.name}_fkey`)} FOREIGN KEY (${G(t.name)}) REFERENCES ${G(t.references.table)} (${G(t.references.column)})${n}`];
+}), Pr = (e, t = "mariadb") => {
 	let n = new Map(e.columns.map((e) => [e.name, e])), r = (e) => {
-		let t = Jr(n.get(e));
-		return t === void 0 ? K(e) : `${K(e)}(${t})`;
-	}, i = e.columns.map((e) => `  ${jr(e)}`).join(",\n"), a = Mr(e), o = a.length > 0 ? `${i},\n${a.join(",\n")}` : i, s = [`CREATE TABLE IF NOT EXISTS ${K(e.table)} (\n${o}${Dr(e, r)}\n)`];
-	for (let n of e.columns) n.unique && n.type !== "id" && Ar(n) && s.push(`CREATE UNIQUE INDEX ${pr(t)}${K(`${e.table}_${n.name}_key`)} ON ${K(e.table)} (${r(n.name)})`);
-	for (let n of e.indexes) n.name !== `${e.table}_pkey` && s.push(`CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${pr(t)}${K(n.name)} ON ${K(e.table)} (${n.columns.map(r).join(", ")})`);
+		let t = Yr(n.get(e));
+		return t === void 0 ? G(e) : `${G(e)}(${t})`;
+	}, i = e.columns.map((e) => `  ${Mr(e)}`).join(",\n"), a = Nr(e), o = a.length > 0 ? `${i},\n${a.join(",\n")}` : i, s = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${o}${Or(e, r)}\n)`];
+	for (let n of e.columns) n.unique && n.type !== "id" && jr(n) && s.push(`CREATE UNIQUE INDEX ${hr(t)}${G(`${e.table}_${n.name}_key`)} ON ${G(e.table)} (${r(n.name)})`);
+	for (let n of e.indexes) n.name !== `${e.table}_pkey` && s.push(`CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${hr(t)}${G(n.name)} ON ${G(e.table)} (${n.columns.map(r).join(", ")})`);
 	return s;
-}, Pr = {
+}, Fr = {
 	cascade: "CASCADE",
 	restrict: "RESTRICT",
 	setNull: "SET NULL",
 	noAction: "NO ACTION"
-}, Fr = {
+}, Ir = {
 	cascade: "CASCADE",
 	restrict: "NO ACTION",
 	setNull: "SET NULL",
 	noAction: "NO ACTION"
-}, Ir = (e) => {
-	let t = lr(e, "sqlite");
+}, Lr = (e) => {
+	let t = dr(e, "sqlite");
 	if (t !== void 0) return t;
 	switch (e.type) {
 		case "integer":
@@ -2348,60 +2354,60 @@ BEGIN
 		case "bytes": return "BLOB";
 		default: return "TEXT";
 	}
-}, Lr = (e, t) => e == null ? null : e === "now" ? `DEFAULT ${t}` : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? M(e, "sqlite") : null, Rr = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return N(e.name, "sqlite");
-	let t = Tr(e, "sqlite");
-	if (t) return `${G(e.name)} ${Ir(e)} ${t}`;
-	let n = [G(e.name), Ir(e)];
+}, Rr = (e, t) => e == null ? null : e === "now" ? `DEFAULT ${t}` : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? j(e, "sqlite") : null, zr = (e) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return M(e.name, "sqlite");
+	let t = q(e, "sqlite");
+	if (t) return `${W(e.name)} ${Lr(e)} ${t}`;
+	let n = [W(e.name), Lr(e)];
 	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && n.push("UNIQUE"), e.hasDefault) {
-		let t = Lr(e.defaultValue, "CURRENT_TIMESTAMP");
+		let t = Rr(e.defaultValue, "CURRENT_TIMESTAMP");
 		t && n.push(t);
 	}
-	if (e.references && (n.push(`REFERENCES ${G(e.references.table)} (${G(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${Pr[e.references.onDelete]}`)), e.oneOf && e.oneOf.length > 0) {
+	if (e.references && (n.push(`REFERENCES ${W(e.references.table)} (${W(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${Fr[e.references.onDelete]}`)), e.oneOf && e.oneOf.length > 0) {
 		let t = e.oneOf.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ");
-		n.push(`CHECK (${G(e.name)} IN (${t}))`);
+		n.push(`CHECK (${W(e.name)} IN (${t}))`);
 	}
 	return n.join(" ");
-}, zr = (e) => {
-	let t = e.columns.map((e) => `  ${Rr(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${t}${Dr(e, G)}\n)`];
-	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${G(t.name)} ON ${G(e.table)} (${t.columns.map(G).join(", ")})`);
+}, Br = (e) => {
+	let t = e.columns.map((e) => `  ${zr(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${W(e.table)} (\n${t}${Or(e, W)}\n)`];
+	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${W(t.name)} ON ${W(e.table)} (${t.columns.map(W).join(", ")})`);
 	return n;
 }, J = (e, t) => {
 	let n = t.find((t) => t.tableName === e);
 	if (!n) return [];
-	let r = I([n]).tables[0], i = `${e}__voltro_rebuild`, a = r.columns.map((e) => G(e.name)).join(", "), o = [
-		...zr({
+	let r = F([n]).tables[0], i = `${e}__voltro_rebuild`, a = r.columns.map((e) => W(e.name)).join(", "), o = [
+		...Br({
 			kind: "create-table",
 			table: i,
 			columns: r.columns,
 			indexes: [],
 			...r.primaryKey ? { primaryKey: r.primaryKey } : {}
 		}),
-		`INSERT INTO ${G(i)} (${a}) SELECT ${a} FROM ${G(e)}`,
-		`DROP TABLE ${G(e)}`,
-		`ALTER TABLE ${G(i)} RENAME TO ${G(e)}`
+		`INSERT INTO ${W(i)} (${a}) SELECT ${a} FROM ${W(e)}`,
+		`DROP TABLE ${W(e)}`,
+		`ALTER TABLE ${W(i)} RENAME TO ${W(e)}`
 	];
-	for (let t of r.indexes) t.name !== `${e}_pkey` && o.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${G(t.name)} ON ${G(e)} (${t.columns.map(G).join(", ")})`);
+	for (let t of r.indexes) t.name !== `${e}_pkey` && o.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${W(t.name)} ON ${W(e)} (${t.columns.map(W).join(", ")})`);
 	return o;
-}, Br = (e, t, n, r) => {
+}, Vr = (e, t, n, r) => {
 	let i = r ?? e.nullable;
-	return `ALTER TABLE ${Y(n)} ALTER COLUMN ${Y(t)} ${j(e, "mssql")} ${i ? "NULL" : "NOT NULL"};`;
-}, Vr = (e) => {
+	return `ALTER TABLE ${Y(n)} ALTER COLUMN ${Y(t)} ${A(e, "mssql")} ${i ? "NULL" : "NOT NULL"};`;
+}, Hr = (e) => {
 	let t = `DECLARE @dc sysname; SELECT @dc = dc.name FROM sys.default_constraints dc JOIN sys.columns col ON col.object_id = dc.parent_object_id AND col.column_id = dc.parent_column_id WHERE dc.parent_object_id = OBJECT_ID(N'${e.table.replace(/'/g, "''")}') AND col.name = N'${e.column.replace(/'/g, "''")}'; IF @dc IS NOT NULL EXEC(N'ALTER TABLE ${Y(e.table)} DROP CONSTRAINT [' + @dc + ']');`;
 	if (!e.hasDefault) return t;
-	let n = Lr(e.defaultValue, "SYSUTCDATETIME()");
+	let n = Rr(e.defaultValue, "SYSUTCDATETIME()");
 	if (!n) return t;
 	let r = n.replace(/^DEFAULT\s+/i, "");
 	return `${t} ALTER TABLE ${Y(e.table)} ADD DEFAULT ${r} FOR ${Y(e.column)};`;
-}, Y = (e) => `[${e.replace(/]/g, "]]")}]`, Hr = (e) => {
-	let t = lr(e, "mssql");
+}, Y = (e) => `[${e.replace(/]/g, "]]")}]`, Ur = (e) => {
+	let t = dr(e, "mssql");
 	if (t !== void 0) return t;
 	switch (e.type) {
 		case "id":
 		case "reference": return "NVARCHAR(64)";
 		case "integer": return "INT";
 		case "real": return "FLOAT";
-		case "decimal": return cr(e, "DECIMAL");
+		case "decimal": return ur(e, "DECIMAL");
 		case "bigint": return "BIGINT";
 		case "boolean": return "BIT";
 		case "timestamp": return "DATETIME2(6)";
@@ -2409,44 +2415,44 @@ BEGIN
 		case "bytes": return "VARBINARY(MAX)";
 		default: return "NVARCHAR(MAX)";
 	}
-}, Ur = (e, t) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return N(e.name, "mssql");
-	let n = e.type === "text" && t?.has(e.name) ? "NVARCHAR(450)" : Hr(e), r = Tr(e, "mssql");
+}, Wr = (e, t) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return M(e.name, "mssql");
+	let n = e.type === "text" && t?.has(e.name) ? "NVARCHAR(450)" : Ur(e), r = q(e, "mssql");
 	if (r) return `${Y(e.name)} ${r}`;
 	let i = [Y(e.name), n];
 	if (e.type === "id" && i.push("PRIMARY KEY"), e.nullable || i.push("NOT NULL"), e.unique && e.type !== "id" && i.push("UNIQUE"), e.hasDefault) {
-		let t = Lr(e.defaultValue, "SYSUTCDATETIME()");
+		let t = Rr(e.defaultValue, "SYSUTCDATETIME()");
 		t && i.push(t);
 	}
-	return e.references && (i.push(`REFERENCES ${Y(e.references.table)} (${Y(e.references.column)})`), e.references.onDelete && i.push(`ON DELETE ${Fr[e.references.onDelete]}`)), i.join(" ");
-}, Wr = (e) => {
-	let t = (e) => e.replace(/'/g, "''"), n = new Set(e.indexes.flatMap((e) => e.columns)), r = e.columns.map((e) => `  ${Ur(e, n)}`).join(",\n"), i = `CREATE TABLE ${Y(e.table)} (\n${r}${Dr(e, Y)}\n)`, a = [`IF OBJECT_ID(N'${t(e.table)}', N'U') IS NULL EXEC(N'${t(i)}')`];
+	return e.references && (i.push(`REFERENCES ${Y(e.references.table)} (${Y(e.references.column)})`), e.references.onDelete && i.push(`ON DELETE ${Ir[e.references.onDelete]}`)), i.join(" ");
+}, Gr = (e) => {
+	let t = (e) => e.replace(/'/g, "''"), n = new Set(e.indexes.flatMap((e) => e.columns)), r = e.columns.map((e) => `  ${Wr(e, n)}`).join(",\n"), i = `CREATE TABLE ${Y(e.table)} (\n${r}${Or(e, Y)}\n)`, a = [`IF OBJECT_ID(N'${t(e.table)}', N'U') IS NULL EXEC(N'${t(i)}')`];
 	for (let n of e.indexes) {
 		if (n.name === `${e.table}_pkey`) continue;
 		let r = `CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${Y(n.name)} ON ${Y(e.table)} (${n.columns.map(Y).join(", ")})`;
 		a.push(`IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = N'${t(n.name)}' AND object_id = OBJECT_ID(N'${t(e.table)}')) EXEC(N'${t(r)}')`);
 	}
 	return a;
-}, Gr = (e) => `__dropped_${e.replace(/[-:T.Z]/g, "").slice(0, 14)}`, Kr = (e, t) => `DROP TABLE IF EXISTS ${t(e.table)};`, qr = (e, t, n) => {
-	let r = `${e.table}${Gr(t)}`;
+}, Kr = (e) => `__dropped_${e.replace(/[-:T.Z]/g, "").slice(0, 14)}`, qr = (e, t) => `DROP TABLE IF EXISTS ${t(e.table)};`, Jr = (e, t, n) => {
+	let r = `${e.table}${Kr(t)}`;
 	return `ALTER TABLE ${n(e.table)} RENAME TO ${n(r)};`;
-}, Jr = (e) => {
-	if (e === void 0 || !Ar(e)) return;
+}, Yr = (e) => {
+	if (e === void 0 || !jr(e)) return;
 	let t = typeof e.maxLength == "number" && e.maxLength > 0 ? e.maxLength : void 0;
-	return t === void 0 ? kr : Math.min(kr, t);
-}, Yr = (e, t, n) => {
-	let r = Jr(br(e, t, n));
-	return r === void 0 ? K(n) : `${K(n)}(${r})`;
-}, Xr = (e) => e.startsWith("(") ? e : G(e), Zr = (e, t) => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${t ? "CONCURRENTLY " : ""}IF NOT EXISTS ${G(e.index.name)} ON ${G(e.table)} (${e.index.columns.map(Xr).join(", ")});`, Qr = (e, t, n = "mariadb") => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${pr(n)}${K(e.index.name)} ON ${K(e.table)} (${e.index.columns.map((n) => Yr(t, e.table, n)).join(", ")});`, $r = (e) => `DROP INDEX IF EXISTS ${G(e.index)};`, ei = (e) => `DROP INDEX ${K(e.index)} ON ${K(e.table)};`, ti = (e) => `DROP INDEX IF EXISTS ${Y(e.index)} ON ${Y(e.table)};`, ni = (e, t) => `ALTER TABLE ${t(e.from)} RENAME TO ${t(e.to)};`, ri = (e) => {
+	return t === void 0 ? Ar : Math.min(Ar, t);
+}, Xr = (e, t, n) => {
+	let r = Yr(Sr(e, t, n));
+	return r === void 0 ? G(n) : `${G(n)}(${r})`;
+}, Zr = (e) => e.startsWith("(") ? e : W(e), Qr = (e, t) => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${t ? "CONCURRENTLY " : ""}IF NOT EXISTS ${W(e.index.name)} ON ${W(e.table)} (${e.index.columns.map(Zr).join(", ")});`, $r = (e, t, n = "mariadb") => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${hr(n)}${G(e.index.name)} ON ${G(e.table)} (${e.index.columns.map((n) => Xr(t, e.table, n)).join(", ")});`, ei = (e) => `DROP INDEX IF EXISTS ${W(e.index)};`, ti = (e) => `DROP INDEX ${G(e.index)} ON ${G(e.table)};`, ni = (e) => `DROP INDEX IF EXISTS ${Y(e.index)} ON ${Y(e.table)};`, ri = (e, t) => `ALTER TABLE ${t(e.from)} RENAME TO ${t(e.to)};`, ii = (e) => {
 	let t = (e) => e.replace(/'/g, "''");
 	return `EXEC sp_rename N'${t(e.from)}', N'${t(e.to)}';`;
-}, ii = (e) => `ALTER INDEX ${G(e.from)} RENAME TO ${G(e.to)};`, ai = (e) => `ALTER TABLE ${K(e.table)} RENAME INDEX ${K(e.from)} TO ${K(e.to)};`, oi = (e) => {
+}, ai = (e) => `ALTER INDEX ${W(e.from)} RENAME TO ${W(e.to)};`, oi = (e) => `ALTER TABLE ${G(e.table)} RENAME INDEX ${G(e.from)} TO ${G(e.to)};`, si = (e) => {
 	let t = (e) => e.replace(/'/g, "''");
 	return `EXEC sp_rename N'${t(e.table)}.${t(e.from)}', N'${t(e.to)}', N'INDEX';`;
-}, si = (e) => {
+}, ci = (e) => {
 	let t = (e) => e.replace(/'/g, "''"), n = `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${Y(e.index.name)} ON ${Y(e.table)} (${e.index.columns.map(Y).join(", ")})`;
 	return `IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = N'${t(e.index.name)}' AND object_id = OBJECT_ID(N'${t(e.table)}')) EXEC(N'${t(n)}');`;
-}, ci = (e, t, n) => {
+}, li = (e, t, n) => {
 	let r = n.find((t) => t.tableName === e);
 	if (!r) return [];
 	let i = [];
@@ -2455,13 +2461,13 @@ BEGIN
 		t && t.type === "text" && !t.generatedAs && i.push(`ALTER TABLE ${Y(e)} ALTER COLUMN ${Y(n)} NVARCHAR(450) ${t.nullable ? "NULL" : "NOT NULL"};`);
 	}
 	return i;
-}, li = (e) => `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(`${e.table}_${e.column}_key`)} UNIQUE (${G(e.column)});`, ui = (e, t) => `ALTER TABLE ${K(e.table)} ADD CONSTRAINT ${K(`${e.table}_${e.column}_key`)} UNIQUE (${Yr(t, e.table, e.column)});`, di = (e) => {
-	let t = e.fields.map((e) => G(e)).join(", ");
-	return `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(e.name)} UNIQUE (${t});`;
-}, fi = (e, t) => {
-	let n = e.fields.map((n) => Yr(t, e.table, n)).join(", ");
-	return `ALTER TABLE ${K(e.table)} ADD CONSTRAINT ${K(e.name)} UNIQUE (${n});`;
-}, pi = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(e.name)};`, mi = (e) => `ALTER TABLE ${K(e.table)} DROP INDEX ${K(e.name)};`, hi = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_key`)};`, gi = (e) => `ALTER TABLE ${K(e.table)} DROP INDEX ${K(`${e.table}_${e.column}_key`)};`, _i = (e, t) => {
+}, ui = (e) => `ALTER TABLE ${W(e.table)} ADD CONSTRAINT ${W(`${e.table}_${e.column}_key`)} UNIQUE (${W(e.column)});`, di = (e, t) => `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(`${e.table}_${e.column}_key`)} UNIQUE (${Xr(t, e.table, e.column)});`, fi = (e) => {
+	let t = e.fields.map((e) => W(e)).join(", ");
+	return `ALTER TABLE ${W(e.table)} ADD CONSTRAINT ${W(e.name)} UNIQUE (${t});`;
+}, pi = (e, t) => {
+	let n = e.fields.map((n) => Xr(t, e.table, n)).join(", ");
+	return `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(e.name)} UNIQUE (${n});`;
+}, mi = (e) => `ALTER TABLE ${W(e.table)} DROP CONSTRAINT IF EXISTS ${W(e.name)};`, hi = (e) => `ALTER TABLE ${G(e.table)} DROP INDEX ${G(e.name)};`, gi = (e) => `ALTER TABLE ${W(e.table)} DROP CONSTRAINT IF EXISTS ${W(`${e.table}_${e.column}_key`)};`, _i = (e) => `ALTER TABLE ${G(e.table)} DROP INDEX ${G(`${e.table}_${e.column}_key`)};`, vi = (e, t) => {
 	let n = [], r = t(e.table), i = t(e.column), a = t(e.targetTable), o = t(e.targetColumn);
 	if (e.orphanPolicy) {
 		let t = `${i} IS NOT NULL AND ${i} NOT IN (SELECT ${o} FROM ${a})`;
@@ -2479,11 +2485,34 @@ BEGIN
 		setNull: "SET NULL",
 		noAction: "NO ACTION"
 	}[e.onDelete]}`), n.push(s.join(" ") + ";"), n;
-}, vi = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_fkey`)};`, yi = (e) => `ALTER TABLE ${K(e.table)} DROP FOREIGN KEY ${K(`${e.table}_${e.column}_fkey`)};`, bi = (e, t) => {
+}, yi = (e) => `ALTER TABLE ${W(e.table)} DROP CONSTRAINT IF EXISTS ${W(`${e.table}_${e.column}_fkey`)};`, bi = (e) => `ALTER TABLE ${G(e.table)} DROP FOREIGN KEY ${G(`${e.table}_${e.column}_fkey`)};`, xi = (e, t) => {
 	let n = e.values.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ");
 	return `ALTER TABLE ${t(e.table)} ADD CONSTRAINT ${t(`${e.table}_${e.column}_check`)} CHECK (${t(e.column)} IN (${n}));`;
-}, xi = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_check`)};`, Si = (e) => `ALTER TABLE ${K(e.table)} DROP CHECK ${K(`${e.table}_${e.column}_check`)};`, Ci = (e, t, n, r) => {
-	let i = e.column, a = r === "mariadb", o = a ? K : r === "mssql" ? Y : G, s = a ? fr(i) : r === "mssql" ? Hr(i) : r === "sqlite" ? Ir(i) : ur(i), c = r === "mssql" ? "ADD" : "ADD COLUMN", l = (e) => a ? Sr(e, i) : r === "mssql" ? Lr(e, "SYSUTCDATETIME()") : r === "sqlite" ? Lr(e, "CURRENT_TIMESTAMP") : wr(e, i), u = Tr(i, r);
+}, Si = (e) => `ALTER TABLE ${W(e.table)} DROP CONSTRAINT IF EXISTS ${W(`${e.table}_${e.column}_check`)};`, Ci = (e, t) => x.gen(function* () {
+	let n = yield* e`
+      SELECT cc.constraint_name AS n, cc.check_clause AS c
+      FROM information_schema.check_constraints cc
+      WHERE cc.constraint_schema = DATABASE() AND cc.table_name = ${t.table}`.pipe(x.orElse(() => e`
+        SELECT cc.constraint_name AS n, cc.check_clause AS c
+        FROM information_schema.check_constraints cc
+        JOIN information_schema.table_constraints tc
+          ON tc.constraint_schema = cc.constraint_schema
+         AND tc.constraint_name   = cc.constraint_name
+        WHERE tc.table_schema = DATABASE() AND tc.table_name = ${t.table}`), x.orElseSucceed(() => []));
+	for (let e of n) {
+		let n = String(e.n ?? "");
+		if (n !== "" && Pn(String(e.c ?? ""))?.column === t.column) return n;
+	}
+}), wi = (e, t, n) => x.gen(function* () {
+	let r = yield* Ci(e, t);
+	r !== void 0 && (yield* X(e, `ALTER TABLE ${G(t.table)} DROP CONSTRAINT ${G(r)};`, t.kind, [lr]));
+	let i = yield* Ci(e, t);
+	if (i === void 0) return;
+	let a = K(n, t.table, t.column);
+	if (!a) return yield* x.die(/* @__PURE__ */ Error(`applier: cannot drop the CHECK on '${t.table}.${t.column}' — it is column-level (catalog name '${i}'), which this family removes only by redefining the column, and the declared column is not available to redefine it from.`));
+	yield* X(e, `ALTER TABLE ${G(t.table)} MODIFY COLUMN ${Cr(a, t.column)};`, t.kind);
+}), Ti = (e, t, n, r) => {
+	let i = e.column, a = r === "mariadb", o = a ? G : r === "mssql" ? Y : W, s = a ? mr(i) : r === "mssql" ? Ur(i) : r === "sqlite" ? Lr(i) : fr(i), c = r === "mssql" ? "ADD" : "ADD COLUMN", l = (e) => a ? wr(e, i) : r === "mssql" ? Rr(e, "SYSUTCDATETIME()") : r === "sqlite" ? Rr(e, "CURRENT_TIMESTAMP") : Er(e, i), u = q(i, r);
 	if (u) {
 		let t = r === "mssql" ? `${o(i.name)} ${u}` : `${o(i.name)} ${s} ${u}`;
 		return {
@@ -2511,7 +2540,7 @@ BEGIN
 		post: f ? [f] : []
 	};
 	return d?.sql && (p.backfillKind = "sql", p.backfillSql = d.sql), d?.js && (p.backfillKind = "js", p.backfillJs = d.js), d?.batchSize !== void 0 && (p.batchSize = d.batchSize), d?.sleepMs !== void 0 && (p.sleepMs = d.sleepMs), p;
-}, wi = (e) => {
+}, Ei = (e) => {
 	let t = new Map(e.map((e) => [e.tableName, e]));
 	return (e, n) => {
 		let r = t.get(e);
@@ -2531,47 +2560,47 @@ BEGIN
 			...o
 		};
 	};
-}, X = (e, t, n, r = []) => e.unsafe(t).pipe(x.catchIf((e) => ir(e, r), () => x.void), x.tapError((e) => x.sync(() => {
+}, X = (e, t, n, r = []) => e.unsafe(t).pipe(x.catchIf((e) => ar(e, r), () => x.void), x.tapError((e) => x.sync(() => {
 	process.stderr.write(ae(`applier: statement failed (op=${n})`, t, e, 400));
 })), x.mapError((e) => {
 	let r = ae(`applier: statement failed (op=${n})`, t, e, 400).trim();
 	return Object.assign(e, { message: r });
-}), x.map(() => void 0)), Z = (e, t, n) => x.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, r, i) => e.unsafe(`SELECT ${i === void 0 ? "*" : n(i, t)} FROM ${n(r, t)} WHERE 1=0`).pipe(x.as(!0), x.catchAll(() => x.succeed(!1))), Ti = (e, t) => x.gen(function* () {
-	let n = I([Ie], t).tables[0];
+}), x.map(() => void 0)), Z = (e, t, n) => x.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, r, i) => e.unsafe(`SELECT ${i === void 0 ? "*" : n(i, t)} FROM ${n(r, t)} WHERE 1=0`).pipe(x.as(!0), x.catchAll(() => x.succeed(!1))), Di = (e, t) => x.gen(function* () {
+	let n = F([Le], t).tables[0];
 	if (!n) return yield* x.die(/* @__PURE__ */ Error("migration applier: the resume-ledger table descriptor produced no snapshot. This is a framework bug."));
 	let r = {
 		kind: "create-table",
-		table: O,
+		table: D,
 		columns: n.columns,
 		indexes: []
 	}, i = yield* e.onDialectOrElse({
-		mysql: () => U(e).pipe(x.map((e) => Nr(r, e))),
-		mssql: () => x.succeed(Wr(r)),
-		sqlite: () => x.succeed(zr(r)),
-		orElse: () => x.succeed(Or(r))
+		mysql: () => H(e).pipe(x.map((e) => Pr(r, e))),
+		mssql: () => x.succeed(Gr(r)),
+		sqlite: () => x.succeed(Br(r)),
+		orElse: () => x.succeed(kr(r))
 	});
 	yield* x.forEach(i, (t) => X(e, t, "resume-ledger-bootstrap"), { discard: !0 });
-}), Ei = (e) => e`
+}), Oi = (e) => e`
     SELECT ${e("runId")}, ${e("planFingerprint")}, ${e("opIndex")},
            ${e("status")}, ${e("payload")}
-    FROM ${e(O)}
-  `, Di = (e, t, n, r) => x.gen(function* () {
-	let i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
+    FROM ${e(D)}
+  `, ki = (e, t, n, r) => x.gen(function* () {
+	let i = yield* U(e, (/* @__PURE__ */ new Date()).toISOString());
 	yield* x.forEach(r, ({ index: r, planned: a }) => e`
-        INSERT INTO ${e(O)}
+        INSERT INTO ${e(D)}
           (${e("id")}, ${e("runId")}, ${e("planFingerprint")}, ${e("opIndex")},
            ${e("opKind")}, ${e("opTarget")}, ${e("status")}, ${e("payload")},
            ${e("createdAt")})
         VALUES
           (${`mop_${t}_${r}`}, ${t}, ${n}, ${r},
-           ${a.op.kind}, ${Re(a.op)}, ${"pending"},
+           ${a.op.kind}, ${ze(a.op)}, ${"pending"},
            ${JSON.stringify(a)}, ${i})
       `, { discard: !0 });
-}), Oi = (e, t, n, r, i) => x.gen(function* () {
-	let a = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
+}), Ai = (e, t, n, r, i) => x.gen(function* () {
+	let a = yield* U(e, (/* @__PURE__ */ new Date()).toISOString());
 	if (r === "applied") {
 		yield* e`
-        UPDATE ${e(O)}
+        UPDATE ${e(D)}
         SET ${e("status")} = ${r}, ${e("appliedAt")} = ${a},
             ${e("durationMs")} = ${i ?? null}
         WHERE ${e("runId")} = ${t} AND ${e("opIndex")} = ${n}
@@ -2579,145 +2608,145 @@ BEGIN
 		return;
 	}
 	yield* e`
-      UPDATE ${e(O)}
+      UPDATE ${e(D)}
       SET ${e("status")} = ${r}, ${e("startedAt")} = ${a}
       WHERE ${e("runId")} = ${t} AND ${e("opIndex")} = ${n}
     `;
-}), ki = (e, t, n, r) => x.gen(function* () {
-	let i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
+}), ji = (e, t, n, r) => x.gen(function* () {
+	let i = yield* U(e, (/* @__PURE__ */ new Date()).toISOString());
 	r.length > 0 && (yield* e`
-        UPDATE ${e(O)}
+        UPDATE ${e(D)}
         SET ${e("status")} = ${"applied"}, ${e("appliedAt")} = ${i}
         WHERE ${e("runId")} = ${t} AND ${e("opIndex")} IN ${e.in(r)}
       `), n.length > 0 && (yield* e`
-        UPDATE ${e(O)}
+        UPDATE ${e(D)}
         SET ${e("status")} = ${"pending"}
         WHERE ${e("runId")} = ${t} AND ${e("opIndex")} IN ${e.in(n)}
       `);
-}), Ai = (e, t) => t === void 0 ? e`DELETE FROM ${e(O)}`.pipe(x.asVoid) : e`DELETE FROM ${e(O)} WHERE ${e("runId")} = ${t}`.pipe(x.asVoid), ji = (e, t, r) => x.gen(function* () {
-	if (Ke(r.op, r.classification, t) !== "artefact-repair") return "clean";
+}), Mi = (e, t) => t === void 0 ? e`DELETE FROM ${e(D)}`.pipe(x.asVoid) : e`DELETE FROM ${e(D)} WHERE ${e("runId")} = ${t}`.pipe(x.asVoid), Ni = (e, t, r) => x.gen(function* () {
+	if (qe(r.op, r.classification, t) !== "artefact-repair") return "clean";
 	let i = r.op, a = (e) => n(e, t);
 	if (t === "sqlite" || t === "turso") {
 		if (!("table" in i)) return "clean";
-		let n = `${i.table}${Ve}`;
+		let n = `${i.table}${He}`;
 		return (yield* $(e, t, n)) ? ((yield* $(e, t, i.table)) ? yield* X(e, `DROP TABLE ${a(n)}`, "resume-repair") : yield* X(e, `ALTER TABLE ${a(n)} RENAME TO ${a(i.table)}`, "resume-repair"), yield* x.logWarning(`migration resume: reconciled an interrupted sqlite table rebuild on '${i.table}' — replaying the operation`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), "outstanding") : "clean";
 	}
 	if (i.kind !== "alter-column-type") return "clean";
-	let o = `${i.column}${He}`, s = `${i.column}${Ue}`, c = yield* $(e, t, i.table, i.column), l = yield* $(e, t, i.table, o), u = yield* $(e, t, i.table, s), d = (e) => x.logWarning(`migration resume: ${e}`).pipe(x.annotateLogs({ scope: "voltro:migrate" }));
+	let o = `${i.column}${Ue}`, s = `${i.column}${We}`, c = yield* $(e, t, i.table, i.column), l = yield* $(e, t, i.table, o), u = yield* $(e, t, i.table, s), d = (e) => x.logWarning(`migration resume: ${e}`).pipe(x.annotateLogs({ scope: "voltro:migrate" }));
 	return !l && !u ? "clean" : c && l && !u ? (yield* X(e, `ALTER TABLE ${a(i.table)} DROP COLUMN ${a(o)}`, "resume-repair"), yield* d(`dropped a half-populated shadow column '${i.table}.${o}' — replaying the type change`), "outstanding") : !c && l && u ? (yield* X(e, `ALTER TABLE ${a(i.table)} RENAME COLUMN ${a(o)} TO ${a(i.column)}`, "resume-repair"), yield* X(e, `ALTER TABLE ${a(i.table)} DROP COLUMN ${a(s)}`, "resume-repair"), yield* d(`completed an interrupted shadow swap on '${i.table}.${i.column}'`), "applied") : c && !l && u ? (yield* X(e, `ALTER TABLE ${a(i.table)} DROP COLUMN ${a(s)}`, "resume-repair"), yield* d(`dropped the leftover pre-swap column '${i.table}.${s}'`), "applied") : yield* x.die(/* @__PURE__ */ Error(`applyPlan: an interrupted online type change on '${i.table}.${i.column}' left a shadow-swap state this resume cannot classify (column=${c}, ${o}=${l}, ${s}=${u}).\nNothing was changed. Inspect those three columns and reconcile them by hand — the data is in whichever of them is populated — then re-run the migration.`));
-}), Mi = (e, t, n, r = "fresh") => x.gen(function* () {
-	let i = process.hrtime.bigint(), a = wi(n.declared), o = t.op;
+}), Pi = (e, t, n, r = "fresh") => x.gen(function* () {
+	let i = process.hrtime.bigint(), a = Ei(n.declared), o = t.op;
 	switch (o.kind) {
 		case "create-table": {
 			let t = yield* e.onDialectOrElse({
-				mysql: () => U(e).pipe(x.map((e) => Nr(o, e))),
-				mssql: () => x.succeed(Wr(o)),
-				sqlite: () => x.succeed(zr(o)),
-				orElse: () => x.succeed(Or(o))
+				mysql: () => H(e).pipe(x.map((e) => Pr(o, e))),
+				mssql: () => x.succeed(Gr(o)),
+				sqlite: () => x.succeed(Br(o)),
+				orElse: () => x.succeed(kr(o))
 			}), n = yield* e.onDialectOrElse({
-				mysql: () => x.succeed([ar]),
+				mysql: () => x.succeed([or]),
 				orElse: () => x.succeed([])
 			});
 			for (let r of t) yield* X(e, r, o.kind, n);
 			break;
 		}
 		case "drop-table": {
-			let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString(), r = (e) => t ? qr(o, n, e) : Kr(o, e);
+			let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString(), r = (e) => t ? Jr(o, n, e) : qr(o, e);
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, r(K), o.kind),
-				orElse: () => X(e, r(G), o.kind)
+				mysql: () => X(e, r(G), o.kind),
+				orElse: () => X(e, r(W), o.kind)
 			});
 			break;
 		}
 		case "drop-column": {
 			let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString();
 			yield* e.onDialectOrElse({
-				mysql: () => U(e).pipe(x.flatMap((r) => X(e, t ? _r(o, n, K) : hr(o, r), o.kind, t ? [] : [or]))),
-				sqlite: () => X(e, t ? _r(o, n, G) : mr(o, G, !1), o.kind, t ? [] : [sr]),
-				orElse: () => X(e, t ? _r(o, n, G) : mr(o, G), o.kind)
+				mysql: () => H(e).pipe(x.flatMap((r) => X(e, t ? yr(o, n, G) : _r(o, r), o.kind, t ? [] : [sr]))),
+				sqlite: () => X(e, t ? yr(o, n, W) : gr(o, W, !1), o.kind, t ? [] : [cr]),
+				orElse: () => X(e, t ? yr(o, n, W) : gr(o, W), o.kind)
 			});
 			break;
 		}
 		case "rename-column":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, gr(o, K), o.kind),
+				mysql: () => X(e, vr(o, G), o.kind),
 				mssql: () => X(e, `EXEC sp_rename N'${o.table.replace(/'/g, "''")}.${o.from.replace(/'/g, "''")}', N'${o.to.replace(/'/g, "''")}', 'COLUMN';`, o.kind),
-				orElse: () => X(e, gr(o, G), o.kind)
+				orElse: () => X(e, vr(o, W), o.kind)
 			});
 			break;
 		case "add-index":
 			yield* e.onDialectOrElse({
-				mysql: () => U(e).pipe(x.flatMap((t) => X(e, Qr(o, n.declared, t), o.kind, [ar]))),
-				mssql: () => Z(e, [...ci(o.table, o.index.columns, n.declared), si(o)], o.kind),
-				orElse: () => X(e, Zr(o, t.classification === "online-required"), o.kind)
+				mysql: () => H(e).pipe(x.flatMap((t) => X(e, $r(o, n.declared, t), o.kind, [or]))),
+				mssql: () => Z(e, [...li(o.table, o.index.columns, n.declared), ci(o)], o.kind),
+				orElse: () => X(e, Qr(o, t.classification === "online-required"), o.kind)
 			});
 			break;
 		case "drop-index":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, ei(o), o.kind),
-				mssql: () => X(e, ti(o), o.kind),
-				orElse: () => X(e, $r(o), o.kind)
+				mysql: () => X(e, ti(o), o.kind),
+				mssql: () => X(e, ni(o), o.kind),
+				orElse: () => X(e, ei(o), o.kind)
 			});
 			break;
 		case "rename-table":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, ni(o, K), o.kind),
-				mssql: () => X(e, ri(o), o.kind),
-				orElse: () => X(e, ni(o, G), o.kind)
+				mysql: () => X(e, ri(o, G), o.kind),
+				mssql: () => X(e, ii(o), o.kind),
+				orElse: () => X(e, ri(o, W), o.kind)
 			});
 			break;
 		case "rename-index":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, ai(o), o.kind),
-				mssql: () => X(e, oi(o), o.kind),
-				orElse: () => X(e, ii(o), o.kind)
+				mysql: () => X(e, oi(o), o.kind),
+				mssql: () => X(e, si(o), o.kind),
+				orElse: () => X(e, ai(o), o.kind)
 			});
 			break;
 		case "add-unique":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, ui(o, n.declared), o.kind),
+				mysql: () => X(e, di(o, n.declared), o.kind),
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				mssql: () => Z(e, [...ci(o.table, [o.column], n.declared), li(o)], o.kind),
-				orElse: () => X(e, li(o), o.kind)
+				mssql: () => Z(e, [...li(o.table, [o.column], n.declared), ui(o)], o.kind),
+				orElse: () => X(e, ui(o), o.kind)
 			});
 			break;
 		case "drop-unique":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, gi(o), o.kind),
+				mysql: () => X(e, _i(o), o.kind),
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				orElse: () => X(e, hi(o), o.kind)
+				orElse: () => X(e, gi(o), o.kind)
 			});
 			break;
 		case "add-unique-composite":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, fi(o, n.declared), o.kind),
+				mysql: () => X(e, pi(o, n.declared), o.kind),
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				mssql: () => Z(e, [...ci(o.table, o.fields, n.declared), di(o)], o.kind),
-				orElse: () => X(e, di(o), o.kind)
+				mssql: () => Z(e, [...li(o.table, o.fields, n.declared), fi(o)], o.kind),
+				orElse: () => X(e, fi(o), o.kind)
 			});
 			break;
 		case "drop-unique-composite":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, mi(o), o.kind),
+				mysql: () => X(e, hi(o), o.kind),
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				orElse: () => X(e, pi(o), o.kind)
+				orElse: () => X(e, mi(o), o.kind)
 			});
 			break;
 		case "add-foreign-key":
 			yield* e.onDialectOrElse({
-				mysql: () => Z(e, _i(o, K), o.kind),
+				mysql: () => Z(e, vi(o, G), o.kind),
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				orElse: () => Z(e, _i(o, G), o.kind)
+				orElse: () => Z(e, vi(o, W), o.kind)
 			});
 			break;
 		case "add-column": {
-			let n = Ci(o, t, a, yield* e.onDialectOrElse({
+			let n = Ti(o, t, a, yield* e.onDialectOrElse({
 				mysql: () => x.succeed("mariadb"),
 				mssql: () => x.succeed("mssql"),
 				sqlite: () => x.succeed("sqlite"),
 				orElse: () => x.succeed("postgres")
 			}));
-			if (!(r === "resume" && (yield* $(e, Ne(e), o.table, o.column.name)))) for (let t of n.pre) yield* X(e, t, o.kind);
+			if (!(r === "resume" && (yield* $(e, Pe(e), o.table, o.column.name)))) for (let t of n.pre) yield* X(e, t, o.kind);
 			if (n.backfillKind === "sql" && n.backfillSql) {
 				if (t.classification !== "online-required" && n.batchSize === void 0) yield* e`UPDATE ${e(o.table)} SET ${e(o.column.name)} = ${n.backfillSql}`;
 				else {
@@ -2757,41 +2786,41 @@ BEGIN
 		case "alter-column-nullability":
 			yield* e.onDialectOrElse({
 				mysql: () => {
-					let t = q(n.declared, o.table, o.column);
-					return t ? X(e, `ALTER TABLE ${K(o.table)} MODIFY COLUMN ${xr(t, o.column, o.toNullable)};`, o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-nullability on mariadb needs the declared column '${o.table}.${o.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
+					let t = K(n.declared, o.table, o.column);
+					return t ? X(e, `ALTER TABLE ${G(o.table)} MODIFY COLUMN ${Cr(t, o.column, o.toNullable)};`, o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-nullability on mariadb needs the declared column '${o.table}.${o.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
 				},
 				mssql: () => {
-					let t = q(n.declared, o.table, o.column);
-					return t ? X(e, Br(t, o.column, o.table, o.toNullable), o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-nullability on mssql needs the declared column '${o.table}.${o.column}'.`));
+					let t = K(n.declared, o.table, o.column);
+					return t ? X(e, Vr(t, o.column, o.table, o.toNullable), o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-nullability on mssql needs the declared column '${o.table}.${o.column}'.`));
 				},
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				orElse: () => X(e, `ALTER TABLE ${G(o.table)} ALTER COLUMN ${G(o.column)} ${o.toNullable ? "DROP NOT NULL" : "SET NOT NULL"};`, o.kind)
+				orElse: () => X(e, `ALTER TABLE ${W(o.table)} ALTER COLUMN ${W(o.column)} ${o.toNullable ? "DROP NOT NULL" : "SET NOT NULL"};`, o.kind)
 			});
 			break;
 		case "alter-column-default": {
-			let t = br(n.declared, o.table, o.column);
+			let t = Sr(n.declared, o.table, o.column);
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, vr(o, K, (e) => Sr(e, t)), o.kind),
-				mssql: () => X(e, Vr(o), o.kind),
+				mysql: () => X(e, br(o, G, (e) => wr(e, t)), o.kind),
+				mssql: () => X(e, Hr(o), o.kind),
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				orElse: () => X(e, vr(o, G, (e) => wr(e, t)), o.kind)
+				orElse: () => X(e, br(o, W, (e) => Er(e, t)), o.kind)
 			});
 			break;
 		}
 		case "alter-column-type": {
-			let r = ur(br(n.declared, o.table, o.column) ?? { type: o.to }), i = o.using ? ` USING ${o.using}` : "";
+			let r = fr(Sr(n.declared, o.table, o.column) ?? { type: o.to }), i = o.using ? ` USING ${o.using}` : "";
 			if (t.classification !== "online-required") {
 				yield* e.onDialectOrElse({
 					mysql: () => {
-						let t = q(n.declared, o.table, o.column);
-						return t ? X(e, `ALTER TABLE ${K(o.table)} MODIFY COLUMN ${xr(t, o.column)};`, o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-type on mariadb needs the declared column '${o.table}.${o.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
+						let t = K(n.declared, o.table, o.column);
+						return t ? X(e, `ALTER TABLE ${G(o.table)} MODIFY COLUMN ${Cr(t, o.column)};`, o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-type on mariadb needs the declared column '${o.table}.${o.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
 					},
 					mssql: () => {
-						let t = q(n.declared, o.table, o.column);
-						return t ? X(e, Br(t, o.column, o.table), o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-type on mssql needs the declared column '${o.table}.${o.column}'.`));
+						let t = K(n.declared, o.table, o.column);
+						return t ? X(e, Vr(t, o.column, o.table), o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-type on mssql needs the declared column '${o.table}.${o.column}'.`));
 					},
 					sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-					orElse: () => X(e, `ALTER TABLE ${G(o.table)} ALTER COLUMN ${G(o.column)} TYPE ${r}${i};`, o.kind)
+					orElse: () => X(e, `ALTER TABLE ${W(o.table)} ALTER COLUMN ${W(o.column)} TYPE ${r}${i};`, o.kind)
 				});
 				break;
 			}
@@ -2800,34 +2829,34 @@ BEGIN
 				orElse: () => x.void
 			});
 			let a = `${o.column}__shadow`, s = `${o.column}__old`;
-			yield* e.unsafe(`ALTER TABLE ${G(o.table)} ADD COLUMN ${G(a)} ${r}`);
-			let c = o.using ?? G(o.column), l;
+			yield* e.unsafe(`ALTER TABLE ${W(o.table)} ADD COLUMN ${W(a)} ${r}`);
+			let c = o.using ?? W(o.column), l;
 			for (;;) {
 				let t = l === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(a)} IS NULL ORDER BY ${e("id")} ${Q(e, 5e3)}` : yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(a)} IS NULL AND ${e("id")} > ${l} ORDER BY ${e("id")} ${Q(e, 5e3)}`;
 				if (t.length === 0) break;
-				yield* e.unsafe(`UPDATE ${G(o.table)} SET ${G(a)} = ${c} WHERE ${G(o.column)} IS NOT NULL AND ${G(a)} IS NULL AND ${G("id")} IN (${t.map((e) => `'${e.id.replace(/'/g, "''")}'`).join(",")})`), l = t[t.length - 1].id;
+				yield* e.unsafe(`UPDATE ${W(o.table)} SET ${W(a)} = ${c} WHERE ${W(o.column)} IS NOT NULL AND ${W(a)} IS NULL AND ${W("id")} IN (${t.map((e) => `'${e.id.replace(/'/g, "''")}'`).join(",")})`), l = t[t.length - 1].id;
 			}
-			yield* x.logInfo(`alter-column-type shadow ${o.table}.${o.column}: shadow populated`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), yield* e.unsafe(`ALTER TABLE ${G(o.table)} RENAME COLUMN ${G(o.column)} TO ${G(s)}`), yield* e.unsafe(`ALTER TABLE ${G(o.table)} RENAME COLUMN ${G(a)} TO ${G(o.column)}`), yield* e.unsafe(`ALTER TABLE ${G(o.table)} DROP COLUMN ${G(s)}`);
+			yield* x.logInfo(`alter-column-type shadow ${o.table}.${o.column}: shadow populated`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), yield* e.unsafe(`ALTER TABLE ${W(o.table)} RENAME COLUMN ${W(o.column)} TO ${W(s)}`), yield* e.unsafe(`ALTER TABLE ${W(o.table)} RENAME COLUMN ${W(a)} TO ${W(o.column)}`), yield* e.unsafe(`ALTER TABLE ${W(o.table)} DROP COLUMN ${W(s)}`);
 			break;
 		}
 		case "drop-foreign-key":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, yi(o), o.kind),
+				mysql: () => X(e, bi(o), o.kind),
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				orElse: () => X(e, vi(o), o.kind)
+				orElse: () => X(e, yi(o), o.kind)
 			});
 			break;
 		case "add-check":
 			yield* e.onDialectOrElse({
-				mysql: () => X(e, bi(o, K), o.kind),
+				mysql: () => X(e, xi(o, G), o.kind),
 				sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-				orElse: () => X(e, bi(o, G), o.kind)
+				orElse: () => X(e, xi(o, W), o.kind)
 			});
 			break;
 		case "drop-check": yield* e.onDialectOrElse({
-			mysql: () => X(e, Si(o), o.kind),
+			mysql: () => wi(e, o, n.declared),
 			sqlite: () => Z(e, J(o.table, n.declared), o.kind),
-			orElse: () => X(e, xi(o), o.kind)
+			orElse: () => X(e, Si(o), o.kind)
 		});
 	}
 	return {
@@ -2835,32 +2864,32 @@ BEGIN
 		status: "applied",
 		durationMs: Number((process.hrtime.bigint() - i) / 1000000n)
 	};
-}), Ni = (e, t, n, r) => x.gen(function* () {
+}), Fi = (e, t, n, r) => x.gen(function* () {
 	let i = [...new Set(r.map((e) => e.runId))];
-	if (i.length > 1) return yield* x.die(/* @__PURE__ */ Error(`applyPlan: the resume ledger holds ${i.length} unfinished runs (${i.join(", ")}). Only one migration may be in flight at a time — the advisory lock enforces it — so this means a run was interrupted and a LATER one wrote over it without clearing.\nNothing was changed. Inspect \`${O}\`, reconcile the schema by hand, and delete the rows of the run you have finished.`));
+	if (i.length > 1) return yield* x.die(/* @__PURE__ */ Error(`applyPlan: the resume ledger holds ${i.length} unfinished runs (${i.join(", ")}). Only one migration may be in flight at a time — the advisory lock enforces it — so this means a run was interrupted and a LATER one wrote over it without clearing.\nNothing was changed. Inspect \`${D}\`, reconcile the schema by hand, and delete the rows of the run you have finished.`));
 	let a = i[0], o = [...r].map((e) => ({
 		index: Number(e.opIndex),
 		status: e.status,
 		planned: JSON.parse(e.payload)
 	})).sort((e, t) => e.index - t.index), s = o.find((e) => e.status === "started"), c = o.filter((e) => e.status === "started").length;
-	if (c > 1) return yield* x.die(/* @__PURE__ */ Error(`applyPlan: the resume ledger records ${c} operations as in-flight for run ${a}. It is written strictly sequentially, so at most one can be — this ledger is corrupt and the schema state it describes cannot be trusted.\nNothing was changed. Reconcile \`${O}\` by hand before re-running.`));
-	if (yield* x.logWarning(`migration resume: found an interrupted run (${a}) — ${o.filter((e) => e.status === "applied").length} of ${o.length} operation(s) completed${s ? `, in flight: ${s.planned.op.kind} ${Re(s.planned.op)}` : ""}`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), o.every((e) => e.status === "pending")) return {
+	if (c > 1) return yield* x.die(/* @__PURE__ */ Error(`applyPlan: the resume ledger records ${c} operations as in-flight for run ${a}. It is written strictly sequentially, so at most one can be — this ledger is corrupt and the schema state it describes cannot be trusted.\nNothing was changed. Reconcile \`${D}\` by hand before re-running.`));
+	if (yield* x.logWarning(`migration resume: found an interrupted run (${a}) — ${o.filter((e) => e.status === "applied").length} of ${o.length} operation(s) completed${s ? `, in flight: ${s.planned.op.kind} ${ze(s.planned.op)}` : ""}`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), o.every((e) => e.status === "pending")) return {
 		kind: "discard",
 		runId: a,
 		why: "no operation had started — no DDL ran"
 	};
-	let l = s ? yield* ji(e, t, s.planned) : "clean", u = r[0].planFingerprint;
+	let l = s ? yield* Ni(e, t, s.planned) : "clean", u = r[0].planFingerprint;
 	if (u !== n.toFingerprint) return {
 		kind: "discard",
 		runId: a,
 		why: `the declared schema changed since the interruption (recorded target ${u.slice(0, 12)}…, current ${n.toFingerprint.slice(0, 12)}…) — applying the freshly-diffed plan instead`
 	};
-	let d = (e) => e.status === "applied" ? !1 : s && e.index === s.index && l !== "clean" ? l === "outstanding" : Be(n, e.planned.op), f = o.filter(d), p = o.filter((e) => e.status !== "applied" && !d(e));
+	let d = (e) => e.status === "applied" ? !1 : s && e.index === s.index && l !== "clean" ? l === "outstanding" : Ve(n, e.planned.op), f = o.filter(d), p = o.filter((e) => e.status !== "applied" && !d(e));
 	return f.length === 0 ? {
 		kind: "discard",
 		runId: a,
 		why: "every recorded operation had already taken effect"
-	} : (yield* ki(e, a, f.map((e) => e.index), p.map((e) => e.index)), yield* x.logWarning(`migration resume: continuing run ${a} — replaying ${f.length} operation(s), ${o.length - f.length} already applied`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), {
+	} : (yield* ji(e, a, f.map((e) => e.index), p.map((e) => e.index)), yield* x.logWarning(`migration resume: continuing run ${a} — replaying ${f.length} operation(s), ${o.length - f.length} already applied`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), {
 		kind: "resume",
 		runId: a,
 		ops: f.map((e) => ({
@@ -2868,39 +2897,39 @@ BEGIN
 			planned: e.planned
 		}))
 	});
-}), Pi = (e, t, n) => x.gen(function* () {
+}), Ii = (e, t, n) => x.gen(function* () {
 	let r = t.operations.filter((e) => e.blocked);
 	if (r.length > 0) return yield* x.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — ${r.length} blocked operations. Run \`voltro db plan\` to see the fixes.`));
-	yield* E(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") : [], u = s ? t.operations.filter((e) => e.classification === "online-required") : t.operations, d = `plan_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 8)}`, f = u.map((e, t) => ({
+	yield* T(e, { schema: n.lockSchema });
+	let i = Date.now(), a = [], o = Pe(e), s = Ie(o) === "plan-transactional", c = s ? t.operations.filter((e) => e.classification !== "online-required") : [], u = s ? t.operations.filter((e) => e.classification === "online-required") : t.operations, d = `plan_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 8)}`, f = u.map((e, t) => ({
 		index: t,
 		planned: e
 	})), p = "fresh";
 	try {
-		yield* Ti(e, o);
-		let r = yield* Ei(e);
+		yield* Di(e, o);
+		let r = yield* Oi(e);
 		if (r.length > 0) {
-			let n = yield* Ni(e, o, t, r);
-			n.kind === "resume" ? (d = n.runId, f = n.ops, p = "resume") : (yield* x.logWarning(`migration resume: discarding the ledger of run ${n.runId} — ${n.why}`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), yield* Ai(e, n.runId));
+			let n = yield* Fi(e, o, t, r);
+			n.kind === "resume" ? (d = n.runId, f = n.ops, p = "resume") : (yield* x.logWarning(`migration resume: discarding the ledger of run ${n.runId} — ${n.why}`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), yield* Mi(e, n.runId));
 		}
-		p === "fresh" && f.length > 0 && (yield* Di(e, d, t.toFingerprint, f)), c.length > 0 && (yield* e.withTransaction(x.gen(function* () {
+		p === "fresh" && f.length > 0 && (yield* ki(e, d, t.toFingerprint, f)), c.length > 0 && (yield* e.withTransaction(x.gen(function* () {
 			let e = yield* C.SqlClient;
-			for (let t of c) a.push(yield* Mi(e, t, n));
+			for (let t of c) a.push(yield* Pi(e, t, n));
 		})));
 		for (let { index: t, planned: r } of f) {
-			yield* Oi(e, d, t, "started");
-			let i = yield* Mi(e, r, n, p);
-			a.push(i), yield* Oi(e, d, t, "applied", i.durationMs);
+			yield* Ai(e, d, t, "started");
+			let i = a.length, o = yield* Pi(e, r, n, p).pipe(x.mapError((e) => Object.assign(e, { message: `${String(e?.message ?? e)}\n\n  progress: ${i} of ${f.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* Ai(e, d, t, "applied", o.durationMs);
 		}
 	} finally {
-		yield* D(e, { schema: n.lockSchema }).pipe(x.orDie);
+		yield* E(e, { schema: n.lockSchema }).pipe(x.orDie);
 	}
 	let m = yield* n.replan(e);
 	if (m.operations.length > 0) {
 		let e = m.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* x.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 ${m.operations.length}:\n${e}${m.operations.length > 10 ? `\n  … and ${m.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 h = a.filter((e) => e.status === "applied").length, g = Date.now() - i, _ = d, v = (/* @__PURE__ */ new Date()).toISOString(), y = yield* W(e, v), b = [...c, ...f.map((e) => e.planned)];
+	let h = a.filter((e) => e.status === "applied").length, g = Date.now() - i, _ = d, v = (/* @__PURE__ */ new Date()).toISOString(), y = yield* U(e, v), b = [...c, ...f.map((e) => e.planned)];
 	yield* e`
       INSERT INTO ${e("_voltro_migration_plans")}
         (${e("id")}, ${e("fingerprint")}, ${e("liveFingerprint")}, ${e("operations")},
@@ -2910,7 +2939,7 @@ BEGIN
         (${_}, ${t.toFingerprint}, ${m.fromFingerprint}, ${JSON.stringify(b)},
          ${n.appliedBy}, ${n.environment}, ${n.source},
          ${g}, ${y}, ${n.notes ?? null})
-    `, yield* Ai(e, d);
+    `, yield* Mi(e, d);
 	let S = [...new Set(b.flatMap((e) => e.op.kind === "rename-table" ? [e.op.to] : [e.op.table]))];
 	return yield* x.promise(() => l({ changedTables: S }).catch(() => {})), {
 		id: _,
@@ -2924,14 +2953,14 @@ BEGIN
 		source: n.source,
 		...n.notes ? { notes: n.notes } : {}
 	};
-}), Fi = (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"), Ii = (e) => e`
+}), Li = (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"), Ri = (e) => e`
     SELECT fingerprint
     FROM _voltro_migration_plans
     ORDER BY ${e("appliedAt")} DESC
     LIMIT 1
-  `.pipe(x.map((e) => e.length > 0 ? e[0].fingerprint : void 0), x.catchAll(() => x.succeed(void 0))), Li = (e, t, n) => x.gen(function* () {
-	if ((yield* Ii(e)) === t.toFingerprint) return "already-current";
-	let r = `plan_${Date.now().toString(36)}`, i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
+  `.pipe(x.map((e) => e.length > 0 ? e[0].fingerprint : void 0), x.catchAll(() => x.succeed(void 0))), zi = (e, t, n) => x.gen(function* () {
+	if ((yield* Ri(e)) === t.toFingerprint) return "already-current";
+	let r = `plan_${Date.now().toString(36)}`, i = yield* U(e, (/* @__PURE__ */ new Date()).toISOString());
 	return yield* e`
       INSERT INTO ${e("_voltro_migration_plans")}
         (${e("id")}, ${e("fingerprint")}, ${e("liveFingerprint")}, ${e("operations")},
@@ -2942,8 +2971,8 @@ BEGIN
          ${n.appliedBy}, ${n.environment}, ${n.source},
          ${0}, ${i}, ${"no DDL — the declared schema already matched the database"})
     `, "recorded";
-}).pipe(x.catchAll(() => x.succeed("already-current"))), Ri = (e, t) => x.gen(function* () {
-	let n = Wt(I(t, Ne(e))), r = yield* Ii(e);
+}).pipe(x.catchAll(() => x.succeed("already-current"))), Bi = (e, t) => x.gen(function* () {
+	let n = P(F(t, Pe(e))), r = yield* Ri(e);
 	return r === n ? {
 		kind: "up-to-date",
 		fingerprint: n
@@ -2952,23 +2981,23 @@ BEGIN
 		expected: n,
 		...r === void 0 ? {} : { actual: r }
 	};
-}), zi = [
+}), Vi = [
 	"pgeagertest_",
 	"mig_e2e_",
 	"mig_test_",
 	"mysqleagertest_",
 	"mssqleagertest_",
 	"sqliteeagertest_"
-], Bi = (e) => zi.some((t) => e.startsWith(t)), Vi = (e, t) => x.gen(function* () {
+], Hi = (e) => Vi.some((t) => e.startsWith(t)), Ui = (e, t) => x.gen(function* () {
 	if (process.env.VOLTRO_TEST_FIXTURE_GC === "off") return [];
-	let n = t.filter((e) => Bi(e.name)).map((e) => e.name);
+	let n = t.filter((e) => Hi(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(x.catchAll(() => x.void));
 	return n;
-}), Hi = () => {
+}), Wi = () => {
 	let e = (process.env.VOLTRO_DB_IGNORE_TABLES ?? "").split(",").map((e) => e.trim()).filter((e) => e.length > 0);
 	return e.length > 0 ? { ignoreTables: e } : {};
-}, Ui = (e) => {
+}, Gi = (e) => {
 	if (e === void 0) return;
 	let t = e.trim();
 	if (t === "") return;
@@ -2978,48 +3007,48 @@ BEGIN
 		kind: "tables",
 		tables: new Set(n)
 	} : void 0;
-}, Wi = (e) => typeof e.table == "string" ? e.table : void 0, Gi = (e, t = { kind: "all" }) => ({
+}, Ki = (e) => typeof e.table == "string" ? e.table : void 0, qi = (e, t = { kind: "all" }) => ({
 	...e,
 	operations: e.operations.map((e) => {
 		if (!e.blocked || e.classification !== "lossy") return e;
 		if (t?.kind === "tables") {
-			let n = Wi(e.op);
+			let n = Ki(e.op);
 			if (n === void 0 || !t.tables.has(n)) return e;
 		}
 		let { blocked: n, ...r } = e;
 		return r;
 	})
-}), Ki = (e, t, n) => t === "postgres" ? Yt(e, n).pipe(x.flatMap((e) => {
-	let t = Xt(e);
+}), Ji = (e, t, n) => t === "postgres" ? Xt(e, n).pipe(x.flatMap((e) => {
+	let t = Zt(e);
 	return t === void 0 ? x.void : x.logWarning(`auto-migrate: ${t}`).pipe(x.annotateLogs({ scope: "voltro:migrate" }));
-}), x.catchAll(() => x.void)) : x.void, qi = (e, t, n) => x.gen(function* () {
-	let r = Ne(e), i = t;
+}), x.catchAll(() => x.void)) : x.void, Yi = (e, t, n) => x.gen(function* () {
+	let r = Pe(e), i = t;
 	if (process.env.VOLTRO_MIGRATE_FORCE !== "1") {
-		let t = Wt(I(i, r));
-		if ((yield* Ii(e)) === t) return yield* Ki(e, r, i), {
+		let t = P(F(i, r));
+		if ((yield* Ri(e)) === t) return yield* Ji(e, r, i), {
 			kind: "up-to-date",
 			fingerprint: t
 		};
 	}
-	let a = yield* Qn(e), o = yield* Vi(e, a.tables);
+	let a = yield* $n(e), o = yield* Ui(e, a.tables);
 	o.length > 0 && (yield* x.logInfo(`auto-migrate: reaped ${o.length} test-fixture leftover(s)`).pipe(x.annotateLogs({
 		scope: "voltro:migrate",
 		count: o.length
-	})), a = yield* Qn(e));
-	let s = new Set(t.map((e) => e.tableName)), c = (e) => e.filter((e) => !m(e.name) || s.has(e.name)), l = Mn({
+	})), a = yield* $n(e));
+	let s = new Set(t.map((e) => e.tableName)), c = (e) => e.filter((e) => !m(e.name) || s.has(e.name)), l = Nn({
 		declared: i,
 		live: { tables: c(a.tables) },
 		dialect: r,
-		...Hi()
+		...Wi()
 	});
 	if (l.summary.blocked > 0) {
-		let e = l.operations.filter((e) => e.blocked).every((e) => e.classification === "lossy"), t = Ui(process.env.VOLTRO_DESTRUCTIVE_OK);
-		if (t === void 0 || !e || (l = Gi(l, t), l.operations.some((e) => e.blocked))) return {
+		let e = l.operations.filter((e) => e.blocked).every((e) => e.classification === "lossy"), t = Gi(process.env.VOLTRO_DESTRUCTIVE_OK);
+		if (t === void 0 || !e || (l = qi(l, t), l.operations.some((e) => e.blocked))) return {
 			kind: "refused-blocked",
 			plan: l
 		};
 	}
-	return l.operations.length === 0 ? (yield* Li(e, l, {
+	return l.operations.length === 0 ? (yield* zi(e, l, {
 		appliedBy: n.appliedBy,
 		environment: n.environment === "prod" ? "dev" : n.environment,
 		source: "auto-diff"
@@ -3028,37 +3057,37 @@ BEGIN
 		fingerprint: l.toFingerprint
 	}) : {
 		kind: "applied",
-		applied: yield* Pi(e, l, {
+		applied: yield* Ii(e, l, {
 			declared: t,
 			appliedBy: n.appliedBy,
 			environment: n.environment === "prod" ? "dev" : n.environment,
 			source: "auto-diff",
 			replan: (e) => x.gen(function* () {
-				let t = yield* Qn(e);
-				return Mn({
+				let t = yield* $n(e);
+				return Nn({
 					declared: i,
 					live: { tables: c(t.tables) },
 					dialect: r,
-					...Hi()
+					...Wi()
 				});
 			})
 		}),
 		plan: l
 	};
-}), Ji = (e, t, n) => process.env.VOLTRO_AUTO_MIGRATE === "0" ? x.succeed({
+}), Xi = (e, t, n) => process.env.VOLTRO_AUTO_MIGRATE === "0" ? x.succeed({
 	kind: "skipped",
 	reason: "VOLTRO_AUTO_MIGRATE=0"
-}) : n.environment === "prod" ? Ri(e, t) : qi(e, t, n), Yi = (e, t) => {
+}) : n.environment === "prod" ? Bi(e, t) : Yi(e, t, n), Zi = (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=${F(e.fingerprint)})`;
+		case "up-to-date": return `auto-migrate: schema up to date (${t}, fingerprint=${Gt(e.fingerprint)})`;
 		case "applied": {
 			let t = e.plan.summary;
-			return `auto-migrate: applied ${e.applied.appliedOps} op(s) in ${e.applied.durationMs}ms [safe=${t.safe} needs-default=${t.needsDefault} needs-backfill=${t.needsBackfill} rename=${t.needsRenameAnnotation} lossy=${t.lossy}] fingerprint=${F(e.applied.fingerprint)}`;
+			return `auto-migrate: applied ${e.applied.appliedOps} op(s) in ${e.applied.durationMs}ms [safe=${t.safe} needs-default=${t.needsDefault} needs-backfill=${t.needsBackfill} rename=${t.needsRenameAnnotation} lossy=${t.lossy}] fingerprint=${Gt(e.applied.fingerprint)}`;
 		}
-		case "prod-mismatch": return `auto-migrate: SCHEMA FINGERPRINT MISMATCH — declared=${F(e.expected)}` + (e.actual ? ` live=${F(e.actual)}` : " live=<no _voltro_migration_plans row>") + ". Run `voltro db apply --plan plan.json` from the deploy pipeline before serving.";
+		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` + Fi(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` + Li(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) {
@@ -3075,7 +3104,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");
 		}
 	}
-}, Xi = /* @__PURE__ */ new Set([
+}, Qi = /* @__PURE__ */ new Set([
 	"node_modules",
 	"dist",
 	"build",
@@ -3084,11 +3113,11 @@ BEGIN
 	".next",
 	".git",
 	".framework"
-]), Zi = async (e) => {
+]), $i = async (e) => {
 	let t = [], n = async (e) => {
 		let r = await ne.readdir(e, { withFileTypes: !0 }).catch(() => []);
 		for (let i of r) {
-			if (Xi.has(i.name)) continue;
+			if (Qi.has(i.name)) continue;
 			let r = re(e, i.name);
 			i.isDirectory() ? await n(r) : i.isFile() && d.test(i.name) && t.push(r);
 		}
@@ -3097,7 +3126,7 @@ BEGIN
 		let n = e.split("/").pop() ?? e, r = t.split("/").pop() ?? t;
 		return n.localeCompare(r);
 	});
-}, Qi = async (e) => {
+}, ea = async (e) => {
 	let t = [];
 	for (let n of e) {
 		let e = (await import(ie(n).href)).default;
@@ -3111,11 +3140,11 @@ BEGIN
 		});
 	}
 	return t;
-}, $i = (e) => e`
+}, ta = (e) => e`
     SELECT ${e("id")}
     FROM ${e("_voltro_migration_plans")}
     WHERE ${e("source")} = 'file'
-  `.pipe(x.map((e) => e.map((e) => e.id)), x.catchAll(() => x.succeed([]))), ea = class extends Error {
+  `.pipe(x.map((e) => e.map((e) => e.id)), x.catchAll(() => x.succeed([]))), na = class extends Error {
 	migrationId;
 	file;
 	cause;
@@ -3123,7 +3152,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";
 	}
-}, ta = (e, t, n, r) => x.gen(function* () {
+}, ra = (e, t, n, r) => x.gen(function* () {
 	let i = Date.now(), a = (/* @__PURE__ */ new Date()).toISOString(), o = {
 		sql: e,
 		log: {
@@ -3144,7 +3173,7 @@ BEGIN
 	});
 	let c = Date.now() - i;
 	!x.isEffect(s) && c < 2 && (yield* x.logWarning(`migration ${t.migration.id}: up() resolved in ${c}ms — did the body \`await\` an \`@effect/sql\` Effect by accident? \`sql.unsafe(...)\` returns an Effect, not a Promise; \`await\` on it is a silent no-op. Switch the body to \`Effect.gen(function* () { yield* sql.unsafe(...) })\` form.`).pipe(x.annotateLogs({ scope: `migrations:file:${t.migration.id}` })));
-	let l = yield* W(e, a);
+	let l = yield* U(e, a);
 	return yield* e`
       INSERT INTO ${e("_voltro_migration_plans")}
         (${e("id")}, ${e("fingerprint")}, ${e("operations")},
@@ -3157,10 +3186,10 @@ BEGIN
 	}])},
          ${r}, ${n}, ${"file"},
          ${c}, ${l}, ${t.migration.description})
-    `.pipe(x.mapError((e) => new ea(t.migration.id, t.file, e))), { durationMs: c };
-}), na = (e, t) => x.gen(function* () {
+    `.pipe(x.mapError((e) => new na(t.migration.id, t.file, e))), { durationMs: c };
+}), ia = (e, t) => x.gen(function* () {
 	let n = yield* x.tryPromise({
-		try: () => Zi(re(t, "migrations")),
+		try: () => $i(re(t, "migrations")),
 		catch: (e) => e
 	});
 	if (n.length === 0) return {
@@ -3168,25 +3197,25 @@ BEGIN
 		skipped: []
 	};
 	let r = yield* x.tryPromise({
-		try: () => Qi(n),
+		try: () => ea(n),
 		catch: (e) => e
 	});
 	if (r.length === 0) return {
 		pending: [],
 		skipped: []
 	};
-	let i = new Set(yield* $i(e));
+	let i = new Set(yield* ta(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)
 	};
-}), ra = (e, t) => na(e, t).pipe(x.map((e) => e.pending.map((e) => e.migration.id))), ia = (e, t) => x.gen(function* () {
-	let { pending: n, skipped: r } = yield* na(e, t.projectRoot);
+}), aa = (e, t) => ia(e, t).pipe(x.map((e) => e.pending.map((e) => e.migration.id))), oa = (e, t) => x.gen(function* () {
+	let { pending: n, skipped: r } = yield* ia(e, t.projectRoot);
 	if (n.length === 0) return {
 		applied: [],
 		skipped: r
 	};
-	yield* E(e, { schema: t.lockSchema });
+	yield* T(e, { schema: t.lockSchema });
 	let i = [];
 	try {
 		for (let r of n) {
@@ -3195,7 +3224,7 @@ BEGIN
 				id: r.migration.id,
 				file: r.file
 			}));
-			let { durationMs: n } = yield* ta(e, r, t.env, t.appliedBy);
+			let { durationMs: n } = yield* ra(e, r, t.env, t.appliedBy);
 			i.push({
 				id: r.migration.id,
 				durationMs: n
@@ -3206,28 +3235,28 @@ BEGIN
 			}));
 		}
 	} finally {
-		yield* D(e, { schema: t.lockSchema }).pipe(x.orDie);
+		yield* E(e, { schema: t.lockSchema }).pipe(x.orDie);
 	}
 	return {
 		applied: i,
 		skipped: r
 	};
-}), aa = (e, t) => e`
+}), sa = (e, t) => e`
     SELECT ${e("id")}
     FROM ${e("_voltro_migration_plans")}
     WHERE ${e("id")} = ${t} AND ${e("source")} = 'file'
     LIMIT 1
-  `, oa = (e, t) => x.gen(function* () {
-	if (!(yield* aa(e, t.id))[0]) return yield* x.fail(/* @__PURE__ */ Error(`rollback: ${t.id} not found in _voltro_migration_plans (file source)`));
+  `, ca = (e, t) => x.gen(function* () {
+	if (!(yield* sa(e, t.id))[0]) return yield* x.fail(/* @__PURE__ */ Error(`rollback: ${t.id} not found in _voltro_migration_plans (file source)`));
 	let n = yield* x.tryPromise({
-		try: () => Zi(re(t.projectRoot, "migrations")),
+		try: () => $i(re(t.projectRoot, "migrations")),
 		catch: (e) => e
 	}), r = (yield* x.tryPromise({
-		try: () => Qi(n),
+		try: () => ea(n),
 		catch: (e) => e
 	})).find((e) => e.migration.id === t.id);
 	if (!r) return yield* x.fail(/* @__PURE__ */ Error(`rollback: file for migration ${t.id} not found on disk under ${t.projectRoot}/migrations/`));
-	yield* E(e, { schema: t.lockSchema });
+	yield* T(e, { schema: t.lockSchema });
 	let i = Date.now();
 	try {
 		let n = {
@@ -3254,9 +3283,9 @@ BEGIN
 			durationMs: o
 		};
 	} finally {
-		yield* D(e, { schema: t.lockSchema }).pipe(x.orDie);
+		yield* E(e, { schema: t.lockSchema }).pipe(x.orDie);
 	}
-}), sa = (e) => x.gen(function* () {
+}), la = (e) => x.gen(function* () {
 	let t = yield* C.SqlClient, n = yield* t`
       SELECT id, fingerprint, appliedAt FROM _voltro_migration_plans
       WHERE source = 'auto-diff'
@@ -3301,7 +3330,7 @@ BEGIN
 		snapshotFingerprint: e.fingerprint,
 		snapshotId: i
 	};
-}), ca = { safe: !0 }, la = (e) => {
+}), ua = { safe: !0 }, da = (e) => {
 	switch (e.kind) {
 		case "drop-column": return {
 			safe: !1,
@@ -3328,7 +3357,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 ? ca : {
+		case "alter-column-nullability": return e.toNullable ? ua : {
 			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)`
@@ -3358,12 +3387,12 @@ BEGIN
 		case "drop-unique":
 		case "drop-unique-composite":
 		case "drop-foreign-key":
-		case "drop-check": return ca;
+		case "drop-check": return ua;
 	}
-}, ua = (e) => {
+}, fa = (e) => {
 	let t = [];
 	for (let n of e) {
-		let e = la(n.op);
+		let e = da(n.op);
 		e.safe || t.push({
 			op: n,
 			reason: e.reason,
@@ -3371,7 +3400,7 @@ BEGIN
 		});
 	}
 	return t;
-}, da = (e) => {
+}, pa = (e) => {
 	if (!e.enabled || e.unsafeCount === 0) return {
 		refuse: !1,
 		warnForced: !1,
@@ -3387,18 +3416,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.`
 	};
-}, fa = (e) => {
+}, ma = (e) => {
 	let t = e.table;
 	if (typeof t == "string") return t;
 	let n = e.from;
 	return typeof n == "string" ? n : void 0;
-}, pa = (e) => ({
+}, ha = (e) => ({
 	kind: e.op.kind,
-	table: fa(e.op),
+	table: ma(e.op),
 	classification: e.classification,
 	reason: e.reason,
 	blockedFix: e.blocked?.fix
-}), ma = (e) => e.operations.map(pa), ha = async (e) => {
+}), ga = (e) => e.operations.map(ha), _a = async (e) => {
 	let t = e.log ?? (() => {}), n = {
 		branchId: e.branchId,
 		mechanism: e.mechanism,
@@ -3417,10 +3446,10 @@ BEGIN
 			applied: !1,
 			converged: !1,
 			residual: r,
-			infidelity: ma(o)
+			infidelity: ga(o)
 		};
 		else {
-			let i = await e.plan(), o = ma(i), s = o.filter((e) => e.classification === "lossy"), c = Gi(i), l = c.operations.filter((e) => e.blocked !== void 0).map(pa);
+			let i = await e.plan(), o = ga(i), s = o.filter((e) => e.classification === "lossy"), c = qi(i), l = c.operations.filter((e) => e.blocked !== void 0).map(ha);
 			if (l.length > 0) a = {
 				...n,
 				outcome: "blocked",
@@ -3445,7 +3474,7 @@ BEGIN
 			};
 			else {
 				await e.apply(c), t(`branch ${e.branchId}: applied ${o.length} operation(s)`);
-				let i = ma(await e.replan());
+				let i = ga(await e.replan());
 				a = {
 					...n,
 					outcome: i.length > 0 ? "diverged" : s.length > 0 ? "lossy" : "clean",
@@ -3483,7 +3512,7 @@ BEGIN
 		...a,
 		tornDown: o
 	};
-}, ga = (e) => {
+}, va = (e) => {
 	switch (e.outcome) {
 		case "clean": return 0;
 		case "lossy": return 2;
@@ -3492,22 +3521,22 @@ BEGIN
 		case "infidelity": return 1;
 		case "failed": return 1;
 	}
-}, _a = (e) => `    ${e.classification === "lossy" ? "✗" : "•"} ${e.kind}${e.table ? ` ${e.table}` : ""} [${e.classification}]${e.reason ? ` — ${e.reason}` : ""}${e.blockedFix ? `\n        ! ${e.blockedFix}` : ""}`, va = (e) => {
+}, ya = (e) => `    ${e.classification === "lossy" ? "✗" : "•"} ${e.kind}${e.table ? ` ${e.table}` : ""} [${e.classification}]${e.reason ? ` — ${e.reason}` : ""}${e.blockedFix ? `\n        ! ${e.blockedFix}` : ""}`, ba = (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(_a(n));
+		for (let n of e.infidelity) t.push(ya(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(_a(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(_a(n));
+		for (let n of e.operations) t.push(ya(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(ya(n));
 	}
 	return t.push(e.tornDown ? `  branch ${e.branchId} torn down.` : `  branch ${e.branchId} KEPT — drop it when you are done.`), t.join("\n");
-}, ya = (e, ...t) => ({
+}, xa = (e, ...t) => ({
 	_tag: "RawSqlFragment",
 	strings: [...e],
 	values: [...t]
-}), ba = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
+}), Sa = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
 //#endregion
-export { k as DEFAULT_CDC_CHANNEL, d as FILE_MIGRATION_PATTERN, ea as FileMigrationLedgerError, qe as REACTIVE_TRIGGER_PREFIX, pe as VOLTRO_MIGRATION_LOCK_KEY, E as acquireMigrationLock, W as appliedAtValue, It as applyNamespacedSchema, Pi as applyPlan, Et as applySchema, da as assessRollingDeployGate, ga as branchRehearsalExitCode, Bn as chunkTables, la as classifyRollingDeploySafety, I as declaredSnapshot, $e as defaultArrayClause, Qe as defaultClause, M as defaultJsonClause, Yi as describeOutcome, Ui as destructiveScope, Yt as detectReactiveTriggerDrift, Qr as emitAddIndexMysql, Nr as emitCreateTableMysql, mr as emitDropColumnDdl, hr as emitDropColumnDdlMysql, Tt as emitFrameworkBootstrapSql, Ct as emitNamespaceProvisionDdl, wt as emitNamespacedSchemaSql, St as emitSchemaSql, $n as engineFromVersion, Wt as fingerprintSchema, ye as fnv1a64, va as formatBranchRehearsal, Xt as formatReactiveTriggerDrift, Hi as ignoreTablesFromEnv, Qn as introspectSchema, ir as isAlreadySatisfied, c as isFileMigration, ba as isRawSqlFragment, Ot as isReRunSafeDdl, Pn as mapPgType, g as migration, be as migrationLockKeyForSchema, T as migrationLockNameForSchema, Jr as mysqlIndexPrefixFor, Ye as notifyFunctionName, N as numericIdSql, Nn as parseEnumCheck, ra as pendingFileMigrationIds, Mn as planMigrations, Lt as provisionTenantNamespace, Je as reactiveTriggerName, pt as reactiveTriggerRepairSql, Li as recordUpToDate, ha as rehearseMigrationOnBranch, pa as rehearsedOperation, D as releaseMigrationLock, jr as renderColumnMysql, Er as renderColumnPg, he as resolveMigrationLockSchema, U as resolveMysqlEngine, oa as rollbackFileBasedMigration, ua as rollingDeployUnsafeOps, ia as runFileBasedMigrations, Rt as runFrameworkBootstrap, Ft as runMigrate, Ji as runPlannedMigrations, F as shortFingerprint, Gt as snapshotColumn, ya as sql, j as sqlType, sa as squashMigrationPlans, Gi as unblockLossy, Me as withMigrationLock };
+export { O as DEFAULT_CDC_CHANNEL, d as FILE_MIGRATION_PATTERN, na as FileMigrationLedgerError, Je as REACTIVE_TRIGGER_PREFIX, pe as VOLTRO_MIGRATION_LOCK_KEY, T as acquireMigrationLock, U as appliedAtValue, Lt as applyNamespacedSchema, Ii as applyPlan, Dt as applySchema, pa as assessRollingDeployGate, va as branchRehearsalExitCode, Vn as chunkTables, da as classifyRollingDeploySafety, F as declaredSnapshot, et as defaultArrayClause, $e as defaultClause, j as defaultJsonClause, Zi as describeOutcome, Gi as destructiveScope, Xt as detectReactiveTriggerDrift, $r as emitAddIndexMysql, Pr as emitCreateTableMysql, gr as emitDropColumnDdl, _r as emitDropColumnDdlMysql, Et as emitFrameworkBootstrapSql, wt as emitNamespaceProvisionDdl, Tt as emitNamespacedSchemaSql, Ct as emitSchemaSql, er as engineFromVersion, P as fingerprintSchema, ye as fnv1a64, ba as formatBranchRehearsal, Zt as formatReactiveTriggerDrift, Wi as ignoreTablesFromEnv, $n as introspectSchema, ar as isAlreadySatisfied, c as isFileMigration, Sa as isRawSqlFragment, kt as isReRunSafeDdl, Fn as mapPgType, g as migration, be as migrationLockKeyForSchema, xe as migrationLockNameForSchema, Yr as mysqlIndexPrefixFor, Xe as notifyFunctionName, M as numericIdSql, Pn as parseEnumCheck, aa as pendingFileMigrationIds, Nn as planMigrations, Rt as provisionTenantNamespace, Ye as reactiveTriggerName, mt as reactiveTriggerRepairSql, zi as recordUpToDate, _a as rehearseMigrationOnBranch, ha as rehearsedOperation, E as releaseMigrationLock, Mr as renderColumnMysql, Dr as renderColumnPg, he as resolveMigrationLockSchema, H as resolveMysqlEngine, ca as rollbackFileBasedMigration, fa as rollingDeployUnsafeOps, oa as runFileBasedMigrations, zt as runFrameworkBootstrap, It as runMigrate, Xi as runPlannedMigrations, Gt as shortFingerprint, Kt as snapshotColumn, xa as sql, A as sqlType, la as squashMigrationPlans, qi as unblockLossy, Ne as withMigrationLock };