@voltro/database 0.56.0 → 0.58.0

package/dist/index.js

@@ -311,7 +311,22 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	if (globalThis.Buffer !== void 0 && globalThis.Buffer.isBuffer(e)) return "Buffer";
 	let t = e.constructor?.name;
 	return typeof t == "string" && t !== "" ? t : "Object";
-}, yn = (e) => {
+}, yn = Symbol.for("@voltro/database/storeRefusal"), bn = (e) => {
+	let t = Error(e.detail);
+	return Object.defineProperty(t, yn, {
+		value: e,
+		enumerable: !1
+	}), t;
+}, xn = (e) => {
+	for (let t of sn(e)) {
+		let e = t;
+		for (let t = 0; e != null && t < 8; t += 1) {
+			let t = e[yn];
+			if (t !== void 0) return t;
+			e = e.cause;
+		}
+	}
+}, Sn = (e) => {
 	let t = (() => {
 		switch (e.type) {
 			case "id":
@@ -332,41 +347,41 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		}
 	})();
 	return e.nullable === !0 ? A.NullOr(t) : t;
-}, bn = (e, t) => {
+}, Cn = (e, t) => {
 	let n = new Set(t?.omit ?? []), r = {};
-	for (let [t, i] of Object.entries(e.fields)) n.has(t) || (r[t] = yn(i));
+	for (let [t, i] of Object.entries(e.fields)) n.has(t) || (r[t] = Sn(i));
 	return A.Struct(r);
-}, xn = (e) => typeof e == "function" ? e : () => e, Sn = (e, t) => ({
+}, wn = (e) => typeof e == "function" ? e : () => e, Tn = (e, t) => ({
 	kind: "one",
-	target: xn(e),
+	target: wn(e),
 	...t?.foreignKey === void 0 ? {} : { foreignKey: t.foreignKey },
 	...t?.sourceKey === void 0 ? {} : { sourceKey: t.sourceKey }
-}), Cn = (e, t) => ({
+}), En = (e, t) => ({
 	kind: "many",
-	target: xn(e),
+	target: wn(e),
 	...t?.foreignKey === void 0 ? {} : { foreignKey: t.foreignKey },
 	...t?.sourceKey === void 0 ? {} : { sourceKey: t.sourceKey }
-}), wn = (e, t) => ({
+}), Dn = (e, t) => ({
 	kind: "manyToMany",
-	target: xn(e),
-	through: xn(t.through),
+	target: wn(e),
+	through: wn(t.through),
 	sourceKey: t.sourceKey,
 	targetKey: t.targetKey
-}), Tn = {
-	one: Sn,
-	many: Cn,
-	manyToMany: wn
-}, En = (e, t) => {
+}), On = {
+	one: Tn,
+	many: En,
+	manyToMany: Dn
+}, kn = (e, t) => {
 	let n = typeof e == "function" ? e : () => e;
 	return {
 		source: n,
-		relations: t(Tn, n())
+		relations: t(On, n())
 	};
-}, Dn = (e) => {
+}, An = (e) => {
 	if (typeof e != "object" || !e) return !1;
 	let t = e;
 	return typeof t.source != "function" || typeof t.relations != "object" || t.relations === null ? !1 : Object.keys(t.relations).length === 0;
-}, On = (e) => {
+}, jn = (e) => {
 	if (typeof e != "object" || !e) return !1;
 	let t = e;
 	if (typeof t.source != "function" || typeof t.relations != "object" || t.relations === null) return !1;
@@ -375,35 +390,35 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		let t = e?.kind;
 		return t === "one" || t === "many" || t === "manyToMany";
 	});
