@voltro/database 0.11.3 → 0.12.0

package/dist/{fileBased-BrYB2u6E.js → fileBased-DEW2BvnP.js}

@@ -2,7 +2,11 @@ import { typeid as e } from "typeid-js";
 import { ulid as t } from "ulidx";
 import { Schema as n } from "effect";
 //#region src/columns.ts
-var r = class e {
+var r = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) r.serverOnly === !0 && t.push(n);
+	return t;
+}, i = class e {
 	definition;
 	constructor(e) {
 		this.definition = e;
@@ -22,6 +26,12 @@ var r = class e {
 			encrypted: !0
 		});
 	}
+	serverOnly() {
+		return this.rejectIfRaw("serverOnly"), new e({
+			...this.definition,
+			serverOnly: !0
+		});
+	}
 	sensitive(t) {
 		return new e({
 			...this.definition,
@@ -131,21 +141,21 @@ var r = class e {
 	__definition() {
 		return this.definition;
 	}
-}, i = (e) => new r({
+}, a = (e) => new i({
 	type: e,
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1
-}), a = (e) => new r({
+}), o = (e) => new i({
 	type: "id",
 	nullable: !1,
 	unique: !0,
 	hasDefault: !1,
 	idSchemeInput: e
-}), o = () => i("text"), s = () => i("integer"), ee = () => i("real"), c = (e, t = 0) => {
+}), s = () => a("text"), ee = () => a("integer"), te = () => a("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({
+	return new i({
 		type: "decimal",
 		nullable: !1,
 		unique: !1,
@@ -153,12 +163,12 @@ var r = class e {
 		precision: e,
 		scale: t
 	});
-}, te = c, ne = () => i("bigint"), re = (e, t) => {
+}, ne = c, re = () => a("bigint"), ie = (e, t) => {
 	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
 	return {
 		name: e,
 		values: t,
-		column: () => new r({
+		column: () => new i({
 			type: "enum",
 			nullable: !1,
 			unique: !1,
@@ -167,7 +177,7 @@ var r = class e {
 			enumValues: t
 		})
 	};
-}, ie = () => i("boolean"), ae = () => i("timestamp"), oe = () => i("date"), l = () => i("json"), se = () => i("bytes"), ce = (e, t) => new r({
+}, ae = () => a("boolean"), oe = () => a("timestamp"), l = () => a("date"), se = () => a("json"), ce = () => a("bytes"), le = (e, t) => new i({
 	type: "reference",
 	nullable: !1,
 	unique: !1,
@@ -177,15 +187,15 @@ var r = class e {
 	refOnUpdate: t?.onUpdate ?? "noAction",
 	fkAutoIndex: t?.index ?? !0,
 	...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
-}), le = () => new r({
+}), ue = () => new i({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), ue = (e, t) => {
+}), de = (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({
+	return new i({
 		type: "vector",
 		nullable: !1,
 		unique: !1,
@@ -193,13 +203,13 @@ var r = class e {
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, de = (e) => new r({
+}, fe = (e) => new i({
 	type: "array",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	arrayElement: e.__definition().type
-}), fe = () => i("interval"), pe = (e, t = 4326) => new r({
+}), pe = () => a("interval"), me = (e, t = 4326) => new i({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -209,7 +219,7 @@ var r = class e {
 		geomKind: e,
 		srid: t
 	}
-}), me = (e, t = 4326) => new r({
+}), he = (e, t = 4326) => new i({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -219,7 +229,7 @@ var r = class e {
 		geomKind: e,
 		srid: t
 	}
-}), he = (e) => new r({
+}), ge = (e) => new i({
 	type: "raw",
 	nullable: !1,
 	unique: !1,
@@ -229,7 +239,7 @@ var r = class e {
 	let t = {};
 	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
 	return t;
-}, d = /* @__PURE__ */ new Map(), ge = (e, t) => {
+}, d = /* @__PURE__ */ new Map(), _e = (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 = d.get(e) ?? [];
 	for (let r of n) {
@@ -237,26 +247,26 @@ var r = class 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), d.set(e, n);
-}, _e = (e) => d.get(e) ?? [], ve = () => d, f = () => {
+}, ve = (e) => d.get(e) ?? [], ye = () => d, f = () => {
 	d.clear();
-}, ye = 63, p = 60, m = [], h = (e) => {
-	m.includes(e) || m.push(e);
+}, p = 63, m = 60, h = [], g = (e) => {
+	h.includes(e) || h.push(e);
 }, be = () => {
-	let e = m.slice();
-	return m.length = 0, e;
-}, xe = /^[a-zA-Z_][a-zA-Z0-9_]*$/, g = (e, t) => {
+	let e = h.slice();
+	return h.length = 0, e;
+}, xe = /^[a-zA-Z_][a-zA-Z0-9_]*$/, _ = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
 	if (!xe.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_]*$/.`);
-}, _ = (e) => {
-	if (g("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 && h(`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.`);
-}, v = (e, t) => {
-	if (g("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 && h(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
-}, y = (e, t, n, r) => {
-	if (g("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 && h(`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.` : ""}`);
-}, b = (e, t) => {
+}, v = (e) => {
+	if (_("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 && g(`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.`);
+}, y = (e, t) => {
+	if (_("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 && g(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
+}, b = (e, t, n, r) => {
+	if (_("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 && g(`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.` : ""}`);
+}, x = (e, t) => {
 	if (e.length === 0) throw Error(`typeid prefix on table '${t.tableName}' cannot be empty.`);
 	if (!/^[a-z][a-z0-9_]*$/.test(e)) {
 		let n = t.kind === "derived" ? "the derived prefix doesn't match typeid's required shape — supply an explicit one via id({ prefix: '...' })." : "the prefix must match typeid's required shape /^[a-z][a-z0-9_]*$/.";
@@ -266,35 +276,35 @@ var r = class e {
 		let n = t.kind === "derived" ? "shorten the table name, or supply an explicit short prefix via id({ prefix: '...' })." : "pick a shorter prefix.";
 		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, Ce = 10n, x = 12n, S = (1n << Ce) - 1n, C = (1n << x) - 1n, w = x, T = 22n, E = () => {
+	e.length > 60 && g(`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, Ce = 10n, S = 12n, C = (1n << Ce) - 1n, w = (1n << S) - 1n, T = S, E = 22n, D = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > S) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${S}.`);
+	if (t < 0n || t > C) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${C}.`);
 	return t;
-}, D = () => ({
+}, O = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: E()
-}), O, k = () => (O === void 0 && (O = D()), O), A = () => {
-	O = D();
-}, j = () => BigInt(Date.now()), we = (e) => {
+	machineId: D()
+}), k, A = () => (k === void 0 && (k = O()), k), we = () => {
+	k = O();
+}, j = () => BigInt(Date.now()), Te = (e) => {
 	let t = j();
 	for (; t <= e;) t = j();
 	return 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 e = A(), t = j();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & w, e.sequence === 0n && (t = Te(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 << T | e.machineId << w | e.sequence).toString();
+	return (n << E | e.machineId << T | 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: '...' }).`);
 	let n = t.endsWith("ies") && t.length > 3 ? t.slice(0, -3) + "y" : t.endsWith("ses") || t.endsWith("xes") || t.endsWith("zes") || t.endsWith("shes") || t.endsWith("ches") ? t.slice(0, -2) : t.endsWith("s") && t.length > 1 ? t.slice(0, -1) : t;
-	return b(n, {
+	return x(n, {
 		kind: "derived",
 		tableName: e
 	}), n;
@@ -303,7 +313,7 @@ var r = class e {
 		kind: "typeid",
 		prefix: N(t)
 	};
-	if ("prefix" in e && !("scheme" in e)) return b(e.prefix, {
+	if ("prefix" in e && !("scheme" in e)) return x(e.prefix, {
 		kind: "explicit",
 		tableName: t
 	}), {
@@ -314,7 +324,7 @@ var r = class e {
 	switch (e.scheme) {
 		case "typeid": {
 			let n = e.prefix ?? N(t);
-			return e.prefix !== void 0 && b(e.prefix, {
+			return e.prefix !== void 0 && x(e.prefix, {
 				kind: "explicit",
 				tableName: t
 			}), {
@@ -330,7 +340,7 @@ var r = class e {
 			generate: e.generate
 		};
 	}
-}, Te = (n, r) => {
+}, Ee = (n, r) => {
 	switch (n.kind) {
 		case "typeid": return e(n.prefix).toString();
 		case "ulid": return t();
@@ -345,7 +355,7 @@ var r = class e {
 	...e.indexes === void 0 ? {} : { indexes: e.indexes },
 	...e.behaviors === void 0 ? {} : { behaviors: e.behaviors },
 	...e.policies === void 0 ? {} : { policies: e.policies }
-}), Ee = F, I = (e) => {
+}), De = F, I = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -355,7 +365,7 @@ var r = class e {
 	};
 	for (let t of e) r(t);
 	return n;
-}, De = (e, ...t) => {
+}, Oe = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -366,14 +376,14 @@ var r = class e {
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, Oe = (e = "cosine", t = "float32") => {
+}, ke = (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`;
 	}
-}, ke = [
+}, Ae = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -382,7 +392,7 @@ var r = class e {
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], L = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, R = (e, t) => `${e}_${t.join("_")}_idx`, Ae = (e, t) => `${e}_${t.join("_")}_uq`, z = (e, t, n, r, i) => {
+], L = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, R = (e, t) => `${e}_${t.join("_")}_idx`, je = (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];
@@ -390,7 +400,7 @@ 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.`);
-}, je = (e, t) => {
+}, Me = (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,
@@ -413,7 +423,7 @@ var r = class e {
 		...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema },
 		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}'.`);
+			if (b(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
 			return B({
 				tableName: e.tableName,
 				fields: e.fields,
@@ -442,12 +452,12 @@ var r = class e {
 			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}': '${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);
+				y(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 ?? 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({
+				a.some((e) => e.name === t) || (b(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 },
@@ -472,7 +482,7 @@ var r = class e {
 			let n, r, i, a = Array.isArray(t[0]);
 			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), 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.`);
+			if (b(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,
@@ -496,7 +506,7 @@ 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), 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.`);
+			if (b(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,
@@ -519,8 +529,8 @@ var r = class e {
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = Ae(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.`);
+			if (a ? (r = t[0], i = t[1], n = je(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 (b(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 B({
 				tableName: e.tableName,
 				fields: e.fields,
@@ -542,7 +552,7 @@ var r = class e {
 		uniqueActive: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
 			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).`);
+			if (b(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 B({
 				tableName: e.tableName,
@@ -565,7 +575,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.`);
+			if (b(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 B({
 				tableName: e.tableName,
 				fields: e.fields,
@@ -647,10 +657,10 @@ var r = class e {
 			validatePatchSchema: n.partial(t)
 		}))
 	};
-}, Me = (e, t) => {
-	_(e);
-	let n = je(u(t), e);
-	for (let t of Object.keys(n)) v(e, t);
+}, Ne = (e, t) => {
+	v(e);
+	let n = Me(u(t), e);
+	for (let t of Object.keys(n)) y(e, t);
 	return B({
 		tableName: e,
 		fields: n,
@@ -661,7 +671,7 @@ var r = class e {
 		appliedFullText: [],
 		appliedChecks: []
 	});
-}, Ne = (e) => e === "sqlite" || e === "turso", V = (e, t) => {
+}, Pe = (e) => e === "sqlite" || e === "turso", V = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e}\``;
@@ -677,38 +687,38 @@ var r = class 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.`);
-}, K = (e) => {
+}, Fe = (e) => {
 	W.get(e.tableName) === void 0 && W.set(e.tableName, e);
-}, q = (e) => W.get(e), Pe = (e) => {
+}, K = (e) => W.get(e), Ie = (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;
-}, Fe = () => [...W.values()], Ie = () => {
+}, q = () => [...W.values()], Le = () => {
 	W.clear();
-}, Le = (e) => ({
+}, Re = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), Re = (e, t) => ({
+}), ze = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), ze = (e, t) => ({
+}), Be = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), Be = (e, t) => ({
+}), Ve = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), Ve = (e, t) => ({
+}), He = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), He = (e, t) => ({
+}), Ue = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), Ue = (e, t) => ({
+}), We = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
@@ -726,38 +736,38 @@ var r = class e {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, We = J("union"), Ge = J("union-all"), Ke = J("intersect"), qe = J("except"), Y = (e) => ({ over: (t) => ({
+}, Ge = J("union"), Ke = J("union-all"), qe = J("intersect"), Je = J("except"), Y = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), Je = (e = "rowNumber") => Y({
+}) }), Ye = (e = "rowNumber") => Y({
 	op: "window-row-number",
 	alias: e
-}), Ye = (e = "rank") => Y({
+}), Xe = (e = "rank") => Y({
 	op: "window-rank",
 	alias: e
-}), Xe = (e = "denseRank") => Y({
+}), Ze = (e = "denseRank") => Y({
 	op: "window-dense-rank",
 	alias: e
-}), Ze = (e, t = 1, n) => Y({
+}), Qe = (e, t = 1, n) => Y({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), Qe = (e, t = 1, n) => Y({
+}), $e = (e, t = 1, n) => Y({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), $e = (e, t) => Y({
+}), et = (e, t) => Y({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), et = (e, t) => Y({
+}), tt = (e, t) => Y({
 	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);
+	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,
@@ -1034,7 +1044,7 @@ function Q(e) {
 		sourceTable: e
 	});
 }
-var tt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
+var nt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1049,21 +1059,21 @@ var tt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, nt = (e) => {
+}, rt = (e) => {
 	let t = {};
 	for (let [n, r] of Object.entries(e)) G(r), t[n] = Q(r);
 	return t;
-}, 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.`);
+}, it = (e) => e.isView === !0, at = (e, t, n) => {
+	if (v(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
 	let r = u(t);
-	for (let t of Object.keys(r)) v(e, t);
+	for (let t of Object.keys(r)) y(e, t);
 	return {
 		tableName: e,
 		fields: r,
 		isView: !0,
 		viewSelect: n
 	};
-}, at = (e) => Q({
+}, ot = (e) => Q({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1071,7 +1081,7 @@ var tt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), ot = (e, t, n = null) => {
+}), st = (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":
@@ -1081,16 +1091,16 @@ var tt = (e, t, n) => $(e, "id", t, n), $ = (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(""), lt = (e) => "{" + e.map((e) => {
+}, ct = /^[A-Za-z_][A-Za-z0-9_]*$/, lt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : ct.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), ut = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", ut = (e, t, n, r = {}) => {
+}).join(",") + "}", dt = (e, t, n, r = {}) => {
 	let i = V(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${lt(t)}'::text[])`;
+		let e = `(${i} #>> '${ut(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = ct(t);
+	let o = lt(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1107,10 +1117,10 @@ var tt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, dt = (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;
-}, ft = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, pt = (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";
+}, pt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, mt = (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 { p as $, We as A, ae as At, ke as B, tt as C, l as Ct, Je as D, ee as Dt, X as E, he as Et, q as F, F as G, Me as H, G as I, Te as J, I as K, Pe as L, Fe as M, Ie as N, ze as O, ce as Ot, K as P, ye as Q, Ne as R, $ as S, fe as St, Ye as T, te as Tt, Oe as U, De as V, Ee as W, M as X, P as Y, A as Z, Ke as _, le as _t, rt as a, ve as at, He as b, a as bt, ot as c, _e as ct, Ue as d, ne as dt, be as et, Le as f, ie as ft, qe as g, c as gt, Xe as h, re as ht, ut as i, b as it, Ge as j, ue as jt, $e as k, o as kt, Be as l, r as lt, nt as m, oe as mt, pt as n, y as nt, at as o, f as ot, Re as p, se as pt, N as q, dt as r, _ as rt, it as s, ge as st, ft as t, v as tt, et as u, de as ut, Ze as v, pe as vt, Q as w, u as wt, Ve as x, s as xt, Qe as y, me as yt, V as z };
+export { m as $, Ge as A, s as At, Ae as B, nt as C, se as Ct, Ye as D, te as Dt, X as E, ge as Et, K as F, F as G, Ne as H, G as I, Ee as J, I as K, Ie as L, q as M, de as Mt, Le as N, Be as O, le as Ot, Fe as P, p as Q, Pe as R, $ as S, pe as St, Xe as T, ne as Tt, ke as U, Oe as V, De as W, M as X, P as Y, we as Z, qe as _, ue as _t, it as a, ye as at, Ue as b, o as bt, st as c, ve as ct, We as d, re as dt, be as et, Re as f, ae as ft, Je as g, c as gt, Ze as h, ie as ht, dt as i, x as it, Ke as j, oe as jt, et as k, r as kt, Ve as l, i as lt, rt as m, l as mt, mt as n, b as nt, ot as o, f as ot, ze as p, ce as pt, N as q, ft as r, v as rt, at as s, _e as st, pt as t, y as tt, tt as u, fe as ut, Qe as v, me as vt, Q as w, u as wt, He as x, ee as xt, $e as y, he as yt, V as z };