@voltro/database 0.84.0 → 0.85.0

package/dist/{replaceInProgress-DUHl5JEz.js → replaceInProgress-DC88Pdiy.js}

@@ -1,16 +1,17 @@
-import { Cause as e, Effect as t, Runtime as n, Schema as r } from "effect";
-import { typeid as i } from "typeid-js";
-import { ulid as a } from "ulidx";
+import { Cause as e, Effect as t, Exit as n, Schema as r, Struct as i } from "effect";
+import { typeid as a } from "typeid-js";
+import { ulid as o } from "ulidx";
+import { SqlError as s, UnknownError as c } from "effect/sql/SqlError";
 //#region src/columns.ts
-var o = (e) => {
+var l = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) r.serverOnly === !0 && t.push(n);
 	return t;
-}, s = (e) => {
+}, u = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
 	return t;
-}, c = (e) => {
+}, d = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) {
 		let e = r.readableBy;
@@ -20,11 +21,11 @@ var o = (e) => {
 		});
 	}
 	return t;
-}, l = (e) => {
+}, f = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
 	return t;
-}, u = class e {
+}, p = class e {
 	definition;
 	constructor(e) {
 		this.definition = e;
@@ -185,14 +186,14 @@ var o = (e) => {
 	__definition() {
 		return this.definition;
 	}
-}, d = (e) => new u({
+}, m = (e) => new p({
 	type: e,
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1
 });
-function f(e) {
-	return new u({
+function h(e) {
+	return new p({
 		type: "id",
 		nullable: !1,
 		unique: !0,
@@ -200,10 +201,10 @@ function f(e) {
 		idSchemeInput: e
 	});
 }
-var p = () => d("text"), m = () => d("integer"), h = () => d("real"), g = (e, t = 0) => {
+var g = () => m("text"), _ = () => m("integer"), v = () => m("real"), y = (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({
+	return new p({
 		type: "decimal",
 		nullable: !1,
 		unique: !1,
@@ -212,12 +213,12 @@ var p = () => d("text"), m = () => d("integer"), h = () => d("real"), g = (e, t
 		scale: t,
 		sqliteDecimalEncoding: "sortable-v1"
 	});
-}, _ = g, v = () => d("bigint"), y = (e, t) => {
+}, b = y, x = () => m("bigint"), S = (e, t) => {
 	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
 	return {
 		name: e,
 		values: t,
-		column: () => new u({
+		column: () => new p({
 			type: "enum",
 			nullable: !1,
 			unique: !1,
@@ -226,38 +227,38 @@ var p = () => d("text"), m = () => d("integer"), h = () => d("real"), g = (e, t
 			enumValues: t
 		})
 	};
-}, b = () => d("boolean"), x = () => d("timestamp"), S = () => d("date"), C = () => d("json"), w = () => d("bytes"), T = () => new u({
+}, C = () => m("boolean"), w = () => m("timestamp"), T = () => m("date"), E = () => m("json"), D = () => m("bytes"), O = () => new p({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), E = () => new u({
+}), k = () => new p({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), D = () => new u({
+}), ee = () => new p({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtSealed: !0
-}), ee = () => new u({
+}), A = () => new p({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), O = () => {
+}), j = () => {
 	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 te(e) {
-	return k(O, e);
+function M(e) {
+	return N(j, e);
 }
-function k(e, t) {
-	return new u({
+function N(e, t) {
+	return new p({
 		type: "reference",
 		nullable: !1,
 		unique: !1,
@@ -272,15 +273,15 @@ function k(e, t) {
 		...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
 	});
 }
-var A = () => new u({
+var P = () => new p({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), j = (e) => Object.keys(e.fields).filter((t) => e.fields[t]?.dropped !== !0), ne = (e, t) => {
+}), F = (e) => Object.keys(e.fields).filter((t) => e.fields[t]?.dropped !== !0), te = (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({
+	return new p({
 		type: "vector",
 		nullable: !1,
 		unique: !1,
@@ -288,13 +289,13 @@ var A = () => new u({
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, M = (e) => new u({
+}, I = (e) => new p({
 	type: "array",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	arrayElement: e.__definition().type
-}), re = () => d("interval"), ie = (e, t = 4326) => new u({
+}), ne = () => m("interval"), re = (e, t = 4326) => new p({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -304,7 +305,7 @@ var A = () => new u({
 		geomKind: e,
 		srid: t
 	}
-}), ae = (e, t = 4326) => new u({
+}), ie = (e, t = 4326) => new p({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -314,182 +315,194 @@ var A = () => new u({
 		geomKind: e,
 		srid: t
 	}
-}), oe = (e) => new u({
+}), ae = (e) => new p({
 	type: "raw",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	rawDdl: e
-}), se = (e) => {
+}), oe = (e) => {
 	let t = {};
 	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
 	return t;
-}, ce = /* @__PURE__ */ new WeakMap(), le = (e) => typeof e == "object" && e ? ce.get(e) : void 0, ue = (e, t = {}) => {
-	let n = p();
-	return ce.set(n, {
+}, se = Symbol.for("@voltro/database/pluginRefSpec"), ce = (e) => {
+	if (typeof e == "object" && e) return ("__definition" in e && typeof e.__definition == "function" ? e.__definition() : e)[se];
+}, le = (e, t = {}) => {
+	let n = {
 		target: e,
 		orphanPolicy: t.orphanPolicy ?? "keep",
 		onSoftDelete: t.onSoftDelete ?? !1
-	}), n;
-}, N = /* @__PURE__ */ new Map(), de = (e, t) => {
+	};
+	return new p({
+		...g().__definition(),
+		[se]: n
+	});
+}, ue = /* @__PURE__ */ new Map(), de = (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 = N.get(e) ?? [];
+	let n = ue.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), N.set(e, n);
-}, fe = (e) => N.get(e) ?? [], pe = () => N, me = () => {
-	N.clear();
-}, he = (t) => {
-	let r = t;
-	for (let t = 0; t < 4 && n.isFiberFailure(r); t++) r = e.squash(r[n.FiberFailureCauseId]);
-	return r;
-}, ge = (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(...ge(e, r + 1));
-	return o;
-}, _e = (e) => e.dbCode !== void 0 || e.dbErrno !== void 0 || e.dbNumber !== void 0 || e.dbSqlState !== void 0 || e.dbConstraint !== void 0, ve = (e) => {
-	let t = {}, n = [], r = he(e);
+	n.push(t), ue.set(e, n);
+}, fe = (e) => ue.get(e) ?? [], pe = () => ue, me = () => {
+	ue.clear();
+}, he = (t) => e.isCause(t) ? t : n.isExit(t) && n.isFailure(t) ? t.cause : typeof t == "object" && t && e.isCause(t.voltroCause) ? t.voltroCause : void 0, ge = (t) => {
+	let n = he(t);
+	return n === void 0 ? t : e.squash(n);
+}, _e = (t, n = 0) => {
+	let r = n >= 4 ? void 0 : he(t);
+	if (r === void 0) return [t];
+	let i = r.reasons.flatMap((t) => e.isFailReason(t) ? [t.error] : e.isDieReason(t) ? [t.defect] : []);
+	if (i.length === 0) return [e.squash(r)];
+	let a = [];
+	for (let e of i.slice(0, 8)) a.push(..._e(e, n + 1));
+	return a;
+}, ve = (e) => e.dbCode !== void 0 || e.dbErrno !== void 0 || e.dbNumber !== void 0 || e.dbSqlState !== void 0 || e.dbConstraint !== void 0, ye = {
+	9: "SQLITE_INTERRUPT",
+	275: "SQLITE_CONSTRAINT_CHECK",
+	787: "SQLITE_CONSTRAINT_FOREIGNKEY",
+	1299: "SQLITE_CONSTRAINT_NOTNULL",
+	1555: "SQLITE_CONSTRAINT_PRIMARYKEY",
+	2067: "SQLITE_CONSTRAINT_UNIQUE"
+}, be = (e) => {
+	let t = {}, n = [], r = ge(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);
+		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.dbErrno === void 0 && typeof e.errcode == "number" && (t.dbErrno = e.errcode), t.dbCode === "ERR_SQLITE_ERROR" && typeof t.dbErrno == "number" && (t.dbCode = ye[t.dbErrno] ?? t.dbCode), 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 = he(e.cause);
+		(o || s) && n.push(`${o || "Error"}${s ? `: ${s.slice(0, 200)}` : ""}`), r = ge(e.reason ?? e.cause);
 	}
 	return n.length > 0 && (t.dbCauseChain = n.join(" ← "), t.dbMessage === void 0 && (t.dbMessage = n[n.length - 1])), t;
-}, ye = (e) => {
-	let t = ge(e).map(ve);
+}, xe = (e) => {
+	let t = _e(e).map(be);
 	if (t.length <= 1) return t[0] ?? {};
-	let n = t.find(_e) ?? t[0], r = t.filter((e) => e !== n).map((e) => e.dbCauseChain).filter((e) => typeof e == "string");
+	let n = t.find(ve) ?? 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(" ‖ ")
 	};
-}, be = (e, t) => {
-	let n = Se(e);
+}, Se = (e, t) => {
+	let n = we(e);
 	if (n !== void 0) return n;
-	let r = ye(e), i = Oe(r, t);
+	let r = xe(e), i = Ae(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 = Te(e);
-	return a !== void 0 && Ce.test(String(a)) ? `${o} (${String(a)})` : o;
-}, xe = Symbol.for("@voltro/database/authoredMessage"), P = (e, t) => {
+	let a = r.dbCode ?? r.dbSqlState ?? r.dbErrno ?? r.dbNumber, o = De(e);
+	return a !== void 0 && Te.test(String(a)) ? `${o} (${String(a)})` : o;
+}, Ce = Symbol.for("@voltro/database/authoredMessage"), L = (e, t) => {
 	let n = t === void 0 ? Error(e) : Error(e, t);
-	return Object.defineProperty(n, xe, {
+	return Object.defineProperty(n, Ce, {
 		value: !0,
 		enumerable: !1
 	}), n;
-}, Se = (e) => {
-	for (let t of ge(e)) {
+}, we = (e) => {
+	for (let t of _e(e)) {
 		let e = t;
 		for (let t = 0; typeof e == "object" && e && t < 8; t += 1) {
-			if (e[xe] === !0) {
+			if (e[Ce] === !0) {
 				let t = e.message;
 				if (typeof t == "string" && t.length > 0) return t;
 			}
 			e = e.cause;
 		}
 	}
-}, Ce = /^[A-Za-z0-9_]{1,32}$/, we = /^[A-Za-z_][A-Za-z0-9_]{0,63}$/, Te = (e) => {
+}, Te = /^[A-Za-z0-9_]{1,32}$/, Ee = /^[A-Za-z_][A-Za-z0-9_]{0,63}$/, De = (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 && we.test(r) ? r : "unknown";
-}, Ee = /^[A-Za-z_][A-Za-z0-9_$]*$/, F = (e) => e !== void 0 && e.length <= 128 && Ee.test(e) ? e : void 0, De = (e) => e === void 0 ? void 0 : e.split(".").pop() ?? e, I = (e, ...t) => {
+	return r !== void 0 && Ee.test(r) ? r : "unknown";
+}, Oe = /^[A-Za-z_][A-Za-z0-9_$]*$/, R = (e) => e !== void 0 && e.length <= 128 && Oe.test(e) ? e : void 0, ke = (e) => e === void 0 ? void 0 : e.split(".").pop() ?? e, z = (e, ...t) => {
 	for (let n of t) {
 		let t = n.exec(e);
 		if (t?.[1] !== void 0) return t[1];
 	}
-}, Oe = (e, t) => {
+}, Ae = (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 = F(e.dbConstraint);
+		let t = R(e.dbConstraint);
 		return {
 			kind: /is still referenced from table/i.test(o) ? "foreignKeyInUse" : "foreignKey",
 			...t === void 0 ? {} : { constraint: t }
 		};
 	}
 	if (n === "23505") {
-		let t = F(e.dbConstraint);
+		let t = R(e.dbConstraint);
 		return {
 			kind: "unique",
 			...t === void 0 ? {} : { constraint: t }
 		};
 	}
 	if (n === "23502") {
-		let t = F(e.dbColumn);
+		let t = R(e.dbColumn);
 		return {
 			kind: "notNull",
 			...t === void 0 ? {} : { column: t }
 		};
 	}
 	if (n === "23514") {
-		let t = F(e.dbConstraint);
+		let t = R(e.dbConstraint);
 		return {
 			kind: "check",
 			...t === void 0 ? {} : { constraint: t }
 		};
 	}
 	if (r === 1452 || r === 1451) {
-		let e = F(I(o, /CONSTRAINT `([^`]+)`/));
+		let e = R(z(o, /CONSTRAINT `([^`]+)`/));
 		return {
 			kind: r === 1451 ? "foreignKeyInUse" : "foreignKey",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
 	if (r === 1062) {
-		let e = F(De(I(o, /for key '([^']+)'/)));
+		let e = R(ke(z(o, /for key '([^']+)'/)));
 		return {
 			kind: "unique",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
 	if (r === 1048 || r === 1364) {
-		let e = F(I(o, /Column '([^']+)' cannot be null/, /Field '([^']+)' doesn't have a default value/));
+		let e = R(z(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 = F(I(o, /Check constraint '([^']+)'/, /CONSTRAINT `([^`]+)` failed/));
+		let e = R(z(o, /Check constraint '([^']+)'/, /CONSTRAINT `([^`]+)` failed/));
 		return {
 			kind: "check",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
 	if (i === 547) {
-		let e = I(o, /(?:FOREIGN KEY|REFERENCE) constraint "([^"]+)"/), t = I(o, /CHECK constraint "([^"]+)"/);
+		let e = z(o, /(?:FOREIGN KEY|REFERENCE) constraint "([^"]+)"/), t = z(o, /CHECK constraint "([^"]+)"/);
 		if (t !== void 0 && e === void 0) {
-			let e = F(t);
+			let e = R(t);
 			return {
 				kind: "check",
 				...e === void 0 ? {} : { constraint: e }
 			};
 		}
-		let n = /REFERENCE constraint/.test(o), r = F(e);
+		let n = /REFERENCE constraint/.test(o), r = R(e);
 		return {
 			kind: n ? "foreignKeyInUse" : "foreignKey",
 			...r === void 0 ? {} : { constraint: r }
 		};
 	}
 	if (i === 2627 || i === 2601) {
-		let e = F(I(o, /(?:UNIQUE KEY|PRIMARY KEY) constraint '([^']+)'/, /index '([^']+)'/));
+		let e = R(z(o, /(?:UNIQUE KEY|PRIMARY KEY) constraint '([^']+)'/, /index '([^']+)'/));
 		return {
 			kind: "unique",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
 	if (i === 515) {
-		let e = F(I(o, /Cannot insert the value NULL into column '([^']+)'/));
+		let e = R(z(o, /Cannot insert the value NULL into column '([^']+)'/));
 		return {
 			kind: "notNull",
 			...e === void 0 ? {} : { column: e }
@@ -497,40 +510,40 @@ var A = () => 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 = F(De(I(o, /UNIQUE constraint failed: ([^,\s]+)/)));
+		let e = R(ke(z(o, /UNIQUE constraint failed: ([^,\s]+)/)));
 		return {
 			kind: "unique",
 			...e === void 0 ? {} : { column: e }
 		};
 	}
 	if (n === "SQLITE_CONSTRAINT_NOTNULL") {
-		let e = F(De(I(o, /NOT NULL constraint failed: ([^,\s]+)/)));
+		let e = R(ke(z(o, /NOT NULL constraint failed: ([^,\s]+)/)));
 		return {
 			kind: "notNull",
 			...e === void 0 ? {} : { column: e }
 		};
 	}
 	if (n === "SQLITE_CONSTRAINT_CHECK") {
-		let e = F(I(a, /CHECK constraint failed: (.+)$/));
+		let e = R(z(a, /CHECK constraint failed: (.+)$/));
 		return {
 			kind: "check",
 			...e === void 0 ? {} : { constraint: e }
 		};
 	}
-}, ke = (e) => {
-	let t = Oe(e)?.kind;
+}, je = (e) => {
+	let t = Ae(e)?.kind;
 	return t === "foreignKey" || t === "foreignKeyInUse";
-}, Ae = (e) => {
+}, Me = (e) => {
 	let t = e.dbCode, n = e.dbErrno;
 	return t === "57014" || n === 3024 || n === 1969 || t === "ETIMEOUT" || t === "SQLITE_INTERRUPT";
-}, je = (e) => {
+}, Ne = (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 = I(t, /for column [`']?(?:[^`'.]+[`']?\.[`']?)*([^`'.]+)[`']? at row/);
+	let n = z(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.`;
-}, Me = (e) => {
-	let t = ye(e), n = [
+}, Pe = (e) => {
+	let t = xe(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)}`,
@@ -539,9 +552,9 @@ var A = () => new u({
 		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;
-	let c = je(t), l = c === void 0 ? "" : `\n  hint: ${c}`;
+	let c = Ne(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;
-}, Ne = (e) => Object.entries(e).map(([e, t]) => `${e}:${Pe(t)}`).join(" "), Pe = (e) => {
+}, Fe = (e) => Object.entries(e).map(([e, t]) => `${e}:${Ie(t)}`).join(" "), Ie = (e) => {
 	if (e === null) return "null";
 	if (e === void 0) return "undefined";
 	if (typeof e == "bigint") return "bigint";
@@ -551,24 +564,24 @@ var A = () => 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";
-}, Fe = 63, Ie = 60, Le = [], Re = (e) => {
-	Le.includes(e) || Le.push(e);
-}, ze = () => {
-	let e = Le.slice();
-	return Le.length = 0, e;
-}, Be = /^[a-zA-Z_][a-zA-Z0-9_]*$/, Ve = (e, t) => {
+}, Le = 63, Re = 60, ze = /* @__PURE__ */ new Set(), Be = (e) => {
+	ze.add(e);
+}, Ve = () => {
+	let e = [...ze];
+	return ze.clear(), e;
+}, He = /^[a-zA-Z_][a-zA-Z0-9_]*$/, Ue = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!Be.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_]*$/.`);
-}, He = (e) => {
-	if (Ve("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 && Re(`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.`);
-}, Ue = (e, t) => {
-	if (Ve("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 && Re(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
-}, L = (e, t, n, r) => {
-	if (Ve("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 && Re(`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.` : ""}`);
-}, We = (e, t) => {
+	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_]*$/.`);
+}, We = (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 && Be(`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.`);
+}, Ge = (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 && Be(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
+}, B = (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 && Be(`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.` : ""}`);
+}, Ke = (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_]*$/.";
@@ -578,44 +591,44 @@ var A = () => 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 && Re(`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).`);
-}, Ge = 1704067200000n, Ke = 10n, qe = 12n, Je = (1n << Ke) - 1n, Ye = (1n << qe) - 1n, Xe = qe, Ze = 22n, Qe = () => {
+	e.length > 60 && Be(`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).`);
+}, qe = 1704067200000n, Je = 10n, Ye = 12n, Xe = (1n << Je) - 1n, Ze = (1n << Ye) - 1n, Qe = Ye, $e = 22n, et = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > Je) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Je}.`);
+	if (t < 0n || t > Xe) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Xe}.`);
 	return t;
-}, $e = () => ({
+}, tt = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: Qe()
-}), et, tt = () => (et === void 0 && (et = $e()), et), nt = () => {
-	et = $e();
-}, rt = () => BigInt(Date.now()), it = (e) => {
-	let t = rt();
-	for (; t <= e;) t = rt();
+	machineId: et()
+}), nt, rt = () => (nt === void 0 && (nt = tt()), nt), it = () => {
+	nt = tt();
+}, at = () => BigInt(Date.now()), ot = (e) => {
+	let t = at();
+	for (; t <= e;) t = at();
 	return t;
-}, at = () => {
-	let e = tt(), t = rt();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & Ye, e.sequence === 0n && (t = it(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - Ge;
+}, st = () => {
+	let e = rt(), t = at();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & Ze, e.sequence === 0n && (t = ot(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - qe;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Ze | e.machineId << Xe | e.sequence).toString();
-}, ot = (e) => {
+	return (n << $e | e.machineId << Qe | e.sequence).toString();
+}, ct = (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 We(n, {
+	return Ke(n, {
 		kind: "derived",
 		tableName: e
 	}), n;
-}, st = (e, t) => {
+}, lt = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: ot(t)
+		prefix: ct(t)
 	};
-	if ("prefix" in e && !("scheme" in e)) return We(e.prefix, {
+	if ("prefix" in e && !("scheme" in e)) return Ke(e.prefix, {
 		kind: "explicit",
 		tableName: t
 	}), {
@@ -625,8 +638,8 @@ var A = () => new u({
 	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
 	switch (e.scheme) {
 		case "typeid": {
-			let n = e.prefix ?? ot(t);
-			return e.prefix !== void 0 && We(e.prefix, {
+			let n = e.prefix ?? ct(t);
+			return e.prefix !== void 0 && Ke(e.prefix, {
 				kind: "explicit",
 				tableName: t
 			}), {
@@ -642,22 +655,22 @@ var A = () => new u({
 			generate: e.generate
 		};
 	}
-}, ct = (e, t) => {
+}, ut = (e, t) => {
 	switch (e.kind) {
-		case "typeid": return i(e.prefix).toString();
-		case "ulid": return a();
+		case "typeid": return a(e.prefix).toString();
+		case "ulid": return o();
 		case "numeric": return null;
-		case "snowflake": return at();
+		case "snowflake": return st();
 		case "custom": return e.generate(t);
 	}
-}, lt = (e) => ({
-	fields: se(e.fields),
+}, dt = (e) => ({
+	fields: oe(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 }
-}), ut = lt, dt = (e) => {
+}), ft = dt, pt = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -667,7 +680,7 @@ var A = () => new u({
 	};
 	for (let t of e) r(t);
 	return n;
-}, ft = (e, ...t) => {
+}, mt = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -678,14 +691,14 @@ var A = () => new u({
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, pt = (e = "cosine", t = "float32") => {
+}, ht = (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`;
 	}
-}, mt = [
+}, gt = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -694,7 +707,7 @@ var A = () => new u({
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], 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) => {
+], _t = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, vt = (e, t) => `${e}_${t.join("_")}_idx`, yt = (e, t) => `${e}_${t.join("_")}_uq`, bt = (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];
@@ -702,15 +715,48 @@ var A = () => 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.`);
-}, yt = (e, t) => {
+}, xt = (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: st(i.idSchemeInput, t)
+		idScheme: lt(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, R = (e) => {
-	let t = e.appliedPrimaryKey ?? [];
+}, St = (e, t) => {
+	let n = (e) => Object.getPrototypeOf(e) === Object.prototype && Object.values(Object.getOwnPropertyDescriptors(e)).every((e) => "value" in e), r = (e) => {
+		if (Object.getPrototypeOf(e) !== Array.prototype || Object.hasOwn(e, Symbol.iterator)) return !1;
+		for (let t = 0; t < e.length; t++) {
+			let n = Object.getOwnPropertyDescriptor(e, String(t));
+			if (!n || !("value" in n) || typeof n.value != "string") return !1;
+		}
+		return !0;
+	}, i = 0, a = t.every((e) => {
+		let t = Object.getOwnPropertyDescriptor(e, "indexes");
+		if (t === void 0) return Object.getPrototypeOf(e) === Object.prototype;
+		if (!("value" in t)) return !1;
+		let n = t.value;
+		return n === void 0 ? !0 : Object.getPrototypeOf(n) !== Array.prototype || Object.hasOwn(n, Symbol.iterator) ? !1 : (i += n.length, !0);
+	});
+	if (!(i < 32 || !a)) {
+		for (let e of t) {
+			let t = e.indexes ?? [];
+			for (let e = 0; e < t.length; e++) {
+				let i = Object.getOwnPropertyDescriptor(t, String(e));
+				if (!i || !("value" in i) || !n(i.value) || !r(i.value.fields)) return;
+			}
+		}
+		return e.every(n) ? new Set(e.map((e) => e.name)) : void 0;
+	}
+}, V = (e) => {
+	let t = e.appliedPrimaryKey ?? [], n = Object.entries(e.fields).flatMap(([t, n]) => {
+		let r = ce(n);
+		if (r === void 0) return [];
+		if (r.orphanPolicy === "null" && n.nullable !== !0) throw Error(`pluginRef: ${e.tableName}.${t} orphanPolicy: 'null' requires .nullable().`);
+		return [{
+			column: t,
+			...r
+		}];
+	});
 	return {
 		tableName: e.tableName,
 		fields: e.fields,
@@ -721,15 +767,15 @@ var A = () => new u({
 		appliedFullText: e.appliedFullText,
 		appliedChecks: e.appliedChecks,
 		appliedRules: e.appliedRules ?? [],
-		appliedPluginRefs: e.appliedPluginRefs ?? [],
+		appliedPluginRefs: n,
 		appliedPrimaryKey: t,
 		...e.previousTableName === void 0 ? {} : { previousTableName: e.previousTableName },
 		...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 		...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 (L(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
-			return R({
+			if (B(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
+			return V({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -750,27 +796,27 @@ var A = () => new u({
 			});
 		}),
 		with: ((...t) => {
-			let n = dt(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
+			let n = pt(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}': '${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.`);
-				Ue(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}': '${_t(o)}' and '${_t(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.`);
+				Ge(e.tableName, n), r[n] = a, i.set(n, t);
 			}
-			let a = [...e.appliedIndexes];
+			let a = [...e.appliedIndexes], o = St(a, n);
 			for (let t of n) for (let n of t.indexes ?? []) {
-				let t = n.name ?? gt(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (L(e.tableName, t, n.name === void 0, n.fields), vt(e.tableName, t, n.kind, n.fields, r), a.push({
+				let t = n.name ?? vt(e.tableName, n.fields);
+				(o?.has(t) ?? a.some((e) => e.name === t)) || (B(e.tableName, t, n.name === void 0, n.fields), bt(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 }
-				}));
+				}), o?.add(t));
 			}
-			return R({
+			return V({
 				...e,
 				tableName: e.tableName,
 				fields: r,
@@ -787,10 +833,10 @@ var A = () => new u({
 		}),
 		index: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			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.`);
+			if (a ? (r = t[0], i = t[1], n = vt(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 (L(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 R({
+			if (B(e.tableName, n, a, o), bt(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 V({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -814,8 +860,8 @@ var A = () => 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 (L(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 R({
+			if (B(e.tableName, t, !1, i), bt(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 V({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -838,9 +884,9 @@ var A = () => new u({
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			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 (L(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 R({
+			if (a ? (r = t[0], i = t[1], n = yt(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 (B(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 V({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -861,10 +907,10 @@ var A = () => new u({
 		}),
 		uniqueActive: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			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 (L(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 = vt(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 (B(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 R({
+			return V({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -886,8 +932,8 @@ var A = () => new u({
 		}),
 		check: ((t, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
-			if (L(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 R({
+			if (B(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 V({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -909,7 +955,7 @@ var A = () => 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 R({
+			return V({
 				...e,
 				appliedRules: [...i, {
 					name: t,
@@ -920,7 +966,7 @@ var A = () => 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 He(t), R({
+			return We(t), V({
 				...e,
 				previousTableName: t
 			});
@@ -935,7 +981,7 @@ var A = () => 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 R({
+			return V({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -950,7 +996,7 @@ var A = () => new u({
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
-		nonReactive: (() => R({
+		nonReactive: (() => V({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -964,7 +1010,7 @@ var A = () => new u({
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validate: ((t) => R({
+		validate: ((t) => V({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -978,7 +1024,7 @@ var A = () => new u({
 			insertSchema: t,
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validatePatch: ((t) => R({
+		validatePatch: ((t) => V({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -990,28 +1036,21 @@ var A = () => new u({
 			appliedChecks: e.appliedChecks,
 			appliedPrimaryKey: e.appliedPrimaryKey,
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-			validatePatchSchema: r.partial(t)
+			validatePatchSchema: t.mapFields(i.map(r.optional))
 		}))
 	};
-}, z = (e, t) => {
-	He(e);
-	let n = Object.entries(t).flatMap(([e, t]) => {
-		let n = le(t);
-		return n === void 0 ? [] : [{
-			column: e,
-			...n
-		}];
-	}), r = yt(se(t), e);
-	for (let t of Object.keys(r)) Ue(e, t);
-	let i;
-	for (let [t, n] of Object.entries(r)) n.references === O && (n.references = () => {
-		if (i === void 0) throw Error(`selfReference() on '${e}.${t}' read before table() returned`);
-		return i;
+}, H = (e, t) => {
+	We(e);
+	let n = xt(oe(t), e);
+	for (let t of Object.keys(n)) Ge(e, t);
+	let r;
+	for (let [t, i] of Object.entries(n)) i.references === j && (i.references = () => {
+		if (r === void 0) throw Error(`selfReference() on '${e}.${t}' read before table() returned`);
+		return r;
 	});
-	return i = R({
-		appliedPluginRefs: n,
+	return r = V({
 		tableName: e,
-		fields: r,
+		fields: n,
 		isReactive: !0,
 		appliedMixins: [],
 		appliedIndexes: [],
@@ -1019,8 +1058,8 @@ var A = () => new u({
 		appliedFullText: [],
 		appliedChecks: [],
 		appliedRules: []
-	}), i;
-}, bt = (e) => e === "sqlite" || e === "turso", xt = (e) => e === "mysql" || e === "mariadb", St = (e, t) => {
+	}), r;
+}, Ct = (e) => e === "sqlite" || e === "turso", wt = (e) => e === "mysql" || e === "mariadb", Tt = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e.replace(/`/g, "``")}\``;
@@ -1029,51 +1068,51 @@ var A = () => new u({
 		case "sqlite":
 		case "turso": return `"${e.replace(/"/g, "\"\"")}"`;
 	}
-}, Ct = 1e4, wt = Symbol.for("@voltro/database/tableRegistry"), Tt = globalThis, B = Tt[wt] ?? (Tt[wt] = /* @__PURE__ */ new Map()), Et = (e) => {
-	let t = B.get(e.tableName);
+}, Et = 1e4, Dt = Symbol.for("@voltro/database/tableRegistry"), Ot = globalThis, U = Ot[Dt] ?? (Ot[Dt] = /* @__PURE__ */ new Map()), kt = (e) => {
+	let t = U.get(e.tableName);
 	if (t === void 0) {
-		B.set(e.tableName, e);
+		U.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.`);
-}, Dt = (e) => {
-	B.get(e.tableName) === void 0 && B.set(e.tableName, e);
-}, V = (e) => B.get(e), Ot = (e) => {
-	let t = B.get(e);
+}, At = (e) => {
+	U.get(e.tableName) === void 0 && U.set(e.tableName, e);
+}, W = (e) => U.get(e), jt = (e) => {
+	let t = U.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;
-}, kt = () => [...B.values()], At = (e) => B.delete(e), jt = () => {
-	B.clear();
-}, Mt = (e) => B.get(e)?.isReactive !== !1, Nt = (e) => e.order ?? [], Pt = (e) => ({
+}, Mt = () => [...U.values()], Nt = (e) => U.delete(e), Pt = () => {
+	U.clear();
+}, Ft = (e) => U.get(e)?.isReactive !== !1, It = (e) => e.order ?? [], Lt = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), Ft = (e, t) => ({
+}), Rt = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), It = (e, t) => ({
+}), zt = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), Lt = (e, t) => ({
+}), Bt = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), Rt = (e, t) => ({
+}), Vt = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), zt = (e, t) => ({
+}), Ht = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), Bt = (e, t) => ({
+}), Ut = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), Vt = (e) => (...t) => {
+}), Wt = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return U({
+	return K({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -1085,55 +1124,55 @@ var A = () => new u({
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, Ht = Vt("union"), Ut = Vt("union-all"), Wt = Vt("intersect"), Gt = Vt("except"), H = (e) => ({ over: (t) => ({
+}, Gt = Wt("union"), Kt = Wt("union-all"), qt = Wt("intersect"), Jt = Wt("except"), G = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), Kt = (e = "rowNumber") => H({
+}) }), Yt = (e = "rowNumber") => G({
 	op: "window-row-number",
 	alias: e
-}), qt = (e = "rank") => H({
+}), Xt = (e = "rank") => G({
 	op: "window-rank",
 	alias: e
-}), Jt = (e = "denseRank") => H({
+}), Zt = (e = "denseRank") => G({
 	op: "window-dense-rank",
 	alias: e
-}), Yt = (e, t = 1, n) => H({
+}), Qt = (e, t = 1, n) => G({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), Xt = (e, t = 1, n) => H({
+}), $t = (e, t = 1, n) => G({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), Zt = (e, t) => H({
+}), en = (e, t) => G({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), Qt = (e, t) => H({
+}), tn = (e, t) => G({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), $t = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? V(e)?.appliedFullText?.find((e) => e.name === t);
+}), nn = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? W(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 }
 	};
-}, U = (e) => ({
+}, K = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return U({
+		return K({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return U({
+		return K({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -1142,43 +1181,43 @@ var A = () => new u({
 		});
 	},
 	limit(t) {
-		return U({
+		return K({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return U({
+		return K({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return U({
+		return K({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return U({
+		return K({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return U({
+		return K({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	forUpdate() {
-		return U({
+		return K({
 			...e,
 			lock: "update"
 		});
 	},
 	unscoped() {
-		return U({
+		return K({
 			...e,
 			crossTenant: !0
 		});
@@ -1188,13 +1227,13 @@ var A = () => new u({
 			...e.eager ?? {},
 			...t
 		};
-		return U({
+		return K({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return U({
+		return K({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1208,15 +1247,15 @@ var A = () => new u({
 			...t,
 			alias: e
 		}));
-		return U({
+		return K({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n, r) {
-		let i = $t(e.table, t, e.fullTextIndexes);
-		return U({
+		let i = nn(e.table, t, e.fullTextIndexes);
+		return K({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -1231,7 +1270,7 @@ var A = () => 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 U({
+		return K({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -1250,7 +1289,7 @@ var A = () => new u({
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return U({
+			return K({
 				...e,
 				annClause: i
 			});
@@ -1262,7 +1301,7 @@ var A = () => new u({
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return U({
+			return K({
 				...e,
 				annClause: r,
 				take: n
@@ -1275,7 +1314,7 @@ var A = () => new u({
 			column: "",
 			distance: "cosine"
 		};
-		return U({
+		return K({
 			...e,
 			annClause: {
 				...n,
@@ -1284,22 +1323,22 @@ var A = () => new u({
 		});
 	},
 	use(t) {
-		return U({ ...t(e) });
+		return K({ ...t(e) });
 	},
 	distinct() {
-		return U({
+		return K({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return U({
+		return K({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return U({
+		return K({
 			...e,
 			alias: t
 		});
@@ -1312,7 +1351,7 @@ var A = () => new u({
 			on: r,
 			...typeof t == "string" ? {} : { sourceTable: t }
 		}];
-		return U({
+		return K({
 			...e,
 			joins: a
 		});
@@ -1325,7 +1364,7 @@ var A = () => new u({
 			on: r,
 			...typeof t == "string" ? {} : { sourceTable: t }
 		}];
-		return U({
+		return K({
 			...e,
 			joins: a
 		});
@@ -1335,7 +1374,7 @@ var A = () => new u({
 			outputKey: e,
 			source: t
 		}));
-		return U({
+		return K({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1344,7 +1383,7 @@ var A = () => 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 U({
+		return K({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1355,7 +1394,7 @@ var A = () => 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 U({
+		return K({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1366,20 +1405,20 @@ var A = () => new u({
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return U({
+		return K({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return U({
+		return K({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return U({
+		return K({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1390,8 +1429,8 @@ var A = () => new u({
 		});
 	}
 });
-function en(e) {
-	return U({
+function rn(e) {
+	return K({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1402,7 +1441,7 @@ function en(e) {
 		sourceTable: e
 	});
 }
-var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
+var an = (e, t, n) => on(e, "id", t, n), on = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1417,21 +1456,21 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, rn = (e) => {
+}, sn = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) Et(r), t[n] = en(r);
+	for (let [n, r] of Object.entries(e)) kt(r), t[n] = rn(r);
 	return t;
-}, an = (e) => e.isView === !0, on = (e, t, n) => {
-	if (He(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
-	let r = se(t);
-	for (let t of Object.keys(r)) Ue(e, t);
+}, cn = (e) => e.isView === !0, ln = (e, t, n) => {
+	if (We(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
+	let r = oe(t);
+	for (let t of Object.keys(r)) Ge(e, t);
 	return {
 		tableName: e,
 		fields: r,
 		isView: !0,
 		viewSelect: n
 	};
-}, sn = (e) => en({
+}, un = (e) => rn({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1439,8 +1478,8 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), cn = (e, t, n = null) => {
-	let r = n === null ? St(e.tableName, t) : `${St(n, t)}.${St(e.tableName, t)}`, i = e.viewSelect.trim();
+}), dn = (e, t, n = null) => {
+	let r = n === null ? Tt(e.tableName, t) : `${Tt(n, t)}.${Tt(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1449,64 +1488,114 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, ln = ({ precision: e, scale: t }) => {
+}, fn = ({ precision: e, scale: t }) => {
 	if (!Number.isSafeInteger(e) || e <= 0 || !Number.isSafeInteger(t) || t < 0 || t > e) throw RangeError("Invalid fixed-point decimal precision or scale");
 	return 10n ** BigInt(e);
-}, W = (e, t) => {
-	let n = ln(t);
+}, q = (e, t) => {
+	let n = fn(t);
 	if (typeof e != "string" || !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)$/.test(e)) throw TypeError("Expected a fixed-point decimal string");
 	let [r = "", i = ""] = e.replace(/^[+-]/, "").split(".");
 	if (/[1-9]/.test(i.slice(t.scale))) throw RangeError("Decimal value exceeds the declared scale");
 	let a = BigInt((r || "0") + i.slice(0, t.scale).padEnd(t.scale, "0"));
 	if (a >= n) throw RangeError("Decimal value exceeds the declared precision");
 	return "D" + ((e.startsWith("-") ? -a : a) + n).toString().padStart(t.precision + 1, "0");
-}, un = (e, t) => {
-	let n = ln(t);
+}, pn = (e, t) => {
+	let n = fn(t);
 	if (typeof e != "string" || e.length !== t.precision + 2 || !/^D\d+$/.test(e)) throw TypeError("Expected an encoded fixed-point decimal value");
 	let r = BigInt(e.slice(1)) - n;
 	if (r <= -n || r >= n) throw RangeError("Encoded decimal value exceeds the declared precision");
 	let i = (r < 0n ? -r : r).toString().padStart(t.scale + 1, "0"), a = t.scale === 0 ? i : i.slice(0, -t.scale) + "." + i.slice(-t.scale);
 	return (r < 0n ? "-" : "") + a;
-}, G = (e) => e?.type === "decimal" && dn(e) !== void 0, dn = (e) => {
+}, J = (e) => e?.type === "decimal" && mn(e) !== void 0, mn = (e) => {
 	if (e.sqliteDecimalEncoding === void 0) return;
 	if (e.precision === void 0 || e.scale === void 0) throw Error("Encoded SQLite decimal metadata requires precision and scale");
 	let t = {
 		precision: e.precision,
 		scale: e.scale
 	};
-	return W("0", t), t;
-}, fn = (e) => (W("0", e), `VOLTRO_DECIMAL_V1_P${e.precision}_S${e.scale}_TEXT`), pn = (e) => {
+	return q("0", t), t;
+}, hn = (e) => (q("0", e), `VOLTRO_DECIMAL_V1_P${e.precision}_S${e.scale}_TEXT`), gn = (e) => {
 	let t = /^\s*VOLTRO_DECIMAL_V1_P(\d+)_S(\d+)_TEXT\s*$/i.exec(e);
 	if (!t) return;
 	let n = {
 		precision: Number(t[1]),
 		scale: Number(t[2])
 	};
-	return W("0", n), n;
-}, mn = (e, t) => {
-	W("0", t);
+	return q("0", n), n;
+}, _n = (e, t) => {
+	q("0", t);
 	let n = "D" + "0".repeat(t.precision + 1), r = "D2" + "0".repeat(t.precision);
 	return `(${e} IS NULL OR (typeof(${e}) = 'text' AND length(${e}) = ${t.precision + 2} AND substr(${e}, 1, 1) = 'D' AND substr(${e}, 2) NOT GLOB '*[^0-9]*' AND instr(${e}, char(0)) = 0 AND ${e} COLLATE BINARY > '${n}' AND ${e} COLLATE BINARY < '${r}'))`;
-}, hn = (e, t) => {
+}, vn = (e, t) => {
 	if (e == null) return e;
 	if (typeof e != "string") throw TypeError("SQLite decimal defaults require exact strings");
-	return W(e, t);
-}, K = (e, t) => {
+	return q(e, t);
+}, Y = (e, t) => {
 	let n = e.lastIndexOf("."), r = n < 0 ? e : e.slice(n + 1), i = n < 0 ? void 0 : e.slice(0, n), a = i === void 0 || i === t.alias || i === t.table, o = a ? void 0 : t.joins?.find((e) => e.alias === i), s = a ? t.table : o?.table, c = a ? t.sourceTable : o?.sourceTable;
-	return (c?.tableName === s ? c : s === void 0 ? void 0 : V(s))?.fields[r];
-}, gn = (e) => e.replace(/[A-Z]/g, (e) => e.toLowerCase()), _n = (e) => {
-	let t = (e, r) => e ? "and" in e ? e.and.some((e) => t(e, r)) : "or" in e ? e.or.some((e) => t(e, r)) : "not" in e ? t(e.not, r) : "subquery" in e && n(e.subquery, r) : !1, n = (e, r) => {
-		let i = /* @__PURE__ */ new Set([...r, ...(e.ctes ?? []).map((e) => gn(e.name))]), a = (e, t) => {
-			if (i.has(gn(e))) return !1;
-			let n = t?.tableName === e ? t : V(e);
-			return Object.values(n?.fields ?? {}).some(G);
+	return (c?.tableName === s ? c : s === void 0 ? void 0 : W(s))?.fields[r];
+}, yn = (e) => {
+	for (let t of [
+		"joins",
+		"alias",
+		"table",
+		"sourceTable"
+	]) {
+		let n = Object.getOwnPropertyDescriptor(e, t);
+		if (n === void 0 ? t in e : !("value" in n)) return (t) => Y(t, e);
+	}
+	let t = e.joins;
+	if (t === void 0 || t.length < 8 || Object.getPrototypeOf(t) !== Array.prototype || t.find !== Array.prototype.find || t[Symbol.iterator] !== Array.prototype[Symbol.iterator]) return (t) => Y(t, e);
+	let n = /* @__PURE__ */ new Map();
+	for (let r = 0; r < t.length; r++) {
+		let i = Object.getOwnPropertyDescriptor(t, r);
+		if (i === void 0 || !("value" in i)) return (t) => Y(t, e);
+		let a = i.value;
+		for (let t of ["table", "sourceTable"]) {
+			let n = Object.getOwnPropertyDescriptor(a, t);
+			if (n === void 0 ? t in a : !("value" in n)) return (t) => Y(t, e);
+		}
+		let o = Object.getOwnPropertyDescriptor(a, "alias");
+		if (o === void 0 || !("value" in o) || typeof o.value != "string") return (t) => Y(t, e);
+		n.has(o.value) || n.set(o.value, a);
+	}
+	return (t) => {
+		let r = t.lastIndexOf("."), i = r < 0 ? t : t.slice(r + 1), a = r < 0 ? void 0 : t.slice(0, r), o = a === void 0 || a === e.alias || a === e.table, s = o ? void 0 : n.get(a), c = o ? e.table : s?.table, l = o ? e.sourceTable : s?.sourceTable;
+		return (l?.tableName === c ? l : c === void 0 ? void 0 : W(c))?.fields[i];
+	};
+}, bn = (e) => e.replace(/[A-Z]/g, (e) => e.toLowerCase()), xn = (e) => {
+	if (Object.getPrototypeOf(e) !== Object.prototype) return !1;
+	for (let t of Object.values(Object.getOwnPropertyDescriptors(e))) {
+		if (!("value" in t) || !t.value || Object.getPrototypeOf(t.value) !== Object.prototype) return !1;
+		for (let e of [
+			"type",
+			"sqliteDecimalEncoding",
+			"precision",
+			"scale"
+		]) {
+			let n = Object.getOwnPropertyDescriptor(t.value, e);
+			if (n && !("value" in n)) return !1;
+		}
+	}
+	return !0;
+}, Sn = (e) => {
+	let t, n = !1, r, i = (e, t) => e ? "and" in e ? e.and.some((e) => i(e, t)) : "or" in e ? e.or.some((e) => i(e, t)) : "not" in e ? i(e.not, t) : "subquery" in e && a(e.subquery, t) : !1, a = (e, o) => {
+		let s = /* @__PURE__ */ new Set([...o, ...(e.ctes ?? []).map((e) => bn(e.name))]), c = (e, i) => {
+			if (s.has(bn(e))) return !1;
+			let a = i?.tableName === e ? i : W(e);
+			if (a === void 0) return !1;
+			if (t === void 0) return t = a, n = Object.values(a.fields).some(J), n;
+			r ??= /* @__PURE__ */ new Map([[t, { result: n }]]);
+			let o = r.get(a);
+			if (o !== void 0 && (o.ordinary ??= xn(a.fields), o.ordinary)) return o.result;
+			let c = Object.values(a.fields).some(J);
+			return o === void 0 && r.set(a, { result: c }), c;
 		};
-		return a(e.table, e.sourceTable) || (e.joins ?? []).some((e) => a(e.table, e.sourceTable) || t(e.on, i)) || (e.ctes ?? []).some((e) => n(e.descriptor, i)) || (e.setOp?.queries ?? []).some((e) => n(e, i)) || t(e.predicate, i) || t(e.having, i);
+		return c(e.table, e.sourceTable) || (e.joins ?? []).some((e) => c(e.table, e.sourceTable) || i(e.on, s)) || (e.ctes ?? []).some((e) => a(e.descriptor, s)) || (e.setOp?.queries ?? []).some((e) => a(e, s)) || i(e.predicate, s) || i(e.having, s);
 	};
-	return n(e, /* @__PURE__ */ new Set());
-}, q = (e, t) => {
+	return a(e, /* @__PURE__ */ new Set());
+}, X = (e, t) => {
 	if (e.setOp) {
-		let n = e.setOp.queries.map((e) => q(e, t));
+		let n = e.setOp.queries.map((e) => X(e, t));
 		if (n.length < 2) throw Error("Exact set operations require at least two inputs");
 		let r = n[0];
 		if (n.some((e) => e.length !== r.length)) throw Error("Exact set operation column counts differ");
@@ -1526,8 +1615,8 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 	}
 	let n = e.aggregations ?? [];
 	if (n.length) return n.map((n) => {
-		let r = K(n.column ?? "", e);
-		if (!G(r) || n.op.startsWith("count") || [
+		let r = Y(n.column ?? "", e);
+		if (!J(r) || n.op.startsWith("count") || [
 			"window-row-number",
 			"window-rank",
 			"window-dense-rank"
@@ -1537,7 +1626,7 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 				"window-row-number",
 				"window-rank",
 				"window-dense-rank"
-			].includes(n.op) ? m().__definition() : r ?? m().__definition()
+			].includes(n.op) ? _().__definition() : r ?? _().__definition()
 		};
 		let i = ["avg", "window-avg-over"].includes(n.op) ? t ?? r.scale : r.scale, a = [
 			"sum",
@@ -1553,25 +1642,25 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			}
 		};
 	});
-	let r = e.sourceTable?.tableName === e.table ? e.sourceTable : V(e.table), i = e.joinedProjection ?? (e.projection?.length ? e.projection : Object.keys(r?.fields ?? {})).map((e) => ({
+	let r = e.sourceTable?.tableName === e.table ? e.sourceTable : W(e.table), i = e.joinedProjection ?? (e.projection?.length ? e.projection : Object.keys(r?.fields ?? {})).map((e) => ({
 		source: e,
 		outputKey: e.split(".").at(-1)
 	}));
 	if (!i.length) throw Error("Exact set operation requires declared output columns");
 	return i.map((t) => {
-		let n = K(t.source, e);
+		let n = Y(t.source, e);
 		if (!n) throw Error("Exact set operation requires declared output columns");
 		return {
 			name: t.outputKey,
 			definition: n,
-			...G(n) ? { decimal: {
+			...J(n) ? { decimal: {
 				precision: n.precision,
 				scale: n.scale
 			} } : {}
 		};
 	});
-}, vn = (e, t, n = [], r) => {
-	W("0", t);
+}, Cn = (e, t, n = [], r) => {
+	q("0", t);
 	let i = /* @__PURE__ */ new Set([
 		"value",
 		"negative",
@@ -1597,13 +1686,13 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 	d("input", `SELECT * FROM (${e}) LIMIT -1 OFFSET 0`), d("sign", `SELECT *,substr(value,1,1)='-' AS negative,CASE WHEN substr(value,1,1) IN ('-','+') THEN substr(value,2) ELSE value END AS unsigned FROM ${u("input")} LIMIT -1 OFFSET 0`), d("parts", `SELECT *,CASE WHEN instr(unsigned,'.')=0 THEN unsigned ELSE substr(unsigned,1,instr(unsigned,'.')-1) END AS integer_part,CASE WHEN instr(unsigned,'.')=0 THEN '' ELSE substr(unsigned,instr(unsigned,'.')+1) END AS fraction FROM ${u("sign")} LIMIT -1 OFFSET 0`), d("magnitude", `SELECT *,coalesce(nullif(ltrim(integer_part||substr(fraction||'${"0".repeat(t.scale)}',1,${t.scale}),'0'),''),'0') AS magnitude FROM ${u("parts")} LIMIT -1 OFFSET 0`), d("padded", `SELECT *,substr('${o}'||magnitude,-${t.precision}) AS padded FROM ${u("magnitude")} LIMIT -1 OFFSET 0`), d("trimmed", `SELECT *,rtrim(padded,'0') AS trimmed FROM ${u("padded")} LIMIT -1 OFFSET 0`), d("alphabetic", `SELECT *,${c} AS alphabetic FROM ${u("trimmed")} LIMIT -1 OFFSET 0`), d("complement", `SELECT *,${s} AS complement FROM ${u("alphabetic")} LIMIT -1 OFFSET 0`);
 	let f = `typeof(value)<>'text' OR instr(value,char(0))<>0 OR unsigned GLOB '*[^0-9.]*' OR instr(fraction,'.')<>0 OR length(integer_part)+length(fraction)=0 OR length(magnitude)>${t.precision} OR substr(fraction,${t.scale + 1}) GLOB '*[1-9]*'`;
 	return `(${r ? "" : `WITH ${l.join(",")} `}SELECT ${n.map((e) => `"${e}",`).join("")}CASE WHEN value IS NULL THEN NULL WHEN ${f} THEN abs(-9223372036854775808) WHEN negative AND magnitude<>'0' THEN 'D0'||complement||CAST(10-CAST(substr(trimmed,-1) AS INTEGER) AS TEXT)||substr(padded,length(trimmed)+1) ELSE 'D1'||padded END AS value FROM ${u("complement")})`;
-}, J = (e) => e.replace(/[A-Z]/g, (e) => e.toLowerCase()), yn = (e) => {
+}, Z = (e) => e.replace(/[A-Z]/g, (e) => e.toLowerCase()), wn = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = (e) => {
 		"and" in e ? e.and.forEach(n) : "or" in e ? e.or.forEach(n) : "not" in e ? n(e.not) : "subquery" in e && r(e.subquery);
 	}, r = (e) => {
-		t.add(J(e.table));
-		for (let r of e.joins ?? []) t.add(J(r.table)), n(r.on);
-		for (let n of e.ctes ?? []) t.add(J(n.name)), r(n.descriptor);
+		t.add(Z(e.table));
+		for (let r of e.joins ?? []) t.add(Z(r.table)), n(r.on);
+		for (let n of e.ctes ?? []) t.add(Z(n.name)), r(n.descriptor);
 		e.setOp?.queries.forEach(r), e.predicate && n(e.predicate), e.having && n(e.having);
 	};
 	r(e);
@@ -1615,40 +1704,40 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		while (t.has(e));
 		return t.add(e), e;
 	};
-}, bn = (e, t, n = () => void 0, r = yn(e)) => {
+}, Tn = (e, t, n = () => void 0, r = wn(e)) => {
 	let i = /* @__PURE__ */ new Map();
 	for (let t of e.ctes ?? []) {
-		let e = J(t.name);
+		let e = Z(t.name);
 		if (i.has(e)) throw Error("Duplicate exact decimal CTE name");
 		i.set(e, t);
 	}
 	let a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Set(), s = [], c = (e) => {
-		let l = J(e), u = i.get(l);
+		let l = Z(e), u = i.get(l);
 		if (!u) return n(l);
 		let d = a.get(l);
 		if (d) return d;
 		if (u.recursive) throw Error("Recursive exact decimal CTE composition is not integrated yet");
 		if (o.has(l)) throw Error(`Circular exact decimal CTE dependency: ${u.name}`);
 		o.add(l);
-		let f = bn(u.descriptor, t, c, r), m = q(f, t);
-		if (new Set(m.map((e) => J(e.name))).size !== m.length) throw Error("Duplicate exact decimal CTE output");
-		let h = r(), _ = {
-			tableName: h,
-			fields: Object.fromEntries(m.map((e) => [e.name, e.decimal ? {
-				...g(e.decimal.precision, e.decimal.scale).__definition(),
+		let f = Tn(u.descriptor, t, c, r), p = X(f, t);
+		if (new Set(p.map((e) => Z(e.name))).size !== p.length) throw Error("Duplicate exact decimal CTE output");
+		let m = r(), h = {
+			tableName: m,
+			fields: Object.fromEntries(p.map((e) => [e.name, e.decimal ? {
+				...y(e.decimal.precision, e.decimal.scale).__definition(),
 				sqliteDecimalEncoding: "sortable-v1"
-			} : e.definition ?? p().__definition()]))
+			} : e.definition ?? g().__definition()]))
 		};
-		return a.set(l, _), o.delete(l), s.push({
+		return a.set(l, h), o.delete(l), s.push({
 			...u,
-			name: h,
+			name: m,
 			descriptor: f
-		}), _;
+		}), h;
 	};
 	for (let e of i.keys()) c(e);
 	let l = (e) => "and" in e ? { and: e.and.map(l) } : "or" in e ? { or: e.or.map(l) } : "not" in e ? { not: l(e.not) } : "subquery" in e ? {
 		...e,
-		subquery: bn(e.subquery, t, c, r)
+		subquery: Tn(e.subquery, t, c, r)
 	} : e, u = c(e.table), { ctes: d, ...f } = e;
 	return {
 		...f,
@@ -1673,10 +1762,10 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		...e.having ? { having: l(e.having) } : {},
 		...e.setOp ? { setOp: {
 			...e.setOp,
-			queries: e.setOp.queries.map((e) => bn(e, t, c, r))
+			queries: e.setOp.queries.map((e) => Tn(e, t, c, r))
 		} } : {}
 	};
-}, xn = (e, t) => {
+}, En = (e, t) => {
 	let n = [], r = (e) => "and" in e ? { and: e.and.map(r) } : "or" in e ? { or: e.or.map(r) } : "not" in e ? { not: r(e.not) } : "subquery" in e ? {
 		...e,
 		subquery: i(e.subquery)
@@ -1702,49 +1791,49 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 				queries: a.setOp.queries.map(i)
 			} } : {}
 		};
-	}, a = i(bn(e, t));
+	}, a = i(Tn(e, t));
 	return n.length ? {
 		...a,
 		ctes: n
 	} : a;
-}, Sn = (e, t, n, r) => {
+}, Dn = (e, t, n, r) => {
 	let i = (e.ctes ?? []).flatMap((e, i) => {
-		let a = q(e.descriptor, n), [o] = r(e.descriptor).compile(), s = (e) => "\"" + e.replaceAll("\"", "\"\"") + "\"", c = `decimal_cte_${i}_`;
-		for (; J(o + e.name).includes(c);) c += "_";
-		let l = a.map((e, t) => `${c}column_${t}`), u = [], d = /* @__PURE__ */ new Set(), [f, p] = r(e.descriptor, {
+		let a = X(e.descriptor, n), [o] = r(e.descriptor).compile(), s = (e) => "\"" + e.replaceAll("\"", "\"\"") + "\"", c = `decimal_cte_${i}_`, l = Z(o + e.name);
+		for (; l.includes(c);) c += "_";
+		let u = a.map((e, t) => `${c}column_${t}`), d = [], f = /* @__PURE__ */ new Set(), [p, m] = r(e.descriptor, {
 			prefix: `${c}window_`,
 			append: (e, t) => {
-				u.push(`${e} AS MATERIALIZED (${t})`);
+				d.push(`${e} AS MATERIALIZED (${t})`);
 			},
 			encodedOutput: (e) => {
-				d.add(e);
+				f.add(e);
 			}
 		}).compile();
-		u.push(`${c}input AS (${f})`);
-		let m = (e, t) => {
-			u.push(`${e} AS (${t})`);
-		}, h = `${c}columns`;
-		m(h, `SELECT ${a.map((e, t) => `${s(e.name)} AS ${l[t]}`).join(",")} FROM ${c}input`);
+		d.push(`${c}input AS (${p})`);
+		let h = (e, t) => {
+			d.push(`${e} AS (${t})`);
+		}, g = `${c}columns`;
+		h(g, `SELECT ${a.map((e, t) => `${s(e.name)} AS ${u[t]}`).join(",")} FROM ${c}input`);
 		for (let [e, t] of a.entries()) {
-			if (!t.decimal || d.has(t.name)) continue;
-			let n = l.filter((t, n) => n !== e), r = vn(`SELECT ${l[e]} AS value${n.map((e) => "," + e).join("")} FROM ${h}`, t.decimal, n, {
+			if (!t.decimal || f.has(t.name)) continue;
+			let n = u.filter((t, n) => n !== e), r = Cn(`SELECT ${u[e]} AS value${n.map((e) => "," + e).join("")} FROM ${g}`, t.decimal, n, {
 				prefix: `${c}${e}_`,
-				append: m
+				append: h
 			});
-			h = `${c}encoded_${e}`, m(h, `SELECT ${l.map((t, n) => n === e ? `value AS ${t}` : t).join(",")} FROM ${r}`);
+			g = `${c}encoded_${e}`, h(g, `SELECT ${u.map((t, n) => n === e ? `value AS ${t}` : t).join(",")} FROM ${r}`);
 		}
-		let g = a.map((e, t) => `${l[t]} AS ${s(e.name)}`).join(",");
-		return [t.unsafe(u.join(","), p), t`${t(e.name)} AS (${t.unsafe(`SELECT ${g} FROM ${h}`)})`];
-	}), { ctes: a, ...o } = e, [s] = r(o).compile(), c = "decimal_cte_result_";
-	for (; J(s + i.map((e) => e.compile()[0]).join("")).includes(c);) c += "_";
-	let l = [], [u, d] = r(o, void 0, {
+		let _ = a.map((e, t) => `${u[t]} AS ${s(e.name)}`).join(",");
+		return [t.unsafe(d.join(","), m), t`${t(e.name)} AS (${t.unsafe(`SELECT ${_} FROM ${g}`)})`];
+	}), { ctes: a, ...o } = e, [s] = r(o).compile(), c = "decimal_cte_result_", l = Z(s + i.map((e) => e.compile()[0]).join(""));
+	for (; l.includes(c);) c += "_";
+	let u = [], [d, f] = r(o, void 0, {
 		prefix: c,
 		append: (e, t) => {
-			l.push(`${e} AS MATERIALIZED (${t})`);
+			u.push(`${e} AS MATERIALIZED (${t})`);
 		}
-	}).compile(), f = l.length ? t`WITH ${t.csv([...i, t.unsafe(l.join(","), d)])} ${t.unsafe(u)}` : t`WITH ${t.csv(i)} SELECT * FROM (${t.unsafe(u, d)})`;
-	return t.unsafe(...f.compile());
-}, Cn = (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, wn = (e) => {
+	}).compile(), p = u.length ? t`WITH ${t.join(", ", !1)([...i, t.unsafe(u.join(","), f)])} ${t.unsafe(d)}` : t`WITH ${t.join(", ", !1)(i)} SELECT * FROM (${t.unsafe(d, f)})`;
+	return t.unsafe(...p.compile());
+}, 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, kn = (e) => {
 	if (e == null || typeof e != "string") return e;
 	let t = e.trim();
 	if (t.length === 0) return e;
@@ -1755,7 +1844,7 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 	} catch {
 		return e;
 	}
-}, Tn = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, En = (e) => {
+}, An = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, jn = (e) => {
 	if (e == null || e instanceof Date) return e;
 	if (typeof e == "string") {
 		let t = new Date(e);
@@ -1766,61 +1855,76 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		return isNaN(t.getTime()) ? e : t;
 	}
 	return e;
-}, Dn = (e, t, n) => {
+}, Mn = (e, t, n) => {
 	if (e == null) return e;
 	switch (t) {
-		case "boolean": return n === "postgres" ? e : Cn(e);
-		case "vector": return n === "postgres" ? wn(e) : e;
-		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : wn(e);
-		case "array": return n === "postgres" ? e : wn(e);
+		case "boolean": return n === "postgres" ? e : On(e);
+		case "vector": return n === "postgres" ? kn(e) : e;
+		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : kn(e);
+		case "array": return n === "postgres" ? e : kn(e);
 		case "timestamp":
-		case "date": return n === "sqlite" || n === "turso" ? En(e) : e;
+		case "date": return n === "sqlite" || n === "turso" ? jn(e) : e;
 		case "decimal":
 			if ((n === "sqlite" || n === "turso") && typeof e == "string" && /^D\d+$/.test(e)) throw TypeError("Decimal storage representation does not match the application schema; stop access and complete the verified storage migration before reading this column");
-			return Tn(e);
-		case "bigint": return Tn(e);
+			return An(e);
+		case "bigint": return An(e);
 		default: return e;
 	}
-}, On = (e, t, n, r) => {
+}, Nn = (e, t) => {
+	switch (e) {
+		case "boolean": return t !== "postgres";
+		case "vector": return t === "postgres";
+		case "json": return t !== "postgres" && t !== "mysql" && t !== "mariadb";
+		case "array": return t !== "postgres";
+		case "timestamp":
+		case "date": return t === "sqlite" || t === "turso";
+		case "decimal":
+		case "bigint": return !0;
+		default: return !1;
+	}
+}, Pn = (e, t, n, r) => {
 	if (e.length === 0) return e;
-	if (r && (n === "sqlite" || n === "turso") && _n(r)) {
-		let t = q(xn(r, void 0), void 0);
+	if (r && (n === "sqlite" || n === "turso") && Sn(r)) {
+		let t = X(En(r, void 0), void 0);
 		return e.map((e) => {
 			let r = { ...e };
 			for (let e of t) {
 				let t = e.decimal ? "decimal" : e.definition?.type;
-				t && e.name in r && (r[e.name] = Dn(r[e.name], t, n));
+				t && e.name in r && (r[e.name] = Mn(r[e.name], t, n));
 			}
 			return r;
 		});
 	}
-	if (r?.joinedProjection?.length) return e.map((e) => {
-		let t = { ...e };
-		for (let e of r.joinedProjection) {
-			let i = K(e.source, r);
-			i && e.outputKey in t && (t[e.outputKey] = Dn(t[e.outputKey], i.type, n));
-		}
-		return t;
-	});
-	let i = r?.sourceTable?.tableName === t ? r.sourceTable : V(t);
-	return i === void 0 ? e : kn(e, i, n);
-}, kn = (e, t, n) => {
+	if (r?.joinedProjection?.length) {
+		let t = r.joinedProjection.map((e) => ({
+			outputKey: e.outputKey,
+			definition: Y(e.source, r)
+		}));
+		return e.map((e) => {
+			let r = { ...e };
+			for (let { outputKey: e, definition: i } of t) i && e in r && (r[e] = Mn(r[e], i.type, n));
+			return r;
+		});
+	}
+	let i = r?.sourceTable?.tableName === t ? r.sourceTable : W(t);
+	return i === void 0 ? e : Fn(e, i, n);
+}, Fn = (e, t, n) => {
 	if (e.length === 0) return e;
 	let r = t.fields, i = [];
 	for (let [e, t] of Object.entries(r)) {
-		let r = n === "sqlite" || n === "turso" ? dn(t) : void 0;
-		i.push({
+		let r = n === "sqlite" || n === "turso" ? mn(t) : void 0, a = t.type;
+		(r || Nn(a, n) || e in Object.prototype) && i.push({
 			key: e,
-			type: t.type,
+			type: a,
 			...r ? { decimalShape: r } : {}
 		});
 	}
 	return e.map((e) => {
 		let t = { ...e };
-		for (let { key: e, type: r, decimalShape: a } of i) e in t && (t[e] = a && t[e] !== null && t[e] !== void 0 ? un(t[e], a) : Dn(t[e], r, n));
+		for (let { key: e, type: r, decimalShape: a } of i) e in t && (t[e] = a && t[e] !== null && t[e] !== void 0 ? pn(t[e], a) : Mn(t[e], r, n));
 		return t;
 	});
-}, An = (e, t) => {
+}, In = (e, t) => {
 	if (e == null) return e;
 	switch (t) {
 		case "json": return JSON.stringify(e);
@@ -1828,18 +1932,18 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		case "vector": return typeof e == "string" ? e : JSON.stringify(e);
 		default: return e;
 	}
-}, jn = (e, t, n = ["json", "array"]) => {
-	let r = V(t);
+}, Ln = (e, t, n = ["json", "array"]) => {
+	let r = W(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 = r.type === "decimal" ? dn(r) : void 0, i = e[t];
+		let n = r.type === "decimal" ? mn(r) : void 0, i = e[t];
 		if (n && i != null && typeof i != "string") throw TypeError("Encoded decimal writes require exact decimal strings");
-		let o = n && typeof i == "string" ? W(i, n) : An(i, r.type);
+		let o = n && typeof i == "string" ? q(i, n) : In(i, r.type);
 		o !== e[t] && (a === null && (a = { ...e }), a[t] = o);
 	}
 	return a ?? e;
-}, Mn = (e) => {
+}, Rn = (e) => {
 	if (typeof e != "string" || !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)$/.test(e)) return null;
 	let [t = "", n = ""] = e.replace(/^[+-]/, "").split("."), r = t.replace(/^0+/, "") || "0";
 	return {
@@ -1847,8 +1951,8 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		whole: r,
 		fraction: n
 	};
-}, Nn = (e, t) => {
-	let n = Mn(e), r = Mn(t);
+}, zn = (e, t) => {
+	let n = Rn(e), r = Rn(t);
 	if (!n || !r) return null;
 	if (n.negative !== r.negative) return n.negative ? -1 : 1;
 	let i = n.whole.length - r.whole.length;
@@ -1857,34 +1961,34 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		i = t === a ? 0 : t > a ? 1 : -1;
 	}
 	return i === 0 ? 0 : (i > 0 ? 1 : -1) * (n.negative ? -1 : 1);
-}, Pn = (e) => {
-	let t = Mn(e);
+}, Bn = (e) => {
+	let t = Rn(e);
 	if (t === null) return null;
 	let n = t.fraction.replace(/0+$/, "");
 	return `${t.negative ? "-" : ""}${t.whole}${n ? "." + n : ""}`;
-}, Fn = (e) => {
+}, Vn = (e) => {
 	if (e.length === 0) throw RangeError("Column reference must not be empty");
 	return {
 		_tag: "ColumnReference",
 		column: e
 	};
-}, Y = (e) => typeof e == "object" && !!e && "_tag" in e && e._tag === "ColumnReference" && "column" in e && typeof e.column == "string", In = [
+}, Hn = (e) => typeof e == "object" && !!e && "_tag" in e && e._tag === "ColumnReference" && "column" in e && typeof e.column == "string", Un = [
 	"eq",
 	"neq",
 	"gt",
 	"gte",
 	"lt",
 	"lte"
-], Ln = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Ln(e)) : e, Rn = /^[A-Za-z_][A-Za-z0-9_]*$/, zn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : Rn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), Bn = (e) => "{" + e.map((e) => {
+], Wn = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Wn(e)) : e, Gn = /^[A-Za-z_][A-Za-z0-9_]*$/, Kn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : Gn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), qn = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", X = (e, t, n, r = {}) => {
-	let i = St(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", Q = (e, t, n, r = {}) => {
+	let i = Tt(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${Bn(t)}'::text[])`;
+		let e = `(${i} #>> '${qn(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = zn(t);
+	let o = Kn(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1901,66 +2005,68 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, Vn = class extends Error {
+}, Jn = class extends Error {
 	_tag = "TenantNamespaceUnresolved";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceUnresolved";
 	}
-}, Hn = class extends Error {
+}, Yn = class extends Error {
 	_tag = "TenantNamespaceInvalid";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceInvalid";
 	}
-}, Un = 63, Wn = "tenant_", Gn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Kn = (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 = Gn(e);
-	if (t.replace(/_/g, "") === "") throw new Hn(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
-	let n = `${Wn}${t}`;
-	if (n.length > Un) throw new Hn(`namespace '${n}' for tenant '${e}' exceeds the ${Un}-byte identifier limit. Use a shorter tenant id.`);
+}, Xn = 63, Zn = "tenant_", Qn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), $n = (e) => {
+	if (e == null || e === "") throw new Jn("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 = Qn(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 = `${Zn}${t}`;
+	if (n.length > Xn) throw new Yn(`namespace '${n}' for tenant '${e}' exceeds the ${Xn}-byte identifier limit. Use a shorter tenant id.`);
 	return n;
-}, qn = (e, t) => e === null ? t : `${e}.${t}`, Jn = /* @__PURE__ */ new Set(["timestamp", "date"]), Yn = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, Xn = (e, t) => {
-	if (e === void 0 || t == null || !Jn.has(e) || t instanceof Date) return t;
+}, er = (e, t) => e === null ? t : `${e}.${t}`, tr = /* @__PURE__ */ new Set(["timestamp", "date"]), nr = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, rr = (e, t) => {
+	if (e === void 0 || t == null || !tr.has(e) || t instanceof Date) return t;
 	if (typeof t == "number" && Number.isFinite(t)) return new Date(t);
-	if (typeof t == "string" && Yn.test(t)) {
+	if (typeof t == "string" && nr.test(t)) {
 		if (/:\d{2}\.\d{4,}/.test(t)) return t;
 		let e = new Date(t);
 		return Number.isNaN(e.getTime()) ? t : e;
 	}
 	return t;
-}, Zn = (e, t) => e === void 0 || !Jn.has(e) ? t : t.map((t) => Xn(e, t)), Qn = (e) => {
+}, ir = (e, t) => e === void 0 || !tr.has(e) ? t : t.map((t) => rr(e, t)), ar = (e) => {
 	if (!e.distinct && !e.distinctOn?.length || e.aggregations?.length || e.setOp) return;
-	let t = e.sourceTable?.tableName === e.table ? e.sourceTable : V(e.table), n = e.joinedProjection ?? (e.projection?.length ? e.projection : Object.keys(t?.fields ?? {})).map((e) => ({
+	let t = yn(e), n = e.sourceTable?.tableName === e.table ? e.sourceTable : W(e.table), r = e.joinedProjection ?? (e.projection?.length ? e.projection : Object.keys(n?.fields ?? {})).map((e) => ({
 		source: e,
 		outputKey: e.split(".").at(-1)
-	})), r = {};
-	for (let t of n) {
-		let n = K(t.source, e);
+	})), i = {};
+	for (let e of r) {
+		let n = t(e.source);
 		if (!n) return;
-		r[t.outputKey] = n;
+		i[e.outputKey] = n;
 	}
-	if (!Object.values(r).some((e) => e.type === "decimal")) return;
-	let i = new Set([
+	if (!Object.values(i).some((e) => e.type === "decimal")) return;
+	let a = new Set([
 		e.table,
 		...(e.ctes ?? []).map((e) => e.name),
 		...(e.joins ?? []).map((e) => e.table)
-	].map((e) => e.toLowerCase())), a = "__voltro_mssql_decimal_result";
-	for (; i.has(a.toLowerCase());) a += "_";
+	].map((e) => e.toLowerCase())), o = "__voltro_mssql_decimal_result";
+	for (; a.has(o.toLowerCase());) o += "_";
+	let s = e.order.length >= 8 && r.length >= 8 ? /* @__PURE__ */ new Map() : void 0;
+	if (s) for (let e of r) s.has(e.source) || s.set(e.source, e.outputKey);
 	return {
-		table: a,
+		table: o,
 		sourceTable: {
-			tableName: a,
-			fields: r
+			tableName: o,
+			fields: i
 		},
 		predicate: void 0,
 		projection: void 0,
 		order: e.order.map((e) => ({
 			...e,
-			column: n.find((t) => t.source === e.column)?.outputKey ?? e.column
+			column: (s === void 0 ? r.find((t) => t.source === e.column)?.outputKey : s.get(e.column)) ?? e.column
 		})),
 		take: e.take,
 		skip: e.skip,
 		ctes: [...e.ctes ?? [], {
-			name: a,
+			name: o,
 			descriptor: {
 				...e,
 				ctes: [],
@@ -1970,11 +2076,11 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			}
 		}]
 	};
-}, $n = (e, t, n, r) => {
+}, or = (e, t, n, r) => {
 	let i = n.compile(e.subquery);
 	if (e.op === "exists") return t`EXISTS (${i})`;
 	if (e.op === "not-exists") return t`NOT EXISTS (${i})`;
-	let a = q(e.subquery, n.resultScale);
+	let a = X(e.subquery, n.resultScale);
 	if (a.length !== 1) throw Error("Exact IN subquery must project exactly one column");
 	if (!("column" in e)) throw Error("Unsupported exact subquery predicate");
 	let o = r(e.column), s = a[0];
@@ -1984,7 +2090,7 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		return r ? t`${e} || ${(n === 0 ? "." : "") + "0".repeat(r)}` : e;
 	}, u = l(o.value, o.scale ?? 0), d = t`SELECT ${l(t`${t(s.name)}`, s.decimal?.scale ?? 0)} FROM (${i})`;
 	return e.op === "subquery-in" ? t`${u} IN (${d})` : t`${u} NOT IN (${d})`;
-}, er = (e, t, n, r) => {
+}, sr = (e, t, n, r) => {
 	let i = (e) => [
 		e.table,
 		...(e.joins ?? []).map((e) => e.table),
@@ -1997,7 +2103,7 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 	}, c = (e) => {
 		if (!e.setOp) throw Error("Missing exact set operation");
 		if (e.ctes || e.distinctOn || e.annClause || e.spatialClause || e.fullTextSearch) throw Error("Unsupported exact set query clause");
-		let i = q(e, n.resultScale);
+		let i = X(e, n.resultScale);
 		if (new Set(i.map((e) => e.name)).size !== i.length) throw Error("Duplicate exact set output name");
 		let a = {
 			union: "UNION",
@@ -2005,12 +2111,12 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			intersect: "INTERSECT",
 			except: "EXCEPT"
 		}[e.setOp.kind], o = e.setOp.queries.map((e) => {
-			let a = q(e, n.resultScale), o = i.map((e, n) => {
+			let a = X(e, n.resultScale), o = i.map((e, n) => {
 				let r = t`${t(a[n].name)}`, i = (e.decimal?.scale ?? 0) - (a[n].decimal?.scale ?? 0), o = i > 0 ? (a[n].decimal.scale === 0 ? "." : "") + "0".repeat(i) : "";
 				return t`${o ? t`${r} || ${o}` : r} AS ${t(`v${n}`)}`;
 			}), l = s(e.setOp ? c(e) : r(e));
-			return t`SELECT ${t.csv(o)} FROM ${t(l)}`;
-		}).reduce((e, n) => t`${e} ${t.unsafe(a)} ${n}`), l = s(o), u = e.order.length ? t` ORDER BY ${t.csv(e.order.flatMap((e) => {
+			return t`SELECT ${t.join(", ", !1)(o)} FROM ${t(l)}`;
+		}).reduce((e, n) => t`${e} ${t.unsafe(a)} ${n}`), l = s(o), u = e.order.length ? t` ORDER BY ${t.join(", ", !1)(e.order.flatMap((e) => {
 			let n = i.findIndex((t) => t.name === e.column);
 			if (n < 0) throw Error("Exact set ordering references an unknown output");
 			let r = t`${t(`v${n}`)}`, a = e.direction !== "desc", o = (e, n) => n ? t`${e} ASC` : t`${e} DESC`;
@@ -2026,34 +2132,34 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		}))}` : t``;
 		for (let t of [e.take, e.skip]) if (t !== void 0 && (!Number.isSafeInteger(t) || t < 0)) throw Error("Invalid exact set pagination");
 		let d = e.take === void 0 ? e.skip === void 0 ? t`` : t` LIMIT -1` : t` LIMIT ${e.take}`, f = e.skip === void 0 ? t`` : t` OFFSET ${e.skip}`;
-		return t`SELECT ${t.csv(i.map((e, n) => t`${t(`v${n}`)} AS ${t(e.name)}`))} FROM ${t(l)}${u}${d}${f}`;
+		return t`SELECT ${t.join(", ", !1)(i.map((e, n) => t`${t(`v${n}`)} AS ${t(e.name)}`))} FROM ${t(l)}${u}${d}${f}`;
 	}, l = c(e);
-	return t`WITH ${t.csv(o)} ${l}`;
-}, tr = {
+	return t`WITH ${t.join(", ", !1)(o)} ${l}`;
+}, cr = {
 	eq: "=",
 	neq: "<>",
 	gt: ">",
 	gte: ">=",
 	lt: "<",
 	lte: "<="
-}, nr = (e, t, n) => {
-	W("0", e.shape), W("0", n.shape);
-	let r = tr[t];
+}, lr = (e, t, n) => {
+	q("0", e.shape), q("0", n.shape);
+	let r = cr[t];
 	if (r === void 0) throw RangeError("Invalid decimal column comparison");
 	let i = Math.max(e.shape.scale, n.shape.scale), a = Math.max(e.shape.precision - e.shape.scale, n.shape.precision - n.shape.scale), o = ({ expression: e, shape: t }) => {
 		let n = a - (t.precision - t.scale), r = "0".repeat(i - t.scale);
 		return `(CASE WHEN substr((${e}), 2, 1) = '1' THEN '1${"0".repeat(n)}' ELSE '0${"9".repeat(n)}' END || substr((${e}), 3) || '${r}') COLLATE BINARY`;
 	};
 	return `(${o(e)} ${r} ${o(n)})`;
-}, rr = ({ expression: e, shape: t }) => {
-	let n = ir(t, (e) => e), r = [`decimal_decode_input AS (SELECT (${e}) AS encoded LIMIT -1 OFFSET 0)`], i = "decimal_decode_input";
+}, ur = ({ expression: e, shape: t }) => {
+	let n = dr(t, (e) => e), r = [`decimal_decode_input AS (SELECT (${e}) AS encoded LIMIT -1 OFFSET 0)`], i = "decimal_decode_input";
 	for (let [e, t] of n.steps) {
 		let n = `decimal_decode_${e}`;
 		r.push(`${n} AS (SELECT *,${t.join(",")} FROM ${i} LIMIT -1 OFFSET 0)`), i = n;
 	}
 	return `(WITH ${r.join(",")} SELECT ${n.value} AS value FROM ${i})`;
-}, ir = (e, t) => {
-	W("0", e);
+}, dr = (e, t) => {
+	q("0", e);
 	let n = t("encoded"), r = t("payload"), i = t("negative"), a = t("trimmed"), o = t("units"), s = t("magnitude"), c = t("padded"), l = `substr(${a},1,length(${a})-1)`;
 	for (let e = 0; e < 10; e++) l = `replace(${l},'${e}','${String.fromCharCode(97 + e)}')`;
 	let u = t("alphabetic");
@@ -2107,40 +2213,41 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		],
 		value: `CASE WHEN ${n} IS NULL THEN NULL WHEN ${`typeof(${n})<>'text' OR length(${n})<>${e.precision + 2} OR substr(${n},1,1)<>'D' OR substr(${n},2,1) NOT IN ('0','1') OR substr(${n},2) GLOB '*[^0-9]*' OR (${i} AND length(${a})=0)`} THEN abs(-9223372036854775808) ELSE (CASE WHEN ${i} THEN '-' ELSE '' END)||${f} END`
 	};
-}, ar = (e, t, n, r) => {
+}, fr = (e, t, n, r) => {
 	if (!/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(r.prefix)) throw Error("Invalid decimal decoder stage prefix");
 	if (new Set(t.map((e) => e.name)).size !== t.length || t.some((e) => !/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(e.name))) throw Error("Invalid decimal decoder columns");
-	if (new Set(n).size !== n.length || n.some((e) => !/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(e)) || t.some((e) => !n.includes(e.name))) throw Error("Invalid decimal decoder input columns");
-	let i = t.map((e, t) => {
+	let i = new Set(n);
+	if (i.size !== n.length || n.some((e) => !/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(e)) || t.some((e) => !i.has(e.name))) throw Error("Invalid decimal decoder input columns");
+	let a = t.map((e, t) => {
 		let n = (n) => n === "encoded" ? e.name : `${r.prefix}d${t}_${n}`;
 		return {
 			column: e,
 			ref: n,
-			plan: ir(e.shape, n)
+			plan: dr(e.shape, n)
 		};
 	});
-	for (let t = 0; t < (i[0]?.plan.steps.length ?? 0); t++) {
-		let a = `${r.prefix}decode_${t}`, o = i.flatMap(({ plan: e }) => e.steps[t][1]), s = i.flatMap(({ plan: e, ref: n }) => t === 0 ? [] : e.retained[t - 1].filter((n) => e.retained[t].includes(n)).map(n));
-		r.append(a, `SELECT ${[
+	for (let t = 0; t < (a[0]?.plan.steps.length ?? 0); t++) {
+		let i = `${r.prefix}decode_${t}`, o = a.flatMap(({ plan: e }) => e.steps[t][1]), s = a.flatMap(({ plan: e, ref: n }) => t === 0 ? [] : e.retained[t - 1].filter((n) => e.retained[t].includes(n)).map(n));
+		r.append(i, `SELECT ${[
 			...n,
 			...s,
 			...o
-		].join(",")} FROM ${e} LIMIT -1 OFFSET 0`), e = a;
+		].join(",")} FROM ${e} LIMIT -1 OFFSET 0`), e = i;
 	}
 	return {
 		source: e,
-		values: new Map(i.map(({ column: e, plan: t }) => [e.name, t.value]))
+		values: new Map(a.map(({ column: e, plan: t }) => [e.name, t.value]))
 	};
-}, or = (e, t) => {
+}, pr = (e, t) => {
 	if (!Number.isSafeInteger(e) || e < 1 || !Number.isSafeInteger(t) || t < 0 || t > e) throw RangeError("Invalid decimal result shape");
-}, sr = (e, t) => {
-	if (or(t, 0), !/^-?(?:0|[1-9]\d*)$/.test(e)) throw TypeError("Expected canonical decimal units");
+}, mr = (e, t) => {
+	if (pr(t, 0), !/^-?(?:0|[1-9]\d*)$/.test(e)) throw TypeError("Expected canonical decimal units");
 	let n = e.replace(/^-/, "");
 	if (n.length > t) throw RangeError("Decimal result exceeds declared width");
 	let r = n.padStart(t, "0");
 	return e.startsWith("-") && n !== "0" ? "0" + r.replace(/\d/g, (e) => String(9 - Number(e))) : "1" + r;
-}, cr = ({ sourceSql: e, digits: t, scale: n, materialized: r = !1, stages: i }) => {
-	or(t, n);
+}, hr = ({ sourceSql: e, digits: t, scale: n, materialized: r = !1, stages: i }) => {
+	pr(t, n);
 	let a = "0".repeat(t), o = "ltrim(units,'-')", s = `substr('${a}'||${o},-${t})`, c = s;
 	for (let e = 0; e < 10; e++) c = `replace(${c},'${e}','${String.fromCharCode(97 + e)}')`;
 	let l = c;
@@ -2155,8 +2262,8 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
     CASE WHEN units IS NULL THEN NULL ${m} ELSE ${d} END AS decimal_key,
     CASE WHEN units IS NULL THEN NULL ${m} ELSE (CASE WHEN ${u} THEN '-' ELSE '' END)||${p} END AS decimal_value
     FROM ${v(_)}`;
-}, lr = (e, t, n) => {
-	or(e.digits, e.scale), or(n.digits, n.scale);
+}, gr = (e, t, n) => {
+	pr(e.digits, e.scale), pr(n.digits, n.scale);
 	let r = {
 		eq: "=",
 		neq: "<>",
@@ -2171,8 +2278,8 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		return `(CASE WHEN substr((${e}),1,1)='0' THEN '0${"9".repeat(r)}'||substr((${e}),2)||'${"9".repeat(o)}' ELSE '1${"0".repeat(r)}'||substr((${e}),2)||'${"0".repeat(o)}' END) COLLATE BINARY`;
 	};
 	return `(${o(e)} ${r} ${o(n)})`;
-}, ur = (e, t, n) => {
-	if (W("0", t), e.path?.length) throw Error("Decimal JSON-path predicates are unsupported");
+}, _r = (e, t, n) => {
+	if (q("0", t), e.path?.length) throw Error("Decimal JSON-path predicates are unsupported");
 	if (e.op === "isNull" || e.op === "isNotNull") return e;
 	if (![
 		"eq",
@@ -2184,7 +2291,7 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		"in",
 		"notIn"
 	].includes(e.op)) throw Error("Unsupported exact decimal predicate");
-	let r = 10n ** BigInt(t.precision), i = -r + 1n, a = r - 1n, o = (e) => n === "aggregate" ? sr(String(e), t.precision) : "D" + (e + r).toString().padStart(t.precision + 1, "0"), s = (e) => {
+	let r = 10n ** BigInt(t.precision), i = -r + 1n, a = r - 1n, o = (e) => n === "aggregate" ? mr(String(e), t.precision) : "D" + (e + r).toString().padStart(t.precision + 1, "0"), s = (e) => {
 		if (typeof e != "string" || !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)$/.test(e)) throw TypeError("Exact decimal predicate requires a fixed-point decimal string");
 		let [n = "", r = ""] = e.replace(/^[+-]/, "").split("."), i = BigInt((n || "0") + r.slice(0, t.scale).padEnd(t.scale, "0")), a = /[1-9]/.test(r.slice(t.scale)), o = e.startsWith("-"), s = o ? -i : i;
 		return {
@@ -2231,17 +2338,17 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		...e,
 		value: o(u)
 	};
-}, dr = (e, t, n, r) => {
+}, vr = (e, t, n, r) => {
 	let i = (r) => {
 		if ("not" in r) return t`NOT (${i(r.not)})`;
 		if ("and" in r) return r.and.length ? t.and(r.and.map(i)) : t`TRUE`;
 		if ("or" in r) return r.or.length ? t.or(r.or.map(i)) : t`FALSE`;
-		if ("subquery" in r) return $n(r, t, n, (n) => {
-			let r = K(n, e);
+		if ("subquery" in r) return or(r, t, n, (n) => {
+			let r = Y(n, e);
 			if (!r) throw Error("Exact IN subquery requires a declared outer column");
 			let i = t`${t(n)}`;
-			return G(r) ? {
-				value: t.unsafe(rr({
+			return J(r) ? {
+				value: t.unsafe(ur({
 					expression: i.compile()[0],
 					shape: {
 						precision: r.precision,
@@ -2251,19 +2358,19 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 				scale: r.scale
 			} : { value: i };
 		});
-		if (!("value" in r) || !Y(r.value)) {
+		if (!("value" in r) || !Hn(r.value)) {
 			if (!("column" in r)) throw Error("Decimal subquery predicates are not integrated yet");
-			let n = K(r.column, e);
-			return Rr(G(n) ? ur(r, {
+			let n = Y(r.column, e);
+			return qr(J(n) ? _r(r, {
 				precision: n.precision,
 				scale: n.scale
 			}, "column") : r, t, null, e.table);
 		}
-		let a = K(r.column, e), o = K(r.value.column, e);
+		let a = Y(r.column, e), o = Y(r.value.column, e);
 		if (!a || !o) throw Error("Column comparisons require declared source columns");
-		if (!G(a) && !G(o)) return Rr(r, t);
-		if (!G(a) || !G(o)) throw Error("Encoded decimal comparisons require two decimal columns");
-		if (!In.includes(r.op) || r.path?.length) throw Error("Unsupported exact decimal column comparison");
+		if (!J(a) && !J(o)) return qr(r, t);
+		if (!J(a) || !J(o)) throw Error("Encoded decimal comparisons require two decimal columns");
+		if (!Un.includes(r.op) || r.path?.length) throw Error("Unsupported exact decimal column comparison");
 		let s = (e, n) => {
 			if (n.precision === void 0 || n.scale === void 0) throw Error("Decimal comparison requires declared precision and scale");
 			return {
@@ -2274,78 +2381,78 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 				}
 			};
 		};
-		return t.unsafe(nr(s(r.column, a), r.op, s(r.value.column, o)));
+		return t.unsafe(lr(s(r.column, a), r.op, s(r.value.column, o)));
 	};
 	return i(r);
-}, fr = (e, t, n) => {
-	let r = (r) => dr(e, t, n, r), i = n.sourceTable ?? ((e) => e), a = e.alias === void 0 ? t`${t(i(e.table))}` : t`${t(i(e.table))} AS ${t(e.alias)}`;
+}, yr = (e, t, n) => {
+	let r = (r) => vr(e, t, n, r), i = n.sourceTable ?? ((e) => e), a = e.alias === void 0 ? t`${t(i(e.table))}` : t`${t(i(e.table))} AS ${t(e.alias)}`;
 	return {
 		from: (e.joins ?? []).reduce((e, n) => t`${e} ${n.kind === "inner" ? t`INNER` : t`LEFT`} JOIN ${t(i(n.table))} AS ${t(n.alias)} ON ${r(n.on)}`, a),
 		where: e.predicate === void 0 ? t`` : t` WHERE ${r(e.predicate)}`
 	};
-}, pr = (e, t, n, r, i) => {
+}, br = (e, t, n, r, i) => {
 	if (e.groupBy?.length || e.having) throw Error("Row queries cannot contain aggregate clauses");
-	let a = e.sourceTable?.tableName === e.table ? e.sourceTable : V(e.table), o = e.joinedProjection ?? (e.projection?.length ? e.projection : Object.keys(a?.fields ?? {})).map((t) => ({
+	let a = yn(e), o = e.sourceTable?.tableName === e.table ? e.sourceTable : W(e.table), s = e.joinedProjection ?? (e.projection?.length ? e.projection : Object.keys(o?.fields ?? {})).map((t) => ({
 		source: t.includes(".") ? t : `${e.alias ?? e.table}.${t}`,
 		outputKey: t.split(".").at(-1)
 	}));
-	if (!o.length) throw Error("Exact row projection requires declared source columns");
-	if (new Set(o.map((e) => e.outputKey)).size !== o.length) throw Error("Duplicate exact row output key");
-	let s = o.map((t, n) => {
-		let r = K(t.source, e);
-		if (!r) throw Error("Exact row projection requires declared source columns");
+	if (!s.length) throw Error("Exact row projection requires declared source columns");
+	if (new Set(s.map((e) => e.outputKey)).size !== s.length) throw Error("Duplicate exact row output key");
+	let c = e.order.length >= 8 && s.length >= 8 ? new Map(s.map((e) => [e.outputKey, e.source])) : void 0, l = s.map((e, t) => {
+		let n = a(e.source);
+		if (!n) throw Error("Exact row projection requires declared source columns");
 		return {
-			...t,
-			field: r,
-			internal: `v${n}`
+			...e,
+			field: n,
+			internal: `v${t}`
 		};
-	}), c = e.order.map((t, n) => {
-		let r = o.find((e) => e.outputKey === t.column)?.source ?? t.column, i = K(r, e);
-		if (!i) throw Error("Exact row order requires a declared source column");
+	}), u = e.order.map((e, t) => {
+		let n = (c === void 0 ? s.find((t) => t.outputKey === e.column)?.source : c.get(e.column)) ?? e.column, r = a(n);
+		if (!r) throw Error("Exact row order requires a declared source column");
 		return {
-			...t,
-			source: r,
-			field: i,
-			internal: `o${n}`
+			...e,
+			source: n,
+			field: r,
+			internal: `o${t}`
 		};
 	});
 	for (let t of [e.take, e.skip]) if (t !== void 0 && (!Number.isSafeInteger(t) || t < 0)) throw Error("Invalid exact decimal pagination");
-	let { from: l, where: u } = fr(e, t, n), d = [...s, ...c], [f, p] = t`SELECT ${t.csv(d.map((e) => t`${t(e.source)} AS ${t(e.internal)}`))} FROM ${l}${u}`.compile(), m = i ?? r, h = m?.prefix ?? "__voltro_decimal_rows_";
-	for (; f.toLowerCase().includes(h.toLowerCase());) h += "_";
-	let g = [], _ = (e, t) => {
-		m ? m.append(e, t) : g.push(`${e} AS MATERIALIZED (${t})`);
-	}, v = `${h}input`;
-	_(v, f);
-	let y = s.filter((e) => G(e.field));
-	if (r) for (let e of y) r.encodedOutput(e.outputKey);
-	let b = ar(v, r ? [] : y.map((e) => ({
+	let { from: d, where: f } = yr(e, t, n), p = [...l, ...u], [m, h] = t`SELECT ${t.join(", ", !1)(p.map((e) => t`${t(e.source)} AS ${t(e.internal)}`))} FROM ${d}${f}`.compile(), g = i ?? r, _ = g?.prefix ?? "__voltro_decimal_rows_";
+	for (; m.toLowerCase().includes(_.toLowerCase());) _ += "_";
+	let v = [], y = (e, t) => {
+		g ? g.append(e, t) : v.push(`${e} AS MATERIALIZED (${t})`);
+	}, b = `${_}input`;
+	y(b, m);
+	let x = l.filter((e) => J(e.field));
+	if (r) for (let e of x) r.encodedOutput(e.outputKey);
+	let S = fr(b, r ? [] : x.map((e) => ({
 		name: e.internal,
 		shape: {
 			precision: e.field.precision,
 			scale: e.field.scale
 		}
-	})), d.map((e) => e.internal), {
-		prefix: h,
-		append: _
+	})), p.map((e) => e.internal), {
+		prefix: _,
+		append: y
 	});
-	v = b.source;
-	let x = s.map((e) => {
-		let n = b.values.get(e.internal);
+	b = S.source;
+	let C = l.map((e) => {
+		let n = S.values.get(e.internal);
 		return t`${n ? t.unsafe(n) : e.field.type === "bigint" ? t`CAST(${t(e.internal)} AS TEXT)` : t`${t(e.internal)}`} AS ${t(e.outputKey)}`;
-	}), S = c.length ? t` ORDER BY ${t.csv(c.map((e) => {
-		let n = G(e.field) ? t`${t(e.internal)} COLLATE BINARY` : t`${t(e.internal)}`;
+	}), w = u.length ? t` ORDER BY ${t.join(", ", !1)(u.map((e) => {
+		let n = J(e.field) ? t`${t(e.internal)} COLLATE BINARY` : t`${t(e.internal)}`;
 		return e.direction === "desc" ? t`${n} DESC` : t`${n} ASC`;
-	}))}` : t``, C = e.take === void 0 ? e.skip === void 0 ? t`` : t` LIMIT -1` : t` LIMIT ${e.take}`, w = e.skip === void 0 ? t`` : t` OFFSET ${e.skip}`, T = g.length ? `WITH ${g.join(",")} ` : "", E = t`SELECT ${e.distinct ? t`DISTINCT ` : t``}${t.csv(x)} FROM ${t(v)}${S}${C}${w}`.compile();
-	return t.unsafe(T + E[0], [...p, ...E[1]]);
-}, mr = (e, t, n) => {
+	}))}` : t``, T = e.take === void 0 ? e.skip === void 0 ? t`` : t` LIMIT -1` : t` LIMIT ${e.take}`, E = e.skip === void 0 ? t`` : t` OFFSET ${e.skip}`, D = v.length ? `WITH ${v.join(",")} ` : "", O = t`SELECT ${e.distinct ? t`DISTINCT ` : t``}${t.join(", ", !1)(C)} FROM ${t(b)}${w}${T}${E}`.compile();
+	return t.unsafe(D + O[0], [...h, ...O[1]]);
+}, xr = (e, t, n) => {
 	let r = n ? t : `SELECT * FROM (${t}) LIMIT -1 OFFSET 0`;
 	return `${e} AS${n ? " MATERIALIZED" : ""} (${r})`;
-}, hr = ({ sourceSql: e, precision: t, scope: n, materialized: r = !1, stages: i }) => {
+}, Sr = ({ sourceSql: e, precision: t, scope: n, materialized: r = !1, stages: i }) => {
 	if (!Number.isSafeInteger(t) || t <= 0) throw RangeError("Invalid decimal aggregate precision");
 	let a = 1e6, o = (9223372036854775807n / BigInt(a)).toString(), s = Math.ceil((t + 1) / 6), c = Math.ceil((t + 20) / 6) * 6, l = [];
 	if (i && !/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(i.prefix)) throw Error("Invalid decimal stage prefix");
 	let u = (e) => (i?.prefix ?? "") + e, d = (e) => i?.reference?.(u(e)) ?? u(e), f = (e, t) => {
-		i ? i.append(u(e), t, r) : l.push(mr(e, t, r));
+		i ? i.append(u(e), t, r) : l.push(xr(e, t, r));
 	}, p = (e) => "\"" + e.replace(/"/g, "\"\"") + "\"", m = n?.kind === "group" ? n.columns.map((e, t) => `key${t}`) : n?.kind === "window" ? ["identity", ...(n.carryColumns ?? []).map((e, t) => `carry${t}`)] : [], h = m.length === 0 ? "" : m.join(",") + ",", g = n?.kind === "group" ? n.columns.map((e, t) => `${p(e)} AS key${t}`).join(",") : n?.kind === "window" ? [`${p(n.identity)} AS identity`, ...(n.carryColumns ?? []).map((e, t) => `${p(e)} AS carry${t}`)].join(",") : "", _ = n?.kind === "group" && n.columns.length > 0 ? ` GROUP BY ${n.columns.map(p).join(",")}` : "", v = n?.kind === "window" ? [...n.partitionBy?.length ? [`PARTITION BY ${n.partitionBy.map(p).join(",")}`] : [], ...n.orderBy?.length ? [`ORDER BY ${n.orderBy.map((e) => `${p(e.column)} ${e.direction === "desc" ? "DESC" : "ASC"}`).join(",")}`] : []] : [], y = n?.kind === "window" ? ` OVER (${v.join(" ")})` : "";
 	f("decimal_source", e);
 	let b = Array.from({ length: s }, (e, t) => `d${t}`), x = b.map((e, n) => {
@@ -2368,13 +2475,13 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		f(`decimal_sub${e + 1}`, `SELECT ${h}hi,lo,sign,n,CASE WHEN ${n}<0 THEN 1 ELSE 0 END AS borrow,printf('%06d',(${n}+${a})%${a})||result AS result FROM ${d(`decimal_sub${e}`)}`);
 	}
 	return `${l.length ? `WITH ${l.join(",\n")} ` : ""}SELECT ${h}CASE WHEN n=0 THEN NULL WHEN ltrim(result,'0')='' THEN '0' ELSE sign||ltrim(result,'0') END AS units,CAST(n AS TEXT) AS count FROM ${d(`decimal_sub${E}`)}`;
-}, gr = (e) => {
+}, Cr = (e) => {
 	let { precision: t, inputScale: n, resultScale: r, rounding: i, scope: a, materialized: o = !1, stages: s } = e;
 	if (!Number.isSafeInteger(n) || n < 0 || n > t || !Number.isSafeInteger(r) || r < 0) throw RangeError("Invalid decimal average scale");
-	let c = hr(e), l = a?.kind === "group" ? a.columns.map((e, t) => `key${t}`) : a?.kind === "window" ? ["identity", ...(a.carryColumns ?? []).map((e, t) => `carry${t}`)] : [], u = l.length === 0 ? "" : l.join(",") + ",", d = r - n, f = Math.ceil((t + 20) / 6) * 6 + Math.max(d, 0), p = f + Math.min(d, 0), m = Math.ceil(p / 6) * 6, h = [];
+	let c = Sr(e), l = a?.kind === "group" ? a.columns.map((e, t) => `key${t}`) : a?.kind === "window" ? ["identity", ...(a.carryColumns ?? []).map((e, t) => `carry${t}`)] : [], u = l.length === 0 ? "" : l.join(",") + ",", d = r - n, f = Math.ceil((t + 20) / 6) * 6 + Math.max(d, 0), p = f + Math.min(d, 0), m = Math.ceil(p / 6) * 6, h = [];
 	if (s && !/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(s.prefix)) throw Error("Invalid decimal stage prefix");
 	let g = (e) => (s?.prefix ?? "") + e, _ = (e) => s?.reference?.(g(e)) ?? g(e), v = (e, t) => {
-		s ? s.append(g(e), t, o) : h.push(mr(e, t, o));
+		s ? s.append(g(e), t, o) : h.push(xr(e, t, o));
 	};
 	v("decimal_avg_sum", c), v("decimal_avg_input", `SELECT ${u}count,CASE WHEN substr(units,1,1)='-' THEN '-' ELSE '' END AS sign,${`COALESCE(ltrim(units,'-'),'0')||'${"0".repeat(Math.max(d, 0))}'`} AS magnitude FROM ${_("decimal_avg_sum")}`), v("decimal_avg_div0", `SELECT ${u}count,sign,substr('${"0".repeat(f)}',1,${f}-length(magnitude))||magnitude AS digits,CASE WHEN count='0' THEN 1 ELSE CAST(count AS INTEGER) END AS denominator,0 AS remainder,'' AS result FROM ${_("decimal_avg_input")}`);
 	let y = 0;
@@ -2394,8 +2501,8 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		v(`decimal_avg_round${e}`, `SELECT ${u}count,sign,quotient,${t}/1000000 AS carry,printf('%06d',${t}%1000000)||result AS result FROM ${_(`decimal_avg_round${e - 1}`)}`);
 	}
 	return `${h.length ? `WITH ${h.join(",\n")} ` : ""}SELECT ${u}CASE WHEN count='0' THEN NULL WHEN ltrim(result,'0')='' THEN '0' ELSE sign||ltrim(result,'0') END AS units,count FROM ${_(`decimal_avg_round${C}`)}`;
-}, _r = (e, t, n, r, i, a) => {
-	let o = e.aggregations ?? [], s = {
+}, wr = (e, t, n, r, i, a) => {
+	let o = yn(e), s = e.aggregations ?? [], c = {
 		"window-row-number": "ROW_NUMBER",
 		"window-rank": "RANK",
 		"window-dense-rank": "DENSE_RANK",
@@ -2404,179 +2511,194 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		"window-sum-over": "SUM",
 		"window-avg-over": "AVG"
 	};
-	if (e.groupBy?.length || e.having || e.setOp || e.ctes || e.distinctOn || e.annClause || e.spatialClause || e.fullTextSearch || o.some((e) => e.op !== "column" && !(e.op in s))) throw Error("Exact window queries require supported ungrouped window projections");
-	if (new Set(o.map((e) => e.alias)).size !== o.length) throw Error("Duplicate decimal result alias");
-	let c = [...new Set(o.flatMap((e) => [
+	if (e.groupBy?.length || e.having || e.setOp || e.ctes || e.distinctOn || e.annClause || e.spatialClause || e.fullTextSearch || s.some((e) => e.op !== "column" && !(e.op in c))) throw Error("Exact window queries require supported ungrouped window projections");
+	if (new Set(s.map((e) => e.alias)).size !== s.length) throw Error("Duplicate decimal result alias");
+	let l = [...new Set(s.flatMap((e) => [
 		...e.column === void 0 ? [] : [e.column],
 		...e.window?.partitionBy ?? [],
 		...(e.window?.orderBy ?? []).map((e) => e.column)
-	]))].map((t, n) => {
-		let r = K(t, e);
-		if (!r) throw Error("Exact window requires declared source columns");
+	]))].map((e, t) => {
+		let n = o(e);
+		if (!n) throw Error("Exact window requires declared source columns");
 		return {
-			source: t,
-			name: `c${n}`,
-			field: r
+			source: e,
+			name: `c${t}`,
+			field: n
 		};
-	}), l = (e) => {
-		let t = c.find((t) => t.source === e);
+	}), u = new Map(l.map((e) => [e.source, e])), d = (e) => {
+		let t = u.get(e);
 		if (!t) throw Error("Unknown exact window source column");
 		return t.name;
-	}, u = (e) => "\"" + e.replace(/"/g, "\"\"") + "\"", { from: d, where: f } = fr(e, t, r), [p, m] = t`SELECT ${t.csv([t`ROW_NUMBER() OVER () AS identity`, ...c.map((e) => t`${t(e.source)} AS ${t(e.name)}`)])} FROM ${d}${f}`.compile(), h = i ?? a, g = h?.prefix ?? "__voltro_decimal_window_", _ = [e.table, ...(e.joins ?? []).map((e) => e.table)];
-	for (; _.some((e) => e.toLowerCase().startsWith(g));) g += "_";
-	let v = [], y = (e, t, n) => {
-		h ? h.append(e, t) : v.push(`${e} AS MATERIALIZED (${t})`);
+	}, f = (e) => "\"" + e.replace(/"/g, "\"\"") + "\"", { from: p, where: m } = yr(e, t, r), [h, g] = t`SELECT ${t.join(", ", !1)([t`ROW_NUMBER() OVER () AS identity`, ...l.map((e) => t`${t(e.source)} AS ${t(e.name)}`)])} FROM ${p}${m}`.compile(), _ = i ?? a, v = _?.prefix ?? "__voltro_decimal_window_", y = [e.table, ...(e.joins ?? []).map((e) => e.table)];
+	for (; y.some((e) => e.toLowerCase().startsWith(v));) v += "_";
+	let b = [], x = (e, t, n) => {
+		_ ? _.append(e, t) : b.push(`${e} AS MATERIALIZED (${t})`);
+	};
+	x(v + "source", h, n.materialized);
+	let S = [], C = /* @__PURE__ */ new Map(), w, T = !1, E = (t) => {
+		if (!T) {
+			T = !0;
+			let t = e.order;
+			if (t.length >= 32 && Object.getPrototypeOf(t) === Array.prototype && !Object.hasOwn(t, "some") && !Object.hasOwn(t, Symbol.iterator)) {
+				let e = [];
+				for (let n = 0; n < t.length; n++) {
+					let r = Object.getOwnPropertyDescriptor(t, String(n)), i = r && "value" in r ? Object.getOwnPropertyDescriptor(r.value, "column") : void 0;
+					if (!i || !("value" in i) || typeof i.value != "string") break;
+					e.push(i.value);
+				}
+				e.length === t.length && (w = new Set(e));
+			}
+		}
+		return w?.has(t) ?? e.order.some((e) => e.column === t);
 	};
-	y(g + "source", p, n.materialized);
-	let b = [], x = /* @__PURE__ */ new Map();
-	for (let [t, r] of o.entries()) {
-		let a = `SELECT * FROM ${g}source`, o = r.column === void 0 ? void 0 : c.find((e) => e.source === r.column);
-		if (r.op === "column") {
-			if (!o) throw Error("Window column projection requires a source column");
-			x.set(r.alias, {
-				value: o.name,
-				key: o.name,
-				encoded: o.field
+	for (let [e, t] of s.entries()) {
+		let r = `SELECT * FROM ${v}source`, a = t.column === void 0 ? void 0 : u.get(t.column);
+		if (t.op === "column") {
+			if (!a) throw Error("Window column projection requires a source column");
+			C.set(t.alias, {
+				value: a.name,
+				key: a.name,
+				encoded: a.field
 			});
 			continue;
 		}
-		let d = [
+		let o = [
 			"window-lag",
 			"window-lead",
 			"window-sum-over",
 			"window-avg-over"
-		].includes(r.op);
-		if (d && !o) throw Error("Window operation requires a source column");
-		let f = r.window?.partitionBy?.map(l), p = r.window?.orderBy?.map((e) => ({
+		].includes(t.op);
+		if (o && !a) throw Error("Window operation requires a source column");
+		let s = t.window?.partitionBy?.map(d), l = t.window?.orderBy?.map((e) => ({
 			...e,
-			column: l(e.column)
-		})), m = `w${t}`, h = G(o?.field) && ["window-sum-over", "window-avg-over"].includes(r.op);
-		if (h) {
-			let s = o.field.precision, c = o.field.scale, l = r.op === "window-avg-over" ? n.resultScale ?? c : c, d = s + 20 + Math.max(0, l - c), h = {
+			column: d(e.column)
+		})), p = `w${e}`, m = J(a?.field) && ["window-sum-over", "window-avg-over"].includes(t.op);
+		if (m) {
+			let o = a.field.precision, c = a.field.scale, u = t.op === "window-avg-over" ? n.resultScale ?? c : c, d = o + 20 + Math.max(0, u - c), m = {
 				kind: "window",
 				identity: "identity",
-				partitionBy: f ?? [],
-				orderBy: p ?? []
-			}, _ = /* @__PURE__ */ new Map(), v = 0, b = {
-				prefix: `${g}${t}_`,
+				partitionBy: s ?? [],
+				orderBy: l ?? []
+			}, h = /* @__PURE__ */ new Map(), g = 0, _ = {
+				prefix: `${v}${e}_`,
 				reference: (e) => {
-					let t = _.get(e);
+					let t = h.get(e);
 					return t === void 0 ? e : `(${t}${t.endsWith("LIMIT -1 OFFSET 0") ? "" : " LIMIT -1 OFFSET 0"}) AS ${e}`;
 				},
 				append: (e, t, r) => {
-					n.materialized || ++v % 4 == 0 ? y(e, t, r) : _.set(e, t);
+					n.materialized || ++g % 4 == 0 ? x(e, t, r) : h.set(e, t);
 				}
-			}, S = {
-				stages: b,
-				sourceSql: `SELECT *,${u(o.name)} AS value FROM (${a})`,
-				precision: s,
-				scope: h,
+			}, y = {
+				stages: _,
+				sourceSql: `SELECT *,${f(a.name)} AS value FROM (${r})`,
+				precision: o,
+				scope: m,
 				materialized: n.materialized
-			}, C = r.op === "window-avg-over" ? gr({
-				...S,
+			}, b = t.op === "window-avg-over" ? Cr({
+				...y,
 				inputScale: c,
-				resultScale: l,
+				resultScale: u,
 				rounding: n.rounding ?? "half-even"
-			}) : hr(S);
+			}) : Sr(y);
 			if (i) {
-				let e = vn(`SELECT identity,units AS value FROM (${C})`, {
+				let e = Cn(`SELECT identity,units AS value FROM (${b})`, {
 					precision: d,
 					scale: 0
 				}, ["identity"], {
-					prefix: b.prefix,
-					reference: b.reference,
-					append: (e, t) => b.append(e, t, n.materialized)
+					prefix: _.prefix,
+					reference: _.reference,
+					append: (e, t) => _.append(e, t, n.materialized)
 				});
-				a = `SELECT identity,value AS ${u(m)} FROM ${e}`, x.set(r.alias, {
-					value: m,
-					key: m,
+				r = `SELECT identity,value AS ${f(p)} FROM ${e}`, C.set(t.alias, {
+					value: p,
+					key: p,
 					encoded: {
-						...o.field,
+						...a.field,
 						precision: d,
-						scale: l
+						scale: u
 					}
 				});
 			} else {
-				let t = cr({
-					sourceSql: C,
+				let e = hr({
+					sourceSql: b,
 					digits: d,
-					scale: l,
+					scale: u,
 					materialized: n.materialized,
-					stages: b
-				}), i = e.order.some((e) => e.column === r.alias);
-				a = `SELECT identity,decimal_value AS ${u(m)}${i ? `,decimal_key AS ${u(m + "_key")}` : ""} FROM (${t})`, x.set(r.alias, {
-					value: m,
-					key: i ? m + "_key" : m
+					stages: _
+				}), i = E(t.alias);
+				r = `SELECT identity,decimal_value AS ${f(p)}${i ? `,decimal_key AS ${f(p + "_key")}` : ""} FROM (${e})`, C.set(t.alias, {
+					value: p,
+					key: i ? p + "_key" : p
 				});
 			}
 		} else {
-			let e = [...f?.length ? [`PARTITION BY ${f.map(u).join(",")}`] : [], ...p?.length ? [`ORDER BY ${p.map((e) => `${u(e.column)} ${e.direction === "desc" ? "DESC" : "ASC"}`).join(",")}`] : []].join(" "), i = r.op === "window-lag" || r.op === "window-lead", c = r.offset ?? 1;
-			if (i && (!Number.isSafeInteger(c) || c < 0)) throw Error("Invalid exact window offset");
-			let l = d ? u(o.name) + (i ? `,${c}` : "") : "";
-			if (r.op === "window-rank" || r.op === "window-dense-rank") {
-				let i = [.../* @__PURE__ */ new Set([...f ?? [], ...(p ?? []).map((e) => e.column)])], o = i.length ? `PARTITION BY ${i.map(u).join(",")}` : "";
-				if (r.op === "window-rank") a = `SELECT *,COUNT(*) OVER (${e})-COUNT(*) OVER (${o})+1 AS ${u(m)} FROM (${a})`;
+			let i = [...s?.length ? [`PARTITION BY ${s.map(f).join(",")}`] : [], ...l?.length ? [`ORDER BY ${l.map((e) => `${f(e.column)} ${e.direction === "desc" ? "DESC" : "ASC"}`).join(",")}`] : []].join(" "), u = t.op === "window-lag" || t.op === "window-lead", d = t.offset ?? 1;
+			if (u && (!Number.isSafeInteger(d) || d < 0)) throw Error("Invalid exact window offset");
+			let m = o ? f(a.name) + (u ? `,${d}` : "") : "";
+			if (t.op === "window-rank" || t.op === "window-dense-rank") {
+				let a = [.../* @__PURE__ */ new Set([...s ?? [], ...(l ?? []).map((e) => e.column)])], o = a.length ? `PARTITION BY ${a.map(f).join(",")}` : "";
+				if (t.op === "window-rank") r = `SELECT *,COUNT(*) OVER (${i})-COUNT(*) OVER (${o})+1 AS ${f(p)} FROM (${r})`;
 				else {
-					let r = `${m}_peer`, i = `${g}peer${t}`;
-					y(i, `SELECT *,CASE WHEN ROW_NUMBER() OVER (${o})=1 THEN 1 ELSE 0 END AS ${u(r)} FROM (${a})`, n.materialized), a = `SELECT *,SUM(${u(r)}) OVER (${e}) AS ${u(m)} FROM ${i}`;
+					let t = `${p}_peer`, a = `${v}peer${e}`;
+					x(a, `SELECT *,CASE WHEN ROW_NUMBER() OVER (${o})=1 THEN 1 ELSE 0 END AS ${f(t)} FROM (${r})`, n.materialized), r = `SELECT *,SUM(${f(t)}) OVER (${i}) AS ${f(p)} FROM ${a}`;
 				}
-			} else if (i) {
-				let e = `${m}_position`, i = `${g}shift${t}`;
-				y(i, `SELECT *,ROW_NUMBER() OVER (${[...f?.length ? [`PARTITION BY ${f.map(u).join(",")}`] : [], `ORDER BY ${[...(p ?? []).map((e) => `${u(e.column)} ${e.direction === "desc" ? "DESC" : "ASC"}`), "identity ASC"].join(",")}`].join(" ")}) AS ${u(e)} FROM (${a})`, n.materialized);
-				let s = [...(f ?? []).map((e) => `shifted.${u(e)} IS current.${u(e)}`), `shifted.${u(e)}=current.${u(e)}${r.op === "window-lag" ? "-" : "+"}${c}`].join(" AND ");
-				a = `SELECT current.*,(SELECT shifted.${u(o.name)} FROM ${i} AS shifted WHERE ${s}) AS ${u(m)} FROM ${i} AS current`;
-			} else a = `SELECT *,${s[r.op]}(${l}) OVER (${e}) AS ${u(m)} FROM (${a}) LIMIT -1 OFFSET 0`;
-			x.set(r.alias, {
-				value: m,
-				key: m,
-				...i ? { encoded: o.field } : {}
+			} else if (u) {
+				let i = `${p}_position`, o = `${v}shift${e}`;
+				x(o, `SELECT *,ROW_NUMBER() OVER (${[...s?.length ? [`PARTITION BY ${s.map(f).join(",")}`] : [], `ORDER BY ${[...(l ?? []).map((e) => `${f(e.column)} ${e.direction === "desc" ? "DESC" : "ASC"}`), "identity ASC"].join(",")}`].join(" ")}) AS ${f(i)} FROM (${r})`, n.materialized);
+				let c = [...(s ?? []).map((e) => `shifted.${f(e)} IS current.${f(e)}`), `shifted.${f(i)}=current.${f(i)}${t.op === "window-lag" ? "-" : "+"}${d}`].join(" AND ");
+				r = `SELECT current.*,(SELECT shifted.${f(a.name)} FROM ${o} AS shifted WHERE ${c}) AS ${f(p)} FROM ${o} AS current`;
+			} else r = `SELECT *,${c[t.op]}(${m}) OVER (${i}) AS ${f(p)} FROM (${r}) LIMIT -1 OFFSET 0`;
+			C.set(t.alias, {
+				value: p,
+				key: p,
+				...u ? { encoded: a.field } : {}
 			});
 		}
-		let _ = `${g}stage${t}`, v = h && x.get(r.alias).key !== m ? [m, m + "_key"] : [m];
-		y(_, h ? a : `SELECT identity,${v.map(u).join(",")} FROM (${a})`, n.materialized), b.push({
-			stage: _,
-			values: v
+		let h = `${v}stage${e}`, g = m && C.get(t.alias).key !== p ? [p, p + "_key"] : [p];
+		x(h, m ? r : `SELECT identity,${g.map(f).join(",")} FROM (${r})`, n.materialized), S.push({
+			stage: h,
+			values: g
 		});
 	}
-	let S = `${g}output`;
-	y(S, `SELECT ${["input.*", ...b.flatMap((e) => e.values.map((t) => `(SELECT result.${u(t)} FROM ${e.stage} AS result WHERE result.identity=input.identity) AS ${u(t)}`))].join(",")} FROM ${g}source AS input`, n.materialized);
-	let C = new Map([...x.values()].flatMap((e) => G(e.encoded) ? [[e.value, {
+	let D = `${v}output`;
+	x(D, `SELECT ${["input.*", ...S.flatMap((e) => e.values.map((t) => `(SELECT result.${f(t)} FROM ${e.stage} AS result WHERE result.identity=input.identity) AS ${f(t)}`))].join(",")} FROM ${v}source AS input`, n.materialized);
+	let O = new Map([...C.values()].flatMap((e) => J(e.encoded) ? [[e.value, {
 		name: e.value,
 		shape: {
 			precision: e.encoded.precision,
 			scale: e.encoded.scale
 		}
-	}]] : [])), w = ar(S, i ? [] : [...C.values()], [
+	}]] : [])), k = fr(D, i ? [] : [...O.values()], [
 		"identity",
-		...c.map((e) => e.name),
-		...b.flatMap((e) => e.values)
+		...l.map((e) => e.name),
+		...S.flatMap((e) => e.values)
 	], {
-		prefix: `${g}result_`,
-		append: (e, t) => y(e, t, n.materialized)
-	}), T = o.map((e) => {
-		let t = x.get(e.alias), n = `window_output.${u(t.value)}`;
-		return i && G(t.encoded) ? (i.encodedOutput(e.alias), `${n} AS ${u(e.alias)}`) : `${w.values.get(t.value) ?? (t.encoded?.type === "bigint" ? `CAST(${n} AS TEXT)` : n)} AS ${u(e.alias)}`;
-	}), E = e.order.length ? " ORDER BY " + e.order.map((e) => {
-		let t = x.get(e.column);
+		prefix: `${v}result_`,
+		append: (e, t) => x(e, t, n.materialized)
+	}), ee = s.map((e) => {
+		let t = C.get(e.alias), n = `window_output.${f(t.value)}`;
+		return i && J(t.encoded) ? (i.encodedOutput(e.alias), `${n} AS ${f(e.alias)}`) : `${k.values.get(t.value) ?? (t.encoded?.type === "bigint" ? `CAST(${n} AS TEXT)` : n)} AS ${f(e.alias)}`;
+	}), A = e.order.length ? " ORDER BY " + e.order.map((e) => {
+		let t = C.get(e.column);
 		if (!t) throw Error("Ordering references an unknown window result");
-		return `window_output.${u(t.key)} ${e.direction === "desc" ? "DESC" : "ASC"}`;
+		return `window_output.${f(t.key)} ${e.direction === "desc" ? "DESC" : "ASC"}`;
 	}).join(",") : "";
 	for (let t of [e.take, e.skip]) if (t !== void 0 && (!Number.isSafeInteger(t) || t < 0)) throw Error("Invalid exact decimal pagination");
-	let D = e.take === void 0 ? e.skip === void 0 ? "" : " LIMIT -1" : ` LIMIT ${e.take}`, ee = e.skip === void 0 ? "" : ` OFFSET ${e.skip}`;
-	return t.unsafe(`${h ? "" : `WITH ${v.join(",")} `}SELECT ${e.distinct ? "DISTINCT " : ""}${T.join(",")} FROM ${w.source} AS window_output${E}${D}${ee}`, m);
-}, vr = (e, t, n, r, i, a) => {
+	let j = e.take === void 0 ? e.skip === void 0 ? "" : " LIMIT -1" : ` LIMIT ${e.take}`, M = e.skip === void 0 ? "" : ` OFFSET ${e.skip}`;
+	return t.unsafe(`${_ ? "" : `WITH ${b.join(",")} `}SELECT ${e.distinct ? "DISTINCT " : ""}${ee.join(",")} FROM ${k.source} AS window_output${A}${j}${M}`, g);
+}, Tr = (e, t, n, r, i, a) => {
 	if (!t.onDialectOrElse({
 		sqlite: () => !0,
 		orElse: () => !1
 	})) throw Error("Encoded decimal query integration requires a SQLite-family compiler");
-	if (e.ctes?.length) return Sn(e, t, n.resultScale, (e, i, a) => vr(e, t, n, r, i, a));
-	if (e.setOp) return er(e, t, n, (e) => vr(e, t, n, r));
+	if (e.ctes?.length) return Dn(e, t, n.resultScale, (e, i, a) => Tr(e, t, n, r, i, a));
+	if (e.setOp) return sr(e, t, n, (e) => Tr(e, t, n, r));
 	let o = {
-		compile: (e) => vr(e, t, n, r),
+		compile: (e) => Tr(e, t, n, r),
 		resultScale: n.resultScale,
 		sourceTable: r
 	}, s = e.aggregations ?? [];
-	if (s.length > 0 && s.every((e) => e.op === "column") && !e.groupBy?.length && !e.having || s.some((e) => e.op.startsWith("window-"))) return _r(e, t, n, o, i, a);
+	if (s.length > 0 && s.every((e) => e.op === "column") && !e.groupBy?.length && !e.having || s.some((e) => e.op.startsWith("window-"))) return wr(e, t, n, o, i, a);
 	let c = s.length === 0, l = s.filter((e) => e.op !== "column"), u = !c && l.length === 0, d = {
 		sum: "SUM",
 		avg: "AVG",
@@ -2587,55 +2709,58 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 	};
 	if (u && !e.groupBy?.length || l.some((e) => !(e.op in d)) || e.setOp || e.distinctOn || e.ctes || e.annClause || e.spatialClause || e.fullTextSearch) throw Error("Exact decimal query integration requires supported grouped aggregate projections");
 	if (new Set(s.map((e) => e.alias)).size !== s.length) throw Error("Duplicate decimal result alias");
-	let f = e.groupBy ?? [];
-	for (let t of f) if (K(t, e) === void 0) throw Error("Exact decimal grouping requires declared source columns");
-	for (let e of s) if (e.op === "column" && !f.includes(e.column ?? "")) throw Error("Projected group column is absent from GROUP BY");
-	let p = "__decimal_group_identity";
-	for (; s.some((e) => e.alias === p);) p += "_";
-	let m = [...(u ? [{
+	let f = yn(e), p = e.groupBy ?? [], m = /* @__PURE__ */ new Map();
+	p.forEach((e, t) => {
+		m.has(e) || m.set(e, t);
+	});
+	for (let e of p) if (f(e) === void 0) throw Error("Exact decimal grouping requires declared source columns");
+	for (let e of s) if (e.op === "column" && !m.has(e.column ?? "")) throw Error("Projected group column is absent from GROUP BY");
+	let h = "__decimal_group_identity";
+	for (; s.some((e) => e.alias === h);) h += "_";
+	let g = [...(u ? [{
 		op: "count",
-		alias: p
+		alias: h
 	}] : l).map((e) => ({
 		aggregate: e,
 		projection: e
-	})), ...s.filter((t) => t.op === "column" && G(K(t.column ?? "", e))).map((e) => ({
+	})), ...s.filter((e) => e.op === "column" && J(f(e.column ?? ""))).map((e) => ({
 		aggregate: {
 			...e,
 			op: "min"
 		},
 		projection: e
-	}))].map(({ aggregate: t, projection: r }, i) => {
-		if (t.column === void 0 && t.op !== "count") throw Error("Aggregate requires a source column");
-		let a = K(t.column ?? "", e);
-		if (t.column !== void 0 && a === void 0) throw Error("Aggregate requires a declared source column");
-		let o = G(a) && !t.op.startsWith("count");
-		if (o && (a.precision === void 0 || a.scale === void 0)) throw Error("Exact decimal aggregate requires declared precision and scale");
-		let s = o ? a.precision : 0, c = o ? a.scale : 0, l = t.op === "avg" ? n.resultScale ?? c : c;
+	}))].map(({ aggregate: e, projection: t }, r) => {
+		if (e.column === void 0 && e.op !== "count") throw Error("Aggregate requires a source column");
+		let i = f(e.column ?? "");
+		if (e.column !== void 0 && i === void 0) throw Error("Aggregate requires a declared source column");
+		let a = J(i) && !e.op.startsWith("count");
+		if (a && (i.precision === void 0 || i.scale === void 0)) throw Error("Exact decimal aggregate requires declared precision and scale");
+		let o = a ? i.precision : 0, s = a ? i.scale : 0, c = e.op === "avg" ? n.resultScale ?? s : s;
 		return {
-			aggregate: t,
-			projection: r,
-			index: i,
-			exact: o,
-			precision: s,
-			inputScale: c,
-			scale: l,
-			digits: s + 20 + Math.max(0, l - c)
+			aggregate: e,
+			projection: t,
+			index: r,
+			exact: a,
+			precision: o,
+			inputScale: s,
+			scale: c,
+			digits: o + 20 + Math.max(0, c - s)
 		};
-	}), h = /* @__PURE__ */ new Map(), g = s.map((e) => {
-		let n = m.find((t) => t.projection === e);
-		if (n) return h.set(e.alias, `result${n.index}.${n.exact ? "decimal_key" : "result_value"}`), t`${t(`result${n.index}.${n.exact ? "decimal_value" : "result_value"}`)} AS ${t(e.alias)}`;
-		let r = f.indexOf(e.column ?? "");
+	}), _ = new Map(g.map((e) => [e.projection, e])), v = new Map(g.map((e) => [e.projection.alias, e])), y = /* @__PURE__ */ new Map(), b = s.map((e) => {
+		let n = _.get(e);
+		if (n) return y.set(e.alias, `result${n.index}.${n.exact ? "decimal_key" : "result_value"}`), t`${t(`result${n.index}.${n.exact ? "decimal_value" : "result_value"}`)} AS ${t(e.alias)}`;
+		let r = m.get(e.column ?? "") ?? -1;
 		if (r < 0) throw Error("Projected group column is absent from GROUP BY");
-		return h.set(e.alias, `result0.key${r}`), t`${t(`result0.key${r}`)} AS ${t(e.alias)}`;
-	}), _ = (e) => {
-		if ("and" in e) return { and: e.and.map(_) };
-		if ("or" in e) return { or: e.or.map(_) };
-		if ("not" in e) return { not: _(e.not) };
+		return y.set(e.alias, `result0.key${r}`), t`${t(`result0.key${r}`)} AS ${t(e.alias)}`;
+	}), x = (e) => {
+		if ("and" in e) return { and: e.and.map(x) };
+		if ("or" in e) return { or: e.or.map(x) };
+		if ("not" in e) return { not: x(e.not) };
 		if ("subquery" in e || !("column" in e) || !("op" in e)) throw Error("Decimal subquery predicates are not integrated yet");
-		if (Y(e.value)) throw Error("Column references require result comparison lowering");
-		let t = m.find((t) => t.projection.alias === e.column), n = h.get(e.column);
+		if (Hn(e.value)) throw Error("Column references require result comparison lowering");
+		let t = v.get(e.column), n = y.get(e.column);
 		if (n === void 0) throw Error("HAVING references an unknown projected aggregate or group key");
-		return t?.exact ? ur({
+		return t?.exact ? _r({
 			...e,
 			column: n
 		}, {
@@ -2645,58 +2770,58 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			...e,
 			column: n
 		};
-	}, v = [...m.flatMap((e) => e.aggregate.column === void 0 ? [] : [{
+	}, S = [...g.flatMap((e) => e.aggregate.column === void 0 ? [] : [{
 		source: e.aggregate.column,
 		outputKey: `value${e.index}`
-	}]), ...f.map((e, t) => ({
+	}]), ...p.map((e, t) => ({
 		source: e,
 		outputKey: `group${t}`
-	}))], y = v.length ? t.csv(v.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : t`1 AS decimal_query_row`, { from: b, where: x } = fr(e, t, o);
-	if (c) return pr(e, t, o, i, a);
-	let S = t`SELECT ${y} FROM ${b}${x}`.compile(), C = (e) => "\"" + e.replace(/"/g, "\"\"") + "\"", w = f.map((e, t) => `group${t}`), T = w.map((e, t) => `${C(e)} AS ${C(`key${t}`)}`).join(","), E = w.length ? ` GROUP BY ${w.map(C).join(",")}` : "", D = n.materialized ? "decimal_query_source" : `(${S[0]})`, ee = m.map((e) => {
-		let { aggregate: t, index: r, precision: i, inputScale: a, scale: o, digits: s } = e, c = t.column === void 0 ? "*" : C(`value${r}`);
-		if (!e.exact) return `SELECT ${T ? T + "," : ""}${d[t.op]}(${t.op === "count-distinct" ? "DISTINCT " : ""}${c}) AS result_value FROM ${D}${E}`;
+	}))], C = S.length ? t.join(", ", !1)(S.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : t`1 AS decimal_query_row`, { from: w, where: T } = yr(e, t, o);
+	if (c) return br(e, t, o, i, a);
+	let E = t`SELECT ${C} FROM ${w}${T}`.compile(), D = (e) => "\"" + e.replace(/"/g, "\"\"") + "\"", O = p.map((e, t) => `group${t}`), k = O.map((e, t) => `${D(e)} AS ${D(`key${t}`)}`).join(","), ee = O.length ? ` GROUP BY ${O.map(D).join(",")}` : "", A = n.materialized ? "decimal_query_source" : `(${E[0]})`, j = g.map((e) => {
+		let { aggregate: t, index: r, precision: i, inputScale: a, scale: o, digits: s } = e, c = t.column === void 0 ? "*" : D(`value${r}`);
+		if (!e.exact) return `SELECT ${k ? k + "," : ""}${d[t.op]}(${t.op === "count-distinct" ? "DISTINCT " : ""}${c}) AS result_value FROM ${A}${ee}`;
 		let l = {
-			sourceSql: t.op === "min" || t.op === "max" ? `SELECT ${w.length ? w.map(C).join(",") + "," : ""}${d[t.op]}(${c}) AS value FROM ${D}${E}` : `SELECT ${w.length ? w.map(C).join(",") + "," : ""}${c} AS value FROM ${D}`,
+			sourceSql: t.op === "min" || t.op === "max" ? `SELECT ${O.length ? O.map(D).join(",") + "," : ""}${d[t.op]}(${c}) AS value FROM ${A}${ee}` : `SELECT ${O.length ? O.map(D).join(",") + "," : ""}${c} AS value FROM ${A}`,
 			precision: i,
 			materialized: n.materialized,
-			...f.length ? { scope: {
+			...p.length ? { scope: {
 				kind: "group",
-				columns: w
+				columns: O
 			} } : {}
 		};
-		return cr({
-			sourceSql: t.op === "avg" ? gr({
+		return hr({
+			sourceSql: t.op === "avg" ? Cr({
 				...l,
 				inputScale: a,
 				resultScale: o,
 				rounding: n.rounding ?? "half-even"
-			}) : hr(l),
+			}) : Sr(l),
 			digits: s,
 			scale: o,
 			materialized: n.materialized
 		});
-	}), O = [...n.materialized ? [`decimal_query_source AS MATERIALIZED (${S[0]})`] : [], ...ee.map((e, t) => {
+	}), M = [...n.materialized ? [`decimal_query_source AS MATERIALIZED (${E[0]})`] : [], ...j.map((e, t) => {
 		let r = n.materialized ? e : `SELECT * FROM (${e}) LIMIT -1 OFFSET 0`;
 		return `result${t} AS${n.materialized ? " MATERIALIZED" : ""} (${r})`;
-	})].join(","), te = m.slice(1).map((e) => f.length ? ` JOIN result${e.index} ON ${f.map((t, n) => `result0.${C(`key${n}`)} IS result${e.index}.${C(`key${n}`)}`).join(" AND ")}` : ` CROSS JOIN result${e.index}`).join(""), k = (e) => {
-		if ("not" in e) return t`NOT (${k(e.not)})`;
-		if ("and" in e) return e.and.length ? t.and(e.and.map(k)) : t`TRUE`;
-		if ("or" in e) return e.or.length ? t.or(e.or.map(k)) : t`FALSE`;
-		if ("subquery" in e) return $n(e, t, o, (e) => {
-			let n = h.get(e);
+	})].join(","), N = g.slice(1).map((e) => p.length ? ` JOIN result${e.index} ON ${p.map((t, n) => `result0.${D(`key${n}`)} IS result${e.index}.${D(`key${n}`)}`).join(" AND ")}` : ` CROSS JOIN result${e.index}`).join(""), P = (e) => {
+		if ("not" in e) return t`NOT (${P(e.not)})`;
+		if ("and" in e) return e.and.length ? t.and(e.and.map(P)) : t`TRUE`;
+		if ("or" in e) return e.or.length ? t.or(e.or.map(P)) : t`FALSE`;
+		if ("subquery" in e) return or(e, t, o, (e) => {
+			let n = y.get(e);
 			if (!n) throw Error("HAVING references an unknown projected aggregate or group key");
-			let r = m.find((t) => t.projection.alias === e);
+			let r = v.get(e);
 			return r?.exact ? {
 				value: t`${t(`result${r.index}.decimal_value`)}`,
 				scale: r.scale
 			} : { value: t`${t(n)}` };
 		});
-		if (!("value" in e) || !Y(e.value)) return Lr(_(e), t);
-		let n = h.get(e.column), r = h.get(e.value.column);
+		if (!("value" in e) || !Hn(e.value)) return Kr(x(e), t);
+		let n = y.get(e.column), r = y.get(e.value.column);
 		if (n === void 0 || r === void 0) throw Error("HAVING references an unknown projected aggregate or group key");
-		let i = m.find((t) => t.projection.alias === e.column), a = e.value.column, s = m.find((e) => e.projection.alias === a);
-		if (!i?.exact && !s?.exact) return Lr({
+		let i = v.get(e.column), a = e.value.column, s = v.get(a);
+		if (!i?.exact && !s?.exact) return Kr({
 			...e,
 			column: n,
 			value: {
@@ -2705,8 +2830,8 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			}
 		}, t);
 		if (!i?.exact || !s?.exact) throw Error("Exact aggregate comparisons require two decimal results");
-		if (!In.includes(e.op) || e.path?.length) throw Error("Unsupported exact decimal result comparison");
-		return t.unsafe(lr({
+		if (!Un.includes(e.op) || e.path?.length) throw Error("Unsupported exact decimal result comparison");
+		return t.unsafe(gr({
 			expression: t`${t(n)}`.compile()[0],
 			digits: i.digits,
 			scale: i.scale
@@ -2715,36 +2840,36 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			digits: s.digits,
 			scale: s.scale
 		}));
-	}, A = e.having === void 0 ? t`` : t` WHERE ${k(e.having)}`, j = e.order.length === 0 ? t`` : t` ORDER BY ${t.csv(e.order.map((e) => {
-		let n = h.get(e.column);
+	}, F = e.having === void 0 ? t`` : t` WHERE ${P(e.having)}`, te = e.order.length === 0 ? t`` : t` ORDER BY ${t.join(", ", !1)(e.order.map((e) => {
+		let n = y.get(e.column);
 		if (n === void 0) throw Error("Ordering references an unknown decimal result projection");
 		return e.direction === "desc" ? t`${t(n)} DESC` : t`${t(n)} ASC`;
 	}))}`;
 	for (let t of [e.take, e.skip]) if (t !== void 0 && (!Number.isSafeInteger(t) || t < 0)) throw Error("Invalid exact decimal pagination");
-	let ne = e.take === void 0 ? e.skip === void 0 ? t`` : t` LIMIT -1` : t` LIMIT ${e.take}`, M = e.skip === void 0 ? t`` : t` OFFSET ${e.skip}`, re = t`WITH ${t.unsafe(O)} SELECT ${e.distinct ? t`DISTINCT ` : t``}${t.csv(g)} FROM result0${t.unsafe(te)}${A}${j}${ne}${M}`.compile(), ie = n.materialized ? S[1] : m.flatMap(() => S[1]);
+	let I = e.take === void 0 ? e.skip === void 0 ? t`` : t` LIMIT -1` : t` LIMIT ${e.take}`, ne = e.skip === void 0 ? t`` : t` OFFSET ${e.skip}`, re = t`WITH ${t.unsafe(M)} SELECT ${e.distinct ? t`DISTINCT ` : t``}${t.join(", ", !1)(b)} FROM result0${t.unsafe(N)}${F}${te}${I}${ne}`.compile(), ie = n.materialized ? E[1] : g.flatMap(() => E[1]);
 	return t.unsafe(re[0], [...ie, ...re[1]]);
-}, yr = (e, t, n, r = null) => {
-	let i = xn(e, n.resultScale), a = new Set((i.ctes ?? []).map((e) => e.name));
-	return vr(i, t, n, (e) => a.has(e) ? e : qn(r, e));
-}, br = (e) => e.replace(/[A-Z]/g, (e) => e.toLowerCase()), xr = (e, t) => {
+}, Er = (e, t, n, r = null) => {
+	let i = En(e, n.resultScale), a = new Set((i.ctes ?? []).map((e) => e.name));
+	return Tr(i, t, n, (e) => a.has(e) ? e : er(r, e));
+}, Dr = (e) => e.replace(/[A-Z]/g, (e) => e.toLowerCase()), Or = (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}`;
-}, Z = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), Q = (e, t, n = null, r, i = /* @__PURE__ */ new Set()) => {
-	if ("not" in e) return t`NOT (${Q(e.not, t, n, r, i)})`;
-	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => Q(e, t, n, r, i)));
-	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => Q(e, t, n, r, i)));
+}, kr = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), $ = (e, t, n = null, r, i = /* @__PURE__ */ new Set()) => {
+	if ("not" in e) return t`NOT (${$(e.not, t, n, r, i)})`;
+	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => $(e, t, n, r, i)));
+	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => $(e, t, n, r, i)));
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
-		let r = e, a = $(r.subquery, t, n, void 0, i);
+		let r = e, a = Wr(r.subquery, t, n, void 0, i);
 		return r.op === "subquery-in" ? t`${t(r.column)} IN (${a})` : t`${t(r.column)} NOT IN (${a})`;
 	}
 	if (e.op === "exists" || e.op === "not-exists") {
-		let r = e, a = $(r.subquery, t, n, void 0, i);
+		let r = e, a = Wr(r.subquery, t, n, void 0, i);
 		return r.op === "exists" ? t`EXISTS (${a})` : t`NOT EXISTS (${a})`;
 	}
 	let a = e;
-	if (Y(a.value)) {
-		if (!In.some((e) => e === a.op) || a.path !== void 0) throw P("Column references require a scalar comparison without a JSON path");
+	if (Hn(a.value)) {
+		if (!Un.some((e) => e === a.op) || a.path !== void 0) throw L("Column references require a scalar comparison without a JSON path");
 		let e = t(a.value.column), n = t(a.column);
 		switch (a.op) {
 			case "eq": return t`${n} = ${e}`;
@@ -2756,19 +2881,19 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		}
 	}
 	let o = t(a.column), s = a.path, c = s !== void 0 && s.length > 0, l = () => t.onDialectOrElse({
-		mysql: () => t.unsafe(X(a.column, s, "mysql")),
-		mssql: () => t.unsafe(X(a.column, s, "mssql")),
-		sqlite: () => t.unsafe(X(a.column, s, "sqlite")),
-		orElse: () => t.unsafe(X(a.column, s, "postgres"))
+		mysql: () => t.unsafe(Q(a.column, s, "mysql")),
+		mssql: () => t.unsafe(Q(a.column, s, "mssql")),
+		sqlite: () => t.unsafe(Q(a.column, s, "sqlite")),
+		orElse: () => t.unsafe(Q(a.column, s, "postgres"))
 	}), u = () => t.onDialectOrElse({
-		mysql: () => t.unsafe(X(a.column, s, "mysql", { numeric: !0 })),
-		mssql: () => t.unsafe(X(a.column, s, "mssql", { numeric: !0 })),
-		sqlite: () => t.unsafe(X(a.column, s, "sqlite", { numeric: !0 })),
-		orElse: () => t.unsafe(X(a.column, s, "postgres", { numeric: !0 }))
-	}), d = c ? l() : o, f = c ? u() : o, p = (e) => c && e != null ? String(e) : e, m = (e) => c ? Number(e) : e, h = c || r === void 0 ? void 0 : V(r)?.fields?.[a.column]?.type, g = (e) => {
-		let n = Xn(h, e);
+		mysql: () => t.unsafe(Q(a.column, s, "mysql", { numeric: !0 })),
+		mssql: () => t.unsafe(Q(a.column, s, "mssql", { numeric: !0 })),
+		sqlite: () => t.unsafe(Q(a.column, s, "sqlite", { numeric: !0 })),
+		orElse: () => t.unsafe(Q(a.column, s, "postgres", { numeric: !0 }))
+	}), d = c ? l() : o, f = c ? u() : o, p = (e) => c && e != null ? String(e) : e, m = (e) => c ? Number(e) : e, h = c || r === void 0 ? void 0 : W(r)?.fields?.[a.column]?.type, g = (e) => {
+		let n = rr(h, e);
 		return n instanceof Date ? t.onDialectOrElse({
-			sqlite: () => Ln(n),
+			sqlite: () => Wn(n),
 			orElse: () => n
 		}) : n;
 	};
@@ -2788,7 +2913,7 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			return e.length === 0 ? t`TRUE` : t`${d} NOT IN ${t.in(c ? e.map((e) => p(e)) : e.map(g))}`;
 		}
 		case "contains": {
-			let e = `%${Z(typeof a.value == "string" ? a.value : String(a.value ?? ""))}%`;
+			let e = `%${kr(typeof a.value == "string" ? a.value : String(a.value ?? ""))}%`;
 			return t.onDialectOrElse({
 				mysql: () => t`LOWER(${d}) LIKE LOWER(${e})`,
 				mssql: () => t`LOWER(${d}) LIKE LOWER(${e})`,
@@ -2797,7 +2922,7 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			});
 		}
 		case "startsWith": {
-			let e = `${Z(typeof a.value == "string" ? a.value : String(a.value ?? ""))}%`;
+			let e = `${kr(typeof a.value == "string" ? a.value : String(a.value ?? ""))}%`;
 			return t.onDialectOrElse({
 				mysql: () => t`${d} LIKE ${e}`,
 				orElse: () => t`${d} LIKE ${e} ESCAPE '\\'`
@@ -2833,25 +2958,25 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			let e = a.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 P("@voltro/plugin-postgis: spatial predicates are postgres-only");
+					throw L("@voltro/plugin-postgis: spatial predicates are postgres-only");
 				},
 				mssql: () => {
-					throw P("@voltro/plugin-postgis: spatial predicates are postgres-only");
+					throw L("@voltro/plugin-postgis: spatial predicates are postgres-only");
 				},
 				sqlite: () => {
-					throw P("@voltro/plugin-postgis: spatial predicates are postgres-only");
+					throw L("@voltro/plugin-postgis: spatial predicates are postgres-only");
 				},
 				orElse: () => e.fn === "ST_DWithin" ? t`ST_DWithin(${o}::geography, ${e.geom}::geography, ${e.distanceMeters})` : e.fn === "&&" ? t`${o}${n} && ${r}` : t`${t.unsafe(e.fn)}(${o}${n}, ${r})`
 			});
 		}
 	}
-}, Sr = (e, t) => {
+}, Ar = (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}`);
-}, Cr = (e, t) => t.csv(e.map((e) => {
+	return e.partitionBy && e.partitionBy.length > 0 && n.push(t`PARTITION BY ${t.join(", ", !1)(e.partitionBy.map((e) => t`${t(e)}`))}`), e.orderBy && e.orderBy.length > 0 && n.push(t`ORDER BY ${t.join(", ", !1)(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}`);
+}, jr = (e, t) => t.join(", ", !1)(e.map((e) => {
 	let n = e.column === void 0 ? t.unsafe("*") : t`${t(e.column)}`;
 	if (e.op.startsWith("window-")) {
-		let r = Sr(e.window ?? {}, t);
+		let r = Ar(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)}`;
@@ -2860,7 +2985,7 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (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 P(`compileAggregateProjection: unknown window op '${e.op}'`);
+			default: throw L(`compileAggregateProjection: unknown window op '${e.op}'`);
 		}
 	}
 	switch (e.op) {
@@ -2871,167 +2996,169 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (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 P(`compileAggregateProjection: 'column' projection requires a column name (alias '${e.alias}')`);
+			if (e.column === void 0) throw L(`compileAggregateProjection: 'column' projection requires a column name (alias '${e.alias}')`);
 			return t`${t(e.column)} AS ${t(e.alias)}`;
-		default: throw P(`compileAggregateProjection: unknown op '${e.op}'`);
+		default: throw L(`compileAggregateProjection: unknown op '${e.op}'`);
 	}
-})), wr = (e) => `[${e.join(",")}]`, Tr = (e, t) => {
+})), Mr = (e) => `[${e.join(",")}]`, Nr = (e, t) => {
 	if (e.queryVector === void 0) return null;
-	let n = t(e.column), r = wr(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 = Mr(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`
 	});
-}, Er = (e, t) => {
+}, Pr = (e, t) => {
 	let n = t.unsafe(e.useGeography ? "::geography" : "::geometry");
 	return t`ST_Distance(${t(e.column)}${n}, ${e.geom}${n})`;
-}, Dr = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Or = (e, t) => t`${t(`${e.indexName}_tsv`)}`, kr = (e, t) => `${t}_${e.indexName}_fts`, Ar = (e) => e.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((e) => e !== ""), jr = (e) => {
+}, Fr = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Ir = (e, t) => t`${t(`${e.indexName}_tsv`)}`, Lr = (e, t) => `${t}_${e.indexName}_fts`, Rr = (e) => e.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((e) => e !== ""), zr = (e) => {
 	if (e.prefix !== !0) return;
-	let t = Ar(e.query);
+	let t = Rr(e.query);
 	if (t.length !== 0) return {
 		pg: t.map((e) => `${e}:*`).join(" & "),
 		mysql: t.map((e) => `+${e}*`).join(" "),
 		sqlite: t.map((e) => `"${e}"*`).join(" ")
 	};
-}, Mr = (e, t, n) => {
-	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${Z(e.query)}%`, a = jr(e), o = () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`));
+}, Br = (e, t, n) => {
+	let r = n.join(", ", !1)(e.columns.map((e) => n`${n(e)}`)), i = `%${kr(e.query)}%`, a = zr(e), o = () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`));
 	return e.fallback === "like" ? o() : n.onDialectOrElse({
 		mysql: () => a === void 0 ? n`MATCH(${r}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)` : n`MATCH(${r}) AGAINST(${a.mysql} IN BOOLEAN MODE)`,
 		sqlite: () => {
-			let r = n(kr(e, t));
+			let r = n(Lr(e, t));
 			return n`${n("id")} IN (SELECT ${n("row_id")} FROM ${r} WHERE ${r} MATCH ${a?.sqlite ?? e.query})`;
 		},
 		mssql: o,
-		orElse: () => a === void 0 ? n`${Or(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})` : n`${Or(e, n)} @@ to_tsquery(${e.config ?? "english"}, ${a.pg})`
+		orElse: () => a === void 0 ? n`${Ir(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})` : n`${Ir(e, n)} @@ to_tsquery(${e.config ?? "english"}, ${a.pg})`
 	});
-}, Nr = (e, t, n) => {
-	let r = `%${Z(e.query)}%`, i = jr(e), a = () => 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}`);
+}, Vr = (e, t, n) => {
+	let r = `%${kr(e.query)}%`, i = zr(e), a = () => 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}`);
 	return e.fallback === "like" ? a() : n.onDialectOrElse({
-		mysql: () => i === void 0 ? n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)` : n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${i.mysql} IN BOOLEAN MODE)`,
+		mysql: () => i === void 0 ? n`MATCH(${n.join(", ", !1)(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)` : n`MATCH(${n.join(", ", !1)(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${i.mysql} IN BOOLEAN MODE)`,
 		sqlite: () => {
-			let r = n(kr(e, t));
+			let r = n(Lr(e, t));
 			return n`COALESCE((SELECT -bm25(${r}) FROM ${r} WHERE ${r} MATCH ${i?.sqlite ?? e.query} AND ${r}.${n("row_id")} = ${n("id")}), 0)`;
 		},
 		mssql: a,
-		orElse: () => i === void 0 ? n`ts_rank(${Or(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))` : n`ts_rank(${Or(e, n)}, to_tsquery(${e.config ?? "english"}, ${i.pg}))`
+		orElse: () => i === void 0 ? n`ts_rank(${Ir(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))` : n`ts_rank(${Ir(e, n)}, to_tsquery(${e.config ?? "english"}, ${i.pg}))`
 	});
-}, Pr = (e, t, n, r, i = !1) => {
-	let a = (e) => t(r && !e.includes(".") ? `${r}.${e}` : e), o = () => n?.length ? t.csv(n.map((e) => t`${a(e)}`)) : r ? t`${t(r)}.*` : t`*`, s = i && t.onDialectOrElse({
+}, Hr = (e, t, n, r, i = !1) => {
+	let a = (e) => t(r && !e.includes(".") ? `${r}.${e}` : e), o = () => n?.length ? t.join(", ", !1)(n.map((e) => t`${a(e)}`)) : r ? t`${t(r)}.*` : t`*`, s = i && t.onDialectOrElse({
 		mssql: () => !0,
 		orElse: () => !1
 	});
 	return !e || !Object.values(e).some((e) => e.type === "bigint" || s && e.type === "decimal") ? o() : t.onDialectOrElse({
-		sqlite: () => t.csv((n?.length ? n : Object.keys(e)).map((n) => e[n]?.type === "bigint" ? t`CAST(${a(n)} AS TEXT) AS ${t(n)}` : t`${a(n)}`)),
-		mssql: () => s && Object.values(e).some((e) => e.type === "decimal") ? t.csv((n?.length ? n : Object.keys(e)).map((n) => e[n]?.type === "decimal" ? t`CONVERT(varchar(80), ${a(n)}) AS ${t(n)}` : t`${a(n)}`)) : o(),
+		sqlite: () => t.join(", ", !1)((n?.length ? n : Object.keys(e)).map((n) => e[n]?.type === "bigint" ? t`CAST(${a(n)} AS TEXT) AS ${t(n)}` : t`${a(n)}`)),
+		mssql: () => s && Object.values(e).some((e) => e.type === "decimal") ? t.join(", ", !1)((n?.length ? n : Object.keys(e)).map((n) => e[n]?.type === "decimal" ? t`CONVERT(varchar(80), ${a(n)}) AS ${t(n)}` : t`${a(n)}`)) : o(),
 		orElse: o
 	});
-}, Fr = (e, t, n) => Pr(V(e)?.fields, t, n), $ = (e, t, n = null, r, i = /* @__PURE__ */ new Set(), a = !1) => {
-	let o = /* @__PURE__ */ new Set([...i, ...(e.ctes ?? []).map((e) => br(e.name))]), s = (e) => o.has(br(e)) ? e : qn(n, e), c = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${$(e.descriptor, t, n, e.recursive && t.onDialectOrElse({
+}, Ur = (e, t, n) => Hr(W(e)?.fields, t, n), Wr = (e, t, n = null, r, i = /* @__PURE__ */ new Set(), a = !1) => {
+	let o = yn(e), s = /* @__PURE__ */ new Set([...i, ...(e.ctes ?? []).map((e) => Dr(e.name))]), c = (e) => s.has(Dr(e)) ? e : er(n, e), l = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${Wr(e.descriptor, t, n, e.recursive && t.onDialectOrElse({
 		sqlite: () => !0,
 		orElse: () => !1
-	}) ? e.name : void 0, o)})`), l = (e.ctes ?? []).some((e) => e.recursive === !0), u = c.length > 0 ? t`WITH ${t.unsafe(l ? "RECURSIVE " : "")}${t.csv(c)} ` : t``;
+	}) ? e.name : void 0, s)})`), u = (e.ctes ?? []).some((e) => e.recursive === !0), d = l.length > 0 ? t`WITH ${t.unsafe(u ? "RECURSIVE " : "")}${t.join(", ", !1)(l)} ` : t``;
 	if (e.setOp && e.setOp.queries.length >= 2) {
 		let i = e.setOp.kind === "union" ? "UNION" : e.setOp.kind === "union-all" ? "UNION ALL" : e.setOp.kind === "intersect" ? "INTERSECT" : "EXCEPT", a = t.onDialectOrElse({
 			sqlite: () => !0,
 			orElse: () => !1
-		}), s = e.setOp.queries.map((e) => {
-			if (!a) return t`(${$(e, t, n, void 0, o)})`;
+		}), o = e.setOp.queries.map((e) => {
+			if (!a) return t`(${Wr(e, t, n, void 0, s)})`;
 			if (r !== void 0) {
-				if (!(Nt(e).length > 0 || e.take !== void 0 || e.skip !== void 0 || e.setOp !== void 0 || (e.ctes?.length ?? 0) > 0)) return $(e, t, n, void 0, o);
+				if (!(It(e).length > 0 || e.take !== void 0 || e.skip !== void 0 || e.setOp !== void 0 || (e.ctes?.length ?? 0) > 0)) return Wr(e, t, n, void 0, s);
 				let i = (e) => e.replace(/[A-Z]/g, (e) => e.toLowerCase()), a = (e) => i(e) === i(r);
-				if (a(e.table) || e.joins?.some((e) => a(e.table))) throw P("Recursive SQLite terms cannot use branch-local ordering, pagination or nested compounds; apply ordering and pagination to the recursive compound or its outer query");
+				if (a(e.table) || e.joins?.some((e) => a(e.table))) throw L("Recursive SQLite terms cannot use branch-local ordering, pagination or nested compounds; apply ordering and pagination to the recursive compound or its outer query");
 			}
-			return t`SELECT * FROM (${$(e, t, n, void 0, o)})`;
+			return t`SELECT * FROM (${Wr(e, t, n, void 0, s)})`;
 		}).reduce((e, n, r) => r === 0 ? n : t`${e} ${t.unsafe(i)} ${n}`), c = [];
-		if (Nt(e).length > 0 && c.push(t` ORDER BY ${t.csv(Nt(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 P(`compileSelect: invalid take ${e.take}`);
+		if (It(e).length > 0 && c.push(t` ORDER BY ${t.join(", ", !1)(It(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 L(`compileSelect: invalid take ${e.take}`);
 			c.push(t` LIMIT ${t.unsafe(String(e.take))}`);
 		}
 		if (e.skip !== void 0) {
-			if (a && e.take === void 0 && c.push(t` LIMIT -1`), !Number.isInteger(e.skip) || e.skip < 0) throw P(`compileSelect: invalid skip ${e.skip}`);
+			if (a && e.take === void 0 && c.push(t` LIMIT -1`), !Number.isInteger(e.skip) || e.skip < 0) throw L(`compileSelect: invalid skip ${e.skip}`);
 			c.push(t` OFFSET ${t.unsafe(String(e.skip))}`);
 		}
-		return t`${u}${s}${c.reduce((e, n) => t`${e}${n}`, t``)}`;
+		return t`${d}${o}${c.reduce((e, n) => t`${e}${n}`, t``)}`;
 	}
-	let d = e.annClause === void 0 ? null : Tr(e.annClause, t);
+	let f = e.annClause === void 0 ? null : Nr(e.annClause, t);
 	e.spatialClause !== void 0 && t.onDialectOrElse({
 		mysql: () => {
-			throw P("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+			throw L("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
 		},
 		mssql: () => {
-			throw P("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+			throw L("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
 		},
 		sqlite: () => {
-			throw P("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+			throw L("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
 		},
 		orElse: () => t``
 	});
-	let f = e.spatialClause?.projectAs === void 0 ? null : Er(e.spatialClause, t), p = e.aggregations && e.aggregations.length > 0 ? Cr(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((n) => {
-		let r = t`${t(n.source)}`, i = K(n.source, e);
-		return t`${a && i?.type === "decimal" ? t.onDialectOrElse({
-			mssql: () => t`CONVERT(varchar(80), ${r})`,
-			orElse: () => r
-		}) : i?.type === "bigint" ? t.onDialectOrElse({
-			sqlite: () => t`CAST(${r} AS TEXT)`,
-			orElse: () => r
-		}) : r} AS ${t(n.outputKey)}`;
-	})) : Pr((e.sourceTable?.tableName === e.table ? e.sourceTable : V(e.table))?.fields, t, e.projection, (e.joins?.length ?? 0) > 0 ? e.alias ?? e.table : void 0, a), m = (e.aggregations && e.aggregations.length > 0) === !0, h = d !== null && !m ? t`${p}, ${d} AS ${t("distance")}` : p, g = e.fullTextSearch, _ = g?.rank !== void 0 && !m ? Nr(g, e.table, t) : null, v = _ !== null && g?.rank !== void 0 ? t`${h}, ${_} AS ${t(g.rank.alias)}` : h, y = f !== null && !m && e.spatialClause?.projectAs !== void 0 ? t`${v}, ${f} AS ${t(e.spatialClause.projectAs)}` : v, b = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
-		orElse: () => t`DISTINCT ON (${t.csv(e.distinctOn.map((e) => t`${t(e)}`))}) `,
+	let p = e.spatialClause?.projectAs === void 0 ? null : Pr(e.spatialClause, t), m = e.aggregations && e.aggregations.length > 0 ? jr(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.join(", ", !1)(e.joinedProjection.map((e) => {
+		let n = t`${t(e.source)}`, r = o(e.source);
+		return t`${a && r?.type === "decimal" ? t.onDialectOrElse({
+			mssql: () => t`CONVERT(varchar(80), ${n})`,
+			orElse: () => n
+		}) : r?.type === "bigint" ? t.onDialectOrElse({
+			sqlite: () => t`CAST(${n} AS TEXT)`,
+			orElse: () => n
+		}) : n} AS ${t(e.outputKey)}`;
+	})) : Hr((e.sourceTable?.tableName === e.table ? e.sourceTable : W(e.table))?.fields, t, e.projection, (e.joins?.length ?? 0) > 0 ? e.alias ?? e.table : void 0, a), h = (e.aggregations && e.aggregations.length > 0) === !0, g = f !== null && !h ? t`${m}, ${f} AS ${t("distance")}` : m, _ = e.fullTextSearch, v = _?.rank !== void 0 && !h ? Vr(_, e.table, t) : null, y = v !== null && _?.rank !== void 0 ? t`${g}, ${v} AS ${t(_.rank.alias)}` : g, b = p !== null && !h && e.spatialClause?.projectAs !== void 0 ? t`${y}, ${p} AS ${t(e.spatialClause.projectAs)}` : y, x = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
+		orElse: () => t`DISTINCT ON (${t.join(", ", !1)(e.distinctOn.map((e) => t`${t(e)}`))}) `,
 		mysql: () => t`DISTINCT `,
 		mssql: () => t`DISTINCT `,
 		sqlite: () => t`DISTINCT `
-	}) : e.distinct ? t`DISTINCT ` : t``, x = e.lock === "update", S = x ? t.onDialectOrElse({
+	}) : e.distinct ? t`DISTINCT ` : t``, S = e.lock === "update", C = S ? t.onDialectOrElse({
 		mssql: () => t` WITH (UPDLOCK, ROWLOCK)`,
 		orElse: () => t``
-	}) : t``, C = x ? t.onDialectOrElse({
+	}) : t``, w = S ? t.onDialectOrElse({
 		mssql: () => t``,
 		sqlite: () => t``,
 		orElse: () => t` FOR UPDATE`
-	}) : t``, w = e.alias === void 0 ? t`${t(s(e.table))}${S}` : t`${t(s(e.table))} AS ${t(e.alias)}${S}`, T = (e.joins ?? []).map((e) => {
+	}) : t``, T = e.alias === void 0 ? t`${t(c(e.table))}${C}` : t`${t(c(e.table))} AS ${t(e.alias)}${C}`, E = (e.joins ?? []).map((e) => {
 		let r = e.kind === "inner" ? "INNER" : "LEFT";
-		return t` ${t.unsafe(r)} JOIN ${t(s(e.table))} AS ${t(e.alias)} ON ${Q(e.on, t, n, void 0, o)}`;
-	}), E = T.length > 0 ? T.reduce((e, n) => t`${e}${n}`, w) : w, D = g === void 0 ? null : Mr(g, e.table, t), ee = [e.predicate ? Q(e.predicate, t, n, e.table, o) : null, D].filter((e) => e !== null), O = ee.length > 0 ? t` WHERE ${t.and(ee)}` : t``, te = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, k = e.having ? t` HAVING ${Q(e.having, t, n, e.table, o)}` : t``, A = e.skip !== void 0, j = [];
-	d !== null && j.push(t`${d} ASC`), e.spatialClause?.order !== void 0 && j.push(e.spatialClause.order === "desc" ? t`${Dr(e.spatialClause, t)} DESC` : t`${Dr(e.spatialClause, t)} ASC`), _ !== null && g?.rank?.order === !0 && j.push(t`${_} DESC`);
-	for (let n of Nt(e)) {
-		let r = e.joinedProjection?.find((e) => e.outputKey === n.column)?.source ?? n.column, i = a && !m && K(r, e)?.type === "decimal" ? t.onDialectOrElse({
+		return t` ${t.unsafe(r)} JOIN ${t(c(e.table))} AS ${t(e.alias)} ON ${$(e.on, t, n, void 0, s)}`;
+	}), D = E.length > 0 ? E.reduce((e, n) => t`${e}${n}`, T) : T, O = _ === void 0 ? null : Br(_, e.table, t), k = [e.predicate ? $(e.predicate, t, n, e.table, s) : null, O].filter((e) => e !== null), ee = k.length > 0 ? t` WHERE ${t.and(k)}` : t``, A = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.join(", ", !1)(e.groupBy.map((e) => t`${t(e)}`))}` : t``, j = e.having ? t` HAVING ${$(e.having, t, n, e.table, s)}` : t``, M = e.skip !== void 0, N = [];
+	f !== null && N.push(t`${f} ASC`), e.spatialClause?.order !== void 0 && N.push(e.spatialClause.order === "desc" ? t`${Fr(e.spatialClause, t)} DESC` : t`${Fr(e.spatialClause, t)} ASC`), v !== null && _?.rank?.order === !0 && N.push(t`${v} DESC`);
+	let P = It(e), F = P.length >= 8 && (e.joinedProjection?.length ?? 0) >= 8 ? /* @__PURE__ */ new Map() : void 0;
+	if (F) for (let t of e.joinedProjection ?? []) F.has(t.outputKey) || F.set(t.outputKey, t.source);
+	for (let n of P) {
+		let r = (F === void 0 ? e.joinedProjection?.find((e) => e.outputKey === n.column)?.source : F.get(n.column)) ?? n.column, i = a && !h && o(r)?.type === "decimal" ? t.onDialectOrElse({
 			mssql: () => t`${t(r.includes(".") ? r : `${e.alias ?? e.table}.${r}`)}`,
 			orElse: () => t`${t(n.column)}`
-		}) : !m && K(r, e)?.type === "bigint" ? t.onDialectOrElse({
+		}) : !h && o(r)?.type === "bigint" ? t.onDialectOrElse({
 			sqlite: () => t`${t(r.includes(".") ? r : `${e.alias ?? e.table}.${r}`)}`,
 			orElse: () => t`${t(n.column)}`
 		}) : t`${t(n.column)}`;
-		j.push(n.direction === "desc" ? t`${i} DESC` : t`${i} ASC`);
+		N.push(n.direction === "desc" ? t`${i} DESC` : t`${i} ASC`);
 	}
-	let ne = j.length > 0 ? t` ORDER BY ${t.csv(j)}` : A ? t.onDialectOrElse({
+	let te = N.length > 0 ? t` ORDER BY ${t.join(", ", !1)(N)}` : M ? t.onDialectOrElse({
 		mssql: () => t` ORDER BY (SELECT NULL)`,
 		orElse: () => t``
-	}) : t``, M = (e) => {
-		if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw P(`compileSelect: expected non-negative integer take/skip, got ${e}`);
+	}) : t``, I = (e) => {
+		if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw L(`compileSelect: expected non-negative integer take/skip, got ${e}`);
 		return t.unsafe(String(e));
 	};
 	return t.onDialectOrElse({
 		mssql: () => {
-			let n = e.take !== void 0 && !A ? t`TOP ${M(e.take)} ` : t``, r = A ? t` OFFSET ${M(e.skip)} ROWS FETCH NEXT ${M(e.take ?? 2 ** 53 - 1)} ROWS ONLY` : t``;
-			return t`${u}SELECT ${n}${b}${y} FROM ${E}${O}${te}${k}${ne}${r}`;
+			let n = e.take !== void 0 && !M ? t`TOP ${I(e.take)} ` : t``, r = M ? t` OFFSET ${I(e.skip)} ROWS FETCH NEXT ${I(e.take ?? 2 ** 53 - 1)} ROWS ONLY` : t``;
+			return t`${d}SELECT ${n}${x}${b} FROM ${D}${ee}${A}${j}${te}${r}`;
 		},
 		orElse: () => {
-			let n = e.take === void 0 ? A ? t.onDialectOrElse({
+			let n = e.take === void 0 ? M ? t.onDialectOrElse({
 				sqlite: () => t` LIMIT -1`,
 				mysql: () => t` LIMIT 18446744073709551615`,
 				orElse: () => t``
-			}) : t`` : t` LIMIT ${M(e.take)}`, r = A ? t` OFFSET ${M(e.skip)}` : t``;
-			return t`${u}SELECT ${b}${y} FROM ${E}${O}${te}${k}${ne}${n}${r}${C}`;
+			}) : t`` : t` LIMIT ${I(e.take)}`, r = M ? t` OFFSET ${I(e.skip)}` : t``;
+			return t`${d}SELECT ${x}${b} FROM ${D}${ee}${A}${j}${te}${n}${r}${w}`;
 		}
 	});
-}, Ir = (e, t, n = null) => t.onDialectOrElse({
+}, Gr = (e, t, n = null) => t.onDialectOrElse({
 	sqlite: () => !0,
 	orElse: () => !1
-}) && _n(e) ? t`${yr(e, t, { materialized: !1 }, n)}` : $(t.onDialectOrElse({
-	mssql: () => Qn(e) ?? e,
+}) && Sn(e) ? t`${Er(e, t, { materialized: !1 }, n)}` : Wr(t.onDialectOrElse({
+	mssql: () => ar(e) ?? e,
 	orElse: () => e
-}), t, n, void 0, /* @__PURE__ */ new Set(), !0), Lr = (e, t, n = null, r) => {
+}), t, n, void 0, /* @__PURE__ */ new Set(), !0), Kr = (e, t, n = null, r) => {
 	if (r !== void 0 && t.onDialectOrElse({
 		sqlite: () => !0,
 		orElse: () => !1
@@ -3044,80 +3171,80 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			take: void 0,
 			skip: void 0
 		};
-		if (_n(i)) return dr(i, t, {
-			compile: (e) => Ir(e, t, n),
+		if (Sn(i)) return vr(i, t, {
+			compile: (e) => Gr(e, t, n),
 			resultScale: void 0
 		}, e);
 	}
-	return Q(e, t, n, r);
-}, Rr = (e, t, n = null, r) => Q(e, t, n, r), zr = (e, t) => ({
+	return $(e, t, n, r);
+}, qr = (e, t, n = null, r) => $(e, t, n, r), Jr = (e, t) => ({
 	column: e,
 	op: "eq",
 	value: t
-}), Br = (e, t) => ({
+}), Yr = (e, t) => ({
 	column: e,
 	op: "neq",
 	value: t
-}), Vr = (e, t) => ({
+}), Xr = (e, t) => ({
 	column: e,
 	op: "gt",
 	value: t
-}), Hr = (e, t) => ({
+}), Zr = (e, t) => ({
 	column: e,
 	op: "gte",
 	value: t
-}), Ur = (e, t) => ({
+}), Qr = (e, t) => ({
 	column: e,
 	op: "lt",
 	value: t
-}), Wr = (e, t) => ({
+}), $r = (e, t) => ({
 	column: e,
 	op: "lte",
 	value: t
-}), Gr = (e, t) => ({
+}), ei = (e, t) => ({
 	column: e,
 	op: "in",
 	value: t
-}), Kr = (e, t) => ({
+}), ti = (e, t) => ({
 	column: e,
 	op: "notIn",
 	value: t
-}), qr = (e, t) => ({
+}), ni = (e, t) => ({
 	column: e,
 	op: "contains",
 	value: t
-}), Jr = (e, t) => ({
+}), ri = (e, t) => ({
 	column: e,
 	op: "startsWith",
 	value: t
-}), Yr = (e, t) => ({
+}), ii = (e, t) => ({
 	column: e,
 	op: "arrayContains",
 	value: t
-}), Xr = (e, t) => ({
+}), ai = (e, t) => ({
 	column: e,
 	op: "arrayOverlaps",
 	value: t
-}), Zr = (e, t) => ({
+}), oi = (e, t) => ({
 	column: e,
 	op: "arrayHas",
 	value: t
-}), Qr = {
+}), si = {
 	column: "id",
 	op: "in",
 	value: []
-}, $r = (e) => ({
+}, ci = (e) => ({
 	column: e,
 	op: "isNull"
-}), ei = (e) => ({
+}), li = (e) => ({
 	column: e,
 	op: "isNotNull"
-}), ti = (e, t) => ({
+}), ui = (e, t) => ({
 	column: e,
 	op: "spatial",
 	value: t
-}), ni = (...e) => ({ and: e }), ri = (...e) => ({ or: e }), ii = (e) => ({ not: e }), ai = (e, ...t) => {
-	if (t.length === 0) throw P(`jsonField("${e}"): at least one path segment is required`);
+}), di = (...e) => ({ and: e }), fi = (...e) => ({ or: e }), pi = (e) => ({ not: e }), mi = (e, ...t) => {
+	if (t.length === 0) throw L(`jsonField("${e}"): at least one path segment is required`);
 	let n = (n, r) => ({
 		column: e,
 		path: t,
@@ -3138,74 +3265,113 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		isNull: () => n("isNull"),
 		isNotNull: () => n("isNotNull")
 	};
-}, oi = (e) => "descriptor" in e ? e.descriptor : e, si = (e, t) => ({
+}, hi = (e) => "descriptor" in e ? e.descriptor : e, gi = (e, t) => ({
 	column: e,
 	op: "subquery-in",
-	subquery: oi(t)
-}), ci = (e, t) => ({
+	subquery: hi(t)
+}), _i = (e, t) => ({
 	column: e,
 	op: "subquery-not-in",
-	subquery: oi(t)
-}), li = (e) => ({
+	subquery: hi(t)
+}), vi = (e) => ({
 	op: "exists",
-	subquery: oi(e)
-}), ui = (e) => ({
+	subquery: hi(e)
+}), yi = (e) => ({
 	op: "not-exists",
-	subquery: oi(e)
-}), di = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, fi = (e) => {
+	subquery: hi(e)
+}), bi = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, xi = (e) => {
 	if (e instanceof Date) return e.getTime();
-	if (typeof e == "string" && di.test(e)) {
+	if (typeof e == "string" && bi.test(e)) {
 		let t = Date.parse(e);
 		return Number.isNaN(t) ? void 0 : t;
 	}
-}, pi = (e, t) => {
+}, Si = (e, t) => {
 	if (!(e instanceof Date) && !(t instanceof Date)) return;
-	let n = fi(e), r = fi(t);
+	let n = xi(e), r = xi(t);
 	return n === void 0 || r === void 0 ? void 0 : [n, r];
-}, mi = (e, t) => {
+}, Ci = (e, t) => {
 	if (e === t) return !0;
 	if (e instanceof Uint8Array && t instanceof Uint8Array) {
 		if (e.length !== t.length) return !1;
 		for (let n = 0; n < e.length; n += 1) if (e[n] !== t[n]) return !1;
 		return !0;
 	}
-	let n = pi(e, t);
+	let n = Si(e, t);
 	return n !== void 0 && n[0] === n[1];
-}, hi = (e, t) => {
+}, wi = (e, t) => {
 	if (e == null || t == null) return null;
-	let n = pi(e, t);
+	let n = Si(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;
-}, gi = (e, t, n = null, r = {}) => _i(e, t, n, r) === !0, _i = (e, t, n = null, r = {}) => {
+}, Ti = (e, t, n = null, r = {}) => Oi(e, t, n, r) === !0, Ei = (e, t = null, n = {}) => {
+	let r = /* @__PURE__ */ new Map(), i = (e) => {
+		if ("not" in e) {
+			i(e.not);
+			return;
+		}
+		if ("and" in e) {
+			e.and.forEach(i);
+			return;
+		}
+		if ("or" in e) {
+			e.or.forEach(i);
+			return;
+		}
+		if (e.op !== "in" && e.op !== "notIn" || n[e.column]?.type === "decimal") return;
+		let t = Object.getOwnPropertyDescriptor(e, "value");
+		if (t === void 0 || !("value" in t)) return;
+		let a = t.value;
+		if (!Array.isArray(a) || a.length < 16 || Object.getPrototypeOf(a) !== Array.prototype) return;
+		let o = Object.getOwnPropertyDescriptor(a, "some");
+		if (o !== void 0 && (!("value" in o) || o.value !== Array.prototype.some)) return;
+		for (let e = 0; e < a.length; e++) {
+			let t = Object.getOwnPropertyDescriptor(a, e);
+			if (t !== void 0 && !("value" in t)) return;
+		}
+		if (a.some((e) => typeof e == "object" && !!e)) return;
+		let s = Array.prototype.filter.call(a, (e) => !(typeof e == "number" && Number.isNaN(e)));
+		r.set(e, new Set(s));
+	};
+	return i(e), (i) => Oi(e, i, t, n, r) === !0;
+}, Di = (e, t, n) => {
+	if (e.length < 128 || t.length < 16 || Object.getPrototypeOf(e) !== Array.prototype || Object.getPrototypeOf(t) !== Array.prototype || Object.getOwnPropertyDescriptor(e, "includes") !== void 0 || Object.getOwnPropertyDescriptor(t, n) !== void 0) return;
+	for (let n of [e, t]) for (let e = 0; e < n.length; e += 1) {
+		let t = Object.getOwnPropertyDescriptor(n, String(e));
+		if (t === void 0 || !("value" in t)) return;
+	}
+	let r = /* @__PURE__ */ new Set();
+	for (let t = 0; t < e.length; t += 1) r.add(e[t]);
+	return r;
+}, Oi = (e, t, n = null, r = {}, i) => {
 	if (!t) return !1;
 	if ("not" in e) {
-		let i = _i(e.not, t, n, r);
-		return i === null ? null : !i;
+		let a = Oi(e.not, t, n, r, i);
+		return a === null ? null : !a;
 	}
 	if ("and" in e) {
-		let i = !1;
-		for (let a of e.and) {
-			let e = _i(a, t, n, r);
+		let a = !1;
+		for (let o of e.and) {
+			let e = Oi(o, t, n, r, i);
 			if (e === !1) return !1;
-			e === null && (i = !0);
+			e === null && (a = !0);
 		}
-		return !i || null;
+		return !a || null;
 	}
 	if ("or" in e) {
-		let i = !1;
-		for (let a of e.or) {
-			let e = _i(a, t, n, r);
+		let a = !1;
+		for (let o of e.or) {
+			let e = Oi(o, t, n, r, i);
 			if (e === !0) return !0;
-			e === null && (i = !0);
+			e === null && (a = !0);
 		}
-		return i ? null : !1;
+		return a ? null : !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) => Nn(a, e) === 0) : i.has(a);
+		let a = t[e.column], o = r[e.column]?.type === "decimal" ? [...i].some((e) => zn(a, e) === 0) : i.has(a);
 		return e.op === "subquery-in" ? o : !o;
 	}
 	if (e.op === "exists" || e.op === "not-exists") {
@@ -3213,46 +3379,55 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (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 = Y(i.value) ? i.value : void 0;
-	if (o !== void 0 && (!In.some((e) => e === i.op) || i.path !== void 0)) throw P("Column references require a scalar comparison without a JSON path");
-	let s = o === void 0 ? i.value : t[o.column];
-	if (o !== void 0 && (a == null || s == null)) return null;
-	let c = r[i.column]?.type === "decimal", l = (e, t) => c && e != null && t != null ? Nn(e, t) === 0 : mi(e, t), u = c ? Nn : hi;
-	switch (i.op) {
-		case "eq": return l(a, s);
-		case "neq": return !l(a, s);
-		case "gt": return (u(a, s) ?? -1) > 0;
-		case "gte": return (u(a, s) ?? -1) >= 0;
-		case "lt": return (u(a, s) ?? 1) < 0;
-		case "lte": return (u(a, s) ?? 1) <= 0;
-		case "in": return Array.isArray(s) && s.some((e) => l(a, e));
-		case "notIn": return Array.isArray(s) && !s.some((e) => l(a, e));
-		case "contains": return typeof a == "string" && typeof s == "string" && a.toLowerCase().includes(s.toLowerCase());
-		case "startsWith": return typeof a == "string" && typeof s == "string" && a.startsWith(s);
+	let a = e, o = t[a.column], s = Hn(a.value) ? a.value : void 0;
+	if (s !== void 0 && (!Un.some((e) => e === a.op) || a.path !== void 0)) throw L("Column references require a scalar comparison without a JSON path");
+	let c = s === void 0 ? a.value : t[s.column];
+	if (s !== void 0 && (o == null || c == null)) return null;
+	let l = r[a.column]?.type === "decimal", u = i?.get(e);
+	if (u !== void 0 && !(o instanceof Date) && !(o instanceof Uint8Array)) {
+		let e = typeof o == "number" && Number.isNaN(o) ? !1 : u.has(o);
+		return a.op === "in" ? e : !e;
+	}
+	let d = (e, t) => l && e != null && t != null ? zn(e, t) === 0 : Ci(e, t), f = l ? zn : wi;
+	switch (a.op) {
+		case "eq": return d(o, c);
+		case "neq": return !d(o, c);
+		case "gt": return (f(o, c) ?? -1) > 0;
+		case "gte": return (f(o, c) ?? -1) >= 0;
+		case "lt": return (f(o, c) ?? 1) < 0;
+		case "lte": return (f(o, c) ?? 1) <= 0;
+		case "in": return Array.isArray(c) && c.some((e) => d(o, e));
+		case "notIn": return Array.isArray(c) && !c.some((e) => d(o, e));
+		case "contains": return typeof o == "string" && typeof c == "string" && o.toLowerCase().includes(c.toLowerCase());
+		case "startsWith": return typeof o == "string" && typeof c == "string" && o.startsWith(c);
 		case "arrayContains": {
-			let e = Array.isArray(a) ? a : [];
-			return (Array.isArray(s) ? s : []).every((t) => e.includes(t));
+			let e = Array.isArray(o) ? o : [], t = Array.isArray(c) ? c : [];
+			if (e.length < 128 || t.length < 16) return t.every((t) => e.includes(t));
+			let n, r = 0;
+			return t.every((i) => (++r === 5 && (n = Di(e, t, "every")), n === void 0 ? e.includes(i) : n.has(i)));
 		}
 		case "arrayOverlaps": {
-			let e = Array.isArray(a) ? a : [];
-			return (Array.isArray(s) ? s : []).some((t) => e.includes(t));
+			let e = Array.isArray(o) ? o : [], t = Array.isArray(c) ? c : [];
+			if (e.length < 128 || t.length < 16) return t.some((t) => e.includes(t));
+			let n, r = 0;
+			return t.some((i) => (++r === 5 && (n = Di(e, t, "some")), n === void 0 ? e.includes(i) : n.has(i)));
 		}
-		case "arrayHas": return Array.isArray(a) && a.includes(s);
-		case "isNull": return a == null;
-		case "isNotNull": return a != null;
-		case "spatial": throw P("@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 "arrayHas": return Array.isArray(o) && o.includes(c);
+		case "isNull": return o == null;
+		case "isNotNull": return o != null;
+		case "spatial": throw L("@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.");
 	}
-}, vi = function* (e) {
+}, ki = function* (e) {
 	if ("not" in e) {
-		yield* vi(e.not);
+		yield* ki(e.not);
 		return;
 	}
 	if ("and" in e) {
-		for (let t of e.and) yield* vi(t);
+		for (let t of e.and) yield* ki(t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* vi(t);
+		for (let t of e.or) yield* ki(t);
 		return;
 	}
 	e.op === "subquery-in" || e.op === "subquery-not-in" ? yield {
@@ -3262,30 +3437,30 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		kind: "exists",
 		descriptor: e.subquery
 	});
-}, yi = function* (e, t = !0) {
+}, Ai = function* (e, t = !0) {
 	if ("not" in e) {
-		yield* yi(e.not, !1);
+		yield* Ai(e.not, !1);
 		return;
 	}
 	if ("and" in e) {
-		for (let n of e.and) yield* yi(n, t);
+		for (let n of e.and) yield* Ai(n, t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* yi(t, !1);
+		for (let t of e.or) yield* Ai(t, !1);
 		return;
 	}
 	e.op !== "subquery-in" && e.op !== "subquery-not-in" && e.op !== "exists" && e.op !== "not-exists" && (yield {
 		...e,
-		conjunctive: t && !Y(e.value)
+		conjunctive: t && !Hn(e.value)
 	});
-}, bi = (e, t) => ({
+}, ji = (e, t) => ({
 	name: e,
 	body: t
-}), xi = (e) => {
+}), Mi = (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: bi });
+	let t = e.steps({ step: ji });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -3298,76 +3473,76 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, Si = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Ci = null, wi = null, Ti = (e) => {
-	Ci = e;
-}, Ei = (e) => {
-	wi = e;
-}, Di = async (e) => {
-	let t = Ci;
+}, Ni = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Pi = null, Fi = null, Ii = (e) => {
+	Pi = e;
+}, Li = (e) => {
+	Fi = e;
+}, Ri = async (e) => {
+	let t = Pi;
 	t !== null && await t(e);
-}, Oi = async (e) => {
-	let t = wi;
+}, zi = async (e) => {
+	let t = Fi;
 	t !== null && e.changedTables.length !== 0 && await t(e);
-}, ki = ["before-schema", "after-schema"], Ai = (e) => {
+}, Bi = ["before-schema", "after-schema"], Vi = (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 (!ki.includes(e.phase)) throw Error(`migration ${e.id}: \`phase\` is required and must be one of ${ki.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)`);
+	if (!Bi.includes(e.phase)) throw Error(`migration ${e.id}: \`phase\` is required and must be one of ${Bi.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;
-}, ji = Symbol.for("voltro.migration.irreversible"), Mi = class extends Error {
+}, Hi = Symbol.for("voltro.migration.irreversible"), Ui = 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";
 	}
-}, Ni = (e) => {
+}, Wi = (e) => {
 	if (!e || e.trim().length === 0) throw Error("irreversible(): a reason is required");
-	return Object.assign(() => t.fail(new Mi("<unknown>", e)), { [ji]: e });
-}, Pi = (e) => {
-	let t = e[ji];
+	return Object.assign(() => t.fail(new Ui("<unknown>", e)), { [Hi]: e });
+}, Gi = (e) => {
+	let t = e[Hi];
 	return typeof t == "string" ? t : void 0;
-}, Fi = class {
+}, Ki = class {
 	reason;
 	_tag = "MigrationSkipped";
 	constructor(e) {
 		this.reason = e;
 	}
-}, Ii = class extends Error {
+}, qi = 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";
 	}
-}, Li = class extends Error {
+}, Ji = 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";
 	}
-}, Ri = class extends Error {
+}, Yi = 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";
 	}
-}, zi = class extends Error {
+}, Xi = 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";
 	}
-}, Bi = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Vi = (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", Hi = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Ui = (e) => Hi.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Wi = "_voltro_staging_", Gi = (e) => e.startsWith(Wi), Ki = /__dropped_\d{14}$/, qi = (e) => Ki.test(e), Ji = 7, Yi = (e) => {
+}, Zi = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Qi = (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", $i = /* @__PURE__ */ new Set(["voltro_isr_cache"]), ea = (e) => $i.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), ta = "_voltro_staging_", na = (e) => e.startsWith(ta), ra = /__dropped_\d{14}$/, ia = (e) => ra.test(e), aa = 7, oa = (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)));
-}, Xi = (e, t = {}) => {
+}, sa = (e, t = {}) => {
 	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
-		let a = Yi(e);
+		let a = oa(e);
 		if (a === void 0) return;
 		let o = Math.floor((n.getTime() - a.getTime()) / 864e5);
 		o >= r && i.push({
@@ -3376,149 +3551,152 @@ var tn = (e, t, n) => nn(e, "id", t, n), nn = (e, t, n, r, i = "asc") => {
 			ageDays: o
 		});
 	};
-	for (let t of e.tables) if (a(t.name, t.name), !qi(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), !ia(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
 	return i;
-}, Zi = (e, t) => {
+}, ca = (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.`;
-}, Qi = (e, t) => e.filter((e) => !Ui(e.name) || t.has(e.name)), $i = z("_voltro_migrations", {
-	id: f({ prefix: "mig" }),
-	name: p(),
-	hash: p(),
-	status: p(),
-	appliedAt: x().nullable(),
-	durationMs: m().nullable(),
-	errorMessage: p().nullable(),
-	errorStack: p().nullable(),
-	workflowRunId: p().nullable(),
-	createdAt: x().default("now"),
-	updatedAt: x().default("now").onUpdate("now")
-}).index(["status"]), ea = z("_voltro_seeds", {
-	id: f({ prefix: "seed" }),
-	name: p(),
-	lifecycle: p(),
-	fingerprint: p(),
-	cronSchedule: p().nullable(),
-	watchedTables: C().nullable(),
-	nextRunAt: x().nullable(),
-	lastRunStatus: p().nullable(),
-	lastRunAt: x().nullable(),
-	lastRunDurationMs: m().nullable(),
-	lastRunRowsTouched: m().nullable(),
-	lastError: p().nullable(),
-	workflowRunId: p().nullable(),
-	createdAt: x().default("now"),
-	updatedAt: x().default("now").onUpdate("now")
-}).index(["lifecycle"]).index(["nextRunAt"]), ta = z("_voltro_schema_owner", {
-	id: f({ prefix: "own" }),
-	appName: p(),
-	projectName: p().nullable(),
-	frameworkVersion: p().nullable(),
-	claimedAt: x().default("now")
-}), na = z("_voltro_plugin_migrations", {
-	id: f({ prefix: "plm" }),
-	plugin_name: p(),
-	migration_id: p(),
-	description: p().nullable(),
-	applied_at: p()
-}), ra = z("_voltro_migration_plans", {
-	id: f({ prefix: "plan" }),
-	fingerprint: p(),
-	liveFingerprint: p().nullable(),
-	operations: C(),
-	rollbackPlan: C().nullable(),
-	appliedBy: p(),
-	environment: p(),
-	source: p(),
-	onlineStrategy: p().nullable(),
-	durationMs: m(),
-	notes: p().nullable(),
-	squashedAt: x().nullable(),
-	appliedAt: x().default("now"),
-	createdAt: x().default("now"),
-	updatedAt: x().default("now").onUpdate("now")
-}).index(["fingerprint"]).index(["environment"]), ia = z("_voltro_idempotency", {
-	id: f({ prefix: "idem" }),
-	scope: p(),
-	key: p(),
-	status: p(),
-	response: C().nullable(),
-	createdAt: x().default("now")
-}).unique(["scope", "key"]).index(["createdAt"]), aa = z("_voltro_devices", {
-	id: f({ prefix: "device" }),
-	tenantId: p(),
-	name: p(),
-	scopes: C().nullable(),
-	pairingHash: p().maxLength(64).nullable(),
-	pairingExpiresAt: x().nullable(),
-	accessHash: p().maxLength(64).nullable(),
-	accessExpiresAt: x().nullable(),
-	refreshHash: p().maxLength(64).nullable(),
-	refreshExpiresAt: x().nullable(),
-	previousRefreshHash: p().maxLength(64).nullable(),
-	generation: m().default(0),
-	pairedAt: x().nullable(),
-	lastSeenAt: x().nullable(),
-	revokedAt: x().nullable(),
-	revokedReason: p().nullable(),
-	createdBy: p().nullable(),
-	metadata: C().nullable(),
-	createdAt: x()
-}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), oa = z("_voltro_tenant_selections", {
-	id: f({ prefix: "tsel" }),
-	subjectType: p().maxLength(32),
-	subjectId: p(),
-	tenantId: p(),
-	selectedAt: x()
-}).primaryKey(["id"]).nonReactive(), sa = z("_voltro_kv", {
-	id: f({ prefix: "kv" }),
-	key: p().unique(),
-	value: p().nullable(),
-	expiresAt: x().nullable(),
-	createdAt: x().default("now"),
-	updatedAt: x().default("now").onUpdate("now")
-}).index(["expiresAt"]), ca = z("_voltro_api_keys", {
-	id: f({ prefix: "apikey" }),
-	tenantId: p().nullable(),
-	name: p(),
-	hashedKey: p().maxLength(64).unique(),
-	keyPrefix: p(),
-	scopes: C().nullable(),
-	lastUsedAt: x().nullable(),
-	requestCount: m().default(0),
-	expiresAt: x().nullable(),
-	revokedAt: x().nullable(),
-	createdBy: p().nullable(),
-	onBehalfOf: p().nullable(),
-	metadata: C().nullable(),
-	createdAt: x().default("now")
-}).index("byApiKeyTenant", ["tenantId"]), la = z("_voltro_replica_observations", {
-	id: f({ prefix: "robs" }),
-	replicaId: p().maxLength(191),
-	startedAt: x(),
-	version: p().maxLength(64).nullable(),
-	kind: p().maxLength(64),
-	payload: p().nullable(),
-	reachableAt: p().maxLength(255).nullable(),
-	writtenAt: x().default("now").onUpdate("now")
-}).unique(["replicaId", "kind"]).index(["kind"]), ua = [
-	$i,
-	ea,
-	ra
-], da = "_voltro_replace_in_progress", fa = z(da, {
-	id: f({ prefix: "repl" }),
-	startedAt: x().default("now"),
-	kind: p().default("replace"),
-	tables: p().nullable(),
-	capture: p().nullable(),
-	via: p(),
-	staging: p().nullable(),
-	heartbeatAt: x().nullable(),
-	resumable: b().nullable()
-}).nonReactive(), pa = 30, ma = (e, t) => {
+}, la = (e, t) => e.filter((e) => !ea(e.name) || t.has(e.name)), ua = (e, t) => new s({ reason: new c({
+	cause: t ?? Error(e),
+	message: e
+}) }), da = H("_voltro_migrations", {
+	id: h({ prefix: "mig" }),
+	name: g(),
+	hash: g(),
+	status: g(),
+	appliedAt: w().nullable(),
+	durationMs: _().nullable(),
+	errorMessage: g().nullable(),
+	errorStack: g().nullable(),
+	workflowRunId: g().nullable(),
+	createdAt: w().default("now"),
+	updatedAt: w().default("now").onUpdate("now")
+}).index(["status"]), fa = H("_voltro_seeds", {
+	id: h({ prefix: "seed" }),
+	name: g(),
+	lifecycle: g(),
+	fingerprint: g(),
+	cronSchedule: g().nullable(),
+	watchedTables: E().nullable(),
+	nextRunAt: w().nullable(),
+	lastRunStatus: g().nullable(),
+	lastRunAt: w().nullable(),
+	lastRunDurationMs: _().nullable(),
+	lastRunRowsTouched: _().nullable(),
+	lastError: g().nullable(),
+	workflowRunId: g().nullable(),
+	createdAt: w().default("now"),
+	updatedAt: w().default("now").onUpdate("now")
+}).index(["lifecycle"]).index(["nextRunAt"]), pa = H("_voltro_schema_owner", {
+	id: h({ prefix: "own" }),
+	appName: g(),
+	projectName: g().nullable(),
+	frameworkVersion: g().nullable(),
+	claimedAt: w().default("now")
+}), ma = H("_voltro_plugin_migrations", {
+	id: h({ prefix: "plm" }),
+	plugin_name: g(),
+	migration_id: g(),
+	description: g().nullable(),
+	applied_at: g()
+}), ha = H("_voltro_migration_plans", {
+	id: h({ prefix: "plan" }),
+	fingerprint: g(),
+	liveFingerprint: g().nullable(),
+	operations: E(),
+	rollbackPlan: E().nullable(),
+	appliedBy: g(),
+	environment: g(),
+	source: g(),
+	onlineStrategy: g().nullable(),
+	durationMs: _(),
+	notes: g().nullable(),
+	squashedAt: w().nullable(),
+	appliedAt: w().default("now"),
+	createdAt: w().default("now"),
+	updatedAt: w().default("now").onUpdate("now")
+}).index(["fingerprint"]).index(["environment"]), ga = H("_voltro_idempotency", {
+	id: h({ prefix: "idem" }),
+	scope: g(),
+	key: g(),
+	status: g(),
+	response: E().nullable(),
+	createdAt: w().default("now")
+}).unique(["scope", "key"]).index(["createdAt"]), _a = H("_voltro_devices", {
+	id: h({ prefix: "device" }),
+	tenantId: g(),
+	name: g(),
+	scopes: E().nullable(),
+	pairingHash: g().maxLength(64).nullable(),
+	pairingExpiresAt: w().nullable(),
+	accessHash: g().maxLength(64).nullable(),
+	accessExpiresAt: w().nullable(),
+	refreshHash: g().maxLength(64).nullable(),
+	refreshExpiresAt: w().nullable(),
+	previousRefreshHash: g().maxLength(64).nullable(),
+	generation: _().default(0),
+	pairedAt: w().nullable(),
+	lastSeenAt: w().nullable(),
+	revokedAt: w().nullable(),
+	revokedReason: g().nullable(),
+	createdBy: g().nullable(),
+	metadata: E().nullable(),
+	createdAt: w()
+}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), va = H("_voltro_tenant_selections", {
+	id: h({ prefix: "tsel" }),
+	subjectType: g().maxLength(32),
+	subjectId: g(),
+	tenantId: g(),
+	selectedAt: w()
+}).primaryKey(["id"]).nonReactive(), ya = H("_voltro_kv", {
+	id: h({ prefix: "kv" }),
+	key: g().unique(),
+	value: g().nullable(),
+	expiresAt: w().nullable(),
+	createdAt: w().default("now"),
+	updatedAt: w().default("now").onUpdate("now")
+}).index(["expiresAt"]), ba = H("_voltro_api_keys", {
+	id: h({ prefix: "apikey" }),
+	tenantId: g().nullable(),
+	name: g(),
+	hashedKey: g().maxLength(64).unique(),
+	keyPrefix: g(),
+	scopes: E().nullable(),
+	lastUsedAt: w().nullable(),
+	requestCount: _().default(0),
+	expiresAt: w().nullable(),
+	revokedAt: w().nullable(),
+	createdBy: g().nullable(),
+	onBehalfOf: g().nullable(),
+	metadata: E().nullable(),
+	createdAt: w().default("now")
+}).index("byApiKeyTenant", ["tenantId"]), xa = H("_voltro_replica_observations", {
+	id: h({ prefix: "robs" }),
+	replicaId: g().maxLength(191),
+	startedAt: w(),
+	version: g().maxLength(64).nullable(),
+	kind: g().maxLength(64),
+	payload: g().nullable(),
+	reachableAt: g().maxLength(255).nullable(),
+	writtenAt: w().default("now").onUpdate("now")
+}).unique(["replicaId", "kind"]).index(["kind"]), Sa = [
+	da,
+	fa,
+	ha
+], Ca = "_voltro_replace_in_progress", wa = H(Ca, {
+	id: h({ prefix: "repl" }),
+	startedAt: w().default("now"),
+	kind: g().default("replace"),
+	tables: g().nullable(),
+	capture: g().nullable(),
+	via: g(),
+	staging: g().nullable(),
+	heartbeatAt: w().nullable(),
+	resumable: C().nullable()
+}).nonReactive(), Ta = 30, Ea = (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;
-}, ha = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), ga = (e) => {
+}, Da = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), Oa = (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) => {
@@ -3533,7 +3711,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`;
-}, _a = (e, t, n) => {
+}, ka = (e, t, n) => {
 	let r = e.filter((e) => e.kind === "staging");
 	return {
 		all: r,
@@ -3543,7 +3721,7 @@ ${t.map((e) => {
 			return Number.isFinite(r) ? t - r >= n : !1;
 		})
 	};
-}, va = (e, t) => {
+}, Aa = (e, t) => {
 	if (e.all.length === 0) return;
 	let n = new Set(e.droppable.map((e) => e.id));
 	return `staged data-import leftovers:
@@ -3554,4 +3732,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 { Xr as $, ze as $n, x as $r, an as $t, Yi as A, V as An, s as Ar, Hn as At, Pi as B, ft as Bn, m as Br, Pn as Bt, Wi as C, It as Cn, M as Cr, Lr as Ct, qi as D, kt as Dn, E as Dr, Z as Dt, Ui as E, Ut as En, w as Er, Ir as Et, Ri as F, Ct as Fn, g as Fr, X as Ft, Di as G, dt as Gn, j as Gr, hn as Gt, Ai as H, pt as Hn, C as Hr, kn as Ht, Fi as I, xt as In, A as Ir, Ln as It, Ti as J, st as Jn, h as Jr, mn as Jt, Si as K, ot as Kn, oe as Kr, G as Kt, zi as L, bt as Ln, ie as Lr, Fn as Lt, Mi as M, Et as Mn, T as Mr, qn as Mt, ki as N, Ot as Nn, S as Nr, Kn as Nt, Gi as O, jt as On, ee as Or, Xn as Ot, Ii as P, At as Pn, y as Pr, Gn as Pt, Zr as Q, Ie as Qn, p as Qr, W as Qt, Li as R, St as Rn, ae as Rr, Y as Rt, Hi as S, Kt as Sn, O as Sr, yi as St, Zi as T, Ht as Tn, b as Tr, Fr as Tt, xi as U, ut as Un, se as Ur, On as Ut, Vi as V, z as Vn, re as Vr, Dn as Vt, Oi as W, lt as Wn, _ as Wr, jn as Wt, ni as X, nt as Xn, te as Xr, fn as Xt, Qr as Y, at as Yn, k as Yr, dn as Yt, Yr as Z, Fe as Zn, o as Zr, un as Zt, ta as _, nn as _n, de as _r, Kr as _t, va as a, Bt as an, Se as ar, Vr as at, ua as b, qt as bn, le as br, ti as bt, ma as c, rn as cn, je as cr, si as ct, ia as d, Wt as dn, ye as dr, ai as dt, ne as ei, sn as en, Ue as er, vi as et, sa as f, Yt as fn, ke as fr, Ur as ft, la as g, Nt as gn, me as gr, ui as gt, na as h, Rt as hn, pe as hr, ii as ht, ga as i, Qt as in, P as ir, li as it, Bi as j, Mt as jn, D as jr, Vn as jt, Qi as k, Dt as kn, l as kr, Zn as kt, ca as l, Jt as ln, Me as lr, ei as lt, $i as m, zt as mn, be as mr, Br as mt, pa as n, cn as nn, He as nr, zr as nt, _a as o, Pt as on, ge as or, Hr as ot, ra as p, Xt as pn, Ae as pr, Wr as pt, Ei as q, ct as qn, c as qr, pn as qt, fa as r, Lt as rn, We as rr, gi as rt, ha as s, Ft as sn, Oe as sr, Gr as st, da as t, on as tn, L as tr, qr as tt, aa as u, Gt as un, Ne as ur, $r as ut, ea as v, tn as vn, fe as vr, ci as vt, Xi as w, Zt as wn, v as wr, xr as wt, Ji as x, $t as xn, u as xr, Jr as xt, oa as y, en as yn, ue as yr, ri as yt, Ni as z, mt as zn, f as zr, Nn as zt };
+export { oi as $, Le as $n, l as $r, pn as $t, la as A, Pt as An, A as Ar, rr as At, Wi as B, Tt as Bn, ie as Br, Hn as Bt, $i as C, nn as Cn, p as Cr, ri as Ct, ea as D, Gt as Dn, C as Dr, Ur as Dt, ca as E, en as En, x as Er, Or as Et, qi as F, jt as Fn, T as Fr, $n as Ft, zi as G, ft as Gn, oe as Gr, Pn as Gt, Qi as H, mt as Hn, _ as Hr, Bn as Ht, Yi as I, Nt as In, S as Ir, Qn as It, Li as J, ct as Jn, ae as Jr, J as Jt, Ri as K, dt as Kn, b as Kr, Ln as Kt, Ki as L, Et as Ln, y as Lr, Q as Lt, Zi as M, W as Mn, u as Mr, Yn as Mt, Ui as N, Ft as Nn, ee as Nr, Jn as Nt, ia as O, Kt as On, D as Or, Gr as Ot, Bi as P, kt as Pn, O as Pr, er as Pt, ii as Q, it as Qn, M as Qr, hn as Qt, Xi as R, wt as Rn, P as Rr, Wn as Rt, aa as S, Xt as Sn, ce as Sr, ui as St, sa as T, zt as Tn, I as Tr, Kr as Tt, Vi as U, H as Un, ne as Ur, Mn as Ut, Gi as V, gt as Vn, h as Vr, zn as Vt, Mi as W, ht as Wn, E as Wr, Fn as Wt, si as X, lt as Xn, v as Xr, _n as Xt, Ii as Y, ut as Yn, d as Yr, gn as Yt, di as Z, st as Zn, N as Zr, mn as Zt, pa as _, Vt as _n, pe as _r, yi as _t, Aa as a, Bt as an, Ke as ar, vi as at, Sa as b, an as bn, fe as br, fi as bt, Ea as c, Lt as cn, _e as cr, ei as ct, ga as d, Zt as dn, Pe as dr, ci as dt, g as ei, q as en, Re as er, ai as et, ya as f, Jt as fn, Fe as fr, mi as ft, xa as g, Ht as gn, Se as gr, pi as gt, ma as h, $t as hn, Me as hr, Yr as ht, Oa as i, dn as in, We as ir, Ti as it, oa as j, At as jn, f as jr, ir as jt, na as k, Mt as kn, k as kr, kr as kt, ba as l, Rt as ln, Ae as lr, gi as lt, da as m, Qt as mn, je as mr, $r as mt, Ta as n, te as ni, un as nn, Ge as nr, ni as nt, ka as o, tn as on, L as or, Xr as ot, ha as p, qt as pn, xe as pr, Qr as pt, Ni as q, pt as qn, F as qr, vn as qt, wa as r, ln as rn, B as rr, Jr as rt, Da as s, Ut as sn, we as sr, Zr as st, Ca as t, w as ti, cn as tn, Ve as tr, ki as tt, _a as u, sn as un, Ne as ur, li as ut, fa as v, It as vn, me as vr, ti as vt, ta as w, Yt as wn, j as wr, Ai as wt, ua as x, rn as xn, le as xr, Ei as xt, va as y, on as yn, de as yr, _i as yt, Ji as z, Ct as zn, re as zr, Vn as zt };