@voltro/database 0.33.0 → 0.35.0

package/dist/{frameworkLiveTables-DbAgeVOU.js → frameworkLiveTables-CeuTYhWm.js}

@@ -322,29 +322,29 @@ var r = (e) => {
 		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).`);
-}, C = 1704067200000n, w = 10n, T = 12n, E = (1n << w) - 1n, D = (1n << T) - 1n, De = T, Oe = 22n, ke = () => {
+}, De = 1704067200000n, Oe = 10n, C = 12n, w = (1n << Oe) - 1n, T = (1n << C) - 1n, ke = C, Ae = 22n, je = () => {
 	let e = process.env.SNOWFLAKE_MACHINE_ID;
 	if (e === void 0 || e === "") return 0n;
 	let t = BigInt(e);
-	if (t < 0n || t > E) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${E}.`);
+	if (t < 0n || t > w) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${w}.`);
 	return t;
-}, O = () => ({
+}, E = () => ({
 	lastMs: 0n,
 	sequence: 0n,
-	machineId: ke()
-}), k, Ae = () => (k === void 0 && (k = O()), k), je = () => {
-	k = O();
-}, A = () => BigInt(Date.now()), Me = (e) => {
-	let t = A();
-	for (; t <= e;) t = A();
+	machineId: je()
+}), D, Me = () => (D === void 0 && (D = E()), D), Ne = () => {
+	D = E();
+}, O = () => BigInt(Date.now()), Pe = (e) => {
+	let t = O();
+	for (; t <= e;) t = O();
 	return t;
-}, j = () => {
-	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;
+}, k = () => {
+	let e = Me(), t = O();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & T, e.sequence === 0n && (t = Pe(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - De;
 	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Oe | e.machineId << De | e.sequence).toString();
-}, M = (e) => {
+	return (n << Ae | e.machineId << ke | 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: '...' }).`);
@@ -353,10 +353,10 @@ var r = (e) => {
 		kind: "derived",
 		tableName: e
 	}), n;
