@voltro/database 0.4.0 → 0.6.0

package/dist/{fileBased-CRXgPJkv.js → fileBased-Cc-F1oFv.js}

@@ -142,7 +142,7 @@ var r = class e {
 	unique: !0,
 	hasDefault: !1,
 	idSchemeInput: e
-}), o = () => i("text"), ee = () => i("integer"), te = () => i("real"), s = (e, t = 0) => {
+}), o = () => i("text"), s = () => i("integer"), ee = () => i("real"), c = (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 r({
@@ -153,7 +153,7 @@ var r = class e {
 		precision: e,
 		scale: t
 	});
-}, ne = s, re = () => i("bigint"), ie = (e, t) => {
+}, te = c, ne = () => i("bigint"), re = (e, t) => {
 	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
 	return {
 		name: e,
@@ -167,7 +167,7 @@ var r = class e {
 			enumValues: t
 		})
 	};
-}, ae = () => i("boolean"), oe = () => i("timestamp"), se = () => i("date"), ce = () => i("json"), c = () => i("bytes"), l = (e, t) => new r({
+}, ie = () => i("boolean"), ae = () => i("timestamp"), oe = () => i("date"), se = () => i("json"), ce = () => i("bytes"), le = (e, t) => new r({
 	type: "reference",
 	nullable: !1,
 	unique: !1,
@@ -177,13 +177,13 @@ var r = class e {
 	refOnUpdate: t?.onUpdate ?? "noAction",
 	fkAutoIndex: t?.index ?? !0,
 	...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
-}), u = () => new r({
+}), l = () => new r({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), d = (e, t) => {
+}), u = (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 r({
 		type: "vector",
@@ -193,7 +193,7 @@ var r = class e {
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, le = (e) => new r({
+}, d = (e) => new r({
 	type: "array",
 	nullable: !1,
 	unique: !1,
@@ -267,29 +267,29 @@ var r = class e {
 		throw Error(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — exceeds the 63-byte limit; ${n}`);
 	}
 	e.length > 60 && h(`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).`);
-}, Se = 1704067200000n, x = 10n, S = 12n, C = (1n << x) - 1n, w = (1n << S) - 1n, T = S, E = 22n, D = () => {
+}, Se = 1704067200000n, Ce = 10n, x = 12n, S = (1n << Ce) - 1n, C = (1n << x) - 1n, w = x, T = 22n, E = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > C) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${C}.`);
+	if (t < 0n || t > S) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${S}.`);
 	return t;
-}, O = () => ({
+}, D = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: D()
-}), k, A = () => (k === void 0 && (k = O()), k), j = () => {
-	k = O();
-}, M = () => BigInt(Date.now()), Ce = (e) => {
-	let t = M();
-	for (; t <= e;) t = M();
+	machineId: E()
+}), O, k = () => (O === void 0 && (O = D()), O), A = () => {
+	O = D();
+}, j = () => BigInt(Date.now()), we = (e) => {
+	let t = j();
+	for (; t <= e;) t = j();
 	return t;
-}, N = () => {
-	let e = A(), t = M();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & w, e.sequence === 0n && (t = Ce(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+}, M = () => {
+	let e = k(), t = j();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & C, e.sequence === 0n && (t = we(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
 	let n = t - Se;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << E | e.machineId << T | e.sequence).toString();
-}, P = (e) => {
+	return (n << T | e.machineId << w | e.sequence).toString();
+}, N = (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: '...' }).`);
@@ -298,10 +298,10 @@ var r = class e {
 		kind: "derived",
 		tableName: e
 	}), n;
-}, F = (e, t) => {
+}, P = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: P(t)
+		prefix: N(t)
 	};
 	if ("prefix" in e && !("scheme" in e)) return b(e.prefix, {
 		kind: "explicit",
@@ -313,7 +313,7 @@ var r = class e {
 	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
 	switch (e.scheme) {
 		case "typeid": {
-			let n = e.prefix ?? P(t);
+			let n = e.prefix ?? N(t);
 			return e.prefix !== void 0 && b(e.prefix, {
 				kind: "explicit",
 				tableName: t
@@ -330,22 +330,22 @@ var r = class e {
 			generate: e.generate
 		};
 	}
-}, we = (n, r) => {
+}, Te = (n, r) => {
 	switch (n.kind) {
 		case "typeid": return e(n.prefix).toString();
 		case "ulid": return t();
 		case "numeric": return null;
-		case "snowflake": return N();
+		case "snowflake": return M();
 		case "custom": return n.generate(r);
 	}
-}, I = (e) => ({
+}, F = (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 }
-}), Te = I, L = (e) => {
+}), Ee = F, I = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -355,7 +355,7 @@ var r = class e {
 	};
 	for (let t of e) r(t);
 	return n;
-}, Ee = (e, ...t) => {
+}, De = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -366,14 +366,14 @@ var r = class e {
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, De = (e = "cosine", t = "float32") => {
+}, Oe = (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`;
 	}
-}, R = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, z = (e, t) => `${e}_${t.join("_")}_idx`, Oe = (e, t) => `${e}_${t.join("_")}_uq`, B = (e, t, n, r, i) => {
+}, L = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, R = (e, t) => `${e}_${t.join("_")}_idx`, ke = (e, t) => `${e}_${t.join("_")}_uq`, z = (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];
@@ -381,14 +381,14 @@ var r = class 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.`);
-}, ke = (e, t) => {
+}, Ae = (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: F(i.idSchemeInput, t)
+		idScheme: P(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, V = (e) => {
+}, B = (e) => {
 	let t = e.appliedPrimaryKey ?? [];
 	return {
 		tableName: e.tableName,
@@ -405,7 +405,7 @@ var r = class e {
 		fullTextIndex: ((t, n, r) => {
 			if (n.length === 0) throw Error(`fullTextIndex '${t}' on '${e.tableName}' has no columns.`);
 			if (y(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
-			return V({
+			return B({
 				tableName: e.tableName,
 				fields: e.fields,
 				isReactive: e.isReactive,
@@ -425,27 +425,27 @@ var r = class e {
 			});
 		}),
 		with: ((...t) => {
-			let n = L(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
+			let n = I(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}': '${R(o)}' and '${R(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}': '${L(o)}' and '${L(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.`);
 				v(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 ?? z(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (y(e.tableName, t, n.name === void 0, n.fields), B(e.tableName, t, n.kind, n.fields, r), a.push({
+				let t = n.name ?? R(e.tableName, n.fields);
+				a.some((e) => e.name === t) || (y(e.tableName, t, n.name === void 0, n.fields), z(e.tableName, t, n.kind, n.fields, r), a.push({
 					name: t,
 					fields: n.fields,
 					...n.kind === void 0 ? {} : { kind: n.kind },
 					...n.kindOptions === void 0 ? {} : { kindOptions: n.kindOptions }
 				}));
 			}
-			return V({
+			return B({
 				tableName: e.tableName,
 				fields: r,
 				isReactive: e.isReactive,
@@ -461,10 +461,10 @@ var r = class e {
 		}),
 		index: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = z(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 = R(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 (y(e.tableName, n, a, o), B(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 V({
+			if (y(e.tableName, n, a, o), z(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 B({
 				tableName: e.tableName,
 				fields: e.fields,
 				isReactive: e.isReactive,
@@ -487,8 +487,8 @@ var r = class e {
 		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 (y(e.tableName, t, !1, i), B(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 V({
+			if (y(e.tableName, t, !1, i), z(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 B({
 				tableName: e.tableName,
 				fields: e.fields,
 				isReactive: e.isReactive,
@@ -510,9 +510,9 @@ var r = class e {
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = Oe(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 = ke(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 (y(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 V({
+			return B({
 				tableName: e.tableName,
 				fields: e.fields,
 				isReactive: e.isReactive,
@@ -532,10 +532,10 @@ var r = class e {
 		}),
 		uniqueActive: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = z(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 = R(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 (y(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 V({
+			return B({
 				tableName: e.tableName,
 				fields: e.fields,
 				isReactive: e.isReactive,
@@ -557,7 +557,7 @@ var r = class e {
 		check: ((t, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
 			if (y(e.tableName, t, !1, []), e.appliedChecks.some((e) => e.name === t)) throw Error(`duplicate CHECK '${t}' on table '${e.tableName}': each constraint name must be unique within a table.`);
-			return V({
+			return B({
 				tableName: e.tableName,
 				fields: e.fields,
 				isReactive: e.isReactive,
@@ -584,7 +584,7 @@ var r = class e {
 			}
 			if (t.length > 0) throw Error(`primaryKey([...]) declared twice on table '${e.tableName}'.`);
 			for (let [t, r] of Object.entries(e.fields)) if (r.type === "id" && !n.includes(t)) throw Error(`primaryKey([...]) on table '${e.tableName}' conflicts with the id() column '${t}'. A composite primary key IS the key — drop the id() column, or include '${t}' in the composite key.`);
-			return V({
+			return B({
 				tableName: e.tableName,
 				fields: e.fields,
 				isReactive: e.isReactive,
@@ -598,7 +598,7 @@ var r = class e {
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
-		reactive: (() => V({
+		reactive: (() => B({
 			tableName: e.tableName,
 			fields: e.fields,
 			isReactive: !0,
@@ -611,7 +611,7 @@ var r = class e {
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validate: ((t) => V({
+		validate: ((t) => B({
 			tableName: e.tableName,
 			fields: e.fields,
 			isReactive: e.isReactive,
@@ -624,7 +624,7 @@ var r = class e {
 			insertSchema: t,
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validatePatch: ((t) => V({
+		validatePatch: ((t) => B({
 			tableName: e.tableName,
 			fields: e.fields,
 			isReactive: e.isReactive,
@@ -638,11 +638,11 @@ var r = class e {
 			validatePatchSchema: n.partial(t)
 		}))
 	};
-}, Ae = (e, t) => {
+}, je = (e, t) => {
 	_(e);
-	let n = ke(f(t), e);
+	let n = Ae(f(t), e);
 	for (let t of Object.keys(n)) v(e, t);
-	return V({
+	return B({
 		tableName: e,
 		fields: n,
 		isReactive: !1,
@@ -652,7 +652,7 @@ var r = class e {
 		appliedFullText: [],
 		appliedChecks: []
 	});
-}, je = (e) => e === "sqlite" || e === "turso", H = (e, t) => {
+}, Me = (e) => e === "sqlite" || e === "turso", V = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e}\``;
@@ -661,51 +661,51 @@ var r = class e {
 		case "sqlite":
 		case "turso": return `"${e}"`;
 	}
-}, U = Symbol.for("@voltro/database/tableRegistry"), W = globalThis, G = W[U] ?? (W[U] = /* @__PURE__ */ new Map()), K = (e) => {
-	let t = G.get(e.tableName);
+}, H = Symbol.for("@voltro/database/tableRegistry"), U = globalThis, W = U[H] ?? (U[H] = /* @__PURE__ */ new Map()), G = (e) => {
+	let t = W.get(e.tableName);
 	if (t === void 0) {
-		G.set(e.tableName, e);
+		W.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.`);
-}, Me = (e) => {
-	G.get(e.tableName) === void 0 && G.set(e.tableName, e);
-}, q = (e) => G.get(e), Ne = (e) => {
-	let t = G.get(e);
+}, Ne = (e) => {
+	W.get(e.tableName) === void 0 && W.set(e.tableName, e);
+}, K = (e) => W.get(e), Pe = (e) => {
+	let t = W.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;
-}, Pe = () => [...G.values()], Fe = () => {
-	G.clear();
-}, Ie = (e) => ({
+}, Fe = () => [...W.values()], Ie = () => {
+	W.clear();
+}, Le = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), Le = (e, t) => ({
+}), Re = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), Re = (e, t) => ({
+}), ze = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), ze = (e, t) => ({
+}), Be = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), Be = (e, t) => ({
+}), Ve = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), Ve = (e, t) => ({
+}), He = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), He = (e, t) => ({
+}), Ue = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), J = (e) => (...t) => {
+}), q = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return Z({
+	return X({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -717,55 +717,55 @@ var r = class e {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, Ue = J("union"), We = J("union-all"), Ge = J("intersect"), Ke = J("except"), Y = (e) => ({ over: (t) => ({
+}, We = q("union"), Ge = q("union-all"), Ke = q("intersect"), qe = q("except"), J = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), qe = (e = "rowNumber") => Y({
+}) }), Je = (e = "rowNumber") => J({
 	op: "window-row-number",
 	alias: e
-}), Je = (e = "rank") => Y({
+}), Ye = (e = "rank") => J({
 	op: "window-rank",
 	alias: e
-}), Ye = (e = "denseRank") => Y({
+}), Xe = (e = "denseRank") => J({
 	op: "window-dense-rank",
 	alias: e
-}), Xe = (e, t = 1, n) => Y({
+}), Ze = (e, t = 1, n) => J({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), Ze = (e, t = 1, n) => Y({
+}), Qe = (e, t = 1, n) => J({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), Qe = (e, t) => Y({
+}), $e = (e, t) => J({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), $e = (e, t) => Y({
+}), et = (e, t) => J({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), X = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? q(e)?.appliedFullText?.find((e) => e.name === t);
+}), Y = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? K(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 }
 	};
-}, Z = (e) => ({
+}, X = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return Z({
+		return X({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return Z({
+		return X({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -774,37 +774,37 @@ var r = class e {
 		});
 	},
 	limit(t) {
-		return Z({
+		return X({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return Z({
+		return X({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return Z({
+		return X({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return Z({
+		return X({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return Z({
+		return X({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	unscoped() {
-		return Z({
+		return X({
 			...e,
 			crossTenant: !0
 		});
@@ -814,13 +814,13 @@ var r = class e {
 			...e.eager ?? {},
 			...t
 		};
-		return Z({
+		return X({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return Z({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -834,15 +834,15 @@ var r = class e {
 			...t,
 			alias: e
 		}));
-		return Z({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = X(e.table, t, e.fullTextIndexes);
-		return Z({
+		let r = Y(e.table, t, e.fullTextIndexes);
+		return X({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -856,7 +856,7 @@ var r = class 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 Z({
+		return X({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -875,7 +875,7 @@ var r = class e {
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return Z({
+			return X({
 				...e,
 				annClause: i
 			});
@@ -887,7 +887,7 @@ var r = class e {
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return Z({
+			return X({
 				...e,
 				annClause: r,
 				take: n
@@ -900,7 +900,7 @@ var r = class e {
 			column: "",
 			distance: "cosine"
 		};
-		return Z({
+		return X({
 			...e,
 			annClause: {
 				...n,
@@ -909,22 +909,22 @@ var r = class e {
 		});
 	},
 	use(t) {
-		return Z({ ...t(e) });
+		return X({ ...t(e) });
 	},
 	distinct() {
-		return Z({
+		return X({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return Z({
+		return X({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return Z({
+		return X({
 			...e,
 			alias: t
 		});
@@ -936,7 +936,7 @@ var r = class e {
 			alias: n,
 			on: r
 		}];
-		return Z({
+		return X({
 			...e,
 			joins: a
 		});
@@ -948,7 +948,7 @@ var r = class e {
 			alias: n,
 			on: r
 		}];
-		return Z({
+		return X({
 			...e,
 			joins: a
 		});
@@ -958,7 +958,7 @@ var r = class e {
 			outputKey: e,
 			source: t
 		}));
-		return Z({
+		return X({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -967,7 +967,7 @@ var r = class e {
 	withCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.withCte: duplicate CTE name '${t}'`);
-		return Z({
+		return X({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -978,7 +978,7 @@ var r = class e {
 	recursiveCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.recursiveCte: duplicate CTE name '${t}'`);
-		return Z({
+		return X({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -989,20 +989,20 @@ var r = class e {
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return Z({
+		return X({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return Z({
+		return X({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return Z({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1013,8 +1013,8 @@ var r = class e {
 		});
 	}
 });
-function Q(e) {
-	return Z({
+function Z(e) {
+	return X({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1025,26 +1025,26 @@ function Q(e) {
 		sourceTable: e
 	});
 }
-var et = (e, t, n) => {
-	let r = [...e.order.filter((e) => e.column !== "id"), {
-		column: "id",
-		direction: "asc"
-	}], i = t === void 0 ? void 0 : {
-		column: "id",
-		op: "gt",
-		value: t
-	}, a = i === void 0 ? e.predicate : e.predicate === void 0 ? i : { and: [e.predicate, i] };
+var tt = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
+	let a = [...e.order.filter((e) => e.column !== t), {
+		column: t,
+		direction: i
+	}], o = n === void 0 ? void 0 : {
+		column: t,
+		op: i === "desc" ? "lt" : "gt",
+		value: n
+	}, s = o === void 0 ? e.predicate : e.predicate === void 0 ? o : { and: [e.predicate, o] };
 	return {
 		...e,
-		predicate: a,
-		order: r,
-		take: n
+		predicate: s,
+		order: a,
+		take: r
 	};
-}, tt = (e) => {
+}, nt = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) K(r), t[n] = Q(r);
+	for (let [n, r] of Object.entries(e)) G(r), t[n] = Z(r);
 	return t;
-}, nt = (e) => e.isView === !0, rt = (e, t, n) => {
+}, rt = (e) => e.isView === !0, it = (e, t, n) => {
 	if (_(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)) v(e, t);
@@ -1054,7 +1054,7 @@ var et = (e, t, n) => {
 		isView: !0,
 		viewSelect: n
 	};
-}, it = (e) => Q({
+}, $ = (e) => Z({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1062,8 +1062,8 @@ var et = (e, t, n) => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), $ = (e, t, n = null) => {
-	let r = n === null ? H(e.tableName, t) : `${H(n, t)}.${H(e.tableName, t)}`, i = e.viewSelect.trim();
+}), at = (e, t, n = null) => {
+	let r = n === null ? V(e.tableName, t) : `${V(n, t)}.${V(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1072,16 +1072,16 @@ var et = (e, t, n) => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, at = /^[A-Za-z_][A-Za-z0-9_]*$/, ot = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : at.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), st = (e) => "{" + e.map((e) => {
+}, ot = /^[A-Za-z_][A-Za-z0-9_]*$/, st = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : ot.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), ct = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", ct = (e, t, n, r = {}) => {
-	let i = H(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", lt = (e, t, n, r = {}) => {
+	let i = V(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${st(t)}'::text[])`;
+		let e = `(${i} #>> '${ct(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = ot(t);
+	let o = st(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1098,10 +1098,10 @@ var et = (e, t, n) => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, lt = (e) => {
+}, ut = (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;
-}, ut = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, dt = (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";
+}, dt = /^\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";
 //#endregion
-export { v as $, We as A, Ae as B, Q as C, ne as Ct, Re as D, o as Dt, qe as E, l as Et, K as F, P as G, Te as H, Ne as I, N as J, we as K, je as L, Fe as M, Me as N, Qe as O, oe as Ot, q as P, be as Q, H as R, et as S, f as St, X as T, te as Tt, I as U, De as V, L as W, ve as X, j as Y, ye as Z, Ge as _, fe as _t, nt as a, me as at, Ve as b, ue as bt, $ as c, le as ct, He as d, c as dt, y as et, Ie as f, se as ft, Ke as g, de as gt, Ye as h, u as ht, ct as i, _e as it, Pe as j, Ue as k, d as kt, ze as l, re as lt, tt as m, s as mt, dt as n, b as nt, it as o, he as ot, Le as p, ie as pt, F as q, lt as r, ge as rt, rt as s, r as st, ut as t, _ as tt, $e as u, ae as ut, Xe as v, a as vt, Je as w, pe as wt, Be as x, ce as xt, Ze as y, ee as yt, Ee as z };
+export { be as $, We as A, u as At, De as B, tt as C, f as Ct, Je as D, le as Dt, Y as E, ee as Et, K as F, I as G, Oe as H, G as I, P as J, N as K, Pe as L, Fe as M, Ie as N, ze as O, o as Ot, Ne as P, ye as Q, Me as R, Q as S, se as St, Ye as T, pe as Tt, Ee as U, je as V, F as W, A as X, M as Y, ve as Z, Ke as _, de as _t, rt as a, _e as at, He as b, s as bt, at as c, r as ct, Ue as d, ie as dt, v as et, Le as f, ce as ft, qe as g, l as gt, Xe as h, c as ht, lt as i, ge as it, Ge as j, $e as k, ae as kt, Be as l, d as lt, nt as m, re as mt, ft as n, _ as nt, $ as o, me as ot, Re as p, oe as pt, Te as q, ut as r, b as rt, it as s, he as st, dt as t, y as tt, et as u, ne as ut, Ze as v, fe as vt, Z as w, te as wt, Ve as x, ue as xt, Qe as y, a as yt, V as z };