@voltro/database 0.82.0 → 0.83.0

package/dist/{replaceInProgress-BbN7p1Q-.js → replaceInProgress-CncEA_Sx.js}

@@ -555,7 +555,7 @@ var se = () => new u({
 }, N = (e, t, n, r) => {
 	if (We("index name", t), t.length > 63) throw Error(n ? `auto-named index '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Supply an explicit short name: .index('<shortName>', ${JSON.stringify([...r])}).` : `index name '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten it.`);
 	t.length > 60 && A(`index '${t}' on table '${e}' is ${t.length} chars — ${63 - t.length} from the 63-byte limit. ${n ? `Consider .index('<shortName>', ${JSON.stringify([...r])}) before it grows.` : ""}`);
-}, P = (e, t) => {
+}, Ge = (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_]*$/.";
@@ -566,43 +566,43 @@ var se = () => new u({
 		throw Error(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — exceeds the 63-byte limit; ${n}`);
 	}
 	e.length > 60 && A(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — close to the 63-byte limit. Generated ids will be even longer (prefix + '_' + 26).`);
-}, Ge = 1704067200000n, Ke = 10n, qe = 12n, Je = (1n << Ke) - 1n, Ye = (1n << qe) - 1n, Xe = qe, Ze = 22n, Qe = () => {
+}, Ke = 1704067200000n, qe = 10n, Je = 12n, Ye = (1n << qe) - 1n, Xe = (1n << Je) - 1n, Ze = Je, Qe = 22n, $e = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > Je) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Je}.`);
+	if (t < 0n || t > Ye) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Ye}.`);
 	return t;
