@voltro/database 0.78.0 → 0.79.0

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

@@ -200,7 +200,7 @@ function f(e) {
 		idSchemeInput: e
 	});
 }
-var p = () => d("text"), m = () => d("integer"), h = () => d("real"), ee = (e, t = 0) => {
+var p = () => d("text"), m = () => d("integer"), ee = () => d("real"), h = (e, t = 0) => {
 	if (!Number.isInteger(e) || e <= 0) throw Error(`decimal(${String(e)}, ${String(t)}): precision must be a positive integer (the total number of significant digits, e.g. decimal(12, 2)).`);
 	if (!Number.isInteger(t) || t < 0 || t > e) throw Error(`decimal(${String(e)}, ${String(t)}): scale must be an integer between 0 and precision (${e}).`);
 	return new u({
@@ -211,7 +211,7 @@ var p = () => d("text"), m = () => d("integer"), h = () => d("real"), ee = (e, t
 		precision: e,
 		scale: t
 	});
-}, te = ee, ne = () => d("bigint"), re = (e, t) => {
+}, te = h, ne = () => d("bigint"), re = (e, t) => {
 	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
 	return {
 		name: e,
@@ -511,6 +511,12 @@ var ce = () => new u({
 	let t = e.dbCode, n = e.dbErrno;
 	return t === "57014" || n === 3024 || n === 1969 || t === "ETIMEOUT" || t === "SQLITE_INTERRUPT";
 }, Le = (e) => {
+	if (e.dbErrno !== 1366) return;
+	let t = `${typeof e.dbCauseChain == "string" ? e.dbCauseChain : ""} ${typeof e.dbMessage == "string" ? e.dbMessage : ""}`;
+	if (/Incorrect string value: '\\x(F[0-4])/i.exec(t) === null) return;
+	let n = D(t, /for column [`']?(?:[^`'.]+[`']?\.[`']?)*([^`'.]+)[`']? at row/);
+	return `${n === void 0 ? "the column" : `column '${n}'`} is stored in a character set that cannot hold a 4-byte character (utf8mb3). Declare the store's character set in app.config.ts — store: { dialect: 'mariadb' | 'mysql', charset: 'utf8mb4' } — and run \`voltro db plan\`: every declared table is created with it and converted to it.`;
+}, Re = (e) => {
 	let t = Te(e), n = [
 		t.dbCode === void 0 ? void 0 : `code=${String(t.dbCode)}`,
 		t.dbErrno === void 0 ? void 0 : `errno=${String(t.dbErrno)}`,
@@ -519,8 +525,10 @@ var ce = () => new u({
 		t.dbConstraint === void 0 ? void 0 : `constraint=${String(t.dbConstraint)}`,
 		t.dbPlaceholders === void 0 ? void 0 : `placeholders=${String(t.dbPlaceholders)}`
 	].filter((e) => e !== void 0), r = typeof e?.message == "string" ? e.message : void 0, i = typeof t.dbMessage == "string" ? t.dbMessage : void 0, a = i === void 0 ? void 0 : n.length > 0 || i !== r && i !== `Error: ${String(r)}` ? i : void 0, o = typeof t.dbBindings == "string" ? `\n  bindings:  ${t.dbBindings}` : "", s = typeof t.dbStatement == "string" ? `\n  statement: ${t.dbStatement.length <= 400 ? t.dbStatement : `${t.dbStatement.slice(0, 400)}…`}` : "";
-	if (a !== void 0 || n.length !== 0) return [a, n.length > 0 ? `[${n.join(" ")}]` : void 0].filter((e) => e !== void 0 && e !== "").join(" ") + s + o;
-}, Re = (e) => Object.entries(e).map(([e, t]) => `${e}:${ze(t)}`).join(" "), ze = (e) => {
+	if (a === void 0 && n.length === 0) return;
+	let c = Le(t), l = c === void 0 ? "" : `\n  hint: ${c}`;
+	return [a, n.length > 0 ? `[${n.join(" ")}]` : void 0].filter((e) => e !== void 0 && e !== "").join(" ") + l + s + o;
+}, ze = (e) => Object.entries(e).map(([e, t]) => `${e}:${Be(t)}`).join(" "), Be = (e) => {
 	if (e === null) return "null";
 	if (e === void 0) return "undefined";
 	if (typeof e == "bigint") return "bigint";
@@ -530,22 +538,22 @@ var ce = () => new u({
 	if (globalThis.Buffer !== void 0 && globalThis.Buffer.isBuffer(e)) return "Buffer";
 	let t = e.constructor?.name;
 	return typeof t == "string" && t !== "" ? t : "Object";
-}, Be = 63, Ve = 60, O = [], k = (e) => {
+}, Ve = 63, He = 60, O = [], k = (e) => {
 	O.includes(e) || O.push(e);
-}, He = () => {
+}, Ue = () => {
 	let e = O.slice();
 	return O.length = 0, e;
-}, Ue = /^[a-zA-Z_][a-zA-Z0-9_]*$/, We = (e, t) => {
+}, We = /^[a-zA-Z_][a-zA-Z0-9_]*$/, Ge = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!Ue.test(t)) throw Error(`${e} '${t}' contains characters outside [A-Za-z0-9_] or starts with a digit. Dialect-portable identifiers must match /^[a-zA-Z_][a-zA-Z0-9_]*$/.`);
+	if (!We.test(t)) throw Error(`${e} '${t}' contains characters outside [A-Za-z0-9_] or starts with a digit. Dialect-portable identifiers must match /^[a-zA-Z_][a-zA-Z0-9_]*$/.`);
 }, A = (e) => {
-	if (We("table name", e), e.length > 63) throw Error(`table name '${e}' is ${e.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten the name; long table names also cascade into auto-named indexes and FK constraints that would themselves exceed the limit.`);
+	if (Ge("table name", e), e.length > 63) throw Error(`table name '${e}' is ${e.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten the name; long table names also cascade into auto-named indexes and FK constraints that would themselves exceed the limit.`);
 	e.length > 60 && k(`table name '${e}' is ${e.length} chars — ${63 - e.length} from the Postgres 63-byte limit. Auto-named indexes on this table will run out of room fast.`);
 }, j = (e, t) => {
-	if (We("column name", t), t.length > 63) throw Error(`column '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Rename it.`);
+	if (Ge("column name", t), t.length > 63) throw Error(`column '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Rename it.`);
 	t.length > 60 && k(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
 }, M = (e, t, n, r) => {
-	if (We("index name", t), t.length > 63) throw Error(n ? `auto-named index '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Supply an explicit short name: .index('<shortName>', ${JSON.stringify([...r])}).` : `index name '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten it.`);
+	if (Ge("index name", t), t.length > 63) throw Error(n ? `auto-named index '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Supply an explicit short name: .index('<shortName>', ${JSON.stringify([...r])}).` : `index name '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten it.`);
 	t.length > 60 && k(`index '${t}' on table '${e}' is ${t.length} chars — ${63 - t.length} from the 63-byte limit. ${n ? `Consider .index('<shortName>', ${JSON.stringify([...r])}) before it grows.` : ""}`);
 }, N = (e, t) => {
 	if (e.length === 0) throw Error(`typeid prefix on table '${t.tableName}' cannot be empty.`);
@@ -558,29 +566,29 @@ var ce = () => new u({
 		throw Error(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — exceeds the 63-byte limit; ${n}`);
 	}
 	e.length > 60 && k(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — close to the 63-byte limit. Generated ids will be even longer (prefix + '_' + 26).`);
-}, Ge = 1704067200000n, Ke = 10n, qe = 12n, Je = (1n << Ke) - 1n, Ye = (1n << qe) - 1n, Xe = qe, Ze = 22n, Qe = () => {
+}, Ke = 1704067200000n, qe = 10n, Je = 12n, Ye = (1n << qe) - 1n, Xe = (1n << Je) - 1n, Ze = Je, Qe = 22n, $e = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > Je) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Je}.`);
+	if (t < 0n || t > Ye) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Ye}.`);
 	return t;
-}, $e = () => ({
+}, et = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: Qe()
-}), P, et = () => (P === void 0 && (P = $e()), P), tt = () => {
-	P = $e();
-}, nt = () => BigInt(Date.now()), rt = (e) => {
-	let t = nt();
-	for (; t <= e;) t = nt();
+	machineId: $e()
+}), P, tt = () => (P === void 0 && (P = et()), P), nt = () => {
+	P = et();
+}, rt = () => BigInt(Date.now()), it = (e) => {
+	let t = rt();
+	for (; t <= e;) t = rt();
 	return t;
-}, it = () => {
-	let e = et(), t = nt();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & Ye, e.sequence === 0n && (t = rt(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - Ge;
+}, at = () => {
+	let e = tt(), t = rt();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & Xe, e.sequence === 0n && (t = it(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - Ke;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Ze | e.machineId << Xe | e.sequence).toString();
-}, at = (e) => {
+	return (n << Qe | e.machineId << Ze | e.sequence).toString();
+}, ot = (e) => {
 	let t = e.toLowerCase();
 	if (t.startsWith("_")) throw Error(`cannot derive a typeid prefix for table '${e}' (table names starting with '_' are not valid typeid prefixes). Pick an explicit prefix via id({ prefix: '...' }) or use a different scheme like id({ scheme: 'numeric' }) for internal tables.`);
 	if (!/^[a-z][a-z0-9_]*$/.test(t)) throw Error(`cannot derive a typeid prefix from table name '${e}' (must match [a-z][a-z0-9_]*). Pick an explicit prefix via id({ prefix: '...' }).`);
@@ -589,10 +597,10 @@ var ce = () => new u({
 		kind: "derived",
 		tableName: e
 	}), n;
-}, ot = (e, t) => {
+}, st = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: at(t)
+		prefix: ot(t)
 	};
 	if ("prefix" in e && !("scheme" in e)) return N(e.prefix, {
 		kind: "explicit",
@@ -604,7 +612,7 @@ var ce = () => new u({
 	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
 	switch (e.scheme) {
 		case "typeid": {
-			let n = e.prefix ?? at(t);
+			let n = e.prefix ?? ot(t);
 			return e.prefix !== void 0 && N(e.prefix, {
 				kind: "explicit",
 				tableName: t
@@ -621,22 +629,22 @@ var ce = () => new u({
 			generate: e.generate
 		};
 	}
-}, st = (e, t) => {
+}, ct = (e, t) => {
 	switch (e.kind) {
 		case "typeid": return i(e.prefix).toString();
 		case "ulid": return a();
 		case "numeric": return null;
-		case "snowflake": return it();
+		case "snowflake": return at();
 		case "custom": return e.generate(t);
 	}
-}, ct = (e) => ({
+}, lt = (e) => ({
 	fields: S(e.fields),
 	...e.id === void 0 ? {} : { id: e.id },
 	...e.requires === void 0 ? {} : { requires: e.requires },
 	...e.indexes === void 0 ? {} : { indexes: e.indexes },
 	...e.behaviors === void 0 ? {} : { behaviors: e.behaviors },
 	...e.policies === void 0 ? {} : { policies: e.policies }
-}), lt = ct, ut = (e) => {
+}), ut = lt, dt = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -646,7 +654,7 @@ var ce = () => new u({
 	};
 	for (let t of e) r(t);
 	return n;
-}, dt = (e, ...t) => {
+}, ft = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -657,14 +665,14 @@ var ce = () => new u({
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, ft = (e = "cosine", t = "float32") => {
+}, pt = (e = "cosine", t = "float32") => {
 	let n = t === "half" ? "halfvec" : "vector";
 	switch (e) {
 		case "cosine": return `${n}_cosine_ops`;
 		case "l2": return `${n}_l2_ops`;
 		case "inner": return `${n}_ip_ops`;
 	}
-}, pt = [
+}, mt = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -673,7 +681,7 @@ var ce = () => new u({
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], mt = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, ht = (e, t) => `${e}_${t.join("_")}_idx`, gt = (e, t) => `${e}_${t.join("_")}_uq`, _t = (e, t, n, r, i) => {
+], ht = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, gt = (e, t) => `${e}_${t.join("_")}_idx`, _t = (e, t) => `${e}_${t.join("_")}_uq`, vt = (e, t, n, r, i) => {
 	if (n !== "hnsw") return;
 	if (r.length !== 1) throw Error(`hnsw index '${t}' on table '${e}' must cover exactly one vector column — got ${r.length} fields. pgvector's HNSW access method indexes a single vector column.`);
 	let a = r[0];
@@ -681,11 +689,11 @@ var ce = () => new u({
 	let o = i[a];
 	if (o === void 0) throw Error(`hnsw index '${t}' on table '${e}' references unknown column '${a}'.`);
 	if (o.type !== "vector") throw Error(`hnsw index '${t}' on table '${e}' requires a vector() column — column '${a}' is '${o.type}'. HNSW is the pgvector approximate-nearest-neighbour method and only applies to vectors.`);
-}, vt = (e, t) => {
+}, yt = (e, t) => {
 	let n;
 	for (let [r, i] of Object.entries(e)) i.type === "id" && i.idScheme === void 0 && (n === void 0 && (n = { ...e }), n[r] = {
 		...i,
-		idScheme: ot(i.idSchemeInput, t)
+		idScheme: st(i.idSchemeInput, t)
 	});
 	return n ?? e;
 }, F = (e) => {
@@ -729,20 +737,20 @@ var ce = () => new u({
 			});
 		}),
 		with: ((...t) => {
-			let n = ut(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
+			let n = dt(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
 			for (let e of Object.keys(r)) i.set(e, {
 				id: "<table>",
 				fields: {}
 			});
 			for (let t of n) for (let [n, a] of Object.entries(t.fields)) {
 				let o = i.get(n);
-				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${mt(o)}' and '${mt(t)}' both define it. If they're the same mixin reached via different paths, set a shared 'id' on both. If they're genuinely different concerns, rename one of the columns.`);
+				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${ht(o)}' and '${ht(t)}' both define it. If they're the same mixin reached via different paths, set a shared 'id' on both. If they're genuinely different concerns, rename one of the columns.`);
 				j(e.tableName, n), r[n] = a, i.set(n, t);
 			}
 			let a = [...e.appliedIndexes];
 			for (let t of n) for (let n of t.indexes ?? []) {
-				let t = n.name ?? ht(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (M(e.tableName, t, n.name === void 0, n.fields), _t(e.tableName, t, n.kind, n.fields, r), a.push({
+				let t = n.name ?? gt(e.tableName, n.fields);
+				a.some((e) => e.name === t) || (M(e.tableName, t, n.name === void 0, n.fields), vt(e.tableName, t, n.kind, n.fields, r), a.push({
 					name: t,
 					fields: n.fields,
 					...n.kind === void 0 ? {} : { kind: n.kind },
@@ -766,9 +774,9 @@ var ce = () => new u({
 		}),
 		index: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = ht(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`index '${n}' on table '${e.tableName}' has no fields — an index must cover at least one column.`);
+			if (a ? (r = t[0], i = t[1], n = gt(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`index '${n}' on table '${e.tableName}' has no fields — an index must cover at least one column.`);
 			let o = r.filter((e) => typeof e == "string");
-			if (M(e.tableName, n, a, o), _t(e.tableName, n, i?.kind, r, e.fields), e.appliedIndexes.some((e) => e.name === n)) throw t.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${e.tableName}' — you've called .index(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (rare).`) : Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table.`);
+			if (M(e.tableName, n, a, o), vt(e.tableName, n, i?.kind, r, e.fields), e.appliedIndexes.some((e) => e.name === n)) throw t.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${e.tableName}' — you've called .index(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (rare).`) : Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table.`);
 			return F({
 				...e,
 				tableName: e.tableName,
@@ -793,7 +801,7 @@ var ce = () => new u({
 		expressionIndex: ((t, n, r) => {
 			if (n.length === 0) throw Error(`expressionIndex '${t}' on table '${e.tableName}' has no fields — an index must cover at least one column or expression.`);
 			let i = n.filter((e) => typeof e == "string");
-			if (M(e.tableName, t, !1, i), _t(e.tableName, t, r?.kind, n, e.fields), e.appliedIndexes.some((e) => e.name === t)) throw Error(`duplicate index '${t}' on table '${e.tableName}': each index name must be unique within a table.`);
+			if (M(e.tableName, t, !1, i), vt(e.tableName, t, r?.kind, n, e.fields), e.appliedIndexes.some((e) => e.name === t)) throw Error(`duplicate index '${t}' on table '${e.tableName}': each index name must be unique within a table.`);
 			return F({
 				...e,
 				tableName: e.tableName,
@@ -817,7 +825,7 @@ var ce = () => new u({
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = gt(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`unique '${n}' on table '${e.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
+			if (a ? (r = t[0], i = t[1], n = _t(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`unique '${n}' on table '${e.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
 			if (M(e.tableName, n, a, r), e.appliedUniques.some((e) => e.name === n)) throw Error(a ? `duplicate auto-named UNIQUE '${n}' on table '${e.tableName}' — you've called .unique(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (very rare).` : `duplicate UNIQUE '${n}' on table '${e.tableName}': each constraint name must be unique within a table.`);
 			return F({
 				...e,
@@ -840,7 +848,7 @@ var ce = () => new u({
 		}),
 		uniqueActive: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = ht(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${e.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
+			if (a ? (r = t[0], i = t[1], n = gt(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${e.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
 			if (M(e.tableName, n, a, r), e.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
 			let o = i?.where ?? "\"deletedAt\" IS NULL";
 			return F({
@@ -980,7 +988,7 @@ var ce = () => new u({
 			column: e,
 			...n
 		}];
-	}), r = vt(S(t), e);
+	}), r = yt(S(t), e);
 	for (let t of Object.keys(r)) j(e, t);
 	let i;
 	for (let [t, n] of Object.entries(r)) n.references === x && (n.references = () => {
@@ -999,7 +1007,7 @@ var ce = () => new u({
 		appliedChecks: [],
 		appliedRules: []
 	}), i;
-}, yt = (e) => e === "sqlite" || e === "turso", bt = (e) => e === "mysql" || e === "mariadb", L = (e, t) => {
+}, bt = (e) => e === "sqlite" || e === "turso", xt = (e) => e === "mysql" || e === "mariadb", L = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e.replace(/`/g, "``")}\``;
@@ -1008,45 +1016,45 @@ var ce = () => new u({
 		case "sqlite":
 		case "turso": return `"${e.replace(/"/g, "\"\"")}"`;
 	}
-}, xt = 1e4, St = Symbol.for("@voltro/database/tableRegistry"), Ct = globalThis, R = Ct[St] ?? (Ct[St] = /* @__PURE__ */ new Map()), wt = (e) => {
+}, St = 1e4, Ct = Symbol.for("@voltro/database/tableRegistry"), wt = globalThis, R = wt[Ct] ?? (wt[Ct] = /* @__PURE__ */ new Map()), Tt = (e) => {
 	let t = R.get(e.tableName);
 	if (t === void 0) {
 		R.set(e.tableName, e);
 		return;
 	}
 	if (t !== e) throw Error(`duplicate table '${e.tableName}' registration: two different table descriptors claim the same name. Rename one or import the shared module that defines it.`);
-}, Tt = (e) => {
+}, Et = (e) => {
 	R.get(e.tableName) === void 0 && R.set(e.tableName, e);
-}, z = (e) => R.get(e), Et = (e) => {
+}, z = (e) => R.get(e), Dt = (e) => {
 	let t = R.get(e);
 	if (t === void 0) throw Error(`table '${e}' is not registered. Register it by wrapping it in \`databaseHandle({ ... })\` (the usual path) or call \`registerTable(t)\` explicitly before this runs. Note a \`queryFor(t)\` query carries its own source table, so eager-loads don't hit this — this error means a reconstructed descriptor or by-name tooling reached an unregistered table.`);
 	return t;
-}, Dt = () => [...R.values()], Ot = (e) => R.delete(e), kt = () => {
+}, Ot = () => [...R.values()], kt = (e) => R.delete(e), At = () => {
 	R.clear();
-}, At = (e) => R.get(e)?.isReactive !== !1, B = (e) => e.order ?? [], jt = (e) => ({
+}, jt = (e) => R.get(e)?.isReactive !== !1, B = (e) => e.order ?? [], Mt = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), Mt = (e, t) => ({
+}), Nt = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), Nt = (e, t) => ({
+}), Pt = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), Pt = (e, t) => ({
+}), Ft = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), Ft = (e, t) => ({
+}), It = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), It = (e, t) => ({
+}), Lt = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), Lt = (e, t) => ({
+}), Rt = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
@@ -1064,37 +1072,37 @@ var ce = () => new u({
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, Rt = V("union"), zt = V("union-all"), Bt = V("intersect"), Vt = V("except"), H = (e) => ({ over: (t) => ({
+}, zt = V("union"), Bt = V("union-all"), Vt = V("intersect"), Ht = V("except"), H = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), Ht = (e = "rowNumber") => H({
+}) }), Ut = (e = "rowNumber") => H({
 	op: "window-row-number",
 	alias: e
-}), Ut = (e = "rank") => H({
+}), Wt = (e = "rank") => H({
 	op: "window-rank",
 	alias: e
-}), Wt = (e = "denseRank") => H({
+}), Gt = (e = "denseRank") => H({
 	op: "window-dense-rank",
 	alias: e
-}), Gt = (e, t = 1, n) => H({
+}), Kt = (e, t = 1, n) => H({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), Kt = (e, t = 1, n) => H({
+}), qt = (e, t = 1, n) => H({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), qt = (e, t) => H({
+}), Jt = (e, t) => H({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), Jt = (e, t) => H({
+}), Yt = (e, t) => H({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), Yt = (e, t, n) => {
+}), Xt = (e, t, n) => {
 	let r = n?.find((e) => e.name === t) ?? z(e)?.appliedFullText?.find((e) => e.name === t);
 	if (r === void 0) throw Error(`.matching('${t}', ...): no full-text index named '${t}' is declared on table '${e}'. Declare it with \`table(...).fullTextIndex('${t}', [columns])\` first.`);
 	return {
@@ -1194,7 +1202,7 @@ var ce = () => new u({
 		});
 	},
 	matching(t, n) {
-		let r = Yt(e.table, t, e.fullTextIndexes);
+		let r = Xt(e.table, t, e.fullTextIndexes);
 		return U({
 			...e,
 			fullTextSearch: {
@@ -1366,7 +1374,7 @@ var ce = () => new u({
 		});
 	}
 });
-function Xt(e) {
+function Zt(e) {
 	return U({
 		table: e.tableName,
 		predicate: void 0,
@@ -1378,7 +1386,7 @@ function Xt(e) {
 		sourceTable: e
 	});
 }
-var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
+var Qt = (e, t, n) => $t(e, "id", t, n), $t = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1393,11 +1401,11 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, $t = (e) => {
+}, en = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) wt(r), t[n] = Xt(r);
+	for (let [n, r] of Object.entries(e)) Tt(r), t[n] = Zt(r);
 	return t;
-}, en = (e) => e.isView === !0, tn = (e, t, n) => {
+}, tn = (e) => e.isView === !0, nn = (e, t, n) => {
 	if (A(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
 	let r = S(t);
 	for (let t of Object.keys(r)) j(e, t);
@@ -1407,7 +1415,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		isView: !0,
 		viewSelect: n
 	};
-}, nn = (e) => Xt({
+}, rn = (e) => Zt({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1415,7 +1423,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), rn = (e, t, n = null) => {
+}), an = (e, t, n = null) => {
 	let r = n === null ? L(e.tableName, t) : `${L(n, t)}.${L(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
@@ -1425,7 +1433,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, an = (e) => e == null || typeof e == "boolean" ? e : typeof e == "number" ? e !== 0 : typeof e == "bigint" ? e !== 0n : typeof e == "string" ? e === "1" || e.toLowerCase() === "true" : e, on = (e) => {
+}, on = (e) => e == null || typeof e == "boolean" ? e : typeof e == "number" ? e !== 0 : typeof e == "bigint" ? e !== 0n : typeof e == "string" ? e === "1" || e.toLowerCase() === "true" : e, sn = (e) => {
 	if (e == null || typeof e != "string") return e;
 	let t = e.trim();
 	if (t.length === 0) return e;
@@ -1436,7 +1444,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	} catch {
 		return e;
 	}
-}, sn = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, cn = (e) => {
+}, cn = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, ln = (e) => {
 	if (e == null || e instanceof Date) return e;
 	if (typeof e == "string") {
 		let t = new Date(e);
@@ -1447,24 +1455,24 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		return isNaN(t.getTime()) ? e : t;
 	}
 	return e;
-}, ln = (e, t, n) => {
+}, un = (e, t, n) => {
 	if (e == null) return e;
 	switch (t) {
-		case "boolean": return n === "postgres" ? e : an(e);
-		case "vector": return n === "postgres" ? on(e) : e;
-		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : on(e);
-		case "array": return n === "postgres" ? e : on(e);
+		case "boolean": return n === "postgres" ? e : on(e);
+		case "vector": return n === "postgres" ? sn(e) : e;
+		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : sn(e);
+		case "array": return n === "postgres" ? e : sn(e);
 		case "timestamp":
-		case "date": return n === "sqlite" || n === "turso" ? cn(e) : e;
+		case "date": return n === "sqlite" || n === "turso" ? ln(e) : e;
 		case "decimal":
-		case "bigint": return sn(e);
+		case "bigint": return cn(e);
 		default: return e;
 	}
-}, un = (e, t, n) => {
+}, dn = (e, t, n) => {
 	if (e.length === 0) return e;
 	let r = z(t);
-	return r === void 0 ? e : dn(e, r, n);
-}, dn = (e, t, n) => {
+	return r === void 0 ? e : fn(e, r, n);
+}, fn = (e, t, n) => {
 	if (e.length === 0) return e;
 	let r = t.fields, i = [];
 	for (let [e, t] of Object.entries(r)) i.push({
@@ -1473,10 +1481,10 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	});
 	return e.map((e) => {
 		let t = { ...e };
-		for (let { key: e, type: r } of i) e in t && (t[e] = ln(t[e], r, n));
+		for (let { key: e, type: r } of i) e in t && (t[e] = un(t[e], r, n));
 		return t;
 	});
-}, fn = (e, t) => {
+}, pn = (e, t) => {
 	if (e == null) return e;
 	switch (t) {
 		case "json": return JSON.stringify(e);
@@ -1484,25 +1492,25 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		case "vector": return typeof e == "string" ? e : JSON.stringify(e);
 		default: return e;
 	}
-}, pn = (e, t, n = ["json", "array"]) => {
+}, mn = (e, t, n = ["json", "array"]) => {
 	let r = z(t);
 	if (r === void 0) return e;
 	let i = r.fields, a = null;
 	for (let [t, r] of Object.entries(i)) if (n.includes(r.type) && t in e) {
-		let n = fn(e[t], r.type);
+		let n = pn(e[t], r.type);
 		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
 	}
 	return a ?? e;
-}, mn = /^[A-Za-z_][A-Za-z0-9_]*$/, hn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : mn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), gn = (e) => "{" + e.map((e) => {
+}, hn = /^[A-Za-z_][A-Za-z0-9_]*$/, gn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : hn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), _n = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
 }).join(",") + "}", W = (e, t, n, r = {}) => {
 	let i = L(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${gn(t)}'::text[])`;
+		let e = `(${i} #>> '${_n(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = hn(t);
+	let o = gn(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1519,32 +1527,32 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, _n = class extends Error {
+}, vn = class extends Error {
 	_tag = "TenantNamespaceUnresolved";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceUnresolved";
 	}
-}, vn = class extends Error {
+}, yn = class extends Error {
 	_tag = "TenantNamespaceInvalid";
 	constructor(e) {
 		super(e), this.name = "TenantNamespaceInvalid";
 	}
-}, yn = 63, bn = "tenant_", xn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Sn = (e) => {
-	if (e == null || e === "") throw new _n("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 = xn(e);
-	if (t.replace(/_/g, "") === "") throw new vn(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
-	let n = `${bn}${t}`;
-	if (n.length > yn) throw new vn(`namespace '${n}' for tenant '${e}' exceeds the ${yn}-byte identifier limit. Use a shorter tenant id.`);
+}, bn = 63, xn = "tenant_", Sn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Cn = (e) => {
+	if (e == null || e === "") throw new vn("namespace isolation is on but the request has no resolvable tenant (subject.tenantId is null/empty). Refusing to run against a shared/default namespace — this would be a cross-tenant read. Authenticate with a tenant-scoped subject, or disable namespace isolation for this surface.");
+	let t = Sn(e);
+	if (t.replace(/_/g, "") === "") throw new yn(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
+	let n = `${xn}${t}`;
+	if (n.length > bn) throw new yn(`namespace '${n}' for tenant '${e}' exceeds the ${bn}-byte identifier limit. Use a shorter tenant id.`);
 	return n;
-}, G = (e, t) => e === null ? t : `${e}.${t}`, Cn = /* @__PURE__ */ new Set(["timestamp", "date"]), wn = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, Tn = (e, t) => {
-	if (e === void 0 || t == null || !Cn.has(e) || t instanceof Date) return t;
+}, G = (e, t) => e === null ? t : `${e}.${t}`, wn = /* @__PURE__ */ new Set(["timestamp", "date"]), Tn = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, En = (e, t) => {
+	if (e === void 0 || t == null || !wn.has(e) || t instanceof Date) return t;
 	if (typeof t == "number" && Number.isFinite(t)) return new Date(t);
-	if (typeof t == "string" && wn.test(t)) {
+	if (typeof t == "string" && Tn.test(t)) {
 		let e = new Date(t);
 		return Number.isNaN(e.getTime()) ? t : e;
 	}
 	return t;
-}, En = (e, t) => e === void 0 || !Cn.has(e) ? t : t.map((t) => Tn(e, t)), Dn = (e, t) => {
+}, Dn = (e, t) => e === void 0 || !wn.has(e) ? t : t.map((t) => En(e, t)), On = (e, t) => {
 	let { strings: n, values: r } = e, i = t.unsafe(n[0] ?? "");
 	for (let e = 0; e < r.length; e++) i = t`${i}${r[e]}${t.unsafe(n[e + 1] ?? "")}`;
 	return t`${i}`;
@@ -1570,10 +1578,10 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		mssql: () => t.unsafe(W(i.column, o, "mssql", { numeric: !0 })),
 		sqlite: () => t.unsafe(W(i.column, o, "sqlite", { numeric: !0 })),
 		orElse: () => t.unsafe(W(i.column, o, "postgres", { numeric: !0 }))
-	}), u = s ? c() : a, d = s ? l() : a, f = (e) => s && e != null ? String(e) : e, p = (e) => s ? Number(e) : e, m = s || r === void 0 ? void 0 : z(r)?.fields?.[i.column]?.type, h = (e) => Tn(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 : z(r)?.fields?.[i.column]?.type, ee = (e) => En(m, e);
 	switch (i.op) {
-		case "eq": return t`${u} = ${f(h(i.value))}`;
-		case "neq": return t`${u} <> ${f(h(i.value))}`;
+		case "eq": return t`${u} = ${f(ee(i.value))}`;
+		case "neq": return t`${u} <> ${f(ee(i.value))}`;
 		case "gt": return t`${d} > ${p(i.value)}`;
 		case "gte": return t`${d} >= ${p(i.value)}`;
 		case "lt": return t`${d} < ${p(i.value)}`;
@@ -1644,13 +1652,13 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			});
 		}
 	}
-}, On = (e, t) => {
+}, kn = (e, t) => {
 	let n = [];
 	return e.partitionBy && e.partitionBy.length > 0 && n.push(t`PARTITION BY ${t.csv(e.partitionBy.map((e) => t`${t(e)}`))}`), e.orderBy && e.orderBy.length > 0 && n.push(t`ORDER BY ${t.csv(e.orderBy.map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), n.length === 0 ? t`` : n.length === 1 ? n[0] : n.reduce((e, n, r) => r === 0 ? n : t`${e} ${n}`);
-}, kn = (e, t) => t.csv(e.map((e) => {
+}, An = (e, t) => t.csv(e.map((e) => {
 	let n = e.column === void 0 ? t.unsafe("*") : t`${t(e.column)}`;
 	if (e.op.startsWith("window-")) {
-		let r = On(e.window ?? {}, t);
+		let r = kn(e.window ?? {}, t);
 		switch (e.op) {
 			case "window-row-number": return t`ROW_NUMBER() OVER (${r}) AS ${t(e.alias)}`;
 			case "window-rank": return t`RANK() OVER (${r}) AS ${t(e.alias)}`;
@@ -1674,39 +1682,39 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			return t`${t(e.column)} AS ${t(e.alias)}`;
 		default: throw T(`compileAggregateProjection: unknown op '${e.op}'`);
 	}
-})), An = (e) => `[${e.join(",")}]`, jn = (e, t) => {
+})), jn = (e) => `[${e.join(",")}]`, Mn = (e, t) => {
 	if (e.queryVector === void 0) return null;
-	let n = t(e.column), r = An(e.queryVector), i = e.distance === "cosine" ? "<=>" : e.distance === "l2" ? "<->" : "<#>", a = e.distance === "cosine" ? "VEC_DISTANCE_COSINE" : "VEC_DISTANCE_EUCLIDEAN";
+	let n = t(e.column), r = jn(e.queryVector), i = e.distance === "cosine" ? "<=>" : e.distance === "l2" ? "<->" : "<#>", a = e.distance === "cosine" ? "VEC_DISTANCE_COSINE" : "VEC_DISTANCE_EUCLIDEAN";
 	return t.onDialectOrElse({
 		mysql: () => t`${t.unsafe(a)}(${n}, ${r})`,
 		mssql: () => t`NULL`,
 		sqlite: () => t`NULL`,
 		orElse: () => t`${n} ${t.unsafe(i)} ${r}::vector`
 	});
-}, Mn = (e, t) => {
+}, Nn = (e, t) => {
 	let n = t.unsafe(e.useGeography ? "::geography" : "::geometry");
 	return t`ST_Distance(${t(e.column)}${n}, ${e.geom}${n})`;
-}, Nn = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Pn = (e, t) => t`${t(`${e.indexName}_tsv`)}`, Fn = (e, t) => `${t}_${e.indexName}_fts`, In = (e, t, n) => {
+}, Pn = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, Fn = (e, t) => t`${t(`${e.indexName}_tsv`)}`, In = (e, t) => `${t}_${e.indexName}_fts`, Ln = (e, t, n) => {
 	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${K(e.query)}%`;
 	return n.onDialectOrElse({
 		mysql: () => n`MATCH(${r}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
 		sqlite: () => {
-			let r = n(Fn(e, t));
+			let r = n(In(e, t));
 			return n`${n("id")} IN (SELECT ${n("row_id")} FROM ${r} WHERE ${r} MATCH ${e.query})`;
 		},
 		mssql: () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`)),
-		orElse: () => n`${Pn(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})`
+		orElse: () => n`${Fn(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})`
 	});
-}, Ln = (e, t, n) => {
+}, Rn = (e, t, n) => {
 	let r = `%${K(e.query)}%`;
 	return n.onDialectOrElse({
 		mysql: () => n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
 		sqlite: () => {
-			let r = n(Fn(e, t));
+			let r = n(In(e, t));
 			return n`COALESCE((SELECT -bm25(${r}) FROM ${r} WHERE ${r} MATCH ${e.query} AND ${r}.${n("row_id")} = ${n("id")}), 0)`;
 		},
 		mssql: () => e.columns.map((e) => n`(CASE WHEN LOWER(${n(e)}) LIKE LOWER(${r}) ESCAPE '\\' THEN 1 ELSE 0 END)`).reduce((e, t, r) => r === 0 ? t : n`${e} + ${t}`),
-		orElse: () => n`ts_rank(${Pn(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))`
+		orElse: () => n`ts_rank(${Fn(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))`
 	});
 }, J = (e, t, n = null) => {
 	if (e.setOp && e.setOp.queries.length >= 2) {
@@ -1721,7 +1729,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		}
 		return t`${i}${a.reduce((e, n) => t`${e}${n}`, t``)}`;
 	}
-	let r = e.annClause === void 0 ? null : jn(e.annClause, t);
+	let r = e.annClause === void 0 ? null : Mn(e.annClause, t);
 	e.spatialClause !== void 0 && t.onDialectOrElse({
 		mysql: () => {
 			throw T("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
@@ -1734,7 +1742,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		},
 		orElse: () => t``
 	});
-	let i = e.spatialClause?.projectAs === void 0 ? null : Mn(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? kn(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 ? Ln(c, e.table, t) : null, u = l !== null && c?.rank !== void 0 ? t`${s}, ${l} AS ${t(c.rank.alias)}` : s, d = i !== null && !o && e.spatialClause?.projectAs !== void 0 ? t`${u}, ${i} AS ${t(e.spatialClause.projectAs)}` : u, f = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
+	let i = e.spatialClause?.projectAs === void 0 ? null : Nn(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? An(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : e.projection && e.projection.length > 0 ? t.csv(e.projection.map((e) => t`${t(e)}`)) : t`*`, o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? Rn(c, e.table, t) : null, u = l !== null && c?.rank !== void 0 ? t`${s}, ${l} AS ${t(c.rank.alias)}` : s, d = i !== null && !o && e.spatialClause?.projectAs !== void 0 ? t`${u}, ${i} AS ${t(e.spatialClause.projectAs)}` : u, f = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
 		orElse: () => t`DISTINCT ON (${t.csv(e.distinctOn.map((e) => t`${t(e)}`))}) `,
 		mysql: () => t`DISTINCT `,
 		mssql: () => t`DISTINCT `,
@@ -1742,15 +1750,15 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	}) : e.distinct ? t`DISTINCT ` : t``, p = e.lock === "update", m = p ? t.onDialectOrElse({
 		mssql: () => t` WITH (UPDLOCK, ROWLOCK)`,
 		orElse: () => t``
-	}) : t``, h = p ? t.onDialectOrElse({
+	}) : t``, ee = p ? t.onDialectOrElse({
 		mssql: () => t``,
 		sqlite: () => t``,
 		orElse: () => t` FOR UPDATE`
-	}) : t``, ee = e.alias === void 0 ? t`${t(G(n, e.table))}${m}` : t`${t(G(n, e.table))} AS ${t(e.alias)}${m}`, te = (e.joins ?? []).map((e) => {
+	}) : t``, h = e.alias === void 0 ? t`${t(G(n, e.table))}${m}` : t`${t(G(n, e.table))} AS ${t(e.alias)}${m}`, te = (e.joins ?? []).map((e) => {
 		let r = e.kind === "inner" ? "INNER" : "LEFT";
 		return t` ${t.unsafe(r)} JOIN ${t(G(n, e.table))} AS ${t(e.alias)} ON ${q(e.on, t, n)}`;
-	}), ne = te.length > 0 ? te.reduce((e, n) => t`${e}${n}`, ee) : ee, re = c === void 0 ? null : In(c, e.table, t), g = [e.predicate ? q(e.predicate, t, n, e.table) : null, re].filter((e) => e !== null), _ = g.length > 0 ? t` WHERE ${t.and(g)}` : t``, ie = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, v = e.having ? t` HAVING ${q(e.having, t, n, e.table)}` : t``, y = e.skip !== void 0, b = [];
-	r !== null && b.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && b.push(e.spatialClause.order === "desc" ? t`${Nn(e.spatialClause, t)} DESC` : t`${Nn(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && b.push(t`${l} DESC`);
+	}), ne = te.length > 0 ? te.reduce((e, n) => t`${e}${n}`, h) : h, re = c === void 0 ? null : Ln(c, e.table, t), g = [e.predicate ? q(e.predicate, t, n, e.table) : null, re].filter((e) => e !== null), _ = g.length > 0 ? t` WHERE ${t.and(g)}` : t``, ie = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, v = e.having ? t` HAVING ${q(e.having, t, n, e.table)}` : t``, y = e.skip !== void 0, b = [];
+	r !== null && b.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && b.push(e.spatialClause.order === "desc" ? t`${Pn(e.spatialClause, t)} DESC` : t`${Pn(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && b.push(t`${l} DESC`);
 	for (let n of B(e)) b.push(n.direction === "desc" ? t`${t(n.column)} DESC` : t`${t(n.column)} ASC`);
 	let ae = b.length > 0 ? t` ORDER BY ${t.csv(b)}` : y ? t.onDialectOrElse({
 		mssql: () => t` ORDER BY (SELECT NULL)`,
@@ -1766,7 +1774,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		},
 		orElse: () => {
 			let n = e.take === void 0 ? t`` : t` LIMIT ${x(e.take)}`, r = y ? t` OFFSET ${x(e.skip)}` : t``;
-			return t`${ce}SELECT ${f}${d} FROM ${ne}${_}${ie}${v}${ae}${n}${r}${h}`;
+			return t`${ce}SELECT ${f}${d} FROM ${ne}${_}${ie}${v}${ae}${n}${r}${ee}`;
 		}
 	});
 }, Y = (e, t) => {
@@ -1787,73 +1795,73 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		a = t === n ? 0 : t > n ? 1 : -1;
 	}
 	return a === 0 ? 0 : (a > 0 ? 1 : -1) * (r.negative ? -1 : 1);
-}, Rn = (e, t) => ({
+}, zn = (e, t) => ({
 	column: e,
 	op: "eq",
 	value: t
-}), zn = (e, t) => ({
+}), Bn = (e, t) => ({
 	column: e,
 	op: "neq",
 	value: t
-}), Bn = (e, t) => ({
+}), Vn = (e, t) => ({
 	column: e,
 	op: "gt",
 	value: t
-}), Vn = (e, t) => ({
+}), Hn = (e, t) => ({
 	column: e,
 	op: "gte",
 	value: t
-}), Hn = (e, t) => ({
+}), Un = (e, t) => ({
 	column: e,
 	op: "lt",
 	value: t
-}), Un = (e, t) => ({
+}), Wn = (e, t) => ({
 	column: e,
 	op: "lte",
 	value: t
-}), Wn = (e, t) => ({
+}), Gn = (e, t) => ({
 	column: e,
 	op: "in",
 	value: t
-}), Gn = (e, t) => ({
+}), Kn = (e, t) => ({
 	column: e,
 	op: "notIn",
 	value: t
-}), Kn = (e, t) => ({
+}), qn = (e, t) => ({
 	column: e,
 	op: "contains",
 	value: t
-}), qn = (e, t) => ({
+}), Jn = (e, t) => ({
 	column: e,
 	op: "startsWith",
 	value: t
-}), Jn = (e, t) => ({
+}), Yn = (e, t) => ({
 	column: e,
 	op: "arrayContains",
 	value: t
-}), Yn = (e, t) => ({
+}), Xn = (e, t) => ({
 	column: e,
 	op: "arrayOverlaps",
 	value: t
-}), Xn = (e, t) => ({
+}), Zn = (e, t) => ({
 	column: e,
 	op: "arrayHas",
 	value: t
-}), Zn = {
+}), Qn = {
 	column: "id",
 	op: "in",
 	value: []
-}, Qn = (e) => ({
+}, $n = (e) => ({
 	column: e,
 	op: "isNull"
-}), $n = (e) => ({
+}), er = (e) => ({
 	column: e,
 	op: "isNotNull"
-}), er = (e, t) => ({
+}), tr = (e, t) => ({
 	column: e,
 	op: "spatial",
 	value: t
-}), tr = (...e) => ({ and: e }), nr = (...e) => ({ or: e }), rr = (e) => ({ not: e }), ir = (e, ...t) => {
+}), nr = (...e) => ({ and: e }), rr = (...e) => ({ or: e }), ir = (e) => ({ not: e }), ar = (e, ...t) => {
 	if (t.length === 0) throw T(`jsonField("${e}"): at least one path segment is required`);
 	let n = (n, r) => ({
 		column: e,
@@ -1875,37 +1883,37 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		isNull: () => n("isNull"),
 		isNotNull: () => n("isNotNull")
 	};
-}, X = (e) => "descriptor" in e ? e.descriptor : e, ar = (e, t) => ({
+}, X = (e) => "descriptor" in e ? e.descriptor : e, or = (e, t) => ({
 	column: e,
 	op: "subquery-in",
 	subquery: X(t)
-}), or = (e, t) => ({
+}), sr = (e, t) => ({
 	column: e,
 	op: "subquery-not-in",
 	subquery: X(t)
-}), sr = (e) => ({
+}), cr = (e) => ({
 	op: "exists",
 	subquery: X(e)
-}), cr = (e) => ({
+}), lr = (e) => ({
 	op: "not-exists",
 	subquery: X(e)
-}), lr = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, ur = (e) => {
+}), ur = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, dr = (e) => {
 	if (e instanceof Date) return e.getTime();
-	if (typeof e == "string" && lr.test(e)) {
+	if (typeof e == "string" && ur.test(e)) {
 		let t = Date.parse(e);
 		return Number.isNaN(t) ? void 0 : t;
 	}
-}, dr = (e, t) => {
+}, fr = (e, t) => {
 	if (!(e instanceof Date) && !(t instanceof Date)) return;
-	let n = ur(e), r = ur(t);
+	let n = dr(e), r = dr(t);
 	return n === void 0 || r === void 0 ? void 0 : [n, r];
-}, fr = (e, t) => {
+}, pr = (e, t) => {
 	if (e === t) return !0;
-	let n = dr(e, t);
+	let n = fr(e, t);
 	return n !== void 0 && n[0] === n[1];
-}, pr = (e, t) => {
+}, mr = (e, t) => {
 	if (e == null || t == null) return null;
-	let n = dr(e, t);
+	let n = fr(e, t);
 	if (n !== void 0) return n[0] === n[1] ? 0 : n[0] > n[1] ? 1 : -1;
 	let r = e instanceof Date ? e.getTime() : e, i = t instanceof Date ? t.getTime() : t;
 	return typeof r == typeof i ? r === i ? 0 : r > i ? 1 : -1 : null;
@@ -1932,7 +1940,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		let t = n.get(e.subquery), r = typeof t == "number" ? t > 0 : t instanceof Set && t.size > 0;
 		return e.op === "exists" ? r : !r;
 	}
-	let i = e, a = t[i.column], o = r[i.column]?.type === "decimal", s = (e, t) => o && e != null && t != null ? Y(e, t) === 0 : fr(e, t), c = o ? Y : pr;
+	let i = e, a = t[i.column], o = r[i.column]?.type === "decimal", s = (e, t) => o && e != null && t != null ? Y(e, t) === 0 : pr(e, t), c = o ? Y : mr;
 	switch (i.op) {
 		case "eq": return s(a, i.value);
 		case "neq": return !s(a, i.value);
@@ -1994,13 +2002,13 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		...e,
 		conjunctive: t
 	});
-}, mr = (e, t) => ({
+}, hr = (e, t) => ({
 	name: e,
 	body: t
-}), hr = (e) => {
+}), gr = (e) => {
 	if (e.lifecycle === "cron" && !e.cron) throw Error(`seed "${e.id}": lifecycle 'cron' requires a 'cron' field`);
 	if (e.lifecycle === "onSchemaChange" && (!e.watchedTables || e.watchedTables.length === 0)) throw Error(`seed "${e.id}": lifecycle 'onSchemaChange' requires at least one entry in 'watchedTables'`);
-	let t = e.steps({ step: mr });
+	let t = e.steps({ step: hr });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -2013,76 +2021,76 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, gr = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, _r = null, vr = null, yr = (e) => {
-	_r = e;
-}, br = (e) => {
+}, _r = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, vr = null, yr = null, br = (e) => {
 	vr = e;
-}, xr = async (e) => {
-	let t = _r;
-	t !== null && await t(e);
+}, xr = (e) => {
+	yr = e;
 }, Sr = async (e) => {
 	let t = vr;
+	t !== null && await t(e);
+}, Cr = async (e) => {
+	let t = yr;
 	t !== null && e.changedTables.length !== 0 && await t(e);
-}, Cr = ["before-schema", "after-schema"], wr = (e) => {
+}, wr = ["before-schema", "after-schema"], Tr = (e) => {
 	if (!e.id || e.id.length === 0) throw Error("migration: `id` is required + must be non-empty");
 	if (!e.up || !e.down) throw Error(`migration ${e.id}: both \`up\` and \`down\` must be functions`);
-	if (!Cr.includes(e.phase)) throw Error(`migration ${e.id}: \`phase\` is required and must be one of ${Cr.map((e) => `'${e}'`).join(" | ")} — 'before-schema' runs before the declarative apply (a shape change the planner must not compute against), 'after-schema' runs after it (a body that needs the new shape, such as a back-fill into a table this deploy creates)`);
+	if (!wr.includes(e.phase)) throw Error(`migration ${e.id}: \`phase\` is required and must be one of ${wr.map((e) => `'${e}'`).join(" | ")} — 'before-schema' runs before the declarative apply (a shape change the planner must not compute against), 'after-schema' runs after it (a body that needs the new shape, such as a back-fill into a table this deploy creates)`);
 	return e;
-}, Tr = Symbol.for("voltro.migration.irreversible"), Er = class extends Error {
+}, Er = Symbol.for("voltro.migration.irreversible"), Dr = class extends Error {
 	migrationId;
 	reason;
 	_tag = "IrreversibleMigrationError";
 	constructor(e, t) {
 		super(`migration ${e} cannot be rolled back: ${t}`), this.migrationId = e, this.reason = t, this.name = "IrreversibleMigrationError";
 	}
-}, Dr = (e) => {
-	if (!e || e.trim().length === 0) throw Error("irreversible(): a reason is required");
-	return Object.assign(() => t.fail(new Er("<unknown>", e)), { [Tr]: e });
 }, Or = (e) => {
-	let t = e[Tr];
+	if (!e || e.trim().length === 0) throw Error("irreversible(): a reason is required");
+	return Object.assign(() => t.fail(new Dr("<unknown>", e)), { [Er]: e });
+}, kr = (e) => {
+	let t = e[Er];
 	return typeof t == "string" ? t : void 0;
-}, kr = class {
+}, Ar = class {
 	reason;
 	_tag = "MigrationSkipped";
 	constructor(e) {
 		this.reason = e;
 	}
-}, Ar = class extends Error {
+}, jr = class extends Error {
 	migrationId;
 	failed;
 	_tag = "MigrationExpectationFailed";
 	constructor(e, t) {
 		super(`migration ${e}: ${t.length} post-condition(s) did not hold after up():\n` + t.map((e) => `  - ${e}`).join("\n") + "\n  The migration is NOT recorded; the next run applies it again."), this.migrationId = e, this.failed = t, this.name = "MigrationExpectationFailed";
 	}
-}, jr = class extends Error {
+}, Mr = class extends Error {
 	migrationId;
 	dialect;
 	_tag = "TransactionBrokenByBodyError";
 	constructor(e, t) {
 		super(`migration ${e} is transactional, and its body COMMITTED the transaction from inside — on ${t} a DDL statement commits everything before it. The work is in the database and the migration is recorded; it will not run again. What did not hold is the all-or-nothing guarantee. Either mark it \`transactional: false\` (per-statement, resumable through your own idempotency) or move the schema change into \`ctx.schema\` in a migration of its own and keep this one to data.`), this.migrationId = e, this.dialect = t, this.name = "TransactionBrokenByBodyError";
 	}
-}, Mr = class extends Error {
+}, Nr = class extends Error {
 	migrationId;
 	operation;
 	_tag = "MigrationNeedsSqlClient";
 	constructor(e, t, n) {
 		super(`migration ${e}: ${t} — ${n}`), this.migrationId = e, this.operation = t, this.name = "MigrationNeedsSqlClient";
 	}
-}, Nr = class extends Error {
+}, Pr = class extends Error {
 	table;
 	report;
 	_tag = "RewriteUnstableError";
 	constructor(e, t) {
 		super(`rewrite of ${e} did not stabilise after ${t.passes} pass(es): ${t.rewritten} rewritten, ${t.contended} contended on the last pass. Check for concurrent writes and guard values that cannot round-trip exactly before raising maxPasses.`), this.table = e, this.report = t, this.name = "RewriteUnstableError";
 	}
-}, Pr = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Fr = (e) => typeof e == "object" && !!e && "id" in e && "up" in e && "down" in e && typeof e.id == "string" && typeof e.up == "function" && typeof e.down == "function", Ir = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Lr = (e) => Ir.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Rr = "_voltro_staging_", zr = (e) => e.startsWith(Rr), Br = /__dropped_\d{14}$/, Vr = (e) => Br.test(e), Hr = 7, Ur = (e) => {
+}, Fr = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Ir = (e) => typeof e == "object" && !!e && "id" in e && "up" in e && "down" in e && typeof e.id == "string" && typeof e.up == "function" && typeof e.down == "function", Lr = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Rr = (e) => Lr.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), zr = "_voltro_staging_", Br = (e) => e.startsWith(zr), Vr = /__dropped_\d{14}$/, Hr = (e) => Vr.test(e), Ur = 7, Wr = (e) => {
 	let t = /__dropped_(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})$/.exec(e);
 	if (t === null) return;
 	let [, n, r, i, a, o, s] = t;
 	return new Date(Date.UTC(Number(n), Number(r) - 1, Number(i), Number(a), Number(o), Number(s)));
-}, Wr = (e, t = {}) => {
+}, Gr = (e, t = {}) => {
 	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
-		let a = Ur(e);
+		let a = Wr(e);
 		if (a === void 0) return;
 		let o = Math.floor((n.getTime() - a.getTime()) / 864e5);
 		o >= r && i.push({
@@ -2091,12 +2099,12 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 			ageDays: o
 		});
 	};
-	for (let t of e.tables) if (a(t.name, t.name), !Vr(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
+	for (let t of e.tables) if (a(t.name, t.name), !Hr(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
 	return i;
-}, Gr = (e, t) => {
+}, Kr = (e, t) => {
 	let n = e.reduce((e, t) => e.ageDays >= t.ageDays ? e : t), r = (/* @__PURE__ */ new Date(Date.now() - t * 864e5)).toISOString().slice(0, 10);
 	return `${e.length} soft-drop snapshot(s) older than ${t} day(s) still hold the dropped data (oldest: ${n.name}, ${n.ageDays}d) — ${e.map((e) => e.name).join(", ")}. Restore with \`voltro db restore-snapshot\` or reclaim with \`voltro db gc-snapshots --before ${r}\`; the window is \`database.softDropRetentionDays\` in app.config.`;
-}, Kr = (e, t) => e.filter((e) => !Lr(e.name) || t.has(e.name)), qr = I("_voltro_migrations", {
+}, qr = (e, t) => e.filter((e) => !Rr(e.name) || t.has(e.name)), Jr = I("_voltro_migrations", {
 	id: f({ prefix: "mig" }),
 	name: p(),
 	hash: p(),
@@ -2108,7 +2116,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	workflowRunId: p().nullable(),
 	createdAt: _().default("now"),
 	updatedAt: _().default("now").onUpdate("now")
-}).index(["status"]), Jr = I("_voltro_seeds", {
+}).index(["status"]), Yr = I("_voltro_seeds", {
 	id: f({ prefix: "seed" }),
 	name: p(),
 	lifecycle: p(),
@@ -2124,7 +2132,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	workflowRunId: p().nullable(),
 	createdAt: _().default("now"),
 	updatedAt: _().default("now").onUpdate("now")
-}).index(["lifecycle"]).index(["nextRunAt"]), Yr = I("_voltro_migration_plans", {
+}).index(["lifecycle"]).index(["nextRunAt"]), Xr = I("_voltro_migration_plans", {
 	id: f({ prefix: "plan" }),
 	fingerprint: p(),
 	liveFingerprint: p().nullable(),
@@ -2140,14 +2148,14 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	appliedAt: _().default("now"),
 	createdAt: _().default("now"),
 	updatedAt: _().default("now").onUpdate("now")
-}).index(["fingerprint"]).index(["environment"]), Xr = I("_voltro_idempotency", {
+}).index(["fingerprint"]).index(["environment"]), Zr = I("_voltro_idempotency", {
 	id: f({ prefix: "idem" }),
 	scope: p(),
 	key: p(),
 	status: p(),
 	response: v().nullable(),
 	createdAt: _().default("now")
-}).unique(["scope", "key"]).index(["createdAt"]), Zr = I("_voltro_devices", {
+}).unique(["scope", "key"]).index(["createdAt"]), Qr = I("_voltro_devices", {
 	id: f({ prefix: "device" }),
 	tenantId: p(),
 	name: p(),
@@ -2167,20 +2175,20 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	createdBy: p().nullable(),
 	metadata: v().nullable(),
 	createdAt: _()
-}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), Qr = I("_voltro_tenant_selections", {
+}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), $r = I("_voltro_tenant_selections", {
 	id: f({ prefix: "tsel" }),
 	subjectType: p().maxLength(32),
 	subjectId: p(),
 	tenantId: p(),
 	selectedAt: _()
-}).primaryKey(["id"]).nonReactive(), $r = I("_voltro_kv", {
+}).primaryKey(["id"]).nonReactive(), ei = I("_voltro_kv", {
 	id: f({ prefix: "kv" }),
 	key: p().unique(),
 	value: p().nullable(),
 	expiresAt: _().nullable(),
 	createdAt: _().default("now"),
 	updatedAt: _().default("now").onUpdate("now")
-}).index(["expiresAt"]), ei = I("_voltro_api_keys", {
+}).index(["expiresAt"]), ti = I("_voltro_api_keys", {
 	id: f({ prefix: "apikey" }),
 	tenantId: p().nullable(),
 	name: p(),
@@ -2195,7 +2203,7 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	onBehalfOf: p().nullable(),
 	metadata: v().nullable(),
 	createdAt: _().default("now")
-}).index("byApiKeyTenant", ["tenantId"]), ti = I("_voltro_replica_observations", {
+}).index("byApiKeyTenant", ["tenantId"]), ni = I("_voltro_replica_observations", {
 	id: f({ prefix: "robs" }),
 	replicaId: p().maxLength(191),
 	startedAt: _(),
@@ -2204,11 +2212,11 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	payload: p().nullable(),
 	reachableAt: p().maxLength(255).nullable(),
 	writtenAt: _().default("now").onUpdate("now")
-}).unique(["replicaId", "kind"]).index(["kind"]), ni = [
-	qr,
+}).unique(["replicaId", "kind"]).index(["kind"]), ri = [
 	Jr,
-	Yr
-], ri = "_voltro_replace_in_progress", ii = I(ri, {
+	Yr,
+	Xr
+], ii = "_voltro_replace_in_progress", ai = I(ii, {
 	id: f({ prefix: "repl" }),
 	startedAt: _().default("now"),
 	kind: p().default("replace"),
@@ -2218,10 +2226,10 @@ var Zt = (e, t, n) => Qt(e, "id", t, n), Qt = (e, t, n, r, i = "asc") => {
 	staging: p().nullable(),
 	heartbeatAt: _().nullable(),
 	resumable: g().nullable()
-}), ai = 30, oi = (e, t) => {
+}), oi = 30, si = (e, t) => {
 	let n = typeof t == "number" && Number.isFinite(t) && t > 0 ? t : 30, r = Number(e.VOLTRO_STAGING_STALE_MINUTES);
 	return (Number.isFinite(r) && r > 0 ? r : n) * 6e4;
-}, si = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), ci = (e) => {
+}, ci = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), li = (e) => {
 	let t = e.filter((e) => e.kind !== "staging");
 	if (t.length !== 0) return `refusing to start: a destructive data operation did not finish.
 ${t.map((e) => {
@@ -2236,7 +2244,7 @@ ${t.map((e) => {
 
   When the data is back, or you have decided the current state is correct, clear the marker:
       voltro data clear-replace-marker --yes`;
-}, li = (e, t, n) => {
+}, ui = (e, t, n) => {
 	let r = e.filter((e) => e.kind === "staging");
 	return {
 		all: r,
@@ -2246,7 +2254,7 @@ ${t.map((e) => {
 			return Number.isFinite(r) ? t - r >= n : !1;
 		})
 	};
-}, ui = (e, t) => {
+}, di = (e, t) => {
 	if (e.all.length === 0) return;
 	let n = new Set(e.droppable.map((e) => e.id));
 	return `staged data-import leftovers:
@@ -2257,4 +2265,4 @@ ${e.all.map((e) => {
   a reason to refuse the boot — it is a reason to know the disk is holding a copy of a bundle.`;
 };
 //#endregion
-export { Kn as $, be as $n, It as $t, Er as A, ut as An, se as Ar, G as At, wr as B, M as Bn, tn as Bt, Gr as C, L as Cn, de as Cr, Dn as Ct, Kr as D, ft as Dn, me as Dr, En as Dt, zr as E, I as En, te as Er, Tn as Et, Nr as F, tt as Fn, le as Fr, dn as Ft, br as G, w as Gn, jt as Gt, Sr as H, N as Hn, Pt as Ht, jr as I, Be as In, un as It, tr as J, Re as Jn, Wt as Jt, yr as K, Pe as Kn, Mt as Kt, Dr as L, Ve as Ln, pn as Lt, Ar as M, st as Mn, o as Mr, xn as Mt, Mr as N, ot as Nn, p as Nr, W as Nt, Ur as O, lt as On, c as Or, vn as Ot, kr as P, it as Pn, _ as Pr, ln as Pt, Q, Ee as Qn, Kt as Qt, Or as R, He as Rn, en as Rt, Wr as S, yt as Sn, m as Sr, q as St, Vr as T, dt as Tn, S as Tr, K as Tt, xr as U, T as Un, Jt as Ut, hr as V, A as Vn, rn as Vt, gr as W, Oe as Wn, Lt as Wt, Xn as X, Fe as Xn, Bt as Xt, Jn as Y, Te as Yn, Vt as Yt, Yn as Z, Ie as Zn, Gt as Zt, Qr as _, wt as _n, ee as _r, nr as _t, ui as a, Ut as an, u as ar, Wn as at, Ir as b, xt as bn, pe as br, $ as bt, oi as c, Nt as cn, ne as cr, Qn as ct, Xr as d, zt as dn, ae as dr, Un as dt, Ft as en, xe as er, Rn as et, $r as f, Dt as fn, l as fr, zn as ft, Jr as g, At as gn, re as gr, or as gt, ti as h, z as hn, ie as hr, Gn as ht, ci as i, Xt as in, ge as ir, Vn as it, Cr as j, at as jn, oe as jr, Sn as jt, Pr as k, ct as kn, h as kr, _n as kt, ei as l, qt as ln, g as lr, ir as lt, qr as m, Tt as mn, b as mr, cr as mt, ai as n, Qt as nn, ye as nr, sr as nt, li as o, Yt as on, x as or, ar as ot, Yr as p, kt as pn, s as pr, rr as pt, Zn as q, Le as qn, $t as qt, ii as r, Zt as rn, _e as rr, Bn as rt, si as s, Ht as sn, ue as sr, $n as st, ri as t, B as tn, ve as tr, Z as tt, Zr as u, Rt as un, y as ur, Hn as ut, ni as v, Et as vn, ce as vr, er as vt, Lr as w, pt as wn, v as wr, J as wt, Rr as x, bt as xn, f as xr, Y as xt, Hr as y, Ot as yn, fe as yr, qn as yt, Fr as z, j as zn, nn as zt };
+export { qn as $, Ee as $n, Lt as $t, Dr as A, dt as An, ee as Ar, G as At, Tr as B, M as Bn, nn as Bt, Kr as C, L as Cn, m as Cr, On as Ct, qr as D, pt as Dn, te as Dr, Dn as Dt, Br as E, I as En, S as Er, En as Et, Pr as F, nt as Fn, _ as Fr, fn as Ft, xr as G, w as Gn, Mt as Gt, Cr as H, N as Hn, Ft as Ht, Mr as I, Ve as In, le as Ir, dn as It, nr as J, Re as Jn, Gt as Jt, br as K, Pe as Kn, Nt as Kt, Or as L, He as Ln, mn as Lt, jr as M, ct as Mn, oe as Mr, Sn as Mt, Nr as N, st as Nn, o as Nr, W as Nt, Wr as O, ut as On, me as Or, yn as Ot, Ar as P, at as Pn, p as Pr, un as Pt, Q, Ie as Qn, qt as Qt, kr as R, Ue as Rn, tn as Rt, Gr as S, bt as Sn, f as Sr, q as St, Hr as T, ft as Tn, v as Tr, K as Tt, Sr as U, T as Un, Yt as Ut, gr as V, A as Vn, an as Vt, _r as W, Oe as Wn, Rt as Wt, Zn as X, Te as Xn, Vt as Xt, Yn as Y, ze as Yn, Ht as Yt, Xn as Z, Fe as Zn, Kt as Zt, $r as _, Tt as _n, re as _r, rr as _t, di as a, Wt as an, ge as ar, Gn as at, Lr as b, St as bn, fe as br, $ as bt, si as c, Pt as cn, ue as cr, $n as ct, Zr as d, Bt as dn, y as dr, Wn as dt, It as en, be as er, zn as et, ei as f, Ot as fn, ae as fr, Bn as ft, Yr as g, jt as gn, ie as gr, sr as gt, ni as h, z as hn, b as hr, Kn as ht, li as i, Zt as in, _e as ir, Hn as it, wr as j, ot as jn, se as jr, Cn as jt, Fr as k, lt as kn, c as kr, vn as kt, ti as l, Jt as ln, ne as lr, ar as lt, Jr as m, Et as mn, s as mr, lr as mt, oi as n, $t as nn, ve as nr, cr as nt, ui as o, Xt as on, u as or, or as ot, Xr as p, At as pn, l as pr, ir as pt, Qn as q, Le as qn, en as qt, ai as r, Qt as rn, ye as rr, Vn as rt, ci as s, Ut as sn, x as sr, er as st, ii as t, B as tn, xe as tr, Z as tt, Qr as u, zt as un, g as ur, Un as ut, ri as v, Dt as vn, h as vr, tr as vt, Rr as w, mt as wn, de as wr, J as wt, zr as x, xt as xn, pe as xr, Y as xt, Ur as y, kt as yn, ce as yr, Jn as yt, Ir as z, j as zn, rn as zt };