-}, N = (e, t) => {
+}, j = (e, t) => {
 	if (e === void 0) return {
 		kind: "typeid",
-		prefix: M(t)
+		prefix: A(t)
 	};
 	if ("prefix" in e && !("scheme" in e)) return S(e.prefix, {
 		kind: "explicit",
@@ -368,7 +368,7 @@ 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 ?? M(t);
+			let n = e.prefix ?? A(t);
 			return e.prefix !== void 0 && S(e.prefix, {
 				kind: "explicit",
 				tableName: t
@@ -385,22 +385,22 @@ var r = (e) => {
 			generate: e.generate
 		};
 	}
-}, Ne = (n, r) => {
+}, Fe = (n, r) => {
 	switch (n.kind) {
 		case "typeid": return e(n.prefix).toString();
 		case "ulid": return t();
 		case "numeric": return null;
-		case "snowflake": return j();
+		case "snowflake": return k();
 		case "custom": return n.generate(r);
 	}
-}, P = (e) => ({
+}, M = (e) => ({
 	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 }
-}), Pe = P, F = (e) => {
+}), Ie = M, N = (e) => {
 	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
 		let i = e.id ?? e;
 		if (!t.has(i)) {
@@ -410,7 +410,7 @@ var r = (e) => {
 	};
 	for (let t of e) r(t);
 	return n;
-}, Fe = (e, ...t) => {
+}, Le = (e, ...t) => {
 	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
 	let n = (r) => ({
 		jsonPath: {
@@ -421,14 +421,14 @@ var r = (e) => {
 		numeric: () => n(!0)
 	});
 	return n(!1);
-}, Ie = (e = "cosine", t = "float32") => {
+}, Re = (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`;
 	}
-}, Le = [
+}, ze = [
 	"id",
 	"tenantId",
 	"createdAt",
@@ -437,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`, Re = (e, t) => `${e}_${t.join("_")}_uq`, R = (e, t, n, r, i) => {
+], P = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, F = (e, t) => `${e}_${t.join("_")}_idx`, Be = (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];
@@ -445,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.`);
-}, z = (e, t) => {
+}, Ve = (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)
+		idScheme: j(i.idSchemeInput, t)
 	});
 	return n ?? e;
-}, B = (e) => {
+}, L = (e) => {
 	let t = e.appliedPrimaryKey ?? [];
 	return {
 		tableName: e.tableName,
@@ -472,7 +472,7 @@ var r = (e) => {
 		fullTextIndex: ((t, n, r) => {
 			if (n.length === 0) throw Error(`fullTextIndex '${t}' on '${e.tableName}' has no columns.`);
 			if (x(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
-			return B({
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -493,27 +493,27 @@ var r = (e) => {
 			});
 		}),
 		with: ((...t) => {
-			let n = F(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
+			let n = N(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
 			for (let e of Object.keys(r)) i.set(e, {
 				id: "<table>",
 				fields: {}
 			});
 			for (let t of n) for (let [n, a] of Object.entries(t.fields)) {
 				let o = i.get(n);
-				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${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.`);
+				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${P(o)}' and '${P(t)}' both define it. If they're the same mixin reached via different paths, set a shared 'id' on both. If they're genuinely different concerns, rename one of the columns.`);
 				b(e.tableName, n), r[n] = a, i.set(n, t);
 			}
 			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) || (x(e.tableName, t, n.name === void 0, n.fields), R(e.tableName, t, n.kind, n.fields, r), a.push({
+				let t = n.name ?? F(e.tableName, n.fields);
+				a.some((e) => e.name === t) || (x(e.tableName, t, n.name === void 0, n.fields), I(e.tableName, t, n.kind, n.fields, r), a.push({
 					name: t,
 					fields: n.fields,
 					...n.kind === void 0 ? {} : { kind: n.kind },
 					...n.kindOptions === void 0 ? {} : { kindOptions: n.kindOptions }
 				}));
 			}
-			return B({
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: r,
@@ -530,10 +530,10 @@ var r = (e) => {
 		}),
 		index: ((...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(`index '${n}' on table '${e.tableName}' has no fields — an index must cover at least one column.`);
+			if (a ? (r = t[0], i = t[1], n = F(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`index '${n}' on table '${e.tableName}' has no fields — an index must cover at least one column.`);
 			let o = r.filter((e) => typeof e == "string");
-			if (x(e.tableName, n, a, o), 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({
+			if (x(e.tableName, n, a, o), I(e.tableName, n, i?.kind, r, e.fields), e.appliedIndexes.some((e) => e.name === n)) throw t.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${e.tableName}' — you've called .index(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (rare).`) : Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table.`);
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -557,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 (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({
+			if (x(e.tableName, t, !1, i), I(e.tableName, t, r?.kind, n, e.fields), e.appliedIndexes.some((e) => e.name === t)) throw Error(`duplicate index '${t}' on table '${e.tableName}': each index name must be unique within a table.`);
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -581,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 = 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 (a ? (r = t[0], i = t[1], n = Be(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({
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -604,10 +604,10 @@ 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 (a ? (r = t[0], i = t[1], n = F(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${e.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
 			if (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 B({
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -630,7 +630,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 (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({
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -652,7 +652,7 @@ var r = (e) => {
 			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({
+			return L({
 				...e,
 				appliedRules: [...i, {
 					name: t,
@@ -663,7 +663,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 y(t), B({
+			return y(t), L({
 				...e,
 				previousTableName: t
 			});
@@ -678,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 B({
+			return L({
 				...e,
 				tableName: e.tableName,
 				fields: e.fields,
@@ -693,7 +693,7 @@ var r = (e) => {
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
-		nonReactive: (() => B({
+		nonReactive: (() => L({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -707,7 +707,7 @@ var r = (e) => {
 			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validate: ((t) => B({
+		validate: ((t) => L({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -721,7 +721,7 @@ var r = (e) => {
 			insertSchema: t,
 			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 		})),
-		validatePatch: ((t) => B({
+		validatePatch: ((t) => L({
 			...e,
 			tableName: e.tableName,
 			fields: e.fields,
@@ -736,7 +736,7 @@ var r = (e) => {
 			validatePatchSchema: n.partial(t)
 		}))
 	};
-}, ze = (e, t) => {
+}, R = (e, t) => {
 	y(e);
 	let n = Object.entries(t).flatMap(([e, t]) => {
 		let n = m(t);
@@ -744,9 +744,9 @@ var r = (e) => {
 			column: e,
 			...n
 		}];
-	}), r = z(f(t), e);
+	}), r = Ve(f(t), e);
 	for (let t of Object.keys(r)) b(e, t);
-	return B({
+	return L({
 		appliedPluginRefs: n,
 		tableName: e,
 		fields: r,
@@ -758,7 +758,7 @@ var r = (e) => {
 		appliedChecks: [],
 		appliedRules: []
 	});
-}, Be = (e) => e === "sqlite" || e === "turso", V = (e, t) => {
+}, He = (e) => e === "sqlite" || e === "turso", z = (e, t) => {
 	switch (t) {
 		case "mysql":
 		case "mariadb": return `\`${e}\``;
@@ -767,51 +767,51 @@ var r = (e) => {
 		case "sqlite":
 		case "turso": return `"${e}"`;
 	}
-}, H = Symbol.for("@voltro/database/tableRegistry"), U = globalThis, W = U[H] ?? (U[H] = /* @__PURE__ */ new Map()), G = (e) => {
-	let t = W.get(e.tableName);
+}, Ue = 1e4, B = Symbol.for("@voltro/database/tableRegistry"), V = globalThis, H = V[B] ?? (V[B] = /* @__PURE__ */ new Map()), U = (e) => {
+	let t = H.get(e.tableName);
 	if (t === void 0) {
-		W.set(e.tableName, e);
+		H.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.`);
-}, Ve = (e) => {
-	W.get(e.tableName) === void 0 && W.set(e.tableName, e);
-}, K = (e) => W.get(e), He = (e) => {
-	let t = W.get(e);
+}, We = (e) => {
+	H.get(e.tableName) === void 0 && H.set(e.tableName, e);
+}, W = (e) => H.get(e), Ge = (e) => {
+	let t = H.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;
-}, Ue = () => [...W.values()], We = () => {
-	W.clear();
-}, Ge = (e) => W.get(e)?.isReactive !== !1, Ke = (e) => e.order ?? [], qe = (e) => ({
+}, Ke = () => [...H.values()], qe = () => {
+	H.clear();
+}, Je = (e) => H.get(e)?.isReactive !== !1, Ye = (e) => e.order ?? [], Xe = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), Je = (e, t) => ({
+}), Ze = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), Ye = (e, t) => ({
+}), Qe = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), Xe = (e, t) => ({
+}), $e = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), Ze = (e, t) => ({
+}), et = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), Qe = (e, t) => ({
+}), tt = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), $e = (e, t) => ({
+}), nt = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), q = (e) => (...t) => {
+}), G = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return X({
+	return J({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -823,55 +823,55 @@ var r = (e) => {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, et = q("union"), tt = q("union-all"), nt = q("intersect"), rt = q("except"), J = (e) => ({ over: (t) => ({
+}, rt = G("union"), it = G("union-all"), at = G("intersect"), ot = G("except"), K = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), it = (e = "rowNumber") => J({
+}) }), st = (e = "rowNumber") => K({
 	op: "window-row-number",
 	alias: e
-}), at = (e = "rank") => J({
+}), ct = (e = "rank") => K({
 	op: "window-rank",
 	alias: e
-}), ot = (e = "denseRank") => J({
+}), lt = (e = "denseRank") => K({
 	op: "window-dense-rank",
 	alias: e
-}), st = (e, t = 1, n) => J({
+}), ut = (e, t = 1, n) => K({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), ct = (e, t = 1, n) => J({
+}), dt = (e, t = 1, n) => K({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), lt = (e, t) => J({
+}), ft = (e, t) => K({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), ut = (e, t) => J({
+}), pt = (e, t) => K({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), Y = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? K(e)?.appliedFullText?.find((e) => e.name === t);
+}), q = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? W(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 }
 	};
-}, X = (e) => ({
+}, J = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return X({
+		return J({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return X({
+		return J({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -880,37 +880,37 @@ var r = (e) => {
 		});
 	},
 	limit(t) {
-		return X({
+		return J({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return X({
+		return J({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return X({
+		return J({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return X({
+		return J({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return X({
+		return J({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	unscoped() {
-		return X({
+		return J({
 			...e,
 			crossTenant: !0
 		});
@@ -920,13 +920,13 @@ var r = (e) => {
 			...e.eager ?? {},
 			...t
 		};
-		return X({
+		return J({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return X({
+		return J({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -940,15 +940,15 @@ var r = (e) => {
 			...t,
 			alias: e
 		}));
-		return X({
+		return J({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = Y(e.table, t, e.fullTextIndexes);
-		return X({
+		let r = q(e.table, t, e.fullTextIndexes);
+		return J({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -962,7 +962,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 X({
+		return J({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -981,7 +981,7 @@ var r = (e) => {
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return X({
+			return J({
 				...e,
 				annClause: i
 			});
@@ -993,7 +993,7 @@ var r = (e) => {
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return X({
+			return J({
 				...e,
 				annClause: r,
 				take: n
@@ -1006,7 +1006,7 @@ var r = (e) => {
 			column: "",
 			distance: "cosine"
 		};
-		return X({
+		return J({
 			...e,
 			annClause: {
 				...n,
@@ -1015,22 +1015,22 @@ var r = (e) => {
 		});
 	},
 	use(t) {
-		return X({ ...t(e) });
+		return J({ ...t(e) });
 	},
 	distinct() {
-		return X({
+		return J({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return X({
+		return J({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return X({
+		return J({
 			...e,
 			alias: t
 		});
@@ -1042,7 +1042,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return X({
+		return J({
 			...e,
 			joins: a
 		});
@@ -1054,7 +1054,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return X({
+		return J({
 			...e,
 			joins: a
 		});
@@ -1064,7 +1064,7 @@ var r = (e) => {
 			outputKey: e,
 			source: t
 		}));
-		return X({
+		return J({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -1073,7 +1073,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 X({
+		return J({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1084,7 +1084,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 X({
+		return J({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1095,20 +1095,20 @@ var r = (e) => {
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return X({
+		return J({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return X({
+		return J({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return X({
+		return J({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1119,8 +1119,8 @@ var r = (e) => {
 		});
 	}
 });
-function Z(e) {
-	return X({
+function Y(e) {
+	return J({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1131,7 +1131,7 @@ function Z(e) {
 		sourceTable: e
 	});
 }
-var dt = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
+var mt = (e, t, n) => X(e, "id", t, n), X = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1146,11 +1146,11 @@ var dt = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, ft = (e) => {
+}, ht = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) G(r), t[n] = Z(r);
+	for (let [n, r] of Object.entries(e)) U(r), t[n] = Y(r);
 	return t;
-}, pt = (e) => e.isView === !0, mt = (e, t, n) => {
+}, gt = (e) => e.isView === !0, _t = (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);
@@ -1160,7 +1160,7 @@ var dt = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 		isView: !0,
 		viewSelect: n
 	};
-}, ht = (e) => Z({
+}, vt = (e) => Y({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1168,8 +1168,8 @@ var dt = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), gt = (e, t, n = null) => {
-	let r = n === null ? V(e.tableName, t) : `${V(n, t)}.${V(e.tableName, t)}`, i = e.viewSelect.trim();
+}), yt = (e, t, n = null) => {
+	let r = n === null ? z(e.tableName, t) : `${z(n, t)}.${z(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
 		case "mysql":
@@ -1178,16 +1178,16 @@ var dt = (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};`;
 	}
-}, _t = /^[A-Za-z_][A-Za-z0-9_]*$/, vt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : _t.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), yt = (e) => "{" + e.map((e) => {
+}, bt = /^[A-Za-z_][A-Za-z0-9_]*$/, xt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : bt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), St = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", bt = (e, t, n, r = {}) => {
-	let i = V(e, n), a = r.numeric ?? !1;
+}).join(",") + "}", Ct = (e, t, n, r = {}) => {
+	let i = z(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${yt(t)}'::text[])`;
+		let e = `(${i} #>> '${St(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = vt(t);
+	let o = xt(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1204,10 +1204,39 @@ var dt = (e, t, n) => Q(e, "id", t, n), Q = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, xt = (e) => {
+}, wt = (e, t) => ({
+	name: e,
+	body: t
+}), Tt = (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: wt });
+	if (t.length === 0) throw Error(`seed "${e.id}": at least one step is required`);
+	return {
+		__seed: !0,
+		id: e.id,
+		name: e.name,
+		lifecycle: e.lifecycle,
+		...e.cron === void 0 ? {} : { cron: e.cron },
+		...e.timezone === void 0 ? {} : { timezone: e.timezone },
+		...e.watchedTables === void 0 ? {} : { watchedTables: e.watchedTables },
+		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
+		steps: t
+	};
+}, Et = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Z = null, Q = null, Dt = (e) => {
+	Z = e;
+}, Ot = (e) => {
+	Q = e;
+}, kt = async (e) => {
+	let t = Z;
+	t !== null && await t(e);
+}, At = async (e) => {
+	let t = Q;
+	t === null || e.changedTables.length === 0 || await t(e);
+}, jt = (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;
-}, St = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Ct = (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"]), wt = (e) => $.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), Tt = /__dropped_\d{14}$/, Et = (e) => Tt.test(e);
+}, Mt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Nt = (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"]), Pt = (e) => $.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_"), Ft = /__dropped_\d{14}$/, It = (e) => Ft.test(e);
 //#endregion
-export { Ne as $, Y as A, te as At, Ge as B, c as Bt, Qe as C, ce as Ct, dt as D, he as Dt, Q as E, de as Et, tt as F, _e as Ft, Le as G, He as H, fe as Ht, Ue as I, i as It, Ie as J, Fe as K, We as L, ne as Lt, Ye as M, le as Mt, lt as N, f as Nt, Z as O, ge as Ot, et as P, re as Pt, M as Q, Ve as R, d as Rt, ct as S, u as St, Ke as T, l as Tt, Be as U, G as V, se as Vt, V as W, P as X, Pe as Y, F as Z, ft as _, pe as _t, Ct as a, Te as at, nt as b, ue as bt, pt as c, y as ct, gt as d, Se as dt, N as et, Xe as f, ye as ft, Je as g, o as gt, qe as h, m as ht, St as i, we as it, it as j, me as jt, at as k, ee as kt, ht as l, S as lt, $e as m, ve as mt, wt as n, je as nt, xt as o, b as ot, ut as p, be as pt, ze as q, Et as r, Ce as rt, bt as s, x as st, $ as t, j as tt, mt as u, xe as ut, ot as v, ie as vt, Ze as w, ae as wt, st as x, a as xt, rt as y, oe as yt, K as z, r as zt };
+export { Le as $, et as A, ce as At, rt as B, f as Bt, ht as C, o as Ct, ut as D, ue as Dt, at as E, oe as Et, ct as F, ge as Ft, W as G, d as Gt, Ke as H, _e as Ht, q as I, ee as It, Ge as J, se as Jt, Je as K, r as Kt, st as L, te as Lt, X as M, l as Mt, mt as N, de as Nt, dt as O, a as Ot, Y as P, he as Pt, ze as Q, Qe as R, me as Rt, Ze as S, m as St, ot as T, ie as Tt, qe as U, i as Ut, it as V, re as Vt, We as W, ne as Wt, He as X, Ue as Y, fe as Yt, z as Z, yt as _, xe as _t, Nt as a, A as at, nt as b, be as bt, At as c, k as ct, Ot as d, we as dt, R as et, Dt as f, Te as ft, _t as g, S as gt, vt as h, y as ht, Mt as i, N as it, Ye as j, ae as jt, tt as k, u as kt, kt as l, Ne as lt, gt as m, x as mt, Pt as n, Ie as nt, jt as o, Fe as ot, Ct as p, b as pt, U as q, c as qt, It as r, M as rt, Tt as s, j as st, $ as t, Re as tt, Et as u, Ce as ut, $e as v, Se as vt, lt as w, pe as wt, Xe as x, ve as xt, pt as y, ye as yt, ft as z, le as zt };