@voltro/database 0.28.0 → 0.30.0

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

@@ -6,7 +6,21 @@ var r = (e) => {
 	let t = [];
 	for (let [n, r] of Object.entries(e.fields)) r.serverOnly === !0 && t.push(n);
 	return t;
-}, i = class e {
+}, i = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) {
+		let e = r.readableBy;
+		e !== void 0 && e.length > 0 && t.push({
+			column: n,
+			scopes: e
+		});
+	}
+	return t;
+}, a = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
+	return t;
+}, o = class e {
 	definition;
 	constructor(e) {
 		this.definition = e;
@@ -32,6 +46,15 @@ var r = (e) => {
 			serverOnly: !0
 		});
 	}
+	readableBy(...t) {
+		if (this.rejectIfRaw("readableBy"), t.length === 0) throw Error(".readableBy() needs at least one scope — a column readable by nobody is .serverOnly(). List the scopes that may read it, e.g. .readableBy('billing:read').");
+		if (t.find((e) => typeof e != "string" || e.trim() === "") !== void 0) throw Error(`.readableBy(...) rejects a blank scope — every scope must be a non-empty string (a blank scope can never be held, so it would hide the column from everyone). Got: ${JSON.stringify(t)}.`);
+		let n = [...new Set(t)];
+		return new e({
+			...this.definition,
+			readableBy: n
+		});
+	}
 	version() {
 		if (this.rejectIfRaw("version"), this.definition.type !== "integer") throw Error(`.version() requires an integer() column (got ${this.definition.type}). The store increments it, so it has to be a number — and a timestamp version reintroduces exactly the clock problem optimistic locking exists to avoid: two writes in the same millisecond are indistinguishable, and replica clocks disagree.`);
 		return new e({
@@ -150,21 +173,21 @@ var r = (e) => {
 	__definition() {
 		return this.definition;
 	}
-}, a = (e) => new i({
+}, s = (e) => new o({
 	type: e,
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1
-}), o = (e) => new i({
+}), ee = (e) => new o({
 	type: "id",
 	nullable: !1,
 	unique: !0,
 	hasDefault: !1,
 	idSchemeInput: e
-}), s = () => a("text"), ee = () => a("integer"), te = () => a("real"), c = (e, t = 0) => {
+}), c = () => s("text"), te = () => s("integer"), ne = () => s("real"), l = (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 i({
+	return new o({
 		type: "decimal",
 		nullable: !1,
 		unique: !1,
@@ -172,12 +195,12 @@ var r = (e) => {
 		precision: e,
 		scale: t
 	});
-}, ne = c, re = () => a("bigint"), ie = (e, t) => {
+}, re = l, ie = () => s("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 i({
+		column: () => new o({
 			type: "enum",
 			nullable: !1,
 			unique: !1,
@@ -186,7 +209,13 @@ var r = (e) => {
 			enumValues: t
 		})
 	};
-}, ae = () => a("boolean"), oe = () => a("timestamp"), se = () => a("date"), ce = () => a("json"), le = () => a("bytes"), ue = (e, t) => new i({
+}, oe = () => s("boolean"), se = () => s("timestamp"), ce = () => s("date"), le = () => s("json"), ue = () => s("bytes"), u = () => new o({
+	type: "bytes",
+	nullable: !0,
+	unique: !1,
+	hasDefault: !1,
+	crdtManaged: !0
+}), d = (e, t) => new o({
 	type: "reference",
 	nullable: !1,
 	unique: !1,
@@ -196,15 +225,15 @@ var r = (e) => {
 	refOnUpdate: t?.onUpdate ?? "noAction",
 	fkAutoIndex: t?.index ?? !0,
 	...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
-}), l = () => new i({
+}), de = () => new o({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), u = (e, t) => {
+}), fe = (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({
+	return new o({
 		type: "vector",
 		nullable: !1,
 		unique: !1,
@@ -212,13 +241,13 @@ var r = (e) => {
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, de = (e) => new i({
+}, pe = (e) => new o({
 	type: "array",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	arrayElement: e.__definition().type
-}), fe = () => a("interval"), pe = (e, t = 4326) => new i({
+}), me = () => s("interval"), he = (e, t = 4326) => new o({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -228,7 +257,7 @@ var r = (e) => {
 		geomKind: e,
 		srid: t
 	}
-}), me = (e, t = 4326) => new i({
+}), ge = (e, t = 4326) => new o({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -238,51 +267,51 @@ var r = (e) => {
 		geomKind: e,
 		srid: t
 	}
-}), he = (e) => new i({
+}), _e = (e) => new o({
 	type: "raw",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	rawDdl: e
-}), d = (e) => {
+}), f = (e) => {
 	let t = {};
 	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
 	return 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, {
+}, p = /* @__PURE__ */ new WeakMap(), m = (e) => typeof e == "object" && e ? p.get(e) : void 0, ve = (e, t = {}) => {
+	let n = c();
+	return p.set(n, {
 		target: e,
 		orphanPolicy: t.orphanPolicy ?? "keep",
 		onSoftDelete: t.onSoftDelete ?? !1
 	}), n;
-}, m = /* @__PURE__ */ new Map(), _e = (e, t) => {
+}, h = /* @__PURE__ */ new Map(), ye = (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 = m.get(e) ?? [];
+	let n = h.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), 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) => {
+	n.push(t), h.set(e, n);
+}, be = (e) => h.get(e) ?? [], xe = () => h, Se = () => {
+	h.clear();
+}, Ce = 63, we = 60, g = [], _ = (e) => {
+	g.includes(e) || g.push(e);
+}, Te = () => {
+	let e = g.slice();
+	return g.length = 0, e;
+}, Ee = /^[a-zA-Z_][a-zA-Z0-9_]*$/, v = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	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 (!Ee.test(t)) throw Error(`${e} '${t}' contains characters outside [A-Za-z0-9_] or starts with a digit. Dialect-portable identifiers must match /^[a-zA-Z_][a-zA-Z0-9_]*$/.`);
+}, 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 (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_]*$/.";
@@ -292,35 +321,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 && 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 = () => {
+	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).`);
+}, C = 1704067200000n, w = 10n, T = 12n, E = (1n << w) - 1n, D = (1n << T) - 1n, De = T, Oe = 22n, ke = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > C) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${C}.`);
+	if (t < 0n || t > E) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${E}.`);
 	return t;
 }, O = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: D()
-}), k, De = () => (k === void 0 && (k = O()), k), Oe = () => {
+	machineId: ke()
+}), k, Ae = () => (k === void 0 && (k = O()), k), je = () => {
 	k = O();
-}, A = () => BigInt(Date.now()), ke = (e) => {
+}, A = () => BigInt(Date.now()), Me = (e) => {
 	let t = A();
 	for (; t <= e;) t = A();
 	return t;
 }, j = () => {
-	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;
+	let e = Ae(), t = A();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & D, e.sequence === 0n && (t = Me(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - C;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << E | e.machineId << T | e.sequence).toString();
+	return (n << Oe | e.machineId << De | 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 x(n, {
+	return S(n, {
 		kind: "derived",
 		tableName: e
 	}), n;
@@ -329,7 +358,7 @@ var r = (e) => {
 		kind: "typeid",
 		prefix: M(t)
 	};
-	if ("prefix" in e && !("scheme" in e)) return x(e.prefix, {
+	if ("prefix" in e && !("scheme" in e)) return S(e.prefix, {
 		kind: "explicit",
 		tableName: t
 	}), {
@@ -340,7 +369,7 @@ var r = (e) => {
 	switch (e.scheme) {
 		case "typeid": {
 			let n = e.prefix ?? M(t);
-			return e.prefix !== void 0 && x(e.prefix, {
+			return e.prefix !== void 0 && S(e.prefix, {
 				kind: "explicit",
 				tableName: t
 			}), {
@@ -356,7 +385,7 @@ var r = (e) => {
 			generate: e.generate
 		};
 	}
-}, Ae = (n, r) => {
+}, Ne = (n, r) => {
 	switch (n.kind) {
 		case "typeid": return e(n.prefix).toString();
 		case "ulid": return t();
@@ -365,13 +394,13 @@ var r = (e) => {
 		case "custom": return n.generate(r);
 	}
 }, P = (e) => ({
-	fields: d(e.fields),
+	fields: f(e.fields),
 	...e.id === void 0 ? {} : { id: e.id },
 	...e.requires === void 0 ? {} : { requires: e.requires },
 	...e.indexes === void 0 ? {} : { indexes: e.indexes },
 	...e.behaviors === void 0 ? {} : { behaviors: e.behaviors },
 	...e.policies === void 0 ? {} : { policies: e.policies }
-}), je = P, F = (e) => {
+}), Pe = P, F = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -381,7 +410,7 @@ var r = (e) => {
 	};
 	for (let t of e) r(t);
 	return n;
-}, Me = (e, ...t) => {
+}, Fe = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -392,14 +421,14 @@ var r = (e) => {
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, Ne = (e = "cosine", t = "float32") => {
+}, Ie = (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`;
 	}
-}, Pe = [
+}, Le = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -408,7 +437,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`, Fe = (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`, Re = (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];
@@ -416,14 +445,14 @@ 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.`);
-}, Ie = (e, t) => {
+}, z = (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: N(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, z = (e) => {
+}, B = (e) => {
 	let t = e.appliedPrimaryKey ?? [];
 	return {
 		tableName: e.tableName,
@@ -434,6 +463,7 @@ var r = (e) => {
 		appliedUniques: e.appliedUniques,
 		appliedFullText: e.appliedFullText,
 		appliedChecks: e.appliedChecks,
+		appliedRules: e.appliedRules ?? [],
 		appliedPluginRefs: e.appliedPluginRefs ?? [],
 		appliedPrimaryKey: t,
 		...e.previousTableName === void 0 ? {} : { previousTableName: e.previousTableName },
@@ -441,8 +471,8 @@ var r = (e) => {
 		...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema },
 		fullTextIndex: ((t, n, r) => {
 			if (n.length === 0) throw Error(`fullTextIndex '${t}' on '${e.tableName}' has no columns.`);
-			if (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({
+			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 B({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -471,19 +501,19 @@ 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.`);
-				y(e.tableName, n), r[n] = a, i.set(n, t);
+				b(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) || (b(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) || (x(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 },
 					...n.kindOptions === void 0 ? {} : { kindOptions: n.kindOptions }
 				}));
 			}
-			return z({
+			return B({
 				...e,
 				tableName: e.tableName,
 				fields: r,
@@ -502,8 +532,8 @@ 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 (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({
+			if (x(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 B({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -527,8 +557,8 @@ 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 (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({
+			if (x(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 B({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -551,9 +581,9 @@ var r = (e) => {
 		}),
 		unique: ((...t) => {
 			let n, r, i, a = Array.isArray(t[0]);
-			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({
+			if (a ? (r = t[0], i = t[1], n = Re(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 B({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -575,9 +605,9 @@ 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 (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).`);
+			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).`);
 			let o = i?.where ?? "\"deletedAt\" IS NULL";
-			return z({
+			return B({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -599,8 +629,8 @@ var r = (e) => {
 		}),
 		check: ((t, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
-			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({
+			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 B({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -618,9 +648,22 @@ var r = (e) => {
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
+		rule: ((t, n, r) => {
+			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 B({
+				...e,
+				appliedRules: [...i, {
+					name: t,
+					predicate: n,
+					severity: r?.severity ?? "error"
+				}]
+			});
+		}),
 		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 v(t), z({
+			return y(t), B({
 				...e,
 				previousTableName: t
 			});
@@ -635,7 +678,7 @@ var r = (e) => {
 			}
 			if (t.length > 0) throw Error(`primaryKey([...]) declared twice on table '${e.tableName}'.`);
 			for (let [t, r] of Object.entries(e.fields)) if (r.type === "id" && !n.includes(t)) throw Error(`primaryKey([...]) on table '${e.tableName}' conflicts with the id() column '${t}'. A composite primary key IS the key — drop the id() column, or include '${t}' in the composite key.`);
-			return z({
+			return B({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -650,7 +693,7 @@ var r = (e) => {
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
-		nonReactive: (() => z({
+		nonReactive: (() => B({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -664,7 +707,7 @@ var r = (e) => {
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validate: ((t) => z({
+		validate: ((t) => B({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -678,7 +721,7 @@ var r = (e) => {
 			insertSchema: t,
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validatePatch: ((t) => z({
+		validatePatch: ((t) => B({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -693,17 +736,17 @@ var r = (e) => {
 			validatePatchSchema: n.partial(t)
 		}))
 	};
-}, Le = (e, t) => {
-	v(e);
+}, ze = (e, t) => {
+	y(e);
 	let n = Object.entries(t).flatMap(([e, t]) => {
-		let n = p(t);
+		let n = m(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({
+	}), r = z(f(t), e);
+	for (let t of Object.keys(r)) b(e, t);
+	return B({
 		appliedPluginRefs: n,
 		tableName: e,
 		fields: r,
@@ -712,9 +755,10 @@ var r = (e) => {
 		appliedIndexes: [],
 		appliedUniques: [],
 		appliedFullText: [],
-		appliedChecks: []
+		appliedChecks: [],
+		appliedRules: []
 	});
-}, B = (e) => e === "sqlite" || e === "turso", V = (e, t) => {
+}, Be = (e) => e === "sqlite" || e === "turso", V = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e}\``;
@@ -730,38 +774,38 @@ var r = (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.`);
-}, Re = (e) => {
+}, Ve = (e) => {
 	W.get(e.tableName) === void 0 && W.set(e.tableName, e);
-}, K = (e) => W.get(e), ze = (e) => {
+}, K = (e) => W.get(e), He = (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;
-}, Be = () => [...W.values()], Ve = () => {
+}, Ue = () => [...W.values()], We = () => {
 	W.clear();
-}, He = (e) => W.get(e)?.isReactive !== !1, Ue = (e) => ({
+}, Ge = (e) => W.get(e)?.isReactive !== !1, Ke = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), We = (e, t) => ({
+}), qe = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), Ge = (e, t) => ({
+}), Je = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), Ke = (e, t) => ({
+}), Ye = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), qe = (e, t) => ({
+}), Xe = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), Je = (e, t) => ({
+}), Ze = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), Ye = (e, t) => ({
+}), Qe = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
@@ -779,33 +823,33 @@ var r = (e) => {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, Xe = q("union"), Ze = q("union-all"), Qe = q("intersect"), $e = q("except"), J = (e) => ({ over: (t) => ({
+}, $e = q("union"), et = q("union-all"), tt = q("intersect"), nt = q("except"), J = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), et = (e = "rowNumber") => J({
+}) }), rt = (e = "rowNumber") => J({
 	op: "window-row-number",
 	alias: e
-}), tt = (e = "rank") => J({
+}), it = (e = "rank") => J({
 	op: "window-rank",
 	alias: e
-}), nt = (e = "denseRank") => J({
+}), at = (e = "denseRank") => J({
 	op: "window-dense-rank",
 	alias: e
-}), rt = (e, t = 1, n) => J({
+}), ot = (e, t = 1, n) => J({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), it = (e, t = 1, n) => J({
+}), st = (e, t = 1, n) => J({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), at = (e, t) => J({
+}), ct = (e, t) => J({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), ot = (e, t) => J({
+}), lt = (e, t) => J({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
@@ -1087,7 +1131,7 @@ function Z(e) {
 		sourceTable: e
 	});
 }
-var st = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
+var ut = (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
@@ -1102,21 +1146,21 @@ var st = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, ct = (e) => {
+}, dt = (e) => {
 	let t = {};
 	for (let [n, r] of Object.entries(e)) G(r), t[n] = Z(r);
 	return 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);
+}, ft = (e) => e.isView === !0, pt = (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);
 	return {
 		tableName: e,
 		fields: r,
 		isView: !0,
 		viewSelect: n
 	};
-}, dt = (e) => Z({
+}, mt = (e) => Z({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1124,7 +1168,7 @@ var st = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), ft = (e, t, n = null) => {
+}), ht = (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":
@@ -1134,16 +1178,16 @@ var st = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, 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) => {
+}, gt = /^[A-Za-z_][A-Za-z0-9_]*$/, _t = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : gt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), vt = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", gt = (e, t, n, r = {}) => {
+}).join(",") + "}", yt = (e, t, n, r = {}) => {
 	let i = V(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${ht(t)}'::text[])`;
+		let e = `(${i} #>> '${vt(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = mt(t);
+	let o = _t(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1160,10 +1204,10 @@ var st = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, _t = (e) => {
+}, bt = (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;
-}, 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);
+}, xt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, St = (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"]), Ct = (e) => $.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), wt = /__dropped_\d{14}$/, Tt = (e) => wt.test(e);
 //#endregion
-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 };
+export { N as $, rt as A, me as At, G as B, se as Bt, Ze as C, ae as Ct, Z as D, ge as Dt, ut as E, he as Et, Ue as F, i as Ft, Fe as G, Be as H, We as I, ne as It, Pe as J, ze as K, Ve as L, d as Lt, ct as M, f as Mt, $e as N, re as Nt, it as O, ee as Ot, et as P, _e as Pt, Ne as Q, K as R, r as Rt, st as S, ce as St, Q as T, de as Tt, V as U, He as V, fe as Vt, Le as W, F as X, P as Y, M as Z, dt as _, ie as _t, St as a, b as at, tt as b, a as bt, ft as c, S as ct, ht as d, ye as dt, j as et, Ye as f, be as ft, qe as g, pe as gt, Ke as h, o as ht, xt as i, Te as it, Je as j, le as jt, Y as k, te as kt, mt as l, xe as lt, Qe as m, m as mt, Ct as n, Ce as nt, bt as o, x as ot, lt as p, ve as pt, Ie as q, Tt as r, we as rt, yt as s, y as st, $ as t, je as tt, pt as u, Se as ut, at as v, oe as vt, Xe as w, l as wt, ot as x, u as xt, nt as y, ue as yt, Ge as z, c as zt };