-}, $e = () => ({
+}, et = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: Qe()
-}), F, et = () => (F === void 0 && (F = $e()), F), tt = () => {
-	F = $e();
-}, nt = () => BigInt(Date.now()), rt = (e) => {
-	let t = nt();
-	for (; t <= e;) t = nt();
+	machineId: $e()
+}), tt, nt = () => (tt === void 0 && (tt = et()), tt), rt = () => {
+	tt = et();
+}, it = () => BigInt(Date.now()), at = (e) => {
+	let t = it();
+	for (; t <= e;) t = it();
 	return t;
-}, it = () => {
-	let e = et(), t = nt();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & Ye, e.sequence === 0n && (t = rt(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - Ge;
+}, ot = () => {
+	let e = nt(), t = it();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & Xe, e.sequence === 0n && (t = at(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - Ke;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Ze | e.machineId << Xe | e.sequence).toString();
-}, at = (e) => {
+	return (n << Qe | e.machineId << Ze | e.sequence).toString();
+}, st = (e) => {
 	let t = e.toLowerCase();
 	if (t.startsWith("_")) throw Error(`cannot derive a typeid prefix for table '${e}' (table names starting with '_' are not valid typeid prefixes). Pick an explicit prefix via id({ prefix: '...' }) or use a different scheme like id({ scheme: 'numeric' }) for internal tables.`);
 	if (!/^[a-z][a-z0-9_]*$/.test(t)) throw Error(`cannot derive a typeid prefix from table name '${e}' (must match [a-z][a-z0-9_]*). Pick an explicit prefix via id({ prefix: '...' }).`);
 	let n = t.endsWith("ies") && t.length > 3 ? t.slice(0, -3) + "y" : t.endsWith("ses") || t.endsWith("xes") || t.endsWith("zes") || t.endsWith("shes") || t.endsWith("ches") ? t.slice(0, -2) : t.endsWith("s") && t.length > 1 ? t.slice(0, -1) : t;
-	return P(n, {
+	return Ge(n, {
 		kind: "derived",
 		tableName: e
 	}), n;
-}, ot = (e, t) => {
+}, ct = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: at(t)
+		prefix: st(t)
 	};
-	if ("prefix" in e && !("scheme" in e)) return P(e.prefix, {
+	if ("prefix" in e && !("scheme" in e)) return Ge(e.prefix, {
 		kind: "explicit",
 		tableName: t
 	}), {
@@ -612,8 +612,8 @@ var se = () => new u({
 	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
 	switch (e.scheme) {
 		case "typeid": {
-			let n = e.prefix ?? at(t);
-			return e.prefix !== void 0 && P(e.prefix, {
+			let n = e.prefix ?? st(t);
+			return e.prefix !== void 0 && Ge(e.prefix, {
 				kind: "explicit",
 				tableName: t
 			}), {
@@ -629,22 +629,22 @@ var se = () => new u({
 			generate: e.generate
 		};
 	}
-}, st = (e, t) => {
+}, lt = (e, t) => {
 	switch (e.kind) {
 		case "typeid": return i(e.prefix).toString();
 		case "ulid": return a();
 		case "numeric": return null;
-		case "snowflake": return it();
+		case "snowflake": return ot();
 		case "custom": return e.generate(t);
 	}
-}, ct = (e) => ({
+}, ut = (e) => ({
 	fields: C(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 }
-}), lt = ct, ut = (e) => {
+}), dt = ut, ft = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -654,7 +654,7 @@ var se = () => new u({
 	};
 	for (let t of e) r(t);
 	return n;
-}, dt = (e, ...t) => {
+}, pt = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -665,14 +665,14 @@ var se = () => new u({
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, ft = (e = "cosine", t = "float32") => {
+}, mt = (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`;
 	}
-}, pt = [
+}, ht = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -681,7 +681,7 @@ var se = () => new u({
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], mt = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, ht = (e, t) => `${e}_${t.join("_")}_idx`, gt = (e, t) => `${e}_${t.join("_")}_uq`, _t = (e, t, n, r, i) => {
+], gt = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, _t = (e, t) => `${e}_${t.join("_")}_idx`, vt = (e, t) => `${e}_${t.join("_")}_uq`, yt = (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];
@@ -689,14 +689,14 @@ var se = () => new u({
 	let o = i[a];
 	if (o === void 0) throw Error(`hnsw index '${t}' on table '${e}' references unknown column '${a}'.`);
 	if (o.type !== "vector") throw Error(`hnsw index '${t}' on table '${e}' requires a vector() column — column '${a}' is '${o.type}'. HNSW is the pgvector approximate-nearest-neighbour method and only applies to vectors.`);
-}, vt = (e, t) => {
+}, bt = (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: ot(i.idSchemeInput, t)
+		idScheme: ct(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, I = (e) => {
+}, P = (e) => {
 	let t = e.appliedPrimaryKey ?? [];
 	return {
 		tableName: e.tableName,
@@ -716,7 +716,7 @@ var se = () => new u({
 		fullTextIndex: ((t, n, r) => {
 			if (n.length === 0) throw Error(`fullTextIndex '${t}' on '${e.tableName}' has no columns.`);
 			if (N(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
-			return I({
+			return P({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -737,27 +737,27 @@ var se = () => new u({
 			});
 		}),
 		with: ((...t) => {
-			let n = ut(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
+			let n = ft(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}': '${mt(o)}' and '${mt(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.`);
+				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${gt(o)}' and '${gt(t)}' both define it. If they're the same mixin reached via different paths, set a shared 'id' on both. If they're genuinely different concerns, rename one of the columns.`);
 				M(e.tableName, n), r[n] = a, i.set(n, t);
 			}
 			let a = [...e.appliedIndexes];
 			for (let t of n) for (let n of t.indexes ?? []) {
-				let t = n.name ?? ht(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (N(e.tableName, t, n.name === void 0, n.fields), _t(e.tableName, t, n.kind, n.fields, r), a.push({
+				let t = n.name ?? _t(e.tableName, n.fields);
+				a.some((e) => e.name === t) || (N(e.tableName, t, n.name === void 0, n.fields), yt(e.tableName, t, n.kind, n.fields, r), a.push({
 					name: t,
 					fields: n.fields,
 					...n.kind === void 0 ? {} : { kind: n.kind },
 					...n.kindOptions === void 0 ? {} : { kindOptions: n.kindOptions }
 				}));
 			}
-			return I({
+			return P({
 				...e,
 				tableName: e.tableName,
 				fields: r,
@@ -774,10 +774,10 @@ var se = () => new u({
 		}),
 		index: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = ht(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 = _t(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`index '${n}' on table '${e.tableName}' has no fields — an index must cover at least one column.`);
 			let o = r.filter((e) => typeof e == "string");
-			if (N(e.tableName, n, a, o), _t(e.tableName, n, i?.kind, r, e.fields), e.appliedIndexes.some((e) => e.name === n)) throw t.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${e.tableName}' — you've called .index(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (rare).`) : Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table.`);
-			return I({
+			if (N(e.tableName, n, a, o), yt(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 P({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -801,8 +801,8 @@ var se = () => new u({
 		expressionIndex: ((t, n, r) => {
 			if (n.length === 0) throw Error(`expressionIndex '${t}' on table '${e.tableName}' has no fields — an index must cover at least one column or expression.`);
 			let i = n.filter((e) => typeof e == "string");
-			if (N(e.tableName, t, !1, i), _t(e.tableName, t, r?.kind, n, e.fields), e.appliedIndexes.some((e) => e.name === t)) throw Error(`duplicate index '${t}' on table '${e.tableName}': each index name must be unique within a table.`);
-			return I({
+			if (N(e.tableName, t, !1, i), yt(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 P({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -825,9 +825,9 @@ var se = () => new u({
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = gt(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 (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(`unique '${n}' on table '${e.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
 			if (N(e.tableName, n, a, r), e.appliedUniques.some((e) => e.name === n)) throw Error(a ? `duplicate auto-named UNIQUE '${n}' on table '${e.tableName}' — you've called .unique(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (very rare).` : `duplicate UNIQUE '${n}' on table '${e.tableName}': each constraint name must be unique within a table.`);
-			return I({
+			return P({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -848,10 +848,10 @@ var se = () => new u({
 		}),
 		uniqueActive: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = ht(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 (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(`uniqueActive '${n}' on table '${e.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
 			if (N(e.tableName, n, a, r), e.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
 			let o = i?.where ?? "\"deletedAt\" IS NULL";
-			return I({
+			return P({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -874,7 +874,7 @@ var se = () => new u({
 		check: ((t, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
 			if (N(e.tableName, t, !1, []), e.appliedChecks.some((e) => e.name === t)) throw Error(`duplicate CHECK '${t}' on table '${e.tableName}': each constraint name must be unique within a table.`);
-			return I({
+			return P({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -896,7 +896,7 @@ var se = () => new u({
 			if (t.trim().length === 0) throw Error(`rule on table '${e.tableName}' has an empty name.`);
 			let i = e.appliedRules ?? [];
 			if (i.some((e) => e.name === t)) throw Error(`duplicate rule '${t}' on table '${e.tableName}': each rule name must be unique within a table.`);
-			return I({
+			return P({
 				...e,
 				appliedRules: [...i, {
 					name: t,
@@ -907,7 +907,7 @@ var se = () => new u({
 		}),
 		renamedFrom: ((t) => {
 			if (t === e.tableName) throw Error(`renamedFrom('${t}') on table '${e.tableName}' names the table itself — drop the marker, there is nothing to rename.`);
-			return j(t), I({
+			return j(t), P({
 				...e,
 				previousTableName: t
 			});
@@ -922,7 +922,7 @@ var se = () => new u({
 			}
 			if (t.length > 0) throw Error(`primaryKey([...]) declared twice on table '${e.tableName}'.`);
 			for (let [t, r] of Object.entries(e.fields)) if (r.type === "id" && !n.includes(t)) throw Error(`primaryKey([...]) on table '${e.tableName}' conflicts with the id() column '${t}'. The explicit primary key IS the key — drop the id() column, or include '${t}' in the composite key.`);
-			return I({
+			return P({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -937,7 +937,7 @@ var se = () => new u({
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
-		nonReactive: (() => I({
+		nonReactive: (() => P({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -951,7 +951,7 @@ var se = () => new u({
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validate: ((t) => I({
+		validate: ((t) => P({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -965,7 +965,7 @@ var se = () => new u({
 			insertSchema: t,
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validatePatch: ((t) => I({
+		validatePatch: ((t) => P({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -980,7 +980,7 @@ var se = () => new u({
 			validatePatchSchema: r.partial(t)
 		}))
 	};
-}, L = (e, t) => {
+}, F = (e, t) => {
 	j(e);
 	let n = Object.entries(t).flatMap(([e, t]) => {
 		let n = he(t);
@@ -988,14 +988,14 @@ var se = () => new u({
 			column: e,
 			...n
 		}];
-	}), r = vt(C(t), e);
+	}), r = bt(C(t), e);
 	for (let t of Object.keys(r)) M(e, t);
 	let i;
 	for (let [t, n] of Object.entries(r)) n.references === S && (n.references = () => {
 		if (i === void 0) throw Error(`selfReference() on '${e}.${t}' read before table() returned`);
 		return i;
 	});
-	return i = I({
+	return i = P({
 		appliedPluginRefs: n,
 		tableName: e,
 		fields: r,
@@ -1007,7 +1007,7 @@ var se = () => new u({
 		appliedChecks: [],
 		appliedRules: []
 	}), i;
-}, yt = (e) => e === "sqlite" || e === "turso", bt = (e) => e === "mysql" || e === "mariadb", R = (e, t) => {
+}, xt = (e) => e === "sqlite" || e === "turso", St = (e) => e === "mysql" || e === "mariadb", I = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e.replace(/`/g, "``")}\``;
@@ -1016,51 +1016,51 @@ var se = () => new u({
 		case "sqlite":
 		case "turso": return `"${e.replace(/"/g, "\"\"")}"`;
 	}
-}, xt = 1e4, St = Symbol.for("@voltro/database/tableRegistry"), Ct = globalThis, z = Ct[St] ?? (Ct[St] = /* @__PURE__ */ new Map()), wt = (e) => {
-	let t = z.get(e.tableName);
+}, Ct = 1e4, wt = Symbol.for("@voltro/database/tableRegistry"), Tt = globalThis, L = Tt[wt] ?? (Tt[wt] = /* @__PURE__ */ new Map()), Et = (e) => {
+	let t = L.get(e.tableName);
 	if (t === void 0) {
-		z.set(e.tableName, e);
+		L.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.`);
-}, Tt = (e) => {
-	z.get(e.tableName) === void 0 && z.set(e.tableName, e);
-}, B = (e) => z.get(e), Et = (e) => {
-	let t = z.get(e);
+}, Dt = (e) => {
+	L.get(e.tableName) === void 0 && L.set(e.tableName, e);
+}, R = (e) => L.get(e), Ot = (e) => {
+	let t = L.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;
-}, Dt = () => [...z.values()], Ot = (e) => z.delete(e), kt = () => {
-	z.clear();
-}, At = (e) => z.get(e)?.isReactive !== !1, V = (e) => e.order ?? [], jt = (e) => ({
+}, kt = () => [...L.values()], At = (e) => L.delete(e), jt = () => {
+	L.clear();
+}, Mt = (e) => L.get(e)?.isReactive !== !1, z = (e) => e.order ?? [], Nt = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), Mt = (e, t) => ({
+}), Pt = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), Nt = (e, t) => ({
+}), Ft = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), Pt = (e, t) => ({
+}), It = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), Ft = (e, t) => ({
+}), Lt = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), It = (e, t) => ({
+}), Rt = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), Lt = (e, t) => ({
+}), zt = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), H = (e) => (...t) => {
+}), B = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return W({
+	return H({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -1072,55 +1072,55 @@ var se = () => new u({
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, Rt = H("union"), zt = H("union-all"), Bt = H("intersect"), Vt = H("except"), U = (e) => ({ over: (t) => ({
+}, Bt = B("union"), Vt = B("union-all"), Ht = B("intersect"), Ut = B("except"), V = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), Ht = (e = "rowNumber") => U({
+}) }), Wt = (e = "rowNumber") => V({
 	op: "window-row-number",
 	alias: e
-}), Ut = (e = "rank") => U({
+}), Gt = (e = "rank") => V({
 	op: "window-rank",
 	alias: e
-}), Wt = (e = "denseRank") => U({
+}), Kt = (e = "denseRank") => V({
 	op: "window-dense-rank",
 	alias: e
-}), Gt = (e, t = 1, n) => U({
+}), qt = (e, t = 1, n) => V({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), Kt = (e, t = 1, n) => U({
+}), Jt = (e, t = 1, n) => V({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), qt = (e, t) => U({
+}), Yt = (e, t) => V({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), Jt = (e, t) => U({
+}), Xt = (e, t) => V({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), Yt = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? B(e)?.appliedFullText?.find((e) => e.name === t);
+}), Zt = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? R(e)?.appliedFullText?.find((e) => e.name === t);
 	if (r === void 0) throw Error(`.matching('${t}', ...): no full-text index named '${t}' is declared on table '${e}'. Declare it with \`table(...).fullTextIndex('${t}', [columns])\` first.`);
 	return {
 		columns: r.columns,
 		...r.config === void 0 ? {} : { config: r.config },
 		...r.weights === void 0 ? {} : { weights: r.weights }
 	};
-}, W = (e) => ({
+}, H = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return W({
+		return H({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return W({
+		return H({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -1129,43 +1129,43 @@ var se = () => new u({
 		});
 	},
 	limit(t) {
-		return W({
+		return H({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return W({
+		return H({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return W({
+		return H({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return W({
+		return H({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return W({
+		return H({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	forUpdate() {
-		return W({
+		return H({
 			...e,
 			lock: "update"
 		});
 	},
 	unscoped() {
-		return W({
+		return H({
 			...e,
 			crossTenant: !0
 		});
@@ -1175,13 +1175,13 @@ var se = () => new u({
 			...e.eager ?? {},
 			...t
 		};
-		return W({
+		return H({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return W({
+		return H({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1195,15 +1195,15 @@ var se = () => new u({
 			...t,
 			alias: e
 		}));
-		return W({
+		return H({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n, r) {
-		let i = Yt(e.table, t, e.fullTextIndexes);
-		return W({
+		let i = Zt(e.table, t, e.fullTextIndexes);
+		return H({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -1218,7 +1218,7 @@ var se = () => new u({
 	rankBy(t) {
 		let n = e.fullTextSearch;
 		if (n === void 0) throw Error(".rankBy() requires a preceding .matching(...) clause — there is no full-text search to rank on this query.");
-		return W({
+		return H({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -1237,7 +1237,7 @@ var se = () => new u({
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return W({
+			return H({
 				...e,
 				annClause: i
 			});
@@ -1249,7 +1249,7 @@ var se = () => new u({
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return W({
+			return H({
 				...e,
 				annClause: r,
 				take: n
@@ -1262,7 +1262,7 @@ var se = () => new u({
 			column: "",
 			distance: "cosine"
 		};
-		return W({
+		return H({
 			...e,
 			annClause: {
 				...n,
@@ -1271,22 +1271,22 @@ var se = () => new u({
 		});
 	},
 	use(t) {
-		return W({ ...t(e) });
+		return H({ ...t(e) });
 	},
 	distinct() {
-		return W({
+		return H({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return W({
+		return H({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return W({
+		return H({
 			...e,
 			alias: t
 		});
@@ -1296,9 +1296,10 @@ var se = () => new u({
 			kind: "inner",
 			table: i,
 			alias: n,
-			on: r
+			on: r,
+			...typeof t == "string" ? {} : { sourceTable: t }
 		}];
-		return W({
+		return H({
 			...e,
 			joins: a
 		});
@@ -1308,9 +1309,10 @@ var se = () => new u({
 			kind: "left",
 			table: i,
 			alias: n,
-			on: r
+			on: r,
+			...typeof t == "string" ? {} : { sourceTable: t }
 		}];
-		return W({
+		return H({
 			...e,
 			joins: a
 		});
@@ -1320,7 +1322,7 @@ var se = () => new u({
 			outputKey: e,
 			source: t
 		}));
-		return W({
+		return H({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1329,7 +1331,7 @@ var se = () => new u({
 	withCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.withCte: duplicate CTE name '${t}'`);
-		return W({
+		return H({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1340,7 +1342,7 @@ var se = () => new u({
 	recursiveCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.recursiveCte: duplicate CTE name '${t}'`);
-		return W({
+		return H({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1351,20 +1353,20 @@ var se = () => new u({
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return W({
+		return H({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return W({
+		return H({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return W({
+		return H({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1375,8 +1377,8 @@ var se = () => new u({
 		});
 	}
 });
-function Xt(e) {
-	return W({
+function Qt(e) {
+	return H({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1387,7 +1389,7 @@ function Xt(e) {
 		sourceTable: e
 	});
 }
-var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
+var $t = (e, t, n) => en(e, "id", t, n), en = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1402,11 +1404,11 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, $t = (e) => {
+}, tn = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) wt(r), t[n] = Xt(r);
+	for (let [n, r] of Object.entries(e)) Et(r), t[n] = Qt(r);
 	return t;
-}, en = (e) => e.isView === !0, tn = (e, t, n) => {
+}, nn = (e) => e.isView === !0, rn = (e, t, n) => {
 	if (j(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
 	let r = C(t);
 	for (let t of Object.keys(r)) M(e, t);
@@ -1416,7 +1418,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		isView: !0,
 		viewSelect: n
 	};
-}, nn = (e) => Xt({
+}, an = (e) => Qt({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1424,8 +1426,8 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), rn = (e, t, n = null) => {
-	let r = n === null ? R(e.tableName, t) : `${R(n, t)}.${R(e.tableName, t)}`, i = e.viewSelect.trim();
+}), on = (e, t, n = null) => {
+	let r = n === null ? I(e.tableName, t) : `${I(n, t)}.${I(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1434,7 +1436,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, an = (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, on = (e) => {
+}, sn = (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, cn = (e) => {
 	if (e == null || typeof e != "string") return e;
 	let t = e.trim();
 	if (t.length === 0) return e;
@@ -1445,7 +1447,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	} catch {
 		return e;
 	}
-}, sn = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, cn = (e) => {
+}, ln = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, un = (e) => {
 	if (e == null || e instanceof Date) return e;
 	if (typeof e == "string") {
 		let t = new Date(e);
@@ -1456,24 +1458,24 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		return isNaN(t.getTime()) ? e : t;
 	}
 	return e;
-}, ln = (e, t, n) => {
+}, dn = (e, t, n) => {
 	if (e == null) return e;
 	switch (t) {
-		case "boolean": return n === "postgres" ? e : an(e);
-		case "vector": return n === "postgres" ? on(e) : e;
-		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : on(e);
-		case "array": return n === "postgres" ? e : on(e);
+		case "boolean": return n === "postgres" ? e : sn(e);
+		case "vector": return n === "postgres" ? cn(e) : e;
+		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : cn(e);
+		case "array": return n === "postgres" ? e : cn(e);
 		case "timestamp":
-		case "date": return n === "sqlite" || n === "turso" ? cn(e) : e;
+		case "date": return n === "sqlite" || n === "turso" ? un(e) : e;
 		case "decimal":
-		case "bigint": return sn(e);
+		case "bigint": return ln(e);
 		default: return e;
 	}
-}, un = (e, t, n) => {
+}, fn = (e, t, n) => {
 	if (e.length === 0) return e;
-	let r = B(t);
-	return r === void 0 ? e : dn(e, r, n);
-}, dn = (e, t, n) => {
+	let r = R(t);
+	return r === void 0 ? e : pn(e, r, n);
+}, pn = (e, t, n) => {
 	if (e.length === 0) return e;
 	let r = t.fields, i = [];
 	for (let [e, t] of Object.entries(r)) i.push({
@@ -1482,10 +1484,10 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	});
 	return e.map((e) => {
 		let t = { ...e };
-		for (let { key: e, type: r } of i) e in t && (t[e] = ln(t[e], r, n));
+		for (let { key: e, type: r } of i) e in t && (t[e] = dn(t[e], r, n));
 		return t;
 	});
-}, fn = (e, t) => {
+}, mn = (e, t) => {
 	if (e == null) return e;
 	switch (t) {
 		case "json": return JSON.stringify(e);
@@ -1493,25 +1495,38 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		case "vector": return typeof e == "string" ? e : JSON.stringify(e);
 		default: return e;
 	}
-}, pn = (e, t, n = ["json", "array"]) => {
-	let r = B(t);
+}, hn = (e, t, n = ["json", "array"]) => {
+	let r = R(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 = fn(e[t], r.type);
+		let n = mn(e[t], r.type);
 		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
 	}
 	return a ?? e;
-}, mn = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => mn(e)) : e, hn = /^[A-Za-z_][A-Za-z0-9_]*$/, gn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : hn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), _n = (e) => "{" + e.map((e) => {
+}, gn = (e) => {
+	if (e.length === 0) throw RangeError("Column reference must not be empty");
+	return {
+		_tag: "ColumnReference",
+		column: e
+	};
+}, U = (e) => typeof e == "object" && !!e && "_tag" in e && e._tag === "ColumnReference" && "column" in e && typeof e.column == "string", _n = [
+	"eq",
+	"neq",
+	"gt",
+	"gte",
+	"lt",
+	"lte"
+], vn = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => vn(e)) : e, yn = /^[A-Za-z_][A-Za-z0-9_]*$/, bn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : yn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), xn = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", G = (e, t, n, r = {}) => {
-	let i = R(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", W = (e, t, n, r = {}) => {
+	let i = I(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${_n(t)}'::text[])`;
+		let e = `(${i} #>> '${xn(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = gn(t);
+	let o = bn(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1528,61 +1543,77 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, vn = class extends Error {
+}, Sn = class extends Error {
 	_tag = "TenantNamespaceUnresolved";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceUnresolved";
 	}
-}, yn = class extends Error {
+}, Cn = class extends Error {
 	_tag = "TenantNamespaceInvalid";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceInvalid";
 	}
-}, bn = 63, xn = "tenant_", Sn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Cn = (e) => {
-	if (e == null || e === "") throw new vn("namespace isolation is on but the request has no resolvable tenant (subject.tenantId is null/empty). Refusing to run against a shared/default namespace — this would be a cross-tenant read. Authenticate with a tenant-scoped subject, or disable namespace isolation for this surface.");
-	let t = Sn(e);
-	if (t.replace(/_/g, "") === "") throw new yn(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
-	let n = `${xn}${t}`;
-	if (n.length > bn) throw new yn(`namespace '${n}' for tenant '${e}' exceeds the ${bn}-byte identifier limit. Use a shorter tenant id.`);
+}, wn = 63, Tn = "tenant_", En = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Dn = (e) => {
+	if (e == null || e === "") throw new Sn("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 = En(e);
+	if (t.replace(/_/g, "") === "") throw new Cn(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
+	let n = `${Tn}${t}`;
+	if (n.length > wn) throw new Cn(`namespace '${n}' for tenant '${e}' exceeds the ${wn}-byte identifier limit. Use a shorter tenant id.`);
 	return n;
-}, K = (e, t) => e === null ? t : `${e}.${t}`, wn = /* @__PURE__ */ new Set(["timestamp", "date"]), Tn = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, En = (e, t) => {
-	if (e === void 0 || t == null || !wn.has(e) || t instanceof Date) return t;
+}, G = (e, t) => e === null ? t : `${e}.${t}`, On = /* @__PURE__ */ new Set(["timestamp", "date"]), kn = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, An = (e, t) => {
+	if (e === void 0 || t == null || !On.has(e) || t instanceof Date) return t;
 	if (typeof t == "number" && Number.isFinite(t)) return new Date(t);
-	if (typeof t == "string" && Tn.test(t)) {
+	if (typeof t == "string" && kn.test(t)) {
 		let e = new Date(t);
 		return Number.isNaN(e.getTime()) ? t : e;
 	}
 	return t;
-}, Dn = (e, t) => e === void 0 || !wn.has(e) ? t : t.map((t) => En(e, t)), On = (e, t) => {
+}, jn = (e, t) => e === void 0 || !On.has(e) ? t : t.map((t) => An(e, t)), Mn = (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 : R(s))?.fields[r];
+}, Nn = (e, t) => {
 	let { strings: n, values: r } = e, i = t.unsafe(n[0] ?? "");
 	for (let e = 0; e < r.length; e++) i = t`${i}${r[e]}${t.unsafe(n[e + 1] ?? "")}`;
 	return t`${i}`;
-}, q = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), J = (e, t, n = null, r) => {
-	if ("not" in e) return t`NOT (${J(e.not, t, n, r)})`;
-	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => J(e, t, n, r)));
-	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => J(e, t, n, r)));
+}, K = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), q = (e, t, n = null, r) => {
+	if ("not" in e) return t`NOT (${q(e.not, t, n, r)})`;
+	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => q(e, t, n, r)));
+	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => q(e, t, n, r)));
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
-		let r = e, i = X(r.subquery, t, n);
+		let r = e, i = Y(r.subquery, t, n);
 		return r.op === "subquery-in" ? t`${t(r.column)} IN (${i})` : t`${t(r.column)} NOT IN (${i})`;
 	}
 	if (e.op === "exists" || e.op === "not-exists") {
-		let r = e, i = X(r.subquery, t, n);
+		let r = e, i = Y(r.subquery, t, n);
 		return r.op === "exists" ? t`EXISTS (${i})` : t`NOT EXISTS (${i})`;
 	}
-	let i = e, a = t(i.column), o = i.path, s = o !== void 0 && o.length > 0, c = () => t.onDialectOrElse({
-		mysql: () => t.unsafe(G(i.column, o, "mysql")),
-		mssql: () => t.unsafe(G(i.column, o, "mssql")),
-		sqlite: () => t.unsafe(G(i.column, o, "sqlite")),
-		orElse: () => t.unsafe(G(i.column, o, "postgres"))
+	let i = e;
+	if (U(i.value)) {
+		if (!_n.some((e) => e === i.op) || i.path !== void 0) throw E("Column references require a scalar comparison without a JSON path");
+		let e = t(i.value.column), n = t(i.column);
+		switch (i.op) {
+			case "eq": return t`${n} = ${e}`;
+			case "neq": return t`${n} <> ${e}`;
+			case "gt": return t`${n} > ${e}`;
+			case "gte": return t`${n} >= ${e}`;
+			case "lt": return t`${n} < ${e}`;
+			case "lte": return t`${n} <= ${e}`;
+		}
+	}
+	let a = t(i.column), o = i.path, s = o !== void 0 && o.length > 0, c = () => t.onDialectOrElse({
+		mysql: () => t.unsafe(W(i.column, o, "mysql")),
+		mssql: () => t.unsafe(W(i.column, o, "mssql")),
+		sqlite: () => t.unsafe(W(i.column, o, "sqlite")),
+		orElse: () => t.unsafe(W(i.column, o, "postgres"))
 	}), l = () => t.onDialectOrElse({
-		mysql: () => t.unsafe(G(i.column, o, "mysql", { numeric: !0 })),
-		mssql: () => t.unsafe(G(i.column, o, "mssql", { numeric: !0 })),
-		sqlite: () => t.unsafe(G(i.column, o, "sqlite", { numeric: !0 })),
-		orElse: () => t.unsafe(G(i.column, o, "postgres", { numeric: !0 }))
-	}), u = s ? c() : a, d = s ? l() : a, f = (e) => s && e != null ? String(e) : e, p = (e) => s ? Number(e) : e, m = s || r === void 0 ? void 0 : B(r)?.fields?.[i.column]?.type, h = (e) => {
-		let n = En(m, e);
+		mysql: () => t.unsafe(W(i.column, o, "mysql", { numeric: !0 })),
+		mssql: () => t.unsafe(W(i.column, o, "mssql", { numeric: !0 })),
+		sqlite: () => t.unsafe(W(i.column, o, "sqlite", { numeric: !0 })),
+		orElse: () => t.unsafe(W(i.column, o, "postgres", { numeric: !0 }))
+	}), u = s ? c() : a, d = s ? l() : a, f = (e) => s && e != null ? String(e) : e, p = (e) => s ? Number(e) : e, m = s || r === void 0 ? void 0 : R(r)?.fields?.[i.column]?.type, h = (e) => {
+		let n = An(m, e);
 		return n instanceof Date ? t.onDialectOrElse({
-			sqlite: () => mn(n),
+			sqlite: () => vn(n),
 			orElse: () => n
 		}) : n;
 	};
@@ -1602,7 +1633,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			return e.length === 0 ? t`TRUE` : t`${u} NOT IN ${t.in(s ? e.map((e) => f(e)) : e.map(h))}`;
 		}
 		case "contains": {
-			let e = `%${q(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
+			let e = `%${K(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
 			return t.onDialectOrElse({
 				mysql: () => t`LOWER(${u}) LIKE LOWER(${e})`,
 				mssql: () => t`LOWER(${u}) LIKE LOWER(${e})`,
@@ -1611,7 +1642,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			});
 		}
 		case "startsWith": {
-			let e = `${q(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
+			let e = `${K(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
 			return t.onDialectOrElse({
 				mysql: () => t`${u} LIKE ${e}`,
 				orElse: () => t`${u} LIKE ${e} ESCAPE '\\'`
@@ -1659,13 +1690,13 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			});
 		}
 	}
-}, kn = (e, t) => {
+}, Pn = (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}`);
-}, An = (e, t) => t.csv(e.map((e) => {
+}, Fn = (e, t) => t.csv(e.map((e) => {
 	let n = e.column === void 0 ? t.unsafe("*") : t`${t(e.column)}`;
 	if (e.op.startsWith("window-")) {
-		let r = kn(e.window ?? {}, t);
+		let r = Pn(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)}`;
@@ -1689,61 +1720,58 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			return t`${t(e.column)} AS ${t(e.alias)}`;
 		default: throw E(`compileAggregateProjection: unknown op '${e.op}'`);
 	}
-})), jn = (e) => `[${e.join(",")}]`, Mn = (e, t) => {
+})), In = (e) => `[${e.join(",")}]`, Ln = (e, t) => {
 	if (e.queryVector === void 0) return null;
-	let n = t(e.column), r = jn(e.queryVector), i = e.distance === "cosine" ? "<=>" : e.distance === "l2" ? "<->" : "<#>", a = e.distance === "cosine" ? "VEC_DISTANCE_COSINE" : "VEC_DISTANCE_EUCLIDEAN";
+	let n = t(e.column), r = In(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`
 	});
-}, Nn = (e, t) => {
+}, Rn = (e, t) => {
 	let n = t.unsafe(e.useGeography ? "::geography" : "::geometry");
 	return t`ST_Distance(${t(e.column)}${n}, ${e.geom}${n})`;
-}, Pn = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Y = (e, t) => t`${t(`${e.indexName}_tsv`)}`, Fn = (e, t) => `${t}_${e.indexName}_fts`, In = (e) => e.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((e) => e !== ""), Ln = (e) => {
+}, zn = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, J = (e, t) => t`${t(`${e.indexName}_tsv`)}`, Bn = (e, t) => `${t}_${e.indexName}_fts`, Vn = (e) => e.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((e) => e !== ""), Hn = (e) => {
 	if (e.prefix !== !0) return;
-	let t = In(e.query);
+	let t = Vn(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(" ")
 	};
-}, Rn = (e, t, n) => {
-	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${q(e.query)}%`, a = Ln(e), o = () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`));
+}, Un = (e, t, n) => {
+	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${K(e.query)}%`, a = Hn(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(Fn(e, t));
+			let r = n(Bn(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`${Y(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})` : n`${Y(e, n)} @@ to_tsquery(${e.config ?? "english"}, ${a.pg})`
+		orElse: () => a === void 0 ? n`${J(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})` : n`${J(e, n)} @@ to_tsquery(${e.config ?? "english"}, ${a.pg})`
 	});
-}, zn = (e, t, n) => {
-	let r = `%${q(e.query)}%`, i = Ln(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}`);
+}, Wn = (e, t, n) => {
+	let r = `%${K(e.query)}%`, i = Hn(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)`,
 		sqlite: () => {
-			let r = n(Fn(e, t));
+			let r = n(Bn(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(${Y(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))` : n`ts_rank(${Y(e, n)}, to_tsquery(${e.config ?? "english"}, ${i.pg}))`
+		orElse: () => i === void 0 ? n`ts_rank(${J(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))` : n`ts_rank(${J(e, n)}, to_tsquery(${e.config ?? "english"}, ${i.pg}))`
 	});
-}, Bn = (e, t, n) => {
-	let r = () => n?.length ? t.csv(n.map((e) => t`${t(e)}`)) : t`*`, i = B(e)?.fields;
-	return !i || !Object.values(i).some((e) => e.type === "bigint") ? r() : t.onDialectOrElse({
-		sqlite: () => t.csv((n?.length ? n : Object.keys(i)).map((e) => i[e]?.type === "bigint" ? t`CAST(${t(e)} AS TEXT) AS ${t(e)}` : t`${t(e)}`)),
-		orElse: r
+}, Gn = (e, t, n, r) => {
+	let i = (e) => t(r && !e.includes(".") ? `${r}.${e}` : e), a = () => n?.length ? t.csv(n.map((e) => t`${i(e)}`)) : r ? t`${t(r)}.*` : t`*`;
+	return !e || !Object.values(e).some((e) => e.type === "bigint") ? a() : t.onDialectOrElse({
+		sqlite: () => t.csv((n?.length ? n : Object.keys(e)).map((n) => e[n]?.type === "bigint" ? t`CAST(${i(n)} AS TEXT) AS ${t(n)}` : t`${i(n)}`)),
+		orElse: a
 	});
-}, Vn = (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 ? t.table : t.joins?.find((e) => e.alias === i)?.table;
-	return a === void 0 ? void 0 : B(a)?.fields?.[r]?.type;
-}, X = (e, t, n = null) => {
+}, Kn = (e, t, n) => Gn(R(e)?.fields, t, n), Y = (e, t, n = null) => {
 	if (e.setOp && e.setOp.queries.length >= 2) {
-		let r = e.setOp.kind === "union" ? "UNION" : e.setOp.kind === "union-all" ? "UNION ALL" : e.setOp.kind === "intersect" ? "INTERSECT" : "EXCEPT", i = e.setOp.queries.map((e) => t`(${X(e, t, n)})`).reduce((e, n, i) => i === 0 ? n : t`${e} ${t.unsafe(r)} ${n}`), a = [];
-		if (V(e).length > 0 && a.push(t` ORDER BY ${t.csv(V(e).map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), e.take !== void 0) {
+		let r = e.setOp.kind === "union" ? "UNION" : e.setOp.kind === "union-all" ? "UNION ALL" : e.setOp.kind === "intersect" ? "INTERSECT" : "EXCEPT", i = e.setOp.queries.map((e) => t`(${Y(e, t, n)})`).reduce((e, n, i) => i === 0 ? n : t`${e} ${t.unsafe(r)} ${n}`), a = [];
+		if (z(e).length > 0 && a.push(t` ORDER BY ${t.csv(z(e).map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), e.take !== void 0) {
 			if (!Number.isInteger(e.take) || e.take < 0) throw E(`compileSelect: invalid take ${e.take}`);
 			a.push(t` LIMIT ${t.unsafe(String(e.take))}`);
 		}
@@ -1753,7 +1781,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		}
 		return t`${i}${a.reduce((e, n) => t`${e}${n}`, t``)}`;
 	}
-	let r = e.annClause === void 0 ? null : Mn(e.annClause, t);
+	let r = e.annClause === void 0 ? null : Ln(e.annClause, t);
 	e.spatialClause !== void 0 && t.onDialectOrElse({
 		mysql: () => {
 			throw E("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
@@ -1766,13 +1794,13 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		},
 		orElse: () => t``
 	});
-	let i = e.spatialClause?.projectAs === void 0 ? null : Nn(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? An(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((n) => {
+	let i = e.spatialClause?.projectAs === void 0 ? null : Rn(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? Fn(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((n) => {
 		let r = t`${t(n.source)}`;
-		return t`${Vn(n.source, e) === "bigint" ? t.onDialectOrElse({
+		return t`${Mn(n.source, e)?.type === "bigint" ? t.onDialectOrElse({
 			sqlite: () => t`CAST(${r} AS TEXT)`,
 			orElse: () => r
 		}) : r} AS ${t(n.outputKey)}`;
-	})) : Bn(e.table, t, e.projection), o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? zn(c, e.table, t) : null, u = l !== null && c?.rank !== void 0 ? t`${s}, ${l} AS ${t(c.rank.alias)}` : s, d = i !== null && !o && e.spatialClause?.projectAs !== void 0 ? t`${u}, ${i} AS ${t(e.spatialClause.projectAs)}` : u, f = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
+	})) : Gn((e.sourceTable?.tableName === e.table ? e.sourceTable : R(e.table))?.fields, t, e.projection, (e.joins?.length ?? 0) > 0 ? e.alias ?? e.table : void 0), o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? Wn(c, e.table, t) : null, u = l !== null && c?.rank !== void 0 ? t`${s}, ${l} AS ${t(c.rank.alias)}` : s, d = i !== null && !o && e.spatialClause?.projectAs !== void 0 ? t`${u}, ${i} AS ${t(e.spatialClause.projectAs)}` : u, f = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
 		orElse: () => t`DISTINCT ON (${t.csv(e.distinctOn.map((e) => t`${t(e)}`))}) `,
 		mysql: () => t`DISTINCT `,
 		mssql: () => t`DISTINCT `,
@@ -1784,13 +1812,13 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		mssql: () => t``,
 		sqlite: () => t``,
 		orElse: () => t` FOR UPDATE`
-	}) : t``, g = e.alias === void 0 ? t`${t(K(n, e.table))}${m}` : t`${t(K(n, e.table))} AS ${t(e.alias)}${m}`, ee = (e.joins ?? []).map((e) => {
+	}) : t``, g = e.alias === void 0 ? t`${t(G(n, e.table))}${m}` : t`${t(G(n, e.table))} AS ${t(e.alias)}${m}`, ee = (e.joins ?? []).map((e) => {
 		let r = e.kind === "inner" ? "INNER" : "LEFT";
-		return t` ${t.unsafe(r)} JOIN ${t(K(n, e.table))} AS ${t(e.alias)} ON ${J(e.on, t, n)}`;
-	}), te = ee.length > 0 ? ee.reduce((e, n) => t`${e}${n}`, g) : g, ne = c === void 0 ? null : Rn(c, e.table, t), _ = [e.predicate ? J(e.predicate, t, n, e.table) : null, ne].filter((e) => e !== null), v = _.length > 0 ? t` WHERE ${t.and(_)}` : t``, re = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, y = e.having ? t` HAVING ${J(e.having, t, n, e.table)}` : t``, b = e.skip !== void 0, x = [];
-	r !== null && x.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && x.push(e.spatialClause.order === "desc" ? t`${Pn(e.spatialClause, t)} DESC` : t`${Pn(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && x.push(t`${l} DESC`);
-	for (let n of V(e)) {
-		let r = e.joinedProjection?.find((e) => e.outputKey === n.column)?.source ?? n.column, i = !o && Vn(r, e) === "bigint" ? t.onDialectOrElse({
+		return t` ${t.unsafe(r)} JOIN ${t(G(n, e.table))} AS ${t(e.alias)} ON ${q(e.on, t, n)}`;
+	}), te = ee.length > 0 ? ee.reduce((e, n) => t`${e}${n}`, g) : g, ne = c === void 0 ? null : Un(c, e.table, t), _ = [e.predicate ? q(e.predicate, t, n, e.table) : null, ne].filter((e) => e !== null), v = _.length > 0 ? t` WHERE ${t.and(_)}` : t``, re = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, y = e.having ? t` HAVING ${q(e.having, t, n, e.table)}` : t``, b = e.skip !== void 0, x = [];
+	r !== null && x.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && x.push(e.spatialClause.order === "desc" ? t`${zn(e.spatialClause, t)} DESC` : t`${zn(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && x.push(t`${l} DESC`);
+	for (let n of z(e)) {
+		let r = e.joinedProjection?.find((e) => e.outputKey === n.column)?.source ?? n.column, i = !o && Mn(r, e)?.type === "bigint" ? t.onDialectOrElse({
 			sqlite: () => t`${t(r.includes(".") ? r : `${e.alias ?? e.table}.${r}`)}`,
 			orElse: () => t`${t(n.column)}`
 		}) : t`${t(n.column)}`;
@@ -1802,18 +1830,22 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	}) : t``, S = (e) => {
 		if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw E(`compileSelect: expected non-negative integer take/skip, got ${e}`);
 		return t.unsafe(String(e));
-	}, ae = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${X(e.descriptor, t, n)})`), oe = (e.ctes ?? []).some((e) => e.recursive === !0), se = ae.length > 0 ? t`WITH ${t.unsafe(oe ? "RECURSIVE " : "")}${t.csv(ae)} ` : t``;
+	}, ae = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${Y(e.descriptor, t, n)})`), oe = (e.ctes ?? []).some((e) => e.recursive === !0), se = ae.length > 0 ? t`WITH ${t.unsafe(oe ? "RECURSIVE " : "")}${t.csv(ae)} ` : t``;
 	return t.onDialectOrElse({
 		mssql: () => {
 			let n = e.take !== void 0 && !b ? t`TOP ${S(e.take)} ` : t``, r = b ? t` OFFSET ${S(e.skip)} ROWS FETCH NEXT ${S(e.take ?? 2 ** 53 - 1)} ROWS ONLY` : t``;
 			return t`${se}SELECT ${n}${f}${d} FROM ${te}${v}${re}${y}${ie}${r}`;
 		},
 		orElse: () => {
-			let n = e.take === void 0 ? t`` : t` LIMIT ${S(e.take)}`, r = b ? t` OFFSET ${S(e.skip)}` : t``;
+			let n = e.take === void 0 ? b ? t.onDialectOrElse({
+				sqlite: () => t` LIMIT -1`,
+				mysql: () => t` LIMIT 18446744073709551615`,
+				orElse: () => t``
+			}) : t`` : t` LIMIT ${S(e.take)}`, r = b ? t` OFFSET ${S(e.skip)}` : t``;
 			return t`${se}SELECT ${f}${d} FROM ${te}${v}${re}${y}${ie}${n}${r}${h}`;
 		}
 	});
-}, Z = (e, t) => {
+}, X = (e, t) => {
 	let n = (e) => {
 		if (typeof e != "string" || !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)$/.test(e)) return null;
 		let [t = "", n = ""] = e.replace(/^[+-]/, "").split("."), r = t.replace(/^0+/, "") || "0";
@@ -1831,73 +1863,73 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		a = t === n ? 0 : t > n ? 1 : -1;
 	}
 	return a === 0 ? 0 : (a > 0 ? 1 : -1) * (r.negative ? -1 : 1);
-}, Hn = (e, t) => ({
+}, qn = (e, t) => ({
 	column: e,
 	op: "eq",
 	value: t
-}), Un = (e, t) => ({
+}), Jn = (e, t) => ({
 	column: e,
 	op: "neq",
 	value: t
-}), Wn = (e, t) => ({
+}), Yn = (e, t) => ({
 	column: e,
 	op: "gt",
 	value: t
-}), Gn = (e, t) => ({
+}), Xn = (e, t) => ({
 	column: e,
 	op: "gte",
 	value: t
-}), Kn = (e, t) => ({
+}), Zn = (e, t) => ({
 	column: e,
 	op: "lt",
 	value: t
-}), qn = (e, t) => ({
+}), Qn = (e, t) => ({
 	column: e,
 	op: "lte",
 	value: t
-}), Jn = (e, t) => ({
+}), $n = (e, t) => ({
 	column: e,
 	op: "in",
 	value: t
-}), Yn = (e, t) => ({
+}), er = (e, t) => ({
 	column: e,
 	op: "notIn",
 	value: t
-}), Xn = (e, t) => ({
+}), tr = (e, t) => ({
 	column: e,
 	op: "contains",
 	value: t
-}), Zn = (e, t) => ({
+}), nr = (e, t) => ({
 	column: e,
 	op: "startsWith",
 	value: t
-}), Qn = (e, t) => ({
+}), rr = (e, t) => ({
 	column: e,
 	op: "arrayContains",
 	value: t
-}), $n = (e, t) => ({
+}), ir = (e, t) => ({
 	column: e,
 	op: "arrayOverlaps",
 	value: t
-}), er = (e, t) => ({
+}), ar = (e, t) => ({
 	column: e,
 	op: "arrayHas",
 	value: t
-}), tr = {
+}), or = {
 	column: "id",
 	op: "in",
 	value: []
-}, nr = (e) => ({
+}, sr = (e) => ({
 	column: e,
 	op: "isNull"
-}), rr = (e) => ({
+}), cr = (e) => ({
 	column: e,
 	op: "isNotNull"
-}), ir = (e, t) => ({
+}), lr = (e, t) => ({
 	column: e,
 	op: "spatial",
 	value: t
-}), ar = (...e) => ({ and: e }), or = (...e) => ({ or: e }), sr = (e) => ({ not: e }), cr = (e, ...t) => {
+}), ur = (...e) => ({ and: e }), dr = (...e) => ({ or: e }), fr = (e) => ({ not: e }), pr = (e, ...t) => {
 	if (t.length === 0) throw E(`jsonField("${e}"): at least one path segment is required`);
 	let n = (n, r) => ({
 		column: e,
@@ -1919,56 +1951,69 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		isNull: () => n("isNull"),
 		isNotNull: () => n("isNotNull")
 	};
-}, Q = (e) => "descriptor" in e ? e.descriptor : e, lr = (e, t) => ({
+}, Z = (e) => "descriptor" in e ? e.descriptor : e, mr = (e, t) => ({
 	column: e,
 	op: "subquery-in",
-	subquery: Q(t)
-}), ur = (e, t) => ({
+	subquery: Z(t)
+}), hr = (e, t) => ({
 	column: e,
 	op: "subquery-not-in",
-	subquery: Q(t)
-}), dr = (e) => ({
+	subquery: Z(t)
+}), gr = (e) => ({
 	op: "exists",
-	subquery: Q(e)
-}), fr = (e) => ({
+	subquery: Z(e)
+}), _r = (e) => ({
 	op: "not-exists",
-	subquery: Q(e)
-}), pr = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, mr = (e) => {
+	subquery: Z(e)
+}), vr = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, yr = (e) => {
 	if (e instanceof Date) return e.getTime();
-	if (typeof e == "string" && pr.test(e)) {
+	if (typeof e == "string" && vr.test(e)) {
 		let t = Date.parse(e);
 		return Number.isNaN(t) ? void 0 : t;
 	}
-}, hr = (e, t) => {
+}, br = (e, t) => {
 	if (!(e instanceof Date) && !(t instanceof Date)) return;
-	let n = mr(e), r = mr(t);
+	let n = yr(e), r = yr(t);
 	return n === void 0 || r === void 0 ? void 0 : [n, r];
-}, gr = (e, t) => {
+}, xr = (e, t) => {
 	if (e === t) return !0;
-	let n = hr(e, t);
+	let n = br(e, t);
 	return n !== void 0 && n[0] === n[1];
-}, _r = (e, t) => {
+}, Sr = (e, t) => {
 	if (e == null || t == null) return null;
-	let n = hr(e, t);
+	let n = br(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;
-}, $ = (e, t, n = null, r = {}) => {
+}, Cr = (e, t, n = null, r = {}) => Q(e, t, n, r) === !0, Q = (e, t, n = null, r = {}) => {
 	if (!t) return !1;
-	if ("not" in e) return !$(e.not, t, n, r);
+	if ("not" in e) {
+		let i = Q(e.not, t, n, r);
+		return i === null ? null : !i;
+	}
 	if ("and" in e) {
-		for (let i of e.and) if (!$(i, t, n, r)) return !1;
-		return !0;
+		let i = !1;
+		for (let a of e.and) {
+			let e = Q(a, t, n, r);
+			if (e === !1) return !1;
+			e === null && (i = !0);
+		}
+		return !i || null;
 	}
 	if ("or" in e) {
-		for (let i of e.or) if ($(i, t, n, r)) return !0;
-		return !1;
+		let i = !1;
+		for (let a of e.or) {
+			let e = Q(a, t, n, r);
+			if (e === !0) return !0;
+			e === null && (i = !0);
+		}
+		return i ? 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) => Z(a, e) === 0) : i.has(a);
+		let a = t[e.column], o = r[e.column]?.type === "decimal" ? [...i].some((e) => X(a, e) === 0) : i.has(a);
 		return e.op === "subquery-in" ? o : !o;
 	}
 	if (e.op === "exists" || e.op === "not-exists") {
@@ -1976,42 +2021,46 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		let t = n.get(e.subquery), r = typeof t == "number" ? t > 0 : t instanceof Set && t.size > 0;
 		return e.op === "exists" ? r : !r;
 	}
-	let i = e, a = t[i.column], o = r[i.column]?.type === "decimal", s = (e, t) => o && e != null && t != null ? Z(e, t) === 0 : gr(e, t), c = o ? Z : _r;
+	let i = e, a = t[i.column], o = U(i.value) ? i.value : void 0;
+	if (o !== void 0 && (!_n.some((e) => e === i.op) || i.path !== void 0)) throw E("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 ? X(e, t) === 0 : xr(e, t), u = c ? X : Sr;
 	switch (i.op) {
-		case "eq": return s(a, i.value);
-		case "neq": return !s(a, i.value);
-		case "gt": return (c(a, i.value) ?? -1) > 0;
-		case "gte": return (c(a, i.value) ?? -1) >= 0;
-		case "lt": return (c(a, i.value) ?? 1) < 0;
-		case "lte": return (c(a, i.value) ?? 1) <= 0;
-		case "in": return Array.isArray(i.value) && i.value.some((e) => s(a, e));
-		case "notIn": return Array.isArray(i.value) && !i.value.some((e) => s(a, e));
-		case "contains": return typeof a == "string" && typeof i.value == "string" && a.toLowerCase().includes(i.value.toLowerCase());
-		case "startsWith": return typeof a == "string" && typeof i.value == "string" && a.startsWith(i.value);
+		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);
 		case "arrayContains": {
 			let e = Array.isArray(a) ? a : [];
-			return (Array.isArray(i.value) ? i.value : []).every((t) => e.includes(t));
+			return (Array.isArray(s) ? s : []).every((t) => e.includes(t));
 		}
 		case "arrayOverlaps": {
 			let e = Array.isArray(a) ? a : [];
-			return (Array.isArray(i.value) ? i.value : []).some((t) => e.includes(t));
+			return (Array.isArray(s) ? s : []).some((t) => e.includes(t));
 		}
-		case "arrayHas": return Array.isArray(a) && a.includes(i.value);
+		case "arrayHas": return Array.isArray(a) && a.includes(s);
 		case "isNull": return a == null;
 		case "isNotNull": return a != null;
 		case "spatial": throw E("@voltro/plugin-postgis: spatial predicates (ST_DWithin / ST_Contains / ST_Within / ST_Intersects / bbox &&) are not evaluable in-memory — use them in one-shot ctx.store.query reads, not reactive subscriptions.");
 	}
-}, vr = function* (e) {
+}, $ = function* (e) {
 	if ("not" in e) {
-		yield* vr(e.not);
+		yield* $(e.not);
 		return;
 	}
 	if ("and" in e) {
-		for (let t of e.and) yield* vr(t);
+		for (let t of e.and) yield* $(t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* vr(t);
+		for (let t of e.or) yield* $(t);
 		return;
 	}
 	e.op === "subquery-in" || e.op === "subquery-not-in" ? yield {
@@ -2021,30 +2070,30 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		kind: "exists",
 		descriptor: e.subquery
 	});
-}, yr = function* (e, t = !0) {
+}, wr = function* (e, t = !0) {
 	if ("not" in e) {
-		yield* yr(e.not, !1);
+		yield* wr(e.not, !1);
 		return;
 	}
 	if ("and" in e) {
-		for (let n of e.and) yield* yr(n, t);
+		for (let n of e.and) yield* wr(n, t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* yr(t, !1);
+		for (let t of e.or) yield* wr(t, !1);
 		return;
 	}
 	e.op !== "subquery-in" && e.op !== "subquery-not-in" && e.op !== "exists" && e.op !== "not-exists" && (yield {
 		...e,
-		conjunctive: t
+		conjunctive: t && !U(e.value)
 	});
-}, br = (e, t) => ({
+}, Tr = (e, t) => ({
 	name: e,
 	body: t
-}), xr = (e) => {
+}), Er = (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: br });
+	let t = e.steps({ step: Tr });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -2057,76 +2106,76 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, Sr = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Cr = null, wr = null, Tr = (e) => {
-	Cr = e;
-}, Er = (e) => {
-	wr = e;
-}, Dr = async (e) => {
-	let t = Cr;
+}, Dr = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Or = null, kr = null, Ar = (e) => {
+	Or = e;
+}, jr = (e) => {
+	kr = e;
+}, Mr = async (e) => {
+	let t = Or;
 	t !== null && await t(e);
-}, Or = async (e) => {
-	let t = wr;
+}, Nr = async (e) => {
+	let t = kr;
 	t !== null && e.changedTables.length !== 0 && await t(e);
-}, kr = ["before-schema", "after-schema"], Ar = (e) => {
+}, Pr = ["before-schema", "after-schema"], Fr = (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 (!kr.includes(e.phase)) throw Error(`migration ${e.id}: \`phase\` is required and must be one of ${kr.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 (!Pr.includes(e.phase)) throw Error(`migration ${e.id}: \`phase\` is required and must be one of ${Pr.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;
-}, jr = Symbol.for("voltro.migration.irreversible"), Mr = class extends Error {
+}, Ir = Symbol.for("voltro.migration.irreversible"), Lr = 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";
 	}
-}, Nr = (e) => {
+}, Rr = (e) => {
 	if (!e || e.trim().length === 0) throw Error("irreversible(): a reason is required");
-	return Object.assign(() => t.fail(new Mr("<unknown>", e)), { [jr]: e });
-}, Pr = (e) => {
-	let t = e[jr];
+	return Object.assign(() => t.fail(new Lr("<unknown>", e)), { [Ir]: e });
+}, zr = (e) => {
+	let t = e[Ir];
 	return typeof t == "string" ? t : void 0;
-}, Fr = class {
+}, Br = class {
 	reason;
 	_tag = "MigrationSkipped";
 	constructor(e) {
 		this.reason = e;
 	}
-}, Ir = class extends Error {
+}, Vr = 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";
 	}
-}, Lr = class extends Error {
+}, Hr = 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";
 	}
-}, Rr = class extends Error {
+}, Ur = 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";
 	}
-}, zr = class extends Error {
+}, Wr = 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";
 	}
-}, Br = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Vr = (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", Hr = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Ur = (e) => Hr.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Wr = "_voltro_staging_", Gr = (e) => e.startsWith(Wr), Kr = /__dropped_\d{14}$/, qr = (e) => Kr.test(e), Jr = 7, Yr = (e) => {
+}, Gr = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Kr = (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", qr = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Jr = (e) => qr.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Yr = "_voltro_staging_", Xr = (e) => e.startsWith(Yr), Zr = /__dropped_\d{14}$/, Qr = (e) => Zr.test(e), $r = 7, ei = (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)));
-}, Xr = (e, t = {}) => {
+}, ti = (e, t = {}) => {
 	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
-		let a = Yr(e);
+		let a = ei(e);
 		if (a === void 0) return;
 		let o = Math.floor((n.getTime() - a.getTime()) / 864e5);
 		o >= r && i.push({
@@ -2135,12 +2184,12 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			ageDays: o
 		});
 	};
-	for (let t of e.tables) if (a(t.name, t.name), !qr(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), !Qr(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
 	return i;
-}, Zr = (e, t) => {
+}, ni = (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.`;
-}, Qr = (e, t) => e.filter((e) => !Ur(e.name) || t.has(e.name)), $r = L("_voltro_migrations", {
+}, ri = (e, t) => e.filter((e) => !Jr(e.name) || t.has(e.name)), ii = F("_voltro_migrations", {
 	id: f({ prefix: "mig" }),
 	name: p(),
 	hash: p(),
@@ -2152,7 +2201,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	workflowRunId: p().nullable(),
 	createdAt: v().default("now"),
 	updatedAt: v().default("now").onUpdate("now")
-}).index(["status"]), ei = L("_voltro_seeds", {
+}).index(["status"]), ai = F("_voltro_seeds", {
 	id: f({ prefix: "seed" }),
 	name: p(),
 	lifecycle: p(),
@@ -2168,19 +2217,19 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	workflowRunId: p().nullable(),
 	createdAt: v().default("now"),
 	updatedAt: v().default("now").onUpdate("now")
-}).index(["lifecycle"]).index(["nextRunAt"]), ti = L("_voltro_schema_owner", {
+}).index(["lifecycle"]).index(["nextRunAt"]), oi = F("_voltro_schema_owner", {
 	id: f({ prefix: "own" }),
 	appName: p(),
 	projectName: p().nullable(),
 	frameworkVersion: p().nullable(),
 	claimedAt: v().default("now")
-}), ni = L("_voltro_plugin_migrations", {
+}), si = F("_voltro_plugin_migrations", {
 	id: f({ prefix: "plm" }),
 	plugin_name: p(),
 	migration_id: p(),
 	description: p().nullable(),
 	applied_at: p()
-}), ri = L("_voltro_migration_plans", {
+}), ci = F("_voltro_migration_plans", {
 	id: f({ prefix: "plan" }),
 	fingerprint: p(),
 	liveFingerprint: p().nullable(),
@@ -2196,14 +2245,14 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	appliedAt: v().default("now"),
 	createdAt: v().default("now"),
 	updatedAt: v().default("now").onUpdate("now")
-}).index(["fingerprint"]).index(["environment"]), ii = L("_voltro_idempotency", {
+}).index(["fingerprint"]).index(["environment"]), li = F("_voltro_idempotency", {
 	id: f({ prefix: "idem" }),
 	scope: p(),
 	key: p(),
 	status: p(),
 	response: y().nullable(),
 	createdAt: v().default("now")
-}).unique(["scope", "key"]).index(["createdAt"]), ai = L("_voltro_devices", {
+}).unique(["scope", "key"]).index(["createdAt"]), ui = F("_voltro_devices", {
 	id: f({ prefix: "device" }),
 	tenantId: p(),
 	name: p(),
@@ -2223,20 +2272,20 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	createdBy: p().nullable(),
 	metadata: y().nullable(),
 	createdAt: v()
-}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), oi = L("_voltro_tenant_selections", {
+}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), di = F("_voltro_tenant_selections", {
 	id: f({ prefix: "tsel" }),
 	subjectType: p().maxLength(32),
 	subjectId: p(),
 	tenantId: p(),
 	selectedAt: v()
-}).primaryKey(["id"]).nonReactive(), si = L("_voltro_kv", {
+}).primaryKey(["id"]).nonReactive(), fi = F("_voltro_kv", {
 	id: f({ prefix: "kv" }),
 	key: p().unique(),
 	value: p().nullable(),
 	expiresAt: v().nullable(),
 	createdAt: v().default("now"),
 	updatedAt: v().default("now").onUpdate("now")
-}).index(["expiresAt"]), ci = L("_voltro_api_keys", {
+}).index(["expiresAt"]), pi = F("_voltro_api_keys", {
 	id: f({ prefix: "apikey" }),
 	tenantId: p().nullable(),
 	name: p(),
@@ -2251,7 +2300,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	onBehalfOf: p().nullable(),
 	metadata: y().nullable(),
 	createdAt: v().default("now")
-}).index("byApiKeyTenant", ["tenantId"]), li = L("_voltro_replica_observations", {
+}).index("byApiKeyTenant", ["tenantId"]), mi = F("_voltro_replica_observations", {
 	id: f({ prefix: "robs" }),
 	replicaId: p().maxLength(191),
 	startedAt: v(),
@@ -2260,11 +2309,11 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	payload: p().nullable(),
 	reachableAt: p().maxLength(255).nullable(),
 	writtenAt: v().default("now").onUpdate("now")
-}).unique(["replicaId", "kind"]).index(["kind"]), ui = [
-	$r,
-	ei,
-	ri
-], di = "_voltro_replace_in_progress", fi = L(di, {
+}).unique(["replicaId", "kind"]).index(["kind"]), hi = [
+	ii,
+	ai,
+	ci
+], gi = "_voltro_replace_in_progress", _i = F(gi, {
 	id: f({ prefix: "repl" }),
 	startedAt: v().default("now"),
 	kind: p().default("replace"),
@@ -2274,10 +2323,10 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	staging: p().nullable(),
 	heartbeatAt: v().nullable(),
 	resumable: _().nullable()
-}).nonReactive(), pi = 30, mi = (e, t) => {
+}).nonReactive(), vi = 30, yi = (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;
-}, hi = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), gi = (e) => {
+}, bi = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), xi = (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) => {
@@ -2292,7 +2341,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`;
-}, _i = (e, t, n) => {
+}, Si = (e, t, n) => {
 	let r = e.filter((e) => e.kind === "staging");
 	return {
 		all: r,
@@ -2302,7 +2351,7 @@ ${t.map((e) => {
 			return Number.isFinite(r) ? t - r >= n : !1;
 		})
 	};
-}, vi = (e, t) => {
+}, Ci = (e, t) => {
 	if (e.all.length === 0) return;
 	let n = new Set(e.droppable.map((e) => e.id));
 	return `staged data-import leftovers:
@@ -2313,4 +2362,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 { $n as $, Re as $n, Vt as $t, Yr as A, L as An, C as Ar, Dn as At, Pr as B, Be as Bn, ce as Br, un as Bt, Wr as C, Ot as Cn, se as Cr, Z as Ct, qr as D, R as Dn, m as Dr, X as Dt, Ur as E, yt as En, f as Er, Bn as Et, Rr as F, at as Fn, oe as Fr, Sn as Ft, Dr as G, j as Gn, rn as Gt, Ar as H, He as Hn, en as Ht, Fr as I, st as In, ae as Ir, G as It, Tr as J, De as Jn, Lt as Jt, Sr as K, P as Kn, Pt as Kt, zr as L, ot as Ln, o as Lr, mn as Lt, Mr as M, lt as Mn, pe as Mr, vn as Mt, kr as N, ct as Nn, c as Nr, K as Nt, Gr as O, pt as On, ue as Or, q as Ot, Ir as P, ut as Pn, h as Pr, Cn as Pt, er as Q, Le as Qn, Wt as Qt, Lr as R, it as Rn, p as Rr, ln as Rt, Hr as S, Et as Sn, g as Sr, yr as St, Zr as T, bt as Tn, fe as Tr, On as Tt, xr as U, M as Un, nn as Ut, Vr as V, Ve as Vn, pn as Vt, Or as W, N as Wn, tn as Wt, ar as X, Ne as Xn, Mt as Xt, tr as Y, T as Yn, jt as Yt, Qn as Z, Ie as Zn, $t as Zt, ti as _, kt as _n, l as _r, Yn as _t, vi as a, V as an, be as ar, Wn as at, ui as b, At as bn, re as br, ir as bt, mi as c, Xt as cn, ge as cr, lr as ct, ii as d, Ht as dn, S as dr, cr as dt, Bt as en, we as er, vr as et, si as f, Nt as fn, le as fr, Kn as ft, li as g, Dt as gn, ie as gr, fr as gt, ni as h, zt as hn, b as hr, sr as ht, gi as i, Ft as in, ye as ir, dr as it, Br as j, ft as jn, ee as jr, yn as jt, Qr as k, dt as kn, y as kr, En as kt, ci as l, Ut as ln, he as lr, rr as lt, $r as m, Rt as mn, _ as mr, Un as mt, pi as n, Kt as nn, Fe as nr, Hn as nt, _i as o, Qt as on, _e as or, Gn as ot, ri as p, qt as pn, te as pr, qn as pt, Er as q, E as qn, Jt as qt, fi as r, It as rn, Te as rr, $ as rt, hi as s, Zt as sn, ve as sr, Jn as st, di as t, Gt as tn, Pe as tr, Xn as tt, ai as u, Yt as un, u as ur, nr as ut, ei as v, Tt as vn, s as vr, ur as vt, Xr as w, xt as wn, de as wr, J as wt, Jr as x, wt as xn, ne as xr, Zn as xt, oi as y, B as yn, x as yr, or as yt, Nr as z, tt as zn, v as zr, dn as zt };
+export { ir as $, Ie as $n, tn as $t, ei as A, ht as An, ue as Ar, jn as At, zr as B, ot as Bn, p as Br, dn as Bt, Yr as C, Et as Cn, ne as Cr, X as Ct, Qr as D, St as Dn, fe as Dr, Y as Dt, Jr as E, Ct as En, de as Er, Kn as Et, Ur as F, ut as Fn, c as Fr, En as Ft, Mr as G, M as Gn, an as Gt, Fr as H, Be as Hn, ce as Hr, fn as Ht, Br as I, ft as In, h as Ir, W as It, Ar as J, Ge as Jn, It as Jt, Dr as K, N as Kn, rn as Kt, Wr as L, st as Ln, oe as Lr, vn as Lt, Lr as M, F as Mn, C as Mr, Sn as Mt, Pr as N, mt as Nn, ee as Nr, G as Nt, Xr as O, xt as On, f as Or, K as Ot, Vr as P, dt as Pn, pe as Pr, Dn as Pt, ar as Q, Ne as Qn, Pt as Qt, Hr as R, lt as Rn, ae as Rr, gn as Rt, qr as S, Mt as Sn, re as Sr, wr as St, ni as T, At as Tn, se as Tr, Nn as Tt, Er as U, Ve as Un, hn as Ut, Kr as V, rt as Vn, v as Vr, pn as Vt, Nr as W, He as Wn, nn as Wt, ur as X, De as Xn, zt as Xt, or as Y, E as Yn, Xt as Yt, rr as Z, T as Zn, Nt as Zt, oi as _, Vt as _n, b as _r, er as _t, Ci as a, Rt as an, Te as ar, Yn as at, hi as b, Dt as bn, s as br, lr as bt, yi as c, en as cn, _e as cr, mr as ct, li as d, Gt as dn, he as dr, pr as dt, Kt as en, Le as er, $ as et, fi as f, Zt as fn, u as fr, Zn as ft, mi as g, Bt as gn, _ as gr, _r as gt, si as h, Yt as hn, te as hr, fr as ht, xi as i, Jt as in, Fe as ir, gr as it, Gr as j, pt as jn, y as jr, Cn as jt, ri as k, I as kn, m as kr, An as kt, pi as l, $t as ln, ve as lr, cr as lt, ii as m, Ft as mn, le as mr, Jn as mt, vi as n, Ht as nn, we as nr, qn as nt, Si as o, Lt as on, ye as or, Xn as ot, ci as p, Wt as pn, S as pr, Qn as pt, jr as q, j as qn, on as qt, _i as r, qt as rn, Pe as rr, Cr as rt, bi as s, z as sn, be as sr, $n as st, gi as t, Ut as tn, Re as tr, tr as tt, ui as u, Qt as un, ge as ur, sr as ut, ai as v, kt as vn, ie as vr, hr as vt, ti as w, Ot as wn, g as wr, q as wt, $r as x, R as xn, x as xr, nr as xt, di as y, jt as yn, l as yr, dr as yt, Rr as z, ct as zn, o as zr, U as zt };