@voltro/database 0.52.0 → 0.53.0

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

@@ -7,6 +7,10 @@ var r = (e) => {
 	for (let [n, r] of Object.entries(e.fields)) r.serverOnly === !0 && t.push(n);
 	return t;
 }, i = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
+	return t;
+}, a = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) {
 		let e = r.readableBy;
@@ -16,11 +20,11 @@ var r = (e) => {
 		});
 	}
 	return t;
-}, a = (e) => {
+}, o = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
 	return t;
-}, o = class e {
+}, s = class e {
 	definition;
 	constructor(e) {
 		this.definition = e;
@@ -41,7 +45,8 @@ var r = (e) => {
 		});
 	}
 	serverOnly() {
-		return this.rejectIfRaw("serverOnly"), new e({
+		if (this.rejectIfRaw("serverOnly"), this.definition.crdtManaged === !0) throw Error("serverOnly() on a CRDT column (crdtText()/crdtDoc()) is a contradiction: clients write CRDT updates and must read the merged state back. Remove serverOnly(), or use a plain bytes() column if only the server touches it.");
+		return new e({
 			...this.definition,
 			serverOnly: !0
 		});
@@ -173,21 +178,21 @@ var r = (e) => {
 	__definition() {
 		return this.definition;
 	}
-}, s = (e) => new o({
+}, c = (e) => new s({
 	type: e,
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1
-}), ee = (e) => new o({
+}), ee = (e) => new s({
 	type: "id",
 	nullable: !1,
 	unique: !0,
 	hasDefault: !1,
 	idSchemeInput: e
-}), c = () => s("text"), te = () => s("integer"), ne = () => s("real"), l = (e, t = 0) => {
+}), l = () => c("text"), te = () => c("integer"), ne = () => c("real"), u = (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 o({
+	return new s({
 		type: "decimal",
 		nullable: !1,
 		unique: !1,
@@ -195,12 +200,12 @@ var r = (e) => {
 		precision: e,
 		scale: t
 	});
-}, re = l, ie = () => s("bigint"), ae = (e, t) => {
+}, re = u, ie = () => c("bigint"), ae = (e, t) => {
 	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
 	return {
 		name: e,
 		values: t,
-		column: () => new o({
+		column: () => new s({
 			type: "enum",
 			nullable: !1,
 			unique: !1,
@@ -209,13 +214,19 @@ var r = (e) => {
 			enumValues: t
 		})
 	};
-}, oe = () => s("boolean"), se = () => s("timestamp"), ce = () => s("date"), le = () => s("json"), ue = () => s("bytes"), u = () => new o({
+}, oe = () => c("boolean"), se = () => c("timestamp"), ce = () => c("date"), le = () => c("json"), ue = () => c("bytes"), d = () => new s({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), d = (e, t) => new o({
+}), de = () => new s({
+	type: "bytes",
+	nullable: !0,
+	unique: !1,
+	hasDefault: !1,
+	crdtManaged: !0
+}), fe = (e, t) => new s({
 	type: "reference",
 	nullable: !1,
 	unique: !1,
@@ -225,15 +236,15 @@ var r = (e) => {
 	refOnUpdate: t?.onUpdate ?? "noAction",
 	fkAutoIndex: t?.index ?? !0,
 	...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
-}), de = () => new o({
+}), pe = () => new s({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), fe = (e, t) => {
+}), me = (e, t) => {
 	if (!Number.isInteger(e) || e <= 0) throw Error(`vector(${String(e)}): dimension must be a positive integer (the embedding length, e.g. vector(1536)).`);
-	return new o({
+	return new s({
 		type: "vector",
 		nullable: !1,
 		unique: !1,
@@ -241,13 +252,13 @@ var r = (e) => {
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, pe = (e) => new o({
+}, he = (e) => new s({
 	type: "array",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	arrayElement: e.__definition().type
-}), me = () => s("interval"), he = (e, t = 4326) => new o({
+}), ge = () => c("interval"), _e = (e, t = 4326) => new s({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -257,7 +268,7 @@ var r = (e) => {
 		geomKind: e,
 		srid: t
 	}
-}), ge = (e, t = 4326) => new o({
+}), ve = (e, t = 4326) => new s({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -267,7 +278,7 @@ var r = (e) => {
 		geomKind: e,
 		srid: t
 	}
-}), _e = (e) => new o({
+}), ye = (e) => new s({
 	type: "raw",
 	nullable: !1,
 	unique: !1,
@@ -277,14 +288,14 @@ var r = (e) => {
 	let t = {};
 	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
 	return t;
-}, p = /* @__PURE__ */ new WeakMap(), m = (e) => typeof e == "object" && e ? p.get(e) : void 0, ve = (e, t = {}) => {
-	let n = c();
+}, p = /* @__PURE__ */ new WeakMap(), m = (e) => typeof e == "object" && e ? p.get(e) : void 0, be = (e, t = {}) => {
+	let n = l();
 	return p.set(n, {
 		target: e,
 		orphanPolicy: t.orphanPolicy ?? "keep",
 		onSoftDelete: t.onSoftDelete ?? !1
 	}), n;
-}, h = /* @__PURE__ */ new Map(), ye = (e, t) => {
+}, h = /* @__PURE__ */ new Map(), xe = (e, t) => {
 	if (t.from === t.to) throw Error(`declareEnumRename('${e}'): \`from\` and \`to\` are both '${t.from}' — a rename must change the value.`);
 	let n = h.get(e) ?? [];
 	for (let r of n) {
@@ -292,16 +303,16 @@ var r = (e) => {
 		if (r.from === t.from && r.to !== t.to) throw Error(`declareEnumRename('${e}'): value '${t.from}' is already declared as renamed to '${r.to}', cannot also rename it to '${t.to}'.`);
 	}
 	n.push(t), h.set(e, n);
-}, be = (e) => h.get(e) ?? [], xe = () => h, Se = () => {
+}, Se = (e) => h.get(e) ?? [], Ce = () => h, we = () => {
 	h.clear();
-}, Ce = 63, we = 60, g = [], _ = (e) => {
+}, Te = 63, Ee = 60, g = [], _ = (e) => {
 	g.includes(e) || g.push(e);
-}, Te = () => {
+}, De = () => {
 	let e = g.slice();
 	return g.length = 0, e;
-}, Ee = /^[a-zA-Z_][a-zA-Z0-9_]*$/, v = (e, t) => {
+}, Oe = /^[a-zA-Z_][a-zA-Z0-9_]*$/, v = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!Ee.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 (!Oe.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_]*$/.`);
 }, y = (e) => {
 	if (v("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 && _(`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.`);
@@ -322,28 +333,28 @@ 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).`);
-}, De = 1704067200000n, Oe = 10n, C = 12n, w = (1n << Oe) - 1n, T = (1n << C) - 1n, ke = C, Ae = 22n, je = () => {
+}, ke = 1704067200000n, C = 10n, w = 12n, T = (1n << C) - 1n, Ae = (1n << w) - 1n, je = w, Me = 22n, Ne = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > w) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${w}.`);
+	if (t < 0n || t > T) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${T}.`);
 	return t;
 }, E = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: je()
-}), D, Me = () => (D === void 0 && (D = E()), D), Ne = () => {
+	machineId: Ne()
+}), D, Pe = () => (D === void 0 && (D = E()), D), Fe = () => {
 	D = E();
-}, O = () => BigInt(Date.now()), Pe = (e) => {
+}, O = () => BigInt(Date.now()), Ie = (e) => {
 	let t = O();
 	for (; t <= e;) t = O();
 	return t;
 }, k = () => {
-	let e = Me(), t = O();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & T, e.sequence === 0n && (t = Pe(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - De;
+	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);
+	let n = t - ke;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Ae | e.machineId << ke | e.sequence).toString();
+	return (n << Me | e.machineId << je | e.sequence).toString();
 }, A = (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.`);
@@ -385,7 +396,7 @@ var r = (e) => {
 			generate: e.generate
 		};
 	}
-}, Fe = (e, r) => {
+}, Le = (e, r) => {
 	switch (e.kind) {
 		case "typeid": return t(e.prefix).toString();
 		case "ulid": return n();
@@ -400,7 +411,7 @@ var r = (e) => {
 	...e.indexes === void 0 ? {} : { indexes: e.indexes },
 	...e.behaviors === void 0 ? {} : { behaviors: e.behaviors },
 	...e.policies === void 0 ? {} : { policies: e.policies }
-}), Ie = M, N = (e) => {
+}), Re = M, N = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -410,7 +421,7 @@ var r = (e) => {
 	};
 	for (let t of e) r(t);
 	return n;
-}, Le = (e, ...t) => {
+}, ze = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -421,14 +432,14 @@ var r = (e) => {
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, Re = (e = "cosine", t = "float32") => {
+}, Be = (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`;
 	}
-}, ze = [
+}, Ve = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -437,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`, Be = (e, t) => `${e}_${t.join("_")}_uq`, I = (e, t, n, r, i) => {
+], 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) => {
 	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];
@@ -445,7 +456,7 @@ 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.`);
-}, Ve = (e, t) => {
+}, Ue = (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,
@@ -581,7 +592,7 @@ var r = (e) => {
 		}),
 		unique: ((...e) => {
 			let n, r, i, a = Array.isArray(e[0]);
-			if (a ? (r = e[0], i = e[1], n = Be(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 = 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 (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({
 				...t,
@@ -736,7 +747,7 @@ var r = (e) => {
 			validatePatchSchema: e.partial(n)
 		}))
 	};
-}, R = (e, t) => {
+}, We = (e, t) => {
 	y(e);
 	let n = Object.entries(t).flatMap(([e, t]) => {
 		let n = m(t);
@@ -744,7 +755,7 @@ var r = (e) => {
 			column: e,
 			...n
 		}];
-	}), r = Ve(f(t), e);
+	}), r = Ue(f(t), e);
 	for (let t of Object.keys(r)) b(e, t);
 	return L({
 		appliedPluginRefs: n,
@@ -758,7 +769,7 @@ var r = (e) => {
 		appliedChecks: [],
 		appliedRules: []
 	});
-}, He = (e) => e === "sqlite" || e === "turso", Ue = (e) => e === "mysql" || e === "mariadb", z = (e, t) => {
+}, Ge = (e) => e === "sqlite" || e === "turso", Ke = (e) => e === "mysql" || e === "mariadb", R = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e}\``;
@@ -767,51 +778,51 @@ var r = (e) => {
 		case "sqlite":
 		case "turso": return `"${e}"`;
 	}
-}, We = 1e4, B = Symbol.for("@voltro/database/tableRegistry"), V = globalThis, H = V[B] ?? (V[B] = /* @__PURE__ */ new Map()), U = (e) => {
-	let t = H.get(e.tableName);
+}, 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);
 	if (t === void 0) {
-		H.set(e.tableName, e);
+		V.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.`);
-}, Ge = (e) => {
-	H.get(e.tableName) === void 0 && H.set(e.tableName, e);
-}, W = (e) => H.get(e), Ke = (e) => {
-	let t = H.get(e);
+}, 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);
 	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;
-}, qe = () => [...H.values()], Je = (e) => H.delete(e), Ye = () => {
-	H.clear();
-}, Xe = (e) => H.get(e)?.isReactive !== !1, Ze = (e) => e.order ?? [], Qe = (e) => ({
+}, Xe = () => [...V.values()], Ze = (e) => V.delete(e), Qe = () => {
+	V.clear();
+}, $e = (e) => V.get(e)?.isReactive !== !1, et = (e) => e.order ?? [], tt = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), $e = (e, t) => ({
+}), nt = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), et = (e, t) => ({
+}), rt = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), tt = (e, t) => ({
+}), it = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), nt = (e, t) => ({
+}), at = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), rt = (e, t) => ({
+}), ot = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), it = (e, t) => ({
+}), st = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), G = (e) => (...t) => {
+}), W = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return J({
+	return q({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -823,55 +834,55 @@ var r = (e) => {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, at = G("union"), ot = G("union-all"), st = G("intersect"), ct = G("except"), K = (e) => ({ over: (t) => ({
+}, ct = W("union"), lt = W("union-all"), ut = W("intersect"), dt = W("except"), G = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), lt = (e = "rowNumber") => K({
+}) }), ft = (e = "rowNumber") => G({
 	op: "window-row-number",
 	alias: e
-}), ut = (e = "rank") => K({
+}), pt = (e = "rank") => G({
 	op: "window-rank",
 	alias: e
-}), dt = (e = "denseRank") => K({
+}), mt = (e = "denseRank") => G({
 	op: "window-dense-rank",
 	alias: e
-}), ft = (e, t = 1, n) => K({
+}), ht = (e, t = 1, n) => G({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), pt = (e, t = 1, n) => K({
+}), gt = (e, t = 1, n) => G({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), mt = (e, t) => K({
+}), _t = (e, t) => G({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), ht = (e, t) => K({
+}), vt = (e, t) => G({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), q = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? W(e)?.appliedFullText?.find((e) => e.name === t);
+}), K = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? U(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 }
 	};
-}, J = (e) => ({
+}, q = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return J({
+		return q({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return J({
+		return q({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -880,37 +891,37 @@ var r = (e) => {
 		});
 	},
 	limit(t) {
-		return J({
+		return q({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return J({
+		return q({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return J({
+		return q({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return J({
+		return q({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return J({
+		return q({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	unscoped() {
-		return J({
+		return q({
 			...e,
 			crossTenant: !0
 		});
@@ -920,13 +931,13 @@ var r = (e) => {
 			...e.eager ?? {},
 			...t
 		};
-		return J({
+		return q({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return J({
+		return q({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -940,15 +951,15 @@ var r = (e) => {
 			...t,
 			alias: e
 		}));
-		return J({
+		return q({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = q(e.table, t, e.fullTextIndexes);
-		return J({
+		let r = K(e.table, t, e.fullTextIndexes);
+		return q({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -962,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 J({
+		return q({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -981,7 +992,7 @@ var r = (e) => {
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return J({
+			return q({
 				...e,
 				annClause: i
 			});
@@ -993,7 +1004,7 @@ var r = (e) => {
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return J({
+			return q({
 				...e,
 				annClause: r,
 				take: n
@@ -1006,7 +1017,7 @@ var r = (e) => {
 			column: "",
 			distance: "cosine"
 		};
-		return J({
+		return q({
 			...e,
 			annClause: {
 				...n,
@@ -1015,22 +1026,22 @@ var r = (e) => {
 		});
 	},
 	use(t) {
-		return J({ ...t(e) });
+		return q({ ...t(e) });
 	},
 	distinct() {
-		return J({
+		return q({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return J({
+		return q({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return J({
+		return q({
 			...e,
 			alias: t
 		});
@@ -1042,7 +1053,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return J({
+		return q({
 			...e,
 			joins: a
 		});
@@ -1054,7 +1065,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return J({
+		return q({
 			...e,
 			joins: a
 		});
@@ -1064,7 +1075,7 @@ var r = (e) => {
 			outputKey: e,
 			source: t
 		}));
-		return J({
+		return q({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1073,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 J({
+		return q({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1084,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 J({
+		return q({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1095,20 +1106,20 @@ var r = (e) => {
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return J({
+		return q({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return J({
+		return q({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return J({
+		return q({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1119,8 +1130,8 @@ var r = (e) => {
 		});
 	}
 });
-function Y(e) {
-	return J({
+function J(e) {
+	return q({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1131,7 +1142,7 @@ function Y(e) {
 		sourceTable: e
 	});
 }
-var gt = (e, t, n) => X(e, "id", t, n), X = (e, t, n, r, i = "asc") => {
+var yt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1146,11 +1157,11 @@ var gt = (e, t, n) => X(e, "id", t, n), X = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, _t = (e) => {
+}, bt = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) U(r), t[n] = Y(r);
+	for (let [n, r] of Object.entries(e)) H(r), t[n] = J(r);
 	return t;
-}, vt = (e) => e.isView === !0, yt = (e, t, n) => {
+}, xt = (e) => e.isView === !0, St = (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);
@@ -1160,7 +1171,7 @@ var gt = (e, t, n) => X(e, "id", t, n), X = (e, t, n, r, i = "asc") => {
 		isView: !0,
 		viewSelect: n
 	};
-}, bt = (e) => Y({
+}, Ct = (e) => J({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1168,8 +1179,8 @@ var gt = (e, t, n) => X(e, "id", t, n), X = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), xt = (e, t, n = null) => {
-	let r = n === null ? z(e.tableName, t) : `${z(n, t)}.${z(e.tableName, t)}`, i = e.viewSelect.trim();
+}), wt = (e, t, n = null) => {
+	let r = n === null ? R(e.tableName, t) : `${R(n, t)}.${R(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1178,16 +1189,16 @@ var gt = (e, t, n) => X(e, "id", t, n), X = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, St = /^[A-Za-z_][A-Za-z0-9_]*$/, Ct = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : St.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), wt = (e) => "{" + e.map((e) => {
+}, 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) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", Tt = (e, t, n, r = {}) => {
-	let i = z(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", Ot = (e, t, n, r = {}) => {
+	let i = R(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${wt(t)}'::text[])`;
+		let e = `(${i} #>> '${Dt(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = Ct(t);
+	let o = Et(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1204,13 +1215,13 @@ var gt = (e, t, n) => X(e, "id", t, n), X = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, Et = (e, t) => ({
+}, kt = (e, t) => ({
 	name: e,
 	body: t
-}), Dt = (e) => {
+}), X = (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: Et });
+	let t = e.steps({ step: kt });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -1223,20 +1234,20 @@ var gt = (e, t, n) => X(e, "id", t, n), X = (e, t, n, r, i = "asc") => {
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, Ot = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Z = null, Q = null, kt = (e) => {
+}, At = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Z = null, Q = null, jt = (e) => {
 	Z = e;
-}, At = (e) => {
+}, Mt = (e) => {
 	Q = e;
-}, jt = async (e) => {
+}, Nt = async (e) => {
 	let t = Z;
 	t !== null && await t(e);
-}, Mt = async (e) => {
+}, Pt = async (e) => {
 	let t = Q;
 	t !== null && e.changedTables.length !== 0 && await t(e);
-}, Nt = (e) => {
+}, Ft = (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;
-}, Pt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Ft = (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"]), It = (e) => $.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), Lt = /__dropped_\d{14}$/, Rt = (e) => Lt.test(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);
 //#endregion
-export { z as $, nt as A, a as At, at as B, me as Bt, _t as C, ve as Ct, ft as D, ie as Dt, st as E, pe as Et, ut as F, de as Ft, W as G, i as Gt, qe as H, f as Ht, q as I, he as It, Ke as J, r as Jt, Xe as K, ne as Kt, lt as L, ge as Lt, X as M, ce as Mt, gt as N, ae as Nt, pt as O, oe as Ot, Y as P, l as Pt, He as Q, et as R, ee as Rt, $e as S, be as St, ct as T, o as Tt, Ye as U, re as Ut, ot as V, le as Vt, Ge as W, _e as Wt, We as X, se as Xt, Je as Y, c as Yt, Ue as Z, fe as Zt, xt as _, y as _t, Ft as a, M as at, it as b, Se as bt, Mt as c, Fe as ct, At as d, Ne as dt, ze as et, kt as f, Ce as ft, yt as g, x as gt, bt as h, b as ht, Pt as i, Ie as it, Ze as j, u as jt, rt as k, ue as kt, jt as l, j as lt, vt as m, Te as mt, It as n, R as nt, Nt as o, N as ot, Tt as p, we as pt, U as q, d as qt, Rt as r, Re as rt, Dt as s, A as st, $ as t, Le as tt, Ot as u, k as ut, tt as v, S as vt, dt as w, m as wt, Qe as x, ye as xt, ht as y, xe as yt, mt as z, te as zt };
+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 };