@voltro/database 0.73.0 → 0.75.0

package/dist/{frameworkLiveTables-C1WjQ_uI.js → frameworkTables-CfWuWeFG.js}

@@ -1,16 +1,16 @@
-import { Effect as e, Schema as t } from "effect";
-import { typeid as n } from "typeid-js";
-import { ulid as r } from "ulidx";
+import { Cause as e, Effect as t, Runtime as n, Schema as r } from "effect";
+import { typeid as i } from "typeid-js";
+import { ulid as a } from "ulidx";
 //#region src/columns.ts
-var i = (e) => {
+var o = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) r.serverOnly === !0 && t.push(n);
 	return t;
-}, a = (e) => {
+}, s = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
 	return t;
-}, o = (e) => {
+}, c = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) {
 		let e = r.readableBy;
@@ -20,11 +20,11 @@ var i = (e) => {
 		});
 	}
 	return t;
-}, s = (e) => {
+}, ee = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
 	return t;
-}, c = class e {
+}, l = class e {
 	definition;
 	constructor(e) {
 		this.definition = e;
@@ -185,14 +185,14 @@ var i = (e) => {
 	__definition() {
 		return this.definition;
 	}
-}, l = (e) => new c({
+}, u = (e) => new l({
 	type: e,
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1
 });
-function ee(e) {
-	return new c({
+function d(e) {
+	return new l({
 		type: "id",
 		nullable: !1,
 		unique: !0,
@@ -200,10 +200,10 @@ function ee(e) {
 		idSchemeInput: e
 	});
 }
-var u = () => l("text"), te = () => l("integer"), ne = () => l("real"), re = (e, t = 0) => {
+var f = () => u("text"), p = () => u("integer"), te = () => u("real"), ne = (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 c({
+	return new l({
 		type: "decimal",
 		nullable: !1,
 		unique: !1,
@@ -211,12 +211,12 @@ var u = () => l("text"), te = () => l("integer"), ne = () => l("real"), re = (e,
 		precision: e,
 		scale: t
 	});
-}, ie = re, ae = () => l("bigint"), oe = (e, t) => {
+}, re = ne, ie = () => u("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 c({
+		column: () => new l({
 			type: "enum",
 			nullable: !1,
 			unique: !1,
@@ -225,26 +225,26 @@ var u = () => l("text"), te = () => l("integer"), ne = () => l("real"), re = (e,
 			enumValues: t
 		})
 	};
-}, se = () => l("boolean"), ce = () => l("timestamp"), le = () => l("date"), ue = () => l("json"), de = () => l("bytes"), fe = () => new c({
+}, oe = () => u("boolean"), m = () => u("timestamp"), se = () => u("date"), h = () => u("json"), ce = () => u("bytes"), le = () => new l({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), pe = () => new c({
+}), ue = () => new l({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), d = () => {
+}), g = () => {
 	throw Error("selfReference(): the target is resolved by table() — a column built with selfReference() must be declared inside a table({ … }) literal, not read before the table exists");
 };
-function me(e) {
-	return he(d, e);
+function de(e) {
+	return fe(g, e);
 }
-function he(e, t) {
-	return new c({
+function fe(e, t) {
+	return new l({
 		type: "reference",
 		nullable: !1,
 		unique: !1,
@@ -259,15 +259,15 @@ function he(e, t) {
 		...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
 	});
 }
-var ge = () => new c({
+var pe = () => new l({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), _e = (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 c({
+	return new l({
 		type: "vector",
 		nullable: !1,
 		unique: !1,
@@ -275,13 +275,13 @@ var ge = () => new c({
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, ve = (e) => new c({
+}, he = (e) => new l({
 	type: "array",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	arrayElement: e.__definition().type
-}), ye = () => l("interval"), be = (e, t = 4326) => new c({
+}), ge = () => u("interval"), _e = (e, t = 4326) => new l({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -291,7 +291,7 @@ var ge = () => new c({
 		geomKind: e,
 		srid: t
 	}
-}), xe = (e, t = 4326) => new c({
+}), ve = (e, t = 4326) => new l({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -301,51 +301,234 @@ var ge = () => new c({
 		geomKind: e,
 		srid: t
 	}
-}), Se = (e) => new c({
+}), ye = (e) => new l({
 	type: "raw",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	rawDdl: e
-}), f = (e) => {
+}), _ = (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, Ce = (e, t = {}) => {
-	let n = u();
-	return p.set(n, {
+}, be = /* @__PURE__ */ new WeakMap(), xe = (e) => typeof e == "object" && e ? be.get(e) : void 0, Se = (e, t = {}) => {
+	let n = f();
+	return be.set(n, {
 		target: e,
 		orphanPolicy: t.orphanPolicy ?? "keep",
 		onSoftDelete: t.onSoftDelete ?? !1
 	}), n;
-}, h = /* @__PURE__ */ new Map(), we = (e, t) => {
+}, v = /* @__PURE__ */ new Map(), Ce = (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) ?? [];
+	let n = v.get(e) ?? [];
 	for (let r of n) {
 		if (r.from === t.from && r.to === t.to) return;
 		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);
-}, Te = (e) => h.get(e) ?? [], Ee = () => h, De = () => {
-	h.clear();
-}, Oe = 63, ke = 60, g = [], _ = (e) => {
-	g.includes(e) || g.push(e);
-}, Ae = () => {
-	let e = g.slice();
-	return g.length = 0, e;
-}, je = /^[a-zA-Z_][a-zA-Z0-9_]*$/, v = (e, t) => {
+	n.push(t), v.set(e, n);
+}, we = (e) => v.get(e) ?? [], Te = () => v, Ee = () => {
+	v.clear();
+}, De = (t) => {
+	let r = t;
+	for (let t = 0; t < 4 && n.isFiberFailure(r); t++) r = e.squash(r[n.FiberFailureCauseId]);
+	return r;
+}, y = (t, r = 0) => {
+	if (r >= 4 || !n.isFiberFailure(t)) return [t];
+	let i = t[n.FiberFailureCauseId], a = [...e.failures(i), ...e.defects(i)];
+	if (a.length === 0) return [e.squash(i)];
+	let o = [];
+	for (let e of a.slice(0, 8)) o.push(...y(e, r + 1));
+	return o;
+}, Oe = (e) => e.dbCode !== void 0 || e.dbErrno !== void 0 || e.dbNumber !== void 0 || e.dbSqlState !== void 0 || e.dbConstraint !== void 0, ke = (e) => {
+	let t = {}, n = [], r = De(e);
+	for (let e = 0; e < 8 && typeof r == "object" && r; e++) {
+		let e = r;
+		t.dbCode === void 0 && (typeof e.code == "string" || typeof e.code == "number") && (t.dbCode = e.code), t.dbErrno === void 0 && typeof e.errno == "number" && (t.dbErrno = e.errno), t.dbNumber === void 0 && typeof e.number == "number" && (t.dbNumber = e.number), t.dbSqlState === void 0 && typeof e.sqlState == "string" && (t.dbSqlState = e.sqlState), t.dbBindings === void 0 && typeof e.voltroBindings == "string" && (t.dbBindings = e.voltroBindings), t.dbStatement === void 0 && typeof e.sql == "string" && e.sql.includes("?") && (t.dbStatement = e.sql, t.dbPlaceholders = (e.sql.match(/\?/g) ?? []).length), t.dbFatal === void 0 && typeof e.fatal == "boolean" && (t.dbFatal = e.fatal), t.dbConstraint === void 0 && typeof e.constraint == "string" && (t.dbConstraint = e.constraint), t.dbTable === void 0 && typeof e.table == "string" && (t.dbTable = e.table), t.dbColumn === void 0 && typeof e.column == "string" && (t.dbColumn = e.column), t.dbSchema === void 0 && typeof e.schema == "string" && (t.dbSchema = e.schema);
+		let i = e.sqlMessage ?? e.detail;
+		t.dbMessage === void 0 && typeof i == "string" && (t.dbMessage = i);
+		let a = typeof e.constructor == "function" ? e.constructor.name : void 0, o = typeof e._tag == "string" && e._tag || typeof e.name == "string" && e.name || (typeof a == "string" && a !== "Object" ? a : void 0), s = typeof e.message == "string" ? e.message : void 0;
+		(o || s) && n.push(`${o || "Error"}${s ? `: ${s.slice(0, 200)}` : ""}`), r = De(e.cause);
+	}
+	return n.length > 0 && (t.dbCauseChain = n.join(" ← "), t.dbMessage === void 0 && (t.dbMessage = n[n.length - 1])), t;
+}, b = (e) => {
+	let t = y(e).map(ke);
+	if (t.length <= 1) return t[0] ?? {};
+	let n = t.find(Oe) ?? t[0], r = t.filter((e) => e !== n).map((e) => e.dbCauseChain).filter((e) => typeof e == "string");
+	if (r.length === 0) return n;
+	let i = typeof n.dbCauseChain == "string" ? n.dbCauseChain : void 0;
+	return {
+		...n,
+		dbCauseChain: [i, ...r].filter(Boolean).join(" ‖ ")
+	};
+}, Ae = (e, t) => {
+	let n = b(e), r = w(n, t);
+	if (r !== void 0) {
+		let e = r.constraint ?? r.column;
+		return e === void 0 ? r.kind : `${r.kind}: ${e}`;
+	}
+	let i = n.dbCode ?? n.dbSqlState ?? n.dbErrno ?? n.dbNumber, a = Ne(e);
+	return i !== void 0 && je.test(String(i)) ? `${a} (${String(i)})` : a;
+}, je = /^[A-Za-z0-9_]{1,32}$/, Me = /^[A-Za-z_][A-Za-z0-9_]{0,63}$/, Ne = (e) => {
+	let t = e?._tag, n = e?.name, r = (typeof t == "string" ? t : typeof n == "string" ? n : "").split(/[^A-Za-z0-9_]+/).filter(Boolean).pop();
+	return r !== void 0 && Me.test(r) ? r : "unknown";
+}, Pe = /^[A-Za-z_][A-Za-z0-9_$]*$/, x = (e) => e !== void 0 && e.length <= 128 && Pe.test(e) ? e : void 0, S = (e) => e === void 0 ? void 0 : e.split(".").pop() ?? e, C = (e, ...t) => {
+	for (let n of t) {
+		let t = n.exec(e);
+		if (t?.[1] !== void 0) return t[1];
+	}
+}, w = (e, t) => {
+	let n = e.dbCode, r = e.dbErrno, i = e.dbNumber, a = typeof e.dbMessage == "string" ? e.dbMessage : "", o = `${typeof e.dbCauseChain == "string" ? e.dbCauseChain : ""} ${a}`;
+	if (n === "23503") {
+		let t = x(e.dbConstraint);
+		return {
+			kind: /is still referenced from table/i.test(o) ? "foreignKeyInUse" : "foreignKey",
+			...t === void 0 ? {} : { constraint: t }
+		};
+	}
+	if (n === "23505") {
+		let t = x(e.dbConstraint);
+		return {
+			kind: "unique",
+			...t === void 0 ? {} : { constraint: t }
+		};
+	}
+	if (n === "23502") {
+		let t = x(e.dbColumn);
+		return {
+			kind: "notNull",
+			...t === void 0 ? {} : { column: t }
+		};
+	}
+	if (n === "23514") {
+		let t = x(e.dbConstraint);
+		return {
+			kind: "check",
+			...t === void 0 ? {} : { constraint: t }
+		};
+	}
+	if (r === 1452 || r === 1451) {
+		let e = x(C(o, /CONSTRAINT `([^`]+)`/));
+		return {
+			kind: r === 1451 ? "foreignKeyInUse" : "foreignKey",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+	if (r === 1062) {
+		let e = x(S(C(o, /for key '([^']+)'/)));
+		return {
+			kind: "unique",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+	if (r === 1048 || r === 1364) {
+		let e = x(C(o, /Column '([^']+)' cannot be null/, /Field '([^']+)' doesn't have a default value/));
+		return {
+			kind: "notNull",
+			...e === void 0 ? {} : { column: e }
+		};
+	}
+	if (r === 3819 || r === 4025) {
+		let e = x(C(o, /Check constraint '([^']+)'/, /CONSTRAINT `([^`]+)` failed/));
+		return {
+			kind: "check",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+	if (i === 547) {
+		let e = C(o, /(?:FOREIGN KEY|REFERENCE) constraint "([^"]+)"/), t = C(o, /CHECK constraint "([^"]+)"/);
+		if (t !== void 0 && e === void 0) {
+			let e = x(t);
+			return {
+				kind: "check",
+				...e === void 0 ? {} : { constraint: e }
+			};
+		}
+		let n = /REFERENCE constraint/.test(o), r = x(e);
+		return {
+			kind: n ? "foreignKeyInUse" : "foreignKey",
+			...r === void 0 ? {} : { constraint: r }
+		};
+	}
+	if (i === 2627 || i === 2601) {
+		let e = x(C(o, /(?:UNIQUE KEY|PRIMARY KEY) constraint '([^']+)'/, /index '([^']+)'/));
+		return {
+			kind: "unique",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+	if (i === 515) {
+		let e = x(C(o, /Cannot insert the value NULL into column '([^']+)'/));
+		return {
+			kind: "notNull",
+			...e === void 0 ? {} : { column: e }
+		};
+	}
+	if (n === "SQLITE_CONSTRAINT_FOREIGNKEY") return { kind: t === "delete" || t === "deleteMany" || t === "hardDelete" ? "foreignKeyInUse" : "foreignKey" };
+	if (n === "SQLITE_CONSTRAINT_UNIQUE" || n === "SQLITE_CONSTRAINT_PRIMARYKEY") {
+		let e = x(S(C(o, /UNIQUE constraint failed: ([^,\s]+)/)));
+		return {
+			kind: "unique",
+			...e === void 0 ? {} : { column: e }
+		};
+	}
+	if (n === "SQLITE_CONSTRAINT_NOTNULL") {
+		let e = x(S(C(o, /NOT NULL constraint failed: ([^,\s]+)/)));
+		return {
+			kind: "notNull",
+			...e === void 0 ? {} : { column: e }
+		};
+	}
+	if (n === "SQLITE_CONSTRAINT_CHECK") {
+		let e = x(C(a, /CHECK constraint failed: (.+)$/));
+		return {
+			kind: "check",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+}, Fe = (e) => {
+	let t = w(e)?.kind;
+	return t === "foreignKey" || t === "foreignKeyInUse";
+}, Ie = (e) => {
+	let t = e.dbCode, n = e.dbErrno;
+	return t === "57014" || n === 3024 || n === 1969 || t === "ETIMEOUT" || t === "SQLITE_INTERRUPT";
+}, Le = (e) => {
+	let t = b(e), n = [
+		t.dbCode === void 0 ? void 0 : `code=${String(t.dbCode)}`,
+		t.dbErrno === void 0 ? void 0 : `errno=${String(t.dbErrno)}`,
+		t.dbNumber === void 0 ? void 0 : `number=${String(t.dbNumber)}`,
+		t.dbSqlState === void 0 ? void 0 : `sqlState=${String(t.dbSqlState)}`,
+		t.dbConstraint === void 0 ? void 0 : `constraint=${String(t.dbConstraint)}`,
+		t.dbPlaceholders === void 0 ? void 0 : `placeholders=${String(t.dbPlaceholders)}`
+	].filter((e) => e !== void 0), r = typeof e?.message == "string" ? e.message : void 0, i = typeof t.dbMessage == "string" ? t.dbMessage : void 0, a = i === void 0 ? void 0 : n.length > 0 || i !== r && i !== `Error: ${String(r)}` ? i : void 0, o = typeof t.dbBindings == "string" ? `\n  bindings:  ${t.dbBindings}` : "", s = typeof t.dbStatement == "string" ? `\n  statement: ${t.dbStatement.length <= 400 ? t.dbStatement : `${t.dbStatement.slice(0, 400)}…`}` : "";
+	if (a !== void 0 || n.length !== 0) return [a, n.length > 0 ? `[${n.join(" ")}]` : void 0].filter((e) => e !== void 0 && e !== "").join(" ") + s + o;
+}, Re = (e) => Object.entries(e).map(([e, t]) => `${e}:${ze(t)}`).join(" "), ze = (e) => {
+	if (e === null) return "null";
+	if (e === void 0) return "undefined";
+	if (typeof e == "bigint") return "bigint";
+	if (typeof e != "object") return typeof e;
+	if (e instanceof Date) return Number.isNaN(e.getTime()) ? "Date(Invalid)" : "Date";
+	if (Array.isArray(e)) return "Array";
+	if (globalThis.Buffer !== void 0 && globalThis.Buffer.isBuffer(e)) return "Buffer";
+	let t = e.constructor?.name;
+	return typeof t == "string" && t !== "" ? t : "Object";
+}, Be = 63, Ve = 60, T = [], E = (e) => {
+	T.includes(e) || T.push(e);
+}, He = () => {
+	let e = T.slice();
+	return T.length = 0, e;
+}, Ue = /^[a-zA-Z_][a-zA-Z0-9_]*$/, D = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!je.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.`);
-}, b = (e, t) => {
-	if (v("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 && _(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
-}, x = (e, t, n, r) => {
-	if (v("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 && _(`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.` : ""}`);
-}, S = (e, t) => {
+	if (!Ue.test(t)) throw Error(`${e} '${t}' contains characters outside [A-Za-z0-9_] or starts with a digit. Dialect-portable identifiers must match /^[a-zA-Z_][a-zA-Z0-9_]*$/.`);
+}, O = (e) => {
+	if (D("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 && E(`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.`);
+}, k = (e, t) => {
+	if (D("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 && E(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
+}, A = (e, t, n, r) => {
+	if (D("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 && E(`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.` : ""}`);
+}, j = (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_]*$/.";
@@ -355,44 +538,44 @@ var ge = () => new c({
 		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 && _(`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).`);
-}, Me = 1704067200000n, Ne = 10n, Pe = 12n, Fe = (1n << Ne) - 1n, Ie = (1n << Pe) - 1n, Le = Pe, Re = 22n, ze = () => {
+	e.length > 60 && E(`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).`);
+}, We = 1704067200000n, Ge = 10n, Ke = 12n, qe = (1n << Ge) - 1n, Je = (1n << Ke) - 1n, Ye = Ke, Xe = 22n, Ze = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > Fe) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Fe}.`);
+	if (t < 0n || t > qe) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${qe}.`);
 	return t;
-}, C = () => ({
+}, Qe = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: ze()
-}), w, Be = () => (w === void 0 && (w = C()), w), Ve = () => {
-	w = C();
-}, T = () => BigInt(Date.now()), He = (e) => {
-	let t = T();
-	for (; t <= e;) t = T();
+	machineId: Ze()
+}), M, $e = () => (M === void 0 && (M = Qe()), M), et = () => {
+	M = Qe();
+}, N = () => BigInt(Date.now()), tt = (e) => {
+	let t = N();
+	for (; t <= e;) t = N();
 	return t;
-}, E = () => {
-	let e = Be(), t = T();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & Ie, e.sequence === 0n && (t = He(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - Me;
+}, nt = () => {
+	let e = $e(), t = N();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & Je, e.sequence === 0n && (t = tt(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - We;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Re | e.machineId << Le | e.sequence).toString();
-}, D = (e) => {
+	return (n << Xe | e.machineId << Ye | e.sequence).toString();
+}, P = (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 S(n, {
+	return j(n, {
 		kind: "derived",
 		tableName: e
 	}), n;
-}, O = (e, t) => {
+}, rt = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: D(t)
+		prefix: P(t)
 	};
-	if ("prefix" in e && !("scheme" in e)) return S(e.prefix, {
+	if ("prefix" in e && !("scheme" in e)) return j(e.prefix, {
 		kind: "explicit",
 		tableName: t
 	}), {
@@ -402,8 +585,8 @@ var ge = () => new c({
 	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
 	switch (e.scheme) {
 		case "typeid": {
-			let n = e.prefix ?? D(t);
-			return e.prefix !== void 0 && S(e.prefix, {
+			let n = e.prefix ?? P(t);
+			return e.prefix !== void 0 && j(e.prefix, {
 				kind: "explicit",
 				tableName: t
 			}), {
@@ -419,22 +602,22 @@ var ge = () => new c({
 			generate: e.generate
 		};
 	}
-}, Ue = (e, t) => {
+}, it = (e, t) => {
 	switch (e.kind) {
-		case "typeid": return n(e.prefix).toString();
-		case "ulid": return r();
+		case "typeid": return i(e.prefix).toString();
+		case "ulid": return a();
 		case "numeric": return null;
-		case "snowflake": return E();
+		case "snowflake": return nt();
 		case "custom": return e.generate(t);
 	}
-}, k = (e) => ({
-	fields: f(e.fields),
+}, at = (e) => ({
+	fields: _(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 }
-}), We = k, A = (e) => {
+}), ot = at, st = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -444,7 +627,7 @@ var ge = () => new c({
 	};
 	for (let t of e) r(t);
 	return n;
-}, Ge = (e, ...t) => {
+}, ct = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -455,14 +638,14 @@ var ge = () => new c({
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, Ke = (e = "cosine", t = "float32") => {
+}, lt = (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`;
 	}
-}, qe = [
+}, ut = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -471,7 +654,7 @@ var ge = () => new c({
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], Je = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, j = (e, t) => `${e}_${t.join("_")}_idx`, Ye = (e, t) => `${e}_${t.join("_")}_uq`, M = (e, t, n, r, i) => {
+], dt = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, F = (e, t) => `${e}_${t.join("_")}_idx`, ft = (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];
@@ -479,15 +662,15 @@ var ge = () => new c({
 	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.`);
-}, Xe = (e, t) => {
+}, pt = (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: O(i.idSchemeInput, t)
+		idScheme: rt(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, N = (e) => {
-	let n = e.appliedPrimaryKey ?? [];
+}, L = (e) => {
+	let t = e.appliedPrimaryKey ?? [];
 	return {
 		tableName: e.tableName,
 		fields: e.fields,
@@ -499,14 +682,14 @@ var ge = () => new c({
 		appliedChecks: e.appliedChecks,
 		appliedRules: e.appliedRules ?? [],
 		appliedPluginRefs: e.appliedPluginRefs ?? [],
-		appliedPrimaryKey: n,
+		appliedPrimaryKey: t,
 		...e.previousTableName === void 0 ? {} : { previousTableName: e.previousTableName },
 		...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 		...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 (x(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
-			return N({
+			if (A(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -527,27 +710,27 @@ var ge = () => new c({
 			});
 		}),
 		with: ((...t) => {
-			let n = A(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
+			let n = st(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}': '${Je(o)}' and '${Je(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.`);
-				b(e.tableName, n), r[n] = a, i.set(n, t);
+				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${dt(o)}' and '${dt(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.`);
+				k(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 ?? j(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (x(e.tableName, t, n.name === void 0, n.fields), M(e.tableName, t, n.kind, n.fields, r), a.push({
+				let t = n.name ?? F(e.tableName, n.fields);
+				a.some((e) => e.name === t) || (A(e.tableName, t, n.name === void 0, n.fields), I(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 N({
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: r,
@@ -564,10 +747,10 @@ var ge = () => new c({
 		}),
 		index: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = j(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 = F(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 (x(e.tableName, n, a, o), M(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 N({
+			if (A(e.tableName, n, a, o), I(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 L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -591,8 +774,8 @@ var ge = () => new c({
 		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 (x(e.tableName, t, !1, i), M(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 N({
+			if (A(e.tableName, t, !1, i), I(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 L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -615,9 +798,9 @@ var ge = () => new c({
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = Ye(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 (x(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 N({
+			if (a ? (r = t[0], i = t[1], n = ft(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(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 L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -638,10 +821,10 @@ var ge = () => new c({
 		}),
 		uniqueActive: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = j(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 (x(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 (a ? (r = t[0], i = t[1], n = F(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(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 N({
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -663,8 +846,8 @@ var ge = () => new c({
 		}),
 		check: ((t, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
-			if (x(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 N({
+			if (A(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 L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -686,7 +869,7 @@ var ge = () => new c({
 			if (t.trim().length === 0) throw Error(`rule on table '${e.tableName}' has an empty name.`);
 			let i = e.appliedRules ?? [];
 			if (i.some((e) => e.name === t)) throw Error(`duplicate rule '${t}' on table '${e.tableName}': each rule name must be unique within a table.`);
-			return N({
+			return L({
 				...e,
 				appliedRules: [...i, {
 					name: t,
@@ -697,22 +880,22 @@ var ge = () => new c({
 		}),
 		renamedFrom: ((t) => {
 			if (t === e.tableName) throw Error(`renamedFrom('${t}') on table '${e.tableName}' names the table itself — drop the marker, there is nothing to rename.`);
-			return y(t), N({
+			return O(t), L({
 				...e,
 				previousTableName: t
 			});
 		}),
-		primaryKey: ((t) => {
-			if (t.length === 0) throw Error(`primaryKey([...]) on table '${e.tableName}' needs at least one column.`);
+		primaryKey: ((n) => {
+			if (n.length === 0) throw Error(`primaryKey([...]) on table '${e.tableName}' needs at least one column.`);
 			let r = /* @__PURE__ */ new Set();
-			for (let n of t) {
-				if (!(n in e.fields)) throw Error(`primaryKey([...]) on table '${e.tableName}' references unknown column '${n}'.`);
-				if (r.has(n)) throw Error(`primaryKey([...]) on table '${e.tableName}' lists column '${n}' twice.`);
-				r.add(n);
+			for (let t of n) {
+				if (!(t in e.fields)) throw Error(`primaryKey([...]) on table '${e.tableName}' references unknown column '${t}'.`);
+				if (r.has(t)) throw Error(`primaryKey([...]) on table '${e.tableName}' lists column '${t}' twice.`);
+				r.add(t);
 			}
-			if (n.length > 0) throw Error(`primaryKey([...]) declared twice on table '${e.tableName}'.`);
-			for (let [n, r] of Object.entries(e.fields)) if (r.type === "id" && !t.includes(n)) throw Error(`primaryKey([...]) on table '${e.tableName}' conflicts with the id() column '${n}'. The explicit primary key IS the key — drop the id() column, or include '${n}' in the composite key.`);
-			return N({
+			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}'. The explicit primary key IS the key — drop the id() column, or include '${t}' in the composite key.`);
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -722,12 +905,12 @@ var ge = () => new c({
 				appliedUniques: e.appliedUniques,
 				appliedFullText: e.appliedFullText,
 				appliedChecks: e.appliedChecks,
-				appliedPrimaryKey: [...t],
+				appliedPrimaryKey: [...n],
 				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
-		nonReactive: (() => N({
+		nonReactive: (() => L({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -741,7 +924,7 @@ var ge = () => new c({
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validate: ((t) => N({
+		validate: ((t) => L({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -755,7 +938,7 @@ var ge = () => new c({
 			insertSchema: t,
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validatePatch: ((n) => N({
+		validatePatch: ((t) => L({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -767,25 +950,25 @@ var ge = () => new c({
 			appliedChecks: e.appliedChecks,
 			appliedPrimaryKey: e.appliedPrimaryKey,
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-			validatePatchSchema: t.partial(n)
+			validatePatchSchema: r.partial(t)
 		}))
 	};
-}, Ze = (e, t) => {
-	y(e);
+}, R = (e, t) => {
+	O(e);
 	let n = Object.entries(t).flatMap(([e, t]) => {
-		let n = m(t);
+		let n = xe(t);
 		return n === void 0 ? [] : [{
 			column: e,
 			...n
 		}];
-	}), r = Xe(f(t), e);
-	for (let t of Object.keys(r)) b(e, t);
+	}), r = pt(_(t), e);
+	for (let t of Object.keys(r)) k(e, t);
 	let i;
-	for (let [t, n] of Object.entries(r)) n.references === d && (n.references = () => {
+	for (let [t, n] of Object.entries(r)) n.references === g && (n.references = () => {
 		if (i === void 0) throw Error(`selfReference() on '${e}.${t}' read before table() returned`);
 		return i;
 	});
-	return i = N({
+	return i = L({
 		appliedPluginRefs: n,
 		tableName: e,
 		fields: r,
@@ -797,7 +980,7 @@ var ge = () => new c({
 		appliedChecks: [],
 		appliedRules: []
 	}), i;
-}, Qe = (e) => e === "sqlite" || e === "turso", $e = (e) => e === "mysql" || e === "mariadb", P = (e, t) => {
+}, mt = (e) => e === "sqlite" || e === "turso", ht = (e) => e === "mysql" || e === "mariadb", z = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e.replace(/`/g, "``")}\``;
@@ -806,51 +989,51 @@ var ge = () => new c({
 		case "sqlite":
 		case "turso": return `"${e.replace(/"/g, "\"\"")}"`;
 	}
-}, et = 1e4, tt = Symbol.for("@voltro/database/tableRegistry"), F = globalThis, I = F[tt] ?? (F[tt] = /* @__PURE__ */ new Map()), L = (e) => {
-	let t = I.get(e.tableName);
+}, gt = 1e4, _t = Symbol.for("@voltro/database/tableRegistry"), B = globalThis, V = B[_t] ?? (B[_t] = /* @__PURE__ */ new Map()), vt = (e) => {
+	let t = V.get(e.tableName);
 	if (t === void 0) {
-		I.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.`);
-}, nt = (e) => {
-	I.get(e.tableName) === void 0 && I.set(e.tableName, e);
-}, R = (e) => I.get(e), rt = (e) => {
-	let t = I.get(e);
+}, yt = (e) => {
+	V.get(e.tableName) === void 0 && V.set(e.tableName, e);
+}, H = (e) => V.get(e), bt = (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;
-}, it = () => [...I.values()], at = (e) => I.delete(e), ot = () => {
-	I.clear();
-}, st = (e) => I.get(e)?.isReactive !== !1, ct = (e) => e.order ?? [], lt = (e) => ({
+}, xt = () => [...V.values()], St = (e) => V.delete(e), Ct = () => {
+	V.clear();
+}, wt = (e) => V.get(e)?.isReactive !== !1, Tt = (e) => e.order ?? [], Et = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), ut = (e, t) => ({
+}), Dt = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), dt = (e, t) => ({
+}), Ot = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), ft = (e, t) => ({
+}), kt = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), pt = (e, t) => ({
+}), At = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), mt = (e, t) => ({
+}), jt = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), ht = (e, t) => ({
+}), Mt = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), z = (e) => (...t) => {
+}), U = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return H({
+	return G({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -862,55 +1045,55 @@ var ge = () => new c({
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, gt = z("union"), _t = z("union-all"), vt = z("intersect"), yt = z("except"), B = (e) => ({ over: (t) => ({
+}, Nt = U("union"), Pt = U("union-all"), Ft = U("intersect"), It = U("except"), W = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), bt = (e = "rowNumber") => B({
+}) }), Lt = (e = "rowNumber") => W({
 	op: "window-row-number",
 	alias: e
-}), xt = (e = "rank") => B({
+}), Rt = (e = "rank") => W({
 	op: "window-rank",
 	alias: e
-}), St = (e = "denseRank") => B({
+}), zt = (e = "denseRank") => W({
 	op: "window-dense-rank",
 	alias: e
-}), Ct = (e, t = 1, n) => B({
+}), Bt = (e, t = 1, n) => W({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), wt = (e, t = 1, n) => B({
+}), Vt = (e, t = 1, n) => W({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), Tt = (e, t) => B({
+}), Ht = (e, t) => W({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), Et = (e, t) => B({
+}), Ut = (e, t) => W({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), V = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? R(e)?.appliedFullText?.find((e) => e.name === t);
+}), Wt = (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 }
 	};
-}, H = (e) => ({
+}, G = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return H({
+		return G({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return H({
+		return G({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -919,43 +1102,43 @@ var ge = () => new c({
 		});
 	},
 	limit(t) {
-		return H({
+		return G({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return H({
+		return G({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return H({
+		return G({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return H({
+		return G({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return H({
+		return G({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	forUpdate() {
-		return H({
+		return G({
 			...e,
 			lock: "update"
 		});
 	},
 	unscoped() {
-		return H({
+		return G({
 			...e,
 			crossTenant: !0
 		});
@@ -965,13 +1148,13 @@ var ge = () => new c({
 			...e.eager ?? {},
 			...t
 		};
-		return H({
+		return G({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return H({
+		return G({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -985,15 +1168,15 @@ var ge = () => new c({
 			...t,
 			alias: e
 		}));
-		return H({
+		return G({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = V(e.table, t, e.fullTextIndexes);
-		return H({
+		let r = Wt(e.table, t, e.fullTextIndexes);
+		return G({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -1007,7 +1190,7 @@ var ge = () => new c({
 	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 H({
+		return G({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -1026,7 +1209,7 @@ var ge = () => new c({
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return H({
+			return G({
 				...e,
 				annClause: i
 			});
@@ -1038,7 +1221,7 @@ var ge = () => new c({
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return H({
+			return G({
 				...e,
 				annClause: r,
 				take: n
@@ -1051,7 +1234,7 @@ var ge = () => new c({
 			column: "",
 			distance: "cosine"
 		};
-		return H({
+		return G({
 			...e,
 			annClause: {
 				...n,
@@ -1060,22 +1243,22 @@ var ge = () => new c({
 		});
 	},
 	use(t) {
-		return H({ ...t(e) });
+		return G({ ...t(e) });
 	},
 	distinct() {
-		return H({
+		return G({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return H({
+		return G({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return H({
+		return G({
 			...e,
 			alias: t
 		});
@@ -1087,7 +1270,7 @@ var ge = () => new c({
 			alias: n,
 			on: r
 		}];
-		return H({
+		return G({
 			...e,
 			joins: a
 		});
@@ -1099,7 +1282,7 @@ var ge = () => new c({
 			alias: n,
 			on: r
 		}];
-		return H({
+		return G({
 			...e,
 			joins: a
 		});
@@ -1109,7 +1292,7 @@ var ge = () => new c({
 			outputKey: e,
 			source: t
 		}));
-		return H({
+		return G({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1118,7 +1301,7 @@ var ge = () => new c({
 	withCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.withCte: duplicate CTE name '${t}'`);
-		return H({
+		return G({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1129,7 +1312,7 @@ var ge = () => new c({
 	recursiveCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.recursiveCte: duplicate CTE name '${t}'`);
-		return H({
+		return G({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1140,20 +1323,20 @@ var ge = () => new c({
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return H({
+		return G({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return H({
+		return G({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return H({
+		return G({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1164,8 +1347,8 @@ var ge = () => new c({
 		});
 	}
 });
-function U(e) {
-	return H({
+function K(e) {
+	return G({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1176,7 +1359,7 @@ function U(e) {
 		sourceTable: e
 	});
 }
-var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
+var Gt = (e, t, n) => Kt(e, "id", t, n), Kt = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1191,21 +1374,21 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, Ot = (e) => {
+}, qt = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) L(r), t[n] = U(r);
+	for (let [n, r] of Object.entries(e)) vt(r), t[n] = K(r);
 	return t;
-}, kt = (e) => e.isView === !0, At = (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);
+}, Jt = (e) => e.isView === !0, Yt = (e, t, n) => {
+	if (O(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
+	let r = _(t);
+	for (let t of Object.keys(r)) k(e, t);
 	return {
 		tableName: e,
 		fields: r,
 		isView: !0,
 		viewSelect: n
 	};
-}, jt = (e) => U({
+}, Xt = (e) => K({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1213,8 +1396,8 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), Mt = (e, t, n = null) => {
-	let r = n === null ? P(e.tableName, t) : `${P(n, t)}.${P(e.tableName, t)}`, i = e.viewSelect.trim();
+}), Zt = (e, t, n = null) => {
+	let r = n === null ? z(e.tableName, t) : `${z(n, t)}.${z(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1223,7 +1406,7 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, Nt = (e) => e == null || typeof e == "boolean" ? e : typeof e == "number" ? e !== 0 : typeof e == "bigint" ? e !== 0n : typeof e == "string" ? e === "1" || e.toLowerCase() === "true" : e, G = (e) => {
+}, Qt = (e) => e == null || typeof e == "boolean" ? e : typeof e == "number" ? e !== 0 : typeof e == "bigint" ? e !== 0n : typeof e == "string" ? e === "1" || e.toLowerCase() === "true" : e, q = (e) => {
 	if (e == null || typeof e != "string") return e;
 	let t = e.trim();
 	if (t.length === 0) return e;
@@ -1234,7 +1417,7 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 	} catch {
 		return e;
 	}
-}, Pt = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, Ft = (e) => {
+}, $t = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, en = (e) => {
 	if (e == null || e instanceof Date) return e;
 	if (typeof e == "string") {
 		let t = new Date(e);
@@ -1245,24 +1428,24 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		return isNaN(t.getTime()) ? e : t;
 	}
 	return e;
-}, K = (e, t, n) => {
+}, tn = (e, t, n) => {
 	if (e == null) return e;
 	switch (t) {
-		case "boolean": return n === "postgres" ? e : Nt(e);
-		case "vector": return n === "postgres" ? G(e) : e;
-		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : G(e);
-		case "array": return n === "postgres" ? e : G(e);
+		case "boolean": return n === "postgres" ? e : Qt(e);
+		case "vector": return n === "postgres" ? q(e) : e;
+		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : q(e);
+		case "array": return n === "postgres" ? e : q(e);
 		case "timestamp":
-		case "date": return n === "sqlite" || n === "turso" ? Ft(e) : e;
+		case "date": return n === "sqlite" || n === "turso" ? en(e) : e;
 		case "decimal":
-		case "bigint": return Pt(e);
+		case "bigint": return $t(e);
 		default: return e;
 	}
-}, It = (e, t, n) => {
+}, nn = (e, t, n) => {
 	if (e.length === 0) return e;
-	let r = R(t);
-	return r === void 0 ? e : q(e, r, n);
-}, q = (e, t, n) => {
+	let r = H(t);
+	return r === void 0 ? e : rn(e, r, n);
+}, rn = (e, t, n) => {
 	if (e.length === 0) return e;
 	let r = t.fields, i = [];
 	for (let [e, t] of Object.entries(r)) i.push({
@@ -1271,10 +1454,10 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 	});
 	return e.map((e) => {
 		let t = { ...e };
-		for (let { key: e, type: r } of i) e in t && (t[e] = K(t[e], r, n));
+		for (let { key: e, type: r } of i) e in t && (t[e] = tn(t[e], r, n));
 		return t;
 	});
-}, Lt = (e, t) => {
+}, an = (e, t) => {
 	if (e == null) return e;
 	switch (t) {
 		case "json": return JSON.stringify(e);
@@ -1282,25 +1465,25 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		case "vector": return typeof e == "string" ? e : JSON.stringify(e);
 		default: return e;
 	}
-}, Rt = (e, t, n = ["json", "array"]) => {
-	let r = R(t);
+}, on = (e, t, n = ["json", "array"]) => {
+	let r = H(t);
 	if (r === void 0) return e;
 	let i = r.fields, a = null;
 	for (let [t, r] of Object.entries(i)) if (n.includes(r.type) && t in e) {
-		let n = Lt(e[t], r.type);
+		let n = an(e[t], r.type);
 		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
 	}
 	return a ?? e;
-}, zt = /^[A-Za-z_][A-Za-z0-9_]*$/, Bt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : zt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), Vt = (e) => "{" + e.map((e) => {
+}, sn = /^[A-Za-z_][A-Za-z0-9_]*$/, cn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : sn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), ln = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", Ht = (e, t, n, r = {}) => {
-	let i = P(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", un = (e, t, n, r = {}) => {
+	let i = z(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${Vt(t)}'::text[])`;
+		let e = `(${i} #>> '${ln(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = Bt(t);
+	let o = cn(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1335,73 +1518,73 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		a = t === n ? 0 : t > n ? 1 : -1;
 	}
 	return a === 0 ? 0 : (a > 0 ? 1 : -1) * (r.negative ? -1 : 1);
-}, Ut = (e, t) => ({
+}, dn = (e, t) => ({
 	column: e,
 	op: "eq",
 	value: t
-}), Wt = (e, t) => ({
+}), fn = (e, t) => ({
 	column: e,
 	op: "neq",
 	value: t
-}), Gt = (e, t) => ({
+}), pn = (e, t) => ({
 	column: e,
 	op: "gt",
 	value: t
-}), Kt = (e, t) => ({
+}), mn = (e, t) => ({
 	column: e,
 	op: "gte",
 	value: t
-}), qt = (e, t) => ({
+}), hn = (e, t) => ({
 	column: e,
 	op: "lt",
 	value: t
-}), Jt = (e, t) => ({
+}), gn = (e, t) => ({
 	column: e,
 	op: "lte",
 	value: t
-}), Yt = (e, t) => ({
+}), _n = (e, t) => ({
 	column: e,
 	op: "in",
 	value: t
-}), Xt = (e, t) => ({
+}), vn = (e, t) => ({
 	column: e,
 	op: "notIn",
 	value: t
-}), Zt = (e, t) => ({
+}), yn = (e, t) => ({
 	column: e,
 	op: "contains",
 	value: t
-}), Qt = (e, t) => ({
+}), bn = (e, t) => ({
 	column: e,
 	op: "startsWith",
 	value: t
-}), $t = (e, t) => ({
+}), xn = (e, t) => ({
 	column: e,
 	op: "arrayContains",
 	value: t
-}), en = (e, t) => ({
+}), Sn = (e, t) => ({
 	column: e,
 	op: "arrayOverlaps",
 	value: t
-}), tn = (e, t) => ({
+}), Cn = (e, t) => ({
 	column: e,
 	op: "arrayHas",
 	value: t
-}), nn = {
+}), wn = {
 	column: "id",
 	op: "in",
 	value: []
-}, rn = (e) => ({
+}, Tn = (e) => ({
 	column: e,
 	op: "isNull"
-}), an = (e) => ({
+}), En = (e) => ({
 	column: e,
 	op: "isNotNull"
-}), on = (e, t) => ({
+}), Dn = (e, t) => ({
 	column: e,
 	op: "spatial",
 	value: t
-}), sn = (...e) => ({ and: e }), cn = (...e) => ({ or: e }), ln = (e) => ({ not: e }), un = (e, ...t) => {
+}), On = (...e) => ({ and: e }), kn = (...e) => ({ or: e }), An = (e) => ({ not: e }), jn = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonField("${e}"): at least one path segment is required`);
 	let n = (n, r) => ({
 		column: e,
@@ -1423,37 +1606,37 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		isNull: () => n("isNull"),
 		isNotNull: () => n("isNotNull")
 	};
-}, Y = (e) => "descriptor" in e ? e.descriptor : e, dn = (e, t) => ({
+}, Y = (e) => "descriptor" in e ? e.descriptor : e, Mn = (e, t) => ({
 	column: e,
 	op: "subquery-in",
 	subquery: Y(t)
-}), fn = (e, t) => ({
+}), Nn = (e, t) => ({
 	column: e,
 	op: "subquery-not-in",
 	subquery: Y(t)
-}), pn = (e) => ({
+}), Pn = (e) => ({
 	op: "exists",
 	subquery: Y(e)
-}), mn = (e) => ({
+}), Fn = (e) => ({
 	op: "not-exists",
 	subquery: Y(e)
-}), hn = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, gn = (e) => {
+}), In = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, Ln = (e) => {
 	if (e instanceof Date) return e.getTime();
-	if (typeof e == "string" && hn.test(e)) {
+	if (typeof e == "string" && In.test(e)) {
 		let t = Date.parse(e);
 		return Number.isNaN(t) ? void 0 : t;
 	}
-}, _n = (e, t) => {
+}, Rn = (e, t) => {
 	if (!(e instanceof Date) && !(t instanceof Date)) return;
-	let n = gn(e), r = gn(t);
+	let n = Ln(e), r = Ln(t);
 	return n === void 0 || r === void 0 ? void 0 : [n, r];
-}, vn = (e, t) => {
+}, zn = (e, t) => {
 	if (e === t) return !0;
-	let n = _n(e, t);
+	let n = Rn(e, t);
 	return n !== void 0 && n[0] === n[1];
-}, yn = (e, t) => {
+}, Bn = (e, t) => {
 	if (e == null || t == null) return null;
-	let n = _n(e, t);
+	let n = Rn(e, t);
 	if (n !== void 0) return n[0] === n[1] ? 0 : n[0] > n[1] ? 1 : -1;
 	let r = e instanceof Date ? e.getTime() : e, i = t instanceof Date ? t.getTime() : t;
 	return typeof r == typeof i ? r === i ? 0 : r > i ? 1 : -1 : null;
@@ -1480,7 +1663,7 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		let t = n.get(e.subquery), r = typeof t == "number" ? t > 0 : t instanceof Set && t.size > 0;
 		return e.op === "exists" ? r : !r;
 	}
-	let i = e, a = t[i.column], o = r[i.column]?.type === "decimal", s = (e, t) => o && e != null && t != null ? J(e, t) === 0 : vn(e, t), c = o ? J : yn;
+	let i = e, a = t[i.column], o = r[i.column]?.type === "decimal", s = (e, t) => o && e != null && t != null ? J(e, t) === 0 : zn(e, t), c = o ? J : Bn;
 	switch (i.op) {
 		case "eq": return s(a, i.value);
 		case "neq": return !s(a, i.value);
@@ -1542,13 +1725,13 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		...e,
 		conjunctive: t
 	});
-}, bn = (e, t) => ({
+}, Vn = (e, t) => ({
 	name: e,
 	body: t
-}), xn = (e) => {
+}), Hn = (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: bn });
+	let t = e.steps({ step: Vn });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -1561,68 +1744,68 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, Sn = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Cn = null, wn = null, Tn = (e) => {
-	Cn = e;
-}, En = (e) => {
-	wn = e;
-}, Dn = async (e) => {
-	let t = Cn;
+}, Un = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Wn = null, Gn = null, Kn = (e) => {
+	Wn = e;
+}, qn = (e) => {
+	Gn = e;
+}, Jn = async (e) => {
+	let t = Wn;
 	t !== null && await t(e);
-}, On = async (e) => {
-	let t = wn;
+}, Yn = async (e) => {
+	let t = Gn;
 	t !== null && e.changedTables.length !== 0 && await t(e);
-}, kn = (e) => {
+}, Xn = (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;
-}, $ = Symbol.for("voltro.migration.irreversible"), An = class extends Error {
+}, Zn = Symbol.for("voltro.migration.irreversible"), $ = class extends Error {
 	migrationId;
 	reason;
 	_tag = "IrreversibleMigrationError";
 	constructor(e, t) {
 		super(`migration ${e} cannot be rolled back: ${t}`), this.migrationId = e, this.reason = t, this.name = "IrreversibleMigrationError";
 	}
-}, jn = (t) => {
-	if (!t || t.trim().length === 0) throw Error("irreversible(): a reason is required");
-	return Object.assign(() => e.fail(new An("<unknown>", t)), { [$]: t });
-}, Mn = (e) => {
-	let t = e[$];
+}, Qn = (e) => {
+	if (!e || e.trim().length === 0) throw Error("irreversible(): a reason is required");
+	return Object.assign(() => t.fail(new $("<unknown>", e)), { [Zn]: e });
+}, $n = (e) => {
+	let t = e[Zn];
 	return typeof t == "string" ? t : void 0;
-}, Nn = class {
+}, er = class {
 	reason;
 	_tag = "MigrationSkipped";
 	constructor(e) {
 		this.reason = e;
 	}
-}, Pn = class extends Error {
+}, tr = class extends Error {
 	migrationId;
 	failed;
 	_tag = "MigrationExpectationFailed";
 	constructor(e, t) {
 		super(`migration ${e}: ${t.length} post-condition(s) did not hold after up():\n` + t.map((e) => `  - ${e}`).join("\n") + "\n  The migration is NOT recorded; the next run applies it again."), this.migrationId = e, this.failed = t, this.name = "MigrationExpectationFailed";
 	}
-}, Fn = class extends Error {
+}, nr = class extends Error {
 	migrationId;
 	dialect;
 	_tag = "TransactionBrokenByBodyError";
 	constructor(e, t) {
 		super(`migration ${e} is transactional, and its body COMMITTED the transaction from inside — on ${t} a DDL statement commits everything before it. The work is in the database and the migration is recorded; it will not run again. What did not hold is the all-or-nothing guarantee. Either mark it \`transactional: false\` (per-statement, resumable through your own idempotency) or move the schema change into \`ctx.schema\` in a migration of its own and keep this one to data.`), this.migrationId = e, this.dialect = t, this.name = "TransactionBrokenByBodyError";
 	}
-}, In = class extends Error {
+}, rr = class extends Error {
 	table;
 	report;
 	_tag = "RewriteUnstableError";
 	constructor(e, t) {
 		super(`rewrite of ${e} did not stabilise after ${t.passes} pass(es): ${t.rewritten} rewritten, ${t.contended} contended on the last pass. Something is still writing these rows — raise maxPasses, or stop the writer first.`), this.table = e, this.report = t, this.name = "RewriteUnstableError";
 	}
-}, Ln = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Rn = (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", zn = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Bn = (e) => zn.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Vn = "_voltro_staging_", Hn = (e) => e.startsWith(Vn), Un = /__dropped_\d{14}$/, Wn = (e) => Un.test(e), Gn = 7, Kn = (e) => {
+}, ir = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, ar = (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", or = /* @__PURE__ */ new Set(["voltro_isr_cache"]), sr = (e) => or.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), cr = "_voltro_staging_", lr = (e) => e.startsWith(cr), ur = /__dropped_\d{14}$/, dr = (e) => ur.test(e), fr = 7, pr = (e) => {
 	let t = /__dropped_(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})$/.exec(e);
 	if (t === null) return;
 	let [, n, r, i, a, o, s] = t;
 	return new Date(Date.UTC(Number(n), Number(r) - 1, Number(i), Number(a), Number(o), Number(s)));
-}, qn = (e, t = {}) => {
+}, mr = (e, t = {}) => {
 	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
-		let a = Kn(e);
+		let a = pr(e);
 		if (a === void 0) return;
 		let o = Math.floor((n.getTime() - a.getTime()) / 864e5);
 		o >= r && i.push({
@@ -1631,11 +1814,123 @@ var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
 			ageDays: o
 		});
 	};
-	for (let t of e.tables) if (a(t.name, t.name), !Wn(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
+	for (let t of e.tables) if (a(t.name, t.name), !dr(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
 	return i;
-}, Jn = (e, t) => {
+}, hr = (e, t) => {
 	let n = e.reduce((e, t) => e.ageDays >= t.ageDays ? e : t), r = (/* @__PURE__ */ new Date(Date.now() - t * 864e5)).toISOString().slice(0, 10);
 	return `${e.length} soft-drop snapshot(s) older than ${t} day(s) still hold the dropped data (oldest: ${n.name}, ${n.ageDays}d) — ${e.map((e) => e.name).join(", ")}. Restore with \`voltro db restore-snapshot\` or reclaim with \`voltro db gc-snapshots --before ${r}\`; the window is \`database.softDropRetentionDays\` in app.config.`;
-};
+}, gr = R("_voltro_migrations", {
+	id: d({ prefix: "mig" }),
+	name: f(),
+	hash: f(),
+	status: f(),
+	appliedAt: m().nullable(),
+	durationMs: p().nullable(),
+	errorMessage: f().nullable(),
+	errorStack: f().nullable(),
+	workflowRunId: f().nullable(),
+	createdAt: m().default("now"),
+	updatedAt: m().default("now").onUpdate("now")
+}).index(["status"]), _r = R("_voltro_seeds", {
+	id: d({ prefix: "seed" }),
+	name: f(),
+	lifecycle: f(),
+	fingerprint: f(),
+	cronSchedule: f().nullable(),
+	watchedTables: h().nullable(),
+	nextRunAt: m().nullable(),
+	lastRunStatus: f().nullable(),
+	lastRunAt: m().nullable(),
+	lastRunDurationMs: p().nullable(),
+	lastRunRowsTouched: p().nullable(),
+	lastError: f().nullable(),
+	workflowRunId: f().nullable(),
+	createdAt: m().default("now"),
+	updatedAt: m().default("now").onUpdate("now")
+}).index(["lifecycle"]).index(["nextRunAt"]), vr = R("_voltro_migration_plans", {
+	id: d({ prefix: "plan" }),
+	fingerprint: f(),
+	liveFingerprint: f().nullable(),
+	operations: h(),
+	rollbackPlan: h().nullable(),
+	appliedBy: f(),
+	environment: f(),
+	source: f(),
+	onlineStrategy: f().nullable(),
+	durationMs: p(),
+	notes: f().nullable(),
+	squashedAt: m().nullable(),
+	appliedAt: m().default("now"),
+	createdAt: m().default("now"),
+	updatedAt: m().default("now").onUpdate("now")
+}).index(["fingerprint"]).index(["environment"]), yr = R("_voltro_idempotency", {
+	id: d({ prefix: "idem" }),
+	scope: f(),
+	key: f(),
+	status: f(),
+	response: h().nullable(),
+	createdAt: m().default("now")
+}).unique(["scope", "key"]).index(["createdAt"]), br = R("_voltro_devices", {
+	id: d({ prefix: "device" }),
+	tenantId: f(),
+	name: f(),
+	scopes: h().nullable(),
+	pairingHash: f().maxLength(64).nullable(),
+	pairingExpiresAt: m().nullable(),
+	accessHash: f().maxLength(64).nullable(),
+	accessExpiresAt: m().nullable(),
+	refreshHash: f().maxLength(64).nullable(),
+	refreshExpiresAt: m().nullable(),
+	previousRefreshHash: f().maxLength(64).nullable(),
+	generation: p().default(0),
+	pairedAt: m().nullable(),
+	lastSeenAt: m().nullable(),
+	revokedAt: m().nullable(),
+	revokedReason: f().nullable(),
+	createdBy: f().nullable(),
+	metadata: h().nullable(),
+	createdAt: m()
+}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), xr = R("_voltro_tenant_selections", {
+	id: d({ prefix: "tsel" }),
+	subjectType: f().maxLength(32),
+	subjectId: f(),
+	tenantId: f(),
+	selectedAt: m()
+}).primaryKey(["id"]).nonReactive(), Sr = R("_voltro_kv", {
+	id: d({ prefix: "kv" }),
+	key: f().unique(),
+	value: f().nullable(),
+	expiresAt: m().nullable(),
+	createdAt: m().default("now"),
+	updatedAt: m().default("now").onUpdate("now")
+}).index(["expiresAt"]), Cr = R("_voltro_api_keys", {
+	id: d({ prefix: "apikey" }),
+	tenantId: f().nullable(),
+	name: f(),
+	hashedKey: f().maxLength(64).unique(),
+	keyPrefix: f(),
+	scopes: h().nullable(),
+	lastUsedAt: m().nullable(),
+	requestCount: p().default(0),
+	expiresAt: m().nullable(),
+	revokedAt: m().nullable(),
+	createdBy: f().nullable(),
+	onBehalfOf: f().nullable(),
+	metadata: h().nullable(),
+	createdAt: m().default("now")
+}).index("byApiKeyTenant", ["tenantId"]), wr = R("_voltro_replica_observations", {
+	id: d({ prefix: "robs" }),
+	replicaId: f().maxLength(191),
+	startedAt: m(),
+	version: f().maxLength(64).nullable(),
+	kind: f().maxLength(64),
+	payload: f().nullable(),
+	reachableAt: f().maxLength(255).nullable(),
+	writtenAt: m().default("now").onUpdate("now")
+}).unique(["replicaId", "kind"]).index(["kind"]), Tr = [
+	gr,
+	_r,
+	vr
+];
 //#endregion
-export { Q as $, D as $t, en as A, ge as An, dt as At, an as B, o as Bn, rt as Bt, Sn as C, pe as Cn, ct as Ct, sn as D, le as Dn, xt as Dt, nn as E, fe as En, U as Et, pn as F, ye as Fn, ot as Ft, Wt as G, u as Gn, P as Gt, un as H, he as Hn, et as Ht, Gt as I, ue as In, nt as It, Xt as J, Ze as Jt, ln as K, ce as Kn, qe as Kt, Kt as L, f as Ln, R as Lt, Zt as M, xe as Mn, gt as Mt, Ut as N, ee as Nn, _t as Nt, $t as O, oe as On, V as Ot, X as P, te as Pn, it as Pt, Qt as Q, A as Qt, Yt as R, ie as Rn, st as Rt, Dn as S, de as Sn, pt as St, Tn as T, a as Tn, Dt as Tt, qt as U, me as Un, $e as Ut, rn as V, ne as Vn, at as Vt, Jt as W, i as Wn, Qe as Wt, cn as X, We as Xt, fn as Y, Ke as Yt, on as Z, k as Zt, Mn as _, c as _n, yt as _t, Jn as a, ke as an, Rt as at, xn as b, ae as bn, wt as bt, Hn as c, x as cn, At as ct, An as d, Ee as dn, Et as dt, Ue as en, J as et, Pn as f, De as fn, ht as ft, jn as g, m as gn, St as gt, Fn as h, Ce as hn, Ot as ht, qn as i, Oe as in, It as it, Z as j, be as jn, Tt as jt, tn as k, re as kn, bt as kt, Kn as l, y as ln, Mt as lt, In as m, Te as mn, ut as mt, zn as n, E as nn, K as nt, Bn as o, Ae as on, kt as ot, Nn as p, we as pn, lt as pt, mn as q, _e as qn, Ge as qt, Vn as r, Ve as rn, q as rt, Wn as s, b as sn, jt as st, Gn as t, O as tn, Ht as tt, Ln as u, S as un, ft as ut, Rn as v, d as vn, vt, En as w, s as wn, W as wt, On as x, se as xn, mt as xt, kn as y, ve as yn, Ct as yt, dn as z, Se as zn, L as zt };
+export { hn as $, ge as $n, ht as $t, Hn as A, Ee as An, Vt as At, Sn as B, ce as Bn, Ot as Bt, er as C, Le as Cn, Et as Ct, $n as D, Ie as Dn, It as Dt, Qn as E, Fe as En, zt as Et, Kn as F, l as Fn, Gt as Ft, Pn as G, se as Gn, Ct as Gt, yn as H, ee as Hn, Nt as Ht, wn as I, g as In, K as It, _n as J, pe as Jn, wt as Jt, pn as K, ae as Kn, yt as Kt, On as L, he as Ln, Rt as Lt, Jn as M, we as Mn, At as Mt, Un as N, Se as Nn, Tt as Nt, ar as O, Ae as On, Ft as Ot, qn as P, xe as Pn, Kt as Pt, jn as Q, p as Qn, gt as Qt, xn as R, ie as Rn, Wt as Rt, tr as S, w as Sn, Mt as St, nr as T, b as Tn, qt as Tt, dn as U, s as Un, Pt as Ut, Z as V, ue as Vn, Ht as Vt, X as W, le as Wn, xt as Wt, En as X, ve as Xn, bt as Xt, Mn as Y, _e as Yn, vt as Yt, Tn as Z, d as Zn, St as Zt, dr as _, k as _n, Xt as _t, vr as a, lt as an, te as ar, Nn as at, ir as b, j as bn, kt as bt, _r as c, st as cn, o as cr, bn as ct, fr as d, rt as dn, me as dr, un as dt, mt as en, h as er, gn as et, or as f, nt as fn, tn as ft, sr as g, He as gn, Jt as gt, hr as h, Ve as hn, on as ht, Sr as i, R as in, c as ir, vn as it, Yn as j, Ce as jn, jt, Xn as k, Te as kn, Bt as kt, xr as l, P as ln, f as lr, Q as lt, mr as m, Be as mn, nn as mt, br as n, ut as nn, re as nr, An as nt, gr as o, ot as on, fe as or, kn as ot, cr as p, et as pn, rn as pt, mn as q, ne as qn, H as qt, yr as r, ct as rn, ye as rr, Fn as rt, wr as s, at as sn, de as sr, Dn as st, Cr as t, z as tn, _ as tr, fn as tt, Tr as u, it as un, m as ur, J as ut, lr as v, A as vn, Yt as vt, rr as w, Re as wn, Dt as wt, $ as x, y as xn, Ut as xt, pr as y, O as yn, Zt as yt, Cn as z, oe as zn, Lt as zt };