@voltro/database 0.53.0 → 0.55.0

package/dist/{frameworkLiveTables-ChVR-C5F.js → frameworkLiveTables-CwDemhjW.js}

@@ -333,29 +333,29 @@ var r = (e) => {
 		throw Error(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — exceeds the 63-byte limit; ${n}`);
 	}
 	e.length > 60 && _(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — close to the 63-byte limit. Generated ids will be even longer (prefix + '_' + 26).`);
-}, ke = 1704067200000n, C = 10n, w = 12n, T = (1n << C) - 1n, Ae = (1n << w) - 1n, je = w, Me = 22n, Ne = () => {
+}, ke = 1704067200000n, Ae = 10n, C = 12n, w = (1n << Ae) - 1n, je = (1n << C) - 1n, Me = C, Ne = 22n, Pe = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > T) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${T}.`);
+	if (t < 0n || t > w) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${w}.`);
 	return t;
-}, E = () => ({
+}, T = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: Ne()
-}), D, Pe = () => (D === void 0 && (D = E()), D), Fe = () => {
-	D = E();
-}, O = () => BigInt(Date.now()), Ie = (e) => {
-	let t = O();
-	for (; t <= e;) t = O();
+	machineId: Pe()
+}), E, Fe = () => (E === void 0 && (E = T()), E), Ie = () => {
+	E = T();
+}, D = () => BigInt(Date.now()), Le = (e) => {
+	let t = D();
+	for (; t <= e;) t = D();
 	return t;
-}, k = () => {
-	let e = Pe(), t = O();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & Ae, e.sequence === 0n && (t = Ie(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+}, O = () => {
+	let e = Fe(), t = D();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & je, e.sequence === 0n && (t = Le(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 << Me | e.machineId << je | e.sequence).toString();
-}, A = (e) => {
+	return (n << Ne | e.machineId << Me | e.sequence).toString();
+}, k = (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: '...' }).`);
@@ -364,10 +364,10 @@ var r = (e) => {
 		kind: "derived",
 		tableName: e
 	}), n;
-}, j = (e, t) => {
+}, A = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: A(t)
+		prefix: k(t)
 	};
 	if ("prefix" in e && !("scheme" in e)) return S(e.prefix, {
 		kind: "explicit",
@@ -379,7 +379,7 @@ var r = (e) => {
 	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
 	switch (e.scheme) {
 		case "typeid": {
-			let n = e.prefix ?? A(t);
+			let n = e.prefix ?? k(t);
 			return e.prefix !== void 0 && S(e.prefix, {
 				kind: "explicit",
 				tableName: t
@@ -396,22 +396,22 @@ var r = (e) => {
 			generate: e.generate
 		};
 	}
-}, Le = (e, r) => {
+}, Re = (e, r) => {
 	switch (e.kind) {
 		case "typeid": return t(e.prefix).toString();
 		case "ulid": return n();
 		case "numeric": return null;
-		case "snowflake": return k();
+		case "snowflake": return O();
 		case "custom": return e.generate(r);
 	}
-}, M = (e) => ({
+}, j = (e) => ({
 	fields: f(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 }
-}), Re = M, N = (e) => {
+}), ze = j, M = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -421,7 +421,7 @@ var r = (e) => {
 	};
 	for (let t of e) r(t);
 	return n;
-}, ze = (e, ...t) => {
+}, Be = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -432,14 +432,14 @@ var r = (e) => {
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, Be = (e = "cosine", t = "float32") => {
+}, Ve = (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`;
 	}
-}, Ve = [
+}, He = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -448,7 +448,7 @@ var r = (e) => {
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], P = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, F = (e, t) => `${e}_${t.join("_")}_idx`, He = (e, t) => `${e}_${t.join("_")}_uq`, I = (e, t, n, r, i) => {
+], N = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, P = (e, t) => `${e}_${t.join("_")}_idx`, Ue = (e, t) => `${e}_${t.join("_")}_uq`, F = (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];
@@ -456,14 +456,14 @@ var r = (e) => {
 	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.`);
-}, Ue = (e, t) => {
+}, We = (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: j(i.idSchemeInput, t)
+		idScheme: A(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, L = (t) => {
+}, I = (t) => {
 	let n = t.appliedPrimaryKey ?? [];
 	return {
 		tableName: t.tableName,
@@ -483,7 +483,7 @@ var r = (e) => {
 		fullTextIndex: ((e, n, r) => {
 			if (n.length === 0) throw Error(`fullTextIndex '${e}' on '${t.tableName}' has no columns.`);
 			if (x(t.tableName, e, !1, n), t.appliedFullText.some((t) => t.name === e)) throw Error(`duplicate full-text index '${e}' on table '${t.tableName}'.`);
-			return L({
+			return I({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -504,27 +504,27 @@ var r = (e) => {
 			});
 		}),
 		with: ((...e) => {
-			let n = N(e), r = { ...t.fields }, i = /* @__PURE__ */ new Map();
+			let n = M(e), r = { ...t.fields }, i = /* @__PURE__ */ new Map();
 			for (let e of Object.keys(r)) i.set(e, {
 				id: "<table>",
 				fields: {}
 			});
 			for (let e of n) for (let [n, a] of Object.entries(e.fields)) {
 				let o = i.get(n);
-				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${t.tableName}': '${P(o)}' and '${P(e)}' 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 '${t.tableName}': '${N(o)}' and '${N(e)}' 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.`);
 				b(t.tableName, n), r[n] = a, i.set(n, e);
 			}
 			let a = [...t.appliedIndexes];
 			for (let e of n) for (let n of e.indexes ?? []) {
-				let e = n.name ?? F(t.tableName, n.fields);
-				a.some((t) => t.name === e) || (x(t.tableName, e, n.name === void 0, n.fields), I(t.tableName, e, n.kind, n.fields, r), a.push({
+				let e = n.name ?? P(t.tableName, n.fields);
+				a.some((t) => t.name === e) || (x(t.tableName, e, n.name === void 0, n.fields), F(t.tableName, e, n.kind, n.fields, r), a.push({
 					name: e,
 					fields: n.fields,
 					...n.kind === void 0 ? {} : { kind: n.kind },
 					...n.kindOptions === void 0 ? {} : { kindOptions: n.kindOptions }
 				}));
 			}
-			return L({
+			return I({
 				...t,
 				tableName: t.tableName,
 				fields: r,
@@ -541,10 +541,10 @@ var r = (e) => {
 		}),
 		index: ((...e) => {
 			let n, r, i, a = Array.isArray(e[0]);
-			if (a ? (r = e[0], i = e[1], n = F(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`index '${n}' on table '${t.tableName}' has no fields — an index must cover at least one column.`);
+			if (a ? (r = e[0], i = e[1], n = P(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`index '${n}' on table '${t.tableName}' has no fields — an index must cover at least one column.`);
 			let o = r.filter((e) => typeof e == "string");
-			if (x(t.tableName, n, a, o), I(t.tableName, n, i?.kind, r, t.fields), t.appliedIndexes.some((e) => e.name === n)) throw e.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${t.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 '${t.tableName}': each index name must be unique within a table.`);
-			return L({
+			if (x(t.tableName, n, a, o), F(t.tableName, n, i?.kind, r, t.fields), t.appliedIndexes.some((e) => e.name === n)) throw e.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${t.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 '${t.tableName}': each index name must be unique within a table.`);
+			return I({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -568,8 +568,8 @@ var r = (e) => {
 		expressionIndex: ((e, n, r) => {
 			if (n.length === 0) throw Error(`expressionIndex '${e}' on table '${t.tableName}' has no fields — an index must cover at least one column or expression.`);
 			let i = n.filter((e) => typeof e == "string");
-			if (x(t.tableName, e, !1, i), I(t.tableName, e, r?.kind, n, t.fields), t.appliedIndexes.some((t) => t.name === e)) throw Error(`duplicate index '${e}' on table '${t.tableName}': each index name must be unique within a table.`);
-			return L({
+			if (x(t.tableName, e, !1, i), F(t.tableName, e, r?.kind, n, t.fields), t.appliedIndexes.some((t) => t.name === e)) throw Error(`duplicate index '${e}' on table '${t.tableName}': each index name must be unique within a table.`);
+			return I({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -592,9 +592,9 @@ var r = (e) => {
 		}),
 		unique: ((...e) => {
 			let n, r, i, a = Array.isArray(e[0]);
-			if (a ? (r = e[0], i = e[1], n = He(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`unique '${n}' on table '${t.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
+			if (a ? (r = e[0], i = e[1], n = Ue(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`unique '${n}' on table '${t.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
 			if (x(t.tableName, n, a, r), t.appliedUniques.some((e) => e.name === n)) throw Error(a ? `duplicate auto-named UNIQUE '${n}' on table '${t.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 '${t.tableName}': each constraint name must be unique within a table.`);
-			return L({
+			return I({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -615,10 +615,10 @@ var r = (e) => {
 		}),
 		uniqueActive: ((...e) => {
 			let n, r, i, a = Array.isArray(e[0]);
-			if (a ? (r = e[0], i = e[1], n = F(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${t.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
+			if (a ? (r = e[0], i = e[1], n = P(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${t.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
 			if (x(t.tableName, n, a, r), t.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${t.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
 			let o = i?.where ?? "\"deletedAt\" IS NULL";
-			return L({
+			return I({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -641,7 +641,7 @@ var r = (e) => {
 		check: ((e, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${e}' on table '${t.tableName}' has an empty expression.`);
 			if (x(t.tableName, e, !1, []), t.appliedChecks.some((t) => t.name === e)) throw Error(`duplicate CHECK '${e}' on table '${t.tableName}': each constraint name must be unique within a table.`);
-			return L({
+			return I({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -663,7 +663,7 @@ var r = (e) => {
 			if (e.trim().length === 0) throw Error(`rule on table '${t.tableName}' has an empty name.`);
 			let i = t.appliedRules ?? [];
 			if (i.some((t) => t.name === e)) throw Error(`duplicate rule '${e}' on table '${t.tableName}': each rule name must be unique within a table.`);
-			return L({
+			return I({
 				...t,
 				appliedRules: [...i, {
 					name: e,
@@ -674,7 +674,7 @@ var r = (e) => {
 		}),
 		renamedFrom: ((e) => {
 			if (e === t.tableName) throw Error(`renamedFrom('${e}') on table '${t.tableName}' names the table itself — drop the marker, there is nothing to rename.`);
-			return y(e), L({
+			return y(e), I({
 				...t,
 				previousTableName: e
 			});
@@ -689,7 +689,7 @@ var r = (e) => {
 			}
 			if (n.length > 0) throw Error(`primaryKey([...]) declared twice on table '${t.tableName}'.`);
 			for (let [n, r] of Object.entries(t.fields)) if (r.type === "id" && !e.includes(n)) throw Error(`primaryKey([...]) on table '${t.tableName}' conflicts with the id() column '${n}'. A composite primary key IS the key — drop the id() column, or include '${n}' in the composite key.`);
-			return L({
+			return I({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -704,7 +704,7 @@ var r = (e) => {
 				...t.validatePatchSchema === void 0 ? {} : { validatePatchSchema: t.validatePatchSchema }
 			});
 		}),
-		nonReactive: (() => L({
+		nonReactive: (() => I({
 			...t,
 			tableName: t.tableName,
 			fields: t.fields,
@@ -718,7 +718,7 @@ var r = (e) => {
 			...t.insertSchema === void 0 ? {} : { insertSchema: t.insertSchema },
 			...t.validatePatchSchema === void 0 ? {} : { validatePatchSchema: t.validatePatchSchema }
 		})),
-		validate: ((e) => L({
+		validate: ((e) => I({
 			...t,
 			tableName: t.tableName,
 			fields: t.fields,
@@ -732,7 +732,7 @@ var r = (e) => {
 			insertSchema: e,
 			...t.validatePatchSchema === void 0 ? {} : { validatePatchSchema: t.validatePatchSchema }
 		})),
-		validatePatch: ((n) => L({
+		validatePatch: ((n) => I({
 			...t,
 			tableName: t.tableName,
 			fields: t.fields,
@@ -747,7 +747,7 @@ var r = (e) => {
 			validatePatchSchema: e.partial(n)
 		}))
 	};
-}, We = (e, t) => {
+}, Ge = (e, t) => {
 	y(e);
 	let n = Object.entries(t).flatMap(([e, t]) => {
 		let n = m(t);
@@ -755,9 +755,9 @@ var r = (e) => {
 			column: e,
 			...n
 		}];
-	}), r = Ue(f(t), e);
+	}), r = We(f(t), e);
 	for (let t of Object.keys(r)) b(e, t);
-	return L({
+	return I({
 		appliedPluginRefs: n,
 		tableName: e,
 		fields: r,
@@ -769,7 +769,7 @@ var r = (e) => {
 		appliedChecks: [],
 		appliedRules: []
 	});
-}, Ge = (e) => e === "sqlite" || e === "turso", Ke = (e) => e === "mysql" || e === "mariadb", R = (e, t) => {
+}, Ke = (e) => e === "sqlite" || e === "turso", qe = (e) => e === "mysql" || e === "mariadb", L = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e}\``;
@@ -778,51 +778,51 @@ var r = (e) => {
 		case "sqlite":
 		case "turso": return `"${e}"`;
 	}
-}, qe = 1e4, z = Symbol.for("@voltro/database/tableRegistry"), B = globalThis, V = B[z] ?? (B[z] = /* @__PURE__ */ new Map()), H = (e) => {
-	let t = V.get(e.tableName);
+}, Je = 1e4, R = Symbol.for("@voltro/database/tableRegistry"), z = globalThis, B = z[R] ?? (z[R] = /* @__PURE__ */ new Map()), V = (e) => {
+	let t = B.get(e.tableName);
 	if (t === void 0) {
-		V.set(e.tableName, e);
+		B.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.`);
-}, Je = (e) => {
-	V.get(e.tableName) === void 0 && V.set(e.tableName, e);
-}, U = (e) => V.get(e), Ye = (e) => {
-	let t = V.get(e);
+}, Ye = (e) => {
+	B.get(e.tableName) === void 0 && B.set(e.tableName, e);
+}, H = (e) => B.get(e), Xe = (e) => {
+	let t = B.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;
-}, Xe = () => [...V.values()], Ze = (e) => V.delete(e), Qe = () => {
-	V.clear();
-}, $e = (e) => V.get(e)?.isReactive !== !1, et = (e) => e.order ?? [], tt = (e) => ({
+}, Ze = () => [...B.values()], Qe = (e) => B.delete(e), $e = () => {
+	B.clear();
+}, et = (e) => B.get(e)?.isReactive !== !1, tt = (e) => e.order ?? [], nt = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), nt = (e, t) => ({
+}), rt = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), rt = (e, t) => ({
+}), it = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), it = (e, t) => ({
+}), at = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), at = (e, t) => ({
+}), ot = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), ot = (e, t) => ({
+}), st = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), st = (e, t) => ({
+}), ct = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), W = (e) => (...t) => {
+}), U = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return q({
+	return K({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -834,55 +834,55 @@ var r = (e) => {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, ct = W("union"), lt = W("union-all"), ut = W("intersect"), dt = W("except"), G = (e) => ({ over: (t) => ({
+}, lt = U("union"), ut = U("union-all"), dt = U("intersect"), ft = U("except"), W = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), ft = (e = "rowNumber") => G({
+}) }), pt = (e = "rowNumber") => W({
 	op: "window-row-number",
 	alias: e
-}), pt = (e = "rank") => G({
+}), mt = (e = "rank") => W({
 	op: "window-rank",
 	alias: e
-}), mt = (e = "denseRank") => G({
+}), ht = (e = "denseRank") => W({
 	op: "window-dense-rank",
 	alias: e
-}), ht = (e, t = 1, n) => G({
+}), gt = (e, t = 1, n) => W({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), gt = (e, t = 1, n) => G({
+}), _t = (e, t = 1, n) => W({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), _t = (e, t) => G({
+}), vt = (e, t) => W({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), vt = (e, t) => G({
+}), yt = (e, t) => W({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), K = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? U(e)?.appliedFullText?.find((e) => e.name === t);
+}), G = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? H(e)?.appliedFullText?.find((e) => e.name === t);
 	if (r === void 0) throw Error(`.matching('${t}', ...): no full-text index named '${t}' is declared on table '${e}'. Declare it with \`table(...).fullTextIndex('${t}', [columns])\` first.`);
 	return {
 		columns: r.columns,
 		...r.config === void 0 ? {} : { config: r.config },
 		...r.weights === void 0 ? {} : { weights: r.weights }
 	};
-}, q = (e) => ({
+}, K = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return q({
+		return K({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return q({
+		return K({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -891,37 +891,37 @@ var r = (e) => {
 		});
 	},
 	limit(t) {
-		return q({
+		return K({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return q({
+		return K({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return q({
+		return K({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return q({
+		return K({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return q({
+		return K({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	unscoped() {
-		return q({
+		return K({
 			...e,
 			crossTenant: !0
 		});
@@ -931,13 +931,13 @@ var r = (e) => {
 			...e.eager ?? {},
 			...t
 		};
-		return q({
+		return K({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return q({
+		return K({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -951,15 +951,15 @@ var r = (e) => {
 			...t,
 			alias: e
 		}));
-		return q({
+		return K({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = K(e.table, t, e.fullTextIndexes);
-		return q({
+		let r = G(e.table, t, e.fullTextIndexes);
+		return K({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -973,7 +973,7 @@ var r = (e) => {
 	rankBy(t) {
 		let n = e.fullTextSearch;
 		if (n === void 0) throw Error(".rankBy() requires a preceding .matching(...) clause — there is no full-text search to rank on this query.");
-		return q({
+		return K({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -992,7 +992,7 @@ var r = (e) => {
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return q({
+			return K({
 				...e,
 				annClause: i
 			});
@@ -1004,7 +1004,7 @@ var r = (e) => {
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return q({
+			return K({
 				...e,
 				annClause: r,
 				take: n
@@ -1017,7 +1017,7 @@ var r = (e) => {
 			column: "",
 			distance: "cosine"
 		};
-		return q({
+		return K({
 			...e,
 			annClause: {
 				...n,
@@ -1026,22 +1026,22 @@ var r = (e) => {
 		});
 	},
 	use(t) {
-		return q({ ...t(e) });
+		return K({ ...t(e) });
 	},
 	distinct() {
-		return q({
+		return K({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return q({
+		return K({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return q({
+		return K({
 			...e,
 			alias: t
 		});
@@ -1053,7 +1053,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return q({
+		return K({
 			...e,
 			joins: a
 		});
@@ -1065,7 +1065,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return q({
+		return K({
 			...e,
 			joins: a
 		});
@@ -1075,7 +1075,7 @@ var r = (e) => {
 			outputKey: e,
 			source: t
 		}));
-		return q({
+		return K({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1084,7 +1084,7 @@ var r = (e) => {
 	withCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.withCte: duplicate CTE name '${t}'`);
-		return q({
+		return K({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1095,7 +1095,7 @@ var r = (e) => {
 	recursiveCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.recursiveCte: duplicate CTE name '${t}'`);
-		return q({
+		return K({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1106,20 +1106,20 @@ var r = (e) => {
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return q({
+		return K({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return q({
+		return K({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return q({
+		return K({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1130,8 +1130,8 @@ var r = (e) => {
 		});
 	}
 });
-function J(e) {
-	return q({
+function q(e) {
+	return K({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1142,7 +1142,7 @@ function J(e) {
 		sourceTable: e
 	});
 }
-var yt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
+var bt = (e, t, n) => J(e, "id", t, n), J = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1157,11 +1157,11 @@ var yt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, bt = (e) => {
+}, xt = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) H(r), t[n] = J(r);
+	for (let [n, r] of Object.entries(e)) V(r), t[n] = q(r);
 	return t;
-}, xt = (e) => e.isView === !0, St = (e, t, n) => {
+}, St = (e) => e.isView === !0, Ct = (e, t, n) => {
 	if (y(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
 	let r = f(t);
 	for (let t of Object.keys(r)) b(e, t);
@@ -1171,7 +1171,7 @@ var yt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
 		isView: !0,
 		viewSelect: n
 	};
-}, Ct = (e) => J({
+}, wt = (e) => q({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1179,8 +1179,8 @@ var yt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), wt = (e, t, n = null) => {
-	let r = n === null ? R(e.tableName, t) : `${R(n, t)}.${R(e.tableName, t)}`, i = e.viewSelect.trim();
+}), Tt = (e, t, n = null) => {
+	let r = n === null ? L(e.tableName, t) : `${L(n, t)}.${L(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1189,16 +1189,16 @@ var yt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, Tt = /^[A-Za-z_][A-Za-z0-9_]*$/, Et = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : Tt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), Dt = (e) => "{" + e.map((e) => {
+}, Et = /^[A-Za-z_][A-Za-z0-9_]*$/, Dt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : Et.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), Ot = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", Ot = (e, t, n, r = {}) => {
-	let i = R(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", kt = (e, t, n, r = {}) => {
+	let i = L(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${Dt(t)}'::text[])`;
+		let e = `(${i} #>> '${Ot(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = Et(t);
+	let o = Dt(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1215,13 +1215,13 @@ var yt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, kt = (e, t) => ({
+}, At = (e, t) => ({
 	name: e,
 	body: t
-}), X = (e) => {
+}), Y = (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: kt });
+	let t = e.steps({ step: At });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -1234,20 +1234,20 @@ var yt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, At = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Z = null, Q = null, jt = (e) => {
+}, jt = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, X = null, Z = null, Mt = (e) => {
+	X = e;
+}, Nt = (e) => {
 	Z = e;
-}, Mt = (e) => {
-	Q = e;
-}, Nt = async (e) => {
-	let t = Z;
-	t !== null && await t(e);
 }, Pt = async (e) => {
-	let t = Q;
+	let t = X;
+	t !== null && await t(e);
+}, Ft = async (e) => {
+	let t = Z;
 	t !== null && e.changedTables.length !== 0 && await t(e);
-}, Ft = (e) => {
+}, It = (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`);
 	return e;
-}, It = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Lt = (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", $ = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Rt = (e) => $.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), zt = /__dropped_\d{14}$/, Bt = (e) => zt.test(e);
+}, Lt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Rt = (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", Q = /* @__PURE__ */ new Set(["voltro_isr_cache"]), zt = (e) => Q.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), $ = "_voltro_staging_", Bt = (e) => e.startsWith($), Vt = /__dropped_\d{14}$/, Ht = (e) => Vt.test(e);
 //#endregion
-export { R as $, me as $t, at as A, de as At, ct as B, ee as Bt, bt as C, be as Ct, ht as D, ie as Dt, ut as E, he as Et, pt as F, ae as Ft, U as G, re as Gt, Xe as H, ge as Ht, K as I, u as It, Ye as J, ne as Jt, $e as K, ye as Kt, ft as L, pe as Lt, Y as M, i as Mt, yt as N, d as Nt, gt as O, oe as Ot, J as P, ce as Pt, Ge as Q, se as Qt, rt as R, _e as Rt, nt as S, Se as St, dt as T, s as Tt, Qe as U, le as Ut, lt as V, te as Vt, Je as W, f as Wt, qe as X, r as Xt, Ze as Y, fe as Yt, Ke as Z, l as Zt, wt as _, y as _t, Lt as a, M as at, st as b, we as bt, Pt as c, Le as ct, Mt as d, Fe as dt, Ve as et, jt as f, Te as ft, St as g, x as gt, Ct as h, b as ht, It as i, Re as it, et as j, o as jt, ot as k, ue as kt, Nt as l, j as lt, xt as m, De as mt, Rt as n, We as nt, Ft as o, N as ot, Ot as p, Ee as pt, H as q, a as qt, Bt as r, Be as rt, X as s, A as st, $ as t, ze as tt, At as u, k as ut, it as v, S as vt, mt as w, m as wt, tt as x, xe as xt, vt as y, Ce as yt, _t as z, ve as zt };
+export { qe as $, l as $t, _t as A, oe as At, it as B, _e as Bt, nt as C, xe as Ct, ft as D, s as Dt, ht as E, m as Et, bt as F, d as Ft, $e as G, le as Gt, lt as H, ee as Ht, q as I, ce as It, et as J, ye as Jt, Ye as K, f as Kt, mt as L, ae as Lt, ot as M, de as Mt, tt as N, o as Nt, dt as O, he as Ot, J as P, i as Pt, Je as Q, r as Qt, G as R, u as Rt, ct as S, we as St, xt as T, be as Tt, ut as U, te as Ut, vt as V, ve as Vt, Ze as W, ge as Wt, Xe as X, ne as Xt, V as Y, a as Yt, Qe as Z, fe as Zt, wt as _, b as _t, Bt as a, Ve as at, at as b, S as bt, It as c, M as ct, Pt as d, A as dt, se as en, Ke as et, jt as f, O as ft, St as g, De as gt, kt as h, Ee as ht, Ht as i, Ge as it, st as j, ue as jt, gt as k, ie as kt, Y as l, k as lt, Mt as m, Te as mt, $ as n, He as nt, Lt as o, ze as ot, Nt as p, Ie as pt, H as q, re as qt, zt as r, Be as rt, Rt as s, j as st, Q as t, me as tn, L as tt, Ft as u, Re as ut, Ct as v, x as vt, rt as w, Se as wt, yt as x, Ce as xt, Tt as y, y as yt, pt as z, pe as zt };