@voltro/database 0.77.1 → 0.79.0

package/dist/{replaceInProgress-DdjHyYFT.js → replaceInProgress-BmSjNTp0.js}

@@ -200,7 +200,7 @@ function f(e) {
 		idSchemeInput: e
 	});
 }
-var p = () => d("text"), m = () => d("integer"), h = () => d("real"), g = (e, t = 0) => {
+var p = () => d("text"), m = () => d("integer"), ee = () => d("real"), h = (e, t = 0) => {
 	if (!Number.isInteger(e) || e <= 0) throw Error(`decimal(${String(e)}, ${String(t)}): precision must be a positive integer (the total number of significant digits, e.g. decimal(12, 2)).`);
 	if (!Number.isInteger(t) || t < 0 || t > e) throw Error(`decimal(${String(e)}, ${String(t)}): scale must be an integer between 0 and precision (${e}).`);
 	return new u({
@@ -211,7 +211,7 @@ var p = () => d("text"), m = () => d("integer"), h = () => d("real"), g = (e, t
 		precision: e,
 		scale: t
 	});
-}, ee = g, te = () => d("bigint"), ne = (e, t) => {
+}, te = h, ne = () => d("bigint"), re = (e, t) => {
 	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
 	return {
 		name: e,
@@ -225,25 +225,25 @@ var p = () => d("text"), m = () => d("integer"), h = () => d("real"), g = (e, t
 			enumValues: t
 		})
 	};
-}, _ = () => d("boolean"), v = () => d("timestamp"), re = () => d("date"), y = () => d("json"), b = () => d("bytes"), x = () => new u({
+}, g = () => d("boolean"), _ = () => d("timestamp"), ie = () => d("date"), v = () => d("json"), y = () => d("bytes"), b = () => new u({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), ie = () => new u({
+}), ae = () => new u({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), S = () => {
+}), x = () => {
 	throw Error("selfReference(): the target is resolved by table() — a column built with selfReference() must be declared inside a table({ … }) literal, not read before the table exists");
 };
-function ae(e) {
-	return oe(S, e);
+function oe(e) {
+	return se(x, e);
 }
-function oe(e, t) {
+function se(e, t) {
 	return new u({
 		type: "reference",
 		nullable: !1,
@@ -259,13 +259,13 @@ function oe(e, t) {
 		...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
 	});
 }
-var se = () => new u({
+var ce = () => new u({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), ce = (e, t) => {
+}), le = (e, t) => {
 	if (!Number.isInteger(e) || e <= 0) throw Error(`vector(${String(e)}): dimension must be a positive integer (the embedding length, e.g. vector(1536)).`);
 	return new u({
 		type: "vector",
@@ -275,13 +275,13 @@ var se = () => new u({
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, le = (e) => new u({
+}, ue = (e) => new u({
 	type: "array",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	arrayElement: e.__definition().type
-}), ue = () => d("interval"), de = (e, t = 4326) => new u({
+}), de = () => d("interval"), fe = (e, t = 4326) => new u({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -291,7 +291,7 @@ var se = () => new u({
 		geomKind: e,
 		srid: t
 	}
-}), fe = (e, t = 4326) => new u({
+}), pe = (e, t = 4326) => new u({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -301,182 +301,182 @@ var se = () => new u({
 		geomKind: e,
 		srid: t
 	}
-}), pe = (e) => new u({
+}), me = (e) => new u({
 	type: "raw",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	rawDdl: e
-}), C = (e) => {
+}), S = (e) => {
 	let t = {};
 	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
 	return t;
-}, me = /* @__PURE__ */ new WeakMap(), he = (e) => typeof e == "object" && e ? me.get(e) : void 0, ge = (e, t = {}) => {
+}, he = /* @__PURE__ */ new WeakMap(), ge = (e) => typeof e == "object" && e ? he.get(e) : void 0, _e = (e, t = {}) => {
 	let n = p();
-	return me.set(n, {
+	return he.set(n, {
 		target: e,
 		orphanPolicy: t.orphanPolicy ?? "keep",
 		onSoftDelete: t.onSoftDelete ?? !1
 	}), n;
-}, w = /* @__PURE__ */ new Map(), _e = (e, t) => {
+}, C = /* @__PURE__ */ new Map(), ve = (e, t) => {
 	if (t.from === t.to) throw Error(`declareEnumRename('${e}'): \`from\` and \`to\` are both '${t.from}' — a rename must change the value.`);
-	let n = w.get(e) ?? [];
+	let n = C.get(e) ?? [];
 	for (let r of n) {
 		if (r.from === t.from && r.to === t.to) return;
 		if (r.from === t.from && r.to !== t.to) throw Error(`declareEnumRename('${e}'): value '${t.from}' is already declared as renamed to '${r.to}', cannot also rename it to '${t.to}'.`);
 	}
-	n.push(t), w.set(e, n);
-}, ve = (e) => w.get(e) ?? [], ye = () => w, be = () => {
-	w.clear();
-}, xe = (t) => {
+	n.push(t), C.set(e, n);
+}, ye = (e) => C.get(e) ?? [], be = () => C, xe = () => {
+	C.clear();
+}, Se = (t) => {
 	let r = t;
 	for (let t = 0; t < 4 && n.isFiberFailure(r); t++) r = e.squash(r[n.FiberFailureCauseId]);
 	return r;
-}, T = (t, r = 0) => {
+}, w = (t, r = 0) => {
 	if (r >= 4 || !n.isFiberFailure(t)) return [t];
 	let i = t[n.FiberFailureCauseId], a = [...e.failures(i), ...e.defects(i)];
 	if (a.length === 0) return [e.squash(i)];
 	let o = [];
-	for (let e of a.slice(0, 8)) o.push(...T(e, r + 1));
+	for (let e of a.slice(0, 8)) o.push(...w(e, r + 1));
 	return o;
-}, Se = (e) => e.dbCode !== void 0 || e.dbErrno !== void 0 || e.dbNumber !== void 0 || e.dbSqlState !== void 0 || e.dbConstraint !== void 0, Ce = (e) => {
-	let t = {}, n = [], r = xe(e);
+}, Ce = (e) => e.dbCode !== void 0 || e.dbErrno !== void 0 || e.dbNumber !== void 0 || e.dbSqlState !== void 0 || e.dbConstraint !== void 0, we = (e) => {
+	let t = {}, n = [], r = Se(e);
 	for (let e = 0; e < 8 && typeof r == "object" && r; e++) {
 		let e = r;
 		t.dbCode === void 0 && (typeof e.code == "string" || typeof e.code == "number") && (t.dbCode = e.code), t.dbErrno === void 0 && typeof e.errno == "number" && (t.dbErrno = e.errno), t.dbNumber === void 0 && typeof e.number == "number" && (t.dbNumber = e.number), t.dbSqlState === void 0 && typeof e.sqlState == "string" && (t.dbSqlState = e.sqlState), t.dbBindings === void 0 && typeof e.voltroBindings == "string" && (t.dbBindings = e.voltroBindings), t.dbStatement === void 0 && typeof e.sql == "string" && e.sql.includes("?") && (t.dbStatement = e.sql, t.dbPlaceholders = (e.sql.match(/\?/g) ?? []).length), t.dbFatal === void 0 && typeof e.fatal == "boolean" && (t.dbFatal = e.fatal), t.dbConstraint === void 0 && typeof e.constraint == "string" && (t.dbConstraint = e.constraint), t.dbTable === void 0 && typeof e.table == "string" && (t.dbTable = e.table), t.dbColumn === void 0 && typeof e.column == "string" && (t.dbColumn = e.column), t.dbSchema === void 0 && typeof e.schema == "string" && (t.dbSchema = e.schema);
 		let i = e.sqlMessage ?? e.detail;
 		t.dbMessage === void 0 && typeof i == "string" && (t.dbMessage = i);
 		let a = typeof e.constructor == "function" ? e.constructor.name : void 0, o = typeof e._tag == "string" && e._tag || typeof e.name == "string" && e.name || (typeof a == "string" && a !== "Object" ? a : void 0), s = typeof e.message == "string" ? e.message : void 0;
-		(o || s) && n.push(`${o || "Error"}${s ? `: ${s.slice(0, 200)}` : ""}`), r = xe(e.cause);
+		(o || s) && n.push(`${o || "Error"}${s ? `: ${s.slice(0, 200)}` : ""}`), r = Se(e.cause);
 	}
 	return n.length > 0 && (t.dbCauseChain = n.join(" ← "), t.dbMessage === void 0 && (t.dbMessage = n[n.length - 1])), t;
-}, we = (e) => {
-	let t = T(e).map(Ce);
+}, Te = (e) => {
+	let t = w(e).map(we);
 	if (t.length <= 1) return t[0] ?? {};
-	let n = t.find(Se) ?? t[0], r = t.filter((e) => e !== n).map((e) => e.dbCauseChain).filter((e) => typeof e == "string");
+	let n = t.find(Ce) ?? t[0], r = t.filter((e) => e !== n).map((e) => e.dbCauseChain).filter((e) => typeof e == "string");
 	if (r.length === 0) return n;
 	let i = typeof n.dbCauseChain == "string" ? n.dbCauseChain : void 0;
 	return {
 		...n,
 		dbCauseChain: [i, ...r].filter(Boolean).join(" ‖ ")
 	};
-}, Te = (e, t) => {
-	let n = De(e);
+}, Ee = (e, t) => {
+	let n = Oe(e);
 	if (n !== void 0) return n;
-	let r = we(e), i = Ne(r, t);
+	let r = Te(e), i = Pe(r, t);
 	if (i !== void 0) {
 		let e = i.constraint ?? i.column;
 		return e === void 0 ? i.kind : `${i.kind}: ${e}`;
 	}
-	let a = r.dbCode ?? r.dbSqlState ?? r.dbErrno ?? r.dbNumber, o = Ae(e);
-	return a !== void 0 && Oe.test(String(a)) ? `${o} (${String(a)})` : o;
-}, Ee = Symbol.for("@voltro/database/authoredMessage"), E = (e, t) => {
+	let a = r.dbCode ?? r.dbSqlState ?? r.dbErrno ?? r.dbNumber, o = je(e);
+	return a !== void 0 && ke.test(String(a)) ? `${o} (${String(a)})` : o;
+}, De = Symbol.for("@voltro/database/authoredMessage"), T = (e, t) => {
 	let n = t === void 0 ? Error(e) : Error(e, t);
-	return Object.defineProperty(n, Ee, {
+	return Object.defineProperty(n, De, {
 		value: !0,
 		enumerable: !1
 	}), n;
-}, De = (e) => {
-	for (let t of T(e)) {
+}, Oe = (e) => {
+	for (let t of w(e)) {
 		let e = t;
 		for (let t = 0; typeof e == "object" && e && t < 8; t += 1) {
-			if (e[Ee] === !0) {
+			if (e[De] === !0) {
 				let t = e.message;
 				if (typeof t == "string" && t.length > 0) return t;
 			}
 			e = e.cause;
 		}
 	}
-}, Oe = /^[A-Za-z0-9_]{1,32}$/, ke = /^[A-Za-z_][A-Za-z0-9_]{0,63}$/, Ae = (e) => {
+}, ke = /^[A-Za-z0-9_]{1,32}$/, Ae = /^[A-Za-z_][A-Za-z0-9_]{0,63}$/, je = (e) => {
 	let t = e?._tag, n = e?.name, r = (typeof t == "string" ? t : typeof n == "string" ? n : "").split(/[^A-Za-z0-9_]+/).filter(Boolean).pop();
-	return r !== void 0 && ke.test(r) ? r : "unknown";
-}, je = /^[A-Za-z_][A-Za-z0-9_$]*$/, D = (e) => e !== void 0 && e.length <= 128 && je.test(e) ? e : void 0, Me = (e) => e === void 0 ? void 0 : e.split(".").pop() ?? e, O = (e, ...t) => {
+	return r !== void 0 && Ae.test(r) ? r : "unknown";
+}, Me = /^[A-Za-z_][A-Za-z0-9_$]*$/, E = (e) => e !== void 0 && e.length <= 128 && Me.test(e) ? e : void 0, Ne = (e) => e === void 0 ? void 0 : e.split(".").pop() ?? e, D = (e, ...t) => {
 	for (let n of t) {
 		let t = n.exec(e);
 		if (t?.[1] !== void 0) return t[1];
 	}
-}, Ne = (e, t) => {
+}, Pe = (e, t) => {
 	let n = e.dbCode, r = e.dbErrno, i = e.dbNumber, a = typeof e.dbMessage == "string" ? e.dbMessage : "", o = `${typeof e.dbCauseChain == "string" ? e.dbCauseChain : ""} ${a}`;
 	if (n === "23503") {
-		let t = D(e.dbConstraint);
+		let t = E(e.dbConstraint);
 		return {
 			kind: /is still referenced from table/i.test(o) ? "foreignKeyInUse" : "foreignKey",
 			...t === void 0 ? {} : { constraint: t }
 		};
 	}
 	if (n === "23505") {
-		let t = D(e.dbConstraint);
+		let t = E(e.dbConstraint);
 		return {
 			kind: "unique",
 			...t === void 0 ? {} : { constraint: t }
 		};
 	}
 	if (n === "23502") {
-		let t = D(e.dbColumn);
+		let t = E(e.dbColumn);
 		return {
 			kind: "notNull",
 			...t === void 0 ? {} : { column: t }
 		};
 	}
 	if (n === "23514") {
-		let t = D(e.dbConstraint);
+		let t = E(e.dbConstraint);
 		return {
 			kind: "check",
 			...t === void 0 ? {} : { constraint: t }
 		};
 	}
 	if (r === 1452 || r === 1451) {
-		let e = D(O(o, /CONSTRAINT `([^`]+)`/));
+		let e = E(D(o, /CONSTRAINT `([^`]+)`/));
 		return {
 			kind: r === 1451 ? "foreignKeyInUse" : "foreignKey",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
 	if (r === 1062) {
-		let e = D(Me(O(o, /for key '([^']+)'/)));
+		let e = E(Ne(D(o, /for key '([^']+)'/)));
 		return {
 			kind: "unique",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
 	if (r === 1048 || r === 1364) {
-		let e = D(O(o, /Column '([^']+)' cannot be null/, /Field '([^']+)' doesn't have a default value/));
+		let e = E(D(o, /Column '([^']+)' cannot be null/, /Field '([^']+)' doesn't have a default value/));
 		return {
 			kind: "notNull",
 			...e === void 0 ? {} : { column: e }
 		};
 	}
 	if (r === 3819 || r === 4025) {
-		let e = D(O(o, /Check constraint '([^']+)'/, /CONSTRAINT `([^`]+)` failed/));
+		let e = E(D(o, /Check constraint '([^']+)'/, /CONSTRAINT `([^`]+)` failed/));
 		return {
 			kind: "check",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
 	if (i === 547) {
-		let e = O(o, /(?:FOREIGN KEY|REFERENCE) constraint "([^"]+)"/), t = O(o, /CHECK constraint "([^"]+)"/);
+		let e = D(o, /(?:FOREIGN KEY|REFERENCE) constraint "([^"]+)"/), t = D(o, /CHECK constraint "([^"]+)"/);
 		if (t !== void 0 && e === void 0) {
-			let e = D(t);
+			let e = E(t);
 			return {
 				kind: "check",
 				...e === void 0 ? {} : { constraint: e }
 			};
 		}
-		let n = /REFERENCE constraint/.test(o), r = D(e);
+		let n = /REFERENCE constraint/.test(o), r = E(e);
 		return {
 			kind: n ? "foreignKeyInUse" : "foreignKey",
 			...r === void 0 ? {} : { constraint: r }
 		};
 	}
 	if (i === 2627 || i === 2601) {
-		let e = D(O(o, /(?:UNIQUE KEY|PRIMARY KEY) constraint '([^']+)'/, /index '([^']+)'/));
+		let e = E(D(o, /(?:UNIQUE KEY|PRIMARY KEY) constraint '([^']+)'/, /index '([^']+)'/));
 		return {
 			kind: "unique",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
 	if (i === 515) {
-		let e = D(O(o, /Cannot insert the value NULL into column '([^']+)'/));
+		let e = E(D(o, /Cannot insert the value NULL into column '([^']+)'/));
 		return {
 			kind: "notNull",
 			...e === void 0 ? {} : { column: e }
@@ -484,34 +484,40 @@ var se = () => new u({
 	}
 	if (n === "SQLITE_CONSTRAINT_FOREIGNKEY") return { kind: t === "delete" || t === "deleteMany" || t === "hardDelete" ? "foreignKeyInUse" : "foreignKey" };
 	if (n === "SQLITE_CONSTRAINT_UNIQUE" || n === "SQLITE_CONSTRAINT_PRIMARYKEY") {
-		let e = D(Me(O(o, /UNIQUE constraint failed: ([^,\s]+)/)));
+		let e = E(Ne(D(o, /UNIQUE constraint failed: ([^,\s]+)/)));
 		return {
 			kind: "unique",
 			...e === void 0 ? {} : { column: e }
 		};
 	}
 	if (n === "SQLITE_CONSTRAINT_NOTNULL") {
-		let e = D(Me(O(o, /NOT NULL constraint failed: ([^,\s]+)/)));
+		let e = E(Ne(D(o, /NOT NULL constraint failed: ([^,\s]+)/)));
 		return {
 			kind: "notNull",
 			...e === void 0 ? {} : { column: e }
 		};
 	}
 	if (n === "SQLITE_CONSTRAINT_CHECK") {
-		let e = D(O(a, /CHECK constraint failed: (.+)$/));
+		let e = E(D(a, /CHECK constraint failed: (.+)$/));
 		return {
 			kind: "check",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
-}, Pe = (e) => {
-	let t = Ne(e)?.kind;
-	return t === "foreignKey" || t === "foreignKeyInUse";
 }, Fe = (e) => {
+	let t = Pe(e)?.kind;
+	return t === "foreignKey" || t === "foreignKeyInUse";
+}, Ie = (e) => {
 	let t = e.dbCode, n = e.dbErrno;
 	return t === "57014" || n === 3024 || n === 1969 || t === "ETIMEOUT" || t === "SQLITE_INTERRUPT";
-}, Ie = (e) => {
-	let t = we(e), n = [
+}, Le = (e) => {
+	if (e.dbErrno !== 1366) return;
+	let t = `${typeof e.dbCauseChain == "string" ? e.dbCauseChain : ""} ${typeof e.dbMessage == "string" ? e.dbMessage : ""}`;
+	if (/Incorrect string value: '\\x(F[0-4])/i.exec(t) === null) return;
+	let n = D(t, /for column [`']?(?:[^`'.]+[`']?\.[`']?)*([^`'.]+)[`']? at row/);
+	return `${n === void 0 ? "the column" : `column '${n}'`} is stored in a character set that cannot hold a 4-byte character (utf8mb3). Declare the store's character set in app.config.ts — store: { dialect: 'mariadb' | 'mysql', charset: 'utf8mb4' } — and run \`voltro db plan\`: every declared table is created with it and converted to it.`;
+}, Re = (e) => {
+	let t = Te(e), n = [
 		t.dbCode === void 0 ? void 0 : `code=${String(t.dbCode)}`,
 		t.dbErrno === void 0 ? void 0 : `errno=${String(t.dbErrno)}`,
 		t.dbNumber === void 0 ? void 0 : `number=${String(t.dbNumber)}`,
@@ -519,8 +525,10 @@ var se = () => new u({
 		t.dbConstraint === void 0 ? void 0 : `constraint=${String(t.dbConstraint)}`,
 		t.dbPlaceholders === void 0 ? void 0 : `placeholders=${String(t.dbPlaceholders)}`
 	].filter((e) => e !== void 0), r = typeof e?.message == "string" ? e.message : void 0, i = typeof t.dbMessage == "string" ? t.dbMessage : void 0, a = i === void 0 ? void 0 : n.length > 0 || i !== r && i !== `Error: ${String(r)}` ? i : void 0, o = typeof t.dbBindings == "string" ? `\n  bindings:  ${t.dbBindings}` : "", s = typeof t.dbStatement == "string" ? `\n  statement: ${t.dbStatement.length <= 400 ? t.dbStatement : `${t.dbStatement.slice(0, 400)}…`}` : "";
-	if (a !== void 0 || n.length !== 0) return [a, n.length > 0 ? `[${n.join(" ")}]` : void 0].filter((e) => e !== void 0 && e !== "").join(" ") + s + o;
-}, Le = (e) => Object.entries(e).map(([e, t]) => `${e}:${Re(t)}`).join(" "), Re = (e) => {
+	if (a === void 0 && n.length === 0) return;
+	let c = Le(t), l = c === void 0 ? "" : `\n  hint: ${c}`;
+	return [a, n.length > 0 ? `[${n.join(" ")}]` : void 0].filter((e) => e !== void 0 && e !== "").join(" ") + l + s + o;
+}, ze = (e) => Object.entries(e).map(([e, t]) => `${e}:${Be(t)}`).join(" "), Be = (e) => {
 	if (e === null) return "null";
 	if (e === void 0) return "undefined";
 	if (typeof e == "bigint") return "bigint";
@@ -530,24 +538,24 @@ var se = () => new u({
 	if (globalThis.Buffer !== void 0 && globalThis.Buffer.isBuffer(e)) return "Buffer";
 	let t = e.constructor?.name;
 	return typeof t == "string" && t !== "" ? t : "Object";
-}, ze = 63, Be = 60, k = [], A = (e) => {
-	k.includes(e) || k.push(e);
-}, Ve = () => {
-	let e = k.slice();
-	return k.length = 0, e;
-}, He = /^[a-zA-Z_][a-zA-Z0-9_]*$/, Ue = (e, t) => {
+}, Ve = 63, He = 60, O = [], k = (e) => {
+	O.includes(e) || O.push(e);
+}, Ue = () => {
+	let e = O.slice();
+	return O.length = 0, e;
+}, We = /^[a-zA-Z_][a-zA-Z0-9_]*$/, Ge = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!He.test(t)) throw Error(`${e} '${t}' contains characters outside [A-Za-z0-9_] or starts with a digit. Dialect-portable identifiers must match /^[a-zA-Z_][a-zA-Z0-9_]*$/.`);
-}, j = (e) => {
-	if (Ue("table name", e), e.length > 63) throw Error(`table name '${e}' is ${e.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten the name; long table names also cascade into auto-named indexes and FK constraints that would themselves exceed the limit.`);
-	e.length > 60 && A(`table name '${e}' is ${e.length} chars — ${63 - e.length} from the Postgres 63-byte limit. Auto-named indexes on this table will run out of room fast.`);
-}, M = (e, t) => {
-	if (Ue("column name", t), t.length > 63) throw Error(`column '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Rename it.`);
-	t.length > 60 && A(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
-}, N = (e, t, n, r) => {
-	if (Ue("index name", t), t.length > 63) throw Error(n ? `auto-named index '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Supply an explicit short name: .index('<shortName>', ${JSON.stringify([...r])}).` : `index name '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten it.`);
-	t.length > 60 && A(`index '${t}' on table '${e}' is ${t.length} chars — ${63 - t.length} from the 63-byte limit. ${n ? `Consider .index('<shortName>', ${JSON.stringify([...r])}) before it grows.` : ""}`);
-}, P = (e, t) => {
+	if (!We.test(t)) throw Error(`${e} '${t}' contains characters outside [A-Za-z0-9_] or starts with a digit. Dialect-portable identifiers must match /^[a-zA-Z_][a-zA-Z0-9_]*$/.`);
+}, A = (e) => {
+	if (Ge("table name", e), e.length > 63) throw Error(`table name '${e}' is ${e.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten the name; long table names also cascade into auto-named indexes and FK constraints that would themselves exceed the limit.`);
+	e.length > 60 && k(`table name '${e}' is ${e.length} chars — ${63 - e.length} from the Postgres 63-byte limit. Auto-named indexes on this table will run out of room fast.`);
+}, j = (e, t) => {
+	if (Ge("column name", t), t.length > 63) throw Error(`column '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Rename it.`);
+	t.length > 60 && k(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
+}, M = (e, t, n, r) => {
+	if (Ge("index name", t), t.length > 63) throw Error(n ? `auto-named index '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Supply an explicit short name: .index('<shortName>', ${JSON.stringify([...r])}).` : `index name '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten it.`);
+	t.length > 60 && k(`index '${t}' on table '${e}' is ${t.length} chars — ${63 - t.length} from the 63-byte limit. ${n ? `Consider .index('<shortName>', ${JSON.stringify([...r])}) before it grows.` : ""}`);
+}, N = (e, t) => {
 	if (e.length === 0) throw Error(`typeid prefix on table '${t.tableName}' cannot be empty.`);
 	if (!/^[a-z][a-z0-9_]*$/.test(e)) {
 		let n = t.kind === "derived" ? "the derived prefix doesn't match typeid's required shape — supply an explicit one via id({ prefix: '...' })." : "the prefix must match typeid's required shape /^[a-z][a-z0-9_]*$/.";
@@ -557,44 +565,44 @@ var se = () => new u({
 		let n = t.kind === "derived" ? "shorten the table name, or supply an explicit short prefix via id({ prefix: '...' })." : "pick a shorter prefix.";
 		throw Error(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — exceeds the 63-byte limit; ${n}`);
 	}
-	e.length > 60 && A(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — close to the 63-byte limit. Generated ids will be even longer (prefix + '_' + 26).`);
-}, We = 1704067200000n, Ge = 10n, Ke = 12n, qe = (1n << Ge) - 1n, Je = (1n << Ke) - 1n, Ye = Ke, Xe = 22n, Ze = () => {
+	e.length > 60 && k(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — close to the 63-byte limit. Generated ids will be even longer (prefix + '_' + 26).`);
+}, Ke = 1704067200000n, qe = 10n, Je = 12n, Ye = (1n << qe) - 1n, Xe = (1n << Je) - 1n, Ze = Je, Qe = 22n, $e = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > qe) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${qe}.`);
+	if (t < 0n || t > Ye) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Ye}.`);
 	return t;
-}, Qe = () => ({
+}, et = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: Ze()
-}), F, $e = () => (F === void 0 && (F = Qe()), F), et = () => {
-	F = Qe();
-}, tt = () => BigInt(Date.now()), nt = (e) => {
-	let t = tt();
-	for (; t <= e;) t = tt();
+	machineId: $e()
+}), P, tt = () => (P === void 0 && (P = et()), P), nt = () => {
+	P = et();
+}, rt = () => BigInt(Date.now()), it = (e) => {
+	let t = rt();
+	for (; t <= e;) t = rt();
 	return t;
-}, rt = () => {
-	let e = $e(), t = tt();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & Je, e.sequence === 0n && (t = nt(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - We;
+}, at = () => {
+	let e = tt(), t = rt();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & Xe, e.sequence === 0n && (t = it(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - Ke;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Xe | e.machineId << Ye | e.sequence).toString();
-}, it = (e) => {
+	return (n << Qe | e.machineId << Ze | e.sequence).toString();
+}, ot = (e) => {
 	let t = e.toLowerCase();
 	if (t.startsWith("_")) throw Error(`cannot derive a typeid prefix for table '${e}' (table names starting with '_' are not valid typeid prefixes). Pick an explicit prefix via id({ prefix: '...' }) or use a different scheme like id({ scheme: 'numeric' }) for internal tables.`);
 	if (!/^[a-z][a-z0-9_]*$/.test(t)) throw Error(`cannot derive a typeid prefix from table name '${e}' (must match [a-z][a-z0-9_]*). Pick an explicit prefix via id({ prefix: '...' }).`);
 	let n = t.endsWith("ies") && t.length > 3 ? t.slice(0, -3) + "y" : t.endsWith("ses") || t.endsWith("xes") || t.endsWith("zes") || t.endsWith("shes") || t.endsWith("ches") ? t.slice(0, -2) : t.endsWith("s") && t.length > 1 ? t.slice(0, -1) : t;
-	return P(n, {
+	return N(n, {
 		kind: "derived",
 		tableName: e
 	}), n;
-}, at = (e, t) => {
+}, st = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: it(t)
+		prefix: ot(t)
 	};
-	if ("prefix" in e && !("scheme" in e)) return P(e.prefix, {
+	if ("prefix" in e && !("scheme" in e)) return N(e.prefix, {
 		kind: "explicit",
 		tableName: t
 	}), {
@@ -604,8 +612,8 @@ var se = () => new u({
 	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
 	switch (e.scheme) {
 		case "typeid": {
-			let n = e.prefix ?? it(t);
-			return e.prefix !== void 0 && P(e.prefix, {
+			let n = e.prefix ?? ot(t);
+			return e.prefix !== void 0 && N(e.prefix, {
 				kind: "explicit",
 				tableName: t
 			}), {
@@ -621,22 +629,22 @@ var se = () => new u({
 			generate: e.generate
 		};
 	}
-}, ot = (e, t) => {
+}, ct = (e, t) => {
 	switch (e.kind) {
 		case "typeid": return i(e.prefix).toString();
 		case "ulid": return a();
 		case "numeric": return null;
-		case "snowflake": return rt();
+		case "snowflake": return at();
 		case "custom": return e.generate(t);
 	}
-}, st = (e) => ({
-	fields: C(e.fields),
+}, lt = (e) => ({
+	fields: S(e.fields),
 	...e.id === void 0 ? {} : { id: e.id },
 	...e.requires === void 0 ? {} : { requires: e.requires },
 	...e.indexes === void 0 ? {} : { indexes: e.indexes },
 	...e.behaviors === void 0 ? {} : { behaviors: e.behaviors },
 	...e.policies === void 0 ? {} : { policies: e.policies }
-}), ct = st, lt = (e) => {
+}), ut = lt, dt = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -646,7 +654,7 @@ var se = () => new u({
 	};
 	for (let t of e) r(t);
 	return n;
-}, ut = (e, ...t) => {
+}, ft = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -657,14 +665,14 @@ var se = () => new u({
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, dt = (e = "cosine", t = "float32") => {
+}, pt = (e = "cosine", t = "float32") => {
 	let n = t === "half" ? "halfvec" : "vector";
 	switch (e) {
 		case "cosine": return `${n}_cosine_ops`;
 		case "l2": return `${n}_l2_ops`;
 		case "inner": return `${n}_ip_ops`;
 	}
-}, ft = [
+}, mt = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -673,7 +681,7 @@ var se = () => new u({
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], pt = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, mt = (e, t) => `${e}_${t.join("_")}_idx`, ht = (e, t) => `${e}_${t.join("_")}_uq`, gt = (e, t, n, r, i) => {
+], ht = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, gt = (e, t) => `${e}_${t.join("_")}_idx`, _t = (e, t) => `${e}_${t.join("_")}_uq`, vt = (e, t, n, r, i) => {
 	if (n !== "hnsw") return;
 	if (r.length !== 1) throw Error(`hnsw index '${t}' on table '${e}' must cover exactly one vector column — got ${r.length} fields. pgvector's HNSW access method indexes a single vector column.`);
 	let a = r[0];
@@ -681,14 +689,14 @@ var se = () => new u({
 	let o = i[a];
 	if (o === void 0) throw Error(`hnsw index '${t}' on table '${e}' references unknown column '${a}'.`);
 	if (o.type !== "vector") throw Error(`hnsw index '${t}' on table '${e}' requires a vector() column — column '${a}' is '${o.type}'. HNSW is the pgvector approximate-nearest-neighbour method and only applies to vectors.`);
-}, _t = (e, t) => {
+}, yt = (e, t) => {
 	let n;
 	for (let [r, i] of Object.entries(e)) i.type === "id" && i.idScheme === void 0 && (n === void 0 && (n = { ...e }), n[r] = {
 		...i,
-		idScheme: at(i.idSchemeInput, t)
+		idScheme: st(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, I = (e) => {
+}, F = (e) => {
 	let t = e.appliedPrimaryKey ?? [];
 	return {
 		tableName: e.tableName,
@@ -707,8 +715,8 @@ var se = () => new u({
 		...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema },
 		fullTextIndex: ((t, n, r) => {
 			if (n.length === 0) throw Error(`fullTextIndex '${t}' on '${e.tableName}' has no columns.`);
-			if (N(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
-			return I({
+			if (M(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
+			return F({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -729,27 +737,27 @@ var se = () => new u({
 			});
 		}),
 		with: ((...t) => {
-			let n = lt(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
+			let n = dt(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
 			for (let e of Object.keys(r)) i.set(e, {
 				id: "<table>",
 				fields: {}
 			});
 			for (let t of n) for (let [n, a] of Object.entries(t.fields)) {
 				let o = i.get(n);
-				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${pt(o)}' and '${pt(t)}' both define it. If they're the same mixin reached via different paths, set a shared 'id' on both. If they're genuinely different concerns, rename one of the columns.`);
-				M(e.tableName, n), r[n] = a, i.set(n, t);
+				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${ht(o)}' and '${ht(t)}' both define it. If they're the same mixin reached via different paths, set a shared 'id' on both. If they're genuinely different concerns, rename one of the columns.`);
+				j(e.tableName, n), r[n] = a, i.set(n, t);
 			}
 			let a = [...e.appliedIndexes];
 			for (let t of n) for (let n of t.indexes ?? []) {
-				let t = n.name ?? mt(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (N(e.tableName, t, n.name === void 0, n.fields), gt(e.tableName, t, n.kind, n.fields, r), a.push({
+				let t = n.name ?? gt(e.tableName, n.fields);
+				a.some((e) => e.name === t) || (M(e.tableName, t, n.name === void 0, n.fields), vt(e.tableName, t, n.kind, n.fields, r), a.push({
 					name: t,
 					fields: n.fields,
 					...n.kind === void 0 ? {} : { kind: n.kind },
 					...n.kindOptions === void 0 ? {} : { kindOptions: n.kindOptions }
 				}));
 			}
-			return I({
+			return F({
 				...e,
 				tableName: e.tableName,
 				fields: r,
@@ -766,10 +774,10 @@ var se = () => new u({
 		}),
 		index: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = mt(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`index '${n}' on table '${e.tableName}' has no fields — an index must cover at least one column.`);
+			if (a ? (r = t[0], i = t[1], n = gt(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`index '${n}' on table '${e.tableName}' has no fields — an index must cover at least one column.`);
 			let o = r.filter((e) => typeof e == "string");
-			if (N(e.tableName, n, a, o), gt(e.tableName, n, i?.kind, r, e.fields), e.appliedIndexes.some((e) => e.name === n)) throw t.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${e.tableName}' — you've called .index(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (rare).`) : Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table.`);
-			return I({
+			if (M(e.tableName, n, a, o), vt(e.tableName, n, i?.kind, r, e.fields), e.appliedIndexes.some((e) => e.name === n)) throw t.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${e.tableName}' — you've called .index(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (rare).`) : Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table.`);
+			return F({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -793,8 +801,8 @@ var se = () => new u({
 		expressionIndex: ((t, n, r) => {
 			if (n.length === 0) throw Error(`expressionIndex '${t}' on table '${e.tableName}' has no fields — an index must cover at least one column or expression.`);
 			let i = n.filter((e) => typeof e == "string");
-			if (N(e.tableName, t, !1, i), gt(e.tableName, t, r?.kind, n, e.fields), e.appliedIndexes.some((e) => e.name === t)) throw Error(`duplicate index '${t}' on table '${e.tableName}': each index name must be unique within a table.`);
-			return I({
+			if (M(e.tableName, t, !1, i), vt(e.tableName, t, r?.kind, n, e.fields), e.appliedIndexes.some((e) => e.name === t)) throw Error(`duplicate index '${t}' on table '${e.tableName}': each index name must be unique within a table.`);
+			return F({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -817,9 +825,9 @@ var se = () => new u({
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = ht(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`unique '${n}' on table '${e.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
-			if (N(e.tableName, n, a, r), e.appliedUniques.some((e) => e.name === n)) throw Error(a ? `duplicate auto-named UNIQUE '${n}' on table '${e.tableName}' — you've called .unique(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (very rare).` : `duplicate UNIQUE '${n}' on table '${e.tableName}': each constraint name must be unique within a table.`);
-			return I({
+			if (a ? (r = t[0], i = t[1], n = _t(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`unique '${n}' on table '${e.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
+			if (M(e.tableName, n, a, r), e.appliedUniques.some((e) => e.name === n)) throw Error(a ? `duplicate auto-named UNIQUE '${n}' on table '${e.tableName}' — you've called .unique(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (very rare).` : `duplicate UNIQUE '${n}' on table '${e.tableName}': each constraint name must be unique within a table.`);
+			return F({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -840,10 +848,10 @@ var se = () => new u({
 		}),
 		uniqueActive: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = mt(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${e.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
-			if (N(e.tableName, n, a, r), e.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
+			if (a ? (r = t[0], i = t[1], n = gt(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${e.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
+			if (M(e.tableName, n, a, r), e.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
 			let o = i?.where ?? "\"deletedAt\" IS NULL";
-			return I({
+			return F({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -865,8 +873,8 @@ var se = () => new u({
 		}),
 		check: ((t, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
-			if (N(e.tableName, t, !1, []), e.appliedChecks.some((e) => e.name === t)) throw Error(`duplicate CHECK '${t}' on table '${e.tableName}': each constraint name must be unique within a table.`);
-			return I({
+			if (M(e.tableName, t, !1, []), e.appliedChecks.some((e) => e.name === t)) throw Error(`duplicate CHECK '${t}' on table '${e.tableName}': each constraint name must be unique within a table.`);
+			return F({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -888,7 +896,7 @@ var se = () => new u({
 			if (t.trim().length === 0) throw Error(`rule on table '${e.tableName}' has an empty name.`);
 			let i = e.appliedRules ?? [];
 			if (i.some((e) => e.name === t)) throw Error(`duplicate rule '${t}' on table '${e.tableName}': each rule name must be unique within a table.`);
-			return I({
+			return F({
 				...e,
 				appliedRules: [...i, {
 					name: t,
@@ -899,7 +907,7 @@ var se = () => new u({
 		}),
 		renamedFrom: ((t) => {
 			if (t === e.tableName) throw Error(`renamedFrom('${t}') on table '${e.tableName}' names the table itself — drop the marker, there is nothing to rename.`);
-			return j(t), I({
+			return A(t), F({
 				...e,
 				previousTableName: t
 			});
@@ -914,7 +922,7 @@ var se = () => new u({
 			}
 			if (t.length > 0) throw Error(`primaryKey([...]) declared twice on table '${e.tableName}'.`);
 			for (let [t, r] of Object.entries(e.fields)) if (r.type === "id" && !n.includes(t)) throw Error(`primaryKey([...]) on table '${e.tableName}' conflicts with the id() column '${t}'. The explicit primary key IS the key — drop the id() column, or include '${t}' in the composite key.`);
-			return I({
+			return F({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -929,7 +937,7 @@ var se = () => new u({
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
-		nonReactive: (() => I({
+		nonReactive: (() => F({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -943,7 +951,7 @@ var se = () => new u({
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validate: ((t) => I({
+		validate: ((t) => F({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -957,7 +965,7 @@ var se = () => new u({
 			insertSchema: t,
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validatePatch: ((t) => I({
+		validatePatch: ((t) => F({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -972,22 +980,22 @@ var se = () => new u({
 			validatePatchSchema: r.partial(t)
 		}))
 	};
-}, L = (e, t) => {
-	j(e);
+}, I = (e, t) => {
+	A(e);
 	let n = Object.entries(t).flatMap(([e, t]) => {
-		let n = he(t);
+		let n = ge(t);
 		return n === void 0 ? [] : [{
 			column: e,
 			...n
 		}];
-	}), r = _t(C(t), e);
-	for (let t of Object.keys(r)) M(e, t);
+	}), r = yt(S(t), e);
+	for (let t of Object.keys(r)) j(e, t);
 	let i;
-	for (let [t, n] of Object.entries(r)) n.references === S && (n.references = () => {
+	for (let [t, n] of Object.entries(r)) n.references === x && (n.references = () => {
 		if (i === void 0) throw Error(`selfReference() on '${e}.${t}' read before table() returned`);
 		return i;
 	});
-	return i = I({
+	return i = F({
 		appliedPluginRefs: n,
 		tableName: e,
 		fields: r,
@@ -999,7 +1007,7 @@ var se = () => new u({
 		appliedChecks: [],
 		appliedRules: []
 	}), i;
-}, vt = (e) => e === "sqlite" || e === "turso", yt = (e) => e === "mysql" || e === "mariadb", R = (e, t) => {
+}, bt = (e) => e === "sqlite" || e === "turso", xt = (e) => e === "mysql" || e === "mariadb", L = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e.replace(/`/g, "``")}\``;
@@ -1008,51 +1016,51 @@ var se = () => new u({
 		case "sqlite":
 		case "turso": return `"${e.replace(/"/g, "\"\"")}"`;
 	}
-}, bt = 1e4, xt = Symbol.for("@voltro/database/tableRegistry"), St = globalThis, z = St[xt] ?? (St[xt] = /* @__PURE__ */ new Map()), Ct = (e) => {
-	let t = z.get(e.tableName);
+}, St = 1e4, Ct = Symbol.for("@voltro/database/tableRegistry"), wt = globalThis, R = wt[Ct] ?? (wt[Ct] = /* @__PURE__ */ new Map()), Tt = (e) => {
+	let t = R.get(e.tableName);
 	if (t === void 0) {
-		z.set(e.tableName, e);
+		R.set(e.tableName, e);
 		return;
 	}
 	if (t !== e) throw Error(`duplicate table '${e.tableName}' registration: two different table descriptors claim the same name. Rename one or import the shared module that defines it.`);
-}, wt = (e) => {
-	z.get(e.tableName) === void 0 && z.set(e.tableName, e);
-}, B = (e) => z.get(e), Tt = (e) => {
-	let t = z.get(e);
+}, Et = (e) => {
+	R.get(e.tableName) === void 0 && R.set(e.tableName, e);
+}, z = (e) => R.get(e), Dt = (e) => {
+	let t = R.get(e);
 	if (t === void 0) throw Error(`table '${e}' is not registered. Register it by wrapping it in \`databaseHandle({ ... })\` (the usual path) or call \`registerTable(t)\` explicitly before this runs. Note a \`queryFor(t)\` query carries its own source table, so eager-loads don't hit this — this error means a reconstructed descriptor or by-name tooling reached an unregistered table.`);
 	return t;
-}, Et = () => [...z.values()], Dt = (e) => z.delete(e), Ot = () => {
-	z.clear();
-}, kt = (e) => z.get(e)?.isReactive !== !1, V = (e) => e.order ?? [], At = (e) => ({
+}, Ot = () => [...R.values()], kt = (e) => R.delete(e), At = () => {
+	R.clear();
+}, jt = (e) => R.get(e)?.isReactive !== !1, B = (e) => e.order ?? [], Mt = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), jt = (e, t) => ({
+}), Nt = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), Mt = (e, t) => ({
+}), Pt = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), Nt = (e, t) => ({
+}), Ft = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), Pt = (e, t) => ({
+}), It = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), Ft = (e, t) => ({
+}), Lt = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), It = (e, t) => ({
+}), Rt = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), H = (e) => (...t) => {
+}), V = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return W({
+	return U({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -1064,55 +1072,55 @@ var se = () => new u({
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, Lt = H("union"), Rt = H("union-all"), zt = H("intersect"), Bt = H("except"), U = (e) => ({ over: (t) => ({
+}, zt = V("union"), Bt = V("union-all"), Vt = V("intersect"), Ht = V("except"), H = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), Vt = (e = "rowNumber") => U({
+}) }), Ut = (e = "rowNumber") => H({
 	op: "window-row-number",
 	alias: e
-}), Ht = (e = "rank") => U({
+}), Wt = (e = "rank") => H({
 	op: "window-rank",
 	alias: e
-}), Ut = (e = "denseRank") => U({
+}), Gt = (e = "denseRank") => H({
 	op: "window-dense-rank",
 	alias: e
-}), Wt = (e, t = 1, n) => U({
+}), Kt = (e, t = 1, n) => H({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), Gt = (e, t = 1, n) => U({
+}), qt = (e, t = 1, n) => H({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), Kt = (e, t) => U({
+}), Jt = (e, t) => H({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), qt = (e, t) => U({
+}), Yt = (e, t) => H({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), Jt = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? B(e)?.appliedFullText?.find((e) => e.name === t);
+}), Xt = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? z(e)?.appliedFullText?.find((e) => e.name === t);
 	if (r === void 0) throw Error(`.matching('${t}', ...): no full-text index named '${t}' is declared on table '${e}'. Declare it with \`table(...).fullTextIndex('${t}', [columns])\` first.`);
 	return {
 		columns: r.columns,
 		...r.config === void 0 ? {} : { config: r.config },
 		...r.weights === void 0 ? {} : { weights: r.weights }
 	};
-}, W = (e) => ({
+}, U = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return W({
+		return U({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return W({
+		return U({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -1121,43 +1129,43 @@ var se = () => new u({
 		});
 	},
 	limit(t) {
-		return W({
+		return U({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return W({
+		return U({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return W({
+		return U({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return W({
+		return U({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return W({
+		return U({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	forUpdate() {
-		return W({
+		return U({
 			...e,
 			lock: "update"
 		});
 	},
 	unscoped() {
-		return W({
+		return U({
 			...e,
 			crossTenant: !0
 		});
@@ -1167,13 +1175,13 @@ var se = () => new u({
 			...e.eager ?? {},
 			...t
 		};
-		return W({
+		return U({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return W({
+		return U({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1187,15 +1195,15 @@ var se = () => new u({
 			...t,
 			alias: e
 		}));
-		return W({
+		return U({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = Jt(e.table, t, e.fullTextIndexes);
-		return W({
+		let r = Xt(e.table, t, e.fullTextIndexes);
+		return U({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -1209,7 +1217,7 @@ var se = () => new u({
 	rankBy(t) {
 		let n = e.fullTextSearch;
 		if (n === void 0) throw Error(".rankBy() requires a preceding .matching(...) clause — there is no full-text search to rank on this query.");
-		return W({
+		return U({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -1228,7 +1236,7 @@ var se = () => new u({
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return W({
+			return U({
 				...e,
 				annClause: i
 			});
@@ -1240,7 +1248,7 @@ var se = () => new u({
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return W({
+			return U({
 				...e,
 				annClause: r,
 				take: n
@@ -1253,7 +1261,7 @@ var se = () => new u({
 			column: "",
 			distance: "cosine"
 		};
-		return W({
+		return U({
 			...e,
 			annClause: {
 				...n,
@@ -1262,22 +1270,22 @@ var se = () => new u({
 		});
 	},
 	use(t) {
-		return W({ ...t(e) });
+		return U({ ...t(e) });
 	},
 	distinct() {
-		return W({
+		return U({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return W({
+		return U({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return W({
+		return U({
 			...e,
 			alias: t
 		});
@@ -1289,7 +1297,7 @@ var se = () => new u({
 			alias: n,
 			on: r
 		}];
-		return W({
+		return U({
 			...e,
 			joins: a
 		});
@@ -1301,7 +1309,7 @@ var se = () => new u({
 			alias: n,
 			on: r
 		}];
-		return W({
+		return U({
 			...e,
 			joins: a
 		});
@@ -1311,7 +1319,7 @@ var se = () => new u({
 			outputKey: e,
 			source: t
 		}));
-		return W({
+		return U({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1320,7 +1328,7 @@ var se = () => new u({
 	withCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.withCte: duplicate CTE name '${t}'`);
-		return W({
+		return U({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1331,7 +1339,7 @@ var se = () => new u({
 	recursiveCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.recursiveCte: duplicate CTE name '${t}'`);
-		return W({
+		return U({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1342,20 +1350,20 @@ var se = () => new u({
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return W({
+		return U({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return W({
+		return U({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return W({
+		return U({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1366,8 +1374,8 @@ var se = () => new u({
 		});
 	}
 });
-function Yt(e) {
-	return W({
+function Zt(e) {
+	return U({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1378,7 +1386,7 @@ function Yt(e) {
 		sourceTable: e
 	});
 }
-var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
+var Qt = (e, t, n) => $t(e, "id", t, n), $t = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1393,21 +1401,21 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, Qt = (e) => {
+}, en = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) Ct(r), t[n] = Yt(r);
+	for (let [n, r] of Object.entries(e)) Tt(r), t[n] = Zt(r);
 	return t;
-}, $t = (e) => e.isView === !0, en = (e, t, n) => {
-	if (j(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
-	let r = C(t);
-	for (let t of Object.keys(r)) M(e, t);
+}, tn = (e) => e.isView === !0, nn = (e, t, n) => {
+	if (A(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
+	let r = S(t);
+	for (let t of Object.keys(r)) j(e, t);
 	return {
 		tableName: e,
 		fields: r,
 		isView: !0,
 		viewSelect: n
 	};
-}, tn = (e) => Yt({
+}, rn = (e) => Zt({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1415,8 +1423,8 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), nn = (e, t, n = null) => {
-	let r = n === null ? R(e.tableName, t) : `${R(n, t)}.${R(e.tableName, t)}`, i = e.viewSelect.trim();
+}), an = (e, t, n = null) => {
+	let r = n === null ? L(e.tableName, t) : `${L(n, t)}.${L(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1425,7 +1433,7 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, rn = (e) => e == null || typeof e == "boolean" ? e : typeof e == "number" ? e !== 0 : typeof e == "bigint" ? e !== 0n : typeof e == "string" ? e === "1" || e.toLowerCase() === "true" : e, an = (e) => {
+}, on = (e) => e == null || typeof e == "boolean" ? e : typeof e == "number" ? e !== 0 : typeof e == "bigint" ? e !== 0n : typeof e == "string" ? e === "1" || e.toLowerCase() === "true" : e, sn = (e) => {
 	if (e == null || typeof e != "string") return e;
 	let t = e.trim();
 	if (t.length === 0) return e;
@@ -1436,7 +1444,7 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 	} catch {
 		return e;
 	}
-}, on = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, sn = (e) => {
+}, cn = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, ln = (e) => {
 	if (e == null || e instanceof Date) return e;
 	if (typeof e == "string") {
 		let t = new Date(e);
@@ -1447,24 +1455,24 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		return isNaN(t.getTime()) ? e : t;
 	}
 	return e;
-}, cn = (e, t, n) => {
+}, un = (e, t, n) => {
 	if (e == null) return e;
 	switch (t) {
-		case "boolean": return n === "postgres" ? e : rn(e);
-		case "vector": return n === "postgres" ? an(e) : e;
-		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : an(e);
-		case "array": return n === "postgres" ? e : an(e);
+		case "boolean": return n === "postgres" ? e : on(e);
+		case "vector": return n === "postgres" ? sn(e) : e;
+		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : sn(e);
+		case "array": return n === "postgres" ? e : sn(e);
 		case "timestamp":
-		case "date": return n === "sqlite" || n === "turso" ? sn(e) : e;
+		case "date": return n === "sqlite" || n === "turso" ? ln(e) : e;
 		case "decimal":
-		case "bigint": return on(e);
+		case "bigint": return cn(e);
 		default: return e;
 	}
-}, ln = (e, t, n) => {
+}, dn = (e, t, n) => {
 	if (e.length === 0) return e;
-	let r = B(t);
-	return r === void 0 ? e : un(e, r, n);
-}, un = (e, t, n) => {
+	let r = z(t);
+	return r === void 0 ? e : fn(e, r, n);
+}, fn = (e, t, n) => {
 	if (e.length === 0) return e;
 	let r = t.fields, i = [];
 	for (let [e, t] of Object.entries(r)) i.push({
@@ -1473,10 +1481,10 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 	});
 	return e.map((e) => {
 		let t = { ...e };
-		for (let { key: e, type: r } of i) e in t && (t[e] = cn(t[e], r, n));
+		for (let { key: e, type: r } of i) e in t && (t[e] = un(t[e], r, n));
 		return t;
 	});
-}, dn = (e, t) => {
+}, pn = (e, t) => {
 	if (e == null) return e;
 	switch (t) {
 		case "json": return JSON.stringify(e);
@@ -1484,25 +1492,25 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		case "vector": return typeof e == "string" ? e : JSON.stringify(e);
 		default: return e;
 	}
-}, fn = (e, t, n = ["json", "array"]) => {
-	let r = B(t);
+}, mn = (e, t, n = ["json", "array"]) => {
+	let r = z(t);
 	if (r === void 0) return e;
 	let i = r.fields, a = null;
 	for (let [t, r] of Object.entries(i)) if (n.includes(r.type) && t in e) {
-		let n = dn(e[t], r.type);
+		let n = pn(e[t], r.type);
 		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
 	}
 	return a ?? e;
-}, pn = /^[A-Za-z_][A-Za-z0-9_]*$/, mn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : pn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), hn = (e) => "{" + e.map((e) => {
+}, hn = /^[A-Za-z_][A-Za-z0-9_]*$/, gn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : hn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), _n = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", G = (e, t, n, r = {}) => {
-	let i = R(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", W = (e, t, n, r = {}) => {
+	let i = L(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${hn(t)}'::text[])`;
+		let e = `(${i} #>> '${_n(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = mn(t);
+	let o = gn(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1519,61 +1527,61 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, gn = class extends Error {
+}, vn = class extends Error {
 	_tag = "TenantNamespaceUnresolved";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceUnresolved";
 	}
-}, _n = class extends Error {
+}, yn = class extends Error {
 	_tag = "TenantNamespaceInvalid";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceInvalid";
 	}
-}, vn = 63, yn = "tenant_", bn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), xn = (e) => {
-	if (e == null || e === "") throw new gn("namespace isolation is on but the request has no resolvable tenant (subject.tenantId is null/empty). Refusing to run against a shared/default namespace — this would be a cross-tenant read. Authenticate with a tenant-scoped subject, or disable namespace isolation for this surface.");
-	let t = bn(e);
-	if (t.replace(/_/g, "") === "") throw new _n(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
-	let n = `${yn}${t}`;
-	if (n.length > vn) throw new _n(`namespace '${n}' for tenant '${e}' exceeds the ${vn}-byte identifier limit. Use a shorter tenant id.`);
+}, bn = 63, xn = "tenant_", Sn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Cn = (e) => {
+	if (e == null || e === "") throw new vn("namespace isolation is on but the request has no resolvable tenant (subject.tenantId is null/empty). Refusing to run against a shared/default namespace — this would be a cross-tenant read. Authenticate with a tenant-scoped subject, or disable namespace isolation for this surface.");
+	let t = Sn(e);
+	if (t.replace(/_/g, "") === "") throw new yn(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
+	let n = `${xn}${t}`;
+	if (n.length > bn) throw new yn(`namespace '${n}' for tenant '${e}' exceeds the ${bn}-byte identifier limit. Use a shorter tenant id.`);
 	return n;
-}, K = (e, t) => e === null ? t : `${e}.${t}`, Sn = /* @__PURE__ */ new Set(["timestamp", "date"]), Cn = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, wn = (e, t) => {
-	if (e === void 0 || t == null || !Sn.has(e) || t instanceof Date) return t;
+}, G = (e, t) => e === null ? t : `${e}.${t}`, wn = /* @__PURE__ */ new Set(["timestamp", "date"]), Tn = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, En = (e, t) => {
+	if (e === void 0 || t == null || !wn.has(e) || t instanceof Date) return t;
 	if (typeof t == "number" && Number.isFinite(t)) return new Date(t);
-	if (typeof t == "string" && Cn.test(t)) {
+	if (typeof t == "string" && Tn.test(t)) {
 		let e = new Date(t);
 		return Number.isNaN(e.getTime()) ? t : e;
 	}
 	return t;
-}, Tn = (e, t) => e === void 0 || !Sn.has(e) ? t : t.map((t) => wn(e, t)), En = (e, t) => {
+}, Dn = (e, t) => e === void 0 || !wn.has(e) ? t : t.map((t) => En(e, t)), On = (e, t) => {
 	let { strings: n, values: r } = e, i = t.unsafe(n[0] ?? "");
 	for (let e = 0; e < r.length; e++) i = t`${i}${r[e]}${t.unsafe(n[e + 1] ?? "")}`;
 	return t`${i}`;
-}, q = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), J = (e, t, n = null, r) => {
-	if ("not" in e) return t`NOT (${J(e.not, t, n, r)})`;
-	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => J(e, t, n, r)));
-	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => J(e, t, n, r)));
+}, K = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), q = (e, t, n = null, r) => {
+	if ("not" in e) return t`NOT (${q(e.not, t, n, r)})`;
+	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => q(e, t, n, r)));
+	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => q(e, t, n, r)));
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
-		let r = e, i = Y(r.subquery, t, n);
+		let r = e, i = J(r.subquery, t, n);
 		return r.op === "subquery-in" ? t`${t(r.column)} IN (${i})` : t`${t(r.column)} NOT IN (${i})`;
 	}
 	if (e.op === "exists" || e.op === "not-exists") {
-		let r = e, i = Y(r.subquery, t, n);
+		let r = e, i = J(r.subquery, t, n);
 		return r.op === "exists" ? t`EXISTS (${i})` : t`NOT EXISTS (${i})`;
 	}
 	let i = e, a = t(i.column), o = i.path, s = o !== void 0 && o.length > 0, c = () => t.onDialectOrElse({
-		mysql: () => t.unsafe(G(i.column, o, "mysql")),
-		mssql: () => t.unsafe(G(i.column, o, "mssql")),
-		sqlite: () => t.unsafe(G(i.column, o, "sqlite")),
-		orElse: () => t.unsafe(G(i.column, o, "postgres"))
+		mysql: () => t.unsafe(W(i.column, o, "mysql")),
+		mssql: () => t.unsafe(W(i.column, o, "mssql")),
+		sqlite: () => t.unsafe(W(i.column, o, "sqlite")),
+		orElse: () => t.unsafe(W(i.column, o, "postgres"))
 	}), l = () => t.onDialectOrElse({
-		mysql: () => t.unsafe(G(i.column, o, "mysql", { numeric: !0 })),
-		mssql: () => t.unsafe(G(i.column, o, "mssql", { numeric: !0 })),
-		sqlite: () => t.unsafe(G(i.column, o, "sqlite", { numeric: !0 })),
-		orElse: () => t.unsafe(G(i.column, o, "postgres", { numeric: !0 }))
-	}), u = s ? c() : a, d = s ? l() : a, f = (e) => s && e != null ? String(e) : e, p = (e) => s ? Number(e) : e, m = s || r === void 0 ? void 0 : B(r)?.fields?.[i.column]?.type, h = (e) => wn(m, e);
+		mysql: () => t.unsafe(W(i.column, o, "mysql", { numeric: !0 })),
+		mssql: () => t.unsafe(W(i.column, o, "mssql", { numeric: !0 })),
+		sqlite: () => t.unsafe(W(i.column, o, "sqlite", { numeric: !0 })),
+		orElse: () => t.unsafe(W(i.column, o, "postgres", { numeric: !0 }))
+	}), u = s ? c() : a, d = s ? l() : a, f = (e) => s && e != null ? String(e) : e, p = (e) => s ? Number(e) : e, m = s || r === void 0 ? void 0 : z(r)?.fields?.[i.column]?.type, ee = (e) => En(m, e);
 	switch (i.op) {
-		case "eq": return t`${u} = ${f(h(i.value))}`;
-		case "neq": return t`${u} <> ${f(h(i.value))}`;
+		case "eq": return t`${u} = ${f(ee(i.value))}`;
+		case "neq": return t`${u} <> ${f(ee(i.value))}`;
 		case "gt": return t`${d} > ${p(i.value)}`;
 		case "gte": return t`${d} >= ${p(i.value)}`;
 		case "lt": return t`${d} < ${p(i.value)}`;
@@ -1587,7 +1595,7 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 			return e.length === 0 ? t`TRUE` : t`${u} NOT IN ${t.in(s ? e.map((e) => f(e)) : e)}`;
 		}
 		case "contains": {
-			let e = `%${q(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
+			let e = `%${K(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
 			return t.onDialectOrElse({
 				mysql: () => t`LOWER(${u}) LIKE LOWER(${e})`,
 				mssql: () => t`LOWER(${u}) LIKE LOWER(${e})`,
@@ -1596,7 +1604,7 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 			});
 		}
 		case "startsWith": {
-			let e = `${q(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
+			let e = `${K(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
 			return t.onDialectOrElse({
 				mysql: () => t`${u} LIKE ${e}`,
 				orElse: () => t`${u} LIKE ${e} ESCAPE '\\'`
@@ -1632,25 +1640,25 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 			let e = i.value, n = t.unsafe("::geometry"), r = e.bufferMeters === void 0 ? t`${e.geom}${n}` : t`ST_Buffer(${e.geom}::geography, ${e.bufferMeters})::geometry`;
 			return t.onDialectOrElse({
 				mysql: () => {
-					throw E("@voltro/plugin-postgis: spatial predicates are postgres-only");
+					throw T("@voltro/plugin-postgis: spatial predicates are postgres-only");
 				},
 				mssql: () => {
-					throw E("@voltro/plugin-postgis: spatial predicates are postgres-only");
+					throw T("@voltro/plugin-postgis: spatial predicates are postgres-only");
 				},
 				sqlite: () => {
-					throw E("@voltro/plugin-postgis: spatial predicates are postgres-only");
+					throw T("@voltro/plugin-postgis: spatial predicates are postgres-only");
 				},
 				orElse: () => e.fn === "ST_DWithin" ? t`ST_DWithin(${a}::geography, ${e.geom}::geography, ${e.distanceMeters})` : e.fn === "&&" ? t`${a}${n} && ${r}` : t`${t.unsafe(e.fn)}(${a}${n}, ${r})`
 			});
 		}
 	}
-}, Dn = (e, t) => {
+}, kn = (e, t) => {
 	let n = [];
 	return e.partitionBy && e.partitionBy.length > 0 && n.push(t`PARTITION BY ${t.csv(e.partitionBy.map((e) => t`${t(e)}`))}`), e.orderBy && e.orderBy.length > 0 && n.push(t`ORDER BY ${t.csv(e.orderBy.map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), n.length === 0 ? t`` : n.length === 1 ? n[0] : n.reduce((e, n, r) => r === 0 ? n : t`${e} ${n}`);
-}, On = (e, t) => t.csv(e.map((e) => {
+}, An = (e, t) => t.csv(e.map((e) => {
 	let n = e.column === void 0 ? t.unsafe("*") : t`${t(e.column)}`;
 	if (e.op.startsWith("window-")) {
-		let r = Dn(e.window ?? {}, t);
+		let r = kn(e.window ?? {}, t);
 		switch (e.op) {
 			case "window-row-number": return t`ROW_NUMBER() OVER (${r}) AS ${t(e.alias)}`;
 			case "window-rank": return t`RANK() OVER (${r}) AS ${t(e.alias)}`;
@@ -1659,7 +1667,7 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 			case "window-lead": return t`LEAD(${n}, ${t.unsafe(String(e.offset ?? 1))}) OVER (${r}) AS ${t(e.alias)}`;
 			case "window-sum-over": return t`SUM(${n}) OVER (${r}) AS ${t(e.alias)}`;
 			case "window-avg-over": return t`AVG(${n}) OVER (${r}) AS ${t(e.alias)}`;
-			default: throw E(`compileAggregateProjection: unknown window op '${e.op}'`);
+			default: throw T(`compileAggregateProjection: unknown window op '${e.op}'`);
 		}
 	}
 	switch (e.op) {
@@ -1670,71 +1678,71 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		case "min": return t`MIN(${n}) AS ${t(e.alias)}`;
 		case "max": return t`MAX(${n}) AS ${t(e.alias)}`;
 		case "column":
-			if (e.column === void 0) throw E(`compileAggregateProjection: 'column' projection requires a column name (alias '${e.alias}')`);
+			if (e.column === void 0) throw T(`compileAggregateProjection: 'column' projection requires a column name (alias '${e.alias}')`);
 			return t`${t(e.column)} AS ${t(e.alias)}`;
-		default: throw E(`compileAggregateProjection: unknown op '${e.op}'`);
+		default: throw T(`compileAggregateProjection: unknown op '${e.op}'`);
 	}
-})), kn = (e) => `[${e.join(",")}]`, An = (e, t) => {
+})), jn = (e) => `[${e.join(",")}]`, Mn = (e, t) => {
 	if (e.queryVector === void 0) return null;
-	let n = t(e.column), r = kn(e.queryVector), i = e.distance === "cosine" ? "<=>" : e.distance === "l2" ? "<->" : "<#>", a = e.distance === "cosine" ? "VEC_DISTANCE_COSINE" : "VEC_DISTANCE_EUCLIDEAN";
+	let n = t(e.column), r = jn(e.queryVector), i = e.distance === "cosine" ? "<=>" : e.distance === "l2" ? "<->" : "<#>", a = e.distance === "cosine" ? "VEC_DISTANCE_COSINE" : "VEC_DISTANCE_EUCLIDEAN";
 	return t.onDialectOrElse({
 		mysql: () => t`${t.unsafe(a)}(${n}, ${r})`,
 		mssql: () => t`NULL`,
 		sqlite: () => t`NULL`,
 		orElse: () => t`${n} ${t.unsafe(i)} ${r}::vector`
 	});
-}, jn = (e, t) => {
+}, Nn = (e, t) => {
 	let n = t.unsafe(e.useGeography ? "::geography" : "::geometry");
 	return t`ST_Distance(${t(e.column)}${n}, ${e.geom}${n})`;
-}, Mn = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Nn = (e, t) => t`${t(`${e.indexName}_tsv`)}`, Pn = (e, t) => `${t}_${e.indexName}_fts`, Fn = (e, t, n) => {
-	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${q(e.query)}%`;
+}, Pn = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Fn = (e, t) => t`${t(`${e.indexName}_tsv`)}`, In = (e, t) => `${t}_${e.indexName}_fts`, Ln = (e, t, n) => {
+	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${K(e.query)}%`;
 	return n.onDialectOrElse({
 		mysql: () => n`MATCH(${r}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
 		sqlite: () => {
-			let r = n(Pn(e, t));
+			let r = n(In(e, t));
 			return n`${n("id")} IN (SELECT ${n("row_id")} FROM ${r} WHERE ${r} MATCH ${e.query})`;
 		},
 		mssql: () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`)),
-		orElse: () => n`${Nn(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})`
+		orElse: () => n`${Fn(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})`
 	});
-}, In = (e, t, n) => {
-	let r = `%${q(e.query)}%`;
+}, Rn = (e, t, n) => {
+	let r = `%${K(e.query)}%`;
 	return n.onDialectOrElse({
 		mysql: () => n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
 		sqlite: () => {
-			let r = n(Pn(e, t));
+			let r = n(In(e, t));
 			return n`COALESCE((SELECT -bm25(${r}) FROM ${r} WHERE ${r} MATCH ${e.query} AND ${r}.${n("row_id")} = ${n("id")}), 0)`;
 		},
 		mssql: () => e.columns.map((e) => n`(CASE WHEN LOWER(${n(e)}) LIKE LOWER(${r}) ESCAPE '\\' THEN 1 ELSE 0 END)`).reduce((e, t, r) => r === 0 ? t : n`${e} + ${t}`),
-		orElse: () => n`ts_rank(${Nn(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))`
+		orElse: () => n`ts_rank(${Fn(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))`
 	});
-}, Y = (e, t, n = null) => {
+}, J = (e, t, n = null) => {
 	if (e.setOp && e.setOp.queries.length >= 2) {
-		let r = e.setOp.kind === "union" ? "UNION" : e.setOp.kind === "union-all" ? "UNION ALL" : e.setOp.kind === "intersect" ? "INTERSECT" : "EXCEPT", i = e.setOp.queries.map((e) => t`(${Y(e, t, n)})`).reduce((e, n, i) => i === 0 ? n : t`${e} ${t.unsafe(r)} ${n}`), a = [];
-		if (V(e).length > 0 && a.push(t` ORDER BY ${t.csv(V(e).map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), e.take !== void 0) {
-			if (!Number.isInteger(e.take) || e.take < 0) throw E(`compileSelect: invalid take ${e.take}`);
+		let r = e.setOp.kind === "union" ? "UNION" : e.setOp.kind === "union-all" ? "UNION ALL" : e.setOp.kind === "intersect" ? "INTERSECT" : "EXCEPT", i = e.setOp.queries.map((e) => t`(${J(e, t, n)})`).reduce((e, n, i) => i === 0 ? n : t`${e} ${t.unsafe(r)} ${n}`), a = [];
+		if (B(e).length > 0 && a.push(t` ORDER BY ${t.csv(B(e).map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), e.take !== void 0) {
+			if (!Number.isInteger(e.take) || e.take < 0) throw T(`compileSelect: invalid take ${e.take}`);
 			a.push(t` LIMIT ${t.unsafe(String(e.take))}`);
 		}
 		if (e.skip !== void 0) {
-			if (!Number.isInteger(e.skip) || e.skip < 0) throw E(`compileSelect: invalid skip ${e.skip}`);
+			if (!Number.isInteger(e.skip) || e.skip < 0) throw T(`compileSelect: invalid skip ${e.skip}`);
 			a.push(t` OFFSET ${t.unsafe(String(e.skip))}`);
 		}
 		return t`${i}${a.reduce((e, n) => t`${e}${n}`, t``)}`;
 	}
-	let r = e.annClause === void 0 ? null : An(e.annClause, t);
+	let r = e.annClause === void 0 ? null : Mn(e.annClause, t);
 	e.spatialClause !== void 0 && t.onDialectOrElse({
 		mysql: () => {
-			throw E("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+			throw T("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
 		},
 		mssql: () => {
-			throw E("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+			throw T("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
 		},
 		sqlite: () => {
-			throw E("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+			throw T("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
 		},
 		orElse: () => t``
 	});
-	let i = e.spatialClause?.projectAs === void 0 ? null : jn(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? On(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : e.projection && e.projection.length > 0 ? t.csv(e.projection.map((e) => t`${t(e)}`)) : t`*`, o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? In(c, e.table, t) : null, u = l !== null && c?.rank !== void 0 ? t`${s}, ${l} AS ${t(c.rank.alias)}` : s, d = i !== null && !o && e.spatialClause?.projectAs !== void 0 ? t`${u}, ${i} AS ${t(e.spatialClause.projectAs)}` : u, f = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
+	let i = e.spatialClause?.projectAs === void 0 ? null : Nn(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? An(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : e.projection && e.projection.length > 0 ? t.csv(e.projection.map((e) => t`${t(e)}`)) : t`*`, o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? Rn(c, e.table, t) : null, u = l !== null && c?.rank !== void 0 ? t`${s}, ${l} AS ${t(c.rank.alias)}` : s, d = i !== null && !o && e.spatialClause?.projectAs !== void 0 ? t`${u}, ${i} AS ${t(e.spatialClause.projectAs)}` : u, f = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
 		orElse: () => t`DISTINCT ON (${t.csv(e.distinctOn.map((e) => t`${t(e)}`))}) `,
 		mysql: () => t`DISTINCT `,
 		mssql: () => t`DISTINCT `,
@@ -1742,34 +1750,34 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 	}) : e.distinct ? t`DISTINCT ` : t``, p = e.lock === "update", m = p ? t.onDialectOrElse({
 		mssql: () => t` WITH (UPDLOCK, ROWLOCK)`,
 		orElse: () => t``
-	}) : t``, h = p ? t.onDialectOrElse({
+	}) : t``, ee = p ? t.onDialectOrElse({
 		mssql: () => t``,
 		sqlite: () => t``,
 		orElse: () => t` FOR UPDATE`
-	}) : t``, g = e.alias === void 0 ? t`${t(K(n, e.table))}${m}` : t`${t(K(n, e.table))} AS ${t(e.alias)}${m}`, ee = (e.joins ?? []).map((e) => {
+	}) : t``, h = e.alias === void 0 ? t`${t(G(n, e.table))}${m}` : t`${t(G(n, e.table))} AS ${t(e.alias)}${m}`, te = (e.joins ?? []).map((e) => {
 		let r = e.kind === "inner" ? "INNER" : "LEFT";
-		return t` ${t.unsafe(r)} JOIN ${t(K(n, e.table))} AS ${t(e.alias)} ON ${J(e.on, t, n)}`;
-	}), te = ee.length > 0 ? ee.reduce((e, n) => t`${e}${n}`, g) : g, ne = c === void 0 ? null : Fn(c, e.table, t), _ = [e.predicate ? J(e.predicate, t, n, e.table) : null, ne].filter((e) => e !== null), v = _.length > 0 ? t` WHERE ${t.and(_)}` : t``, re = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, y = e.having ? t` HAVING ${J(e.having, t, n, e.table)}` : t``, b = e.skip !== void 0, x = [];
-	r !== null && x.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && x.push(e.spatialClause.order === "desc" ? t`${Mn(e.spatialClause, t)} DESC` : t`${Mn(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && x.push(t`${l} DESC`);
-	for (let n of V(e)) x.push(n.direction === "desc" ? t`${t(n.column)} DESC` : t`${t(n.column)} ASC`);
-	let ie = x.length > 0 ? t` ORDER BY ${t.csv(x)}` : b ? t.onDialectOrElse({
+		return t` ${t.unsafe(r)} JOIN ${t(G(n, e.table))} AS ${t(e.alias)} ON ${q(e.on, t, n)}`;
+	}), ne = te.length > 0 ? te.reduce((e, n) => t`${e}${n}`, h) : h, re = c === void 0 ? null : Ln(c, e.table, t), g = [e.predicate ? q(e.predicate, t, n, e.table) : null, re].filter((e) => e !== null), _ = g.length > 0 ? t` WHERE ${t.and(g)}` : t``, ie = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, v = e.having ? t` HAVING ${q(e.having, t, n, e.table)}` : t``, y = e.skip !== void 0, b = [];
+	r !== null && b.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && b.push(e.spatialClause.order === "desc" ? t`${Pn(e.spatialClause, t)} DESC` : t`${Pn(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && b.push(t`${l} DESC`);
+	for (let n of B(e)) b.push(n.direction === "desc" ? t`${t(n.column)} DESC` : t`${t(n.column)} ASC`);
+	let ae = b.length > 0 ? t` ORDER BY ${t.csv(b)}` : y ? t.onDialectOrElse({
 		mssql: () => t` ORDER BY (SELECT NULL)`,
 		orElse: () => t``
-	}) : t``, S = (e) => {
-		if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw E(`compileSelect: expected non-negative integer take/skip, got ${e}`);
+	}) : t``, x = (e) => {
+		if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw T(`compileSelect: expected non-negative integer take/skip, got ${e}`);
 		return t.unsafe(String(e));
-	}, ae = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${Y(e.descriptor, t, n)})`), oe = (e.ctes ?? []).some((e) => e.recursive === !0), se = ae.length > 0 ? t`WITH ${t.unsafe(oe ? "RECURSIVE " : "")}${t.csv(ae)} ` : t``;
+	}, oe = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${J(e.descriptor, t, n)})`), se = (e.ctes ?? []).some((e) => e.recursive === !0), ce = oe.length > 0 ? t`WITH ${t.unsafe(se ? "RECURSIVE " : "")}${t.csv(oe)} ` : t``;
 	return t.onDialectOrElse({
 		mssql: () => {
-			let n = e.take !== void 0 && !b ? t`TOP ${S(e.take)} ` : t``, r = b ? t` OFFSET ${S(e.skip)} ROWS FETCH NEXT ${S(e.take ?? 2 ** 53 - 1)} ROWS ONLY` : t``;
-			return t`${se}SELECT ${n}${f}${d} FROM ${te}${v}${re}${y}${ie}${r}`;
+			let n = e.take !== void 0 && !y ? t`TOP ${x(e.take)} ` : t``, r = y ? t` OFFSET ${x(e.skip)} ROWS FETCH NEXT ${x(e.take ?? 2 ** 53 - 1)} ROWS ONLY` : t``;
+			return t`${ce}SELECT ${n}${f}${d} FROM ${ne}${_}${ie}${v}${ae}${r}`;
 		},
 		orElse: () => {
-			let n = e.take === void 0 ? t`` : t` LIMIT ${S(e.take)}`, r = b ? t` OFFSET ${S(e.skip)}` : t``;
-			return t`${se}SELECT ${f}${d} FROM ${te}${v}${re}${y}${ie}${n}${r}${h}`;
+			let n = e.take === void 0 ? t`` : t` LIMIT ${x(e.take)}`, r = y ? t` OFFSET ${x(e.skip)}` : t``;
+			return t`${ce}SELECT ${f}${d} FROM ${ne}${_}${ie}${v}${ae}${n}${r}${ee}`;
 		}
 	});
-}, X = (e, t) => {
+}, Y = (e, t) => {
 	let n = (e) => {
 		if (typeof e != "string" || !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)$/.test(e)) return null;
 		let [t = "", n = ""] = e.replace(/^[+-]/, "").split("."), r = t.replace(/^0+/, "") || "0";
@@ -1787,74 +1795,74 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		a = t === n ? 0 : t > n ? 1 : -1;
 	}
 	return a === 0 ? 0 : (a > 0 ? 1 : -1) * (r.negative ? -1 : 1);
-}, Ln = (e, t) => ({
+}, zn = (e, t) => ({
 	column: e,
 	op: "eq",
 	value: t
-}), Rn = (e, t) => ({
+}), Bn = (e, t) => ({
 	column: e,
 	op: "neq",
 	value: t
-}), zn = (e, t) => ({
+}), Vn = (e, t) => ({
 	column: e,
 	op: "gt",
 	value: t
-}), Bn = (e, t) => ({
+}), Hn = (e, t) => ({
 	column: e,
 	op: "gte",
 	value: t
-}), Vn = (e, t) => ({
+}), Un = (e, t) => ({
 	column: e,
 	op: "lt",
 	value: t
-}), Hn = (e, t) => ({
+}), Wn = (e, t) => ({
 	column: e,
 	op: "lte",
 	value: t
-}), Un = (e, t) => ({
+}), Gn = (e, t) => ({
 	column: e,
 	op: "in",
 	value: t
-}), Wn = (e, t) => ({
+}), Kn = (e, t) => ({
 	column: e,
 	op: "notIn",
 	value: t
-}), Gn = (e, t) => ({
+}), qn = (e, t) => ({
 	column: e,
 	op: "contains",
 	value: t
-}), Kn = (e, t) => ({
+}), Jn = (e, t) => ({
 	column: e,
 	op: "startsWith",
 	value: t
-}), qn = (e, t) => ({
+}), Yn = (e, t) => ({
 	column: e,
 	op: "arrayContains",
 	value: t
-}), Jn = (e, t) => ({
+}), Xn = (e, t) => ({
 	column: e,
 	op: "arrayOverlaps",
 	value: t
-}), Yn = (e, t) => ({
+}), Zn = (e, t) => ({
 	column: e,
 	op: "arrayHas",
 	value: t
-}), Xn = {
+}), Qn = {
 	column: "id",
 	op: "in",
 	value: []
-}, Zn = (e) => ({
+}, $n = (e) => ({
 	column: e,
 	op: "isNull"
-}), Qn = (e) => ({
+}), er = (e) => ({
 	column: e,
 	op: "isNotNull"
-}), $n = (e, t) => ({
+}), tr = (e, t) => ({
 	column: e,
 	op: "spatial",
 	value: t
-}), er = (...e) => ({ and: e }), tr = (...e) => ({ or: e }), nr = (e) => ({ not: e }), rr = (e, ...t) => {
-	if (t.length === 0) throw E(`jsonField("${e}"): at least one path segment is required`);
+}), nr = (...e) => ({ and: e }), rr = (...e) => ({ or: e }), ir = (e) => ({ not: e }), ar = (e, ...t) => {
+	if (t.length === 0) throw T(`jsonField("${e}"): at least one path segment is required`);
 	let n = (n, r) => ({
 		column: e,
 		path: t,
@@ -1875,56 +1883,56 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		isNull: () => n("isNull"),
 		isNotNull: () => n("isNotNull")
 	};
-}, Z = (e) => "descriptor" in e ? e.descriptor : e, ir = (e, t) => ({
+}, X = (e) => "descriptor" in e ? e.descriptor : e, or = (e, t) => ({
 	column: e,
 	op: "subquery-in",
-	subquery: Z(t)
-}), ar = (e, t) => ({
+	subquery: X(t)
+}), sr = (e, t) => ({
 	column: e,
 	op: "subquery-not-in",
-	subquery: Z(t)
-}), or = (e) => ({
+	subquery: X(t)
+}), cr = (e) => ({
 	op: "exists",
-	subquery: Z(e)
-}), sr = (e) => ({
+	subquery: X(e)
+}), lr = (e) => ({
 	op: "not-exists",
-	subquery: Z(e)
-}), cr = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, lr = (e) => {
+	subquery: X(e)
+}), ur = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, dr = (e) => {
 	if (e instanceof Date) return e.getTime();
-	if (typeof e == "string" && cr.test(e)) {
+	if (typeof e == "string" && ur.test(e)) {
 		let t = Date.parse(e);
 		return Number.isNaN(t) ? void 0 : t;
 	}
-}, ur = (e, t) => {
+}, fr = (e, t) => {
 	if (!(e instanceof Date) && !(t instanceof Date)) return;
-	let n = lr(e), r = lr(t);
+	let n = dr(e), r = dr(t);
 	return n === void 0 || r === void 0 ? void 0 : [n, r];
-}, dr = (e, t) => {
+}, pr = (e, t) => {
 	if (e === t) return !0;
-	let n = ur(e, t);
+	let n = fr(e, t);
 	return n !== void 0 && n[0] === n[1];
-}, fr = (e, t) => {
+}, mr = (e, t) => {
 	if (e == null || t == null) return null;
-	let n = ur(e, t);
+	let n = fr(e, t);
 	if (n !== void 0) return n[0] === n[1] ? 0 : n[0] > n[1] ? 1 : -1;
 	let r = e instanceof Date ? e.getTime() : e, i = t instanceof Date ? t.getTime() : t;
 	return typeof r == typeof i ? r === i ? 0 : r > i ? 1 : -1 : null;
-}, Q = (e, t, n = null, r = {}) => {
+}, Z = (e, t, n = null, r = {}) => {
 	if (!t) return !1;
-	if ("not" in e) return !Q(e.not, t, n, r);
+	if ("not" in e) return !Z(e.not, t, n, r);
 	if ("and" in e) {
-		for (let i of e.and) if (!Q(i, t, n, r)) return !1;
+		for (let i of e.and) if (!Z(i, t, n, r)) return !1;
 		return !0;
 	}
 	if ("or" in e) {
-		for (let i of e.or) if (Q(i, t, n, r)) return !0;
+		for (let i of e.or) if (Z(i, t, n, r)) return !0;
 		return !1;
 	}
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
 		if (!n) return !1;
 		let i = n.get(e.subquery);
 		if (!(i instanceof Set)) return !1;
-		let a = t[e.column], o = r[e.column]?.type === "decimal" ? [...i].some((e) => X(a, e) === 0) : i.has(a);
+		let a = t[e.column], o = r[e.column]?.type === "decimal" ? [...i].some((e) => Y(a, e) === 0) : i.has(a);
 		return e.op === "subquery-in" ? o : !o;
 	}
 	if (e.op === "exists" || e.op === "not-exists") {
@@ -1932,7 +1940,7 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		let t = n.get(e.subquery), r = typeof t == "number" ? t > 0 : t instanceof Set && t.size > 0;
 		return e.op === "exists" ? r : !r;
 	}
-	let i = e, a = t[i.column], o = r[i.column]?.type === "decimal", s = (e, t) => o && e != null && t != null ? X(e, t) === 0 : dr(e, t), c = o ? X : fr;
+	let i = e, a = t[i.column], o = r[i.column]?.type === "decimal", s = (e, t) => o && e != null && t != null ? Y(e, t) === 0 : pr(e, t), c = o ? Y : mr;
 	switch (i.op) {
 		case "eq": return s(a, i.value);
 		case "neq": return !s(a, i.value);
@@ -1955,19 +1963,19 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		case "arrayHas": return Array.isArray(a) && a.includes(i.value);
 		case "isNull": return a == null;
 		case "isNotNull": return a != null;
-		case "spatial": throw E("@voltro/plugin-postgis: spatial predicates (ST_DWithin / ST_Contains / ST_Within / ST_Intersects / bbox &&) are not evaluable in-memory — use them in one-shot ctx.store.query reads, not reactive subscriptions.");
+		case "spatial": throw T("@voltro/plugin-postgis: spatial predicates (ST_DWithin / ST_Contains / ST_Within / ST_Intersects / bbox &&) are not evaluable in-memory — use them in one-shot ctx.store.query reads, not reactive subscriptions.");
 	}
-}, $ = function* (e) {
+}, Q = function* (e) {
 	if ("not" in e) {
-		yield* $(e.not);
+		yield* Q(e.not);
 		return;
 	}
 	if ("and" in e) {
-		for (let t of e.and) yield* $(t);
+		for (let t of e.and) yield* Q(t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* $(t);
+		for (let t of e.or) yield* Q(t);
 		return;
 	}
 	e.op === "subquery-in" || e.op === "subquery-not-in" ? yield {
@@ -1977,30 +1985,30 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		kind: "exists",
 		descriptor: e.subquery
 	});
-}, pr = function* (e, t = !0) {
+}, $ = function* (e, t = !0) {
 	if ("not" in e) {
-		yield* pr(e.not, !1);
+		yield* $(e.not, !1);
 		return;
 	}
 	if ("and" in e) {
-		for (let n of e.and) yield* pr(n, t);
+		for (let n of e.and) yield* $(n, t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* pr(t, !1);
+		for (let t of e.or) yield* $(t, !1);
 		return;
 	}
 	e.op !== "subquery-in" && e.op !== "subquery-not-in" && e.op !== "exists" && e.op !== "not-exists" && (yield {
 		...e,
 		conjunctive: t
 	});
-}, mr = (e, t) => ({
+}, hr = (e, t) => ({
 	name: e,
 	body: t
-}), hr = (e) => {
+}), gr = (e) => {
 	if (e.lifecycle === "cron" && !e.cron) throw Error(`seed "${e.id}": lifecycle 'cron' requires a 'cron' field`);
 	if (e.lifecycle === "onSchemaChange" && (!e.watchedTables || e.watchedTables.length === 0)) throw Error(`seed "${e.id}": lifecycle 'onSchemaChange' requires at least one entry in 'watchedTables'`);
-	let t = e.steps({ step: mr });
+	let t = e.steps({ step: hr });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -2013,75 +2021,76 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, gr = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, _r = null, vr = null, yr = (e) => {
-	_r = e;
-}, br = (e) => {
+}, _r = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, vr = null, yr = null, br = (e) => {
 	vr = e;
-}, xr = async (e) => {
-	let t = _r;
-	t !== null && await t(e);
+}, xr = (e) => {
+	yr = e;
 }, Sr = async (e) => {
 	let t = vr;
+	t !== null && await t(e);
+}, Cr = async (e) => {
+	let t = yr;
 	t !== null && e.changedTables.length !== 0 && await t(e);
-}, Cr = (e) => {
+}, wr = ["before-schema", "after-schema"], Tr = (e) => {
 	if (!e.id || e.id.length === 0) throw Error("migration: `id` is required + must be non-empty");
 	if (!e.up || !e.down) throw Error(`migration ${e.id}: both \`up\` and \`down\` must be functions`);
+	if (!wr.includes(e.phase)) throw Error(`migration ${e.id}: \`phase\` is required and must be one of ${wr.map((e) => `'${e}'`).join(" | ")} — 'before-schema' runs before the declarative apply (a shape change the planner must not compute against), 'after-schema' runs after it (a body that needs the new shape, such as a back-fill into a table this deploy creates)`);
 	return e;
-}, wr = Symbol.for("voltro.migration.irreversible"), Tr = class extends Error {
+}, Er = Symbol.for("voltro.migration.irreversible"), Dr = class extends Error {
 	migrationId;
 	reason;
 	_tag = "IrreversibleMigrationError";
 	constructor(e, t) {
 		super(`migration ${e} cannot be rolled back: ${t}`), this.migrationId = e, this.reason = t, this.name = "IrreversibleMigrationError";
 	}
-}, Er = (e) => {
+}, Or = (e) => {
 	if (!e || e.trim().length === 0) throw Error("irreversible(): a reason is required");
-	return Object.assign(() => t.fail(new Tr("<unknown>", e)), { [wr]: e });
-}, Dr = (e) => {
-	let t = e[wr];
+	return Object.assign(() => t.fail(new Dr("<unknown>", e)), { [Er]: e });
+}, kr = (e) => {
+	let t = e[Er];
 	return typeof t == "string" ? t : void 0;
-}, Or = class {
+}, Ar = class {
 	reason;
 	_tag = "MigrationSkipped";
 	constructor(e) {
 		this.reason = e;
 	}
-}, kr = class extends Error {
+}, jr = class extends Error {
 	migrationId;
 	failed;
 	_tag = "MigrationExpectationFailed";
 	constructor(e, t) {
 		super(`migration ${e}: ${t.length} post-condition(s) did not hold after up():\n` + t.map((e) => `  - ${e}`).join("\n") + "\n  The migration is NOT recorded; the next run applies it again."), this.migrationId = e, this.failed = t, this.name = "MigrationExpectationFailed";
 	}
-}, Ar = class extends Error {
+}, Mr = class extends Error {
 	migrationId;
 	dialect;
 	_tag = "TransactionBrokenByBodyError";
 	constructor(e, t) {
 		super(`migration ${e} is transactional, and its body COMMITTED the transaction from inside — on ${t} a DDL statement commits everything before it. The work is in the database and the migration is recorded; it will not run again. What did not hold is the all-or-nothing guarantee. Either mark it \`transactional: false\` (per-statement, resumable through your own idempotency) or move the schema change into \`ctx.schema\` in a migration of its own and keep this one to data.`), this.migrationId = e, this.dialect = t, this.name = "TransactionBrokenByBodyError";
 	}
-}, jr = class extends Error {
+}, Nr = class extends Error {
 	migrationId;
 	operation;
 	_tag = "MigrationNeedsSqlClient";
 	constructor(e, t, n) {
 		super(`migration ${e}: ${t} — ${n}`), this.migrationId = e, this.operation = t, this.name = "MigrationNeedsSqlClient";
 	}
-}, Mr = class extends Error {
+}, Pr = class extends Error {
 	table;
 	report;
 	_tag = "RewriteUnstableError";
 	constructor(e, t) {
 		super(`rewrite of ${e} did not stabilise after ${t.passes} pass(es): ${t.rewritten} rewritten, ${t.contended} contended on the last pass. Check for concurrent writes and guard values that cannot round-trip exactly before raising maxPasses.`), this.table = e, this.report = t, this.name = "RewriteUnstableError";
 	}
-}, Nr = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Pr = (e) => typeof e == "object" && !!e && "id" in e && "up" in e && "down" in e && typeof e.id == "string" && typeof e.up == "function" && typeof e.down == "function", Fr = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Ir = (e) => Fr.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Lr = "_voltro_staging_", Rr = (e) => e.startsWith(Lr), zr = /__dropped_\d{14}$/, Br = (e) => zr.test(e), Vr = 7, Hr = (e) => {
+}, Fr = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Ir = (e) => typeof e == "object" && !!e && "id" in e && "up" in e && "down" in e && typeof e.id == "string" && typeof e.up == "function" && typeof e.down == "function", Lr = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Rr = (e) => Lr.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), zr = "_voltro_staging_", Br = (e) => e.startsWith(zr), Vr = /__dropped_\d{14}$/, Hr = (e) => Vr.test(e), Ur = 7, Wr = (e) => {
 	let t = /__dropped_(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})$/.exec(e);
 	if (t === null) return;
 	let [, n, r, i, a, o, s] = t;
 	return new Date(Date.UTC(Number(n), Number(r) - 1, Number(i), Number(a), Number(o), Number(s)));
-}, Ur = (e, t = {}) => {
+}, Gr = (e, t = {}) => {
 	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
-		let a = Hr(e);
+		let a = Wr(e);
 		if (a === void 0) return;
 		let o = Math.floor((n.getTime() - a.getTime()) / 864e5);
 		o >= r && i.push({
@@ -2090,137 +2099,137 @@ var Xt = (e, t, n) => Zt(e, "id", t, n), Zt = (e, t, n, r, i = "asc") => {
 			ageDays: o
 		});
 	};
-	for (let t of e.tables) if (a(t.name, t.name), !Br(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
+	for (let t of e.tables) if (a(t.name, t.name), !Hr(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
 	return i;
-}, Wr = (e, t) => {
+}, Kr = (e, t) => {
 	let n = e.reduce((e, t) => e.ageDays >= t.ageDays ? e : t), r = (/* @__PURE__ */ new Date(Date.now() - t * 864e5)).toISOString().slice(0, 10);
 	return `${e.length} soft-drop snapshot(s) older than ${t} day(s) still hold the dropped data (oldest: ${n.name}, ${n.ageDays}d) — ${e.map((e) => e.name).join(", ")}. Restore with \`voltro db restore-snapshot\` or reclaim with \`voltro db gc-snapshots --before ${r}\`; the window is \`database.softDropRetentionDays\` in app.config.`;
-}, Gr = (e, t) => e.filter((e) => !Ir(e.name) || t.has(e.name)), Kr = L("_voltro_migrations", {
+}, qr = (e, t) => e.filter((e) => !Rr(e.name) || t.has(e.name)), Jr = I("_voltro_migrations", {
 	id: f({ prefix: "mig" }),
 	name: p(),
 	hash: p(),
 	status: p(),
-	appliedAt: v().nullable(),
+	appliedAt: _().nullable(),
 	durationMs: m().nullable(),
 	errorMessage: p().nullable(),
 	errorStack: p().nullable(),
 	workflowRunId: p().nullable(),
-	createdAt: v().default("now"),
-	updatedAt: v().default("now").onUpdate("now")
-}).index(["status"]), qr = L("_voltro_seeds", {
+	createdAt: _().default("now"),
+	updatedAt: _().default("now").onUpdate("now")
+}).index(["status"]), Yr = I("_voltro_seeds", {
 	id: f({ prefix: "seed" }),
 	name: p(),
 	lifecycle: p(),
 	fingerprint: p(),
 	cronSchedule: p().nullable(),
-	watchedTables: y().nullable(),
-	nextRunAt: v().nullable(),
+	watchedTables: v().nullable(),
+	nextRunAt: _().nullable(),
 	lastRunStatus: p().nullable(),
-	lastRunAt: v().nullable(),
+	lastRunAt: _().nullable(),
 	lastRunDurationMs: m().nullable(),
 	lastRunRowsTouched: m().nullable(),
 	lastError: p().nullable(),
 	workflowRunId: p().nullable(),
-	createdAt: v().default("now"),
-	updatedAt: v().default("now").onUpdate("now")
-}).index(["lifecycle"]).index(["nextRunAt"]), Jr = L("_voltro_migration_plans", {
+	createdAt: _().default("now"),
+	updatedAt: _().default("now").onUpdate("now")
+}).index(["lifecycle"]).index(["nextRunAt"]), Xr = I("_voltro_migration_plans", {
 	id: f({ prefix: "plan" }),
 	fingerprint: p(),
 	liveFingerprint: p().nullable(),
-	operations: y(),
-	rollbackPlan: y().nullable(),
+	operations: v(),
+	rollbackPlan: v().nullable(),
 	appliedBy: p(),
 	environment: p(),
 	source: p(),
 	onlineStrategy: p().nullable(),
 	durationMs: m(),
 	notes: p().nullable(),
-	squashedAt: v().nullable(),
-	appliedAt: v().default("now"),
-	createdAt: v().default("now"),
-	updatedAt: v().default("now").onUpdate("now")
-}).index(["fingerprint"]).index(["environment"]), Yr = L("_voltro_idempotency", {
+	squashedAt: _().nullable(),
+	appliedAt: _().default("now"),
+	createdAt: _().default("now"),
+	updatedAt: _().default("now").onUpdate("now")
+}).index(["fingerprint"]).index(["environment"]), Zr = I("_voltro_idempotency", {
 	id: f({ prefix: "idem" }),
 	scope: p(),
 	key: p(),
 	status: p(),
-	response: y().nullable(),
-	createdAt: v().default("now")
-}).unique(["scope", "key"]).index(["createdAt"]), Xr = L("_voltro_devices", {
+	response: v().nullable(),
+	createdAt: _().default("now")
+}).unique(["scope", "key"]).index(["createdAt"]), Qr = I("_voltro_devices", {
 	id: f({ prefix: "device" }),
 	tenantId: p(),
 	name: p(),
-	scopes: y().nullable(),
+	scopes: v().nullable(),
 	pairingHash: p().maxLength(64).nullable(),
-	pairingExpiresAt: v().nullable(),
+	pairingExpiresAt: _().nullable(),
 	accessHash: p().maxLength(64).nullable(),
-	accessExpiresAt: v().nullable(),
+	accessExpiresAt: _().nullable(),
 	refreshHash: p().maxLength(64).nullable(),
-	refreshExpiresAt: v().nullable(),
+	refreshExpiresAt: _().nullable(),
 	previousRefreshHash: p().maxLength(64).nullable(),
 	generation: m().default(0),
-	pairedAt: v().nullable(),
-	lastSeenAt: v().nullable(),
-	revokedAt: v().nullable(),
+	pairedAt: _().nullable(),
+	lastSeenAt: _().nullable(),
+	revokedAt: _().nullable(),
 	revokedReason: p().nullable(),
 	createdBy: p().nullable(),
-	metadata: y().nullable(),
-	createdAt: v()
-}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), Zr = L("_voltro_tenant_selections", {
+	metadata: v().nullable(),
+	createdAt: _()
+}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), $r = I("_voltro_tenant_selections", {
 	id: f({ prefix: "tsel" }),
 	subjectType: p().maxLength(32),
 	subjectId: p(),
 	tenantId: p(),
-	selectedAt: v()
-}).primaryKey(["id"]).nonReactive(), Qr = L("_voltro_kv", {
+	selectedAt: _()
+}).primaryKey(["id"]).nonReactive(), ei = I("_voltro_kv", {
 	id: f({ prefix: "kv" }),
 	key: p().unique(),
 	value: p().nullable(),
-	expiresAt: v().nullable(),
-	createdAt: v().default("now"),
-	updatedAt: v().default("now").onUpdate("now")
-}).index(["expiresAt"]), $r = L("_voltro_api_keys", {
+	expiresAt: _().nullable(),
+	createdAt: _().default("now"),
+	updatedAt: _().default("now").onUpdate("now")
+}).index(["expiresAt"]), ti = I("_voltro_api_keys", {
 	id: f({ prefix: "apikey" }),
 	tenantId: p().nullable(),
 	name: p(),
 	hashedKey: p().maxLength(64).unique(),
 	keyPrefix: p(),
-	scopes: y().nullable(),
-	lastUsedAt: v().nullable(),
+	scopes: v().nullable(),
+	lastUsedAt: _().nullable(),
 	requestCount: m().default(0),
-	expiresAt: v().nullable(),
-	revokedAt: v().nullable(),
+	expiresAt: _().nullable(),
+	revokedAt: _().nullable(),
 	createdBy: p().nullable(),
 	onBehalfOf: p().nullable(),
-	metadata: y().nullable(),
-	createdAt: v().default("now")
-}).index("byApiKeyTenant", ["tenantId"]), ei = L("_voltro_replica_observations", {
+	metadata: v().nullable(),
+	createdAt: _().default("now")
+}).index("byApiKeyTenant", ["tenantId"]), ni = I("_voltro_replica_observations", {
 	id: f({ prefix: "robs" }),
 	replicaId: p().maxLength(191),
-	startedAt: v(),
+	startedAt: _(),
 	version: p().maxLength(64).nullable(),
 	kind: p().maxLength(64),
 	payload: p().nullable(),
 	reachableAt: p().maxLength(255).nullable(),
-	writtenAt: v().default("now").onUpdate("now")
-}).unique(["replicaId", "kind"]).index(["kind"]), ti = [
-	Kr,
-	qr,
-	Jr
-], ni = "_voltro_replace_in_progress", ri = L(ni, {
+	writtenAt: _().default("now").onUpdate("now")
+}).unique(["replicaId", "kind"]).index(["kind"]), ri = [
+	Jr,
+	Yr,
+	Xr
+], ii = "_voltro_replace_in_progress", ai = I(ii, {
 	id: f({ prefix: "repl" }),
-	startedAt: v().default("now"),
+	startedAt: _().default("now"),
 	kind: p().default("replace"),
 	tables: p().nullable(),
 	capture: p().nullable(),
 	via: p(),
 	staging: p().nullable(),
-	heartbeatAt: v().nullable(),
-	resumable: _().nullable()
-}), ii = 30, ai = (e, t) => {
+	heartbeatAt: _().nullable(),
+	resumable: g().nullable()
+}), oi = 30, si = (e, t) => {
 	let n = typeof t == "number" && Number.isFinite(t) && t > 0 ? t : 30, r = Number(e.VOLTRO_STAGING_STALE_MINUTES);
 	return (Number.isFinite(r) && r > 0 ? r : n) * 6e4;
-}, oi = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), si = (e) => {
+}, ci = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), li = (e) => {
 	let t = e.filter((e) => e.kind !== "staging");
 	if (t.length !== 0) return `refusing to start: a destructive data operation did not finish.
 ${t.map((e) => {
@@ -2235,7 +2244,7 @@ ${t.map((e) => {
 
   When the data is back, or you have decided the current state is correct, clear the marker:
       voltro data clear-replace-marker --yes`;
-}, ci = (e, t, n) => {
+}, ui = (e, t, n) => {
 	let r = e.filter((e) => e.kind === "staging");
 	return {
 		all: r,
@@ -2245,7 +2254,7 @@ ${t.map((e) => {
 			return Number.isFinite(r) ? t - r >= n : !1;
 		})
 	};
-}, li = (e, t) => {
+}, di = (e, t) => {
 	if (e.all.length === 0) return;
 	let n = new Set(e.droppable.map((e) => e.id));
 	return `staged data-import leftovers:
@@ -2256,4 +2265,4 @@ ${e.all.map((e) => {
   a reason to refuse the boot — it is a reason to know the disk is holding a copy of a bundle.`;
 };
 //#endregion
-export { Ln as $, be as $n, Pt as $t, Tr as A, it as An, ae as Ar, xn as At, hr as B, j as Bn, nn as Bt, Wr as C, ft as Cn, y as Cr, Y as Ct, Gr as D, ct as Dn, c as Dr, _n as Dt, Rr as E, dt as En, pe as Er, Tn as Et, Ar as F, ze as Fn, ln as Ft, yr as G, Ne as Gn, jt as Gt, xr as H, E as Hn, qt as Ht, Er as I, Be as In, fn as It, qn as J, we as Jn, Bt as Jt, Xn as K, Ie as Kn, Qt as Kt, Dr as L, Ve as Ln, $t as Lt, jr as M, at as Mn, p as Mr, G as Mt, Or as N, rt as Nn, v as Nr, cn as Nt, Hr as O, st as On, h as Or, gn as Ot, Mr as P, et as Pn, ce as Pr, un as Pt, Gn as Q, ye as Qn, Ft as Qt, Pr as R, M as Rn, tn as Rt, Ur as S, R as Sn, ue as Sr, En as St, Br as T, L as Tn, ee as Tr, wn as Tt, gr as U, De as Un, It as Ut, Sr as V, P as Vn, Nt as Vt, br as W, T as Wn, At as Wt, Jn as X, Fe as Xn, Wt as Xt, Yn as Y, Pe as Yn, zt as Yt, $ as Z, Te as Zn, Gt as Zt, Zr as _, Tt as _n, se as _r, $n as _t, li as a, Jt as an, S as ar, ir as at, Fr as b, yt as bn, f as br, X as bt, ai as c, Kt as cn, _ as cr, rr as ct, Yr as d, Et as dn, l as dr, Rn as dt, V as en, _e as er, Q as et, Qr as f, Ot as fn, s as fr, nr as ft, qr as g, Ct as gn, g as gr, tr as gt, ei as h, kt as hn, ne as hr, ar as ht, si as i, Ht as in, u as ir, Un as it, kr as j, ot as jn, o as jr, bn as jt, Nr as k, lt as kn, oe as kr, K as kt, $r as l, Lt as ln, b as lr, Vn as lt, Kr as m, B as mn, re as mr, Wn as mt, ii as n, Xt as nn, ge as nr, zn as nt, ci as o, Vt as on, le as or, Qn as ot, Jr as p, wt as pn, x as pr, sr as pt, er as q, Le as qn, Ut as qt, ri as r, Yt as rn, he as rr, Bn as rt, oi as s, Mt as sn, te as sr, Zn as st, ni as t, Zt as tn, ve as tr, or as tt, Xr as u, Rt as un, ie as ur, Hn as ut, ti as v, Dt as vn, de as vr, Kn as vt, Ir as w, ut as wn, C as wr, q as wt, Lr as x, vt as xn, m as xr, J as xt, Vr as y, bt as yn, fe as yr, pr as yt, Cr as z, N as zn, en as zt };
+export { qn as $, Ee as $n, Lt as $t, Dr as A, dt as An, ee as Ar, G as At, Tr as B, M as Bn, nn as Bt, Kr as C, L as Cn, m as Cr, On as Ct, qr as D, pt as Dn, te as Dr, Dn as Dt, Br as E, I as En, S as Er, En as Et, Pr as F, nt as Fn, _ as Fr, fn as Ft, xr as G, w as Gn, Mt as Gt, Cr as H, N as Hn, Ft as Ht, Mr as I, Ve as In, le as Ir, dn as It, nr as J, Re as Jn, Gt as Jt, br as K, Pe as Kn, Nt as Kt, Or as L, He as Ln, mn as Lt, jr as M, ct as Mn, oe as Mr, Sn as Mt, Nr as N, st as Nn, o as Nr, W as Nt, Wr as O, ut as On, me as Or, yn as Ot, Ar as P, at as Pn, p as Pr, un as Pt, Q, Ie as Qn, qt as Qt, kr as R, Ue as Rn, tn as Rt, Gr as S, bt as Sn, f as Sr, q as St, Hr as T, ft as Tn, v as Tr, K as Tt, Sr as U, T as Un, Yt as Ut, gr as V, A as Vn, an as Vt, _r as W, Oe as Wn, Rt as Wt, Zn as X, Te as Xn, Vt as Xt, Yn as Y, ze as Yn, Ht as Yt, Xn as Z, Fe as Zn, Kt as Zt, $r as _, Tt as _n, re as _r, rr as _t, di as a, Wt as an, ge as ar, Gn as at, Lr as b, St as bn, fe as br, $ as bt, si as c, Pt as cn, ue as cr, $n as ct, Zr as d, Bt as dn, y as dr, Wn as dt, It as en, be as er, zn as et, ei as f, Ot as fn, ae as fr, Bn as ft, Yr as g, jt as gn, ie as gr, sr as gt, ni as h, z as hn, b as hr, Kn as ht, li as i, Zt as in, _e as ir, Hn as it, wr as j, ot as jn, se as jr, Cn as jt, Fr as k, lt as kn, c as kr, vn as kt, ti as l, Jt as ln, ne as lr, ar as lt, Jr as m, Et as mn, s as mr, lr as mt, oi as n, $t as nn, ve as nr, cr as nt, ui as o, Xt as on, u as or, or as ot, Xr as p, At as pn, l as pr, ir as pt, Qn as q, Le as qn, en as qt, ai as r, Qt as rn, ye as rr, Vn as rt, ci as s, Ut as sn, x as sr, er as st, ii as t, B as tn, xe as tr, Z as tt, Qr as u, zt as un, g as ur, Un as ut, ri as v, Dt as vn, h as vr, tr as vt, Rr as w, mt as wn, de as wr, J as wt, zr as x, xt as xn, pe as xr, Y as xt, Ur as y, kt as yn, ce as yr, Jn as yt, Ir as z, j as zn, rn as zt };