@voltro/database 0.63.0 → 0.64.0

package/dist/{frameworkLiveTables-X6rOAleu.js → frameworkLiveTables-BURogL9N.js}

@@ -221,19 +221,21 @@ var r = (e) => {
 			enumValues: t
 		})
 	};
-}, oe = () => c("boolean"), se = () => c("timestamp"), ce = () => c("date"), le = () => c("json"), ue = () => c("bytes"), d = () => new s({
+}, oe = () => c("boolean"), se = () => c("timestamp"), ce = () => c("date"), le = () => c("json"), ue = () => c("bytes"), de = () => new s({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), de = () => new s({
+}), fe = () => new s({
 	type: "bytes",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	crdtManaged: !0
-}), fe = (e, t) => new s({
+}), d = () => {
+	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");
+}, pe = (e) => f(d, e), f = (e, t) => new s({
 	type: "reference",
 	nullable: !1,
 	unique: !1,
@@ -241,15 +243,16 @@ var r = (e) => {
 	references: e,
 	onDelete: t?.onDelete ?? "restrict",
 	refOnUpdate: t?.onUpdate ?? "noAction",
+	...t?.onSoftDelete === void 0 ? {} : { refOnSoftDelete: t.onSoftDelete },
 	fkAutoIndex: t?.index ?? !0,
 	...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
-}), pe = () => new s({
+}), me = () => new s({
 	type: "text",
 	nullable: !0,
 	unique: !1,
 	hasDefault: !1,
 	dropped: !0
-}), me = (e, t) => {
+}), he = (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 s({
 		type: "vector",
@@ -259,13 +262,13 @@ var r = (e) => {
 		vectorDim: e,
 		vectorPrecision: t?.precision ?? "float32"
 	});
-}, he = (e) => new s({
+}, ge = (e) => new s({
 	type: "array",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	arrayElement: e.__definition().type
-}), ge = () => c("interval"), _e = (e, t = 4326) => new s({
+}), _e = () => c("interval"), ve = (e, t = 4326) => new s({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -275,7 +278,7 @@ var r = (e) => {
 		geomKind: e,
 		srid: t
 	}
-}), ve = (e, t = 4326) => new s({
+}), ye = (e, t = 4326) => new s({
 	type: "text",
 	nullable: !1,
 	unique: !1,
@@ -285,51 +288,51 @@ var r = (e) => {
 		geomKind: e,
 		srid: t
 	}
-}), ye = (e) => new s({
+}), be = (e) => new s({
 	type: "raw",
 	nullable: !1,
 	unique: !1,
 	hasDefault: !1,
 	rawDdl: e
-}), f = (e) => {
+}), p = (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, be = (e, t = {}) => {
+}, m = /* @__PURE__ */ new WeakMap(), h = (e) => typeof e == "object" && e ? m.get(e) : void 0, xe = (e, t = {}) => {
 	let n = l();
-	return p.set(n, {
+	return m.set(n, {
 		target: e,
 		orphanPolicy: t.orphanPolicy ?? "keep",
 		onSoftDelete: t.onSoftDelete ?? !1
 	}), n;
-}, h = /* @__PURE__ */ new Map(), xe = (e, t) => {
+}, g = /* @__PURE__ */ new Map(), Se = (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 = g.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);
-}, Se = (e) => h.get(e) ?? [], Ce = () => h, we = () => {
-	h.clear();
-}, Te = 63, Ee = 60, g = [], _ = (e) => {
-	g.includes(e) || g.push(e);
-}, De = () => {
-	let e = g.slice();
-	return g.length = 0, e;
-}, Oe = /^[a-zA-Z_][a-zA-Z0-9_]*$/, v = (e, t) => {
+	n.push(t), g.set(e, n);
+}, Ce = (e) => g.get(e) ?? [], we = () => g, Te = () => {
+	g.clear();
+}, Ee = 63, De = 60, _ = [], v = (e) => {
+	_.includes(e) || _.push(e);
+}, Oe = () => {
+	let e = _.slice();
+	return _.length = 0, e;
+}, ke = /^[a-zA-Z_][a-zA-Z0-9_]*$/, y = (e, t) => {
 	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!Oe.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 (!ke.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_]*$/.`);
+}, b = (e) => {
+	if (y("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 && v(`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.`);
+}, x = (e, t) => {
+	if (y("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 && v(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
+}, S = (e, t, n, r) => {
+	if (y("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 && v(`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.` : ""}`);
+}, C = (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_]*$/.";
@@ -339,44 +342,44 @@ 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 && _(`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).`);
-}, ke = 1704067200000n, Ae = 10n, C = 12n, w = (1n << Ae) - 1n, je = (1n << C) - 1n, Me = C, Ne = 22n, Pe = () => {
+	e.length > 60 && v(`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).`);
+}, Ae = 1704067200000n, je = 10n, w = 12n, T = (1n << je) - 1n, Me = (1n << w) - 1n, Ne = w, Pe = 22n, Fe = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > w) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${w}.`);
+	if (t < 0n || t > T) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${T}.`);
 	return t;
-}, T = () => ({
+}, E = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: Pe()
-}), E, Fe = () => (E === void 0 && (E = T()), E), Ie = () => {
-	E = T();
-}, D = () => BigInt(Date.now()), Le = (e) => {
-	let t = D();
-	for (; t <= e;) t = D();
+	machineId: Fe()
+}), D, Ie = () => (D === void 0 && (D = E()), D), Le = () => {
+	D = E();
+}, O = () => BigInt(Date.now()), Re = (e) => {
+	let t = O();
+	for (; t <= e;) t = O();
 	return t;
-}, O = () => {
-	let e = Fe(), t = D();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & je, e.sequence === 0n && (t = Le(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - ke;
+}, k = () => {
+	let e = Ie(), t = O();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & Me, e.sequence === 0n && (t = Re(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - Ae;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Ne | e.machineId << Me | e.sequence).toString();
-}, k = (e) => {
+	return (n << Pe | e.machineId << Ne | e.sequence).toString();
+}, A = (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 C(n, {
 		kind: "derived",
 		tableName: e
 	}), n;
-}, A = (e, t) => {
+}, j = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: k(t)
+		prefix: A(t)
 	};
-	if ("prefix" in e && !("scheme" in e)) return S(e.prefix, {
+	if ("prefix" in e && !("scheme" in e)) return C(e.prefix, {
 		kind: "explicit",
 		tableName: t
 	}), {
@@ -386,8 +389,8 @@ var r = (e) => {
 	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
 	switch (e.scheme) {
 		case "typeid": {
-			let n = e.prefix ?? k(t);
-			return e.prefix !== void 0 && S(e.prefix, {
+			let n = e.prefix ?? A(t);
+			return e.prefix !== void 0 && C(e.prefix, {
 				kind: "explicit",
 				tableName: t
 			}), {
@@ -403,22 +406,22 @@ var r = (e) => {
 			generate: e.generate
 		};
 	}
-}, Re = (e, r) => {
+}, ze = (e, r) => {
 	switch (e.kind) {
 		case "typeid": return t(e.prefix).toString();
 		case "ulid": return n();
 		case "numeric": return null;
-		case "snowflake": return O();
+		case "snowflake": return k();
 		case "custom": return e.generate(r);
 	}
-}, j = (e) => ({
-	fields: f(e.fields),
+}, M = (e) => ({
+	fields: p(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 }
-}), ze = j, M = (e) => {
+}), Be = M, N = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -428,7 +431,7 @@ var r = (e) => {
 	};
 	for (let t of e) r(t);
 	return n;
-}, Be = (e, ...t) => {
+}, Ve = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -439,14 +442,14 @@ var r = (e) => {
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, Ve = (e = "cosine", t = "float32") => {
+}, He = (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`;
 	}
-}, He = [
+}, Ue = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -455,7 +458,7 @@ var r = (e) => {
 	"updatedBy",
 	"deletedAt",
 	"deletedBy"
-], N = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, P = (e, t) => `${e}_${t.join("_")}_idx`, Ue = (e, t) => `${e}_${t.join("_")}_uq`, F = (e, t, n, r, i) => {
+], P = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, F = (e, t) => `${e}_${t.join("_")}_idx`, We = (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];
@@ -463,14 +466,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.`);
-}, We = (e, t) => {
+}, Ge = (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: A(i.idSchemeInput, t)
+		idScheme: j(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, I = (t) => {
+}, L = (t) => {
 	let n = t.appliedPrimaryKey ?? [];
 	return {
 		tableName: t.tableName,
@@ -489,8 +492,8 @@ var r = (e) => {
 		...t.validatePatchSchema === void 0 ? {} : { validatePatchSchema: t.validatePatchSchema },
 		fullTextIndex: ((e, n, r) => {
 			if (n.length === 0) throw Error(`fullTextIndex '${e}' on '${t.tableName}' has no columns.`);
-			if (x(t.tableName, e, !1, n), t.appliedFullText.some((t) => t.name === e)) throw Error(`duplicate full-text index '${e}' on table '${t.tableName}'.`);
-			return I({
+			if (S(t.tableName, e, !1, n), t.appliedFullText.some((t) => t.name === e)) throw Error(`duplicate full-text index '${e}' on table '${t.tableName}'.`);
+			return L({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -511,27 +514,27 @@ var r = (e) => {
 			});
 		}),
 		with: ((...e) => {
-			let n = M(e), r = { ...t.fields }, i = /* @__PURE__ */ new Map();
+			let n = N(e), r = { ...t.fields }, i = /* @__PURE__ */ new Map();
 			for (let e of Object.keys(r)) i.set(e, {
 				id: "<table>",
 				fields: {}
 			});
 			for (let e of n) for (let [n, a] of Object.entries(e.fields)) {
 				let o = i.get(n);
-				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${t.tableName}': '${N(o)}' and '${N(e)}' 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(t.tableName, n), r[n] = a, i.set(n, e);
+				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${t.tableName}': '${P(o)}' and '${P(e)}' 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.`);
+				x(t.tableName, n), r[n] = a, i.set(n, e);
 			}
 			let a = [...t.appliedIndexes];
 			for (let e of n) for (let n of e.indexes ?? []) {
-				let e = n.name ?? P(t.tableName, n.fields);
-				a.some((t) => t.name === e) || (x(t.tableName, e, n.name === void 0, n.fields), F(t.tableName, e, n.kind, n.fields, r), a.push({
+				let e = n.name ?? F(t.tableName, n.fields);
+				a.some((t) => t.name === e) || (S(t.tableName, e, n.name === void 0, n.fields), I(t.tableName, e, n.kind, n.fields, r), a.push({
 					name: e,
 					fields: n.fields,
 					...n.kind === void 0 ? {} : { kind: n.kind },
 					...n.kindOptions === void 0 ? {} : { kindOptions: n.kindOptions }
 				}));
 			}
-			return I({
+			return L({
 				...t,
 				tableName: t.tableName,
 				fields: r,
@@ -548,10 +551,10 @@ var r = (e) => {
 		}),
 		index: ((...e) => {
 			let n, r, i, a = Array.isArray(e[0]);
-			if (a ? (r = e[0], i = e[1], n = P(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`index '${n}' on table '${t.tableName}' has no fields — an index must cover at least one column.`);
+			if (a ? (r = e[0], i = e[1], n = F(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`index '${n}' on table '${t.tableName}' has no fields — an index must cover at least one column.`);
 			let o = r.filter((e) => typeof e == "string");
-			if (x(t.tableName, n, a, o), F(t.tableName, n, i?.kind, r, t.fields), t.appliedIndexes.some((e) => e.name === n)) throw e.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${t.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 '${t.tableName}': each index name must be unique within a table.`);
-			return I({
+			if (S(t.tableName, n, a, o), I(t.tableName, n, i?.kind, r, t.fields), t.appliedIndexes.some((e) => e.name === n)) throw e.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${t.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 '${t.tableName}': each index name must be unique within a table.`);
+			return L({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -575,8 +578,8 @@ var r = (e) => {
 		expressionIndex: ((e, n, r) => {
 			if (n.length === 0) throw Error(`expressionIndex '${e}' on table '${t.tableName}' has no fields — an index must cover at least one column or expression.`);
 			let i = n.filter((e) => typeof e == "string");
-			if (x(t.tableName, e, !1, i), F(t.tableName, e, r?.kind, n, t.fields), t.appliedIndexes.some((t) => t.name === e)) throw Error(`duplicate index '${e}' on table '${t.tableName}': each index name must be unique within a table.`);
-			return I({
+			if (S(t.tableName, e, !1, i), I(t.tableName, e, r?.kind, n, t.fields), t.appliedIndexes.some((t) => t.name === e)) throw Error(`duplicate index '${e}' on table '${t.tableName}': each index name must be unique within a table.`);
+			return L({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -599,9 +602,9 @@ var r = (e) => {
 		}),
 		unique: ((...e) => {
 			let n, r, i, a = Array.isArray(e[0]);
-			if (a ? (r = e[0], i = e[1], n = Ue(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`unique '${n}' on table '${t.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
-			if (x(t.tableName, n, a, r), t.appliedUniques.some((e) => e.name === n)) throw Error(a ? `duplicate auto-named UNIQUE '${n}' on table '${t.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 '${t.tableName}': each constraint name must be unique within a table.`);
-			return I({
+			if (a ? (r = e[0], i = e[1], n = We(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`unique '${n}' on table '${t.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
+			if (S(t.tableName, n, a, r), t.appliedUniques.some((e) => e.name === n)) throw Error(a ? `duplicate auto-named UNIQUE '${n}' on table '${t.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 '${t.tableName}': each constraint name must be unique within a table.`);
+			return L({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -622,10 +625,10 @@ var r = (e) => {
 		}),
 		uniqueActive: ((...e) => {
 			let n, r, i, a = Array.isArray(e[0]);
-			if (a ? (r = e[0], i = e[1], n = P(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${t.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
-			if (x(t.tableName, n, a, r), t.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${t.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
+			if (a ? (r = e[0], i = e[1], n = F(t.tableName, r)) : (n = e[0], r = e[1], i = e[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${t.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
+			if (S(t.tableName, n, a, r), t.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${t.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
 			let o = i?.where ?? "\"deletedAt\" IS NULL";
-			return I({
+			return L({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -647,8 +650,8 @@ var r = (e) => {
 		}),
 		check: ((e, n) => {
 			if (n.trim().length === 0) throw Error(`CHECK '${e}' on table '${t.tableName}' has an empty expression.`);
-			if (x(t.tableName, e, !1, []), t.appliedChecks.some((t) => t.name === e)) throw Error(`duplicate CHECK '${e}' on table '${t.tableName}': each constraint name must be unique within a table.`);
-			return I({
+			if (S(t.tableName, e, !1, []), t.appliedChecks.some((t) => t.name === e)) throw Error(`duplicate CHECK '${e}' on table '${t.tableName}': each constraint name must be unique within a table.`);
+			return L({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -670,7 +673,7 @@ var r = (e) => {
 			if (e.trim().length === 0) throw Error(`rule on table '${t.tableName}' has an empty name.`);
 			let i = t.appliedRules ?? [];
 			if (i.some((t) => t.name === e)) throw Error(`duplicate rule '${e}' on table '${t.tableName}': each rule name must be unique within a table.`);
-			return I({
+			return L({
 				...t,
 				appliedRules: [...i, {
 					name: e,
@@ -681,7 +684,7 @@ var r = (e) => {
 		}),
 		renamedFrom: ((e) => {
 			if (e === t.tableName) throw Error(`renamedFrom('${e}') on table '${t.tableName}' names the table itself — drop the marker, there is nothing to rename.`);
-			return y(e), I({
+			return b(e), L({
 				...t,
 				previousTableName: e
 			});
@@ -696,7 +699,7 @@ var r = (e) => {
 			}
 			if (n.length > 0) throw Error(`primaryKey([...]) declared twice on table '${t.tableName}'.`);
 			for (let [n, r] of Object.entries(t.fields)) if (r.type === "id" && !e.includes(n)) throw Error(`primaryKey([...]) on table '${t.tableName}' conflicts with the id() column '${n}'. A composite primary key IS the key — drop the id() column, or include '${n}' in the composite key.`);
-			return I({
+			return L({
 				...t,
 				tableName: t.tableName,
 				fields: t.fields,
@@ -711,7 +714,7 @@ var r = (e) => {
 				...t.validatePatchSchema === void 0 ? {} : { validatePatchSchema: t.validatePatchSchema }
 			});
 		}),
-		nonReactive: (() => I({
+		nonReactive: (() => L({
 			...t,
 			tableName: t.tableName,
 			fields: t.fields,
@@ -725,7 +728,7 @@ var r = (e) => {
 			...t.insertSchema === void 0 ? {} : { insertSchema: t.insertSchema },
 			...t.validatePatchSchema === void 0 ? {} : { validatePatchSchema: t.validatePatchSchema }
 		})),
-		validate: ((e) => I({
+		validate: ((e) => L({
 			...t,
 			tableName: t.tableName,
 			fields: t.fields,
@@ -739,7 +742,7 @@ var r = (e) => {
 			insertSchema: e,
 			...t.validatePatchSchema === void 0 ? {} : { validatePatchSchema: t.validatePatchSchema }
 		})),
-		validatePatch: ((n) => I({
+		validatePatch: ((n) => L({
 			...t,
 			tableName: t.tableName,
 			fields: t.fields,
@@ -754,17 +757,22 @@ var r = (e) => {
 			validatePatchSchema: e.partial(n)
 		}))
 	};
-}, Ge = (e, t) => {
-	y(e);
+}, Ke = (e, t) => {
+	b(e);
 	let n = Object.entries(t).flatMap(([e, t]) => {
-		let n = m(t);
+		let n = h(t);
 		return n === void 0 ? [] : [{
 			column: e,
 			...n
 		}];
-	}), r = We(f(t), e);
-	for (let t of Object.keys(r)) b(e, t);
-	return I({
+	}), r = Ge(p(t), e);
+	for (let t of Object.keys(r)) x(e, t);
+	let i;
+	for (let [t, n] of Object.entries(r)) n.references === d && (n.references = () => {
+		if (i === void 0) throw Error(`selfReference() on '${e}.${t}' read before table() returned`);
+		return i;
+	});
+	return i = L({
 		appliedPluginRefs: n,
 		tableName: e,
 		fields: r,
@@ -775,8 +783,8 @@ var r = (e) => {
 		appliedFullText: [],
 		appliedChecks: [],
 		appliedRules: []
-	});
-}, Ke = (e) => e === "sqlite" || e === "turso", qe = (e) => e === "mysql" || e === "mariadb", L = (e, t) => {
+	}), i;
+}, qe = (e) => e === "sqlite" || e === "turso", Je = (e) => e === "mysql" || e === "mariadb", R = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e}\``;
@@ -785,51 +793,51 @@ var r = (e) => {
 		case "sqlite":
 		case "turso": return `"${e}"`;
 	}
-}, Je = 1e4, R = Symbol.for("@voltro/database/tableRegistry"), z = globalThis, B = z[R] ?? (z[R] = /* @__PURE__ */ new Map()), V = (e) => {
-	let t = B.get(e.tableName);
+}, Ye = 1e4, z = Symbol.for("@voltro/database/tableRegistry"), B = globalThis, V = B[z] ?? (B[z] = /* @__PURE__ */ new Map()), H = (e) => {
+	let t = V.get(e.tableName);
 	if (t === void 0) {
-		B.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.`);
-}, Ye = (e) => {
-	B.get(e.tableName) === void 0 && B.set(e.tableName, e);
-}, H = (e) => B.get(e), Xe = (e) => {
-	let t = B.get(e);
+}, Xe = (e) => {
+	V.get(e.tableName) === void 0 && V.set(e.tableName, e);
+}, U = (e) => V.get(e), Ze = (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;
-}, Ze = () => [...B.values()], Qe = (e) => B.delete(e), $e = () => {
-	B.clear();
-}, et = (e) => B.get(e)?.isReactive !== !1, tt = (e) => e.order ?? [], nt = (e) => ({
+}, Qe = () => [...V.values()], $e = (e) => V.delete(e), et = () => {
+	V.clear();
+}, tt = (e) => V.get(e)?.isReactive !== !1, nt = (e) => e.order ?? [], rt = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), rt = (e, t) => ({
+}), it = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), it = (e, t) => ({
+}), at = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), at = (e, t) => ({
+}), ot = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), ot = (e, t) => ({
+}), st = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), st = (e, t) => ({
+}), ct = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), ct = (e, t) => ({
+}), lt = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), U = (e) => (...t) => {
+}), W = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return K({
+	return q({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -841,55 +849,55 @@ var r = (e) => {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, lt = U("union"), ut = U("union-all"), dt = U("intersect"), ft = U("except"), W = (e) => ({ over: (t) => ({
+}, ut = W("union"), dt = W("union-all"), ft = W("intersect"), pt = W("except"), G = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), pt = (e = "rowNumber") => W({
+}) }), mt = (e = "rowNumber") => G({
 	op: "window-row-number",
 	alias: e
-}), mt = (e = "rank") => W({
+}), ht = (e = "rank") => G({
 	op: "window-rank",
 	alias: e
-}), ht = (e = "denseRank") => W({
+}), gt = (e = "denseRank") => G({
 	op: "window-dense-rank",
 	alias: e
-}), gt = (e, t = 1, n) => W({
+}), _t = (e, t = 1, n) => G({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), _t = (e, t = 1, n) => W({
+}), vt = (e, t = 1, n) => G({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), vt = (e, t) => W({
+}), yt = (e, t) => G({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), yt = (e, t) => W({
+}), bt = (e, t) => G({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), G = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? H(e)?.appliedFullText?.find((e) => e.name === t);
+}), K = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? U(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 }
 	};
-}, K = (e) => ({
+}, q = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return K({
+		return q({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return K({
+		return q({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -898,37 +906,43 @@ var r = (e) => {
 		});
 	},
 	limit(t) {
-		return K({
+		return q({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return K({
+		return q({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return K({
+		return q({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return K({
+		return q({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return K({
+		return q({
 			...e,
 			includeDeleted: !0
 		});
 	},
+	forUpdate() {
+		return q({
+			...e,
+			lock: "update"
+		});
+	},
 	unscoped() {
-		return K({
+		return q({
 			...e,
 			crossTenant: !0
 		});
@@ -938,13 +952,13 @@ var r = (e) => {
 			...e.eager ?? {},
 			...t
 		};
-		return K({
+		return q({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return K({
+		return q({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -958,15 +972,15 @@ var r = (e) => {
 			...t,
 			alias: e
 		}));
-		return K({
+		return q({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = G(e.table, t, e.fullTextIndexes);
-		return K({
+		let r = K(e.table, t, e.fullTextIndexes);
+		return q({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -980,7 +994,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 K({
+		return q({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -999,7 +1013,7 @@ var r = (e) => {
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return K({
+			return q({
 				...e,
 				annClause: i
 			});
@@ -1011,7 +1025,7 @@ var r = (e) => {
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return K({
+			return q({
 				...e,
 				annClause: r,
 				take: n
@@ -1024,7 +1038,7 @@ var r = (e) => {
 			column: "",
 			distance: "cosine"
 		};
-		return K({
+		return q({
 			...e,
 			annClause: {
 				...n,
@@ -1033,22 +1047,22 @@ var r = (e) => {
 		});
 	},
 	use(t) {
-		return K({ ...t(e) });
+		return q({ ...t(e) });
 	},
 	distinct() {
-		return K({
+		return q({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return K({
+		return q({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return K({
+		return q({
 			...e,
 			alias: t
 		});
@@ -1060,7 +1074,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return K({
+		return q({
 			...e,
 			joins: a
 		});
@@ -1072,7 +1086,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return K({
+		return q({
 			...e,
 			joins: a
 		});
@@ -1082,7 +1096,7 @@ var r = (e) => {
 			outputKey: e,
 			source: t
 		}));
-		return K({
+		return q({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1091,7 +1105,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 K({
+		return q({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1102,7 +1116,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 K({
+		return q({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1113,20 +1127,20 @@ var r = (e) => {
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return K({
+		return q({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return K({
+		return q({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return K({
+		return q({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1137,8 +1151,8 @@ var r = (e) => {
 		});
 	}
 });
-function q(e) {
-	return K({
+function J(e) {
+	return q({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1149,7 +1163,7 @@ function q(e) {
 		sourceTable: e
 	});
 }
-var bt = (e, t, n) => J(e, "id", t, n), J = (e, t, n, r, i = "asc") => {
+var xt = (e, t, n) => Y(e, "id", t, n), Y = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1164,21 +1178,21 @@ var bt = (e, t, n) => J(e, "id", t, n), J = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, xt = (e) => {
+}, St = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) V(r), t[n] = q(r);
+	for (let [n, r] of Object.entries(e)) H(r), t[n] = J(r);
 	return t;
-}, St = (e) => e.isView === !0, Ct = (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);
+}, Ct = (e) => e.isView === !0, wt = (e, t, n) => {
+	if (b(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
+	let r = p(t);
+	for (let t of Object.keys(r)) x(e, t);
 	return {
 		tableName: e,
 		fields: r,
 		isView: !0,
 		viewSelect: n
 	};
-}, wt = (e) => q({
+}, Tt = (e) => J({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1186,8 +1200,8 @@ var bt = (e, t, n) => J(e, "id", t, n), J = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), Tt = (e, t, n = null) => {
-	let r = n === null ? L(e.tableName, t) : `${L(n, t)}.${L(e.tableName, t)}`, i = e.viewSelect.trim();
+}), Et = (e, t, n = null) => {
+	let r = n === null ? R(e.tableName, t) : `${R(n, t)}.${R(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1196,16 +1210,16 @@ var bt = (e, t, n) => J(e, "id", t, n), J = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, Et = /^[A-Za-z_][A-Za-z0-9_]*$/, Dt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : Et.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), Ot = (e) => "{" + e.map((e) => {
+}, Dt = /^[A-Za-z_][A-Za-z0-9_]*$/, Ot = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : Dt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), kt = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", kt = (e, t, n, r = {}) => {
-	let i = L(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", At = (e, t, n, r = {}) => {
+	let i = R(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${Ot(t)}'::text[])`;
+		let e = `(${i} #>> '${kt(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = Dt(t);
+	let o = Ot(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1222,13 +1236,13 @@ var bt = (e, t, n) => J(e, "id", t, n), J = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, At = (e, t) => ({
+}, jt = (e, t) => ({
 	name: e,
 	body: t
-}), Y = (e) => {
+}), Mt = (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: At });
+	let t = e.steps({ step: jt });
 	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
 	return {
 		__seed: !0,
@@ -1241,20 +1255,41 @@ var bt = (e, t, n) => J(e, "id", t, n), J = (e, t, n, r, i = "asc") => {
 		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
 		steps: t
 	};
-}, jt = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, X = null, Z = null, Mt = (e) => {
+}, Nt = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, X = null, Z = null, Pt = (e) => {
 	X = e;
-}, Nt = (e) => {
+}, Ft = (e) => {
 	Z = e;
-}, Pt = async (e) => {
+}, It = async (e) => {
 	let t = X;
 	t !== null && await t(e);
-}, Ft = async (e) => {
+}, Lt = async (e) => {
 	let t = Z;
 	t !== null && e.changedTables.length !== 0 && await t(e);
-}, It = (e) => {
+}, Rt = (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;
-}, Lt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Rt = (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", Q = /* @__PURE__ */ new Set(["voltro_isr_cache"]), zt = (e) => Q.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), $ = "_voltro_staging_", Bt = (e) => e.startsWith($), Vt = /__dropped_\d{14}$/, Ht = (e) => Vt.test(e);
+}, zt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Bt = (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", Q = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Vt = (e) => Q.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), $ = "_voltro_staging_", Ht = (e) => e.startsWith($), Ut = /__dropped_\d{14}$/, Wt = (e) => Ut.test(e), Gt = 7, Kt = (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)));
+}, qt = (e, t = {}) => {
+	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
+		let a = Kt(e);
+		if (a === void 0) return;
+		let o = Math.floor((n.getTime() - a.getTime()) / 864e5);
+		o >= r && i.push({
+			name: t,
+			droppedAt: a,
+			ageDays: o
+		});
+	};
+	for (let t of e.tables) if (a(t.name, t.name), !Wt(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
+	return i;
+}, Jt = (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.`;
+};
 //#endregion
-export { qe as $, l as $t, _t as A, oe as At, it as B, _e as Bt, nt as C, xe as Ct, ft as D, s as Dt, ht as E, m as Et, bt as F, d as Ft, $e as G, le as Gt, lt as H, ee as Ht, q as I, ce as It, et as J, ye as Jt, Ye as K, f as Kt, mt as L, ae as Lt, ot as M, de as Mt, tt as N, o as Nt, dt as O, he as Ot, J as P, i as Pt, Je as Q, r as Qt, G as R, u as Rt, ct as S, we as St, xt as T, be as Tt, ut as U, te as Ut, vt as V, ve as Vt, Ze as W, ge as Wt, Xe as X, ne as Xt, V as Y, a as Yt, Qe as Z, fe as Zt, wt as _, b as _t, Bt as a, Ve as at, at as b, S as bt, It as c, M as ct, Pt as d, A as dt, se as en, Ke as et, jt as f, O as ft, St as g, De as gt, kt as h, Ee as ht, Ht as i, Ge as it, st as j, ue as jt, gt as k, ie as kt, Y as l, k as lt, Mt as m, Te as mt, $ as n, He as nt, Lt as o, ze as ot, Nt as p, Ie as pt, H as q, re as qt, zt as r, Be as rt, Rt as s, j as st, Q as t, me as tn, L as tt, Ft as u, Re as ut, Ct as v, x as vt, rt as w, Se as wt, yt as x, Ce as xt, Tt as y, y as yt, pt as z, pe as zt };
+export { H as $, be as $t, gt as A, h as At, J as B, de as Bt, Et as C, b as Ct, rt as D, Se as Dt, lt as E, Te as Et, ct as F, oe as Ft, yt as G, ve as Gt, K as H, ae as Ht, st as I, ue as It, Qe as J, te as Jt, ut as K, ye as Kt, nt as L, fe as Lt, ft as M, d as Mt, _t as N, ge as Nt, it as O, Ce as Ot, vt as P, ie as Pt, tt as Q, re as Qt, Y as R, o as Rt, wt as S, S as St, bt as T, we as Tt, mt as U, u as Ut, ht as V, ce as Vt, at as W, me as Wt, Xe as X, le as Xt, et as Y, _e as Yt, U as Z, p as Zt, Ft as _, Le as _t, Jt as a, l as an, R as at, Ct as b, Oe as bt, Ht as c, Ke as ct, Bt as d, M as dt, a as en, Ze as et, Rt as f, N as ft, Nt as g, k as gt, It as h, j as ht, qt as i, r as in, qe as it, pt as j, s as jt, St as k, xe as kt, Kt as l, He as lt, Lt as m, ze as mt, Q as n, f as nn, Ye as nt, Vt as o, se as on, Ue as ot, Mt as p, A as pt, dt as q, ee as qt, $ as r, pe as rn, Je as rt, Wt as s, he as sn, Ve as st, Gt as t, ne as tn, $e as tt, zt as u, Be as ut, Pt as v, Ee as vt, ot as w, C as wt, Tt as x, x as xt, At as y, De as yt, xt as z, i as zt };