@voltro/database 0.14.0 → 0.16.0

package/dist/sql.js

@@ -39,7 +39,7 @@ var _ = (e, t, n, r = 400) => {
 		t !== void 0 && s.push(`db.${e}: ${t}`);
 	}
 	return s.push(""), s.join("\n");
-}, v = (e) => e.unique === !0 && typeof e.where == "string" && e.where.length > 0, y = (e) => e.replace(/"/g, "`"), b = (e) => typeof e == "string" ? e : e.name ?? String(e), x = (e, t) => `_ua_${t}_${e}`.slice(0, 64), S = (e, t) => {
+}, v = (e) => e.unique === !0 && typeof e.where == "string" && e.where.length > 0, te = (e) => e.replace(/"/g, "`"), y = (e) => typeof e == "string" ? e : e.name ?? String(e), b = (e, t) => `_ua_${t}_${e}`.slice(0, 64), x = (e, t) => {
 	if (t !== "mysql" && t !== "mariadb" || !e.appliedIndexes.some(v)) return e;
 	let n = { ...e.fields }, r = [], i = [];
 	for (let t of e.appliedIndexes) {
@@ -47,11 +47,11 @@ var _ = (e, t, n, r = 400) => {
 			r.push(t);
 			continue;
 		}
-		let a = y(t.where), o = [];
+		let a = te(t.where), o = [];
 		for (let r of t.fields) {
-			let i = b(r);
+			let i = y(r);
 			if (!(i in e.fields)) throw Error(`@voltro/migrate: uniqueActive '${t.name}' on '${e.tableName}' references unknown column '${i}'.`);
-			let s = x(t.name, i);
+			let s = b(t.name, i);
 			o.push(s), n[s] = {
 				type: "text",
 				nullable: !0,
@@ -74,54 +74,54 @@ var _ = (e, t, n, r = 400) => {
 		appliedIndexes: r,
 		appliedUniques: [...e.appliedUniques ?? [], ...i]
 	};
-}, C = (e, t) => `${e}::${t}`, w = (e, t) => {
+}, S = (e, t) => `${e}::${t}`, ne = (e, t) => {
 	let n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = (e) => {
 		n.add(e);
 		let o = [...t(e)].filter((t) => t.target !== e).sort((e, t) => e.column.localeCompare(t.column));
-		for (let t of o) n.has(t.target) ? i.add(C(e, t.column)) : r.has(t.target) || a(t.target);
+		for (let t of o) n.has(t.target) ? i.add(S(e, t.column)) : r.has(t.target) || a(t.target);
 		n.delete(e), r.add(e);
 	};
 	for (let t of [...e].sort()) r.has(t) || a(t);
 	return i;
-}, te = 6322741009312437n, ne = 250, re = () => {
+}, re = 6322741009312437n, ie = 250, ae = () => {
 	let e = Number(process.env.VOLTRO_MIGRATION_LOCK_TIMEOUT_MS);
 	return Number.isFinite(e) && e > 0 ? e : 3e4;
-}, ie = (e) => d.gen(function* () {
-	let t = re(), n = Date.now();
+}, oe = (e) => d.gen(function* () {
+	let t = ae(), n = Date.now();
 	for (;;) {
 		if ((yield* e`
         SELECT pg_try_advisory_lock(${"6322741009312437"}::bigint) AS got`)[0]?.got) return;
-		Date.now() - n >= t && (yield* d.die(/* @__PURE__ */ Error(`could not acquire the postgres migration advisory lock within ${Math.round(t / 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* d.sleep(`${ne} millis`);
+		Date.now() - n >= t && (yield* d.die(/* @__PURE__ */ Error(`could not acquire the postgres migration advisory lock within ${Math.round(t / 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* d.sleep(`${ie} millis`);
 	}
-}), ae = (e) => d.gen(function* () {
-	yield* e`SELECT pg_advisory_unlock(${te.toString()}::bigint)`;
-}), oe = `voltro_migration_${te.toString(36)}`, se = 30, ce = (e) => d.gen(function* () {
+}), se = (e) => d.gen(function* () {
+	yield* e`SELECT pg_advisory_unlock(${re.toString()}::bigint)`;
+}), ce = `voltro_migration_${re.toString(36)}`, le = 30, ue = (e) => d.gen(function* () {
 	(yield* e`
-      SELECT GET_LOCK(${oe}, ${se}) AS got`)[0]?.got !== 1 && (yield* d.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${oe}' within ${se}s (another migration is in progress, or a prior one left it held).`)));
-}), le = (e) => d.gen(function* () {
-	yield* e`SELECT RELEASE_LOCK(${oe})`;
-}), ue = `voltro_migration_${te.toString(36)}`, de = 3e4, fe = (e) => d.gen(function* () {
+      SELECT GET_LOCK(${ce}, ${le}) AS got`)[0]?.got !== 1 && (yield* d.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${ce}' within ${le}s (another migration is in progress, or a prior one left it held).`)));
+}), de = (e) => d.gen(function* () {
+	yield* e`SELECT RELEASE_LOCK(${ce})`;
+}), fe = `voltro_migration_${re.toString(36)}`, pe = 3e4, me = (e) => d.gen(function* () {
 	let t = yield* e`
       DECLARE @res int;
-      EXEC @res = sp_getapplock @Resource = ${ue}, @LockMode = 'Exclusive',
-        @LockOwner = 'Session', @LockTimeout = ${de};
+      EXEC @res = sp_getapplock @Resource = ${fe}, @LockMode = 'Exclusive',
+        @LockOwner = 'Session', @LockTimeout = ${pe};
       SELECT @res AS res`;
-	(t[0]?.res ?? -999) < 0 && (yield* d.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${ue}' (sp_getapplock returned ${t[0]?.res ?? "no row"}; another migration is in progress).`)));
-}), pe = (e) => d.gen(function* () {
-	yield* e`EXEC sp_releaseapplock @Resource = ${ue}, @LockOwner = 'Session'`;
-}), me = d.void, T = (e) => e.onDialectOrElse({
-	mysql: () => ce(e),
-	mssql: () => fe(e),
-	sqlite: () => me,
-	orElse: () => ie(e)
-}), E = (e) => e.onDialectOrElse({
-	mysql: () => le(e),
-	mssql: () => pe(e),
-	sqlite: () => me,
-	orElse: () => ae(e)
-}), he = (e, t) => d.acquireUseRelease(T(e), () => t, () => E(e).pipe(d.orDie)), ge = f({ scope: "voltro:migrate" }), D = (e) => {
-	ge.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
-}, O = (e, t) => {
+	(t[0]?.res ?? -999) < 0 && (yield* d.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${fe}' (sp_getapplock returned ${t[0]?.res ?? "no row"}; another migration is in progress).`)));
+}), he = (e) => d.gen(function* () {
+	yield* e`EXEC sp_releaseapplock @Resource = ${fe}, @LockOwner = 'Session'`;
+}), ge = d.void, C = (e) => e.onDialectOrElse({
+	mysql: () => ue(e),
+	mssql: () => me(e),
+	sqlite: () => ge,
+	orElse: () => oe(e)
+}), w = (e) => e.onDialectOrElse({
+	mysql: () => de(e),
+	mssql: () => he(e),
+	sqlite: () => ge,
+	orElse: () => se(e)
+}), _e = (e, t) => d.acquireUseRelease(C(e), () => t, () => w(e).pipe(d.orDie)), ve = f({ scope: "voltro:migrate" }), T = (e) => {
+	ve.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
+}, E = (e, t) => {
 	let n = e.type;
 	if (e.spatial) {
 		if (t === "postgres") return `${e.spatial.kind}(${e.spatial.geomKind},${e.spatial.srid})`;
@@ -132,7 +132,7 @@ var _ = (e, t, n, r = 400) => {
 		return e.rawDdl;
 	}
 	if (n === "array" && e.arrayElement) {
-		if (t === "postgres") return `${O({
+		if (t === "postgres") return `${E({
 			...e,
 			type: e.arrayElement,
 			arrayElement: void 0
@@ -232,22 +232,22 @@ var _ = (e, t, n, r = 400) => {
 		case "array": return "TEXT[]";
 		case "interval": return "INTERVAL";
 	}
-}, _e = (e, t) => {
+}, ye = (e, t) => {
 	if (!e.hasDefault || e.defaultFactory !== void 0) return null;
 	let n = e.defaultValue;
-	return n === "now" ? u(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) ? ve(n, e, t) : typeof n == "object" && n ? k(n, t) : null;
-}, ve = (e, t, n) => {
-	if (n !== "postgres" || t.type !== "array" || t.arrayElement === void 0) return k(e, n);
-	let r = O({
+	return n === "now" ? u(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) ? be(n, e, t) : typeof n == "object" && n ? D(n, t) : null;
+}, be = (e, t, n) => {
+	if (n !== "postgres" || t.type !== "array" || t.arrayElement === void 0) return D(e, n);
+	let r = E({
 		...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}[]`;
-}, k = (e, t) => {
+}, D = (e, t) => {
 	let n = JSON.stringify(e).replace(/'/g, "''");
 	return t === "postgres" ? `DEFAULT '${n}'::jsonb` : t === "mysql" || t === "mariadb" ? `DEFAULT (CAST('${n}' AS JSON))` : `DEFAULT '${n}'`;
-}, A = (e, t) => {
+}, O = (e, t) => {
 	switch (t) {
 		case "postgres": return `"${e}" BIGSERIAL PRIMARY KEY`;
 		case "mysql":
@@ -256,7 +256,7 @@ var _ = (e, t, n, r = 400) => {
 		case "sqlite": return `"${e}" INTEGER PRIMARY KEY AUTOINCREMENT`;
 		case "turso": return `"${e}" INTEGER PRIMARY KEY`;
 	}
-}, j = (e, t) => {
+}, k = (e, t) => {
 	if (e === "restrict" && t === "mssql") return "NO ACTION";
 	switch (e) {
 		case "cascade": return "CASCADE";
@@ -264,38 +264,38 @@ var _ = (e, t, n, r = 400) => {
 		case "setNull": return "SET NULL";
 		case "noAction": return "NO ACTION";
 	}
-}, ye = (t, n, r) => r === null ? e(t, n) : `${e(r, n)}.${e(t, n)}`, be = 191, xe = (t, n, r) => {
+}, xe = (t, n, r) => r === null ? e(t, n) : `${e(r, n)}.${e(t, n)}`, Se = 191, Ce = (t, n, r) => {
 	let i = e(t, r);
 	if (r !== "mysql" && r !== "mariadb") return i;
 	let a = n[t];
 	if (!a) return i;
-	let o = O(a, r).toUpperCase();
-	return o.endsWith("TEXT") || o.endsWith("BLOB") ? `${i}(${be})` : i;
-}, Se = (e, t) => {
+	let o = E(a, r).toUpperCase();
+	return o.endsWith("TEXT") || o.endsWith("BLOB") ? `${i}(${Se})` : i;
+}, we = (e, t) => {
 	if (!e.generatedAs) return null;
 	let { expr: n, stored: r } = e.generatedAs;
-	if (t === "postgres") return r || D("[voltro:migrate] generated column requested as VIRTUAL but postgres only supports STORED — promoting"), `GENERATED ALWAYS AS (${n}) STORED`;
+	if (t === "postgres") return r || T("[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"}`;
-}, Ce = (t, n, r, i, a = !1, o = !1) => {
-	if (n.type === "id" && n.idScheme?.kind === "numeric") return A(t, r);
-	let s = r === "mssql" && n.type === "text" && !n.generatedAs && n.maxLength === void 0 && i?.has(t) ? "NVARCHAR(450)" : O(n, r), c = [e(t, r), s];
+}, Te = (t, n, r, i, a = !1, o = !1) => {
+	if (n.type === "id" && n.idScheme?.kind === "numeric") return O(t, r);
+	let s = r === "mssql" && n.type === "text" && !n.generatedAs && n.maxLength === void 0 && i?.has(t) ? "NVARCHAR(450)" : E(n, r), c = [e(t, r), s];
 	n.type === "id" && !o && c.push("PRIMARY KEY");
-	let l = Se(n, r);
+	let l = we(n, r);
 	if (l) c.push(l);
 	else {
 		n.nullable || c.push("NOT NULL"), n.unique && n.type !== "id" && c.push("UNIQUE");
-		let e = _e(n, r);
+		let e = ye(n, r);
 		e && c.push(e);
 	}
 	if (n.type === "reference" && n.references && !a) {
 		let t = n.references();
 		c.push(`REFERENCES ${e(t.tableName, r)} (${e("id", r)})`);
-		let i = j(n.onDelete ?? "restrict", r);
+		let i = k(n.onDelete ?? "restrict", r);
 		c.push(`ON DELETE ${i}`);
-		let a = j(n.refOnUpdate ?? "noAction", r);
+		let a = k(n.refOnUpdate ?? "noAction", r);
 		a !== "NO ACTION" && c.push(`ON UPDATE ${a}`);
 	}
 	if (n.oneOf && n.oneOf.length > 0) {
@@ -312,18 +312,18 @@ var _ = (e, t, n, r = 400) => {
 		u(r) ? c.push(`CHECK (${n} IS NULL OR json_valid(${n}))`) : r === "mssql" && c.push(`CHECK (${n} IS NULL OR ISJSON(${n}) = 1)`);
 	}
 	return c.join(" ");
-}, we = (t, n, r = null, i) => {
+}, Ee = (t, n, r = null, i) => {
 	let a = /* @__PURE__ */ new Set();
 	for (let e of t.appliedIndexes ?? []) for (let t of e.fields) typeof t == "string" && a.add(t);
 	for (let e of t.appliedUniques ?? []) for (let t of e.fields) typeof t == "string" && a.add(t);
-	let o = t.appliedPrimaryKey ?? [], s = o.length > 0, c = Object.entries(t.fields).map(([e, t]) => `  ${Ce(e, t, n, a, i?.has(e) ?? !1, s)}`).join(",\n"), l = (t.appliedUniques ?? []).map((r) => {
-		let i = r.fields.map((e) => xe(e, t.fields, n)).join(", ");
+	let o = t.appliedPrimaryKey ?? [], s = o.length > 0, c = Object.entries(t.fields).map(([e, t]) => `  ${Te(e, t, n, a, i?.has(e) ?? !1, s)}`).join(",\n"), l = (t.appliedUniques ?? []).map((r) => {
+		let i = r.fields.map((e) => Ce(e, t.fields, n)).join(", ");
 		return `  CONSTRAINT ${e(r.name, n)} UNIQUE (${i})`;
 	}), u = (t.appliedChecks ?? []).map((t) => `  CONSTRAINT ${e(t.name, n)} CHECK (${t.expr})`), d = [
-		...s ? [`  PRIMARY KEY (${o.map((e) => xe(e, t.fields, n)).join(", ")})`] : [],
+		...s ? [`  PRIMARY KEY (${o.map((e) => Ce(e, t.fields, n)).join(", ")})`] : [],
 		...l,
 		...u
-	], f = d.length > 0 ? `${c},\n${d.join(",\n")}` : c, p = ye(t.tableName, n, r);
+	], f = d.length > 0 ? `${c},\n${d.join(",\n")}` : c, p = xe(t.tableName, n, r);
 	if (n === "mssql") {
 		let e = r === null ? t.tableName : `${r}.${t.tableName}`, n = `CREATE TABLE ${p} (\n${f}\n)`;
 		return `IF OBJECT_ID('${e.replace(/'/g, "''")}', 'U') IS NULL EXEC(N'${n.replace(/'/g, "''")}');`;
@@ -333,10 +333,10 @@ var _ = (e, t, n, r = 400) => {
 		f,
 		");"
 	].join("\n");
-}, Te = (t, n, r) => {
+}, De = (t, n, r) => {
 	let i = `${t}_${n.name}_fts`, a = (t) => e(t, r), o = n.columns.map(a).join(", "), s = n.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(t)} 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(t)} 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(t)} 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;
-}, Ee = (n, r, a = null) => {
+}, Oe = (n, r, a = null) => {
 	let o = [], s = /* @__PURE__ */ new Set(), c = (e) => e.join("\0"), l = (e, n, i, a) => {
 		let o = {
 			using: "",
@@ -348,21 +348,21 @@ var _ = (e, t, n, r = 400) => {
 			using: " USING GIST",
 			withSuffix: "",
 			skip: !1
-		} : (D(`[voltro:migrate] index '${e}' on '${n}': ${r} doesn't support GiST — falling back to btree. Spatial queries on this column will fall back to sequential scan.`), o);
+		} : (T(`[voltro:migrate] index '${e}' on '${n}': ${r} doesn't support GiST — falling back to btree. Spatial queries on this column will fall back to sequential scan.`), o);
 		if (i === "gin") return r === "postgres" ? {
 			using: " USING GIN",
 			withSuffix: "",
 			skip: !1
-		} : r === "mysql" || r === "mariadb" ? (D(`[voltro:migrate] gin index '${e}' on '${n}': ${r} 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(...).`), {
+		} : r === "mysql" || r === "mariadb" ? (T(`[voltro:migrate] gin index '${e}' on '${n}': ${r} 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
-		}) : (D(`[voltro:migrate] gin index '${e}' on '${n}': ${r} has no GIN access method — falling back to btree. Containment/membership queries won't use this index efficiently.`), o);
+		}) : (T(`[voltro:migrate] gin index '${e}' on '${n}': ${r} has no GIN access method — falling back to btree. Containment/membership queries won't use this index efficiently.`), o);
 		if (i === "brin") return r === "postgres" ? {
 			using: " USING BRIN",
 			withSuffix: "",
 			skip: !1
-		} : (D(`[voltro:migrate] brin index '${e}' on '${n}': ${r} has no BRIN access method — falling back to btree (larger on disk, but the range scan still works).`), o);
+		} : (T(`[voltro:migrate] brin index '${e}' on '${n}': ${r} has no BRIN access method — falling back to btree (larger on disk, but the range scan still works).`), o);
 		if (i === "hnsw") {
 			if (r === "postgres") {
 				let e = a?.hnsw?.m ?? 16, n = a?.hnsw?.efConstruction ?? 64, r = a?.hnsw?.opclass ?? t(a?.hnsw?.distance);
@@ -373,7 +373,7 @@ var _ = (e, t, n, r = 400) => {
 					skip: !1
 				};
 			}
-			return D(`[voltro:migrate] hnsw index '${e}' on '${n}': ${r} has no pgvector / HNSW access method — skipping. Nearest-neighbour queries on this column fall back to a sequential scan.`), {
+			return T(`[voltro:migrate] hnsw index '${e}' on '${n}': ${r} has no pgvector / HNSW access method — skipping. Nearest-neighbour queries on this column fall back to a sequential scan.`), {
 				using: "",
 				withSuffix: "",
 				skip: !0
@@ -382,7 +382,7 @@ var _ = (e, t, n, r = 400) => {
 		return o;
 	}, u = (e, t) => {
 		let a = e.map((e) => {
-			if (typeof e == "string") return xe(e, n.fields, r);
+			if (typeof e == "string") return Ce(e, n.fields, r);
 			if ("jsonPath" in e) {
 				let { column: t, path: n, numeric: a } = e.jsonPath;
 				return `(${i(t, n, r, { numeric: a })})`;
@@ -393,7 +393,7 @@ var _ = (e, t, n, r = 400) => {
 	}, d = (t, n, i, o, s, c = "", d = !1) => {
 		let f = l(t, n, o, s);
 		if (f.skip) return "";
-		let p = u(i, f.opclass), m = `${f.withSuffix}${c}`, h = ye(n, r, a), g = d ? "UNIQUE " : "";
+		let p = u(i, f.opclass), m = `${f.withSuffix}${c}`, h = xe(n, r, a), g = d ? "UNIQUE " : "";
 		return r === "mssql" ? `IF NOT EXISTS (SELECT 1 FROM sys.indexes WHERE name = '${t}') CREATE ${g}INDEX ${e(t, r)} ON ${h}${f.using} (${p})${m};` : r === "mysql" ? `CREATE ${g}INDEX ${e(t, r)} ON ${h}${f.using} (${p})${m};` : `CREATE ${g}INDEX IF NOT EXISTS ${e(t, r)} ON ${h}${f.using} (${p})${m};`;
 	};
 	for (let t of n.appliedFullText ?? []) if (r === "postgres") {
@@ -406,15 +406,15 @@ var _ = (e, t, n, r = 400) => {
 		let i = t.columns.map((t) => e(t, r)).join(", ");
 		o.push(`CREATE FULLTEXT INDEX ${e(t.name, r)} ON ${e(n.tableName, r)} (${i});`);
 	} else if (r === "turso") throw Error(`@voltro/sql-turso: full-text index '${t.name}' on '${n.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 r === "sqlite" ? o.push(...Te(n.tableName, t, r)) : D(`[voltro:migrate] full-text index '${t.name}' on '${n.tableName}': ${r} uses a ranked LIKE search at query time (no native FTS catalog required).`);
+	else r === "sqlite" ? o.push(...De(n.tableName, t, r)) : T(`[voltro:migrate] full-text index '${t.name}' on '${n.tableName}': ${r} uses a ranked LIKE search at query time (no native FTS catalog required).`);
 	for (let e of n.appliedIndexes) {
 		if ((r === "mariadb" || r === "mssql") && e.fields.some((e) => typeof e != "string" && "jsonPath" in e)) {
-			D(`[voltro:migrate] json-path index '${e.name}' on '${n.tableName}': ${r} cannot index a JSON expression directly — skipping. For an indexed JSON path on ${r}, add a generated column for the path (text().generatedAs(...) / .stored()) and .index([...]) it, then filter on that column instead of jsonField(...).`);
+			T(`[voltro:migrate] json-path index '${e.name}' on '${n.tableName}': ${r} cannot index a JSON expression directly — skipping. For an indexed JSON path on ${r}, add a generated column for the path (text().generatedAs(...) / .stored()) and .index([...]) it, then filter on that column instead of jsonField(...).`);
 			continue;
 		}
 		if (e.unique && e.where !== void 0 && e.where.length > 0 && (r === "mysql" || r === "mariadb")) throw Error(`@voltro/migrate: uniqueActive index '${e.name}' on '${n.tableName}' cannot be expressed on ${r} — 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 ${r}, or move this table to postgres/sqlite/mssql.`);
 		let t = "";
-		e.where !== void 0 && e.where.length > 0 && (r === "mysql" || r === "mariadb" ? D(`[voltro:migrate] partial index '${e.name}' on '${n.tableName}': ${r} does not support WHERE clauses on indexes — emitting a full index`) : t = ` WHERE ${e.where}`);
+		e.where !== void 0 && e.where.length > 0 && (r === "mysql" || r === "mariadb" ? T(`[voltro:migrate] partial index '${e.name}' on '${n.tableName}': ${r} does not support WHERE clauses on indexes — emitting a full index`) : t = ` WHERE ${e.where}`);
 		let i = d(e.name, n.tableName, e.fields, e.kind, e.kindOptions, t, e.unique === !0);
 		i !== "" && o.push(i), e.fields.every((e) => typeof e == "string") && s.add(c(e.fields));
 	}
@@ -424,14 +424,14 @@ var _ = (e, t, n, r = 400) => {
 		o.push(d(r, n.tableName, [e])), s.add(c([e]));
 	}
 	return o.join("\n");
-}, De = "CREATE OR REPLACE FUNCTION framework_notify_change() RETURNS trigger AS $$\nDECLARE\n  payload TEXT;\nBEGIN\n  payload := json_build_object(\n    'table',  TG_TABLE_NAME,\n    -- The schema the write landed in. Under namespace isolation this is\n    -- the tenant schema (tenant_<id>); the CDC consumer uses it so a\n    -- write in tenant A namespace does not spuriously wake tenant B\n    -- subscriptions on the same-named table. public/absent = shared.\n    'schema', TG_TABLE_SCHEMA,\n    'op',     lower(TG_OP),\n    'old',    CASE WHEN TG_OP = 'INSERT' THEN NULL ELSE row_to_json(OLD) END,\n    'new',    CASE WHEN TG_OP = 'DELETE' THEN NULL ELSE row_to_json(NEW) END\n  )::text;\n  -- pg_notify hard-caps the payload at 8000 bytes; a wide reactive row\n  -- (big text / json column) would otherwise abort the write itself.\n  -- Fall back to a body-less notice — the CDC consumer treats absent\n  -- old/new as \"all columns changed\" and re-queries, so correctness is\n  -- preserved; only the delta-diff fast path is skipped for that write.\n  IF octet_length(payload) >= 7999 THEN\n    payload := json_build_object(\n      'table',     TG_TABLE_NAME,\n      'schema',    TG_TABLE_SCHEMA,\n      'op',        lower(TG_OP),\n      'old',       NULL,\n      'new',       NULL,\n      'oversized', true\n    )::text;\n  END IF;\n  PERFORM pg_notify('framework_changes', payload);\n  RETURN COALESCE(NEW, OLD);\nEND;\n$$ LANGUAGE plpgsql;", Oe = (e) => `
+}, ke = "CREATE OR REPLACE FUNCTION framework_notify_change() RETURNS trigger AS $$\nDECLARE\n  payload TEXT;\nBEGIN\n  payload := json_build_object(\n    'table',  TG_TABLE_NAME,\n    -- The schema the write landed in. Under namespace isolation this is\n    -- the tenant schema (tenant_<id>); the CDC consumer uses it so a\n    -- write in tenant A namespace does not spuriously wake tenant B\n    -- subscriptions on the same-named table. public/absent = shared.\n    'schema', TG_TABLE_SCHEMA,\n    'op',     lower(TG_OP),\n    'old',    CASE WHEN TG_OP = 'INSERT' THEN NULL ELSE row_to_json(OLD) END,\n    'new',    CASE WHEN TG_OP = 'DELETE' THEN NULL ELSE row_to_json(NEW) END\n  )::text;\n  -- pg_notify hard-caps the payload at 8000 bytes; a wide reactive row\n  -- (big text / json column) would otherwise abort the write itself.\n  -- Fall back to a body-less notice — the CDC consumer treats absent\n  -- old/new as \"all columns changed\" and re-queries, so correctness is\n  -- preserved; only the delta-diff fast path is skipped for that write.\n  IF octet_length(payload) >= 7999 THEN\n    payload := json_build_object(\n      'table',     TG_TABLE_NAME,\n      'schema',    TG_TABLE_SCHEMA,\n      'op',        lower(TG_OP),\n      'old',       NULL,\n      'new',       NULL,\n      'oversized', true\n    )::text;\n  END IF;\n  PERFORM pg_notify('framework_changes', payload);\n  RETURN COALESCE(NEW, OLD);\nEND;\n$$ LANGUAGE plpgsql;", Ae = (e) => `
 ALTER TABLE "${e.tableName}" REPLICA IDENTITY FULL;
 DROP TRIGGER IF EXISTS framework_changes_${e.tableName} ON "${e.tableName}";
 CREATE TRIGGER framework_changes_${e.tableName}
 AFTER INSERT OR UPDATE OR DELETE ON "${e.tableName}"
 FOR EACH ROW EXECUTE FUNCTION framework_notify_change();
-`.trim(), ke = (e) => e.some((e) => Object.values(e.fields).some((e) => e.type === "vector")), Ae = (e) => e.some((e) => Object.values(e.fields).some((e) => e.spatial !== void 0)), je = (e) => {
-	let t = new Map(e.map((e) => [e.tableName, e])), n = w(e.map((e) => e.tableName), (e) => {
+`.trim(), je = (e) => e.some((e) => Object.values(e.fields).some((e) => e.type === "vector")), Me = (e) => e.some((e) => Object.values(e.fields).some((e) => e.spatial !== void 0)), Ne = (e) => {
+	let t = new Map(e.map((e) => [e.tableName, e])), n = ne(e.map((e) => e.tableName), (e) => {
 		let n = t.get(e);
 		return n ? Object.entries(n.fields).flatMap(([e, n]) => {
 			if (n.type !== "reference" || !n.references) return [];
@@ -442,7 +442,7 @@ FOR EACH ROW EXECUTE FUNCTION framework_notify_change();
 			}] : [];
 		}) : [];
 	}), r = [];
-	for (let t of e) for (let [e, i] of Object.entries(t.fields)) i.type !== "reference" || !i.references || n.has(C(t.tableName, e)) && r.push({
+	for (let t of e) for (let [e, i] of Object.entries(t.fields)) i.type !== "reference" || !i.references || n.has(S(t.tableName, e)) && r.push({
 		table: t.tableName,
 		column: e,
 		targetTable: i.references().tableName,
@@ -453,7 +453,7 @@ FOR EACH ROW EXECUTE FUNCTION framework_notify_change();
 		if (!(i.has(e.tableName) || a.has(e.tableName))) {
 			a.add(e.tableName);
 			for (let [r, i] of Object.entries(e.fields)) {
-				if (i.type !== "reference" || !i.references || n.has(C(e.tableName, r))) continue;
+				if (i.type !== "reference" || !i.references || n.has(S(e.tableName, r))) continue;
 				let a = i.references();
 				if (a.tableName === e.tableName) continue;
 				let o = t.get(a.tableName);
@@ -467,8 +467,8 @@ FOR EACH ROW EXECUTE FUNCTION framework_notify_change();
 		sorted: o,
 		cyclic: r
 	};
-}, Me = (t, n, r = null) => {
-	let i = (t) => r ? `${e(r, n)}.${e(t, n)}` : e(t, n), a = `${t.table}_${t.column}_fkey`, o = j(t.onDelete, n), s = j(t.onUpdate, n), c = ` ON DELETE ${o}${s === "NO ACTION" ? "" : ` ON UPDATE ${s}`}`, l = (r) => `ADD CONSTRAINT ${e(a, n)} FOREIGN KEY ${r ? "IF NOT EXISTS " : ""}(${e(t.column, n)}) REFERENCES ${i(t.targetTable)} (${e("id", n)})${c}`;
+}, Pe = (t, n, r = null) => {
+	let i = (t) => r ? `${e(r, n)}.${e(t, n)}` : e(t, n), a = `${t.table}_${t.column}_fkey`, o = k(t.onDelete, n), s = k(t.onUpdate, n), c = ` ON DELETE ${o}${s === "NO ACTION" ? "" : ` ON UPDATE ${s}`}`, l = (r) => `ADD CONSTRAINT ${e(a, n)} FOREIGN KEY ${r ? "IF NOT EXISTS " : ""}(${e(t.column, n)}) REFERENCES ${i(t.targetTable)} (${e("id", n)})${c}`;
 	switch (n) {
 		case "postgres": return [
 			"DO $$ BEGIN",
@@ -482,7 +482,7 @@ FOR EACH ROW EXECUTE FUNCTION framework_notify_change();
 		case "mariadb": return `ALTER TABLE ${i(t.table)} ${l(!0)};`;
 		default: return `ALTER TABLE ${i(t.table)} ${l(!1)};`;
 	}
-}, Ne = (e, t) => {
+}, Fe = (e, t) => {
 	let n = /* @__PURE__ */ new Map();
 	if (u(t)) return n;
 	for (let t of e) {
@@ -490,7 +490,7 @@ FOR EACH ROW EXECUTE FUNCTION framework_notify_change();
 		e.add(t.column), n.set(t.table, e);
 	}
 	return n;
-}, Pe = (e, t) => {
+}, Ie = (e, t) => {
 	if (t !== "postgres") return "";
 	let n = /* @__PURE__ */ new Map();
 	for (let t of e) for (let e of Object.values(t.fields)) {
@@ -506,7 +506,7 @@ FOR EACH ROW EXECUTE FUNCTION framework_notify_change();
 		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");
-}, Fe = (e, t) => {
+}, Le = (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);
@@ -520,34 +520,34 @@ 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");
-}, Ie = (e) => {
+}, Re = (e) => {
 	let t = [], r = [];
 	for (let i of e) n(i) ? r.push(i) : t.push(i);
 	return {
 		tables: t,
 		views: r
 	};
-}, M = (e, t) => {
-	let { tables: n, views: i } = Ie(e), { sorted: a, cyclic: o } = je(n.map((e) => S(e, t))), s = Ne(o, t), c = [];
-	t === "postgres" && ke(a) && c.push("CREATE EXTENSION IF NOT EXISTS vector;"), t === "postgres" && Ae(a) && c.push("CREATE EXTENSION IF NOT EXISTS postgis;");
-	let l = Fe(a, t);
+}, A = (e, t) => {
+	let { tables: n, views: i } = Re(e), { sorted: a, cyclic: o } = Ne(n.map((e) => x(e, t))), s = Fe(o, t), c = [];
+	t === "postgres" && je(a) && c.push("CREATE EXTENSION IF NOT EXISTS vector;"), t === "postgres" && Me(a) && c.push("CREATE EXTENSION IF NOT EXISTS postgis;");
+	let l = Le(a, t);
 	l && c.push(l);
-	let d = Pe(a, t);
+	let d = Ie(a, t);
 	d && c.push(d);
-	for (let e of a) c.push(we(e, t, null, s.get(e.tableName)));
-	if (!u(t)) for (let e of o) c.push(Me(e, t));
+	for (let e of a) c.push(Ee(e, t, null, s.get(e.tableName)));
+	if (!u(t)) for (let e of o) c.push(Pe(e, t));
 	for (let e of a) {
-		let n = Ee(e, t);
+		let n = Oe(e, t);
 		n && c.push(n);
 	}
 	let f = a.filter((e) => e.isReactive !== !1);
 	if (f.length > 0 && t === "postgres") {
-		c.push(De);
-		for (let e of f) c.push(Oe(e));
+		c.push(ke);
+		for (let e of f) c.push(Ae(e));
 	}
 	for (let e of i) c.push(r(e, t));
 	return c.join("\n\n") + "\n";
-}, Le = (t, n, r) => {
+}, ze = (t, n, r) => {
 	let i = e(t, n);
 	switch (n) {
 		case "postgres": return `CREATE SCHEMA IF NOT EXISTS ${i};`;
@@ -557,57 +557,57 @@ BEGIN
 		case "turso":
 		case "sqlite": return `ATTACH DATABASE '${(r ?? `${t}.db`).replace(/'/g, "''")}' AS ${i};`;
 	}
-}, Re = (t, n, r, i) => {
-	let a = Le(r, n, i), o = e(r, n);
-	if (n === "postgres") return `${a}\n\nSET search_path TO ${o};\n\n${M(t, n)}`;
-	if (n === "mysql" || n === "mariadb") return `${a}\n\nUSE ${o};\n\n${M(t, n)}`;
-	let { sorted: s, cyclic: c } = je(t), l = Ne(c, n), d = [a];
-	for (let e of s) d.push(we(e, n, r, l.get(e.tableName)));
-	if (!u(n)) for (let e of c) d.push(Me(e, n, r));
+}, Be = (t, n, r, i) => {
+	let a = ze(r, n, i), o = e(r, n);
+	if (n === "postgres") return `${a}\n\nSET search_path TO ${o};\n\n${A(t, n)}`;
+	if (n === "mysql" || n === "mariadb") return `${a}\n\nUSE ${o};\n\n${A(t, n)}`;
+	let { sorted: s, cyclic: c } = Ne(t), l = Fe(c, n), d = [a];
+	for (let e of s) d.push(Ee(e, n, r, l.get(e.tableName)));
+	if (!u(n)) for (let e of c) d.push(Pe(e, n, r));
 	for (let e of s) {
-		let t = Ee(e, n, r);
+		let t = Oe(e, n, r);
 		t && d.push(t);
 	}
 	return d.join("\n\n") + "\n";
-}, ze = (t, n) => {
-	if (n !== "postgres") return M(t, n);
-	let { sorted: r, cyclic: i } = je(t), a = Ne(i, n), o = [], s = Fe(r, n);
+}, Ve = (t, n) => {
+	if (n !== "postgres") return A(t, n);
+	let { sorted: r, cyclic: i } = Ne(t), a = Fe(i, n), o = [], s = Le(r, n);
 	s && o.push(s);
-	let c = Pe(r, n);
+	let c = Ie(r, n);
 	c && o.push(c);
-	for (let e of r) o.push(we(e, n, null, a.get(e.tableName)));
-	for (let e of i) o.push(Me(e, n));
+	for (let e of r) o.push(Ee(e, n, null, a.get(e.tableName)));
+	for (let e of i) o.push(Pe(e, n));
 	for (let t of r) {
 		let r = Object.entries(t.fields);
 		if (r.length === 0) continue;
 		let i = r.map(([r, i]) => {
-			let o = Ce(r, i, n, void 0, a.get(t.tableName)?.has(r) ?? !1);
+			let o = Te(r, i, n, void 0, a.get(t.tableName)?.has(r) ?? !1);
 			return `ALTER TABLE ${e(t.tableName, n)} ADD COLUMN IF NOT EXISTS ${o};`;
 		});
 		o.push(i.join("\n"));
 	}
 	for (let e of r) {
-		let t = Ee(e, n);
+		let t = Oe(e, n);
 		t && o.push(t);
 	}
 	let l = r.filter((e) => e.isReactive);
 	if (l.length > 0) {
-		o.push(De);
-		for (let e of l) o.push(Oe(e));
+		o.push(ke);
+		for (let e of l) o.push(Ae(e));
 	}
 	return o.join("\n\n") + "\n";
-}, Be = (e, t = "postgres") => d.gen(function* () {
+}, He = (e, t = "postgres") => d.gen(function* () {
 	let n = yield* p.SqlClient;
-	yield* he(n, Ue(n, M(e, t), t)).pipe(d.orDie);
-}), Ve = (e, t) => {
+	yield* _e(n, Ge(n, A(e, t), t)).pipe(d.orDie);
+}), Ue = (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);
-}, He = (e) => d.gen(function* () {
+}, We = (e) => d.gen(function* () {
 	let t = yield* p.SqlClient;
-	for (let n of We(e)) process.env.VOLTRO_MIGRATE_DEBUG === "1" && ge.debug(`EXEC: ${n.replace(/\s+/g, " ").slice(0, 180)}`), yield* t.unsafe(n).pipe(d.catchIf((e) => Ve(n, e), () => d.void), d.tapError((e) => d.sync(() => {
-		ge.error(_("migrate: statement failed", n, e, 200));
+	for (let n of Ke(e)) process.env.VOLTRO_MIGRATE_DEBUG === "1" && ve.debug(`EXEC: ${n.replace(/\s+/g, " ").slice(0, 180)}`), yield* t.unsafe(n).pipe(d.catchIf((e) => Ue(n, e), () => d.void), d.tapError((e) => d.sync(() => {
+		ve.error(_("migrate: statement failed", n, e, 200));
 	})), d.orDieWith((e) => Error(_("migrate: statement failed", n, e, 400).trim())));
-}), Ue = (e, t, n) => (n === "turso" ? He(t) : e.withTransaction(He(t))).pipe(d.orDie), We = (e) => {
+}), Ge = (e, t, n) => (n === "turso" ? We(t) : e.withTransaction(We(t))).pipe(d.orDie), Ke = (e) => {
 	let t = [], n = "", r = !1;
 	for (let i = 0; i < e.length; i++) {
 		if (e.slice(i, i + 2) === "$$") {
@@ -622,40 +622,40 @@ BEGIN
 	}
 	let i = n.trim();
 	return i.length > 0 && t.push(i), t;
-}, Ge = async (e, t, n = "postgres") => {
-	await d.runPromise(Be(e, n).pipe(d.provide(t)));
-}, Ke = (e, t, n = "postgres") => d.gen(function* () {
-	let r = Re(e, n, t), i = yield* p.SqlClient;
-	yield* he(i, Ue(i, r, n)).pipe(d.orDie);
-}), qe = async (e, t, n, r = "postgres") => {
-	await d.runPromise(Ke(e, t, r).pipe(d.provide(n)));
-}, Je = async (e, t, n = "postgres") => {
+}, qe = async (e, t, n = "postgres") => {
+	await d.runPromise(He(e, n).pipe(d.provide(t)));
+}, Je = (e, t, n = "postgres") => d.gen(function* () {
+	let r = Be(e, n, t), i = yield* p.SqlClient;
+	yield* _e(i, Ge(i, r, n)).pipe(d.orDie);
+}), Ye = async (e, t, n, r = "postgres") => {
+	await d.runPromise(Je(e, t, r).pipe(d.provide(n)));
+}, Xe = async (e, t, n = "postgres") => {
 	await d.runPromise(d.gen(function* () {
-		let t = ze(e, n), r = yield* p.SqlClient;
-		yield* he(r, Ue(r, t, n)).pipe(d.orDie);
+		let t = Ve(e, n), r = yield* p.SqlClient;
+		yield* _e(r, Ge(r, t, n)).pipe(d.orDie);
 	}).pipe(d.provide(t)));
-}, Ye = (e) => {
+}, Ze = (e) => {
 	if (e == null) return e;
-	if (Array.isArray(e)) return e.map(Ye);
+	if (Array.isArray(e)) return e.map(Ze);
 	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] = Ye(r));
+		r !== void 0 && (t[n] = Ze(r));
 	}
 	return t;
-}, Xe = (e) => {
+}, Qe = (e) => {
 	if (!e.idScheme && !e.sensitive && !e.safe) return e;
 	let { idScheme: t, sensitive: n, safe: r, ...i } = e;
 	return i;
-}, Ze = (e) => [...e].map(Xe).sort((e, t) => e.name.localeCompare(t.name)), Qe = (e) => [...e].sort((e, t) => e.name.localeCompare(t.name)), $e = (e) => [...e].map((e) => ({
+}, $e = (e) => [...e].map(Qe).sort((e, t) => e.name.localeCompare(t.name)), et = (e) => [...e].sort((e, t) => e.name.localeCompare(t.name)), tt = (e) => [...e].map((e) => ({
 	name: e.name,
-	columns: Ze(e.columns),
-	indexes: Qe(e.indexes)
-})).sort((e, t) => e.name.localeCompare(t.name)), N = (e) => {
-	let t = { tables: $e(e.tables) }, n = JSON.stringify(Ye(t));
+	columns: $e(e.columns),
+	indexes: et(e.indexes)
+})).sort((e, t) => e.name.localeCompare(t.name)), j = (e) => {
+	let t = { tables: tt(e.tables) }, n = JSON.stringify(Ze(t));
 	return m("sha256").update(n).digest("hex");
-}, P = (e) => e.slice(0, 16), et = (e, t) => {
+}, M = (e) => e.slice(0, 16), nt = (e, t) => {
 	let n = t.references ? {
 		table: t.references().tableName,
 		column: "id",
@@ -693,7 +693,7 @@ BEGIN
 		...t.enumValues === void 0 ? {} : { enumValues: t.enumValues },
 		...t.spatial === void 0 ? {} : { spatial: t.spatial }
 	};
-}, tt = (e) => {
+}, rt = (e) => {
 	let t = [], n = /* @__PURE__ */ new Set(), r = (e) => {
 		n.has(e.name) || (n.add(e.name), t.push(e));
 	}, i = e.appliedPrimaryKey ?? [];
@@ -741,11 +741,11 @@ BEGIN
 		});
 	}
 	return t;
-}, nt = (e) => {
+}, it = (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 = et(r, i);
+		let e = nt(r, i);
 		n.push(t.has(r) ? {
 			...e,
 			unique: !0
@@ -755,20 +755,20 @@ BEGIN
 	return {
 		name: e.tableName,
 		columns: n,
-		indexes: tt(e),
+		indexes: rt(e),
 		...r.length > 0 ? { primaryKey: [...r] } : {}
 	};
-}, rt = (e) => {
+}, at = (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);
 	}
-}, F = (e, t) => {
-	let n = e.map((e) => nt(S(e, t)));
-	return rt(n), { tables: n };
-}, it = "framework_changes_", at = (e, t) => d.gen(function* () {
+}, N = (e, t) => {
+	let n = e.map((e) => it(x(e, t)));
+	return at(n), { tables: n };
+}, ot = "framework_changes_", st = (e, t) => d.gen(function* () {
 	let n = t.filter((e) => !e.tableName.startsWith("_voltro_"));
 	if (n.length === 0) return {
 		missing: [],
@@ -781,17 +781,17 @@ BEGIN
       JOIN pg_namespace n ON n.oid = c.relnamespace
       WHERE NOT t.tgisinternal
         AND n.nspname = current_schema()
-        AND t.tgname LIKE ${`${it}%`}
+        AND t.tgname LIKE ${`${ot}%`}
     `, i = new Set(r.map((e) => e.tgname)), a = [], o = [];
 	for (let e of n) {
-		let t = i.has(`${it}${e.tableName}`), n = e.isReactive !== !1;
+		let t = i.has(`${ot}${e.tableName}`), n = e.isReactive !== !1;
 		n && !t && a.push(e.tableName), !n && t && o.push(e.tableName);
 	}
 	return {
 		missing: a.sort(),
 		stale: o.sort()
 	};
-}), ot = (e) => {
+}), ct = (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})` : "";
@@ -802,19 +802,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 t.length > 0 ? t.join("\n") : void 0;
-}, st = /* @__PURE__ */ new Set(["voltro_isr_cache"]), I = (e) => st.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), ct = {
+}, lt = /* @__PURE__ */ new Set(["voltro_isr_cache"]), P = (e) => lt.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), ut = {
 	postgres: !0,
 	mysql: !0,
 	mariadb: !0,
 	mssql: !0,
 	sqlite: !0
-}, lt = {
+}, dt = {
 	postgres: !0,
 	mysql: !1,
 	mariadb: !1,
 	mssql: !0,
 	sqlite: !0
-}, ut = (e) => {
+}, ft = (e) => {
 	switch (e) {
 		case "add-column":
 		case "drop-column":
@@ -824,43 +824,43 @@ BEGIN
 		case "add-foreign-key":
 		case "add-unique":
 		case "add-unique-composite":
-		case "add-check": return lt;
-		default: return ct;
+		case "add-check": return dt;
+		default: return ut;
 	}
-}, dt = (e, t) => {
+}, pt = (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
 	}]));
-}, ft = (e) => (t, n) => t.name === e ? -1 : n.name === e ? 1 : t.name.localeCompare(n.name), L = (e) => {
+}, mt = (e) => (t, n) => t.name === e ? -1 : n.name === e ? 1 : t.name.localeCompare(n.name), F = (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(F).join(",")}]`;
 	let t = e;
-	return `{${Object.keys(t).sort().map((e) => `${JSON.stringify(e)}:${L(t[e])}`).join(",")}}`;
-}, pt = (e) => {
+	return `{${Object.keys(t).sort().map((e) => `${JSON.stringify(e)}:${F(t[e])}`).join(",")}}`;
+}, ht = (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 F(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 F(JSON.parse(o[1]));
 	} catch {}
 	if (a.startsWith("{") || a.startsWith("[")) try {
-		return L(JSON.parse(a));
+		return F(JSON.parse(a));
 	} catch {}
 	return /^-?\d+(\.\d+)?$/.test(a) ? String(Number(a)) : a;
-}, mt = (e, t) => {
-	let n = pt(e), r = pt(t);
+}, gt = (e, t) => {
+	let n = ht(e), r = ht(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);
-}, R = (e) => {
+}, I = (e) => {
 	if (!e) return null;
 	let t = (e) => e === "restrict" ? "noAction" : e;
 	return {
@@ -869,18 +869,18 @@ BEGIN
 		onDelete: t(e.onDelete),
 		onUpdate: t(e.onUpdate)
 	};
-}, ht = (e, t) => {
+}, _t = (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]);
-}, gt = (e, t) => e.type === t.type && e.nullable === t.nullable && e.unique === t.unique && mt(e, t) && JSON.stringify(R(e.references)) === JSON.stringify(R(t.references)) && ht(e.oneOf, t.oneOf), _t = (e, t) => t.oneOf && t.oneOf.length > 0 ? z({
+}, vt = (e, t) => e.type === t.type && e.nullable === t.nullable && e.unique === t.unique && gt(e, t) && JSON.stringify(I(e.references)) === JSON.stringify(I(t.references)) && _t(e.oneOf, t.oneOf), yt = (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, vt = (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])), yt = (e, t) => {
+}, "safe", `enum-membership CHECK on ${e}.${t.name}`) : void 0, bt = (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])), xt = (e, t) => {
 	let n = new Map(t.columns.map((e) => [e.name, e])), r = new Map(e.columns.map((e) => [e.name, e])), i = [], a = [], o = [];
 	for (let t of e.columns) {
 		let e = n.get(t.name);
@@ -888,7 +888,7 @@ BEGIN
 			i.push(t);
 			continue;
 		}
-		gt(t, e) || o.push({
+		vt(t, e) || o.push({
 			declared: t,
 			live: e
 		});
@@ -899,47 +899,47 @@ BEGIN
 		removed: a,
 		changed: o
 	};
-}, bt = (e, t) => {
+}, St = (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 || !vt(t, e)) && i.push(t);
+		(!e || !bt(t, e)) && i.push(t);
 	}
 	for (let e of t.indexes) r.has(e.name) || a.push(e);
 	return {
 		added: i,
 		removed: a
 	};
-}, z = (e, t, n, r) => ({
+}, L = (e, t, n, r) => ({
 	op: e,
 	classification: t,
-	atomicByDialect: ut(e.kind),
+	atomicByDialect: ft(e.kind),
 	...n ? { reason: n } : {},
 	...r ? { blocked: r } : {}
-}), xt = (e, t, n) => {
+}), Ct = (e, t, n) => {
 	let r = {
 		kind: "add-column",
 		table: e,
 		column: t
 	};
-	return t.nullable ? z(r, "safe", "nullable column add — no backfill needed") : t.hasDefault && t.defaultValue !== void 0 ? z(r, "needs-default", "NOT NULL with literal default — DDL DEFAULT will populate existing rows") : n?.backfill ? z(r, "needs-backfill", `backfill declared (kind=${n.backfill.kind}) — applier will run 3-step add/update/set-not-null`) : z(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` });
-}, St = (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` });
+}, wt = (e, t, n) => {
 	let r = {
 		kind: "drop-column",
 		table: e,
 		column: t.name
 	};
-	return n?.dropped ? z(r, "lossy", `column dropped via \`${t.name}: dropped()\` marker — intentional`) : z(r, "lossy", "column missing from declared schema", { fix: `if intentional, add \`${t.name}: dropped()\` to the schema. If a typo, restore the field` });
-}, Ct = (e, t, n, r) => z({
+	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` });
+}, Tt = (e, t, n, r) => L({
 	kind: "create-table",
 	table: e,
 	columns: t,
 	indexes: n,
 	...r && r.length > 0 ? { primaryKey: r } : {}
-}, "safe", "new table — no data to preserve"), wt = (e) => z({
+}, "safe", "new table — no data to preserve"), Et = (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" }), Tt = 5e4, Et = (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" }), Dt = 5e4, Ot = (e, t, n, r) => {
 	let i = (n ?? 0) >= r, a;
 	return a = t.unique ? t.columns.length === 1 ? {
 		kind: "add-unique",
@@ -954,16 +954,16 @@ BEGIN
 		kind: "add-index",
 		table: e,
 		index: t
-	}, i ? z(a, "online-required", `online build on ${n} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : z(a, "safe", t.unique ? t.columns.length === 1 ? "add unique constraint" : "add composite UNIQUE constraint" : "add B-tree index");
-}, Dt = (e, t) => t.unique && t.columns.length > 1 ? z({
+	}, 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");
+}, kt = (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)") : z({
+}, "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)"), Ot = (e, t) => {
+}, "safe", "drop index (no data loss — index is derived data)"), At = (e, t) => {
 	if (e === "reference") return "text";
 	switch (t) {
 		case "sqlite":
@@ -971,7 +971,7 @@ BEGIN
 		case "mssql": return e === "json" ? "text" : e;
 		default: return e;
 	}
-}, kt = (e, t, n, r, i, a) => {
+}, jt = (e, t, n, r, i, a) => {
 	let o = [];
 	if (t.nullable !== n.nullable) {
 		let n = {
@@ -980,7 +980,7 @@ BEGIN
 			column: t.name,
 			toNullable: t.nullable
 		};
-		o.push(t.nullable ? z(n, "safe", `loosen ${e}.${t.name} to nullable`) : z(n, "needs-backfill", `tighten ${e}.${t.name} to NOT NULL — existing rows must already be non-null`));
+		o.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) {
 		let n = {
@@ -988,13 +988,13 @@ BEGIN
 			table: e,
 			column: t.name
 		}, r = (i ?? 0) >= a;
-		o.push(r ? z(n, "online-required", `online unique build on ${i} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : z(n, "safe", `add unique constraint on ${e}.${t.name} — existing rows must already be distinct (else the DB rejects at migrate)`));
-	} else o.push(z({
+		o.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 o.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 (Ot(t.type, r) !== Ot(n.type, r)) {
+	if (At(t.type, r) !== At(n.type, r)) {
 		let r = t.narrowedFrom;
 		if (r && r.from === n.type) {
 			let i = {
@@ -1005,7 +1005,7 @@ BEGIN
 				to: t.type,
 				...r.using === void 0 ? {} : { using: r.using }
 			};
-			o.push(z(i, "needs-backfill", `type change ${n.type} → ${t.type} on ${e}.${t.name} — narrowedFrom('${r.from}') declared` + (r.using ? ` with USING ${r.using}` : " (implicit cast)")));
+			o.push(L(i, "needs-backfill", `type change ${n.type} → ${t.type} on ${e}.${t.name} — narrowedFrom('${r.from}') declared` + (r.using ? ` with USING ${r.using}` : " (implicit cast)")));
 		} else {
 			let r = {
 				kind: "alter-column-type",
@@ -1014,10 +1014,10 @@ BEGIN
 				from: n.type,
 				to: t.type
 			};
-			o.push(z(r, "lossy", `type change ${n.type} → ${t.type} on ${e}.${t.name} may not be value-preserving`, { fix: `acknowledge it on the column: \`.narrowedFrom('${n.type}', { using: '${t.name}::${t.type}' })\` (drop \`using\` if the cast is implicit), or use a file-based migration` }));
+			o.push(L(r, "lossy", `type change ${n.type} → ${t.type} on ${e}.${t.name} may not be value-preserving`, { fix: `acknowledge it on the column: \`.narrowedFrom('${n.type}', { using: '${t.name}::${t.type}' })\` (drop \`using\` if the cast is implicit), or use a file-based migration` }));
 		}
 	}
-	if (!mt(t, n)) {
+	if (!gt(t, n)) {
 		let n = {
 			kind: "alter-column-default",
 			table: e,
@@ -1025,18 +1025,18 @@ BEGIN
 			hasDefault: t.hasDefault,
 			...t.defaultValue === void 0 ? {} : { defaultValue: t.defaultValue }
 		};
-		o.push(z(n, "safe", `default change on ${e}.${t.name} affects only future inserts`));
+		o.push(L(n, "safe", `default change on ${e}.${t.name} affects only future inserts`));
 	}
-	if (!ht(t.oneOf, n.oneOf)) {
-		n.oneOf && n.oneOf.length > 0 && o.push(z({
+	if (!_t(t.oneOf, n.oneOf)) {
+		n.oneOf && n.oneOf.length > 0 && o.push(L({
 			kind: "drop-check",
 			table: e,
 			column: t.name
 		}, "safe", `drop stale enum CHECK on ${e}.${t.name}`));
-		let r = _t(e, t);
+		let r = yt(e, t);
 		r && o.push(r);
 	}
-	if (JSON.stringify(R(t.references)) !== JSON.stringify(R(n.references)) && (n.references && o.push(z({
+	if (JSON.stringify(I(t.references)) !== JSON.stringify(I(n.references)) && (n.references && o.push(L({
 		kind: "drop-foreign-key",
 		table: e,
 		column: t.name
@@ -1050,17 +1050,17 @@ BEGIN
 			...t.references.onDelete ? { onDelete: t.references.onDelete } : {},
 			...t.references.onUpdate ? { onUpdate: t.references.onUpdate } : {}
 		};
-		r === "null" && !t.nullable ? o.push(z(i, "lossy", `add FK ${e}.${t.name} → ${n}: 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` })) : r === "null" || r === "delete" ? o.push(z({
+		r === "null" && !t.nullable ? o.push(L(i, "lossy", `add FK ${e}.${t.name} → ${n}: 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` })) : r === "null" || r === "delete" ? o.push(L({
 			...i,
 			orphanPolicy: r
-		}, "lossy", r === "delete" ? `add FK ${e}.${t.name} → ${n}: orphanPolicy 'delete' first DELETES rows whose ${t.name} points at a missing ${n}` : `add FK ${e}.${t.name} → ${n}: orphanPolicy 'null' first NULLs ${t.name} where it points at a missing ${n}`)) : o.push(z(i, "needs-backfill", `add FK ${e}.${t.name} → ${n} — existing rows must already reference a valid ${n} (else set orphanPolicy:'null'/'delete')`));
+		}, "lossy", r === "delete" ? `add FK ${e}.${t.name} → ${n}: orphanPolicy 'delete' first DELETES rows whose ${t.name} points at a missing ${n}` : `add FK ${e}.${t.name} → ${n}: orphanPolicy 'null' first NULLs ${t.name} where it points at a missing ${n}`)) : o.push(L(i, "needs-backfill", `add FK ${e}.${t.name} → ${n} — existing rows must already reference a valid ${n} (else set orphanPolicy:'null'/'delete')`));
 	}
 	return o;
-}, At = (e, t, n) => {
+}, Mt = (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(z({
+		t && o.has(t) && s.has(n) && (i.add(n), a.add(t), r.push(L({
 			kind: "rename-column",
 			table: e.tableName,
 			from: t,
@@ -1072,7 +1072,7 @@ BEGIN
 		consumedAddedNames: i,
 		consumedRemovedNames: a
 	};
-}, jt = (e) => {
+}, Nt = (e) => {
 	let t = {
 		safe: 0,
 		needsDefault: 0,
@@ -1107,37 +1107,37 @@ BEGIN
 			break;
 	}
 	return t;
-}, Mt = (e) => {
-	let t = F(e.declared, e.dialect), n = dt(e.declared, t), r = new Map(e.live.tables.map((e) => [e.name, e])), i = e.onlineAfter ?? Tt, a = [];
+}, Pt = (e) => {
+	let t = N(e.declared, e.dialect), n = pt(e.declared, t), r = new Map(e.live.tables.map((e) => [e.name, e])), i = e.onlineAfter ?? Dt, a = [];
 	for (let e of t.tables) if (!r.has(e.name)) {
-		a.push(Ct(e.name, e.columns, e.indexes, e.primaryKey));
+		a.push(Tt(e.name, e.columns, e.indexes, e.primaryKey));
 		for (let t of e.columns) {
-			let n = _t(e.name, t);
+			let n = yt(e.name, t);
 			n && a.push(n);
 		}
 	}
 	let o = new Set(e.ignoreTables ?? []);
-	for (let t of e.live.tables) n.has(t.name) || I(t.name) || o.has(t.name) || a.push(wt(t.name));
+	for (let t of e.live.tables) n.has(t.name) || P(t.name) || o.has(t.name) || a.push(Et(t.name));
 	for (let o of t.tables) {
 		let t = r.get(o.name);
 		if (!t) continue;
-		let s = n.get(o.name), c = yt(o, t), l = bt(o, t), u = At(s.table, s.columnDefs, c);
+		let s = n.get(o.name), c = xt(o, t), l = St(o, t), u = Mt(s.table, s.columnDefs, c);
 		a.push(...u.ops);
 		for (let e of c.removed) {
 			if (u.consumedRemovedNames.has(e.name)) continue;
 			let t = s.columnDefs[e.name];
-			a.push(St(o.name, e, t));
+			a.push(wt(o.name, e, t));
 		}
 		for (let e of c.added) {
 			if (u.consumedAddedNames.has(e.name)) continue;
 			let t = s.columnDefs[e.name];
-			a.push(xt(o.name, e, t));
-			let n = _t(o.name, e);
+			a.push(Ct(o.name, e, t));
+			let n = yt(o.name, e);
 			n && a.push(n);
 		}
-		for (let e of l.added) a.push(Et(o.name, e, t.rowCount, i));
-		for (let e of l.removed) a.push(Dt(o.name, e));
-		for (let { declared: n, live: r } of c.changed) a.push(...kt(o.name, n, r, e.dialect, t.rowCount, i));
+		for (let e of l.added) a.push(Ot(o.name, e, t.rowCount, i));
+		for (let e of l.removed) a.push(kt(o.name, e));
+		for (let { declared: n, live: r } of c.changed) a.push(...jt(o.name, n, r, e.dialect, t.rowCount, i));
 	}
 	let s = new Set(a.flatMap((e) => e.op.kind === "create-table" ? [e.op.table] : [])), c = new Map(t.tables.map((e) => [e.name, e])), l = (e) => {
 		let t = c.get(e);
@@ -1145,8 +1145,8 @@ BEGIN
 			column: e.name,
 			target: e.references.table
 		}] : []) : [];
-	}, u = w([...s], l), d = [];
-	for (let e of t.tables) if (s.has(e.name)) for (let t of e.columns) !t.references || !u.has(C(e.name, t.name)) || d.push(z({
+	}, u = ne([...s], l), d = [];
+	for (let e of t.tables) if (s.has(e.name)) for (let t of e.columns) !t.references || !u.has(S(e.name, t.name)) || d.push(L({
 		kind: "add-foreign-key",
 		table: e.name,
 		column: t.name,
@@ -1161,8 +1161,8 @@ BEGIN
 			let n = a[t];
 			if (n.op.kind !== "create-table") continue;
 			let r = n.op;
-			if (!r.columns.some((e) => u.has(C(r.table, e.name)))) continue;
-			let i = r.columns.map((t) => u.has(C(r.table, t.name)) ? e(t) : t);
+			if (!r.columns.some((e) => u.has(S(r.table, e.name)))) continue;
+			let i = r.columns.map((t) => u.has(S(r.table, t.name)) ? e(t) : t);
 			a[t] = {
 				...n,
 				op: {
@@ -1182,7 +1182,7 @@ BEGIN
 		let i = new Set(t).add(e), a = 0;
 		for (let t of r.columns) {
 			let n = t.references?.table;
-			n && n !== e && !u.has(C(e, t.name)) && (a = Math.max(a, m(n, i) + 1));
+			n && n !== e && !u.has(S(e, t.name)) && (a = Math.max(a, m(n, i) + 1));
 		}
 		return p.set(e, a), a;
 	}, h = (e) => e === "create-table" ? 0 : e === "drop-table" ? 2 : 1, g = (e) => {
@@ -1217,11 +1217,11 @@ BEGIN
 	});
 	return {
 		operations: v,
-		fromFingerprint: N(e.live),
-		toFingerprint: N(t),
-		summary: jt(v)
+		fromFingerprint: j(e.live),
+		toFingerprint: j(t),
+		summary: Nt(v)
 	};
-}, Nt = (e) => {
+}, Ft = (e) => {
 	let t = /[`"[]?([A-Za-z_][A-Za-z0-9_]*)[`"\]]?\s*(?:in\b|=)/i.exec(e);
 	if (!t) return null;
 	let n = [...e.matchAll(/'((?:[^']|'')*)'/g)].map((e) => e[1].replace(/''/g, "'"));
@@ -1229,7 +1229,7 @@ BEGIN
 		column: t[1],
 		values: n
 	};
-}, Pt = (e, t) => {
+}, It = (e, t) => {
 	if (t === "vector") return "vector";
 	switch (e) {
 		case "text":
@@ -1256,7 +1256,7 @@ BEGIN
 		case "USER-DEFINED": return "text";
 		default: return "text";
 	}
-}, B = (e) => {
+}, R = (e) => {
 	switch (e.toUpperCase()) {
 		case "CASCADE": return "cascade";
 		case "RESTRICT": return "restrict";
@@ -1264,25 +1264,25 @@ BEGIN
 		case "SET DEFAULT": return "noAction";
 		default: return "noAction";
 	}
-}, Ft = (e, t) => {
+}, Lt = (e, t) => {
 	let n = e !== void 0 && e !== "" ? Number(e) : NaN;
 	return Number.isInteger(n) && n > 0 ? n : t;
-}, It = () => Ft(process.env.VOLTRO_INTROSPECT_BATCH, 20), Lt = 300, Rt = () => {
+}, Rt = () => Lt(process.env.VOLTRO_INTROSPECT_BATCH, 20), zt = 300, Bt = () => {
 	let e = process.env.VOLTRO_INTROSPECT_TIMEOUT_MS;
-	return e !== void 0 && e.trim() === "0" ? 0 : Ft(e, 3e4);
-}, zt = (e, t) => {
+	return e !== void 0 && e.trim() === "0" ? 0 : Lt(e, 3e4);
+}, Vt = (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;
-}, Bt = (e) => {
-	let t = Rt(), n = d.gen(function* () {
+}, Ht = (e) => {
+	let t = Bt(), n = d.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 = It(), a = (e, t) => d.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 = Rt(), a = (e, t) => d.gen(function* () {
 			let r = [];
-			for (let a of zt(e, i)) a.length !== 0 && r.push(...yield* t(n(a)));
+			for (let a of Vt(e, i)) a.length !== 0 && r.push(...yield* t(n(a)));
 			return r;
 		}), o = [];
-		for (let t = 0;; t += Lt) {
+		for (let t = 0;; t += zt) {
 			let n = yield* e`
         SELECT c.relname AS table_name,
                COALESCE(c.reltuples::bigint, 0) AS row_count
@@ -1290,9 +1290,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(Lt)} OFFSET ${r(t)}
+        LIMIT ${r(zt)} OFFSET ${r(t)}
       `;
-			if (o.push(...n), n.length < Lt) break;
+			if (o.push(...n), n.length < zt) 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));
@@ -1377,7 +1377,7 @@ BEGIN
           AND c.relname IN ${t}
       )
       SELECT * FROM ix ORDER BY table_name, index_name, position
-    `), _ = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map();
+    `), _ = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), x = /* @__PURE__ */ new Map();
 		for (let e of u) {
 			let t = _.get(e.table_name);
 			t || (t = [], _.set(e.table_name, t)), t.push(e);
@@ -1386,25 +1386,25 @@ BEGIN
 			let t = v.get(e.table_name);
 			t || (t = /* @__PURE__ */ new Set(), v.set(e.table_name, t)), t.add(e.column_name);
 		}
-		let C = /* @__PURE__ */ new Map();
+		let S = /* @__PURE__ */ new Map();
 		for (let e of p) {
-			let t = `${e.table_name}${e.constraint_name}`, n = C.get(t);
+			let t = `${e.table_name}${e.constraint_name}`, n = S.get(t);
 			n || (n = {
 				table: e.table_name,
 				columns: []
-			}, C.set(t, n)), n.columns.push({
+			}, S.set(t, n)), n.columns.push({
 				name: e.column_name,
 				position: e.position
 			});
 		}
-		for (let [e, t] of C) {
+		for (let [e, t] of S) {
 			let n = [...t.columns].sort((e, t) => e.position - t.position).map((e) => e.name);
 			if (n.length === 1) {
-				let e = y.get(t.table);
-				e || (e = /* @__PURE__ */ new Set(), y.set(t.table, e)), e.add(n[0]);
+				let e = te.get(t.table);
+				e || (e = /* @__PURE__ */ new Set(), te.set(t.table, e)), e.add(n[0]);
 			} else {
-				let r = b.get(t.table);
-				r || (r = [], b.set(t.table, r)), r.push({
+				let r = y.get(t.table);
+				r || (r = [], y.set(t.table, r)), r.push({
 					name: e.slice(e.indexOf("\0") + 1),
 					table: t.table,
 					columns: n,
@@ -1413,23 +1413,23 @@ BEGIN
 			}
 		}
 		for (let e of g) {
-			let t = x.get(e.source_table);
-			t || (t = [], x.set(e.source_table, t)), t.push(e);
+			let t = b.get(e.source_table);
+			t || (t = [], b.set(e.source_table, t)), t.push(e);
 		}
 		for (let e of ee) {
-			let t = S.get(e.table_name);
-			t || (t = /* @__PURE__ */ new Map(), S.set(e.table_name, t));
+			let t = x.get(e.table_name);
+			t || (t = /* @__PURE__ */ new Map(), x.set(e.table_name, t));
 			let n = t.get(e.index_name);
 			n || (n = [], t.set(e.index_name, n)), n.push(e);
 		}
-		let w = [];
+		let ne = [];
 		for (let e of c) {
-			let t = /* @__PURE__ */ new Set(), n = (_.get(e.table_name) ?? []).filter((e) => t.has(e.column_name) ? !1 : (t.add(e.column_name), !0)), r = v.get(e.table_name) ?? /* @__PURE__ */ new Set(), i = y.get(e.table_name) ?? /* @__PURE__ */ new Set(), a = x.get(e.table_name) ?? [], o = new Map(a.map((e) => [e.source_column, e])), s = new Set(n.filter((e) => e.udt_name === "tsvector").map((e) => e.column_name)), c = n.filter((e) => !s.has(e.column_name)).map((t) => {
-				let n = r.has(t.column_name) && r.size === 1, a = o.get(t.column_name), s = a ? "reference" : n && t.column_name === "id" ? "id" : Pt(t.data_type, t.udt_name), c = a ? {
+			let t = /* @__PURE__ */ new Set(), n = (_.get(e.table_name) ?? []).filter((e) => t.has(e.column_name) ? !1 : (t.add(e.column_name), !0)), r = v.get(e.table_name) ?? /* @__PURE__ */ new Set(), i = te.get(e.table_name) ?? /* @__PURE__ */ new Set(), a = b.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" : It(t.data_type, t.udt_name), c = a ? {
 					table: a.target_table,
 					column: a.target_column,
-					onDelete: B(a.delete_rule),
-					onUpdate: B(a.update_rule)
+					onDelete: R(a.delete_rule),
+					onUpdate: R(a.update_rule)
 				} : void 0, l = h.get(`${e.table_name}.${t.column_name}`);
 				return {
 					name: t.column_name,
@@ -1441,7 +1441,7 @@ BEGIN
 					...c ? { references: c } : {},
 					...l ? { oneOf: l } : {}
 				};
-			}), l = [], u = S.get(e.table_name);
+			}), l = [], u = x.get(e.table_name);
 			if (u) for (let [t, n] of u) {
 				let r = /* @__PURE__ */ new Set(), i = [...n].filter((e) => e.column_name !== null && e.position !== null).sort((e, t) => (e.position ?? 0) - (t.position ?? 0)).filter((e) => {
 					let t = e.position;
@@ -1457,7 +1457,7 @@ BEGIN
 					...a ? { expression: !0 } : {}
 				});
 			}
-			for (let t of b.get(e.table_name) ?? []) l.push(t);
+			for (let t of y.get(e.table_name) ?? []) l.push(t);
 			r.size > 0 && l.push({
 				name: `${e.table_name}_pkey`,
 				table: e.table_name,
@@ -1465,20 +1465,20 @@ BEGIN
 				unique: !0
 			});
 			let d = Number(e.row_count ?? 0);
-			w.push({
+			ne.push({
 				name: e.table_name,
 				columns: c,
 				indexes: l,
 				...d > 0 ? { rowCount: d } : {}
 			});
 		}
-		return { tables: w };
+		return { tables: ne };
 	});
 	return (t > 0 ? e.withTransaction(n) : n).pipe(d.catchAll((e) => {
 		let n = `${String(e)} ${String(e.cause ?? "")}`.toLowerCase();
 		return n.includes("statement timeout") || n.includes("57014") ? d.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.`)) : d.fail(e);
 	}));
-}, Vt = (e, t) => {
+}, Ut = (e, t) => {
 	switch (e.toLowerCase()) {
 		case "varchar":
 		case "char":
@@ -1510,20 +1510,20 @@ BEGIN
 		case "json": return "json";
 		default: return "text";
 	}
-}, V = (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;
-}), Ht = (e) => d.gen(function* () {
-	let t = V(yield* e`
+}), Wt = (e) => d.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 = V(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
       FROM information_schema.columns
       WHERE table_schema = DATABASE()
-      ORDER BY table_name, ordinal_position`), r = V(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,
@@ -1533,11 +1533,11 @@ 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 = V(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 = V(yield* e`
+      ORDER BY table_name, index_name, seq_in_index`), a = z(yield* e`
       SELECT table_name, check_clause
       FROM information_schema.check_constraints
       WHERE constraint_schema = DATABASE()`.unprepared.pipe(d.orElseSucceed(() => []))), o = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map();
@@ -1547,7 +1547,7 @@ BEGIN
 			o.add(`${e.table_name}.${t[1]}`);
 			continue;
 		}
-		let n = Nt(e.check_clause);
+		let n = Ft(e.check_clause);
 		n && s.set(`${e.table_name}.${n.column}`, n.values);
 	}
 	let c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
@@ -1570,11 +1570,11 @@ BEGIN
 		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(), d = u.get(e.table_name);
 		if (d) for (let e of d.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" : Vt(t.data_type, t.column_type), u = c ? {
+			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" : Ut(t.data_type, t.column_type), u = c ? {
 				table: c.target_table,
 				column: c.target_column,
-				onDelete: B(c.delete_rule),
-				onUpdate: B(c.update_rule)
+				onDelete: R(c.delete_rule),
+				onUpdate: R(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}`);
 			return {
 				name: t.column_name,
@@ -1611,10 +1611,10 @@ BEGIN
 		});
 	}
 	return { tables: f };
-}), Ut = (e) => {
+}), Gt = (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";
-}, Wt = (e) => d.gen(function* () {
+}, Kt = (e) => d.gen(function* () {
 	let t = yield* e`
       SELECT name, sql FROM sqlite_master
       WHERE type = 'table' AND name NOT LIKE 'sqlite_%'
@@ -1631,11 +1631,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" : Ut(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" : Gt(e.type), a = r ? {
 				table: r.table,
 				column: r.to,
-				onDelete: B(r.on_delete),
-				onUpdate: B(r.on_update)
+				onDelete: R(r.on_delete),
+				onUpdate: R(r.on_update)
 			} : void 0, o = t.get(e.name);
 			return {
 				name: e.name,
@@ -1670,7 +1670,7 @@ BEGIN
 		});
 	}
 	return { tables: r };
-}), Gt = (e) => {
+}), qt = (e) => {
 	switch (e.toLowerCase()) {
 		case "int":
 		case "smallint":
@@ -1692,7 +1692,7 @@ BEGIN
 		case "image": return "bytes";
 		default: return "text";
 	}
-}, H = (e) => e === !0 || e === 1, Kt = (e) => d.gen(function* () {
+}, B = (e) => e === !0 || e === 1, Jt = (e) => d.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`
@@ -1748,16 +1748,16 @@ BEGIN
 		let t = s.get(e) ?? [], n = c.get(e) ?? [], r = new Map(n.map((e) => [e.source_column, e])), i = new Set(n.map((e) => e.source_column)), a = l.get(e), d = [], f = /* @__PURE__ */ new Set();
 		if (a) for (let [, e] of a) {
 			let t = [...e].sort((e, t) => e.key_ordinal - t.key_ordinal);
-			if (H(t[0].is_primary)) for (let e of t) d.push(e.column_name);
-			else H(t[0].is_unique) && t.length === 1 && f.add(t[0].column_name);
+			if (B(t[0].is_primary)) for (let e of t) d.push(e.column_name);
+			else B(t[0].is_unique) && t.length === 1 && f.add(t[0].column_name);
 		}
 		let p = t.map((t) => {
-			let n = d.length === 1 && d[0] === t.column_name, i = r.get(t.column_name), a = i ? "reference" : n && t.column_name === "id" ? "id" : Gt(t.data_type), s = i ? {
+			let n = d.length === 1 && d[0] === t.column_name, i = r.get(t.column_name), a = i ? "reference" : n && t.column_name === "id" ? "id" : qt(t.data_type), s = i ? {
 				table: i.target_table,
 				column: i.target_column,
-				onDelete: qt(i.delete_rule),
-				onUpdate: qt(i.update_rule)
-			} : void 0, c = t.column_default === null ? null : Jt(t.column_default), l = o.get(`${e}.${t.column_name}`);
+				onDelete: Yt(i.delete_rule),
+				onUpdate: Yt(i.update_rule)
+			} : void 0, c = t.column_default === null ? null : Xt(t.column_default), l = o.get(`${e}.${t.column_name}`);
 			return {
 				name: t.column_name,
 				type: a,
@@ -1771,11 +1771,11 @@ BEGIN
 		}), m = [];
 		if (a) for (let [t, n] of a) {
 			let r = [...n].sort((e, t) => e.key_ordinal - t.key_ordinal);
-			H(r[0].is_primary) || r.length === 1 && H(r[0].is_unique) || r.length === 1 && !H(r[0].is_unique) && i.has(r[0].column_name) && t !== `${e}_${r[0].column_name}_idx` || m.push({
+			B(r[0].is_primary) || r.length === 1 && B(r[0].is_unique) || r.length === 1 && !B(r[0].is_unique) && i.has(r[0].column_name) && t !== `${e}_${r[0].column_name}_idx` || m.push({
 				name: t,
 				table: e,
 				columns: r.map((e) => e.column_name),
-				unique: H(r[0].is_unique)
+				unique: B(r[0].is_unique)
 			});
 		}
 		d.length > 0 && m.push({
@@ -1790,37 +1790,37 @@ BEGIN
 		});
 	}
 	return { tables: u };
-}), qt = (e) => {
+}), Yt = (e) => {
 	switch (e.toUpperCase().replace(/_/g, " ")) {
 		case "CASCADE": return "cascade";
 		case "SET NULL": return "setNull";
 		case "SET DEFAULT": return "noAction";
 		default: return "noAction";
 	}
-}, Jt = (e) => {
+}, Xt = (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;
-}, Yt = (e) => e.onDialectOrElse({
-	mysql: () => Ht(e),
-	mssql: () => Kt(e),
-	sqlite: () => Wt(e),
-	orElse: () => Bt(e)
-}), Xt = (e, t) => `${t}(${e.precision ?? 38}, ${e.scale ?? 0})`, Zt = (e, t) => {
+}, V = (e) => e.onDialectOrElse({
+	mysql: () => Wt(e),
+	mssql: () => Jt(e),
+	sqlite: () => Kt(e),
+	orElse: () => Ht(e)
+}), Zt = (e, t) => `${t}(${e.precision ?? 38}, ${e.scale ?? 0})`, H = (e, t) => {
 	if (!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 O(e, t);
+	return E(e, t);
+}, U = (e) => {
+	let t = H(e, "postgres");
+	return t === void 0 ? Qt(e) : t;
 }, Qt = (e) => {
-	let t = Zt(e, "postgres");
-	return t === void 0 ? $t(e) : t;
-}, $t = (e) => {
 	switch (e.type) {
 		case "id": return "text";
 		case "text": return "text";
 		case "integer": return "integer";
 		case "real": return "double precision";
-		case "decimal": return Xt(e, "NUMERIC");
+		case "decimal": return Zt(e, "NUMERIC");
 		case "bigint": return "bigint";
 		case "boolean": return "boolean";
 		case "timestamp": return "timestamptz";
@@ -1834,15 +1834,15 @@ BEGIN
 		case "interval": return "interval";
 		case "raw": return e.rawDdl ?? "text";
 	}
-}, en = (e) => {
-	let t = Zt(e, "mariadb");
+}, W = (e) => {
+	let t = H(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 Xt(e, "DECIMAL");
+		case "decimal": return Zt(e, "DECIMAL");
 		case "bigint": return "BIGINT";
 		case "boolean": return "TINYINT(1)";
 		case "timestamp": return "DATETIME(6)";
@@ -1856,57 +1856,57 @@ BEGIN
 		case "interval": return "BIGINT";
 		case "raw": return e.rawDdl ?? "LONGTEXT";
 	}
-}, U = (e) => `"${e}"`, W = (e) => `\`${e.replace(/`/g, "``")}\``, tn = (e, t) => `ALTER TABLE ${t(e.table)} DROP COLUMN IF EXISTS ${t(e.column)};`, nn = (e) => `ALTER TABLE ${W(e.table)} DROP COLUMN IF EXISTS ${W(e.column)}, ALGORITHM=COPY;`, rn = (e, t) => `ALTER TABLE ${t(e.table)} RENAME COLUMN ${t(e.from)} TO ${t(e.to)};`, an = (e, t, n) => `ALTER TABLE ${n(e.table)} RENAME COLUMN ${n(e.column)} TO ${n(`${e.column}${On(t)}`)};`, on = (e, t, n) => e.hasDefault && e.defaultValue !== void 0 ? `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} SET ${sn(e, n)};` : `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} DROP DEFAULT;`, sn = (e, t) => {
+}, G = (e) => `"${e}"`, K = (e) => `\`${e.replace(/`/g, "``")}\``, $t = (e, t) => `ALTER TABLE ${t(e.table)} DROP COLUMN IF EXISTS ${t(e.column)};`, en = (e) => `ALTER TABLE ${K(e.table)} DROP COLUMN IF EXISTS ${K(e.column)}, ALGORITHM=COPY;`, tn = (e, t) => `ALTER TABLE ${t(e.table)} RENAME COLUMN ${t(e.from)} TO ${t(e.to)};`, nn = (e, t, n) => `ALTER TABLE ${n(e.table)} RENAME COLUMN ${n(e.column)} TO ${n(`${e.column}${On(t)}`)};`, rn = (e, t, n) => e.hasDefault && e.defaultValue !== void 0 ? `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} SET ${an(e, n)};` : `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} DROP DEFAULT;`, an = (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;
-}, G = (e, t, n) => e.find((e) => e.tableName === t)?.fields[n], cn = (e, t, n) => {
-	let r = G(e, t, n);
-	return r ? et(n, r) : void 0;
-}, ln = (e, t, n) => {
-	let r = n ?? e.nullable, i = _e(e, "mariadb");
+}, q = (e, t, n) => e.find((e) => e.tableName === t)?.fields[n], on = (e, t, n) => {
+	let r = q(e, t, n);
+	return r ? nt(n, r) : void 0;
+}, sn = (e, t, n) => {
+	let r = n ?? e.nullable, i = ye(e, "mariadb");
 	return [
-		W(t),
-		O(e, "mariadb"),
+		K(t),
+		E(e, "mariadb"),
 		r ? null : "NOT NULL",
 		i
 	].filter(Boolean).join(" ");
-}, un = (e, t) => e == null ? null : Array.isArray(e) ? dn(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" ? k(e, "mysql") : null, dn = (e, t, n) => ve(e, t ?? { type: "json" }, n), fn = (e, t) => e == null ? null : Array.isArray(e) ? dn(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" ? k(e, "postgres") : null, K = (e, t) => {
+}, cn = (e, t) => e == null ? null : Array.isArray(e) ? ln(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" ? D(e, "mysql") : null, ln = (e, t, n) => be(e, t ?? { type: "json" }, n), un = (e, t) => e == null ? null : Array.isArray(e) ? ln(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" ? D(e, "postgres") : null, J = (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"}`;
-}, pn = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return A(e.name, "postgres");
-	let t = K(e, "postgres");
-	if (t) return `${U(e.name)} ${Qt(e)} ${t}`;
-	let n = [U(e.name), Qt(e)];
+}, dn = (e) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return O(e.name, "postgres");
+	let t = J(e, "postgres");
+	if (t) return `${G(e.name)} ${U(e)} ${t}`;
+	let n = [G(e.name), U(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 = fn(e.defaultValue, e);
+		let t = un(e.defaultValue, e);
 		t && n.push(t);
 	}
-	return e.references && (n.push(`REFERENCES ${U(e.references.table)} (${U(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${{
+	return e.references && (n.push(`REFERENCES ${G(e.references.table)} (${G(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(" ");
-}, q = (e, t) => e.primaryKey && e.primaryKey.length > 0 ? `,\n  PRIMARY KEY (${e.primaryKey.map(t).join(", ")})` : "", mn = (e) => {
-	let t = e.columns.map((e) => `  ${pn(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${U(e.table)} (\n${t}${q(e, U)}\n)`];
-	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${U(t.name)} ON ${U(e.table)} (${t.columns.map(Nn).join(", ")})`);
+}, fn = (e, t) => e.primaryKey && e.primaryKey.length > 0 ? `,\n  PRIMARY KEY (${e.primaryKey.map(t).join(", ")})` : "", pn = (e) => {
+	let t = e.columns.map((e) => `  ${dn(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${t}${fn(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(Nn).join(", ")})`);
 	return n;
-}, hn = 191, J = (e) => {
-	let t = en(e).toUpperCase();
+}, mn = 191, hn = (e) => {
+	let t = W(e).toUpperCase();
 	return t.endsWith("TEXT") || t.endsWith("BLOB");
 }, gn = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return A(e.name, "mariadb");
-	let t = K(e, "mariadb");
-	if (t) return `${W(e.name)} ${en(e)} ${t}`;
-	let n = [W(e.name), en(e)];
-	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && !J(e) && n.push("UNIQUE"), e.hasDefault) {
-		let t = un(e.defaultValue, e);
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return O(e.name, "mariadb");
+	let t = J(e, "mariadb");
+	if (t) return `${K(e.name)} ${W(e)} ${t}`;
+	let n = [K(e.name), W(e)];
+	if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && !hn(e) && n.push("UNIQUE"), e.hasDefault) {
+		let t = cn(e.defaultValue, e);
 		t && n.push(t);
 	}
-	return e.references && (n.push(`REFERENCES ${W(e.references.table)} (${W(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${{
+	return e.references && (n.push(`REFERENCES ${K(e.references.table)} (${K(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${{
 		cascade: "CASCADE",
 		restrict: "RESTRICT",
 		setNull: "SET NULL",
@@ -1915,10 +1915,10 @@ BEGIN
 }, _n = (e) => {
 	let t = new Map(e.columns.map((e) => [e.name, e])), n = (e) => {
 		let n = t.get(e);
-		return n && J(n) ? `${W(e)}(${hn})` : W(e);
-	}, r = e.columns.map((e) => `  ${gn(e)}`).join(",\n"), i = [`CREATE TABLE IF NOT EXISTS ${W(e.table)} (\n${r}${q(e, n)}\n)`];
-	for (let t of e.columns) t.unique && t.type !== "id" && J(t) && i.push(`CREATE UNIQUE INDEX IF NOT EXISTS ${W(`${e.table}_${t.name}_key`)} ON ${W(e.table)} (${n(t.name)})`);
-	for (let t of e.indexes) t.name !== `${e.table}_pkey` && i.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${W(t.name)} ON ${W(e.table)} (${t.columns.map(n).join(", ")})`);
+		return n && hn(n) ? `${K(e)}(${mn})` : K(e);
+	}, r = e.columns.map((e) => `  ${gn(e)}`).join(",\n"), i = [`CREATE TABLE IF NOT EXISTS ${K(e.table)} (\n${r}${fn(e, n)}\n)`];
+	for (let t of e.columns) t.unique && t.type !== "id" && hn(t) && i.push(`CREATE UNIQUE INDEX IF NOT EXISTS ${K(`${e.table}_${t.name}_key`)} ON ${K(e.table)} (${n(t.name)})`);
+	for (let t of e.indexes) t.name !== `${e.table}_pkey` && i.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${K(t.name)} ON ${K(e.table)} (${t.columns.map(n).join(", ")})`);
 	return i;
 }, vn = {
 	cascade: "CASCADE",
@@ -1931,7 +1931,7 @@ BEGIN
 	setNull: "SET NULL",
 	noAction: "NO ACTION"
 }, bn = (e) => {
-	let t = Zt(e, "sqlite");
+	let t = H(e, "sqlite");
 	if (t !== void 0) return t;
 	switch (e.type) {
 		case "integer":
@@ -1942,28 +1942,28 @@ BEGIN
 		case "bytes": return "BLOB";
 		default: return "TEXT";
 	}
-}, Y = (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" ? k(e, "sqlite") : null, xn = (e) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return A(e.name, "sqlite");
-	let t = K(e, "sqlite");
-	if (t) return `${U(e.name)} ${bn(e)} ${t}`;
-	let n = [U(e.name), bn(e)];
+}, Y = (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" ? D(e, "sqlite") : null, xn = (e) => {
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return O(e.name, "sqlite");
+	let t = J(e, "sqlite");
+	if (t) return `${G(e.name)} ${bn(e)} ${t}`;
+	let n = [G(e.name), bn(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 = Y(e.defaultValue, "CURRENT_TIMESTAMP");
 		t && n.push(t);
 	}
-	if (e.references && (n.push(`REFERENCES ${U(e.references.table)} (${U(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${vn[e.references.onDelete]}`)), e.oneOf && e.oneOf.length > 0) {
+	if (e.references && (n.push(`REFERENCES ${G(e.references.table)} (${G(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${vn[e.references.onDelete]}`)), e.oneOf && e.oneOf.length > 0) {
 		let t = e.oneOf.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ");
-		n.push(`CHECK (${U(e.name)} IN (${t}))`);
+		n.push(`CHECK (${G(e.name)} IN (${t}))`);
 	}
 	return n.join(" ");
 }, Sn = (e) => {
-	let t = e.columns.map((e) => `  ${xn(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${U(e.table)} (\n${t}${q(e, U)}\n)`];
-	for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${U(t.name)} ON ${U(e.table)} (${t.columns.map(U).join(", ")})`);
+	let t = e.columns.map((e) => `  ${xn(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${t}${fn(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(", ")})`);
 	return n;
 }, X = (e, t) => {
 	let n = t.find((t) => t.tableName === e);
 	if (!n) return [];
-	let r = F([n]).tables[0], i = `${e}__voltro_rebuild`, a = r.columns.map((e) => U(e.name)).join(", "), o = [
+	let r = N([n]).tables[0], i = `${e}__voltro_rebuild`, a = r.columns.map((e) => G(e.name)).join(", "), o = [
 		...Sn({
 			kind: "create-table",
 			table: i,
@@ -1971,15 +1971,15 @@ BEGIN
 			indexes: [],
 			...r.primaryKey ? { primaryKey: r.primaryKey } : {}
 		}),
-		`INSERT INTO ${U(i)} (${a}) SELECT ${a} FROM ${U(e)}`,
-		`DROP TABLE ${U(e)}`,
-		`ALTER TABLE ${U(i)} RENAME TO ${U(e)}`
+		`INSERT INTO ${G(i)} (${a}) SELECT ${a} FROM ${G(e)}`,
+		`DROP TABLE ${G(e)}`,
+		`ALTER TABLE ${G(i)} RENAME TO ${G(e)}`
 	];
-	for (let t of r.indexes) t.name !== `${e}_pkey` && o.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${U(t.name)} ON ${U(e)} (${t.columns.map(U).join(", ")})`);
+	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(", ")})`);
 	return o;
 }, Cn = (e, t, n, r) => {
 	let i = r ?? e.nullable;
-	return `ALTER TABLE ${Z(n)} ALTER COLUMN ${Z(t)} ${O(e, "mssql")} ${i ? "NULL" : "NOT NULL"};`;
+	return `ALTER TABLE ${Z(n)} ALTER COLUMN ${Z(t)} ${E(e, "mssql")} ${i ? "NULL" : "NOT NULL"};`;
 }, wn = (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 ${Z(e.table)} DROP CONSTRAINT [' + @dc + ']');`;
 	if (!e.hasDefault) return t;
@@ -1988,14 +1988,14 @@ BEGIN
 	let r = n.replace(/^DEFAULT\s+/i, "");
 	return `${t} ALTER TABLE ${Z(e.table)} ADD DEFAULT ${r} FOR ${Z(e.column)};`;
 }, Z = (e) => `[${e.replace(/]/g, "]]")}]`, Tn = (e) => {
-	let t = Zt(e, "mssql");
+	let t = H(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 Xt(e, "DECIMAL");
+		case "decimal": return Zt(e, "DECIMAL");
 		case "bigint": return "BIGINT";
 		case "boolean": return "BIT";
 		case "timestamp": return "DATETIME2(6)";
@@ -2004,8 +2004,8 @@ BEGIN
 		default: return "NVARCHAR(MAX)";
 	}
 }, En = (e, t) => {
-	if (e.type === "id" && e.idScheme?.kind === "numeric") return A(e.name, "mssql");
-	let n = e.type === "text" && t?.has(e.name) ? "NVARCHAR(450)" : Tn(e), r = K(e, "mssql");
+	if (e.type === "id" && e.idScheme?.kind === "numeric") return O(e.name, "mssql");
+	let n = e.type === "text" && t?.has(e.name) ? "NVARCHAR(450)" : Tn(e), r = J(e, "mssql");
 	if (r) return `${Z(e.name)} ${r}`;
 	let i = [Z(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) {
@@ -2014,7 +2014,7 @@ BEGIN
 	}
 	return e.references && (i.push(`REFERENCES ${Z(e.references.table)} (${Z(e.references.column)})`), e.references.onDelete && i.push(`ON DELETE ${yn[e.references.onDelete]}`)), i.join(" ");
 }, Dn = (e) => {
-	let t = (e) => e.replace(/'/g, "''"), n = new Set(e.indexes.flatMap((e) => e.columns)), r = e.columns.map((e) => `  ${En(e, n)}`).join(",\n"), i = `CREATE TABLE ${Z(e.table)} (\n${r}${q(e, Z)}\n)`, a = [`IF OBJECT_ID(N'${t(e.table)}', N'U') IS NULL EXEC(N'${t(i)}')`];
+	let t = (e) => e.replace(/'/g, "''"), n = new Set(e.indexes.flatMap((e) => e.columns)), r = e.columns.map((e) => `  ${En(e, n)}`).join(",\n"), i = `CREATE TABLE ${Z(e.table)} (\n${r}${fn(e, Z)}\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 ${Z(n.name)} ON ${Z(e.table)} (${n.columns.map(Z).join(", ")})`;
@@ -2025,9 +2025,9 @@ BEGIN
 	let r = `${e.table}${On(t)}`;
 	return `ALTER TABLE ${n(e.table)} RENAME TO ${n(r)};`;
 }, jn = (e, t, n) => {
-	let r = G(e, t, n);
-	return r ? J({ type: r.type }) : !1;
-}, Mn = (e, t, n) => jn(e, t, n) ? `${W(n)}(${hn})` : W(n), Nn = (e) => e.startsWith("(") ? e : U(e), Pn = (e, t) => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${t ? "CONCURRENTLY " : ""}IF NOT EXISTS ${U(e.index.name)} ON ${U(e.table)} (${e.index.columns.map(Nn).join(", ")});`, Fn = (e, t) => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${W(e.index.name)} ON ${W(e.table)} (${e.index.columns.map((n) => Mn(t, e.table, n)).join(", ")});`, In = (e) => `DROP INDEX IF EXISTS ${U(e.index)};`, Ln = (e) => `DROP INDEX ${W(e.index)} ON ${W(e.table)};`, Rn = (e) => `DROP INDEX IF EXISTS ${Z(e.index)} ON ${Z(e.table)};`, zn = (e) => {
+	let r = q(e, t, n);
+	return r ? hn({ type: r.type }) : !1;
+}, Mn = (e, t, n) => jn(e, t, n) ? `${K(n)}(${mn})` : K(n), Nn = (e) => e.startsWith("(") ? e : G(e), Pn = (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(Nn).join(", ")});`, Fn = (e, t) => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${K(e.index.name)} ON ${K(e.table)} (${e.index.columns.map((n) => Mn(t, e.table, n)).join(", ")});`, In = (e) => `DROP INDEX IF EXISTS ${G(e.index)};`, Ln = (e) => `DROP INDEX ${K(e.index)} ON ${K(e.table)};`, Rn = (e) => `DROP INDEX IF EXISTS ${Z(e.index)} ON ${Z(e.table)};`, zn = (e) => {
 	let t = (e) => e.replace(/'/g, "''"), n = `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${Z(e.index.name)} ON ${Z(e.table)} (${e.index.columns.map(Z).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)}');`;
 }, Bn = (e, t, n) => {
@@ -2039,13 +2039,13 @@ BEGIN
 		t && t.type === "text" && !t.generatedAs && i.push(`ALTER TABLE ${Z(e)} ALTER COLUMN ${Z(n)} NVARCHAR(450) ${t.nullable ? "NULL" : "NOT NULL"};`);
 	}
 	return i;
-}, Vn = (e) => `ALTER TABLE ${U(e.table)} ADD CONSTRAINT ${U(`${e.table}_${e.column}_key`)} UNIQUE (${U(e.column)});`, Hn = (e, t) => `ALTER TABLE ${W(e.table)} ADD CONSTRAINT ${W(`${e.table}_${e.column}_key`)} UNIQUE (${Mn(t, e.table, e.column)});`, Un = (e) => {
-	let t = e.fields.map((e) => U(e)).join(", ");
-	return `ALTER TABLE ${U(e.table)} ADD CONSTRAINT ${U(e.name)} UNIQUE (${t});`;
+}, Vn = (e) => `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(`${e.table}_${e.column}_key`)} UNIQUE (${G(e.column)});`, Hn = (e, t) => `ALTER TABLE ${K(e.table)} ADD CONSTRAINT ${K(`${e.table}_${e.column}_key`)} UNIQUE (${Mn(t, e.table, e.column)});`, Un = (e) => {
+	let t = e.fields.map((e) => G(e)).join(", ");
+	return `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(e.name)} UNIQUE (${t});`;
 }, Wn = (e, t) => {
 	let n = e.fields.map((n) => Mn(t, e.table, n)).join(", ");
-	return `ALTER TABLE ${W(e.table)} ADD CONSTRAINT ${W(e.name)} UNIQUE (${n});`;
-}, Gn = (e) => `ALTER TABLE ${U(e.table)} DROP CONSTRAINT IF EXISTS ${U(e.name)};`, Kn = (e) => `ALTER TABLE ${W(e.table)} DROP INDEX ${W(e.name)};`, qn = (e) => `ALTER TABLE ${U(e.table)} DROP CONSTRAINT IF EXISTS ${U(`${e.table}_${e.column}_key`)};`, Jn = (e) => `ALTER TABLE ${W(e.table)} DROP INDEX ${W(`${e.table}_${e.column}_key`)};`, Yn = (e, t) => {
+	return `ALTER TABLE ${K(e.table)} ADD CONSTRAINT ${K(e.name)} UNIQUE (${n});`;
+}, Gn = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(e.name)};`, Kn = (e) => `ALTER TABLE ${K(e.table)} DROP INDEX ${K(e.name)};`, qn = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_key`)};`, Jn = (e) => `ALTER TABLE ${K(e.table)} DROP INDEX ${K(`${e.table}_${e.column}_key`)};`, Yn = (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})`;
@@ -2063,11 +2063,11 @@ BEGIN
 		setNull: "SET NULL",
 		noAction: "NO ACTION"
 	}[e.onDelete]}`), n.push(s.join(" ") + ";"), n;
-}, Xn = (e) => `ALTER TABLE ${U(e.table)} DROP CONSTRAINT IF EXISTS ${U(`${e.table}_${e.column}_fkey`)};`, Zn = (e) => `ALTER TABLE ${W(e.table)} DROP FOREIGN KEY ${W(`${e.table}_${e.column}_fkey`)};`, Qn = (e, t) => {
+}, Xn = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_fkey`)};`, Zn = (e) => `ALTER TABLE ${K(e.table)} DROP FOREIGN KEY ${K(`${e.table}_${e.column}_fkey`)};`, Qn = (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}));`;
-}, $n = (e) => `ALTER TABLE ${U(e.table)} DROP CONSTRAINT IF EXISTS ${U(`${e.table}_${e.column}_check`)};`, er = (e) => `ALTER TABLE ${W(e.table)} DROP CHECK ${W(`${e.table}_${e.column}_check`)};`, tr = (e, t, n, r) => {
-	let i = e.column, a = r === "mariadb", o = a ? W : r === "mssql" ? Z : U, s = a ? en(i) : r === "mssql" ? Tn(i) : r === "sqlite" ? bn(i) : Qt(i), c = r === "mssql" ? "ADD" : "ADD COLUMN", l = (e) => a ? un(e, i) : r === "mssql" ? Y(e, "SYSUTCDATETIME()") : r === "sqlite" ? Y(e, "CURRENT_TIMESTAMP") : fn(e, i), u = K(i, r);
+}, $n = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_check`)};`, er = (e) => `ALTER TABLE ${K(e.table)} DROP CHECK ${K(`${e.table}_${e.column}_check`)};`, tr = (e, t, n, r) => {
+	let i = e.column, a = r === "mariadb", o = a ? K : r === "mssql" ? Z : G, s = a ? W(i) : r === "mssql" ? Tn(i) : r === "sqlite" ? bn(i) : U(i), c = r === "mssql" ? "ADD" : "ADD COLUMN", l = (e) => a ? cn(e, i) : r === "mssql" ? Y(e, "SYSUTCDATETIME()") : r === "sqlite" ? Y(e, "CURRENT_TIMESTAMP") : un(e, i), u = J(i, r);
 	if (u) {
 		let t = r === "mssql" ? `${o(i.name)} ${u}` : `${o(i.name)} ${s} ${u}`;
 		return {
@@ -2117,7 +2117,10 @@ BEGIN
 	};
 }, Q = (e, t, n) => e.unsafe(t).pipe(d.tapError((e) => d.sync(() => {
 	process.stderr.write(_(`applier: statement failed (op=${n})`, t, e, 400));
-})), d.map(() => void 0)), $ = (e, t, n) => d.forEach(t, (t) => Q(e, t, n), { discard: !0 }), rr = (e, t, n) => d.gen(function* () {
+})), d.mapError((e) => {
+	let r = _(`applier: statement failed (op=${n})`, t, e, 400).trim();
+	return Object.assign(e, { message: r });
+}), d.map(() => void 0)), $ = (e, t, n) => d.forEach(t, (t) => Q(e, t, n), { discard: !0 }), rr = (e, t, n) => d.gen(function* () {
 	let r = process.hrtime.bigint(), i = nr(n.declared), a = t.op;
 	switch (a.kind) {
 		case "create-table": {
@@ -2125,7 +2128,7 @@ BEGIN
 				mysql: () => d.succeed(_n(a)),
 				mssql: () => d.succeed(Dn(a)),
 				sqlite: () => d.succeed(Sn(a)),
-				orElse: () => d.succeed(mn(a))
+				orElse: () => d.succeed(pn(a))
 			});
 			for (let n of t) yield* Q(e, n, a.kind);
 			break;
@@ -2133,24 +2136,24 @@ BEGIN
 		case "drop-table": {
 			let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString(), r = (e) => t ? An(a, n, e) : kn(a, e);
 			yield* e.onDialectOrElse({
-				mysql: () => Q(e, r(W), a.kind),
-				orElse: () => Q(e, r(U), a.kind)
+				mysql: () => Q(e, r(K), a.kind),
+				orElse: () => Q(e, r(G), a.kind)
 			});
 			break;
 		}
 		case "drop-column": {
 			let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString();
 			yield* e.onDialectOrElse({
-				mysql: () => Q(e, t ? an(a, n, W) : nn(a), a.kind),
-				orElse: () => Q(e, t ? an(a, n, U) : tn(a, U), a.kind)
+				mysql: () => Q(e, t ? nn(a, n, K) : en(a), a.kind),
+				orElse: () => Q(e, t ? nn(a, n, G) : $t(a, G), a.kind)
 			});
 			break;
 		}
 		case "rename-column":
 			yield* e.onDialectOrElse({
-				mysql: () => Q(e, rn(a, W), a.kind),
+				mysql: () => Q(e, tn(a, K), a.kind),
 				mssql: () => Q(e, `EXEC sp_rename N'${a.table.replace(/'/g, "''")}.${a.from.replace(/'/g, "''")}', N'${a.to.replace(/'/g, "''")}', 'COLUMN';`, a.kind),
-				orElse: () => Q(e, rn(a, U), a.kind)
+				orElse: () => Q(e, tn(a, G), a.kind)
 			});
 			break;
 		case "add-index":
@@ -2199,9 +2202,9 @@ BEGIN
 			break;
 		case "add-foreign-key":
 			yield* e.onDialectOrElse({
-				mysql: () => $(e, Yn(a, W), a.kind),
+				mysql: () => $(e, Yn(a, K), a.kind),
 				sqlite: () => $(e, X(a.table, n.declared), a.kind),
-				orElse: () => $(e, Yn(a, U), a.kind)
+				orElse: () => $(e, Yn(a, G), a.kind)
 			});
 			break;
 		case "add-column": {
@@ -2250,41 +2253,41 @@ BEGIN
 		case "alter-column-nullability":
 			yield* e.onDialectOrElse({
 				mysql: () => {
-					let t = G(n.declared, a.table, a.column);
-					return t ? Q(e, `ALTER TABLE ${W(a.table)} MODIFY COLUMN ${ln(t, a.column, a.toNullable)};`, a.kind) : d.die(/* @__PURE__ */ Error(`alter-column-nullability on mariadb needs the declared column '${a.table}.${a.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
+					let t = q(n.declared, a.table, a.column);
+					return t ? Q(e, `ALTER TABLE ${K(a.table)} MODIFY COLUMN ${sn(t, a.column, a.toNullable)};`, a.kind) : d.die(/* @__PURE__ */ Error(`alter-column-nullability on mariadb needs the declared column '${a.table}.${a.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
 				},
 				mssql: () => {
-					let t = G(n.declared, a.table, a.column);
+					let t = q(n.declared, a.table, a.column);
 					return t ? Q(e, Cn(t, a.column, a.table, a.toNullable), a.kind) : d.die(/* @__PURE__ */ Error(`alter-column-nullability on mssql needs the declared column '${a.table}.${a.column}'.`));
 				},
 				sqlite: () => $(e, X(a.table, n.declared), a.kind),
-				orElse: () => Q(e, `ALTER TABLE ${U(a.table)} ALTER COLUMN ${U(a.column)} ${a.toNullable ? "DROP NOT NULL" : "SET NOT NULL"};`, a.kind)
+				orElse: () => Q(e, `ALTER TABLE ${G(a.table)} ALTER COLUMN ${G(a.column)} ${a.toNullable ? "DROP NOT NULL" : "SET NOT NULL"};`, a.kind)
 			});
 			break;
 		case "alter-column-default": {
-			let t = cn(n.declared, a.table, a.column);
+			let t = on(n.declared, a.table, a.column);
 			yield* e.onDialectOrElse({
-				mysql: () => Q(e, on(a, W, (e) => un(e, t)), a.kind),
+				mysql: () => Q(e, rn(a, K, (e) => cn(e, t)), a.kind),
 				mssql: () => Q(e, wn(a), a.kind),
 				sqlite: () => $(e, X(a.table, n.declared), a.kind),
-				orElse: () => Q(e, on(a, U, (e) => fn(e, t)), a.kind)
+				orElse: () => Q(e, rn(a, G, (e) => un(e, t)), a.kind)
 			});
 			break;
 		}
 		case "alter-column-type": {
-			let r = Qt(cn(n.declared, a.table, a.column) ?? { type: a.to }), i = a.using ? ` USING ${a.using}` : "";
+			let r = U(on(n.declared, a.table, a.column) ?? { type: a.to }), i = a.using ? ` USING ${a.using}` : "";
 			if (t.classification !== "online-required") {
 				yield* e.onDialectOrElse({
 					mysql: () => {
-						let t = G(n.declared, a.table, a.column);
-						return t ? Q(e, `ALTER TABLE ${W(a.table)} MODIFY COLUMN ${ln(t, a.column)};`, a.kind) : d.die(/* @__PURE__ */ Error(`alter-column-type on mariadb needs the declared column '${a.table}.${a.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
+						let t = q(n.declared, a.table, a.column);
+						return t ? Q(e, `ALTER TABLE ${K(a.table)} MODIFY COLUMN ${sn(t, a.column)};`, a.kind) : d.die(/* @__PURE__ */ Error(`alter-column-type on mariadb needs the declared column '${a.table}.${a.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
 					},
 					mssql: () => {
-						let t = G(n.declared, a.table, a.column);
+						let t = q(n.declared, a.table, a.column);
 						return t ? Q(e, Cn(t, a.column, a.table), a.kind) : d.die(/* @__PURE__ */ Error(`alter-column-type on mssql needs the declared column '${a.table}.${a.column}'.`));
 					},
 					sqlite: () => $(e, X(a.table, n.declared), a.kind),
-					orElse: () => Q(e, `ALTER TABLE ${U(a.table)} ALTER COLUMN ${U(a.column)} TYPE ${r}${i};`, a.kind)
+					orElse: () => Q(e, `ALTER TABLE ${G(a.table)} ALTER COLUMN ${G(a.column)} TYPE ${r}${i};`, a.kind)
 				});
 				break;
 			}
@@ -2293,14 +2296,14 @@ BEGIN
 				orElse: () => d.void
 			});
 			let o = `${a.column}__shadow`, s = `${a.column}__old`;
-			yield* e.unsafe(`ALTER TABLE ${U(a.table)} ADD COLUMN ${U(o)} ${r}`);
-			let c = a.using ?? U(a.column), l;
+			yield* e.unsafe(`ALTER TABLE ${G(a.table)} ADD COLUMN ${G(o)} ${r}`);
+			let c = a.using ?? G(a.column), l;
 			for (;;) {
 				let t = l === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(a.table)} WHERE ${e(o)} IS NULL ORDER BY ${e("id")} LIMIT 5000` : yield* e`SELECT ${e("id")} FROM ${e(a.table)} WHERE ${e(o)} IS NULL AND ${e("id")} > ${l} ORDER BY ${e("id")} LIMIT 5000`;
 				if (t.length === 0) break;
-				yield* e.unsafe(`UPDATE ${U(a.table)} SET ${U(o)} = ${c} WHERE ${U(a.column)} IS NOT NULL AND ${U(o)} IS NULL AND ${U("id")} IN (${t.map((e) => `'${e.id.replace(/'/g, "''")}'`).join(",")})`), l = t[t.length - 1].id;
+				yield* e.unsafe(`UPDATE ${G(a.table)} SET ${G(o)} = ${c} WHERE ${G(a.column)} IS NOT NULL AND ${G(o)} IS NULL AND ${G("id")} IN (${t.map((e) => `'${e.id.replace(/'/g, "''")}'`).join(",")})`), l = t[t.length - 1].id;
 			}
-			yield* d.logInfo(`alter-column-type shadow ${a.table}.${a.column}: shadow populated`).pipe(d.annotateLogs({ scope: "voltro:migrate" })), yield* e.unsafe(`ALTER TABLE ${U(a.table)} RENAME COLUMN ${U(a.column)} TO ${U(s)}`), yield* e.unsafe(`ALTER TABLE ${U(a.table)} RENAME COLUMN ${U(o)} TO ${U(a.column)}`), yield* e.unsafe(`ALTER TABLE ${U(a.table)} DROP COLUMN ${U(s)}`);
+			yield* d.logInfo(`alter-column-type shadow ${a.table}.${a.column}: shadow populated`).pipe(d.annotateLogs({ scope: "voltro:migrate" })), yield* e.unsafe(`ALTER TABLE ${G(a.table)} RENAME COLUMN ${G(a.column)} TO ${G(s)}`), yield* e.unsafe(`ALTER TABLE ${G(a.table)} RENAME COLUMN ${G(o)} TO ${G(a.column)}`), yield* e.unsafe(`ALTER TABLE ${G(a.table)} DROP COLUMN ${G(s)}`);
 			break;
 		}
 		case "drop-foreign-key":
@@ -2312,9 +2315,9 @@ BEGIN
 			break;
 		case "add-check":
 			yield* e.onDialectOrElse({
-				mysql: () => Q(e, Qn(a, W), a.kind),
+				mysql: () => Q(e, Qn(a, K), a.kind),
 				sqlite: () => $(e, X(a.table, n.declared), a.kind),
-				orElse: () => Q(e, Qn(a, U), a.kind)
+				orElse: () => Q(e, Qn(a, G), a.kind)
 			});
 			break;
 		case "drop-check":
@@ -2333,7 +2336,7 @@ BEGIN
 }), ir = (e, t, n) => d.gen(function* () {
 	let r = t.operations.filter((e) => e.blocked);
 	if (r.length > 0) return yield* d.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — ${r.length} blocked operations. Run \`voltro db plan\` to see the fixes.`));
-	yield* T(e);
+	yield* C(e);
 	let i = Date.now(), a = [];
 	try {
 		let r = yield* e.onDialectOrElse({
@@ -2347,7 +2350,7 @@ BEGIN
 		})));
 		for (let t of o) a.push(yield* rr(e, t, n));
 	} finally {
-		yield* E(e).pipe(d.orDie);
+		yield* w(e).pipe(d.orDie);
 	}
 	let o = yield* n.replan(e);
 	if (o.operations.length > 0) {
@@ -2391,7 +2394,7 @@ BEGIN
 	sqlite: () => "sqlite",
 	orElse: () => "sqlite"
 }), cr = (e, t) => d.gen(function* () {
-	let n = N(F(t, sr(e))), r = yield* or(e);
+	let n = j(N(t, sr(e))), r = yield* or(e);
 	return r === n ? {
 		kind: "up-to-date",
 		fingerprint: n
@@ -2416,43 +2419,56 @@ BEGIN
 }), fr = () => {
 	let e = (process.env.VOLTRO_DB_IGNORE_TABLES ?? "").split(",").map((e) => e.trim()).filter((e) => e.length > 0);
 	return e.length > 0 ? { ignoreTables: e } : {};
-}, pr = (e) => ({
+}, pr = (e) => {
+	if (e === void 0) return;
+	let t = e.trim();
+	if (t === "") return;
+	if (t === "1" || t.toLowerCase() === "true") return { kind: "all" };
+	let n = t.split(",").map((e) => e.trim()).filter((e) => e.length > 0);
+	return n.length > 0 ? {
+		kind: "tables",
+		tables: new Set(n)
+	} : void 0;
+}, mr = (e) => typeof e.table == "string" ? e.table : void 0, hr = (e, t = { kind: "all" }) => ({
 	...e,
 	operations: e.operations.map((e) => {
 		if (!e.blocked || e.classification !== "lossy") return e;
-		let { blocked: t, ...n } = e;
-		return n;
+		if (t?.kind === "tables") {
+			let n = mr(e.op);
+			if (n === void 0 || !t.tables.has(n)) return e;
+		}
+		let { blocked: n, ...r } = e;
+		return r;
 	})
-}), mr = (e, t, n) => t === "postgres" ? at(e, n).pipe(d.flatMap((e) => {
-	let t = ot(e);
+}), gr = (e, t, n) => t === "postgres" ? st(e, n).pipe(d.flatMap((e) => {
+	let t = ct(e);
 	return t === void 0 ? d.void : d.logWarning(`auto-migrate: ${t}`).pipe(d.annotateLogs({ scope: "voltro:migrate" }));
-}), d.catchAll(() => d.void)) : d.void, hr = (e, t, n) => d.gen(function* () {
-	let r = sr(e), i = t.filter((e) => !I(e.tableName));
+}), d.catchAll(() => d.void)) : d.void, _r = (e, t, n) => d.gen(function* () {
+	let r = sr(e), i = t.filter((e) => !P(e.tableName));
 	if (process.env.VOLTRO_MIGRATE_FORCE !== "1") {
-		let t = N(F(i, r));
-		if ((yield* or(e)) === t) return yield* mr(e, r, i), {
+		let t = j(N(i, r));
+		if ((yield* or(e)) === t) return yield* gr(e, r, i), {
 			kind: "up-to-date",
 			fingerprint: t
 		};
 	}
-	let a = yield* Yt(e), o = yield* dr(e, a.tables);
+	let a = yield* V(e), o = yield* dr(e, a.tables);
 	o.length > 0 && (yield* d.logInfo(`auto-migrate: reaped ${o.length} test-fixture leftover(s)`).pipe(d.annotateLogs({
 		scope: "voltro:migrate",
 		count: o.length
-	})), a = yield* Yt(e));
-	let s = Mt({
+	})), a = yield* V(e));
+	let s = Pt({
 		declared: i,
-		live: { tables: a.tables.filter((e) => !I(e.name)) },
+		live: { tables: a.tables.filter((e) => !P(e.name)) },
 		dialect: r,
 		...fr()
 	});
 	if (s.summary.blocked > 0) {
-		let e = s.operations.filter((e) => e.blocked).every((e) => e.classification === "lossy");
-		if (process.env.VOLTRO_DESTRUCTIVE_OK !== "1" || !e) return {
+		let e = s.operations.filter((e) => e.blocked).every((e) => e.classification === "lossy"), t = pr(process.env.VOLTRO_DESTRUCTIVE_OK);
+		if (t === void 0 || !e || (s = hr(s, t), s.operations.some((e) => e.blocked))) return {
 			kind: "refused-blocked",
 			plan: s
 		};
-		s = pr(s);
 	}
 	return s.operations.length === 0 ? {
 		kind: "up-to-date",
@@ -2465,10 +2481,10 @@ BEGIN
 			environment: n.environment === "prod" ? "dev" : n.environment,
 			source: "auto-diff",
 			replan: (e) => d.gen(function* () {
-				let t = yield* Yt(e);
-				return Mt({
+				let t = yield* V(e);
+				return Pt({
 					declared: i,
-					live: { tables: t.tables.filter((e) => !I(e.name)) },
+					live: { tables: t.tables.filter((e) => !P(e.name)) },
 					dialect: r,
 					...fr()
 				});
@@ -2476,24 +2492,37 @@ BEGIN
 		}),
 		plan: s
 	};
-}), gr = (e, t, n) => process.env.VOLTRO_AUTO_MIGRATE === "0" ? d.succeed({
+}), vr = (e, t, n) => process.env.VOLTRO_AUTO_MIGRATE === "0" ? d.succeed({
 	kind: "skipped",
 	reason: "VOLTRO_AUTO_MIGRATE=0"
-}) : n.environment === "prod" ? cr(e, t) : hr(e, t, n), _r = (e, t) => {
+}) : n.environment === "prod" ? cr(e, t) : _r(e, t, n), yr = (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=${P(e.fingerprint)})`;
+		case "up-to-date": return `auto-migrate: schema up to date (${t}, fingerprint=${M(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=${P(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=${M(e.applied.fingerprint)}`;
 		}
-		case "prod-mismatch": return `auto-migrate: SCHEMA FINGERPRINT MISMATCH — declared=${P(e.expected)}` + (e.actual ? ` live=${P(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=${M(e.expected)}` + (e.actual ? ` live=${M(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 === "add-column").length, i = t.filter((e) => e.op.kind === "drop-column").length, a = t.filter((e) => e.classification === "needs-rename-annotation").length, o = `auto-migrate: REFUSED — ${e.plan.summary.blocked} blocked operation(s):\n` + ar(e.plan), s = [""];
-			return n > 0 && s.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=${t.filter((e) => e.op.kind === "drop-table").map((e) => "table" in e.op ? e.op.table : "").filter(Boolean).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.", "      → Add it to your declared set + chain `.dropped()` on it, OR", "        write a file-based migration in `migrations/` that DROPs it, OR", "        set `VOLTRO_DESTRUCTIVE_OK=1` for ONE `voltro dev` run (acknowledges data loss).", "  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`)."), r > 0 && s.push(`${r} 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."), i > 0 && s.push(`${i} column(s) are missing from your declared schema.`, "  → If intentional: chain `.dropped()` on the column slot in the table declaration.", "  → If a typo: restore the field. Data survives until you drop it."), a > 0 && s.push(`${a} 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."), s.push("", "See `voltro db plan` for the full machine-readable diff."), o + "\n" + s.join("\n");
+			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` + ar(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) {
+					let e = "table" in r.op ? r.op.table : void 0;
+					if (e === void 0) continue;
+					let i = "column" in r.op ? String(r.op.column) : void 0;
+					if (i === void 0) continue;
+					let a = r.op.kind === "drop-column" ? t : r.op.kind === "add-column" ? n : void 0;
+					a !== void 0 && a.set(e, [...a.get(e) ?? [], i]);
+				}
+				let r = [...t.entries()].filter(([e]) => (n.get(e)?.length ?? 0) > 0).map(([e, t]) => `${e}: ${t.join(", ")} gone, ${n.get(e).join(", ")} new`);
+				c.push(`${a} column(s) are missing from your declared schema.`), r.length > 0 && c.push("  → DID YOU RENAME ONE? This plan drops AND adds columns on the same table:", ...r.map((e) => `      ${e}`), "    If so, add `.renamedFrom('<oldName>')` to the NEW column — the planner then emits a", "    RENAME and the data moves with it. Dropping and re-adding loses every value."), c.push("  → If intentional: give the field the `dropped()` marker as its VALUE —", "    `<column>: dropped()` (import it from `@voltro/database`). It is not a method", "    chained onto the column; the slot stays, documenting the hole.", "  → If a typo: restore the field. Data survives until you drop it.");
+			}
+			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");
 		}
 	}
-}, vr = /* @__PURE__ */ new Set([
+}, br = /* @__PURE__ */ new Set([
 	"node_modules",
 	"dist",
 	"build",
@@ -2502,11 +2531,11 @@ BEGIN
 	".next",
 	".git",
 	".framework"
-]), yr = async (e) => {
+]), xr = async (e) => {
 	let t = [], n = async (e) => {
 		let r = await h.readdir(e, { withFileTypes: !0 }).catch(() => []);
 		for (let i of r) {
-			if (vr.has(i.name)) continue;
+			if (br.has(i.name)) continue;
 			let r = g(e, i.name);
 			i.isDirectory() ? await n(r) : i.isFile() && l.test(i.name) && t.push(r);
 		}
@@ -2515,7 +2544,7 @@ BEGIN
 		let n = e.split("/").pop() ?? e, r = t.split("/").pop() ?? t;
 		return n.localeCompare(r);
 	});
-}, br = async (e) => {
+}, Sr = async (e) => {
 	let t = [];
 	for (let n of e) {
 		let e = (await import(ee(n).href)).default;
@@ -2529,11 +2558,11 @@ BEGIN
 		});
 	}
 	return t;
-}, xr = (e) => e`
+}, Cr = (e) => e`
     SELECT ${e("id")}
     FROM ${e("_voltro_migration_plans")}
     WHERE ${e("source")} = 'file'
-  `.pipe(d.map((e) => e.map((e) => e.id)), d.catchAll(() => d.succeed([]))), Sr = (e, t, n, r) => d.gen(function* () {
+  `.pipe(d.map((e) => e.map((e) => e.id)), d.catchAll(() => d.succeed([]))), wr = (e, t, n, r) => d.gen(function* () {
 	let i = Date.now(), a = (/* @__PURE__ */ new Date()).toISOString(), o = {
 		sql: e,
 		log: {
@@ -2566,9 +2595,9 @@ BEGIN
          ${r}, ${n}, ${"file"},
          ${c}, ${a}, ${t.migration.description})
     `, { durationMs: c };
-}), Cr = (e, t) => d.gen(function* () {
+}), Tr = (e, t) => d.gen(function* () {
 	let n = yield* d.tryPromise({
-		try: () => yr(g(t, "migrations")),
+		try: () => xr(g(t, "migrations")),
 		catch: (e) => e
 	});
 	if (n.length === 0) return {
@@ -2576,25 +2605,25 @@ BEGIN
 		skipped: []
 	};
 	let r = yield* d.tryPromise({
-		try: () => br(n),
+		try: () => Sr(n),
 		catch: (e) => e
 	});
 	if (r.length === 0) return {
 		pending: [],
 		skipped: []
 	};
-	let i = new Set(yield* xr(e));
+	let i = new Set(yield* Cr(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)
 	};
-}), wr = (e, t) => Cr(e, t).pipe(d.map((e) => e.pending.map((e) => e.migration.id))), Tr = (e, t) => d.gen(function* () {
-	let { pending: n, skipped: r } = yield* Cr(e, t.projectRoot);
+}), Er = (e, t) => Tr(e, t).pipe(d.map((e) => e.pending.map((e) => e.migration.id))), Dr = (e, t) => d.gen(function* () {
+	let { pending: n, skipped: r } = yield* Tr(e, t.projectRoot);
 	if (n.length === 0) return {
 		applied: [],
 		skipped: r
 	};
-	yield* T(e);
+	yield* C(e);
 	let i = [];
 	try {
 		for (let r of n) {
@@ -2603,7 +2632,7 @@ BEGIN
 				id: r.migration.id,
 				file: r.file
 			}));
-			let { durationMs: n } = yield* Sr(e, r, t.env, t.appliedBy);
+			let { durationMs: n } = yield* wr(e, r, t.env, t.appliedBy);
 			i.push({
 				id: r.migration.id,
 				durationMs: n
@@ -2614,28 +2643,28 @@ BEGIN
 			}));
 		}
 	} finally {
-		yield* E(e).pipe(d.orDie);
+		yield* w(e).pipe(d.orDie);
 	}
 	return {
 		applied: i,
 		skipped: r
 	};
-}), Er = (e, t) => e`
+}), Or = (e, t) => e`
     SELECT ${e("id")}
     FROM ${e("_voltro_migration_plans")}
     WHERE ${e("id")} = ${t} AND ${e("source")} = 'file'
     LIMIT 1
-  `, Dr = (e, t) => d.gen(function* () {
-	if (!(yield* Er(e, t.id))[0]) return yield* d.fail(/* @__PURE__ */ Error(`rollback: ${t.id} not found in _voltro_migration_plans (file source)`));
+  `, kr = (e, t) => d.gen(function* () {
+	if (!(yield* Or(e, t.id))[0]) return yield* d.fail(/* @__PURE__ */ Error(`rollback: ${t.id} not found in _voltro_migration_plans (file source)`));
 	let n = yield* d.tryPromise({
-		try: () => yr(g(t.projectRoot, "migrations")),
+		try: () => xr(g(t.projectRoot, "migrations")),
 		catch: (e) => e
 	}), r = (yield* d.tryPromise({
-		try: () => br(n),
+		try: () => Sr(n),
 		catch: (e) => e
 	})).find((e) => e.migration.id === t.id);
 	if (!r) return yield* d.fail(/* @__PURE__ */ Error(`rollback: file for migration ${t.id} not found on disk under ${t.projectRoot}/migrations/`));
-	yield* T(e);
+	yield* C(e);
 	let i = Date.now();
 	try {
 		let n = {
@@ -2662,9 +2691,9 @@ BEGIN
 			durationMs: o
 		};
 	} finally {
-		yield* E(e).pipe(d.orDie);
+		yield* w(e).pipe(d.orDie);
 	}
-}), Or = (e) => d.gen(function* () {
+}), Ar = (e) => d.gen(function* () {
 	let t = yield* p.SqlClient, n = yield* t`
       SELECT id, fingerprint, appliedAt FROM _voltro_migration_plans
       WHERE source = 'auto-diff'
@@ -2709,10 +2738,10 @@ BEGIN
 		snapshotFingerprint: e.fingerprint,
 		snapshotId: i
 	};
-}), kr = (e, ...t) => ({
+}), jr = (e, ...t) => ({
 	_tag: "RawSqlFragment",
 	strings: [...e],
 	values: [...t]
-}), Ar = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
+}), Mr = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
 //#endregion
-export { l as FILE_MIGRATION_PATTERN, it as REACTIVE_TRIGGER_PREFIX, te as VOLTRO_MIGRATION_LOCK_KEY, ft as _internalCmp, T as acquireMigrationLock, Ke as applyNamespacedSchema, ir as applyPlan, Be as applySchema, zt as chunkTables, F as declaredSnapshot, ve as defaultArrayClause, _e as defaultClause, k as defaultJsonClause, _r as describeOutcome, at as detectReactiveTriggerDrift, tn as emitDropColumnDdl, nn as emitDropColumnDdlMysql, ze as emitFrameworkBootstrapSql, Le as emitNamespaceProvisionDdl, Re as emitNamespacedSchemaSql, M as emitSchemaSql, N as fingerprintSchema, ot as formatReactiveTriggerDrift, fr as ignoreTablesFromEnv, Yt as introspectSchema, o as isFileMigration, Ar as isRawSqlFragment, Pt as mapPgType, s as migration, A as numericIdSql, Nt as parseEnumCheck, wr as pendingFileMigrationIds, Mt as planMigrations, qe as provisionTenantNamespace, E as releaseMigrationLock, gn as renderColumnMysql, pn as renderColumnPg, Dr as rollbackFileBasedMigration, Tr as runFileBasedMigrations, Je as runFrameworkBootstrap, Ge as runMigrate, gr as runPlannedMigrations, P as shortFingerprint, et as snapshotColumn, kr as sql, O as sqlType, Or as squashMigrationPlans, pr as unblockLossy, he as withMigrationLock };
+export { l as FILE_MIGRATION_PATTERN, ot as REACTIVE_TRIGGER_PREFIX, re as VOLTRO_MIGRATION_LOCK_KEY, mt as _internalCmp, C as acquireMigrationLock, Je as applyNamespacedSchema, ir as applyPlan, He as applySchema, Vt as chunkTables, N as declaredSnapshot, be as defaultArrayClause, ye as defaultClause, D as defaultJsonClause, yr as describeOutcome, pr as destructiveScope, st as detectReactiveTriggerDrift, $t as emitDropColumnDdl, en as emitDropColumnDdlMysql, Ve as emitFrameworkBootstrapSql, ze as emitNamespaceProvisionDdl, Be as emitNamespacedSchemaSql, A as emitSchemaSql, j as fingerprintSchema, ct as formatReactiveTriggerDrift, fr as ignoreTablesFromEnv, V as introspectSchema, o as isFileMigration, Mr as isRawSqlFragment, It as mapPgType, s as migration, O as numericIdSql, Ft as parseEnumCheck, Er as pendingFileMigrationIds, Pt as planMigrations, Ye as provisionTenantNamespace, w as releaseMigrationLock, gn as renderColumnMysql, dn as renderColumnPg, kr as rollbackFileBasedMigration, Dr as runFileBasedMigrations, Xe as runFrameworkBootstrap, qe as runMigrate, vr as runPlannedMigrations, M as shortFingerprint, nt as snapshotColumn, jr as sql, E as sqlType, Ar as squashMigrationPlans, hr as unblockLossy, _e as withMigrationLock };