@voltro/database 0.25.0 → 0.27.0

package/dist/{frameworkLiveTables-BQwB8K6R.js → frameworkLiveTables-CS_Hyhgz.js}

@@ -186,7 +186,7 @@ var r = (e) => {
 			enumValues: t
 		})
 	};
-}, ae = () => a("boolean"), oe = () => a("timestamp"), se = () => a("date"), ce = () => a("json"), le = () => a("bytes"), l = (e, t) => new i({
+}, ae = () => a("boolean"), oe = () => a("timestamp"), se = () => a("date"), ce = () => a("json"), le = () => a("bytes"), ue = (e, t) => new i({
 	type: "reference",
 	nullable: !1,
 	unique: !1,
@@ -196,13 +196,13 @@ var r = (e) => {
 	refOnUpdate: t?.onUpdate ?? "noAction",
 	fkAutoIndex: t?.index ?? !0,
 	...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
-}), u = () => new i({
+}), l = () => new i({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), d = (e, t) => {
+}), u = (e, t) => {
 	if (!Number.isInteger(e) || e <= 0) throw Error(`vector(${String(e)}): dimension must be a positive integer (the embedding length, e.g. vector(1536)).`);
 	return new i({
 		type: "vector",
@@ -212,13 +212,13 @@ var r = (e) => {
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, ue = (e) => new i({
+}, de = (e) => new i({
 	type: "array",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	arrayElement: e.__definition().type
-}), de = () => a("interval"), fe = (e, t = 4326) => new i({
+}), fe = () => a("interval"), pe = (e, t = 4326) => new i({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -228,7 +228,7 @@ var r = (e) => {
 		geomKind: e,
 		srid: t
 	}
-}), pe = (e, t = 4326) => new i({
+}), me = (e, t = 4326) => new i({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -238,44 +238,51 @@ var r = (e) => {
 		geomKind: e,
 		srid: t
 	}
-}), me = (e) => new i({
+}), he = (e) => new i({
 	type: "raw",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	rawDdl: e
-}), f = (e) => {
+}), d = (e) => {
 	let t = {};
 	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
 	return t;
-}, p = /* @__PURE__ */ new Map(), he = (e, t) => {
+}, f = /* @__PURE__ */ new WeakMap(), p = (e) => typeof e == "object" && e ? f.get(e) : void 0, ge = (e, t = {}) => {
+	let n = s();
+	return f.set(n, {
+		target: e,
+		orphanPolicy: t.orphanPolicy ?? "keep",
+		onSoftDelete: t.onSoftDelete ?? !1
+	}), n;
+}, m = /* @__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 = p.get(e) ?? [];
+	let n = m.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), p.set(e, n);
-}, ge = (e) => p.get(e) ?? [], _e = () => p, ve = () => {
-	p.clear();
-}, ye = 63, be = 60, m = [], h = (e) => {
-	m.includes(e) || m.push(e);
-}, xe = () => {
-	let e = m.slice();
-	return m.length = 0, e;
-}, Se = /^[a-zA-Z_][a-zA-Z0-9_]*$/, g = (e, t) => {
+	n.push(t), m.set(e, n);
+}, ve = (e) => m.get(e) ?? [], ye = () => m, be = () => {
+	m.clear();
+}, xe = 63, Se = 60, h = [], g = (e) => {
+	h.includes(e) || h.push(e);
+}, Ce = () => {
+	let e = h.slice();
+	return h.length = 0, e;
+}, we = /^[a-zA-Z_][a-zA-Z0-9_]*$/, _ = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!Se.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) => {
+	if (!we.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_]*$/.`);
+}, 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_]*$/.";
@@ -285,35 +292,35 @@ var r = (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).`);
-}, Ce = 1704067200000n, we = 10n, x = 12n, S = (1n << we) - 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).`);
+}, Te = 1704067200000n, Ee = 10n, S = 12n, C = (1n << Ee) - 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), Te = () => {
-	O = D();
-}, A = () => BigInt(Date.now()), Ee = (e) => {
+	machineId: D()
+}), k, De = () => (k === void 0 && (k = O()), k), Oe = () => {
+	k = O();
+}, A = () => BigInt(Date.now()), ke = (e) => {
 	let t = A();
 	for (; t <= e;) t = A();
 	return t;
 }, j = () => {
-	let e = k(), t = A();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & C, e.sequence === 0n && (t = Ee(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - Ce;
+	let e = De(), t = A();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & w, e.sequence === 0n && (t = ke(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - Te;
 	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();
 }, M = (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;
@@ -322,7 +329,7 @@ var r = (e) => {
 		kind: "typeid",
 		prefix: M(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
 	}), {
@@ -333,7 +340,7 @@ var r = (e) => {
 	switch (e.scheme) {
 		case "typeid": {
 			let n = e.prefix ?? M(t);
-			return e.prefix !== void 0 && b(e.prefix, {
+			return e.prefix !== void 0 && x(e.prefix, {
 				kind: "explicit",
 				tableName: t
 			}), {
@@ -349,7 +356,7 @@ var r = (e) => {
 			generate: e.generate
 		};
 	}
-}, De = (n, r) => {
+}, Ae = (n, r) => {
 	switch (n.kind) {
 		case "typeid": return e(n.prefix).toString();
 		case "ulid": return t();
@@ -358,13 +365,13 @@ var r = (e) => {
 		case "custom": return n.generate(r);
 	}
 }, P = (e) => ({
-	fields: f(e.fields),
+	fields: d(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 }
-}), Oe = P, F = (e) => {
+}), je = P, F = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -374,7 +381,7 @@ var r = (e) => {
 	};
 	for (let t of e) r(t);
 	return n;
-}, ke = (e, ...t) => {
+}, Me = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -385,14 +392,14 @@ var r = (e) => {
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, Ae = (e = "cosine", t = "float32") => {
+}, Ne = (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`;
 	}
-}, je = [
+}, Pe = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -401,7 +408,7 @@ var r = (e) => {
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], I = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, L = (e, t) => `${e}_${t.join("_")}_idx`, Me = (e, t) => `${e}_${t.join("_")}_uq`, R = (e, t, n, r, i) => {
+], I = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, L = (e, t) => `${e}_${t.join("_")}_idx`, Fe = (e, t) => `${e}_${t.join("_")}_uq`, R = (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];
@@ -409,7 +416,7 @@ var r = (e) => {
 	let o = i[a];
 	if (o === void 0) throw Error(`hnsw index '${t}' on table '${e}' references unknown column '${a}'.`);
 	if (o.type !== "vector") throw Error(`hnsw index '${t}' on table '${e}' requires a vector() column — column '${a}' is '${o.type}'. HNSW is the pgvector approximate-nearest-neighbour method and only applies to vectors.`);
-}, Ne = (e, t) => {
+}, Ie = (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,
@@ -427,13 +434,14 @@ var r = (e) => {
 		appliedUniques: e.appliedUniques,
 		appliedFullText: e.appliedFullText,
 		appliedChecks: e.appliedChecks,
+		appliedPluginRefs: e.appliedPluginRefs ?? [],
 		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 (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 z({
 				...e,
 				tableName: e.tableName,
@@ -463,12 +471,12 @@ var r = (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}': '${I(o)}' and '${I(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 ?? L(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (y(e.tableName, t, n.name === void 0, n.fields), R(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), R(e.tableName, t, n.kind, n.fields, r), a.push({
 					name: t,
 					fields: n.fields,
 					...n.kind === void 0 ? {} : { kind: n.kind },
@@ -494,7 +502,7 @@ var r = (e) => {
 			let n, r, i, a = Array.isArray(t[0]);
 			if (a ? (r = t[0], i = t[1], n = L(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), R(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), R(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 z({
 				...e,
 				tableName: e.tableName,
@@ -519,7 +527,7 @@ var r = (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), R(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), R(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 z({
 				...e,
 				tableName: e.tableName,
@@ -543,8 +551,8 @@ var r = (e) => {
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = Me(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 = Fe(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 z({
 				...e,
 				tableName: e.tableName,
@@ -567,7 +575,7 @@ var r = (e) => {
 		uniqueActive: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
 			if (a ? (r = t[0], i = t[1], n = L(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 z({
 				...e,
@@ -591,7 +599,7 @@ var r = (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 z({
 				...e,
 				tableName: e.tableName,
@@ -612,7 +620,7 @@ var r = (e) => {
 		}),
 		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 _(t), z({
+			return v(t), z({
 				...e,
 				previousTableName: t
 			});
@@ -685,13 +693,20 @@ var r = (e) => {
 			validatePatchSchema: n.partial(t)
 		}))
 	};
-}, Pe = (e, t) => {
-	_(e);
-	let n = Ne(f(t), e);
-	for (let t of Object.keys(n)) v(e, t);
+}, Le = (e, t) => {
+	v(e);
+	let n = Object.entries(t).flatMap(([e, t]) => {
+		let n = p(t);
+		return n === void 0 ? [] : [{
+			column: e,
+			...n
+		}];
+	}), r = Ie(d(t), e);
+	for (let t of Object.keys(r)) y(e, t);
 	return z({
+		appliedPluginRefs: n,
 		tableName: e,
-		fields: n,
+		fields: r,
 		isReactive: !0,
 		appliedMixins: [],
 		appliedIndexes: [],
@@ -699,7 +714,7 @@ var r = (e) => {
 		appliedFullText: [],
 		appliedChecks: []
 	});
-}, Fe = (e) => e === "sqlite" || e === "turso", B = (e, t) => {
+}, B = (e) => e === "sqlite" || e === "turso", V = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e}\``;
@@ -708,51 +723,51 @@ var r = (e) => {
 		case "sqlite":
 		case "turso": return `"${e}"`;
 	}
-}, V = Symbol.for("@voltro/database/tableRegistry"), H = globalThis, U = H[V] ?? (H[V] = /* @__PURE__ */ new Map()), W = (e) => {
-	let t = U.get(e.tableName);
+}, H = Symbol.for("@voltro/database/tableRegistry"), U = globalThis, W = U[H] ?? (U[H] = /* @__PURE__ */ new Map()), G = (e) => {
+	let t = W.get(e.tableName);
 	if (t === void 0) {
-		U.set(e.tableName, e);
+		W.set(e.tableName, e);
 		return;
 	}
 	if (t !== e) throw Error(`duplicate table '${e.tableName}' registration: two different table descriptors claim the same name. Rename one or import the shared module that defines it.`);
-}, Ie = (e) => {
-	U.get(e.tableName) === void 0 && U.set(e.tableName, e);
-}, G = (e) => U.get(e), Le = (e) => {
-	let t = U.get(e);
+}, Re = (e) => {
+	W.get(e.tableName) === void 0 && W.set(e.tableName, e);
+}, K = (e) => W.get(e), ze = (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;
-}, Re = () => [...U.values()], ze = () => {
-	U.clear();
-}, Be = (e) => U.get(e)?.isReactive !== !1, Ve = (e) => ({
+}, Be = () => [...W.values()], Ve = () => {
+	W.clear();
+}, He = (e) => W.get(e)?.isReactive !== !1, Ue = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), He = (e, t) => ({
+}), We = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), Ue = (e, t) => ({
+}), Ge = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), We = (e, t) => ({
+}), Ke = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), Ge = (e, t) => ({
+}), qe = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), Ke = (e, t) => ({
+}), Je = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), qe = (e, t) => ({
+}), Ye = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), K = (e) => (...t) => {
+}), q = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return Y({
+	return X({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -764,55 +779,55 @@ var r = (e) => {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, Je = K("union"), Ye = K("union-all"), Xe = K("intersect"), Ze = K("except"), q = (e) => ({ over: (t) => ({
+}, Xe = q("union"), Ze = q("union-all"), Qe = q("intersect"), $e = q("except"), J = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), Qe = (e = "rowNumber") => q({
+}) }), et = (e = "rowNumber") => J({
 	op: "window-row-number",
 	alias: e
-}), $e = (e = "rank") => q({
+}), tt = (e = "rank") => J({
 	op: "window-rank",
 	alias: e
-}), et = (e = "denseRank") => q({
+}), nt = (e = "denseRank") => J({
 	op: "window-dense-rank",
 	alias: e
-}), tt = (e, t = 1, n) => q({
+}), rt = (e, t = 1, n) => J({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), nt = (e, t = 1, n) => q({
+}), it = (e, t = 1, n) => J({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), rt = (e, t) => q({
+}), at = (e, t) => J({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), it = (e, t) => q({
+}), ot = (e, t) => J({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), J = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? G(e)?.appliedFullText?.find((e) => e.name === t);
+}), Y = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? K(e)?.appliedFullText?.find((e) => e.name === t);
 	if (r === void 0) throw Error(`.matching('${t}', ...): no full-text index named '${t}' is declared on table '${e}'. Declare it with \`table(...).fullTextIndex('${t}', [columns])\` first.`);
 	return {
 		columns: r.columns,
 		...r.config === void 0 ? {} : { config: r.config },
 		...r.weights === void 0 ? {} : { weights: r.weights }
 	};
-}, Y = (e) => ({
+}, X = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return Y({
+		return X({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return Y({
+		return X({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -821,37 +836,37 @@ var r = (e) => {
 		});
 	},
 	limit(t) {
-		return Y({
+		return X({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return Y({
+		return X({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return Y({
+		return X({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return Y({
+		return X({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return Y({
+		return X({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	unscoped() {
-		return Y({
+		return X({
 			...e,
 			crossTenant: !0
 		});
@@ -861,13 +876,13 @@ var r = (e) => {
 			...e.eager ?? {},
 			...t
 		};
-		return Y({
+		return X({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return Y({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -881,15 +896,15 @@ var r = (e) => {
 			...t,
 			alias: e
 		}));
-		return Y({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = J(e.table, t, e.fullTextIndexes);
-		return Y({
+		let r = Y(e.table, t, e.fullTextIndexes);
+		return X({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -903,7 +918,7 @@ var r = (e) => {
 	rankBy(t) {
 		let n = e.fullTextSearch;
 		if (n === void 0) throw Error(".rankBy() requires a preceding .matching(...) clause — there is no full-text search to rank on this query.");
-		return Y({
+		return X({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -922,7 +937,7 @@ var r = (e) => {
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return Y({
+			return X({
 				...e,
 				annClause: i
 			});
@@ -934,7 +949,7 @@ var r = (e) => {
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return Y({
+			return X({
 				...e,
 				annClause: r,
 				take: n
@@ -947,7 +962,7 @@ var r = (e) => {
 			column: "",
 			distance: "cosine"
 		};
-		return Y({
+		return X({
 			...e,
 			annClause: {
 				...n,
@@ -956,22 +971,22 @@ var r = (e) => {
 		});
 	},
 	use(t) {
-		return Y({ ...t(e) });
+		return X({ ...t(e) });
 	},
 	distinct() {
-		return Y({
+		return X({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return Y({
+		return X({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return Y({
+		return X({
 			...e,
 			alias: t
 		});
@@ -983,7 +998,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return Y({
+		return X({
 			...e,
 			joins: a
 		});
@@ -995,7 +1010,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return Y({
+		return X({
 			...e,
 			joins: a
 		});
@@ -1005,7 +1020,7 @@ var r = (e) => {
 			outputKey: e,
 			source: t
 		}));
-		return Y({
+		return X({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1014,7 +1029,7 @@ var r = (e) => {
 	withCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.withCte: duplicate CTE name '${t}'`);
-		return Y({
+		return X({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1025,7 +1040,7 @@ var r = (e) => {
 	recursiveCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.recursiveCte: duplicate CTE name '${t}'`);
-		return Y({
+		return X({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1036,20 +1051,20 @@ var r = (e) => {
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return Y({
+		return X({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return Y({
+		return X({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return Y({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1060,8 +1075,8 @@ var r = (e) => {
 		});
 	}
 });
-function X(e) {
-	return Y({
+function Z(e) {
+	return X({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1072,7 +1087,7 @@ function X(e) {
 		sourceTable: e
 	});
 }
-var at = (e, t, n) => Z(e, "id", t, n), Z = (e, t, n, r, i = "asc") => {
+var st = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1087,21 +1102,21 @@ var at = (e, t, n) => Z(e, "id", t, n), Z = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, ot = (e) => {
+}, ct = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) W(r), t[n] = X(r);
+	for (let [n, r] of Object.entries(e)) G(r), t[n] = Z(r);
 	return t;
-}, st = (e) => e.isView === !0, ct = (e, t, n) => {
-	if (_(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
-	let r = f(t);
-	for (let t of Object.keys(r)) v(e, t);
+}, lt = (e) => e.isView === !0, ut = (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 = d(t);
+	for (let t of Object.keys(r)) y(e, t);
 	return {
 		tableName: e,
 		fields: r,
 		isView: !0,
 		viewSelect: n
 	};
-}, lt = (e) => X({
+}, dt = (e) => Z({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1109,8 +1124,8 @@ var at = (e, t, n) => Z(e, "id", t, n), Z = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), ut = (e, t, n = null) => {
-	let r = n === null ? B(e.tableName, t) : `${B(n, t)}.${B(e.tableName, t)}`, i = e.viewSelect.trim();
+}), ft = (e, t, n = null) => {
+	let r = n === null ? V(e.tableName, t) : `${V(n, t)}.${V(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1119,16 +1134,16 @@ var at = (e, t, n) => Z(e, "id", t, n), Z = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, dt = /^[A-Za-z_][A-Za-z0-9_]*$/, ft = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : dt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), pt = (e) => "{" + e.map((e) => {
+}, pt = /^[A-Za-z_][A-Za-z0-9_]*$/, mt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : pt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), ht = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", Q = (e, t, n, r = {}) => {
-	let i = B(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", gt = (e, t, n, r = {}) => {
+	let i = V(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${pt(t)}'::text[])`;
+		let e = `(${i} #>> '${ht(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = ft(t);
+	let o = mt(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1145,10 +1160,10 @@ var at = (e, t, n) => Z(e, "id", t, n), Z = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, mt = (e) => {
+}, _t = (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;
-}, ht = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, gt = (e) => typeof e == "object" && !!e && "id" in e && "up" in e && "down" in e && typeof e.id == "string" && typeof e.up == "function" && typeof e.down == "function", $ = /* @__PURE__ */ new Set(["voltro_isr_cache"]), _t = (e) => $.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), vt = /__dropped_\d{14}$/, yt = (e) => vt.test(e);
+}, vt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, yt = (e) => typeof e == "object" && !!e && "id" in e && "up" in e && "down" in e && typeof e.id == "string" && typeof e.up == "function" && typeof e.down == "function", $ = /* @__PURE__ */ new Set(["voltro_isr_cache"]), bt = (e) => $.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), xt = /__dropped_\d{14}$/, St = (e) => xt.test(e);
 //#endregion
-export { N as $, Qe as A, me as At, W as B, Ke as C, pe as Ct, X as D, ce as Dt, at as E, de as Et, Re as F, oe as Ft, ke as G, Fe as H, ze as I, d as It, Oe as J, Pe as K, Ie as L, rt as M, l as Mt, Je as N, r as Nt, $e as O, f as Ot, Ye as P, s as Pt, De as Q, G as R, nt as S, fe as St, Z as T, ee as Tt, B as U, Le as V, je as W, F as X, P as Y, M as Z, ot as _, le as _t, gt as a, v as at, Xe as b, c as bt, st as c, b as ct, ut as d, he as dt, j as et, We as f, ge as ft, He as g, ae as gt, Ve as h, re as ht, ht as i, xe as it, Ue as j, te as jt, J as k, ne as kt, lt as l, _e as lt, qe as m, ue as mt, _t as n, ye as nt, mt as o, y as ot, it as p, i as pt, Ae as q, yt as r, be as rt, Q as s, _ as st, $ as t, Te as tt, ct as u, ve as ut, et as v, se as vt, Ge as w, o as wt, tt as x, u as xt, Ze as y, ie as yt, Be as z };
+export { N as $, et as A, d as At, G as B, Je as C, l as Ct, Z as D, ee as Dt, st as E, o as Et, Be as F, r as Ft, Me as G, B as H, Ve as I, s as It, je as J, Le as K, Re as L, oe as Lt, at as M, he as Mt, Xe as N, te as Nt, tt as O, fe as Ot, Ze as P, ue as Pt, Ae as Q, K as R, u as Rt, it as S, c as St, Q as T, me as Tt, V as U, ze as V, Pe as W, F as X, P as Y, M as Z, ct as _, re as _t, yt as a, y as at, Qe as b, se as bt, lt as c, x as ct, ft as d, _e as dt, j as et, Ke as f, ve as ft, We as g, de as gt, Ue as h, i as ht, vt as i, Ce as it, Ge as j, ne as jt, Y as k, ce as kt, dt as l, ye as lt, Ye as m, p as mt, bt as n, xe as nt, _t as o, b as ot, ot as p, ge as pt, Ne as q, St as r, Se as rt, gt as s, v as st, $ as t, Oe as tt, ut as u, be as ut, nt as v, ae as vt, qe as w, pe as wt, rt as x, ie as xt, $e as y, le as yt, He as z };