-}, kn = Sn, An = Cn, jn = wn, P = (e, t, n) => {
+}, Mn = Tn, Nn = En, Pn = Dn, Fn = (e, t, n) => {
 	let r = [];
 	for (let [n, i] of Object.entries(e.fields)) i.type === "reference" && i.references?.()?.tableName === t && r.push(n);
 	if (r.length === 0) throw Error(`relation '${n}': no reference() column on '${e.tableName}' points at '${t}'. Either add one or pass an explicit { foreignKey: '<column>' }.`);
 	if (r.length > 1) throw Error(`relation '${n}': multiple reference() columns on '${e.tableName}' point at '${t}' (${r.join(", ")}). Pass an explicit { foreignKey: '<column>' } to disambiguate.`);
 	return r[0];
-}, Mn = (e) => Object.keys(e.fields), Nn = (e, t) => Object.prototype.hasOwnProperty.call(e.fields, t), Pn = (e) => {
-	let t = Mn(e);
+}, In = (e) => Object.keys(e.fields), Ln = (e, t) => Object.prototype.hasOwnProperty.call(e.fields, t), Rn = (e) => {
+	let t = In(e);
 	return t.length === 0 ? "<none>" : t.join(", ");
-}, Fn = (e, t, n) => {
+}, zn = (e, t, n) => {
 	let r = `relation '${t}' on '${e.tableName}'`, i = n.target();
 	if (n.kind === "manyToMany") {
 		let t = n.through();
-		for (let [a, o] of [["sourceKey", n.sourceKey], ["targetKey", n.targetKey]]) if (!Nn(t, o)) throw Error(`${r}: manyToMany ${a} '${o}' is not a column on the junction table '${t.tableName}'. Both keys name columns on the JUNCTION — ${a === "sourceKey" ? `sourceKey points at '${e.tableName}'` : `targetKey points at '${i.tableName}'`}. Columns on '${t.tableName}': ${Pn(t)}.`);
+		for (let [a, o] of [["sourceKey", n.sourceKey], ["targetKey", n.targetKey]]) if (!Ln(t, o)) throw Error(`${r}: manyToMany ${a} '${o}' is not a column on the junction table '${t.tableName}'. Both keys name columns on the JUNCTION — ${a === "sourceKey" ? `sourceKey points at '${e.tableName}'` : `targetKey points at '${i.tableName}'`}. Columns on '${t.tableName}': ${Rn(t)}.`);
 		return;
 	}
 	if (n.sourceKey !== void 0 && n.foreignKey !== void 0) throw Error(`${r}: pass EITHER sourceKey OR foreignKey, not both. sourceKey '${n.sourceKey}' names a column on the source ('${e.tableName}') holding the target's id; foreignKey '${n.foreignKey}' names a column on the target ('${i.tableName}') holding the source's id. With both, foreignKey is ignored.`);
-	if (n.sourceKey !== void 0 && !Nn(e, n.sourceKey)) {
-		let t = Nn(i, n.sourceKey);
-		throw Error(`${r}: sourceKey '${n.sourceKey}' is not a column on the source table '${e.tableName}'.` + (t ? ` It IS a column on the target '${i.tableName}' — you probably want { foreignKey: '${n.sourceKey}' }, which names the column on the TARGET that holds this table's id.` : ` Columns on '${e.tableName}': ${Pn(e)}.`));
+	if (n.sourceKey !== void 0 && !Ln(e, n.sourceKey)) {
+		let t = Ln(i, n.sourceKey);
+		throw Error(`${r}: sourceKey '${n.sourceKey}' is not a column on the source table '${e.tableName}'.` + (t ? ` It IS a column on the target '${i.tableName}' — you probably want { foreignKey: '${n.sourceKey}' }, which names the column on the TARGET that holds this table's id.` : ` Columns on '${e.tableName}': ${Rn(e)}.`));
 	}
-	if (n.foreignKey !== void 0 && !Nn(i, n.foreignKey)) {
-		let t = Nn(e, n.foreignKey);
-		throw Error(`${r}: foreignKey '${n.foreignKey}' is not a column on the target table '${i.tableName}'.` + (t ? ` It IS a column on the source '${e.tableName}' — you want { sourceKey: '${n.foreignKey}' }. foreignKey names the column on the TARGET that points back at this table; sourceKey names the column on THIS table that holds the target's id.` : ` Columns on '${i.tableName}': ${Pn(i)}.`));
+	if (n.foreignKey !== void 0 && !Ln(i, n.foreignKey)) {
+		let t = Ln(e, n.foreignKey);
+		throw Error(`${r}: foreignKey '${n.foreignKey}' is not a column on the target table '${i.tableName}'.` + (t ? ` It IS a column on the source '${e.tableName}' — you want { sourceKey: '${n.foreignKey}' }. foreignKey names the column on the TARGET that points back at this table; sourceKey names the column on THIS table that holds the target's id.` : ` Columns on '${i.tableName}': ${Rn(i)}.`));
 	}
-}, In = Symbol.for("@voltro/database/relationsRegistry"), Ln = globalThis, F = Ln[In] ?? (Ln[In] = /* @__PURE__ */ new Map()), Rn = (e) => {
-	let t = e.source(), n = F.get(t.tableName);
+}, Bn = Symbol.for("@voltro/database/relationsRegistry"), Vn = globalThis, P = Vn[Bn] ?? (Vn[Bn] = /* @__PURE__ */ new Map()), Hn = (e) => {
+	let t = e.source(), n = P.get(t.tableName);
 	if (n === void 0) {
-		F.set(t.tableName, new Map(Object.entries(e.relations)));
+		P.set(t.tableName, new Map(Object.entries(e.relations)));
 		return;
 	}
 	for (let [r, i] of Object.entries(e.relations)) {
@@ -413,33 +428,33 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			n.set(r, i);
 		}
 	}
-}, zn = (e) => {
+}, Un = (e) => {
 	let t = 0;
-	for (let n of Object.values(e)) On(n) && (Rn(n), t += 1);
+	for (let n of Object.values(e)) jn(n) && (Hn(n), t += 1);
 	return t;
-}, Bn = (e) => {
-	let t = F.get(e);
+}, Wn = (e) => {
+	let t = P.get(e);
 	if (t !== void 0) return Object.fromEntries(t);
-}, Vn = (e, t) => F.get(e)?.get(t), Hn = () => {
+}, Gn = (e, t) => P.get(e)?.get(t), Kn = () => {
 	let e = [];
-	for (let [t, n] of F) for (let [r, i] of n) e.push({
+	for (let [t, n] of P) for (let [r, i] of n) e.push({
 		source: t,
 		name: r,
 		relation: i
 	});
 	return e;
-}, Un = () => {
-	for (let [e, t] of F) {
+}, qn = () => {
+	for (let [e, t] of P) {
 		let n = E(e);
-		if (n !== void 0) for (let [e, r] of t) Fn(n, e, r);
+		if (n !== void 0) for (let [e, r] of t) zn(n, e, r);
 	}
-}, Wn = () => {
-	F.clear();
-}, Gn = 4, Kn = (e) => Object.keys(e.fields), qn = (e, t) => Object.prototype.hasOwnProperty.call(e.fields, t), Jn = (e, t) => {
+}, Jn = () => {
+	P.clear();
+}, Yn = 4, Xn = (e) => Object.keys(e.fields), Zn = (e, t) => Object.prototype.hasOwnProperty.call(e.fields, t), Qn = (e, t) => {
 	let n = [];
 	for (let [r, i] of Object.entries(e.fields)) i.type === "reference" && i.references?.()?.tableName === t && n.push(r);
 	return n;
-}, Yn = (e, t) => {
+}, $n = (e, t) => {
 	let n = [];
 	for (let r of t) {
 		if (r.source !== e) continue;
@@ -456,7 +471,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			} catch {
 				continue;
 			}
-			if (!qn(e, t.sourceKey)) continue;
+			if (!Zn(e, t.sourceKey)) continue;
 			n.push({
 				table: e.tableName,
 				foreignKey: t.sourceKey,
@@ -465,24 +480,24 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			continue;
 		}
 		if (t.sourceKey !== void 0) continue;
-		let a = Jn(i, e), o = t.foreignKey ?? (a.length === 1 ? a[0] : void 0);
-		o === void 0 || !qn(i, o) || n.push({
+		let a = Qn(i, e), o = t.foreignKey ?? (a.length === 1 ? a[0] : void 0);
+		o === void 0 || !Zn(i, o) || n.push({
 			table: i.tableName,
 			foreignKey: o,
 			parentKey: "id"
 		});
 	}
 	return n;
-}, Xn = (e, t) => {
+}, er = (e, t) => {
 	let n = [];
-	for (let r of t) if (r.tableName !== e) for (let t of Jn(r, e)) n.push({
+	for (let r of t) if (r.tableName !== e) for (let t of Qn(r, e)) n.push({
 		table: r.tableName,
 		foreignKey: t,
 		parentKey: "id"
 	});
 	return n;
-}, Zn = (e) => `${e.table}\u0000${e.hops.map((e) => `${e.table}.${e.foreignKey}<-${e.parentKey}`).join("|")}`, Qn = (e) => {
-	let t = e.tables ?? Ce(), n = e.relations ?? Hn(), r = e.maxDepth ?? 4, i = new Set(e.exclude ?? []), a = new Map(t.map((e) => [e.tableName, e])), o = [];
+}, tr = (e) => `${e.table}\u0000${e.hops.map((e) => `${e.table}.${e.foreignKey}<-${e.parentKey}`).join("|")}`, nr = (e) => {
+	let t = e.tables ?? Ce(), n = e.relations ?? Kn(), r = e.maxDepth ?? 4, i = new Set(e.exclude ?? []), a = new Map(t.map((e) => [e.tableName, e])), o = [];
 	if (!a.has(e.subjectTable)) return {
 		subjectTable: e.subjectTable,
 		paths: [],
@@ -497,11 +512,11 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		hops: [],
 		depth: 0,
 		via: "relation"
-	}, c = [s], l = /* @__PURE__ */ new Set([Zn(s)]), u = /* @__PURE__ */ new Set(), d = [s];
+	}, c = [s], l = /* @__PURE__ */ new Set([tr(s)]), u = /* @__PURE__ */ new Set(), d = [s];
 	for (let e = 1; e <= r; e++) {
 		let r = [];
 		for (let a of d) {
-			let s = Yn(a.table, n), d = Xn(a.table, t), f = [...s.map((e) => [e, "relation"]), ...d.map((e) => [e, "reference"])];
+			let s = $n(a.table, n), d = er(a.table, t), f = [...s.map((e) => [e, "relation"]), ...d.map((e) => [e, "reference"])];
 			for (let [t, n] of f) {
 				if (i.has(t.table)) {
 					o.push({
@@ -519,7 +534,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 					hops: [...a.hops, t],
 					depth: e,
 					via: n
-				}, f = Zn(d);
+				}, f = tr(d);
 				l.has(f) || (l.add(f), c.push(d), r.push(d));
 			}
 		}
@@ -529,7 +544,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		}
 		d = r;
 	}
-	for (let e of d) (Yn(e.table, n).length > 0 || Xn(e.table, t).length > 0) && o.push({
+	for (let e of d) ($n(e.table, n).length > 0 || er(e.table, t).length > 0) && o.push({
 		kind: "depth-truncated",
 		table: e.table,
 		detail: `stopped at maxDepth ${r}; tables linked FROM '${e.table}' were not explored`
@@ -538,14 +553,14 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	for (let n of t) f.has(n.tableName) || i.has(n.tableName) || o.push({
 		kind: "unreachable",
 		table: n.tableName,
-		detail: `no relation() and no reference() column links '${n.tableName}' to '${e.subjectTable}'. If it holds subject data through a plain column, a polymorphic (type,id) pair, JSON or free text, add an explicit subjectScopes entry — this derivation cannot see it. Columns: ${Kn(n).join(", ")}`
+		detail: `no relation() and no reference() column links '${n.tableName}' to '${e.subjectTable}'. If it holds subject data through a plain column, a polymorphic (type,id) pair, JSON or free text, add an explicit subjectScopes entry — this derivation cannot see it. Columns: ${Xn(n).join(", ")}`
 	});
 	return {
 		subjectTable: e.subjectTable,
 		paths: c,
 		limitations: o
 	};
-}, $n = (e) => {
+}, rr = (e) => {
 	let t = [`subject graph · ${e.subjectTable} · ${e.paths.length} table(s) reachable`];
 	for (let n of e.paths) {
 		let r = n.hops.length === 0 ? `${e.subjectTable} (the subject row itself)` : [e.subjectTable, ...n.hops.map((e) => `${e.table}.${e.foreignKey}`)].join(" → ");
@@ -553,7 +568,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	}
 	let n = e.limitations.filter((e) => e.kind === "depth-truncated"), r = e.limitations.filter((e) => e.kind === "unreachable"), i = e.limitations.filter((e) => e.kind === "excluded");
 	return t.push(""), t.push("  WHAT THIS CANNOT SEE — a DSAR is only as complete as this list is short:"), n.length > 0 && t.push(`    depth-truncated (${n.length}): ${n.map((e) => e.table).join(", ")}`), i.length > 0 && t.push(`    excluded (${i.length}): ${[...new Set(i.map((e) => e.table))].join(", ")}`), t.push(r.length === 0 ? "    unreachable: none — every registered table is linked to the subject." : `    unreachable (${r.length}): ${r.map((e) => e.table).join(", ")}`), t.push("    Always outside this graph: object storage / uploaded files, external processors,"), t.push("    log and metric sinks, backups, and any subject id embedded in JSON or free text."), t.join("\n");
-}, er = (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, tr = (e) => {
+}, ir = (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, ar = (e) => {
 	if (e == null || typeof e != "string") return e;
 	let t = e.trim();
 	if (t.length === 0) return e;
@@ -564,7 +579,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	} catch {
 		return e;
 	}
-}, nr = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, rr = (e) => {
+}, or = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, sr = (e) => {
 	if (e == null || e instanceof Date) return e;
 	if (typeof e == "string") {
 		let t = new Date(e);
@@ -575,19 +590,19 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		return isNaN(t.getTime()) ? e : t;
 	}
 	return e;
-}, ir = (e, t, n) => {
+}, cr = (e, t, n) => {
 	if (e == null) return e;
 	switch (t) {
-		case "boolean": return n === "postgres" ? e : er(e);
+		case "boolean": return n === "postgres" ? e : ir(e);
 		case "json":
-		case "array": return n === "postgres" ? e : tr(e);
+		case "array": return n === "postgres" ? e : ar(e);
 		case "timestamp":
-		case "date": return n === "sqlite" || n === "turso" ? rr(e) : e;
+		case "date": return n === "sqlite" || n === "turso" ? sr(e) : e;
 		case "decimal":
-		case "bigint": return nr(e);
+		case "bigint": return or(e);
 		default: return e;
 	}
-}, ar = (e, t, n) => {
+}, lr = (e, t, n) => {
 	if (e.length === 0) return e;
 	let r = E(t);
 	if (r === void 0) return e;
@@ -598,36 +613,36 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	});
 	return e.map((e) => {
 		let t = { ...e };
-		for (let { key: e, type: r } of a) e in t && (t[e] = ir(t[e], r, n));
+		for (let { key: e, type: r } of a) e in t && (t[e] = cr(t[e], r, n));
 		return t;
 	});
-}, or = (e, t) => {
+}, ur = (e, t) => {
 	if (e == null) return e;
 	switch (t) {
 		case "json":
 		case "array": return typeof e == "string" ? e : JSON.stringify(e);
 		default: return e;
 	}
-}, sr = (e, t, n = ["json", "array"]) => {
+}, dr = (e, t, n = ["json", "array"]) => {
 	let r = E(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 = or(e[t], r.type);
+		let n = ur(e[t], r.type);
 		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
 	}
 	return a ?? e;
-}, cr = class extends Error {
+}, fr = class extends Error {
 	_tag = "EagerCardinalityError";
 	constructor(e) {
 		super(e), this.name = "EagerCardinalityError";
 	}
-}, lr = (e) => {
+}, pr = (e) => {
 	let { relationName: t, sourceTableName: n, targetTableName: r, foreignKey: i, sourceKey: a } = e, o = r === n;
 	return `relation '${t}' on '${n}' is declared \`one\`, but ${r}.${i} matches MORE than one row for the same ${n}.${a} — so there is no single related row to return.` + (o ? ` Because this relation is self-referential, check which side the key is on: \`foreignKey: '${i}'\` means "rows whose ${i} points AT me" (my children — there can be many). If you meant "the row my ${i} points to" (my parent), that is \`sourceKey: '${i}'\`.` : " Use `many(...)` if several are expected, or narrow the key.");
-}, ur = async (e, t, n, r) => {
+}, mr = async (e, t, n, r) => {
 	if (e.length === 0) return e;
-	let i = Bn(n.tableName);
+	let i = Wn(n.tableName);
 	if (i === void 0) throw Error(`cannot eager-load on '${n.tableName}': no relations registered. Did you forget to declare \`relations(${n.tableName}, ...)\` or import the file that does?`);
 	let a = e.map((e) => ({ ...e }));
 	for (let [e, o] of Object.entries(t)) {
@@ -636,36 +651,36 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			let t = Object.keys(i).join(", ") || "<none>";
 			throw Error(`unknown relation '${e}' on '${n.tableName}'. Registered relations: ${t}.`);
 		}
-		Fn(n, e, t), await dr(a, e, t, o === !0 ? {} : o, n, r);
+		zn(n, e, t), await hr(a, e, t, o === !0 ? {} : o, n, r);
 	}
 	return a;
-}, dr = async (e, t, n, r, i, a) => {
+}, hr = async (e, t, n, r, i, a) => {
 	switch (n.kind) {
 		case "one":
-			await fr(e, t, n, r, i, a);
+			await gr(e, t, n, r, i, a);
 			return;
 		case "many":
-			await pr(e, t, n, r, i, a);
+			await _r(e, t, n, r, i, a);
 			return;
 		case "manyToMany":
-			await hr(e, t, n, r, i, a);
+			await yr(e, t, n, r, i, a);
 			return;
 	}
-}, fr = async (e, t, n, r, i, a) => {
-	let o = n.target(), s = n.sourceKey ?? gr(i, o.tableName);
+}, gr = async (e, t, n, r, i, a) => {
+	let o = n.target(), s = n.sourceKey ?? br(i, o.tableName);
 	if (s !== void 0) {
-		let n = _r(e, s), i = n.length === 0 ? [] : await vr(o, "id", n, r, a), c = new Map(i.map((e) => [e.id, e]));
+		let n = xr(e, s), i = n.length === 0 ? [] : await Sr(o, "id", n, r, a), c = new Map(i.map((e) => [e.id, e]));
 		for (let n of e) {
 			let e = n[s];
 			n[t] = e == null ? null : c.get(e) ?? null;
 		}
-		await yr(i, r.with, o, a);
+		await Cr(i, r.with, o, a);
 		return;
 	}
-	let c = n.foreignKey ?? P(o, i.tableName, t), l = n.sourceKey ?? "id", u = _r(e, l), d = u.length === 0 ? [] : await vr(o, c, u, r, a), f = /* @__PURE__ */ new Map();
+	let c = n.foreignKey ?? Fn(o, i.tableName, t), l = n.sourceKey ?? "id", u = xr(e, l), d = u.length === 0 ? [] : await Sr(o, c, u, r, a), f = /* @__PURE__ */ new Map();
 	for (let e of d) {
 		let n = e[c];
-		if (f.has(n)) throw new cr(lr({
+		if (f.has(n)) throw new fr(pr({
 			relationName: t,
 			sourceTableName: i.tableName,
 			targetTableName: o.tableName,
@@ -678,9 +693,9 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		let e = n[l];
 		n[t] = e == null ? null : f.get(e) ?? null;
 	}
-	await yr(d, r.with, o, a);
-}, pr = async (e, t, n, r, i, a) => {
-	let o = n.target(), s = n.foreignKey ?? P(o, i.tableName, t), c = n.sourceKey ?? "id", l = _r(e, c), u = mr(r), d = l.length === 0 ? [] : await vr(o, s, l, u, a), f = /* @__PURE__ */ new Map();
+	await Cr(d, r.with, o, a);
+}, _r = async (e, t, n, r, i, a) => {
+	let o = n.target(), s = n.foreignKey ?? Fn(o, i.tableName, t), c = n.sourceKey ?? "id", l = xr(e, c), u = vr(r), d = l.length === 0 ? [] : await Sr(o, s, l, u, a), f = /* @__PURE__ */ new Map();
 	for (let e of d) {
 		let t = e[s], n = f.get(t);
 		n ? n.push(e) : f.set(t, [e]);
@@ -696,12 +711,12 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		let e = n[c];
 		n[t] = f.get(e) ?? [];
 	}
-	await yr(d, r.with, o, a);
-}, mr = (e) => {
+	await Cr(d, r.with, o, a);
+}, vr = (e) => {
 	let { limit: t, offset: n, ...r } = e;
 	return r;
-}, hr = async (e, t, n, r, i, a) => {
-	let o = n.target(), s = n.through(), c = _r(e, "id");
+}, yr = async (e, t, n, r, i, a) => {
+	let o = n.target(), s = n.through(), c = xr(e, "id");
 	if (c.length === 0) {
 		for (let n of e) n[t] = [];
 		return;
@@ -722,8 +737,8 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		for (let n of e) n[t] = [];
 		return;
 	}
-	let f = await vr(o, "id", _r(d, n.targetKey), r, a), p = new Map(f.map((e) => [e.id, e]));
-	await yr(f, r.with, o, a);
+	let f = await Sr(o, "id", xr(d, n.targetKey), r, a), p = new Map(f.map((e) => [e.id, e]));
+	await Cr(f, r.with, o, a);
 	let m = r.junction === void 0 ? void 0 : r.junction === !0 ? Object.keys(s.fields) : r.junction, h = /* @__PURE__ */ new Map();
 	for (let e of d) {
 		let t = e[n.sourceKey], r = e[n.targetKey], i = p.get(r);
@@ -735,16 +750,16 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		o ? o.push(a) : h.set(t, [a]);
 	}
 	for (let n of e) n[t] = h.get(n.id) ?? [];
-}, gr = (e, t) => {
+}, br = (e, t) => {
 	for (let [n, r] of Object.entries(e.fields)) if (r.type === "reference" && r.references?.()?.tableName === t) return n;
-}, _r = (e, t) => {
+}, xr = (e, t) => {
 	let n = /* @__PURE__ */ new Set();
 	for (let r of e) {
 		let e = r[t];
 		e != null && n.add(e);
 	}
 	return [...n];
-}, vr = (e, t, n, r, i) => {
+}, Sr = (e, t, n, r, i) => {
 	let a = {
 		column: t,
 		op: "in",
@@ -758,50 +773,50 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		skip: r.offset,
 		projection: void 0
 	});
-}, yr = async (e, t, n, r) => {
-	t !== void 0 && e.length !== 0 && (await ur(e, t, n, r)).forEach((t, n) => {
+}, Cr = async (e, t, n, r) => {
+	t !== void 0 && e.length !== 0 && (await mr(e, t, n, r)).forEach((t, n) => {
 		let r = e[n];
 		for (let [e, n] of Object.entries(t)) e in r || (r[e] = n);
 	});
-}, br = (e) => e.eager !== void 0 && Object.keys(e.eager).length > 0, xr = class extends Error {
+}, wr = (e) => e.eager !== void 0 && Object.keys(e.eager).length > 0, Tr = class extends Error {
 	_tag = "TenantNamespaceUnresolved";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceUnresolved";
 	}
-}, Sr = class extends Error {
+}, Er = class extends Error {
 	_tag = "TenantNamespaceInvalid";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceInvalid";
 	}
-}, Cr = 63, wr = "tenant_", Tr = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Er = (e) => {
-	if (e == null || e === "") throw new xr("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 = Tr(e);
-	if (t.replace(/_/g, "") === "") throw new Sr(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
-	let n = `${wr}${t}`;
-	if (n.length > Cr) throw new Sr(`namespace '${n}' for tenant '${e}' exceeds the ${Cr}-byte identifier limit. Use a shorter tenant id.`);
+}, Dr = 63, Or = "tenant_", kr = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Ar = (e) => {
+	if (e == null || e === "") throw new Tr("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 = kr(e);
+	if (t.replace(/_/g, "") === "") throw new Er(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
+	let n = `${Or}${t}`;
+	if (n.length > Dr) throw new Er(`namespace '${n}' for tenant '${e}' exceeds the ${Dr}-byte identifier limit. Use a shorter tenant id.`);
 	return n;
-}, Dr = (e, t) => e === null ? t : `${e}.${t}`, Or = /* @__PURE__ */ new Set(["timestamp", "date"]), kr = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, Ar = (e, t) => {
-	if (e === void 0 || t == null || !Or.has(e) || t instanceof Date) return t;
+}, jr = (e, t) => e === null ? t : `${e}.${t}`, Mr = /* @__PURE__ */ new Set(["timestamp", "date"]), Nr = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, Pr = (e, t) => {
+	if (e === void 0 || t == null || !Mr.has(e) || t instanceof Date) return t;
 	if (typeof t == "number" && Number.isFinite(t)) return new Date(t);
-	if (typeof t == "string" && kr.test(t)) {
+	if (typeof t == "string" && Nr.test(t)) {
 		let e = new Date(t);
 		return Number.isNaN(e.getTime()) ? t : e;
 	}
 	return t;
-}, jr = (e, t) => e === void 0 || !Or.has(e) ? t : t.map((t) => Ar(e, t)), Mr = (e, t) => {
+}, Fr = (e, t) => e === void 0 || !Mr.has(e) ? t : t.map((t) => Pr(e, t)), Ir = (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}`;
-}, Nr = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), I = (e, t, n = null, r) => {
-	if ("not" in e) return t`NOT (${I(e.not, t, n, r)})`;
-	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => I(e, t, n, r)));
-	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => I(e, t, n, r)));
+}, Lr = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), F = (e, t, n = null, r) => {
+	if ("not" in e) return t`NOT (${F(e.not, t, n, r)})`;
+	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => F(e, t, n, r)));
+	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => F(e, t, n, r)));
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
-		let r = e, i = Wr(r.subquery, t, n);
+		let r = e, i = I(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 = Wr(r.subquery, t, n);
+		let r = e, i = I(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({
@@ -814,7 +829,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		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 : E(r)?.fields?.[i.column]?.type, h = (e) => Ar(m, e);
+	}), 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 : E(r)?.fields?.[i.column]?.type, h = (e) => Pr(m, e);
 	switch (i.op) {
 		case "eq": return t`${u} = ${f(h(i.value))}`;
 		case "neq": return t`${u} <> ${f(h(i.value))}`;
@@ -831,7 +846,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			return e.length === 0 ? t`TRUE` : t`${u} NOT IN ${t.in(s ? e.map((e) => f(e)) : e)}`;
 		}
 		case "contains": {
-			let e = `%${Nr(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
+			let e = `%${Lr(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})`,
@@ -840,7 +855,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			});
 		}
 		case "startsWith": {
-			let e = `${Nr(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
+			let e = `${Lr(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
 			return t.onDialectOrElse({
 				mysql: () => t`${u} LIKE ${e}`,
 				orElse: () => t`${u} LIKE ${e} ESCAPE '\\'`
@@ -888,13 +903,13 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			});
 		}
 	}
-}, Pr = (e, t) => {
+}, Rr = (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}`);
-}, Fr = (e, t) => t.csv(e.map((e) => {
+}, zr = (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 = Pr(e.window ?? {}, t);
+		let r = Rr(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)}`;
@@ -918,43 +933,43 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			return t`${t(e.column)} AS ${t(e.alias)}`;
 		default: throw Error(`compileAggregateProjection: unknown op '${e.op}'`);
 	}
-})), Ir = (e) => `[${e.join(",")}]`, Lr = (e, t) => {
+})), Br = (e) => `[${e.join(",")}]`, Vr = (e, t) => {
 	if (e.queryVector === void 0) return null;
-	let n = t(e.column), r = Ir(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 = Br(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`
 	});
-}, Rr = (e, t) => {
+}, Hr = (e, t) => {
 	let n = t.unsafe(e.useGeography ? "::geography" : "::geometry");
 	return t`ST_Distance(${t(e.column)}${n}, ${e.geom}${n})`;
-}, zr = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Br = (e, t) => t`${t(`${e.indexName}_tsv`)}`, Vr = (e, t) => `${t}_${e.indexName}_fts`, Hr = (e, t, n) => {
-	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${Nr(e.query)}%`;
+}, Ur = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Wr = (e, t) => t`${t(`${e.indexName}_tsv`)}`, Gr = (e, t) => `${t}_${e.indexName}_fts`, Kr = (e, t, n) => {
+	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${Lr(e.query)}%`;
 	return n.onDialectOrElse({
 		mysql: () => n`MATCH(${r}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
 		sqlite: () => {
-			let r = n(Vr(e, t));
+			let r = n(Gr(e, t));
 			return n`${n("id")} IN (SELECT ${n("row_id")} FROM ${r} WHERE ${r} MATCH ${e.query})`;
 		},
 		mssql: () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`)),
-		orElse: () => n`${Br(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})`
+		orElse: () => n`${Wr(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})`
 	});
-}, Ur = (e, t, n) => {
-	let r = `%${Nr(e.query)}%`;
+}, qr = (e, t, n) => {
+	let r = `%${Lr(e.query)}%`;
 	return n.onDialectOrElse({
 		mysql: () => n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
 		sqlite: () => {
-			let r = n(Vr(e, t));
+			let r = n(Gr(e, t));
 			return n`COALESCE((SELECT -bm25(${r}) FROM ${r} WHERE ${r} MATCH ${e.query} AND ${r}.${n("row_id")} = ${n("id")}), 0)`;
 		},
 		mssql: () => e.columns.map((e) => n`(CASE WHEN LOWER(${n(e)}) LIKE LOWER(${r}) ESCAPE '\\' THEN 1 ELSE 0 END)`).reduce((e, t, r) => r === 0 ? t : n`${e} + ${t}`),
-		orElse: () => n`ts_rank(${Br(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))`
+		orElse: () => n`ts_rank(${Wr(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))`
 	});
-}, Wr = (e, t, n = null) => {
+}, I = (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`(${Wr(e, t, n)})`).reduce((e, n, i) => i === 0 ? n : t`${e} ${t.unsafe(r)} ${n}`), a = [];
+		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`(${I(e, t, n)})`).reduce((e, n, i) => i === 0 ? n : t`${e} ${t.unsafe(r)} ${n}`), a = [];
 		if (x(e).length > 0 && a.push(t` ORDER BY ${t.csv(x(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 Error(`compileSelect: invalid take ${e.take}`);
 			a.push(t` LIMIT ${t.unsafe(String(e.take))}`);
@@ -965,7 +980,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		}
 		return t`${i}${a.reduce((e, n) => t`${e}${n}`, t``)}`;
 	}
-	let r = e.annClause === void 0 ? null : Lr(e.annClause, t);
+	let r = e.annClause === void 0 ? null : Vr(e.annClause, t);
 	e.spatialClause !== void 0 && t.onDialectOrElse({
 		mysql: () => {
 			throw Error("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
@@ -978,16 +993,16 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		},
 		orElse: () => t``
 	});
-	let i = e.spatialClause?.projectAs === void 0 ? null : Rr(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? Fr(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : e.projection && e.projection.length > 0 ? t.csv(e.projection.map((e) => t`${t(e)}`)) : t`*`, o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? Ur(c, e.table, t) : null, u = l !== null && c?.rank !== void 0 ? t`${s}, ${l} AS ${t(c.rank.alias)}` : s, d = i !== null && !o && e.spatialClause?.projectAs !== void 0 ? t`${u}, ${i} AS ${t(e.spatialClause.projectAs)}` : u, f = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
+	let i = e.spatialClause?.projectAs === void 0 ? null : Hr(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? zr(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : e.projection && e.projection.length > 0 ? t.csv(e.projection.map((e) => t`${t(e)}`)) : t`*`, o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? qr(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 `,
 		sqlite: () => t`DISTINCT `
-	}) : e.distinct ? t`DISTINCT ` : t``, p = e.alias === void 0 ? t`${t(Dr(n, e.table))}` : t`${t(Dr(n, e.table))} AS ${t(e.alias)}`, m = (e.joins ?? []).map((e) => {
+	}) : e.distinct ? t`DISTINCT ` : t``, p = e.alias === void 0 ? t`${t(jr(n, e.table))}` : t`${t(jr(n, e.table))} AS ${t(e.alias)}`, m = (e.joins ?? []).map((e) => {
 		let r = e.kind === "inner" ? "INNER" : "LEFT";
-		return t` ${t.unsafe(r)} JOIN ${t(Dr(n, e.table))} AS ${t(e.alias)} ON ${I(e.on, t, n)}`;
-	}), h = m.length > 0 ? m.reduce((e, n) => t`${e}${n}`, p) : p, g = c === void 0 ? null : Hr(c, e.table, t), _ = [e.predicate ? I(e.predicate, t, n, e.table) : null, g].filter((e) => e !== null), ee = _.length > 0 ? t` WHERE ${t.and(_)}` : t``, te = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, ne = e.having ? t` HAVING ${I(e.having, t, n, e.table)}` : t``, v = e.skip !== void 0, y = [];
-	r !== null && y.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && y.push(e.spatialClause.order === "desc" ? t`${zr(e.spatialClause, t)} DESC` : t`${zr(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && y.push(t`${l} DESC`);
+		return t` ${t.unsafe(r)} JOIN ${t(jr(n, e.table))} AS ${t(e.alias)} ON ${F(e.on, t, n)}`;
+	}), h = m.length > 0 ? m.reduce((e, n) => t`${e}${n}`, p) : p, g = c === void 0 ? null : Kr(c, e.table, t), _ = [e.predicate ? F(e.predicate, t, n, e.table) : null, g].filter((e) => e !== null), ee = _.length > 0 ? t` WHERE ${t.and(_)}` : t``, te = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, ne = e.having ? t` HAVING ${F(e.having, t, n, e.table)}` : t``, v = e.skip !== void 0, y = [];
+	r !== null && y.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && y.push(e.spatialClause.order === "desc" ? t`${Ur(e.spatialClause, t)} DESC` : t`${Ur(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && y.push(t`${l} DESC`);
 	for (let n of x(e)) y.push(n.direction === "desc" ? t`${t(n.column)} DESC` : t`${t(n.column)} ASC`);
 	let re = y.length > 0 ? t` ORDER BY ${t.csv(y)}` : v ? t.onDialectOrElse({
 		mssql: () => t` ORDER BY (SELECT NULL)`,
@@ -995,7 +1010,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	}) : t``, b = (e) => {
 		if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw Error(`compileSelect: expected non-negative integer take/skip, got ${e}`);
 		return t.unsafe(String(e));
-	}, ie = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${Wr(e.descriptor, t, n)})`), ae = (e.ctes ?? []).some((e) => e.recursive === !0), oe = ie.length > 0 ? t`WITH ${t.unsafe(ae ? "RECURSIVE " : "")}${t.csv(ie)} ` : t``;
+	}, ie = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${I(e.descriptor, t, n)})`), ae = (e.ctes ?? []).some((e) => e.recursive === !0), oe = ie.length > 0 ? t`WITH ${t.unsafe(ae ? "RECURSIVE " : "")}${t.csv(ie)} ` : t``;
 	return t.onDialectOrElse({
 		mssql: () => {
 			let n = e.take !== void 0 && !v ? t`TOP ${b(e.take)} ` : t``, r = v ? t` OFFSET ${b(e.skip)} ROWS FETCH NEXT ${b(e.take ?? 2 ** 53 - 1)} ROWS ONLY` : t``;
@@ -1006,29 +1021,29 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			return t`${oe}SELECT ${f}${d} FROM ${h}${ee}${te}${ne}${re}${n}${r}`;
 		}
 	});
-}, Gr = (e, t, n) => {
+}, Jr = (e, t, n) => {
 	if (e.eager === void 0) return null;
-	let r = Jr(e.table, e.eager, e.sourceTable);
+	let r = Xr(e.table, e.eager, e.sourceTable);
 	if (r === null) return null;
-	let i = ti(n, e, r, ei(t, n));
+	let i = ri(n, e, r, ni(t, n));
 	return i === null ? null : {
 		fragment: i,
-		decode: ii(r, n)
+		decode: oi(r, n)
 	};
-}, Kr = (e) => e.relation.kind === "one" && e.fkSide === "target", qr = (e) => ({
+}, L = (e) => e.relation.kind === "one" && e.fkSide === "target", Yr = (e) => ({
 	...e,
 	branch: {
 		...e.branch,
 		limit: 2
 	}
-}), Jr = (e, t, n) => {
-	let r = n ?? Te(e), i = Bn(e);
+}), Xr = (e, t, n) => {
+	let r = n ?? Te(e), i = Wn(e);
 	if (i === void 0) return null;
 	let a = [];
 	for (let [e, n] of Object.entries(t)) {
 		let t = i[e];
 		if (t === void 0) return null;
-		let o = Yr(e, t, r, n === !0 ? {} : n);
+		let o = Zr(e, t, r, n === !0 ? {} : n);
 		if (o === null) return null;
 		a.push(o);
 	}
@@ -1036,30 +1051,30 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		table: r,
 		children: a
 	};
-}, Yr = (e, t, n, r) => {
+}, Zr = (e, t, n, r) => {
 	let i = t.target(), a = (t.kind === "manyToMany" ? void 0 : t.sourceKey) ?? "id", o, s;
 	if (t.kind === "manyToMany") o = t.targetKey, s = "target";
 	else if (t.kind === "one") {
-		let r = t.sourceKey ?? $r(n, i.tableName);
+		let r = t.sourceKey ?? ti(n, i.tableName);
 		if (r !== void 0) o = r, s = "source";
 		else try {
-			o = t.foreignKey ?? P(i, n.tableName, e), s = "target";
+			o = t.foreignKey ?? Fn(i, n.tableName, e), s = "target";
 		} catch {
 			return null;
 		}
 	} else try {
-		o = t.foreignKey ?? P(i, n.tableName, e), s = "target";
+		o = t.foreignKey ?? Fn(i, n.tableName, e), s = "target";
 	} catch {
 		return null;
 	}
 	let c = r.with === void 0 ? [] : (() => {
-		let e = Bn(i.tableName);
+		let e = Wn(i.tableName);
 		if (e === void 0 && Object.keys(r.with).length > 0) return null;
 		let t = [];
 		for (let [n, a] of Object.entries(r.with)) {
 			let r = e?.[n];
 			if (r === void 0) return null;
-			let o = Yr(n, r, i, a === !0 ? {} : a);
+			let o = Zr(n, r, i, a === !0 ? {} : a);
 			if (o === null) return null;
 			t.push(o);
 		}
@@ -1075,9 +1090,9 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		fkSide: s,
 		branch: r,
 		children: c,
-		junction: Xr(t, r)
+		junction: Qr(t, r)
 	};
-}, Xr = (e, t) => {
+}, Qr = (e, t) => {
 	if (e.kind !== "manyToMany" || t.junction === void 0) return;
 	let n = e.through(), r = t.junction === !0 ? Object.keys(n.fields) : t.junction, i = r.filter((e) => e in n.fields);
 	return {
@@ -1089,35 +1104,35 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			return t !== void 0 && (t.type === "timestamp" || t.type === "date");
 		})
 	};
-}, Zr = (e) => `__j_${e}`, Qr = "__j", $r = (e, t) => {
+}, $r = (e) => `__j_${e}`, ei = "__j", ti = (e, t) => {
 	for (let [n, r] of Object.entries(e.fields)) if (r.type === "reference" && r.references?.()?.tableName === t) return n;
-}, ei = (e, t) => {
+}, ni = (e, t) => {
 	let n = 0;
 	return {
 		sql: e,
 		dialect: t,
 		nextAlias: () => `__a${n++}`
 	};
-}, ti = (e, t, n, r) => {
+}, ri = (e, t, n, r) => {
 	switch (e) {
-		case "postgres": return si(t, n, r);
+		case "postgres": return li(t, n, r);
 		case "sqlite":
-		case "turso": return hi(t, n, r);
+		case "turso": return _i(t, n, r);
 		case "mysql":
-		case "mariadb": return Ti(t, n, r);
-		case "mssql": return Mi(t, n, r);
+		case "mariadb": return Di(t, n, r);
+		case "mssql": return Pi(t, n, r);
 	}
-}, ni = (e, t) => t === "mssql" && !ri.test(e) ? /* @__PURE__ */ new Date(`${e}Z`) : new Date(e), ri = /(?:Z|[+-]\d{2}:?\d{2})$/, ii = (e, t) => {
-	let n = ai(e.table, e.children, t);
+}, ii = (e, t) => t === "mssql" && !ai.test(e) ? /* @__PURE__ */ new Date(`${e}Z`) : new Date(e), ai = /(?:Z|[+-]\d{2}:?\d{2})$/, oi = (e, t) => {
+	let n = si(e.table, e.children, t);
 	return (e) => e.map((e) => {
 		let t = e.__row, r = typeof t == "string" ? JSON.parse(t) : t;
 		return n(r);
 	});
-}, ai = (e, t, n) => {
+}, si = (e, t, n) => {
 	let r = [];
 	for (let [t, n] of Object.entries(e.fields)) (n.type === "timestamp" || n.type === "date") && r.push(t);
 	let i = t.map((e) => {
-		let t = ai(e.target, e.children, n), r = e.relation.kind === "one", i = Kr(e), a = i ? lr({
+		let t = si(e.target, e.children, n), r = e.relation.kind === "one", i = L(e), a = i ? pr({
 			relationName: e.relationName,
 			sourceTableName: e.source.tableName,
 			targetTableName: e.target.tableName,
@@ -1130,14 +1145,14 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			isSingle: r,
 			fromOverFetch: i,
 			cardinalityMessage: a,
-			junction: oi(e.junction, n)
+			junction: ci(e.junction, n)
 		};
 	});
 	return (e) => {
 		let t = { ...e };
 		for (let e of r) {
 			let r = t[e];
-			typeof r == "string" && (t[e] = ni(r, n));
+			typeof r == "string" && (t[e] = ii(r, n));
 		}
 		for (let e of i) {
 			let n = t[e.name];
@@ -1147,7 +1162,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			}
 			if (e.fromOverFetch) {
 				let r = n;
-				if (r.length > 1) throw new cr(e.cardinalityMessage);
+				if (r.length > 1) throw new fr(e.cardinalityMessage);
 				t[e.name] = r.length === 0 ? null : e.decode(r[0]);
 				continue;
 			}
@@ -1159,204 +1174,204 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		}
 		return t;
 	};
-}, oi = (e, t) => {
+}, ci = (e, t) => {
 	if (e === void 0) return;
 	let n = new Set(e.dateColumns), r = e.requested;
 	return (e) => {
 		let i = e._junction ?? {}, a = {};
 		for (let e of r) {
 			let r = i[e];
-			a[e] = n.has(e) && typeof r == "string" ? ni(r, t) : r;
+			a[e] = n.has(e) && typeof r == "string" ? ii(r, t) : r;
 		}
 		return {
 			...e,
 			_junction: a
 		};
 	};
-}, si = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = r(t.table.tableName), o = r(i), s = ci(i, t.children, n);
-	return s === null ? null : r`SELECT ${s} AS "__row" FROM ${a} AS ${o}${e.predicate ? r` WHERE ${H(e.predicate, i, r)}` : r``}${x(e).length > 0 ? r` ORDER BY ${r.csv(x(e).map((e) => e.direction === "desc" ? r`${z(i, e.column, r)} DESC` : r`${z(i, e.column, r)} ASC`))}` : r``}${e.take === void 0 ? r`` : r` LIMIT ${V(e.take, r)}`}${e.skip === void 0 ? r`` : r` OFFSET ${V(e.skip, r)}`}`;
-}, ci = (e, t, n, r) => {
-	let i = n.sql, a = r === void 0 ? i`to_jsonb(${i(e)}.*)` : i`(to_jsonb(${i(e)}.*) - ${B(Qr, i)}::text)`;
+}, li = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = r(t.table.tableName), o = r(i), s = ui(i, t.children, n);
+	return s === null ? null : r`SELECT ${s} AS "__row" FROM ${a} AS ${o}${e.predicate ? r` WHERE ${U(e.predicate, i, r)}` : r``}${x(e).length > 0 ? r` ORDER BY ${r.csv(x(e).map((e) => e.direction === "desc" ? r`${B(i, e.column, r)} DESC` : r`${B(i, e.column, r)} ASC`))}` : r``}${e.take === void 0 ? r`` : r` LIMIT ${H(e.take, r)}`}${e.skip === void 0 ? r`` : r` OFFSET ${H(e.skip, r)}`}`;
+}, ui = (e, t, n, r) => {
+	let i = n.sql, a = r === void 0 ? i`to_jsonb(${i(e)}.*)` : i`(to_jsonb(${i(e)}.*) - ${V(ei, i)}::text)`;
 	if (t.length === 0 && r === void 0) return a;
 	let o = [];
-	r !== void 0 && o.push(i`${B("_junction", i)}, ${z(e, Qr, i)}`);
+	r !== void 0 && o.push(i`${V("_junction", i)}, ${B(e, ei, i)}`);
 	for (let r of t) {
-		let t = li(r, e, n);
+		let t = di(r, e, n);
 		if (t === null) return null;
-		o.push(i`${B(r.relationName, i)}, ${t}`);
+		o.push(i`${V(r.relationName, i)}, ${t}`);
 	}
 	return i`${a} || jsonb_build_object(${i.csv(o)})`;
-}, li = (e, t, n) => {
+}, di = (e, t, n) => {
 	switch (e.relation.kind) {
-		case "one": return Kr(e) ? di(qr(e), t, n) : ui(e, t, n);
-		case "many": return di(e, t, n);
-		case "manyToMany": return fi(e, t, n);
+		case "one": return L(e) ? pi(Yr(e), t, n) : fi(e, t, n);
+		case "many": return pi(e, t, n);
+		case "manyToMany": return mi(e, t, n);
 	}
-}, ui = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = ci(i, e.children, n);
+}, fi = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = ui(i, e.children, n);
 	if (a === null) return null;
-	let o = e.fkSide === "source" ? r`${z(i, "id", r)} = ${z(t, e.foreignKey, r)}` : r`${z(i, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${H(e.branch.where, i, r)}`, c = L(i, e.branch.orderBy, r);
+	let o = e.fkSide === "source" ? r`${B(i, "id", r)} = ${B(t, e.foreignKey, r)}` : r`${B(i, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${U(e.branch.where, i, r)}`, c = R(i, e.branch.orderBy, r);
 	return r`(SELECT ${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o}${s}${c} LIMIT 1)`;
-}, di = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = ci(i, e.children, n);
+}, pi = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = ui(i, e.children, n);
 	if (a === null) return null;
-	let o = r`${z(void 0, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(e.branch.where, r)}`, c = mi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`;
+	let o = r`${B(void 0, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${F(e.branch.where, r)}`, c = gi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${H(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${H(e.branch.offset, r)}`;
 	return r`COALESCE((SELECT jsonb_agg(${a}) FROM (SELECT * FROM ${r(e.target.tableName)} WHERE ${o}${s}${c}${l}${u}) AS ${r(i)}), '[]'::jsonb)`;
-}, fi = (e, t, n) => {
-	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = ci(o, e.children, n, e.junction);
+}, mi = (e, t, n) => {
+	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = ui(o, e.children, n, e.junction);
 	if (c === null) return null;
-	let l = e.branch.where === void 0 ? r`` : r` AND ${I(e.branch.where, r)}`, u = Bi(e, s, r), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : r`, ${pi(e.junction, s, r)} AS ${r(Qr)}`;
-	return r`COALESCE((SELECT jsonb_agg(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${z(o, "id", r)} = ${z(s, i.targetKey, r)} WHERE ${z(s, i.sourceKey, r)} = ${z(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), '[]'::jsonb)`;
-}, pi = (e, t, n) => e.present.length === 0 ? n`jsonb_build_object()` : n`jsonb_build_object(${n.csv(e.present.map((e) => n`${B(e, n)}, ${z(t, e, n)}`))})`, L = (e, t, n) => t === void 0 || t.length === 0 ? n`` : n` ORDER BY ${n.csv(t.map((t) => t.direction === "desc" ? n`${z(e, t.column, n)} DESC` : n`${z(e, t.column, n)} ASC`))}`, mi = (e, t) => e === void 0 || e.length === 0 ? t`` : t` ORDER BY ${t.csv(e.map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`, hi = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = gi(i, t.table, t.children, n);
+	let l = e.branch.where === void 0 ? r`` : r` AND ${F(e.branch.where, r)}`, u = Hi(e, s, r), d = R(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${H(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${H(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : r`, ${hi(e.junction, s, r)} AS ${r(ei)}`;
+	return r`COALESCE((SELECT jsonb_agg(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${B(o, "id", r)} = ${B(s, i.targetKey, r)} WHERE ${B(s, i.sourceKey, r)} = ${B(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), '[]'::jsonb)`;
+}, hi = (e, t, n) => e.present.length === 0 ? n`jsonb_build_object()` : n`jsonb_build_object(${n.csv(e.present.map((e) => n`${V(e, n)}, ${B(t, e, n)}`))})`, R = (e, t, n) => t === void 0 || t.length === 0 ? n`` : n` ORDER BY ${n.csv(t.map((t) => t.direction === "desc" ? n`${B(e, t.column, n)} DESC` : n`${B(e, t.column, n)} ASC`))}`, gi = (e, t) => e === void 0 || e.length === 0 ? t`` : t` ORDER BY ${t.csv(e.map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`, _i = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = vi(i, t.table, t.children, n);
 	if (a === null) return null;
-	let o = e.predicate ? r` WHERE ${H(e.predicate, i, r)}` : r``, s = x(e).length > 0 ? r` ORDER BY ${r.csv(x(e).map((e) => e.direction === "desc" ? r`${z(i, e.column, r)} DESC` : r`${z(i, e.column, r)} ASC`))}` : r``, c = e.take === void 0 ? r`` : r` LIMIT ${V(e.take, r)}`, l = e.skip === void 0 ? r`` : r` OFFSET ${V(e.skip, r)}`;
+	let o = e.predicate ? r` WHERE ${U(e.predicate, i, r)}` : r``, s = x(e).length > 0 ? r` ORDER BY ${r.csv(x(e).map((e) => e.direction === "desc" ? r`${B(i, e.column, r)} DESC` : r`${B(i, e.column, r)} ASC`))}` : r``, c = e.take === void 0 ? r`` : r` LIMIT ${H(e.take, r)}`, l = e.skip === void 0 ? r`` : r` OFFSET ${H(e.skip, r)}`;
 	return r`SELECT ${a} AS "__row" FROM ${r(t.table.tableName)} AS ${r(i)}${o}${s}${c}${l}`;
-}, gi = (e, t, n, r, i) => {
+}, vi = (e, t, n, r, i) => {
 	let a = r.sql, o = [];
-	for (let n of Object.keys(t.fields)) o.push(a`${B(n, a)}, ${z(e, n, a)}`);
+	for (let n of Object.keys(t.fields)) o.push(a`${V(n, a)}, ${B(e, n, a)}`);
 	if (i !== void 0) {
-		let e = _i(i.projection, i.source, a);
-		o.push(a`${B("_junction", a)}, json_object(${e})`);
+		let e = yi(i.projection, i.source, a);
+		o.push(a`${V("_junction", a)}, json_object(${e})`);
 	}
 	for (let t of n) {
-		let n = xi(t, e, r);
+		let n = Ci(t, e, r);
 		if (n === null) return null;
-		o.push(a`${B(t.relationName, a)}, ${n}`);
+		o.push(a`${V(t.relationName, a)}, ${n}`);
 	}
 	return a`json_object(${a.csv(o)})`;
-}, _i = (e, t, n) => e.present.length === 0 ? n`` : n.csv(e.present.map((e) => n`${B(e, n)}, ${z(t.alias, t.physical(e), n)}`)), vi = (e, t, n) => e.present.length === 0 ? n`` : n`, ${n.csv(e.present.map((e) => n`${z(t, e, n)} AS ${n(Zr(e))}`))}`, yi = (e) => ({
+}, yi = (e, t, n) => e.present.length === 0 ? n`` : n.csv(e.present.map((e) => n`${V(e, n)}, ${B(t.alias, t.physical(e), n)}`)), bi = (e, t, n) => e.present.length === 0 ? n`` : n`, ${n.csv(e.present.map((e) => n`${B(t, e, n)} AS ${n($r(e))}`))}`, xi = (e) => ({
 	alias: e,
-	physical: Zr
-}), bi = (e) => ({
+	physical: $r
+}), Si = (e) => ({
 	alias: e,
 	physical: (e) => e
-}), xi = (e, t, n) => {
+}), Ci = (e, t, n) => {
 	switch (e.relation.kind) {
-		case "one": return Kr(e) ? Ci(qr(e), t, n) : Si(e, t, n);
-		case "many": return Ci(e, t, n);
-		case "manyToMany": return wi(e, t, n);
+		case "one": return L(e) ? Ti(Yr(e), t, n) : wi(e, t, n);
+		case "many": return Ti(e, t, n);
+		case "manyToMany": return Ei(e, t, n);
 	}
-}, Si = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = gi(i, e.target, e.children, n);
+}, wi = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = vi(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = e.fkSide === "source" ? r`${z(i, "id", r)} = ${z(t, e.foreignKey, r)}` : r`${z(i, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`;
+	let o = e.fkSide === "source" ? r`${B(i, "id", r)} = ${B(t, e.foreignKey, r)}` : r`${B(i, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}`;
 	return r`(SELECT ${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o} LIMIT 1)`;
-}, Ci = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = gi(i, e.target, e.children, n);
+}, Ti = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = vi(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = r`${z(void 0, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, c = mi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`;
+	let o = r`${B(void 0, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${F(W(e.branch.where), r)}`, c = gi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${H(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${H(e.branch.offset, r)}`;
 	return r`COALESCE((SELECT json_group_array(${a}) FROM (SELECT * FROM ${r(e.target.tableName)} WHERE ${o}${s}${c}${l}${u}) AS ${r(i)}), json('[]'))`;
-}, wi = (e, t, n) => {
-	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = gi(o, e.target, e.children, n, e.junction === void 0 ? void 0 : {
+}, Ei = (e, t, n) => {
+	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = vi(o, e.target, e.children, n, e.junction === void 0 ? void 0 : {
 		projection: e.junction,
-		source: yi(o)
+		source: xi(o)
 	});
 	if (c === null) return null;
-	let l = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, u = Bi(e, s, r, !0), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : vi(e.junction, s, r);
-	return r`COALESCE((SELECT json_group_array(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${z(o, "id", r)} = ${z(s, i.targetKey, r)} WHERE ${z(s, i.sourceKey, r)} = ${z(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), json('[]'))`;
-}, Ti = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = R(i, t.table, t.children, n);
+	let l = e.branch.where === void 0 ? r`` : r` AND ${F(W(e.branch.where), r)}`, u = Hi(e, s, r, !0), d = R(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${H(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${H(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : bi(e.junction, s, r);
+	return r`COALESCE((SELECT json_group_array(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${B(o, "id", r)} = ${B(s, i.targetKey, r)} WHERE ${B(s, i.sourceKey, r)} = ${B(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), json('[]'))`;
+}, Di = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = z(i, t.table, t.children, n);
 	if (a === null) return null;
-	let o = e.predicate ? r` WHERE ${H(e.predicate, i, r)}` : r``, s = x(e).length > 0 ? r` ORDER BY ${r.csv(x(e).map((e) => e.direction === "desc" ? r`${z(i, e.column, r)} DESC` : r`${z(i, e.column, r)} ASC`))}` : r``, c = e.take === void 0 ? r`` : r` LIMIT ${V(e.take, r)}`, l = e.skip === void 0 ? r`` : r` OFFSET ${V(e.skip, r)}`;
+	let o = e.predicate ? r` WHERE ${U(e.predicate, i, r)}` : r``, s = x(e).length > 0 ? r` ORDER BY ${r.csv(x(e).map((e) => e.direction === "desc" ? r`${B(i, e.column, r)} DESC` : r`${B(i, e.column, r)} ASC`))}` : r``, c = e.take === void 0 ? r`` : r` LIMIT ${H(e.take, r)}`, l = e.skip === void 0 ? r`` : r` OFFSET ${H(e.skip, r)}`;
 	return r`SELECT ${a} AS \`__row\` FROM ${r(t.table.tableName)} AS ${r(i)}${o}${s}${c}${l}`;
-}, R = (e, t, n, r, i) => {
+}, z = (e, t, n, r, i) => {
 	let a = r.sql, o = [];
-	for (let n of Object.keys(t.fields)) o.push(a`${B(n, a)}, ${z(e, n, a)}`);
+	for (let n of Object.keys(t.fields)) o.push(a`${V(n, a)}, ${B(e, n, a)}`);
 	if (i !== void 0) {
-		let e = _i(i.projection, i.source, a);
-		o.push(a`${B("_junction", a)}, JSON_OBJECT(${e})`);
+		let e = yi(i.projection, i.source, a);
+		o.push(a`${V("_junction", a)}, JSON_OBJECT(${e})`);
 	}
 	for (let t of n) {
-		let n = Ei(t, e, r);
+		let n = Oi(t, e, r);
 		if (n === null) return null;
-		o.push(a`${B(t.relationName, a)}, ${n}`);
+		o.push(a`${V(t.relationName, a)}, ${n}`);
 	}
 	return a`JSON_OBJECT(${a.csv(o)})`;
-}, Ei = (e, t, n) => {
+}, Oi = (e, t, n) => {
 	switch (e.relation.kind) {
 		case "one":
-			if (Kr(e)) {
-				let r = qr(e);
-				return n.dialect === "mariadb" ? Ai(r, t, n) : Oi(r, t, n);
+			if (L(e)) {
+				let r = Yr(e);
+				return n.dialect === "mariadb" ? Mi(r, t, n) : Ai(r, t, n);
 			}
-			return Di(e, t, n);
-		case "many": return n.dialect === "mariadb" ? Ai(e, t, n) : Oi(e, t, n);
-		case "manyToMany": return n.dialect === "mariadb" ? ji(e, t, n) : ki(e, t, n);
+			return ki(e, t, n);
+		case "many": return n.dialect === "mariadb" ? Mi(e, t, n) : Ai(e, t, n);
+		case "manyToMany": return n.dialect === "mariadb" ? Ni(e, t, n) : ji(e, t, n);
 	}
-}, Di = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = R(i, e.target, e.children, n);
+}, ki = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = z(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = e.fkSide === "source" ? r`${z(i, "id", r)} = ${z(t, e.foreignKey, r)}` : r`${z(i, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`;
+	let o = e.fkSide === "source" ? r`${B(i, "id", r)} = ${B(t, e.foreignKey, r)}` : r`${B(i, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}`;
 	return r`(SELECT ${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o} LIMIT 1)`;
-}, Oi = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = R(i, e.target, e.children, n);
+}, Ai = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = z(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = r`${z(void 0, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, c = mi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`;
+	let o = r`${B(void 0, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${F(W(e.branch.where), r)}`, c = gi(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${H(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${H(e.branch.offset, r)}`;
 	return r`COALESCE((SELECT JSON_ARRAYAGG(${a}) FROM (SELECT * FROM ${r(e.target.tableName)} WHERE ${o}${s}${c}${l}${u}) AS ${r(i)}), JSON_ARRAY())`;
-}, ki = (e, t, n) => {
-	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = R(o, e.target, e.children, n, e.junction === void 0 ? void 0 : {
+}, ji = (e, t, n) => {
+	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = z(o, e.target, e.children, n, e.junction === void 0 ? void 0 : {
 		projection: e.junction,
-		source: yi(o)
+		source: xi(o)
 	});
 	if (c === null) return null;
-	let l = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, u = Bi(e, s, r, !0), d = L(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${V(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${V(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : vi(e.junction, s, r);
-	return r`COALESCE((SELECT JSON_ARRAYAGG(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${z(o, "id", r)} = ${z(s, i.targetKey, r)} WHERE ${z(s, i.sourceKey, r)} = ${z(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), JSON_ARRAY())`;
-}, Ai = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = R(i, e.target, e.children, n);
+	let l = e.branch.where === void 0 ? r`` : r` AND ${F(W(e.branch.where), r)}`, u = Hi(e, s, r, !0), d = R(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${H(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${H(e.branch.offset, r)}`, m = e.junction === void 0 ? r`` : bi(e.junction, s, r);
+	return r`COALESCE((SELECT JSON_ARRAYAGG(${c}) FROM (SELECT ${r(o)}.*${m} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${B(o, "id", r)} = ${B(s, i.targetKey, r)} WHERE ${B(s, i.sourceKey, r)} = ${B(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), JSON_ARRAY())`;
+}, Mi = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = z(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = r`${z(i, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, c = e.branch.orderBy ?? [];
-	if (e.branch.limit === void 0 && e.branch.offset === void 0) return r`COALESCE((SELECT JSON_ARRAYAGG(${a}${c.length > 0 ? r` ORDER BY ${r.csv(c.map((e) => e.direction === "desc" ? r`${z(i, e.column, r)} DESC` : r`${z(i, e.column, r)} ASC`))}` : r``}) FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o}${s}), JSON_ARRAY())`;
-	let l = c.length > 0 ? r` ORDER BY ${r.csv(c.map((e) => e.direction === "desc" ? r`${r(e.column)} DESC` : r`${r(e.column)} ASC`))}` : r` ORDER BY ${r("id")}`, u = e.branch.limit, d = e.branch.offset, f = u !== void 0 && d !== void 0 ? r` AND ${z(i, "rn", r)} > ${V(d, r)} AND ${z(i, "rn", r)} <= ${V(d + u, r)}` : u === void 0 ? r` AND ${z(i, "rn", r)} > ${V(d, r)}` : r` AND ${z(i, "rn", r)} <= ${V(u, r)}`;
-	return r`COALESCE((SELECT JSON_ARRAYAGG(${a} ORDER BY ${z(i, "rn", r)}) FROM (SELECT *, ROW_NUMBER() OVER (PARTITION BY ${r(e.foreignKey)}${l}) AS rn FROM ${r(e.target.tableName)}) AS ${r(i)} WHERE ${o}${s}${f}), JSON_ARRAY())`;
-}, ji = (e, t, n) => {
+	let o = r`${B(i, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${F(W(e.branch.where), r)}`, c = e.branch.orderBy ?? [];
+	if (e.branch.limit === void 0 && e.branch.offset === void 0) return r`COALESCE((SELECT JSON_ARRAYAGG(${a}${c.length > 0 ? r` ORDER BY ${r.csv(c.map((e) => e.direction === "desc" ? r`${B(i, e.column, r)} DESC` : r`${B(i, e.column, r)} ASC`))}` : r``}) FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o}${s}), JSON_ARRAY())`;
+	let l = c.length > 0 ? r` ORDER BY ${r.csv(c.map((e) => e.direction === "desc" ? r`${r(e.column)} DESC` : r`${r(e.column)} ASC`))}` : r` ORDER BY ${r("id")}`, u = e.branch.limit, d = e.branch.offset, f = u !== void 0 && d !== void 0 ? r` AND ${B(i, "rn", r)} > ${H(d, r)} AND ${B(i, "rn", r)} <= ${H(d + u, r)}` : u === void 0 ? r` AND ${B(i, "rn", r)} > ${H(d, r)}` : r` AND ${B(i, "rn", r)} <= ${H(u, r)}`;
+	return r`COALESCE((SELECT JSON_ARRAYAGG(${a} ORDER BY ${B(i, "rn", r)}) FROM (SELECT *, ROW_NUMBER() OVER (PARTITION BY ${r(e.foreignKey)}${l}) AS rn FROM ${r(e.target.tableName)}) AS ${r(i)} WHERE ${o}${s}${f}), JSON_ARRAY())`;
+}, Ni = (e, t, n) => {
 	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = (t) => e.junction === void 0 ? void 0 : {
 		projection: e.junction,
 		source: t
-	}, l = r`${z(s, i.sourceKey, r)} = ${z(t, "id", r)}`, u = r`${z(o, "id", r)} = ${z(s, i.targetKey, r)}`, d = e.branch.where === void 0 ? r`` : r` AND ${I(U(e.branch.where), r)}`, f = Bi(e, s, r, !0), p = e.branch.orderBy ?? [];
+	}, l = r`${B(s, i.sourceKey, r)} = ${B(t, "id", r)}`, u = r`${B(o, "id", r)} = ${B(s, i.targetKey, r)}`, d = e.branch.where === void 0 ? r`` : r` AND ${F(W(e.branch.where), r)}`, f = Hi(e, s, r, !0), p = e.branch.orderBy ?? [];
 	if (e.branch.limit === void 0 && e.branch.offset === void 0) {
-		let t = R(o, e.target, e.children, n, c(bi(s)));
-		return t === null ? null : r`COALESCE((SELECT JSON_ARRAYAGG(${t}${p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${z(o, e.column, r)} DESC` : r`${z(o, e.column, r)} ASC`))}` : r``}) FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${u} WHERE ${l}${f}${d}), JSON_ARRAY())`;
+		let t = z(o, e.target, e.children, n, c(Si(s)));
+		return t === null ? null : r`COALESCE((SELECT JSON_ARRAYAGG(${t}${p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${B(o, e.column, r)} DESC` : r`${B(o, e.column, r)} ASC`))}` : r``}) FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${u} WHERE ${l}${f}${d}), JSON_ARRAY())`;
 	}
-	let m = p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${z(o, e.column, r)} DESC` : r`${z(o, e.column, r)} ASC`))}` : r` ORDER BY ${z(o, "id", r)}`, h = e.branch.limit, g = e.branch.offset, _ = h !== void 0 && g !== void 0 ? r` AND ${z(o, "rn", r)} > ${V(g, r)} AND ${z(o, "rn", r)} <= ${V(g + h, r)}` : h === void 0 ? r` AND ${z(o, "rn", r)} > ${V(g, r)}` : r` AND ${z(o, "rn", r)} <= ${V(h, r)}`, ee = e.branch.onJunction === void 0 ? r`` : r` WHERE ${H(U(e.branch.onJunction), s, r)}`, te = R(o, e.target, e.children, n, c(yi(o)));
+	let m = p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${B(o, e.column, r)} DESC` : r`${B(o, e.column, r)} ASC`))}` : r` ORDER BY ${B(o, "id", r)}`, h = e.branch.limit, g = e.branch.offset, _ = h !== void 0 && g !== void 0 ? r` AND ${B(o, "rn", r)} > ${H(g, r)} AND ${B(o, "rn", r)} <= ${H(g + h, r)}` : h === void 0 ? r` AND ${B(o, "rn", r)} > ${H(g, r)}` : r` AND ${B(o, "rn", r)} <= ${H(h, r)}`, ee = e.branch.onJunction === void 0 ? r`` : r` WHERE ${U(W(e.branch.onJunction), s, r)}`, te = z(o, e.target, e.children, n, c(xi(o)));
 	if (te === null) return null;
-	let ne = e.junction === void 0 ? r`` : vi(e.junction, s, r);
-	return r`COALESCE((SELECT JSON_ARRAYAGG(${te} ORDER BY ${z(o, "rn", r)}) FROM (SELECT ${r(o)}.*${ne}, ${z(s, i.sourceKey, r)} AS ${r(`__src_${i.sourceKey}`)}, ROW_NUMBER() OVER (PARTITION BY ${z(s, i.sourceKey, r)}${m}) AS rn FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${u}${ee}) AS ${r(o)} WHERE ${z(o, `__src_${i.sourceKey}`, r)} = ${z(t, "id", r)}${d}${_}), JSON_ARRAY())`;
-}, Mi = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = Ni(i, t.table, t.children, n);
+	let ne = e.junction === void 0 ? r`` : bi(e.junction, s, r);
+	return r`COALESCE((SELECT JSON_ARRAYAGG(${te} ORDER BY ${B(o, "rn", r)}) FROM (SELECT ${r(o)}.*${ne}, ${B(s, i.sourceKey, r)} AS ${r(`__src_${i.sourceKey}`)}, ROW_NUMBER() OVER (PARTITION BY ${B(s, i.sourceKey, r)}${m}) AS rn FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${u}${ee}) AS ${r(o)} WHERE ${B(o, `__src_${i.sourceKey}`, r)} = ${B(t, "id", r)}${d}${_}), JSON_ARRAY())`;
+}, Pi = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = Fi(i, t.table, t.children, n);
 	if (a === null) return null;
-	let o = e.predicate ? r` WHERE ${H(e.predicate, i, r)}` : r``, s = x(e).length > 0 ? r` ORDER BY ${r.csv(x(e).map((e) => e.direction === "desc" ? r`${z(i, e.column, r)} DESC` : r`${z(i, e.column, r)} ASC`))}` : r``, c = r``, l = r``;
+	let o = e.predicate ? r` WHERE ${U(e.predicate, i, r)}` : r``, s = x(e).length > 0 ? r` ORDER BY ${r.csv(x(e).map((e) => e.direction === "desc" ? r`${B(i, e.column, r)} DESC` : r`${B(i, e.column, r)} ASC`))}` : r``, c = r``, l = r``;
 	if (e.skip !== void 0) {
 		let t = x(e).length > 0 ? s : r` ORDER BY (SELECT NULL)`;
-		l = e.take === void 0 ? r`${t} OFFSET ${V(e.skip, r)} ROWS` : r`${t} OFFSET ${V(e.skip, r)} ROWS FETCH NEXT ${V(e.take, r)} ROWS ONLY`;
-	} else e.take !== void 0 && (c = r`TOP ${V(e.take, r)} `);
+		l = e.take === void 0 ? r`${t} OFFSET ${H(e.skip, r)} ROWS` : r`${t} OFFSET ${H(e.skip, r)} ROWS FETCH NEXT ${H(e.take, r)} ROWS ONLY`;
+	} else e.take !== void 0 && (c = r`TOP ${H(e.take, r)} `);
 	let u = e.skip === void 0 ? s : r``;
 	return r`SELECT ${c}(SELECT ${a} FOR JSON PATH, INCLUDE_NULL_VALUES, WITHOUT_ARRAY_WRAPPER) AS ${r("__row")} FROM ${r(t.table.tableName)} AS ${r(i)}${o}${u}${l}`;
-}, Ni = (e, t, n, r, i) => {
+}, Fi = (e, t, n, r, i) => {
 	let a = r.sql, o = [];
-	for (let n of Object.keys(t.fields)) o.push(a`${z(e, n, a)} AS ${a(n)}`);
-	if (i !== void 0) for (let e of i.projection.present) o.push(a`${z(i.source.alias, i.source.physical(e), a)} AS ${Pi(`_junction.${e}`, a)}`);
+	for (let n of Object.keys(t.fields)) o.push(a`${B(e, n, a)} AS ${a(n)}`);
+	if (i !== void 0) for (let e of i.projection.present) o.push(a`${B(i.source.alias, i.source.physical(e), a)} AS ${Ii(`_junction.${e}`, a)}`);
 	for (let t of n) {
-		let n = Fi(t, e, r);
+		let n = Li(t, e, r);
 		if (n === null) return null;
 		o.push(n);
 	}
 	return a.csv(o);
-}, Pi = (e, t) => t.unsafe(`[${e.replace(/]/g, "]]")}]`), Fi = (e, t, n) => {
+}, Ii = (e, t) => t.unsafe(`[${e.replace(/]/g, "]]")}]`), Li = (e, t, n) => {
 	switch (e.relation.kind) {
-		case "one": return Kr(e) ? Ri(qr(e), t, n) : Ii(e, t, n);
-		case "many": return Ri(e, t, n);
-		case "manyToMany": return zi(e, t, n);
+		case "one": return L(e) ? Bi(Yr(e), t, n) : Ri(e, t, n);
+		case "many": return Bi(e, t, n);
+		case "manyToMany": return Vi(e, t, n);
 	}
-}, Ii = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = Ni(i, e.target, e.children, n);
+}, Ri = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = Fi(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = e.fkSide === "source" ? r`${z(i, "id", r)} = ${z(t, e.foreignKey, r)}` : r`${z(i, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}`;
+	let o = e.fkSide === "source" ? r`${B(i, "id", r)} = ${B(t, e.foreignKey, r)}` : r`${B(i, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}`;
 	return r`JSON_QUERY((SELECT TOP 1 ${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o} FOR JSON PATH, INCLUDE_NULL_VALUES, WITHOUT_ARRAY_WRAPPER)) AS ${r(e.relationName)}`;
-}, Li = (e, t, n) => {
+}, zi = (e, t, n) => {
 	if (e.offset !== void 0) {
-		let r = e.orderBy && e.orderBy.length > 0 ? t : n` ORDER BY (SELECT NULL)`, i = e.limit === void 0 ? n`${r} OFFSET ${V(e.offset, n)} ROWS` : n`${r} OFFSET ${V(e.offset, n)} ROWS FETCH NEXT ${V(e.limit, n)} ROWS ONLY`;
+		let r = e.orderBy && e.orderBy.length > 0 ? t : n` ORDER BY (SELECT NULL)`, i = e.limit === void 0 ? n`${r} OFFSET ${H(e.offset, n)} ROWS` : n`${r} OFFSET ${H(e.offset, n)} ROWS FETCH NEXT ${H(e.limit, n)} ROWS ONLY`;
 		return {
 			top: n``,
 			pagination: i,
@@ -1364,33 +1379,33 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		};
 	}
 	return {
-		top: e.limit === void 0 ? n`` : n`TOP ${V(e.limit, n)} `,
+		top: e.limit === void 0 ? n`` : n`TOP ${H(e.limit, n)} `,
 		pagination: n``,
 		finalOrder: t
 	};
-}, Ri = (e, t, n) => {
-	let r = n.sql, i = n.nextAlias(), a = Ni(i, e.target, e.children, n);
+}, Bi = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = Fi(i, e.target, e.children, n);
 	if (a === null) return null;
-	let o = e.branch.where === void 0 ? r`` : r` AND ${H(e.branch.where, i, r)}`, s = L(i, e.branch.orderBy, r), { top: c, pagination: l, finalOrder: u } = Li(e.branch, s, r);
-	return r`ISNULL(JSON_QUERY((SELECT ${c}${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${z(i, e.foreignKey, r)} = ${z(t, e.sourceKey, r)}${o}${u}${l} FOR JSON PATH, INCLUDE_NULL_VALUES)), JSON_QUERY('[]')) AS ${r(e.relationName)}`;
-}, zi = (e, t, n) => {
-	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = Ni(o, e.target, e.children, n, e.junction === void 0 ? void 0 : {
+	let o = e.branch.where === void 0 ? r`` : r` AND ${U(e.branch.where, i, r)}`, s = R(i, e.branch.orderBy, r), { top: c, pagination: l, finalOrder: u } = zi(e.branch, s, r);
+	return r`ISNULL(JSON_QUERY((SELECT ${c}${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${B(i, e.foreignKey, r)} = ${B(t, e.sourceKey, r)}${o}${u}${l} FOR JSON PATH, INCLUDE_NULL_VALUES)), JSON_QUERY('[]')) AS ${r(e.relationName)}`;
+}, Vi = (e, t, n) => {
+	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = Fi(o, e.target, e.children, n, e.junction === void 0 ? void 0 : {
 		projection: e.junction,
-		source: bi(s)
+		source: Si(s)
 	});
 	if (c === null) return null;
-	let l = e.branch.where === void 0 ? r`` : r` AND ${H(e.branch.where, o, r)}`, u = Bi(e, s, r), d = L(o, e.branch.orderBy, r), { top: f, pagination: p, finalOrder: m } = Li(e.branch, d, r);
-	return r`ISNULL(JSON_QUERY((SELECT ${f}${c} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${z(o, "id", r)} = ${z(s, i.targetKey, r)} WHERE ${z(s, i.sourceKey, r)} = ${z(t, "id", r)}${u}${l}${m}${p} FOR JSON PATH, INCLUDE_NULL_VALUES)), JSON_QUERY('[]')) AS ${r(e.relationName)}`;
-}, z = (e, t, n) => e === void 0 ? n`${n(t)}` : n`${n(e)}.${n(t)}`, B = (e, t) => t.unsafe(`'${e.replace(/'/g, "''")}'`), V = (e, t) => {
+	let l = e.branch.where === void 0 ? r`` : r` AND ${U(e.branch.where, o, r)}`, u = Hi(e, s, r), d = R(o, e.branch.orderBy, r), { top: f, pagination: p, finalOrder: m } = zi(e.branch, d, r);
+	return r`ISNULL(JSON_QUERY((SELECT ${f}${c} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${B(o, "id", r)} = ${B(s, i.targetKey, r)} WHERE ${B(s, i.sourceKey, r)} = ${B(t, "id", r)}${u}${l}${m}${p} FOR JSON PATH, INCLUDE_NULL_VALUES)), JSON_QUERY('[]')) AS ${r(e.relationName)}`;
+}, B = (e, t, n) => e === void 0 ? n`${n(t)}` : n`${n(e)}.${n(t)}`, V = (e, t) => t.unsafe(`'${e.replace(/'/g, "''")}'`), H = (e, t) => {
 	if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw Error(`literalInt: expected non-negative integer, got ${e}`);
 	return t.unsafe(String(e));
-}, H = (e, t, n) => I(Vi(e, t), n), Bi = (e, t, n, r = !1) => {
+}, U = (e, t, n) => F(Ui(e, t), n), Hi = (e, t, n, r = !1) => {
 	let i = e.branch.onJunction;
-	return i === void 0 ? n`` : n` AND ${H(r ? U(i) : i, t, n)}`;
-}, Vi = (e, t) => {
-	if ("not" in e) return { not: Vi(e.not, t) };
-	if ("and" in e) return { and: e.and.map((e) => Vi(e, t)) };
-	if ("or" in e) return { or: e.or.map((e) => Vi(e, t)) };
+	return i === void 0 ? n`` : n` AND ${U(r ? W(i) : i, t, n)}`;
+}, Ui = (e, t) => {
+	if ("not" in e) return { not: Ui(e.not, t) };
+	if ("and" in e) return { and: e.and.map((e) => Ui(e, t)) };
+	if ("or" in e) return { or: e.or.map((e) => Ui(e, t)) };
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
 		let n = e;
 		return {
@@ -1404,23 +1419,23 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		...n,
 		column: `${t}.${n.column}`
 	};
-}, U = (e) => {
-	if ("not" in e) return { not: U(e.not) };
-	if ("and" in e) return { and: e.and.map((e) => U(e)) };
-	if ("or" in e) return { or: e.or.map((e) => U(e)) };
+}, W = (e) => {
+	if ("not" in e) return { not: W(e.not) };
+	if ("and" in e) return { and: e.and.map((e) => W(e)) };
+	if ("or" in e) return { or: e.or.map((e) => W(e)) };
 	if (e.op === "subquery-in" || e.op === "subquery-not-in" || e.op === "exists" || e.op === "not-exists") return e;
 	let t = e;
 	return {
 		...t,
-		value: Hi(t.value)
+		value: Wi(t.value)
 	};
-}, Hi = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Hi(e)) : e, Ui = Symbol.for("@voltro/database/coreTablesRegistry"), Wi = globalThis, Gi = Wi[Ui] ?? (Wi[Ui] = {}), Ki = (e) => {
-	e.actors !== void 0 && (Gi.actors = e.actors), e.tenants !== void 0 && (Gi.tenants = e.tenants);
-}, qi = (e, t) => () => {
+}, Wi = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Wi(e)) : e, Gi = Symbol.for("@voltro/database/coreTablesRegistry"), Ki = globalThis, qi = Ki[Gi] ?? (Ki[Gi] = {}), Ji = (e) => {
+	e.actors !== void 0 && (qi.actors = e.actors), e.tenants !== void 0 && (qi.tenants = e.tenants);
+}, Yi = (e, t) => () => {
 	let n = e();
 	if (n === void 0) throw Error(`core '${t}' table not registered; expected the framework CLI or your migrate step to call registerCoreTables({ ${t}: () => ${t}Table }) before the database handle is constructed`);
 	return n();
-}, Ji = () => qi(() => Gi.actors, "actors"), Yi = () => qi(() => Gi.tenants, "tenants"), Xi = T("actors", {
+}, Xi = () => Yi(() => qi.actors, "actors"), Zi = () => Yi(() => qi.tenants, "tenants"), Qi = T("actors", {
 	id: _(),
 	kind: t().oneOf([
 		"user",
@@ -1430,73 +1445,73 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	]),
 	displayName: t().nullable(),
 	createdAt: C().default("now")
-}), Zi = (e, t) => ({
+}), $i = (e, t) => ({
 	column: e,
 	op: "eq",
 	value: t
-}), Qi = (e, t) => ({
+}), ea = (e, t) => ({
 	column: e,
 	op: "neq",
 	value: t
-}), $i = (e, t) => ({
+}), ta = (e, t) => ({
 	column: e,
 	op: "gt",
 	value: t
-}), ea = (e, t) => ({
+}), na = (e, t) => ({
 	column: e,
 	op: "gte",
 	value: t
-}), ta = (e, t) => ({
+}), ra = (e, t) => ({
 	column: e,
 	op: "lt",
 	value: t
-}), na = (e, t) => ({
+}), ia = (e, t) => ({
 	column: e,
 	op: "lte",
 	value: t
-}), ra = (e, t) => ({
+}), aa = (e, t) => ({
 	column: e,
 	op: "in",
 	value: t
-}), ia = (e, t) => ({
+}), oa = (e, t) => ({
 	column: e,
 	op: "notIn",
 	value: t
-}), aa = (e, t) => ({
+}), sa = (e, t) => ({
 	column: e,
 	op: "contains",
 	value: t
-}), oa = (e, t) => ({
+}), ca = (e, t) => ({
 	column: e,
 	op: "startsWith",
 	value: t
-}), sa = (e, t) => ({
+}), la = (e, t) => ({
 	column: e,
 	op: "arrayContains",
 	value: t
-}), ca = (e, t) => ({
+}), ua = (e, t) => ({
 	column: e,
 	op: "arrayOverlaps",
 	value: t
-}), la = (e, t) => ({
+}), da = (e, t) => ({
 	column: e,
 	op: "arrayHas",
 	value: t
-}), ua = {
+}), fa = {
 	column: "id",
 	op: "in",
 	value: []
-}, da = (e) => ({
+}, pa = (e) => ({
 	column: e,
 	op: "isNull"
-}), fa = (e) => ({
+}), ma = (e) => ({
 	column: e,
 	op: "isNotNull"
-}), pa = (e, t) => ({
+}), ha = (e, t) => ({
 	column: e,
 	op: "spatial",
 	value: t
-}), ma = (...e) => ({ and: e }), ha = (...e) => ({ or: e }), ga = (e) => ({ not: e }), _a = (e, ...t) => {
+}), ga = (...e) => ({ and: e }), _a = (...e) => ({ or: e }), va = (e) => ({ not: e }), ya = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonField("${e}"): at least one path segment is required`);
 	let n = (n, r) => ({
 		column: e,
@@ -1518,33 +1533,33 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		isNull: () => n("isNull"),
 		isNotNull: () => n("isNotNull")
 	};
-}, va = (e) => "descriptor" in e ? e.descriptor : e, ya = (e, t) => ({
+}, ba = (e) => "descriptor" in e ? e.descriptor : e, xa = (e, t) => ({
 	column: e,
 	op: "subquery-in",
-	subquery: va(t)
-}), ba = (e, t) => ({
+	subquery: ba(t)
+}), Sa = (e, t) => ({
 	column: e,
 	op: "subquery-not-in",
-	subquery: va(t)
-}), xa = (e) => ({
+	subquery: ba(t)
+}), Ca = (e) => ({
 	op: "exists",
-	subquery: va(e)
-}), Sa = (e) => ({
+	subquery: ba(e)
+}), wa = (e) => ({
 	op: "not-exists",
-	subquery: va(e)
-}), Ca = (e, t) => e === t || e instanceof Date && t instanceof Date && e.getTime() === t.getTime(), wa = (e, t) => {
+	subquery: ba(e)
+}), Ta = (e, t) => e === t || e instanceof Date && t instanceof Date && e.getTime() === t.getTime(), Ea = (e, t) => {
 	if (e == null || t == null) return null;
 	let n = e instanceof Date ? e.getTime() : e, r = t instanceof Date ? t.getTime() : t;
 	return typeof n == typeof r ? n === r ? 0 : n > r ? 1 : -1 : null;
-}, Ta = (e, t, n = null) => {
+}, Da = (e, t, n = null) => {
 	if (!t) return !1;
-	if ("not" in e) return !Ta(e.not, t, n);
+	if ("not" in e) return !Da(e.not, t, n);
 	if ("and" in e) {
-		for (let r of e.and) if (!Ta(r, t, n)) return !1;
+		for (let r of e.and) if (!Da(r, t, n)) return !1;
 		return !0;
 	}
 	if ("or" in e) {
-		for (let r of e.or) if (Ta(r, t, n)) return !0;
+		for (let r of e.or) if (Da(r, t, n)) return !0;
 		return !1;
 	}
 	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
@@ -1561,14 +1576,14 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	}
 	let r = e, i = t[r.column];
 	switch (r.op) {
-		case "eq": return Ca(i, r.value);
-		case "neq": return !Ca(i, r.value);
-		case "gt": return (wa(i, r.value) ?? -1) > 0;
-		case "gte": return (wa(i, r.value) ?? -1) >= 0;
-		case "lt": return (wa(i, r.value) ?? 1) < 0;
-		case "lte": return (wa(i, r.value) ?? 1) <= 0;
-		case "in": return Array.isArray(r.value) && r.value.some((e) => Ca(i, e));
-		case "notIn": return Array.isArray(r.value) && !r.value.some((e) => Ca(i, e));
+		case "eq": return Ta(i, r.value);
+		case "neq": return !Ta(i, r.value);
+		case "gt": return (Ea(i, r.value) ?? -1) > 0;
+		case "gte": return (Ea(i, r.value) ?? -1) >= 0;
+		case "lt": return (Ea(i, r.value) ?? 1) < 0;
+		case "lte": return (Ea(i, r.value) ?? 1) <= 0;
+		case "in": return Array.isArray(r.value) && r.value.some((e) => Ta(i, e));
+		case "notIn": return Array.isArray(r.value) && !r.value.some((e) => Ta(i, e));
 		case "contains": return typeof i == "string" && typeof r.value == "string" && i.toLowerCase().includes(r.value.toLowerCase());
 		case "startsWith": return typeof i == "string" && typeof r.value == "string" && i.startsWith(r.value);
 		case "arrayContains": {
@@ -1584,17 +1599,17 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		case "isNotNull": return i != null;
 		case "spatial": throw Error("@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.");
 	}
-}, Ea = function* (e) {
+}, Oa = function* (e) {
 	if ("not" in e) {
-		yield* Ea(e.not);
+		yield* Oa(e.not);
 		return;
 	}
 	if ("and" in e) {
-		for (let t of e.and) yield* Ea(t);
+		for (let t of e.and) yield* Oa(t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* Ea(t);
+		for (let t of e.or) yield* Oa(t);
 		return;
 	}
 	e.op === "subquery-in" || e.op === "subquery-not-in" ? yield {
@@ -1604,46 +1619,46 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		kind: "exists",
 		descriptor: e.subquery
 	});
-}, Da = function* (e, t = !0) {
+}, ka = function* (e, t = !0) {
 	if ("not" in e) {
-		yield* Da(e.not, !1);
+		yield* ka(e.not, !1);
 		return;
 	}
 	if ("and" in e) {
-		for (let n of e.and) yield* Da(n, t);
+		for (let n of e.and) yield* ka(n, t);
 		return;
 	}
 	if ("or" in e) {
-		for (let t of e.or) yield* Da(t, !1);
+		for (let t of e.or) yield* ka(t, !1);
 		return;
 	}
 	e.op !== "subquery-in" && e.op !== "subquery-not-in" && e.op !== "exists" && e.op !== "not-exists" && (yield {
 		...e,
 		conjunctive: t
 	});
-}, Oa = (e, t) => ({
+}, Aa = (e, t) => ({
 	...t,
 	...e,
 	origin: e.origin ?? "injected"
-}), ka = (e, t, n = {}) => ({
+}), ja = (e, t, n = {}) => ({
 	table: e,
 	op: "insert",
 	old: null,
 	new: t,
 	...n
-}), Aa = (e, t, n, r = {}) => ({
+}), Ma = (e, t, n, r = {}) => ({
 	table: e,
 	op: "update",
 	old: t,
 	new: n,
 	...r
-}), ja = (e, t, n = {}) => ({
+}), Na = (e, t, n = {}) => ({
 	table: e,
 	op: "delete",
 	old: t,
 	new: null,
 	...n
-}), Ma = (e, t, n = {}) => {
+}), Pa = (e, t, n = {}) => {
 	let { at: r = "2026-01-01T00:00:00.000Z", column: i = "deletedAt", ...a } = n;
 	return {
 		table: e,
@@ -1658,13 +1673,13 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		},
 		...a
 	};
-}, Na = (e) => e == null ? "null" : e instanceof Date ? JSON.stringify(e.toISOString()) : typeof e == "bigint" ? JSON.stringify(e.toString()) : Array.isArray(e) ? `[${e.map(Na).join(",")}]` : typeof e == "object" ? `{${Object.entries(e).filter(([, e]) => e !== void 0).sort(([e], [t]) => e < t ? -1 : +(e > t)).map(([e, t]) => `${JSON.stringify(e)}:${Na(t)}`).join(",")}}` : JSON.stringify(e) ?? "null", Pa = (e) => Lt("sha256").update([
+}, Fa = (e) => e == null ? "null" : e instanceof Date ? JSON.stringify(e.toISOString()) : typeof e == "bigint" ? JSON.stringify(e.toString()) : Array.isArray(e) ? `[${e.map(Fa).join(",")}]` : typeof e == "object" ? `{${Object.entries(e).filter(([, e]) => e !== void 0).sort(([e], [t]) => e < t ? -1 : +(e > t)).map(([e, t]) => `${JSON.stringify(e)}:${Fa(t)}`).join(",")}}` : JSON.stringify(e) ?? "null", Ia = (e) => Lt("sha256").update([
 	e.pipe,
 	e.op,
 	e.key,
-	Na(e.next),
-	Na(e.prev)
-].join("\0")).digest("hex").slice(0, 32), Fa = (e, t) => `${e}:${t}`, Ia = (e) => {
+	Fa(e.next),
+	Fa(e.prev)
+].join("\0")).digest("hex").slice(0, 32), La = (e, t) => `${e}:${t}`, Ra = (e) => {
 	let t = e.lastIndexOf(":");
 	if (t <= 0) return null;
 	let n = Number(e.slice(t + 1));
@@ -1672,7 +1687,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		digest: e.slice(0, t),
 		occurrence: n
 	};
-}, La = class {
+}, za = class {
 	#e = /* @__PURE__ */ new Map();
 	#t;
 	#n;
@@ -1694,7 +1709,7 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	}
 	seedFromChangeKeys(e, t) {
 		for (let n of e) {
-			let e = Ia(n);
+			let e = Ra(n);
 			if (e === null) continue;
 			let r = this.#e.get(e.digest), i = Math.max(r?.count ?? 0, e.occurrence + 1);
 			this.#e.set(e.digest, {
@@ -1715,70 +1730,70 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			this.#e.delete(e.value);
 		}
 	}
-}, Ra = "VOLTRO_CHANGE_CLAIMS_TTL_HOURS", za = 1, Ba = (e = process.env) => {
-	let t = Number(e[Ra]);
+}, Ba = "VOLTRO_CHANGE_CLAIMS_TTL_HOURS", Va = 1, Ha = (e = process.env) => {
+	let t = Number(e[Ba]);
 	return (Number.isFinite(t) && t > 0 ? t : 1) * 2 * 36e5;
-}, Va = new Rt(), Ha = (e, t) => Va.run(e, t), Ua = () => Va.getStore(), Wa = (e) => {
-	let t = e ?? Va.getStore();
+}, Ua = new Rt(), Wa = (e, t) => Ua.run(e, t), Ga = () => Ua.getStore(), Ka = (e) => {
+	let t = e ?? Ua.getStore();
 	return t === void 0 ? {} : {
 		...t.traceId === void 0 ? {} : { traceId: t.traceId },
 		...t.subjectId === void 0 ? {} : { subjectId: t.subjectId },
 		...t.procedure === void 0 ? {} : { procedure: t.procedure },
 		...t.via === void 0 ? {} : { via: t.via }
 	};
-}, Ga = (e) => {
-	let t = Va.getStore();
-	return t === void 0 ? e(void 0) : Va.run(t, () => e(t));
-}, Ka = 3e4, qa = 1e4, W = /* @__PURE__ */ new Map(), G = 0, Ja = (e, t, n) => `${e}\u0000${t}\u0000${String(n)}`, Ya = (e) => {
-	for (let [t, n] of W) {
-		let r = n.filter((t) => e - t.at < Ka);
-		G -= n.length - r.length, r.length === 0 ? W.delete(t) : r.length !== n.length && W.set(t, r);
-	}
-}, Xa = (e, t) => {
+}, qa = (e) => {
+	let t = Ua.getStore();
+	return t === void 0 ? e(void 0) : Ua.run(t, () => e(t));
+}, Ja = 3e4, Ya = 1e4, G = /* @__PURE__ */ new Map(), K = 0, Xa = (e, t, n) => `${e}\u0000${t}\u0000${String(n)}`, Za = (e) => {
+	for (let [t, n] of G) {
+		let r = n.filter((t) => e - t.at < Ja);
+		K -= n.length - r.length, r.length === 0 ? G.delete(t) : r.length !== n.length && G.set(t, r);
+	}
+}, Qa = (e, t) => {
 	if (t.traceId === void 0 && t.subjectId === void 0 && t.procedure === void 0) return;
 	let n = Date.now();
-	if (G >= qa && Ya(n), G >= qa) return;
-	let r = W.get(e);
-	r === void 0 ? W.set(e, [{
+	if (K >= Ya && Za(n), K >= Ya) return;
+	let r = G.get(e);
+	r === void 0 ? G.set(e, [{
 		attribution: t,
 		at: n
 	}]) : r.push({
 		attribution: t,
 		at: n
-	}), G += 1;
-}, Za = (e) => {
-	let t = W.get(e);
+	}), K += 1;
+}, $a = (e) => {
+	let t = G.get(e);
 	if (t === void 0 || t.length === 0) return;
 	let n = t.shift();
-	if (--G, t.length === 0 && W.delete(e), !(Date.now() - n.at >= Ka)) return n.attribution;
-}, Qa = (e) => (W.get(e)?.length ?? 0) > 0, K = /* @__PURE__ */ new Map(), $a = /* @__PURE__ */ new Map(), eo = /* @__PURE__ */ new Map(), to = 250, no = (e) => {
-	let t = $a.get(e);
+	if (--K, t.length === 0 && G.delete(e), !(Date.now() - n.at >= Ja)) return n.attribution;
+}, eo = (e) => (G.get(e)?.length ?? 0) > 0, q = /* @__PURE__ */ new Map(), to = /* @__PURE__ */ new Map(), no = /* @__PURE__ */ new Map(), ro = 250, io = (e) => {
+	let t = to.get(e);
 	if (t === void 0) return;
-	$a.delete(e);
-	let n = eo.get(e);
-	n !== void 0 && (clearTimeout(n), eo.delete(e));
+	to.delete(e);
+	let n = no.get(e);
+	n !== void 0 && (clearTimeout(n), no.delete(e));
 	for (let e of t) e();
-}, ro = (e) => {
-	K.set(e, (K.get(e) ?? 0) + 1);
-}, io = (e) => {
-	let t = (K.get(e) ?? 0) - 1;
+}, ao = (e) => {
+	q.set(e, (q.get(e) ?? 0) + 1);
+}, oo = (e) => {
+	let t = (q.get(e) ?? 0) - 1;
 	if (t > 0) {
-		K.set(e, t);
+		q.set(e, t);
 		return;
 	}
-	K.delete(e), no(e);
-}, ao = (e, t, n, r) => {
-	let i = n == null ? void 0 : Ja(e, t, n), a = () => r(i === void 0 ? void 0 : Za(i));
+	q.delete(e), io(e);
+}, so = (e, t, n, r) => {
+	let i = n == null ? void 0 : Xa(e, t, n), a = () => r(i === void 0 ? void 0 : $a(i));
 	if (i === void 0) {
 		a();
 		return;
 	}
-	if (Qa(i)) {
+	if (eo(i)) {
 		a();
 		return;
 	}
-	let o = $a.get(e);
-	if (o === void 0 && (K.get(e) ?? 0) === 0) {
+	let o = to.get(e);
+	if (o === void 0 && (q.get(e) ?? 0) === 0) {
 		a();
 		return;
 	}
@@ -1786,91 +1801,91 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		o.push(a);
 		return;
 	}
-	$a.set(e, [a]);
-	let s = setTimeout(() => no(e), to);
-	typeof s == "object" && typeof s.unref == "function" && s.unref(), eo.set(e, s);
-}, oo = () => {
-	W.clear(), G = 0, K.clear();
-	for (let e of eo.values()) clearTimeout(e);
-	eo.clear(), $a.clear();
-}, so = () => G, co = 64, lo = "\0", uo = 32, fo = (e, ...t) => `${e}_${Lt("sha256").update(t.map(String).join(lo)).digest("hex").slice(0, uo)}`, po = (e) => e.length + 1 + uo, q = /* @__PURE__ */ new Map(), mo = (e, t) => {
-	q.set(e, {
+	to.set(e, [a]);
+	let s = setTimeout(() => io(e), ro);
+	typeof s == "object" && typeof s.unref == "function" && s.unref(), no.set(e, s);
+}, co = () => {
+	G.clear(), K = 0, q.clear();
+	for (let e of no.values()) clearTimeout(e);
+	no.clear(), to.clear();
+}, lo = () => K, uo = 64, fo = "\0", po = 32, mo = (e, ...t) => `${e}_${Lt("sha256").update(t.map(String).join(fo)).digest("hex").slice(0, po)}`, ho = (e) => e.length + 1 + po, J = /* @__PURE__ */ new Map(), go = (e, t) => {
+	J.set(e, {
 		recorder: t.recorder,
 		tables: new Set(t.tables),
 		ownTables: new Set(t.ownTables)
 	});
-}, ho = (e) => {
-	q.delete(e);
-}, go = () => q.clear(), _o = new Rt(), vo = (e) => _o.run({ n: 1 }, e), yo = (e) => D.suspend(() => {
-	let t = _o.getStore();
+}, _o = (e) => {
+	J.delete(e);
+}, vo = () => J.clear(), yo = new Rt(), bo = (e) => yo.run({ n: 1 }, e), xo = (e) => D.suspend(() => {
+	let t = yo.getStore();
 	if (t !== void 0) return t.n += 1, D.ensuring(e, D.sync(() => {
 		--t.n;
 	}));
 	let n = { n: 1 };
-	return _o.enterWith(n), D.ensuring(e, D.sync(() => {
+	return yo.enterWith(n), D.ensuring(e, D.sync(() => {
 		--n.n;
 	}));
-}), bo = () => (_o.getStore()?.n ?? 0) > 0, xo = (e) => {
-	if (q.size === 0 || (_o.getStore()?.n ?? 0) > 0) return !1;
-	for (let t of q.values()) if (!t.ownTables.has(e) && t.tables.has(e)) return !0;
+}), So = () => (yo.getStore()?.n ?? 0) > 0, Co = (e) => {
+	if (J.size === 0 || (yo.getStore()?.n ?? 0) > 0) return !1;
+	for (let t of J.values()) if (!t.ownTables.has(e) && t.tables.has(e)) return !0;
 	return !1;
-}, So = async (e, t) => {
-	if (q.size !== 0) {
-		for (let [n, r] of q.entries()) if (!r.ownTables.has(t.table) && r.tables.has(t.table)) try {
+}, wo = async (e, t) => {
+	if (J.size !== 0) {
+		for (let [n, r] of J.entries()) if (!r.ownTables.has(t.table) && r.tables.has(t.table)) try {
 			await r.recorder(e, t);
 		} catch (e) {
 			let r = gn(e);
 			throw r === void 0 ? e : Error(`write recorder '${n}' failed while recording a ${t.op} on '${t.table}': ${r}`, { cause: e });
 		}
 	}
-}, Co = Nt.exponential({
+}, To = Nt.exponential({
 	start: 5e-4,
 	factor: 2,
 	count: 16
-}), wo = O.counter("voltro_db_queries_total", { description: "Database operations executed, by dialect and operation kind." }), To = O.histogram("voltro_db_query_duration_seconds", Co, "Database operation duration in seconds, by dialect and operation kind."), Eo = O.counter("voltro_db_errors_total", { description: "Database operations that threw, by dialect and operation kind." }), Do = O.gauge("voltro_db_operations_in_flight", { description: "Database operations currently executing, by dialect. An upper bound on connections the framework holds; NOT the driver pool's waiting count." }), Oo = O.counter("voltro_db_eager_fallback_total", { description: "Eager-load queries that degraded from the single-roundtrip JSON-agg path to the multi-query walker, by dialect and reason." }), ko = [], Ao = /* @__PURE__ */ new Map(), jo = /* @__PURE__ */ new Map(), Mo = /* @__PURE__ */ new Map(), No = (e, t) => {
-	let n = `${e}\u0000${t}`, r = Ao.get(n);
+}), Eo = O.counter("voltro_db_queries_total", { description: "Database operations executed, by dialect and operation kind." }), Do = O.histogram("voltro_db_query_duration_seconds", To, "Database operation duration in seconds, by dialect and operation kind."), Oo = O.counter("voltro_db_errors_total", { description: "Database operations that threw, by dialect and operation kind." }), ko = O.gauge("voltro_db_operations_in_flight", { description: "Database operations currently executing, by dialect. An upper bound on connections the framework holds; NOT the driver pool's waiting count." }), Ao = O.counter("voltro_db_eager_fallback_total", { description: "Eager-load queries that degraded from the single-roundtrip JSON-agg path to the multi-query walker, by dialect and reason." }), jo = [], Mo = /* @__PURE__ */ new Map(), No = /* @__PURE__ */ new Map(), Po = /* @__PURE__ */ new Map(), Fo = (e, t) => {
+	let n = `${e}\u0000${t}`, r = Mo.get(n);
 	if (r !== void 0) return r;
 	let i = (n) => O.tagged(O.tagged(n, "dialect", e), "op", t), a = {
-		count: i(wo),
-		duration: i(To),
-		errors: i(Eo)
+		count: i(Eo),
+		duration: i(Do),
+		errors: i(Oo)
 	};
-	return Ao.set(n, a), a;
-}, Po = () => {
-	Ao.clear(), jo.clear(), Mo.clear();
-}, Fo = () => Ao.size + jo.size + Mo.size, Io = /* @__PURE__ */ new Map(), Lo = (e, t) => {
-	let n = Math.max(0, (Io.get(e) ?? 0) + t);
-	n === 0 ? Io.delete(e) : Io.set(e, n);
-	let r = jo.get(e);
-	r === void 0 && (r = O.tagged(Do, "dialect", e), jo.set(e, r)), r.unsafeUpdate(n, ko);
-}, Ro = (e) => Io.get(e) ?? 0, zo = (e) => {
-	let t = No(String(e.dialect), e.op);
-	t.count.unsafeUpdate(1, ko), t.duration.unsafeUpdate(e.durationMs / 1e3, ko), e.status === "error" && t.errors.unsafeUpdate(1, ko);
-}, Bo = async (e, t, n) => {
+	return Mo.set(n, a), a;
+}, Io = () => {
+	Mo.clear(), No.clear(), Po.clear();
+}, Lo = () => Mo.size + No.size + Po.size, Ro = /* @__PURE__ */ new Map(), zo = (e, t) => {
+	let n = Math.max(0, (Ro.get(e) ?? 0) + t);
+	n === 0 ? Ro.delete(e) : Ro.set(e, n);
+	let r = No.get(e);
+	r === void 0 && (r = O.tagged(ko, "dialect", e), No.set(e, r)), r.unsafeUpdate(n, jo);
+}, Bo = (e) => Ro.get(e) ?? 0, Vo = (e) => {
+	let t = Fo(String(e.dialect), e.op);
+	t.count.unsafeUpdate(1, jo), t.duration.unsafeUpdate(e.durationMs / 1e3, jo), e.status === "error" && t.errors.unsafeUpdate(1, jo);
+}, Ho = async (e, t, n) => {
 	let r = performance.now(), i = String(e);
-	Lo(i, 1);
+	zo(i, 1);
 	let a = "ok";
 	try {
 		return await n();
 	} catch (e) {
 		throw a = "error", e;
 	} finally {
-		Lo(i, -1), zo({
+		zo(i, -1), Vo({
 			dialect: e,
 			op: t,
 			durationMs: performance.now() - r,
 			status: a
 		});
 	}
-}, Vo = 3e5, Ho = (e) => {
+}, Uo = 3e5, Wo = (e) => {
 	if (e == null || e === "") return;
 	let t = Number(e);
 	return Number.isFinite(t) && t >= 0 ? Math.floor(t) : void 0;
-}, Uo = (e, t = process.env) => Ho(t.VOLTRO_DB_EAGER_FALLBACK_WARN_INTERVAL_MS) ?? Ho(e) ?? 3e5, Wo = (e, t = {}) => {
-	let n = Uo(t.warnIntervalMs), r = t.now ?? (() => Date.now()), i = /* @__PURE__ */ new Map();
+}, Go = (e, t = process.env) => Wo(t.VOLTRO_DB_EAGER_FALLBACK_WARN_INTERVAL_MS) ?? Wo(e) ?? 3e5, Ko = (e, t = {}) => {
+	let n = Go(t.warnIntervalMs), r = t.now ?? (() => Date.now()), i = /* @__PURE__ */ new Map();
 	return (t) => {
-		let a = `${t.dialect} ${t.reason}`, o = Mo.get(a);
-		o === void 0 && (o = O.tagged(O.tagged(Oo, "dialect", String(t.dialect)), "reason", t.reason), Mo.set(a, o)), o.unsafeUpdate(1, ko);
+		let a = `${t.dialect} ${t.reason}`, o = Po.get(a);
+		o === void 0 && (o = O.tagged(O.tagged(Ao, "dialect", String(t.dialect)), "reason", t.reason), Po.set(a, o)), o.unsafeUpdate(1, jo);
 		let s = `${t.table}\u0000${t.reason}`, c = i.get(s), l = c === void 0 || n > 0 && r() - c >= n, u = {
 			table: t.table,
 			dialect: String(t.dialect),
@@ -1884,10 +1899,10 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		}
 		i.set(s, r()), e.warn(t.reason === "execute-failed" ? "eager-load JSON-agg statement FAILED and was re-run on the multi-query walker — this query pays both paths on every call. Counted as voltro_db_eager_fallback_total{reason=\"execute-failed\"}." : "eager-load could not be compiled to a single JSON-agg roundtrip and is running on the multi-query walker — one round trip per relation level, on every call. Counted as voltro_db_eager_fallback_total{reason=\"not-compilable\"}.", u);
 	};
-}, Go = (e) => {
+}, qo = (e) => {
 	if (Mt.isSuccess(e)) return e.value;
 	throw kt.squash(e.cause);
-}, Ko = "10 millis", qo = 3, Jo = async (e) => {
+}, Jo = "10 millis", Yo = 3, Xo = async (e) => {
 	let t = 0, n = D.suspend(() => {
 		let n = ++t;
 		return e.withTransaction(D.flatMap(D.serviceOption(zt), (t) => {
@@ -1898,10 +1913,10 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			});
 			return e.prepare === void 0 ? i : D.flatMap(e.prepare(r), () => i);
 		})).pipe(D.catchAllDefect((t) => e.isRetryable(t) ? D.fail(t) : D.die(t)));
-	}), r = Ft.exponential(Ko).pipe(Ft.compose(Ft.recurs(qo)), Ft.whileInput(e.isRetryable)), i = n.pipe(D.retry(r), D.withSpan(e.span.name, { attributes: { ...e.span.attributes } }));
-	return Bo(e.dialect, "transaction", async () => Go(await e.runPromiseExit(e.wrapProgram === void 0 ? i : e.wrapProgram(i))));
-}, Yo = async (e) => {
-	let t = Ua(), n = t === void 0 ? (e) => e() : (e) => Ha(t, e), r = await Jo({
+	}), r = Ft.exponential(Jo).pipe(Ft.compose(Ft.recurs(Yo)), Ft.whileInput(e.isRetryable)), i = n.pipe(D.retry(r), D.withSpan(e.span.name, { attributes: { ...e.span.attributes } }));
+	return Ho(e.dialect, "transaction", async () => qo(await e.runPromiseExit(e.wrapProgram === void 0 ? i : e.wrapProgram(i))));
+}, Zo = async (e) => {
+	let t = Ga(), n = t === void 0 ? (e) => e() : (e) => Wa(t, e), r = await Xo({
 		...e,
 		body: (r) => {
 			let i = e.makeView(r, t);
@@ -1912,14 +1927,14 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		}
 	});
 	return r.view.commitEvents(), r.result;
-}, Xo = class extends A.TaggedError()("VersionConflict", {
+}, Qo = class extends A.TaggedError()("VersionConflict", {
 	table: A.String,
 	id: A.String,
 	expected: A.Number,
 	actual: A.NullOr(A.Number)
-}) {}, Zo = (e) => {
+}) {}, $o = (e) => {
 	for (let [t, n] of Object.entries(e)) if (n?.definition?.versionColumn === !0) return t;
-}, Qo = (e) => {
+}, es = (e) => {
 	let { versionColumn: t, patch: n } = e;
 	if (t === void 0) return {
 		nextVersion: void 0,
@@ -1932,28 +1947,28 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		expected: i,
 		patch: a
 	};
-}, $o = (e) => {
-	if (e.expected !== void 0 && (e.current === null || e.current !== e.expected)) return new Xo({
+}, ts = (e) => {
+	if (e.expected !== void 0 && (e.current === null || e.current !== e.expected)) return new Qo({
 		table: e.table,
 		id: e.id,
 		expected: e.expected,
 		actual: e.current
 	});
-}, es = 1, ts = "voltro/expires", ns = () => it({
-	id: ts,
+}, ns = 1, rs = "voltro/expires", is = () => it({
+	id: rs,
 	fields: { expiresAt: C().nullable() },
 	behaviors: { defaultWhere: () => "expiresAt IS NULL OR expiresAt > now()" }
-}), rs = "voltro/localFirst", is = () => it({
-	id: rs,
+}), as = "voltro/localFirst", os = () => it({
+	id: as,
 	fields: {}
-}), as = (e) => e.appliedMixins.some((e) => e.id === rs), os = (e) => {
+}), ss = (e) => e.appliedMixins.some((e) => e.id === as), cs = (e) => {
 	let t = [];
-	for (let n of Object.values(e)) as(n) && t.push(n.tableName);
+	for (let n of Object.values(e)) ss(n) && t.push(n.tableName);
 	return t;
-}, ss = class extends jt.TaggedError("TableStreamError") {}, cs = 1e3, ls = (e, t, n, r) => {
+}, ls = class extends jt.TaggedError("TableStreamError") {}, us = 1e3, ds = (e, t, n, r) => {
 	let i = k.match(r, {
 		onNone: () => e.where,
-		onSome: (n) => e.where ? ma(e.where, $i(t, n)) : $i(t, n)
+		onSome: (n) => e.where ? ga(e.where, ta(t, n)) : ta(t, n)
 	});
 	return {
 		table: e.table,
@@ -1968,19 +1983,19 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		...e.includeDeleted === void 0 ? {} : { includeDeleted: e.includeDeleted },
 		...e.crossTenant === void 0 ? {} : { crossTenant: e.crossTenant }
 	};
-}, us = (e, t) => {
-	let n = t.pk ?? "id", r = t.chunkSize ?? cs;
+}, fs = (e, t) => {
+	let n = t.pk ?? "id", r = t.chunkSize ?? us;
 	return It.paginateChunkEffect(k.none(), (i) => {
 		let a = D.tryPromise({
-			try: () => e.query(ls(t, n, r, i)),
-			catch: (e) => new ss({
+			try: () => e.query(ds(t, n, r, i)),
+			catch: (e) => new ls({
 				table: t.table,
 				cause: e
 			})
 		});
 		return (t.retry ? a.pipe(D.retry(t.retry)) : a).pipe(D.map((e) => [At.fromIterable(e), e.length === r && e.length > 0 ? k.some(k.some(e[e.length - 1][n])) : k.none()]));
 	});
-}, ds = (e) => {
+}, ps = (e) => {
 	let t = e.alpha ?? .5;
 	if (t < 0 || t > 1) throw Error(`hybridSearch: alpha must be in [0, 1], got ${t}`);
 	return (n) => {
@@ -2007,14 +2022,14 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			}
 		};
 	};
-}, fs = async (e, t) => {
+}, ms = async (e, t) => {
 	let n = e.as ?? "embedding", r = t.row[e.from];
 	if (typeof r != "string" || r.length === 0) return {};
 	let i = await t.embed(r);
 	return { [n]: i };
-}, ps = (e) => {
+}, hs = (e) => {
 	if (!Number.isInteger(e.dimensions) || e.dimensions <= 0) throw Error(`vectorEmbedding: dimensions must be a positive integer, got ${String(e.dimensions)}.`);
-	let t = e.as ?? "embedding", n = (t) => fs(e, t);
+	let t = e.as ?? "embedding", n = (t) => ms(e, t);
 	return it({
 		id: "voltro/vectorEmbedding",
 		fields: { [t]: pt(e.dimensions) },
@@ -2032,19 +2047,19 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 			beforeUpdate: n
 		}
 	});
-}, ms = 63, hs = "br_pr", J = class extends Error {
+}, gs = 63, _s = "br_pr", Y = class extends Error {
 	_tag = "BranchNameInvalid";
 	constructor(e) {
 		super(e), this.name = "BranchNameInvalid";
 	}
-}, gs = (e, t) => {
-	if (!Number.isInteger(t) || t < 0) throw new J(`prNumber must be a non-negative integer, got ${String(t)}`);
-	let n = Tr(e);
-	if (n.replace(/_/g, "") === "") throw new J(`app slug '${e}' has no usable identifier characters`);
-	let r = `${hs}${t}_${n}`;
-	if (r.length > ms) throw new J(`branch namespace '${r}' exceeds the ${ms}-byte identifier limit — use a shorter app slug`);
+}, vs = (e, t) => {
+	if (!Number.isInteger(t) || t < 0) throw new Y(`prNumber must be a non-negative integer, got ${String(t)}`);
+	let n = kr(e);
+	if (n.replace(/_/g, "") === "") throw new Y(`app slug '${e}' has no usable identifier characters`);
+	let r = `${_s}${t}_${n}`;
+	if (r.length > gs) throw new Y(`branch namespace '${r}' exceeds the ${gs}-byte identifier limit — use a shorter app slug`);
 	return r;
-}, _s = (e) => e.startsWith(hs), vs = {
+}, ys = (e) => e.startsWith(_s), bs = {
 	requested: {
 		provision: "provisioning",
 		destroy: "destroying"
@@ -2063,19 +2078,19 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		fail: "failed"
 	},
 	destroyed: {}
-}, ys = class extends Error {
+}, xs = class extends Error {
 	from;
 	event;
 	_tag = "BranchTransitionInvalid";
 	constructor(e, t) {
 		super(`invalid branch transition: ${e} --${t}-->`), this.from = e, this.event = t, this.name = "BranchTransitionInvalid";
 	}
-}, bs = (e, t) => {
-	let n = vs[e][t];
-	if (n === void 0) throw new ys(e, t);
+}, Ss = (e, t) => {
+	let n = bs[e][t];
+	if (n === void 0) throw new xs(e, t);
 	return n;
-}, xs = (e, t, n, r, i = [], a = []) => {
-	if (n === "copy" && (r === void 0 || r === "")) throw new J("seed 'copy' requires a parentNamespace to snapshot from");
+}, Cs = (e, t, n, r, i = [], a = []) => {
+	if (n === "copy" && (r === void 0 || r === "")) throw new Y("seed 'copy' requires a parentNamespace to snapshot from");
 	let o = [{
 		kind: "create-namespace",
 		detail: e
@@ -2104,13 +2119,13 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		kind: "seed",
 		detail: `run boot seeds into ${e}`
 	}), o;
-}, Ss = (e) => {
-	if (!_s(e)) throw new J(`refusing to plan teardown of '${e}' — not a branch namespace`);
+}, ws = (e) => {
+	if (!ys(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
 	return [{
 		kind: "drop-namespace",
 		detail: e
 	}];
-}, Cs = (e) => {
+}, Ts = (e) => {
 	if (e === void 0 || e === "") return !1;
 	try {
 		let t = new URL(e).hostname.toLowerCase();
@@ -2118,27 +2133,27 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 	} catch {
 		return /\bneon\.(tech|build)\b/i.test(e);
 	}
-}, ws = (e) => e.prefer === void 0 ? e.seed === "copy" && Cs(e.dbUrl) ? "neon-cow" : "namespace" : e.prefer, Ts = (e, t = {}) => [{
+}, Es = (e) => e.prefer === void 0 ? e.seed === "copy" && Ts(e.dbUrl) ? "neon-cow" : "namespace" : e.prefer, Ds = (e, t = {}) => [{
 	kind: "neon-branch-create",
 	detail: `${t.parentBranch ?? "main"} → ${e} (copy-on-write)`
-}], Es = (e) => {
-	if (!_s(e)) throw new J(`refusing to plan teardown of '${e}' — not a branch namespace`);
+}], Os = (e) => {
+	if (!ys(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
 	return [{
 		kind: "neon-branch-delete",
 		detail: e
 	}];
-}, Ds = (e) => e.mechanism === "neon-cow" ? Ts(e.branchId, e.neonParentBranch === void 0 ? {} : { parentBranch: e.neonParentBranch }) : xs(e.branchId, e.tableNames, e.seed, e.parentNamespace, e.foreignKeys, e.indexNames), Os = (e, t) => e === "neon-cow" ? Es(t) : Ss(t), ks = (e, t, n) => {
+}, ks = (e) => e.mechanism === "neon-cow" ? Ds(e.branchId, e.neonParentBranch === void 0 ? {} : { parentBranch: e.neonParentBranch }) : Cs(e.branchId, e.tableNames, e.seed, e.parentNamespace, e.foreignKeys, e.indexNames), As = (e, t) => e === "neon-cow" ? Os(t) : ws(t), js = (e, t, n) => {
 	let r = e.filter((e) => e.state !== "destroyed" && e.state !== "destroying"), i = r.filter((e) => n - e.createdAtMs > t.ttlMs).map((e) => e.namespace), a = new Set(i);
 	return {
 		evict: i,
 		rejectNew: r.filter((e) => !a.has(e.namespace)).length >= t.maxBranches
 	};
-}, As = async (e, t) => {
-	let n = gs(e.appSlug, e.prNumber), r = ws({
+}, Ms = async (e, t) => {
+	let n = vs(e.appSlug, e.prNumber), r = Es({
 		seed: e.seed,
 		...e.dbUrl === void 0 ? {} : { dbUrl: e.dbUrl },
 		...e.prefer === void 0 ? {} : { prefer: e.prefer }
-	}), i = Ds({
+	}), i = ks({
 		mechanism: r,
 		branchId: n,
 		tableNames: e.tableNames,
@@ -2167,16 +2182,16 @@ var Vt = (e) => typeof e == "string" && e !== "" ? e : null, Ht = async (e, t, n
 		mechanism: r,
 		steps: i
 	};
-}, js = async (e, t, n) => {
-	let r = Os(t, e);
+}, Ns = async (e, t, n) => {
+	let r = As(t, e);
 	return t === "neon-cow" ? await n.neonBranchDelete(e) : await n.dropNamespace(e), r;
-}, Ms = (e, t, n) => ks(e, t, n), Y = (e) => `"${e.replace(/"/g, "\"\"")}"`, Ns = {
+}, Ps = (e, t, n) => js(e, t, n), X = (e) => `"${e.replace(/"/g, "\"\"")}"`, Fs = {
 	cascade: "CASCADE",
 	restrict: "RESTRICT",
 	setNull: "SET NULL",
 	noAction: "NO ACTION"
-}, X = (e) => `'${e.replace(/'/g, "''")}'`, Ps = (e, t) => {
-	let n = t.columns.map(X).join(", ");
+}, Z = (e) => `'${e.replace(/'/g, "''")}'`, Is = (e, t) => {
+	let n = t.columns.map(Z).join(", ");
 	return `DO $voltro_branch$
 DECLARE derived name;
 BEGIN
@@ -2185,11 +2200,11 @@ BEGIN
     JOIN pg_class i ON i.oid = x.indexrelid
     JOIN pg_class c ON c.oid = x.indrelid
     JOIN pg_namespace nsp ON nsp.oid = c.relnamespace
-   WHERE nsp.nspname = ${X(e)}
-     AND c.relname = ${X(t.table)}
+   WHERE nsp.nspname = ${Z(e)}
+     AND c.relname = ${Z(t.table)}
      AND NOT x.indisprimary
      AND x.indisunique = ${t.unique ? "true" : "false"}
-     AND i.relname <> ${X(t.name)}
+     AND i.relname <> ${Z(t.name)}
      AND (
        SELECT array_agg(att.attname::text ORDER BY k.ord)
          FROM unnest(x.indkey::int2[]) WITH ORDINALITY AS k(attnum, ord)
@@ -2198,39 +2213,39 @@ BEGIN
    LIMIT 1;
   IF derived IS NOT NULL THEN
     EXECUTE format('ALTER INDEX %I.%I RENAME TO %I',
-      ${X(e)}, derived, ${X(t.name)});
+      ${Z(e)}, derived, ${Z(t.name)});
   END IF;
 END
 $voltro_branch$`;
-}, Fs = (e, t) => {
-	let n = t.onDelete === void 0 ? "" : ` ON DELETE ${Ns[t.onDelete]}`, r = t.onUpdate === void 0 ? "" : ` ON UPDATE ${Ns[t.onUpdate]}`;
-	return `ALTER TABLE ${Y(e)}.${Y(t.table)} ADD FOREIGN KEY (${Y(t.column)}) REFERENCES ${Y(e)}.${Y(t.targetTable)} (${Y(t.targetColumn)})${n}${r}`;
-}, Is = (e) => {
+}, Ls = (e, t) => {
+	let n = t.onDelete === void 0 ? "" : ` ON DELETE ${Fs[t.onDelete]}`, r = t.onUpdate === void 0 ? "" : ` ON UPDATE ${Fs[t.onUpdate]}`;
+	return `ALTER TABLE ${X(e)}.${X(t.table)} ADD FOREIGN KEY (${X(t.column)}) REFERENCES ${X(e)}.${X(t.targetTable)} (${X(t.targetColumn)})${n}${r}`;
+}, Rs = (e) => {
 	let t = () => {
 		throw Error("namespace branch executor: Neon ops require a neon-cow executor (use a Neon connection for copy-on-write branches)");
 	};
 	return {
-		createNamespace: (t) => e.run(`CREATE SCHEMA IF NOT EXISTS ${Y(t)}`),
-		createTable: (t, n) => e.run(`CREATE TABLE IF NOT EXISTS ${Y(t)}.${Y(n)} (LIKE ${Y(n)} INCLUDING ALL)`),
-		copyTable: (t, n, r) => e.run(`INSERT INTO ${Y(n)}.${Y(r)} SELECT * FROM ${Y(t)}.${Y(r)}`),
-		addForeignKey: (t, n) => e.run(Fs(t, n)),
-		restoreIndexName: (t, n) => e.run(Ps(t, n)),
-		dropNamespace: (t) => e.run(`DROP SCHEMA IF EXISTS ${Y(t)} CASCADE`),
+		createNamespace: (t) => e.run(`CREATE SCHEMA IF NOT EXISTS ${X(t)}`),
+		createTable: (t, n) => e.run(`CREATE TABLE IF NOT EXISTS ${X(t)}.${X(n)} (LIKE ${X(n)} INCLUDING ALL)`),
+		copyTable: (t, n, r) => e.run(`INSERT INTO ${X(n)}.${X(r)} SELECT * FROM ${X(t)}.${X(r)}`),
+		addForeignKey: (t, n) => e.run(Ls(t, n)),
+		restoreIndexName: (t, n) => e.run(Is(t, n)),
+		dropNamespace: (t) => e.run(`DROP SCHEMA IF EXISTS ${X(t)} CASCADE`),
 		neonBranchCreate: t,
 		neonBranchDelete: t
 	};
-}, Ls = class extends Error {
+}, zs = class extends Error {
 	_tag = "TenantResidencyUnresolved";
 	constructor(e) {
 		super(e), this.name = "TenantResidencyUnresolved";
 	}
-}, Rs = class extends Error {
+}, Bs = class extends Error {
 	region;
 	_tag = "TenantRegionUnavailable";
 	constructor(e, t) {
 		super(t), this.region = e, this.name = "TenantRegionUnavailable";
 	}
-}, zs, Bs = (e) => {
+}, Vs, Hs = (e) => {
 	if (e.homes === void 0) throw Error("setResidencyConfig: `homes` is required");
 	if (e.servableRegions === void 0 || e.servableRegions.length === 0) throw Error("setResidencyConfig: `servableRegions` must be non-empty (which regions this deployment serves)");
 	let t = /* @__PURE__ */ new Map();
@@ -2239,98 +2254,98 @@ $voltro_branch$`;
 		if (e !== void 0 && e !== n.region) throw Error(`residency: tenant '${n.tenantId}' is mapped to two regions ('${e}' and '${n.region}')`);
 		t.set(n.tenantId, n.region);
 	}
-	return zs = e, e;
-}, Vs = () => zs, Hs = () => {
-	zs = void 0;
-}, Us = (e, t) => {
-	if (e == null || e === "") throw new Ls("residency is on but the request has no resolvable tenant — refusing to bind a store");
+	return Vs = e, e;
+}, Us = () => Vs, Ws = () => {
+	Vs = void 0;
+}, Gs = (e, t) => {
+	if (e == null || e === "") throw new zs("residency is on but the request has no resolvable tenant — refusing to bind a store");
 	let n = t.homes.find((t) => t.tenantId === e);
-	if (n === void 0) throw new Ls(`no residency home is mapped for tenant '${e}' — refusing to fall back to a default store (would be a residency violation)`);
+	if (n === void 0) throw new zs(`no residency home is mapped for tenant '${e}' — refusing to fall back to a default store (would be a residency violation)`);
 	return n;
-}, Ws = (e, t) => t.servableRegions.includes(e), Gs = (e, t) => {
-	let n = Us(e.tenantId, t), r = Er(n.tenantId);
+}, Ks = (e, t) => t.servableRegions.includes(e), qs = (e, t) => {
+	let n = Gs(e.tenantId, t), r = Ar(n.tenantId);
 	return {
 		region: n.region,
 		namespace: r,
 		...n.connectionKey === void 0 ? {} : { connectionKey: n.connectionKey }
 	};
-}, Ks = (e, t, n) => {
-	let r = Gs(e, t);
-	if (!Ws(r.region, t)) throw new Rs(r.region, `tenant homed in region '${r.region}', which this deployment does not serve — route to the home region`);
+}, Js = (e, t, n) => {
+	let r = qs(e, t);
+	if (!Ks(r.region, t)) throw new Bs(r.region, `tenant homed in region '${r.region}', which this deployment does not serve — route to the home region`);
 	let i = n.get(r.region);
-	if (i === void 0) throw new Rs(r.region, `no store handle for home region '${r.region}' (declared servable but not wired) — failing closed`);
+	if (i === void 0) throw new Bs(r.region, `no store handle for home region '${r.region}' (declared servable but not wired) — failing closed`);
 	return {
 		store: i,
 		placement: r
 	};
-}, qs = async (e, t, n, r) => {
-	let { store: i, placement: a } = Ks(e, t, n);
+}, Ys = async (e, t, n, r) => {
+	let { store: i, placement: a } = Js(e, t, n);
 	return await r(i, a), a;
-}, Js = (e) => {
+}, Xs = (e) => {
 	if (typeof e == "string") return e;
 	if ("jsonPath" in e) {
 		let { column: t, path: n, numeric: r } = e.jsonPath;
 		return `(json:${t}->${n.join(".")}${r ? "::num" : ""})`;
 	}
 	return `(${e.expr})`;
-}, Z = (e) => e.map(Js), Ys = (e, t) => {
+}, Q = (e) => e.map(Xs), Zs = (e, t) => {
 	if (e.length !== t.length) return !1;
-	for (let n = 0; n < e.length; n++) if (Js(e[n]) !== Js(t[n])) return !1;
+	for (let n = 0; n < e.length; n++) if (Xs(e[n]) !== Xs(t[n])) return !1;
 	return !0;
-}, Xs = (e, t) => {
+}, Qs = (e, t) => {
 	if (e.length >= t.length) return !1;
-	for (let n = 0; n < e.length; n++) if (Js(e[n]) !== Js(t[n])) return !1;
+	for (let n = 0; n < e.length; n++) if (Xs(e[n]) !== Xs(t[n])) return !1;
 	return !0;
-}, Zs = (e) => {
+}, $s = (e) => {
 	let t = [], n = e.appliedIndexes, r = e.tableName;
 	for (let e = 0; e < n.length; e++) {
 		let i = n[e];
 		for (let a = e + 1; a < n.length; a++) {
 			let e = n[a];
-			if (Ys(i.fields, e.fields)) {
+			if (Zs(i.fields, e.fields)) {
 				let [n, a] = i.name < e.name ? [i, e] : [e, i];
 				t.push({
 					kind: "duplicate-fields",
 					table: r,
 					redundant: n,
 					coveredBy: a,
-					message: `'${r}' has two indexes on the same fields [${Z(i.fields).join(", ")}]: '${i.name}' and '${e.name}'. The B-tree engine builds both, costing write throughput + disk space for no read benefit. Drop '${n.name}' (or '${a.name}' if you prefer the other name). Applies to every supported dialect (Postgres / MySQL / MariaDB / MSSQL / SQLite).`
+					message: `'${r}' has two indexes on the same fields [${Q(i.fields).join(", ")}]: '${i.name}' and '${e.name}'. The B-tree engine builds both, costing write throughput + disk space for no read benefit. Drop '${n.name}' (or '${a.name}' if you prefer the other name). Applies to every supported dialect (Postgres / MySQL / MariaDB / MSSQL / SQLite).`
 				});
 				continue;
 			}
-			Xs(i.fields, e.fields) ? t.push({
+			Qs(i.fields, e.fields) ? t.push({
 				kind: "redundant-prefix",
 				table: r,
 				redundant: i,
 				coveredBy: e,
-				message: `'${r}' index '${i.name}' on [${Z(i.fields).join(", ")}] is a leading prefix of '${e.name}' on [${Z(e.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Z(i.fields).join(", ")}] query from '${e.name}' too via the leading-prefix rule, so '${i.name}' adds write cost without read benefit. Drop '${i.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
-			}) : Xs(e.fields, i.fields) && t.push({
+				message: `'${r}' index '${i.name}' on [${Q(i.fields).join(", ")}] is a leading prefix of '${e.name}' on [${Q(e.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Q(i.fields).join(", ")}] query from '${e.name}' too via the leading-prefix rule, so '${i.name}' adds write cost without read benefit. Drop '${i.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
+			}) : Qs(e.fields, i.fields) && t.push({
 				kind: "redundant-prefix",
 				table: r,
 				redundant: e,
 				coveredBy: i,
-				message: `'${r}' index '${e.name}' on [${Z(e.fields).join(", ")}] is a leading prefix of '${i.name}' on [${Z(i.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Z(e.fields).join(", ")}] query from '${i.name}' too via the leading-prefix rule, so '${e.name}' adds write cost without read benefit. Drop '${e.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
+				message: `'${r}' index '${e.name}' on [${Q(e.fields).join(", ")}] is a leading prefix of '${i.name}' on [${Q(i.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Q(e.fields).join(", ")}] query from '${i.name}' too via the leading-prefix rule, so '${e.name}' adds write cost without read benefit. Drop '${e.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
 			});
 		}
 	}
 	return t;
-}, Qs = (e) => {
+}, ec = (e) => {
 	let t = [];
-	for (let n of e) t.push(...Zs(n));
+	for (let n of e) t.push(...$s(n));
 	return t;
-}, $s = "\x1B[", ec = `${$s}38;2;245;158;11m`, tc = `${$s}38;2;16;185;129m`, nc = (e, t) => `${e}${t}${j.reset}`, Q = (e, t, n) => e ? typeof t == "function" ? t(n) : nc(t, n) : n, rc = (e, t = {}) => {
-	let n = t.color ?? !0, r = t.indent ?? "  ", i = (e) => Q(n, j.dim, e.padEnd(11)), a = (e) => Q(n, (e) => j.bold(j.brand(e)), e), o = (e) => Q(n, j.brightRed24, e), s = (e) => Q(n, tc, e), c = (e) => Q(n, ec, e), l = (e) => Q(n, j.dim, e), u = `${c("index audit")} ${l("·")} ${Q(n, j.bold, e.kind)}`, d = e.redundant.fields.length, f = Z(e.coveredBy.fields.slice(d)), p = (e, t) => {
+}, tc = "\x1B[", nc = `${tc}38;2;245;158;11m`, rc = `${tc}38;2;16;185;129m`, ic = (e, t) => `${e}${t}${j.reset}`, $ = (e, t, n) => e ? typeof t == "function" ? t(n) : ic(t, n) : n, ac = (e, t = {}) => {
+	let n = t.color ?? !0, r = t.indent ?? "  ", i = (e) => $(n, j.dim, e.padEnd(11)), a = (e) => $(n, (e) => j.bold(j.brand(e)), e), o = (e) => $(n, j.brightRed24, e), s = (e) => $(n, rc, e), c = (e) => $(n, nc, e), l = (e) => $(n, j.dim, e), u = `${c("index audit")} ${l("·")} ${$(n, j.bold, e.kind)}`, d = e.redundant.fields.length, f = Q(e.coveredBy.fields.slice(d)), p = (e, t) => {
 		let n = e.slice(0, t), r = e.slice(t), i = [];
 		return n.length > 0 && i.push(s(`[${n.join(", ")}]`)), r.length > 0 && i.push(c(`+ [${r.join(", ")}]`)), i.join(" ");
 	}, m = [];
-	return m.push(u), m.push(""), m.push(`${i("table")}${a(e.table)}`), m.push(""), m.push(`${i("redundant")}${o(e.redundant.name)}`), m.push(`${i("")}${p(Z(e.redundant.fields), d)}`), m.push(""), m.push(`${i("covered by")}${s(e.coveredBy.name)}`), m.push(`${i("")}${p(Z(e.coveredBy.fields), d)}`), f.length > 0 && m.push(`${i("")}${l(`└ extra columns: ${f.join(", ")}`)}`), m.push(""), e.kind === "redundant-prefix" ? (m.push(`${i("why")}B-tree indexes serve queries that filter on a LEADING PREFIX of`), m.push(`${i("")}their column list. The wider index already covers every`), m.push(`${i("")}query the narrower one can serve.`), m.push(`${i("")}${l("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)) : (m.push(`${i("why")}Two indexes on the same columns under different names.`), m.push(`${i("")}The B-tree engine builds both — same coverage, double cost.`), m.push(`${i("")}${l("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)), m.push(""), m.push(`${i("cost")}Every ${a("INSERT")} / ${a("UPDATE")} / ${a("DELETE")} on this table writes`), m.push(`${i("")}to ${Q(n, j.bold, "both")} B-trees. Pure write overhead, zero read benefit.`), m.push(""), m.push(`${i("fix")}Drop  ${o(e.redundant.name)}`), m.push(`${i("")}${l("Keep only if profiling shows the smaller index gives a")}`), m.push(`${i("")}${l("measurable cache-locality boost on a write-heavy hot path.")}`), m.push(`${i("")}${l("Silence with VOLTRO_INDEX_AUDIT=off if intentional.")}`), m.map((e) => `${r}${e}`).join("\n");
-}, ic = (e, { apply: t, undo: n }) => ({
+	return m.push(u), m.push(""), m.push(`${i("table")}${a(e.table)}`), m.push(""), m.push(`${i("redundant")}${o(e.redundant.name)}`), m.push(`${i("")}${p(Q(e.redundant.fields), d)}`), m.push(""), m.push(`${i("covered by")}${s(e.coveredBy.name)}`), m.push(`${i("")}${p(Q(e.coveredBy.fields), d)}`), f.length > 0 && m.push(`${i("")}${l(`└ extra columns: ${f.join(", ")}`)}`), m.push(""), e.kind === "redundant-prefix" ? (m.push(`${i("why")}B-tree indexes serve queries that filter on a LEADING PREFIX of`), m.push(`${i("")}their column list. The wider index already covers every`), m.push(`${i("")}query the narrower one can serve.`), m.push(`${i("")}${l("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)) : (m.push(`${i("why")}Two indexes on the same columns under different names.`), m.push(`${i("")}The B-tree engine builds both — same coverage, double cost.`), m.push(`${i("")}${l("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)), m.push(""), m.push(`${i("cost")}Every ${a("INSERT")} / ${a("UPDATE")} / ${a("DELETE")} on this table writes`), m.push(`${i("")}to ${$(n, j.bold, "both")} B-trees. Pure write overhead, zero read benefit.`), m.push(""), m.push(`${i("fix")}Drop  ${o(e.redundant.name)}`), m.push(`${i("")}${l("Keep only if profiling shows the smaller index gives a")}`), m.push(`${i("")}${l("measurable cache-locality boost on a write-heavy hot path.")}`), m.push(`${i("")}${l("Silence with VOLTRO_INDEX_AUDIT=off if intentional.")}`), m.map((e) => `${r}${e}`).join("\n");
+}, oc = (e, { apply: t, undo: n }) => ({
 	name: e,
 	apply: t,
 	undo: n
-}), ac = (e) => {
+}), sc = (e) => {
 	if (!/^\d{14}_/.test(e.id)) throw Error(`migration "${e.id}": id must start with a 14-digit timestamp followed by "_" (convention: <YYYYMMDDHHMMSS>_<slug>)`);
-	let t = e.steps({ step: ic });
+	let t = e.steps({ step: oc });
 	if (t.length === 0) throw Error(`migration "${e.id}": at least one step is required`);
 	return {
 		__migration: !0,
@@ -2338,7 +2353,7 @@ $voltro_branch$`;
 		name: e.name,
 		steps: t
 	};
-}, oc = (e) => typeof e == "object" && !!e && "__migration" in e && e.__migration === !0, sc = T("_voltro_migrations", {
+}, cc = (e) => typeof e == "object" && !!e && "__migration" in e && e.__migration === !0, lc = T("_voltro_migrations", {
 	id: _({ prefix: "mig" }),
 	name: t(),
 	hash: t(),
@@ -2350,7 +2365,7 @@ $voltro_branch$`;
 	workflowRunId: t().nullable(),
 	createdAt: C().default("now"),
 	updatedAt: C().default("now").onUpdate("now")
-}).index(["status"]), cc = T("_voltro_seeds", {
+}).index(["status"]), uc = T("_voltro_seeds", {
 	id: _({ prefix: "seed" }),
 	name: t(),
 	lifecycle: t(),
@@ -2366,7 +2381,7 @@ $voltro_branch$`;
 	workflowRunId: t().nullable(),
 	createdAt: C().default("now"),
 	updatedAt: C().default("now").onUpdate("now")
-}).index(["lifecycle"]).index(["nextRunAt"]), lc = T("_voltro_migration_plans", {
+}).index(["lifecycle"]).index(["nextRunAt"]), dc = T("_voltro_migration_plans", {
 	id: _({ prefix: "plan" }),
 	fingerprint: t(),
 	liveFingerprint: t().nullable(),
@@ -2382,21 +2397,21 @@ $voltro_branch$`;
 	appliedAt: C().default("now"),
 	createdAt: C().default("now"),
 	updatedAt: C().default("now").onUpdate("now")
-}).index(["fingerprint"]).index(["environment"]), uc = T("_voltro_idempotency", {
+}).index(["fingerprint"]).index(["environment"]), fc = T("_voltro_idempotency", {
 	id: _({ prefix: "idem" }),
 	scope: t(),
 	key: t(),
 	status: t(),
 	response: h().nullable(),
 	createdAt: C().default("now")
-}).unique(["scope", "key"]).index(["createdAt"]), dc = T("_voltro_kv", {
+}).unique(["scope", "key"]).index(["createdAt"]), pc = T("_voltro_kv", {
 	id: _({ prefix: "kv" }),
 	key: t().unique(),
 	value: t().nullable(),
 	expiresAt: C().nullable(),
 	createdAt: C().default("now"),
 	updatedAt: C().default("now").onUpdate("now")
-}).index(["expiresAt"]), fc = T("_voltro_api_keys", {
+}).index(["expiresAt"]), mc = T("_voltro_api_keys", {
 	id: _({ prefix: "apikey" }),
 	tenantId: t().nullable(),
 	name: t(),
@@ -2411,7 +2426,7 @@ $voltro_branch$`;
 	onBehalfOf: t().nullable(),
 	metadata: h().nullable(),
 	createdAt: C().default("now")
-}).index("byApiKeyTenant", ["tenantId"]), pc = T("_voltro_replica_observations", {
+}).index("byApiKeyTenant", ["tenantId"]), hc = T("_voltro_replica_observations", {
 	id: _({ prefix: "robs" }),
 	replicaId: t().maxLength(191),
 	startedAt: C(),
@@ -2420,11 +2435,11 @@ $voltro_branch$`;
 	payload: t().nullable(),
 	reachableAt: t().maxLength(255).nullable(),
 	writtenAt: C().default("now").onUpdate("now")
-}).unique(["replicaId", "kind"]).index(["kind"]), mc = [
-	sc,
-	cc,
-	lc
-], hc = "_voltro_replace_in_progress", gc = T(hc, {
+}).unique(["replicaId", "kind"]).index(["kind"]), gc = [
+	lc,
+	uc,
+	dc
+], _c = "_voltro_replace_in_progress", vc = T(_c, {
 	id: _({ prefix: "repl" }),
 	startedAt: C().default("now"),
 	kind: t().default("replace"),
@@ -2434,10 +2449,10 @@ $voltro_branch$`;
 	staging: t().nullable(),
 	heartbeatAt: C().nullable(),
 	resumable: r().nullable()
-}), _c = 30, vc = (e, t) => {
+}), yc = 30, bc = (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;
-}, yc = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), bc = (e) => {
+}, xc = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), Sc = (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) => {
@@ -2452,7 +2467,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`;
-}, xc = (e, t, n) => {
+}, Cc = (e, t, n) => {
 	let r = e.filter((e) => e.kind === "staging");
 	return {
 		all: r,
@@ -2462,7 +2477,7 @@ ${t.map((e) => {
 			return Number.isFinite(r) ? t - r >= n : !1;
 		})
 	};
-}, Sc = (e, t) => {
+}, wc = (e, t) => {
 	if (e.all.length === 0) return;
 	let n = new Set(e.droppable.map((e) => e.id));
 	return `staged data-import leftovers:
@@ -2471,22 +2486,22 @@ ${e.all.map((e) => {
 		return n.has(e.id) ? `  - ${a} — DROPPED: the run is not resumable and has been silent long enough that nothing is loading into them.` : e.resumable ? `  - ${a} — KEPT: the run was started \`--no-atomic\`, so these ARE its resume point. Re-run the same\n    bundle to continue from them, or drop them with: voltro data clear-staging --yes` : `  - ${a} — KEPT: still beating, so an import is loading into them right now.`;
 	}).join("\n")}\n  The target of a staged \`replace\` is untouched until one short swap at the end, so none of this is
   a reason to refuse the boot — it is a reason to know the disk is holding a copy of a bundle.`;
-}, $ = "id", Cc = (e, t) => {
+}, Tc = "id", Ec = (e, t) => {
 	let n = E(e);
 	if (n === void 0) return t;
-	let r = n.fields[$]?.idScheme;
-	if (r === void 0 || t[$] != null) return t;
+	let r = n.fields[Tc]?.idScheme;
+	if (r === void 0 || t[Tc] != null) return t;
 	if (r.kind === "numeric") {
-		if (!($ in t)) return t;
+		if (!(Tc in t)) return t;
 		let e = { ...t };
-		return delete e[$], e;
+		return delete e[Tc], e;
 	}
 	let i = gt(r, e);
 	return i === null ? t : {
 		...t,
-		[$]: i
+		[Tc]: i
 	};
-}, wc = (e, t) => t.map((t) => Cc(e, t)), Tc = {
+}, Dc = (e, t) => t.map((t) => Ec(e, t)), Oc = {
 	postgres: { maxBindParameters: 65535 },
 	mysql: { maxBindParameters: 65535 },
 	mariadb: { maxBindParameters: 65535 },
@@ -2496,25 +2511,25 @@ ${e.all.map((e) => {
 	},
 	sqlite: { maxBindParameters: 32766 },
 	turso: { maxBindParameters: 32766 }
-}, Ec = (e) => Tc[e], Dc = (e) => {
+}, kc = (e) => Oc[e], Ac = (e) => {
 	let t = /* @__PURE__ */ new Set();
 	for (let n of e) for (let e of Object.keys(n)) t.add(e);
 	return t.size;
-}, Oc = (e, t) => {
+}, jc = (e, t) => {
 	if (t === void 0 || e.length === 0) return [e];
-	let n = Math.max(1, Dc(e)), r = Math.floor(t.maxBindParameters / n), i = t.maxRowsPerStatement ?? Infinity, a = Math.max(1, Math.min(r, i));
+	let n = Math.max(1, Ac(e)), r = Math.floor(t.maxBindParameters / n), i = t.maxRowsPerStatement ?? Infinity, a = Math.max(1, Math.min(r, i));
 	if (e.length <= a) return [e];
 	let o = [];
 	for (let t = 0; t < e.length; t += a) o.push(e.slice(t, t + a));
 	return o;
-}, kc = (e, t) => {
+}, Mc = (e, t) => {
 	let n = [], r = t;
 	for (let [t, i] of Object.entries(e.fields)) {
 		let e = i;
 		e.nullable || e.hasDefault || e.idScheme !== void 0 || e.generatedAs !== void 0 || (r[t] === void 0 || r[t] === null) && n.push(t);
 	}
 	return n;
-}, Ac = (e, t, n) => {
+}, Nc = (e, t, n) => {
 	let r = n, i = new Set(e === void 0 ? [] : Object.entries(e.fields).filter(([, e]) => e.generatedAs !== void 0).map(([e]) => e)), a = [];
 	for (let e of t) i.has(e) || (r[e] === void 0 ? a.push({
 		column: e,
@@ -2524,28 +2539,28 @@ ${e.all.map((e) => {
 		reason: "null"
 	}));
 	return a;
-}, jc = (e, t, n) => e.insert(t.tableName, n), Mc = (e, t, n, r) => e.upsert(t.tableName, n, {
+}, Pc = (e, t, n) => e.insert(t.tableName, n), Fc = (e, t, n, r) => e.upsert(t.tableName, n, {
 	conflictColumns: r.conflictColumns,
 	...r.update === void 0 ? {} : { update: r.update }
-}), Nc = (e, t, n, r) => e.updateMany(t.tableName, n, { where: r.where }), Pc = 512, Fc = (e) => {
+}), Ic = (e, t, n, r) => e.updateMany(t.tableName, n, { where: r.where }), Lc = 512, Rc = (e) => {
 	e.setMaxListeners(512);
-}, Ic = (e, t, n) => ({
+}, zc = (e, t, n) => ({
 	_tag: "PrimaryKeyConflictError",
 	table: e,
 	key: t,
 	cause: n
-}), Lc = (e) => typeof e == "object" && !!e && e._tag === "PrimaryKeyConflictError", Rc = {
+}), Bc = (e) => typeof e == "object" && !!e && e._tag === "PrimaryKeyConflictError", Vc = {
 	postgres: 5432,
 	mysql: 3306,
 	mariadb: 3306,
 	mssql: 1433
-}, zc = /* @__PURE__ */ new Set([
+}, Hc = /* @__PURE__ */ new Set([
 	"localhost",
 	"127.0.0.1",
 	"::1",
 	"[::1]",
 	"0.0.0.0"
-]), Bc = (e) => {
+]), Uc = (e) => {
 	let t = e.host, n = e.port, r = e.database;
 	if (e.url !== void 0 && e.url !== "") try {
 		let i = new URL(e.url);
@@ -2554,29 +2569,29 @@ ${e.all.map((e) => {
 		return;
 	}
 	if (t === void 0 || t === "" || r === void 0 || r === "") return;
-	let i = n ?? Rc[(e.dialect ?? "").toLowerCase()];
+	let i = n ?? Vc[(e.dialect ?? "").toLowerCase()];
 	if (i === void 0 || !Number.isFinite(i)) return;
 	let a = t.toLowerCase();
 	return {
-		host: zc.has(a) ? "localhost" : a,
+		host: Hc.has(a) ? "localhost" : a,
 		port: i,
 		database: r.toLowerCase()
 	};
-}, Vc = (e) => {
-	let t = Bc(e);
+}, Wc = (e) => {
+	let t = Uc(e);
 	if (t !== void 0) return Lt("sha256").update(`${t.host}\u0000${t.port}\u0000${t.database}`).digest("hex").slice(0, 32);
-}, Hc = (e, t) => e === void 0 || t === void 0 ? "unknown" : e === t ? "same" : "different", Uc = {
+}, Gc = (e, t) => e === void 0 || t === void 0 ? "unknown" : e === t ? "same" : "different", Kc = {
 	app: 3,
 	plugin: 2,
 	framework: 1
-}, Wc = /* @__PURE__ */ new Map(), Gc = [], Kc = () => [...Gc], qc = (e) => {
+}, qc = /* @__PURE__ */ new Map(), Jc = [], Yc = () => [...Jc], Xc = (e) => {
 	if (!e.table || !e.timeColumn) throw Error("registerRetention: table + timeColumn are required");
 	if (!Number.isFinite(e.ttlMs) || e.ttlMs <= 0) throw Error(`registerRetention(${e.table}): ttlMs must be a positive number`);
-	let t = e.source ?? "app", n = Wc.get(e.table);
+	let t = e.source ?? "app", n = qc.get(e.table);
 	if (n !== void 0) {
 		let r = n.source ?? "app", i = n.ttlMs !== e.ttlMs || n.where !== void 0 != (e.where !== void 0);
-		if (Uc[t] < Uc[r]) {
-			i && Gc.push({
+		if (Kc[t] < Kc[r]) {
+			i && Jc.push({
 				table: e.table,
 				kept: {
 					source: r,
@@ -2589,7 +2604,7 @@ ${e.all.map((e) => {
 			});
 			return;
 		}
-		i && r !== t && Gc.push({
+		i && r !== t && Jc.push({
 			table: e.table,
 			kept: {
 				source: t,
@@ -2601,36 +2616,36 @@ ${e.all.map((e) => {
 			}
 		});
 	}
-	Wc.set(e.table, {
+	qc.set(e.table, {
 		...e,
 		source: t
 	});
-}, Jc = () => [...Wc.values()], Yc = () => {
-	Wc.clear(), Gc.length = 0;
-}, Xc = async (e, t, n, r = 2e4) => {
+}, Zc = () => [...qc.values()], Qc = () => {
+	qc.clear(), Jc.length = 0;
+}, $c = async (e, t, n, r = 2e4) => {
 	let i = new Date(t - e.ttlMs), a = 0;
 	for (;;) {
 		let t = await n(e.table, e.timeColumn, i, r, e.where);
 		if (a += t, t < r) break;
 	}
 	return a;
-}, Zc = (e, t) => {
+}, el = (e, t) => {
 	let n = Number(e ?? String(t));
 	return (Number.isFinite(n) && n > 0 ? n : t) * 36e5;
-}, Qc = "_voltro_cdc_offsets", $c = T(Qc, {
+}, tl = "_voltro_cdc_offsets", nl = T(tl, {
 	id: _({ prefix: "cdcoff" }),
 	replicaId: t(),
 	streamName: t(),
 	binlogFile: t(),
 	binlogPosition: t(),
 	updatedAt: C()
-}).index(["replicaId"]), el = T(Qc, {
+}).index(["replicaId"]), rl = T(tl, {
 	id: _({ prefix: "cdcoff" }),
 	replicaId: t(),
 	streamName: t(),
 	ctVersion: t(),
 	updatedAt: C()
-}).index(["replicaId"]), tl = "_voltro_data_transfers", nl = T(tl, {
+}).index(["replicaId"]), il = "_voltro_data_transfers", al = T(il, {
 	id: _({ prefix: "dimp" }),
 	startedAt: C().default("now"),
 	finishedAt: C().nullable(),
@@ -2643,9 +2658,9 @@ ${e.all.map((e) => {
 	rowsWritten: S().default(0),
 	failure: t().nullable(),
 	staged: r().nullable()
-}).renamedFrom("_voltro_data_imports").nonReactive(), rl = (e) => {
+}).renamedFrom("_voltro_data_imports").nonReactive(), ol = (e) => {
 	let t = Number.isFinite(e.startedAt.getTime()) ? e.startedAt.toISOString() : "an unknown time", n = e.direction === "import" ? e.mode : `${e.direction} ${e.mode}`, r = e.failure === null ? e.finishedAt === null ? `${n} — started and never reported finishing` : e.direction === "backup" || e.direction === "restore" ? `${n} — finished${e.rowsWritten > 0 ? ` (${e.rowsWritten} blob(s))` : ""}` : `${n} — ${e.rowsWritten} row(s) across ${e.tablesWritten} table(s)` : `FAILED ${n} — ${e.failure}`, i = e.staged === null ? "" : e.staged ? " · staged (target untouched until the swap)" : " · NOT staged (target emptied first)";
 	return `${t} · ${r} · via ${e.via}${i}` + (e.bundle === null ? "" : ` · from ${e.bundle}`) + (e.sourceFingerprint === null ? "" : ` · source schema ${e.sourceFingerprint}`);
-}, il = "postgres";
+}, sl = "postgres";
 //#endregion
-export { nt as AUTO_FILLED_COLUMNS, Tc as BULK_INSERT_LIMITS, J as BranchNameInvalid, ys as BranchTransitionInvalid, Qc as CDC_OFFSETS_TABLE, Ra as CHANGE_CLAIM_TTL_ENV, Pc as CHANGE_LISTENER_CEILING, l as ColumnBuilder, tl as DATA_TRANSFERS_TABLE, fe as DEFAULT_ACQUIRE_TIMEOUT_MS, za as DEFAULT_CHANGE_CLAIM_TTL_HOURS, Vo as DEFAULT_EAGER_FALLBACK_WARN_INTERVAL_MS, Gn as DEFAULT_SUBJECT_GRAPH_DEPTH, qt as ENCRYPTED_PREFIX, il as ENGINE, cr as EagerCardinalityError, rt as FILE_MIGRATION_PATTERN, ft as FRAMEWORK_LIVE_TABLES, Jt as FieldDecryptionError, co as ID_COLUMN_MAX_LENGTH, es as INITIAL_VERSION, ua as MATCHES_NO_ROWS, et as MAX_IDENTIFIER_LENGTH, La as OccurrenceCounter, hc as REPLACE_IN_PROGRESS_TABLE, _c as STAGING_STALE_MINUTES, tt as STAGING_TABLE_PREFIX, Bt as SqlClient, ss as TableStreamError, Sr as TenantNamespaceInvalid, xr as TenantNamespaceUnresolved, Rs as TenantRegionUnavailable, Ls as TenantResidencyUnresolved, ts as VOLTRO_EXPIRES_MIXIN_ID, rs as VOLTRO_LOCAL_FIRST_MIXIN_ID, Xo as VersionConflict, Ke as WARN_IDENTIFIER_LENGTH, fc as _voltroApiKeysTable, $c as _voltroCdcOffsetsTable, nl as _voltroDataTransfersTable, uc as _voltroIdempotencyTable, dc as _voltroKvTable, lc as _voltroMigrationPlansTable, sc as _voltroMigrationsTable, el as _voltroMssqlCdcOffsetsTable, gc as _voltroReplaceInProgressTable, pc as _voltroReplicaObservationsTable, cc as _voltroSeedsTable, Xi as actorsTable, Ms as admitBranch, St as allEnumRenames, Hn as allRegisteredRelations, Ce as allRegisteredTables, ma as and, le as array, sa as arrayContains, la as arrayHas, ca as arrayOverlaps, ur as attachEagerLoads, Wa as attributionFields, Ja as attributionKey, Qs as auditAllTableIndexes, Zs as auditTableIndexes, Fe as avg, xt as avgOver, ro as beginLocalWrite, Xe as bigint, Ks as bindResidentStore, r as boolean, gs as branchNamespaceName, Ec as bulkInsertLimitsFor, Je as bytes, ja as changeDelete, Pa as changeDigest, ka as changeInsert, Ma as changeSoftDelete, Aa as changeUpdate, Oc as chunkRowsForInsert, Za as claimPendingAttribution, pn as classifyConstraintViolation, _e as clearEnumRenames, oo as clearPendingAttribution, Wn as clearRelationsRegistry, Hs as clearResidencyConfig, Yc as clearRetentions, m as clearTableRegistry, go as clearWriteRecorders, U as coercePredicateForSqlite, Ar as coercePredicateValue, jr as coercePredicateValues, Hi as coerceValueForSqlite, Ea as collectSubqueries, ge as column, yn as columnSchema, Dc as columnsPerRow, Gr as compileEagerJson, I as compilePredicate, Mr as compileRawFragment, Wr as compileSelect, Fa as composeChangeKey, fs as computeEmbedding, Vc as connectionIdentity, aa as contains, o as count, yt as countDistinct, oe as crdtDoc, se as crdtManagedColumns, de as crdtManagedColumnsOf, p as crdtText, Ua as currentWriteAttribution, ve as databaseHandle, te as date, ie as dbEnum, Fo as dbMetricTagCacheSizeForTests, Ro as dbOperationsInFlight, he as decimal, s as declareEnumRename, $t as decodeFieldValue, ar as decodeRowsFromSchema, an as decryptFieldsOnRead, ac as defineMigration, it as defineMixin, Ze as defineSeed, u as denseRank, Qn as deriveSubjectGraph, Qe as deriveTypeIdPrefix, fo as derivedRowId, po as derivedRowIdLength, gn as describeDriverError, _n as describeRowBindings, rl as describeTransferRun, Kt as deserializeArraysOnRead, Ge as drainIdentifierWarnings, Et as dropped, Zt as encodeFieldValue, sr as encodeRowForSchema, rn as encryptFieldsForWrite, nn as encryptedColumnsOf, io as endLocalWrite, ks as enforceBranchLimits, y as ensureTableRegistered, Zi as eq, Nr as escapeLike, Ta as evaluatePredicate, c as except, xa as exists, ns as expires, Oa as externalChangeEvent, un as extractDbCause, ht as fireSchemaChangeSeeds, ze as fireTenantCreateSeeds, rc as formatIndexAuditIssue, $n as formatSubjectGraph, mc as frameworkTables, gt as generateId, Ue as generateSnowflake, a as geography, Se as geometry, bt as getEnumRenames, Vn as getRelation, Bn as getRelations, Vs as getResidencyConfig, E as getTable, $i as gt, ea as gte, br as hasEagerLoads, ds as hybridSearch, _ as id, ra as inSet, ya as inSubquery, P as inferForeignKey, jc as insertRow, S as integer, bc as interruptedReplaceRefusal, ce as intersect, we as interval, _s as isBranchNamespace, Dn as isEmptyRelationsSpec, Xt as isEncrypted, Yt as isFieldDecryptionError, ut as isFileMigration, mn as isForeignKeyViolation, ct as isFrameworkOwnedLiveTable, as as isLocalFirst, oc as isMigrationDefinition, e as isMysqlFamily, Cs as isNeonConnection, fa as isNotNull, da as isNull, Lc as isPrimaryKeyConflictError, hn as isQueryTimeout, en as isRawEncoding, Ws as isRegionServable, On as isRelationsSpec, He as isSeedDefinition, Ve as isSqliteFamily, Ne as isStagingTableName, ne as isTableReactive, We as isView, h as json, _a as jsonField, lt as jsonIndex, Ye as lag, n as lead, Kc as listRetentionConflicts, Jc as listRetentions, is as localFirst, os as localFirstTables, ta as lt, na as lte, Wo as makeEagerFallbackReporter, Is as makeNamespaceBranchExecutor, An as many, jn as manyToMany, re as materializeFields, qe as max, Le as migration, ae as min, Ac as missingConflictColumns, kc as missingRequiredColumns, dt as mixin, Qi as neq, bs as nextBranchState, Bc as normaliseTarget, ga as not, Sa as notExists, ia as notInSet, ba as notInSubquery, st as numeric, Bo as observeDbOp, Ba as occurrenceWindowMs, kn as one, lr as oneCardinalityMessage, ha as or, x as orderClausesOf, ue as paginateBy, f as paginateById, Ia as parseChangeKey, so as pendingAttributionCount, Ds as planBranch, xs as planBranchProvision, Ss as planBranchTeardown, Os as planBranchTeardownFor, Ts as planNeonBranchProvision, Es as planNeonBranchTeardown, Qo as planVersionedUpdate, ye as pluginRef, d as pluginRefSpecOf, Ic as primaryKeyConflictError, As as provisionBranch, qs as provisionResidentTenant, Dr as qualifyTable, ee as queryFor, je as queryForView, mt as quoteIdent, Fc as raiseChangeListenerCeiling, b as rank, v as raw, Oe as readableByColumns, Ee as real, zo as recordDbOp, xo as recordsTable, Ae as reference, Ki as registerCoreTables, zn as registerDiscoveredRelations, Xa as registerPendingAttribution, Rn as registerRelations, qc as registerRetention, De as registerTable, mo as registerWriteRecorder, En as relations, Ji as requireActors, Te as requireTable, Yi as requireTenants, Po as resetDbMetricTagCacheForTests, ot as resetSnowflake, Gs as residentPlacement, Ht as resolveActorSnapshot, ws as resolveBranchMechanism, Uo as resolveEagerFallbackWarnIntervalMs, ao as resolveEchoAttribution, me as resolveFullTextIndex, Be as resolveIdScheme, Re as resolveMixinGraph, Us as resolveTenantHome, Er as resolveTenantNamespace, Zc as retentionTtlMsFromEnv, Tt as rowNumber, bn as rowSchema, Jo as runRetryingTransaction, Yo as runStoreTransaction, Ha as runWithWriteAttribution, So as runWriteRecorders, Hc as sameDatabase, Tr as sanitizeIdentifierFragment, Gt as serializeArraysForWrite, pe as serverOnlyColumns, Bs as setResidencyConfig, at as setSchemaChangeSeedHook, $e as setTenantCreateSeedHook, Go as settleTransactionExit, $o as settleVersionedUpdate, pa as spatialPredicate, Sc as stagingLeftoverReport, xc as stagingLeftovers, yc as stagingNamesOf, vc as stagingStaleAfterMs, Cc as stampGeneratedId, wc as stampGeneratedIds, oa as startsWith, us as streamTable, i as sum, xe as sumOver, vo as suspendWriteRecorders, yo as suspendWriteRecordersEffect, Xc as sweepRetention, T as table, js as teardownBranch, t as text, C as timestamp, Dt as timestampMs, Ot as timestampMsOrNull, g as union, be as unionAll, ke as unregisterTable, ho as unregisterWriteRecorder, Nc as updateManyRow, Mc as upsertRow, Me as validateColumnName, vt as validateIndexName, Un as validateRegisteredRelations, Fn as validateRelationConfig, wt as validateTableName, Ie as validateTypeIdPrefix, pt as vector, Pe as vectorDistanceToOpclass, ps as vectorEmbedding, Zo as versionColumnOf, _t as view, Ct as viewSql, Da as walkLeaves, Ga as withCapturedAttribution, bo as writeRecordersSuspended };
+export { nt as AUTO_FILLED_COLUMNS, Oc as BULK_INSERT_LIMITS, Y as BranchNameInvalid, xs as BranchTransitionInvalid, tl as CDC_OFFSETS_TABLE, Ba as CHANGE_CLAIM_TTL_ENV, Lc as CHANGE_LISTENER_CEILING, l as ColumnBuilder, il as DATA_TRANSFERS_TABLE, fe as DEFAULT_ACQUIRE_TIMEOUT_MS, Va as DEFAULT_CHANGE_CLAIM_TTL_HOURS, Uo as DEFAULT_EAGER_FALLBACK_WARN_INTERVAL_MS, Yn as DEFAULT_SUBJECT_GRAPH_DEPTH, qt as ENCRYPTED_PREFIX, sl as ENGINE, fr as EagerCardinalityError, rt as FILE_MIGRATION_PATTERN, ft as FRAMEWORK_LIVE_TABLES, Jt as FieldDecryptionError, uo as ID_COLUMN_MAX_LENGTH, ns as INITIAL_VERSION, fa as MATCHES_NO_ROWS, et as MAX_IDENTIFIER_LENGTH, za as OccurrenceCounter, _c as REPLACE_IN_PROGRESS_TABLE, yc as STAGING_STALE_MINUTES, tt as STAGING_TABLE_PREFIX, Bt as SqlClient, ls as TableStreamError, Er as TenantNamespaceInvalid, Tr as TenantNamespaceUnresolved, Bs as TenantRegionUnavailable, zs as TenantResidencyUnresolved, rs as VOLTRO_EXPIRES_MIXIN_ID, as as VOLTRO_LOCAL_FIRST_MIXIN_ID, Qo as VersionConflict, Ke as WARN_IDENTIFIER_LENGTH, mc as _voltroApiKeysTable, nl as _voltroCdcOffsetsTable, al as _voltroDataTransfersTable, fc as _voltroIdempotencyTable, pc as _voltroKvTable, dc as _voltroMigrationPlansTable, lc as _voltroMigrationsTable, rl as _voltroMssqlCdcOffsetsTable, vc as _voltroReplaceInProgressTable, hc as _voltroReplicaObservationsTable, uc as _voltroSeedsTable, Qi as actorsTable, Ps as admitBranch, St as allEnumRenames, Kn as allRegisteredRelations, Ce as allRegisteredTables, ga as and, le as array, la as arrayContains, da as arrayHas, ua as arrayOverlaps, mr as attachEagerLoads, Ka as attributionFields, Xa as attributionKey, ec as auditAllTableIndexes, $s as auditTableIndexes, Fe as avg, xt as avgOver, ao as beginLocalWrite, Xe as bigint, Js as bindResidentStore, r as boolean, vs as branchNamespaceName, kc as bulkInsertLimitsFor, Je as bytes, sn as causeBranches, Na as changeDelete, Ia as changeDigest, ja as changeInsert, Pa as changeSoftDelete, Ma as changeUpdate, jc as chunkRowsForInsert, $a as claimPendingAttribution, pn as classifyConstraintViolation, _e as clearEnumRenames, co as clearPendingAttribution, Jn as clearRelationsRegistry, Ws as clearResidencyConfig, Qc as clearRetentions, m as clearTableRegistry, vo as clearWriteRecorders, W as coercePredicateForSqlite, Pr as coercePredicateValue, Fr as coercePredicateValues, Wi as coerceValueForSqlite, Oa as collectSubqueries, ge as column, Sn as columnSchema, Ac as columnsPerRow, Jr as compileEagerJson, F as compilePredicate, Ir as compileRawFragment, I as compileSelect, La as composeChangeKey, ms as computeEmbedding, Wc as connectionIdentity, sa as contains, o as count, yt as countDistinct, oe as crdtDoc, se as crdtManagedColumns, de as crdtManagedColumnsOf, p as crdtText, Ga as currentWriteAttribution, ve as databaseHandle, te as date, ie as dbEnum, Lo as dbMetricTagCacheSizeForTests, Bo as dbOperationsInFlight, he as decimal, s as declareEnumRename, $t as decodeFieldValue, lr as decodeRowsFromSchema, an as decryptFieldsOnRead, sc as defineMigration, it as defineMixin, Ze as defineSeed, u as denseRank, nr as deriveSubjectGraph, Qe as deriveTypeIdPrefix, mo as derivedRowId, ho as derivedRowIdLength, gn as describeDriverError, _n as describeRowBindings, ol as describeTransferRun, Kt as deserializeArraysOnRead, Ge as drainIdentifierWarnings, Et as dropped, Zt as encodeFieldValue, dr as encodeRowForSchema, rn as encryptFieldsForWrite, nn as encryptedColumnsOf, oo as endLocalWrite, js as enforceBranchLimits, y as ensureTableRegistered, $i as eq, Lr as escapeLike, Da as evaluatePredicate, c as except, Ca as exists, is as expires, Aa as externalChangeEvent, un as extractDbCause, ht as fireSchemaChangeSeeds, ze as fireTenantCreateSeeds, ac as formatIndexAuditIssue, rr as formatSubjectGraph, gc as frameworkTables, gt as generateId, Ue as generateSnowflake, a as geography, Se as geometry, bt as getEnumRenames, Gn as getRelation, Wn as getRelations, Us as getResidencyConfig, E as getTable, ta as gt, na as gte, wr as hasEagerLoads, ps as hybridSearch, _ as id, aa as inSet, xa as inSubquery, Fn as inferForeignKey, Pc as insertRow, S as integer, Sc as interruptedReplaceRefusal, ce as intersect, we as interval, ys as isBranchNamespace, An as isEmptyRelationsSpec, Xt as isEncrypted, Yt as isFieldDecryptionError, ut as isFileMigration, mn as isForeignKeyViolation, ct as isFrameworkOwnedLiveTable, ss as isLocalFirst, cc as isMigrationDefinition, e as isMysqlFamily, Ts as isNeonConnection, ma as isNotNull, pa as isNull, Bc as isPrimaryKeyConflictError, hn as isQueryTimeout, en as isRawEncoding, Ks as isRegionServable, jn as isRelationsSpec, He as isSeedDefinition, Ve as isSqliteFamily, Ne as isStagingTableName, ne as isTableReactive, We as isView, h as json, ya as jsonField, lt as jsonIndex, Ye as lag, n as lead, Yc as listRetentionConflicts, Zc as listRetentions, os as localFirst, cs as localFirstTables, ra as lt, ia as lte, Ko as makeEagerFallbackReporter, Rs as makeNamespaceBranchExecutor, Nn as many, Pn as manyToMany, re as materializeFields, qe as max, Le as migration, ae as min, Nc as missingConflictColumns, Mc as missingRequiredColumns, dt as mixin, ea as neq, Ss as nextBranchState, Uc as normaliseTarget, va as not, wa as notExists, oa as notInSet, Sa as notInSubquery, st as numeric, Ho as observeDbOp, Ha as occurrenceWindowMs, Mn as one, pr as oneCardinalityMessage, _a as or, x as orderClausesOf, ue as paginateBy, f as paginateById, Ra as parseChangeKey, lo as pendingAttributionCount, ks as planBranch, Cs as planBranchProvision, ws as planBranchTeardown, As as planBranchTeardownFor, Ds as planNeonBranchProvision, Os as planNeonBranchTeardown, es as planVersionedUpdate, ye as pluginRef, d as pluginRefSpecOf, zc as primaryKeyConflictError, Ms as provisionBranch, Ys as provisionResidentTenant, jr as qualifyTable, ee as queryFor, je as queryForView, mt as quoteIdent, Rc as raiseChangeListenerCeiling, b as rank, v as raw, Oe as readableByColumns, Ee as real, Vo as recordDbOp, Co as recordsTable, Ae as reference, bn as refuseWrite, Ji as registerCoreTables, Un as registerDiscoveredRelations, Qa as registerPendingAttribution, Hn as registerRelations, Xc as registerRetention, De as registerTable, go as registerWriteRecorder, kn as relations, Xi as requireActors, Te as requireTable, Zi as requireTenants, Io as resetDbMetricTagCacheForTests, ot as resetSnowflake, qs as residentPlacement, Ht as resolveActorSnapshot, Es as resolveBranchMechanism, Go as resolveEagerFallbackWarnIntervalMs, so as resolveEchoAttribution, me as resolveFullTextIndex, Be as resolveIdScheme, Re as resolveMixinGraph, Gs as resolveTenantHome, Ar as resolveTenantNamespace, el as retentionTtlMsFromEnv, Tt as rowNumber, Cn as rowSchema, Xo as runRetryingTransaction, Zo as runStoreTransaction, Wa as runWithWriteAttribution, wo as runWriteRecorders, Gc as sameDatabase, kr as sanitizeIdentifierFragment, Gt as serializeArraysForWrite, pe as serverOnlyColumns, Hs as setResidencyConfig, at as setSchemaChangeSeedHook, $e as setTenantCreateSeedHook, qo as settleTransactionExit, ts as settleVersionedUpdate, ha as spatialPredicate, wc as stagingLeftoverReport, Cc as stagingLeftovers, xc as stagingNamesOf, bc as stagingStaleAfterMs, Ec as stampGeneratedId, Dc as stampGeneratedIds, ca as startsWith, xn as storeRefusalOf, fs as streamTable, i as sum, xe as sumOver, bo as suspendWriteRecorders, xo as suspendWriteRecordersEffect, $c as sweepRetention, T as table, Ns as teardownBranch, t as text, C as timestamp, Dt as timestampMs, Ot as timestampMsOrNull, g as union, be as unionAll, ke as unregisterTable, _o as unregisterWriteRecorder, Ic as updateManyRow, Fc as upsertRow, Me as validateColumnName, vt as validateIndexName, qn as validateRegisteredRelations, zn as validateRelationConfig, wt as validateTableName, Ie as validateTypeIdPrefix, pt as vector, Pe as vectorDistanceToOpclass, hs as vectorEmbedding, $o as versionColumnOf, _t as view, Ct as viewSql, ka as walkLeaves, qa as withCapturedAttribution, So as writeRecordersSuspended };