@voltro/database 0.74.0 → 0.76.0

package/dist/frameworkLiveTables-C1WjQ_uI.js

@@ -1,1641 +0,0 @@
-import { Effect as e, Schema as t } from "effect";
-import { typeid as n } from "typeid-js";
-import { ulid as r } from "ulidx";
-//#region src/columns.ts
-var i = (e) => {
-	let t = [];
-	for (let [n, r] of Object.entries(e.fields)) r.serverOnly === !0 && t.push(n);
-	return t;
-}, a = (e) => {
-	let t = [];
-	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
-	return t;
-}, o = (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;
-}, s = (e) => {
-	let t = [];
-	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
-	return t;
-}, c = class e {
-	definition;
-	constructor(e) {
-		this.definition = e;
-	}
-	rejectIfRaw(e) {
-		if (this.definition.type === "raw") throw Error(`raw(...) column rejects .${e}() — the DDL fragment is the single source of truth for type/nullability/default. Encode ${e === "nullable" ? "NULL" : e === "unique" ? "UNIQUE" : "DEFAULT"} directly in the raw fragment instead.`);
-	}
-	nullable() {
-		return this.rejectIfRaw("nullable"), new e({
-			...this.definition,
-			nullable: !0
-		});
-	}
-	externalId() {
-		if (this.rejectIfRaw("externalId"), this.definition.type === "reference" || this.definition.type === "id") throw Error(`.externalId() requires a scalar non-primary-key column (got ${this.definition.type}) — \`reference()\` is local by definition and \`id()\` identifies this row.`);
-		return new e({
-			...this.definition,
-			externalId: !0
-		});
-	}
-	encrypted() {
-		return this.rejectIfRaw("encrypted"), new e({
-			...this.definition,
-			encrypted: !0
-		});
-	}
-	serverOnly() {
-		if (this.rejectIfRaw("serverOnly"), this.definition.crdtManaged === !0) throw Error("serverOnly() on a CRDT column (crdtText()/crdtDoc()) is a contradiction: clients write CRDT updates and must read the merged state back. Remove serverOnly(), or use a plain bytes() column if only the server touches it.");
-		return new e({
-			...this.definition,
-			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({
-			...this.definition,
-			versionColumn: !0,
-			hasDefault: !0,
-			defaultValue: 1
-		});
-	}
-	sensitive(t) {
-		return new e({
-			...this.definition,
-			sensitive: { class: t }
-		});
-	}
-	safe() {
-		return new e({
-			...this.definition,
-			safe: !0
-		});
-	}
-	unique(t) {
-		return this.rejectIfRaw("unique"), t?.dedup === void 0 ? new e({
-			...this.definition,
-			unique: !0
-		}) : new e({
-			...this.definition,
-			unique: !0,
-			uniqueSpec: { dedup: t.dedup }
-		});
-	}
-	default(t) {
-		return this.rejectIfRaw("default"), typeof t == "function" ? new e({
-			...this.definition,
-			hasDefault: !0,
-			defaultFactory: t
-		}) : new e({
-			...this.definition,
-			hasDefault: !0,
-			defaultValue: t
-		});
-	}
-	computed(t) {
-		return new e({
-			...this.definition,
-			computed: t
-		});
-	}
-	onUpdate(t) {
-		return new e({
-			...this.definition,
-			onUpdate: t
-		});
-	}
-	generatedAs(t, n) {
-		return new e({
-			...this.definition,
-			generatedAs: {
-				expr: t,
-				stored: n?.stored ?? !1
-			}
-		});
-	}
-	backfill(t, n) {
-		let r = typeof t == "function" ? {
-			kind: "js",
-			fn: t,
-			...n?.batchSize === void 0 ? {} : { batchSize: n.batchSize },
-			...n?.sleepMs === void 0 ? {} : { sleepMs: n.sleepMs }
-		} : {
-			kind: "sql",
-			sql: t,
-			...n?.batchSize === void 0 ? {} : { batchSize: n.batchSize },
-			...n?.sleepMs === void 0 ? {} : { sleepMs: n.sleepMs }
-		};
-		return new e({
-			...this.definition,
-			backfill: r
-		});
-	}
-	renamedFrom(t) {
-		return new e({
-			...this.definition,
-			renamedFrom: t
-		});
-	}
-	narrowedFrom(t, n) {
-		let r = n?.using === void 0 ? { from: t } : {
-			from: t,
-			using: n.using
-		};
-		return new e({
-			...this.definition,
-			narrowedFrom: r
-		});
-	}
-	oneOf(t) {
-		return new e({
-			...this.definition,
-			oneOf: t
-		});
-	}
-	maxLength(t) {
-		return new e({
-			...this.definition,
-			maxLength: t
-		});
-	}
-	check(t) {
-		let n = this.definition.checks ? [...this.definition.checks, t] : [t];
-		return new e({
-			...this.definition,
-			checks: n
-		});
-	}
-	__definition() {
-		return this.definition;
-	}
-}, l = (e) => new c({
-	type: e,
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1
-});
-function ee(e) {
-	return new c({
-		type: "id",
-		nullable: !1,
-		unique: !0,
-		hasDefault: !1,
-		idSchemeInput: e
-	});
-}
-var u = () => l("text"), te = () => l("integer"), ne = () => l("real"), re = (e, t = 0) => {
-	if (!Number.isInteger(e) || e <= 0) throw Error(`decimal(${String(e)}, ${String(t)}): precision must be a positive integer (the total number of significant digits, e.g. decimal(12, 2)).`);
-	if (!Number.isInteger(t) || t < 0 || t > e) throw Error(`decimal(${String(e)}, ${String(t)}): scale must be an integer between 0 and precision (${e}).`);
-	return new c({
-		type: "decimal",
-		nullable: !1,
-		unique: !1,
-		hasDefault: !1,
-		precision: e,
-		scale: t
-	});
-}, ie = re, ae = () => l("bigint"), oe = (e, t) => {
-	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
-	return {
-		name: e,
-		values: t,
-		column: () => new c({
-			type: "enum",
-			nullable: !1,
-			unique: !1,
-			hasDefault: !1,
-			enumName: e,
-			enumValues: t
-		})
-	};
-}, se = () => l("boolean"), ce = () => l("timestamp"), le = () => l("date"), ue = () => l("json"), de = () => l("bytes"), fe = () => new c({
-	type: "bytes",
-	nullable: !0,
-	unique: !1,
-	hasDefault: !1,
-	crdtManaged: !0
-}), pe = () => new c({
-	type: "bytes",
-	nullable: !0,
-	unique: !1,
-	hasDefault: !1,
-	crdtManaged: !0
-}), 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");
-};
-function me(e) {
-	return he(d, e);
-}
-function he(e, t) {
-	return new c({
-		type: "reference",
-		nullable: !1,
-		unique: !1,
-		hasDefault: !1,
-		references: e,
-		referenceStorage: t?.storage ?? "text",
-		referenceColumn: t?.column ?? "id",
-		onDelete: t?.onDelete ?? "restrict",
-		refOnUpdate: t?.onUpdate ?? "noAction",
-		...t?.onSoftDelete === void 0 ? {} : { refOnSoftDelete: t.onSoftDelete },
-		fkAutoIndex: t?.index ?? !0,
-		...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
-	});
-}
-var ge = () => new c({
-	type: "text",
-	nullable: !0,
-	unique: !1,
-	hasDefault: !1,
-	dropped: !0
-}), _e = (e, t) => {
-	if (!Number.isInteger(e) || e <= 0) throw Error(`vector(${String(e)}): dimension must be a positive integer (the embedding length, e.g. vector(1536)).`);
-	return new c({
-		type: "vector",
-		nullable: !1,
-		unique: !1,
-		hasDefault: !1,
-		vectorDim: e,
-		vectorPrecision: t?.precision ?? "float32"
-	});
-}, ve = (e) => new c({
-	type: "array",
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1,
-	arrayElement: e.__definition().type
-}), ye = () => l("interval"), be = (e, t = 4326) => new c({
-	type: "text",
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1,
-	spatial: {
-		kind: "geography",
-		geomKind: e,
-		srid: t
-	}
-}), xe = (e, t = 4326) => new c({
-	type: "text",
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1,
-	spatial: {
-		kind: "geometry",
-		geomKind: e,
-		srid: t
-	}
-}), Se = (e) => new c({
-	type: "raw",
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1,
-	rawDdl: e
-}), f = (e) => {
-	let t = {};
-	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
-	return t;
-}, p = /* @__PURE__ */ new WeakMap(), m = (e) => typeof e == "object" && e ? p.get(e) : void 0, Ce = (e, t = {}) => {
-	let n = u();
-	return p.set(n, {
-		target: e,
-		orphanPolicy: t.orphanPolicy ?? "keep",
-		onSoftDelete: t.onSoftDelete ?? !1
-	}), n;
-}, h = /* @__PURE__ */ new Map(), we = (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) ?? [];
-	for (let r of n) {
-		if (r.from === t.from && r.to === t.to) return;
-		if (r.from === t.from && r.to !== t.to) throw Error(`declareEnumRename('${e}'): value '${t.from}' is already declared as renamed to '${r.to}', cannot also rename it to '${t.to}'.`);
-	}
-	n.push(t), h.set(e, n);
-}, Te = (e) => h.get(e) ?? [], Ee = () => h, De = () => {
-	h.clear();
-}, Oe = 63, ke = 60, g = [], _ = (e) => {
-	g.includes(e) || g.push(e);
-}, Ae = () => {
-	let e = g.slice();
-	return g.length = 0, e;
-}, je = /^[a-zA-Z_][a-zA-Z0-9_]*$/, v = (e, t) => {
-	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!je.test(t)) throw Error(`${e} '${t}' contains characters outside [A-Za-z0-9_] or starts with a digit. Dialect-portable identifiers must match /^[a-zA-Z_][a-zA-Z0-9_]*$/.`);
-}, y = (e) => {
-	if (v("table name", e), e.length > 63) throw Error(`table name '${e}' is ${e.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten the name; long table names also cascade into auto-named indexes and FK constraints that would themselves exceed the limit.`);
-	e.length > 60 && _(`table name '${e}' is ${e.length} chars — ${63 - e.length} from the Postgres 63-byte limit. Auto-named indexes on this table will run out of room fast.`);
-}, b = (e, t) => {
-	if (v("column name", t), t.length > 63) throw Error(`column '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Rename it.`);
-	t.length > 60 && _(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
-}, x = (e, t, n, r) => {
-	if (v("index name", t), t.length > 63) throw Error(n ? `auto-named index '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Supply an explicit short name: .index('<shortName>', ${JSON.stringify([...r])}).` : `index name '${t}' on table '${e}' is ${t.length} chars — exceeds the 63-byte cross-dialect limit (Postgres floor). Shorten it.`);
-	t.length > 60 && _(`index '${t}' on table '${e}' is ${t.length} chars — ${63 - t.length} from the 63-byte limit. ${n ? `Consider .index('<shortName>', ${JSON.stringify([...r])}) before it grows.` : ""}`);
-}, S = (e, t) => {
-	if (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_]*$/.";
-		throw Error(`typeid prefix '${e}' on table '${t.tableName}' is invalid — ${n}`);
-	}
-	if (e.length > 63) {
-		let n = t.kind === "derived" ? "shorten the table name, or supply an explicit short prefix via id({ prefix: '...' })." : "pick a shorter prefix.";
-		throw Error(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — exceeds the 63-byte limit; ${n}`);
-	}
-	e.length > 60 && _(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — close to the 63-byte limit. Generated ids will be even longer (prefix + '_' + 26).`);
-}, Me = 1704067200000n, Ne = 10n, Pe = 12n, Fe = (1n << Ne) - 1n, Ie = (1n << Pe) - 1n, Le = Pe, Re = 22n, ze = () => {
-	let e = process.env.SNOWFLAKE_MACHINE_ID;
-	if (e === void 0 || e === "") return 0n;
-	let t = BigInt(e);
-	if (t < 0n || t > Fe) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Fe}.`);
-	return t;
-}, C = () => ({
-	lastMs: 0n,
-	sequence: 0n,
-	machineId: ze()
-}), w, Be = () => (w === void 0 && (w = C()), w), Ve = () => {
-	w = C();
-}, T = () => BigInt(Date.now()), He = (e) => {
-	let t = T();
-	for (; t <= e;) t = T();
-	return t;
-}, E = () => {
-	let e = Be(), t = T();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & Ie, e.sequence === 0n && (t = He(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - Me;
-	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Re | e.machineId << Le | e.sequence).toString();
-}, D = (e) => {
-	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, {
-		kind: "derived",
-		tableName: e
-	}), n;
-}, O = (e, t) => {
-	if (e === void 0) return {
-		kind: "typeid",
-		prefix: D(t)
-	};
-	if ("prefix" in e && !("scheme" in e)) return S(e.prefix, {
-		kind: "explicit",
-		tableName: t
-	}), {
-		kind: "typeid",
-		prefix: e.prefix
-	};
-	if (!("scheme" in e)) throw Error("invalid id() options: no scheme or prefix");
-	switch (e.scheme) {
-		case "typeid": {
-			let n = e.prefix ?? D(t);
-			return e.prefix !== void 0 && S(e.prefix, {
-				kind: "explicit",
-				tableName: t
-			}), {
-				kind: "typeid",
-				prefix: n
-			};
-		}
-		case "ulid": return { kind: "ulid" };
-		case "numeric": return { kind: "numeric" };
-		case "snowflake": return { kind: "snowflake" };
-		case "custom": return {
-			kind: "custom",
-			generate: e.generate
-		};
-	}
-}, Ue = (e, t) => {
-	switch (e.kind) {
-		case "typeid": return n(e.prefix).toString();
-		case "ulid": return r();
-		case "numeric": return null;
-		case "snowflake": return E();
-		case "custom": return e.generate(t);
-	}
-}, k = (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 }
-}), We = k, A = (e) => {
-	let t = /* @__PURE__ */ new Set(), n = [], r = (e) => {
-		let i = e.id ?? e;
-		if (!t.has(i)) {
-			if (t.add(i), e.requires !== void 0) for (let t of e.requires) r(t);
-			n.push(e);
-		}
-	};
-	for (let t of e) r(t);
-	return n;
-}, Ge = (e, ...t) => {
-	if (t.length === 0) throw Error(`jsonIndex("${e}"): at least one path segment is required`);
-	let n = (r) => ({
-		jsonPath: {
-			column: e,
-			path: t,
-			numeric: r
-		},
-		numeric: () => n(!0)
-	});
-	return n(!1);
-}, Ke = (e = "cosine", t = "float32") => {
-	let n = t === "half" ? "halfvec" : "vector";
-	switch (e) {
-		case "cosine": return `${n}_cosine_ops`;
-		case "l2": return `${n}_l2_ops`;
-		case "inner": return `${n}_ip_ops`;
-	}
-}, qe = [
-	"id",
-	"tenantId",
-	"createdAt",
-	"updatedAt",
-	"createdBy",
-	"updatedBy",
-	"deletedAt",
-	"deletedBy"
-], Je = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, j = (e, t) => `${e}_${t.join("_")}_idx`, Ye = (e, t) => `${e}_${t.join("_")}_uq`, M = (e, t, n, r, i) => {
-	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];
-	if (typeof a != "string") throw Error(`hnsw index '${t}' on table '${e}' must reference a vector COLUMN, not an expression. pgvector's HNSW access method indexes a column directly.`);
-	let o = i[a];
-	if (o === void 0) throw Error(`hnsw index '${t}' on table '${e}' references unknown column '${a}'.`);
-	if (o.type !== "vector") throw Error(`hnsw index '${t}' on table '${e}' requires a vector() column — column '${a}' is '${o.type}'. HNSW is the pgvector approximate-nearest-neighbour method and only applies to vectors.`);
-}, Xe = (e, t) => {
-	let n;
-	for (let [r, i] of Object.entries(e)) i.type === "id" && i.idScheme === void 0 && (n === void 0 && (n = { ...e }), n[r] = {
-		...i,
-		idScheme: O(i.idSchemeInput, t)
-	});
-	return n ?? e;
-}, N = (e) => {
-	let n = e.appliedPrimaryKey ?? [];
-	return {
-		tableName: e.tableName,
-		fields: e.fields,
-		isReactive: e.isReactive,
-		appliedMixins: e.appliedMixins,
-		appliedIndexes: e.appliedIndexes,
-		appliedUniques: e.appliedUniques,
-		appliedFullText: e.appliedFullText,
-		appliedChecks: e.appliedChecks,
-		appliedRules: e.appliedRules ?? [],
-		appliedPluginRefs: e.appliedPluginRefs ?? [],
-		appliedPrimaryKey: n,
-		...e.previousTableName === void 0 ? {} : { previousTableName: e.previousTableName },
-		...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-		...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema },
-		fullTextIndex: ((t, n, r) => {
-			if (n.length === 0) throw Error(`fullTextIndex '${t}' on '${e.tableName}' has no columns.`);
-			if (x(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
-			return N({
-				...e,
-				tableName: e.tableName,
-				fields: e.fields,
-				isReactive: e.isReactive,
-				appliedMixins: e.appliedMixins,
-				appliedIndexes: e.appliedIndexes,
-				appliedUniques: e.appliedUniques,
-				appliedChecks: e.appliedChecks,
-				appliedPrimaryKey: e.appliedPrimaryKey,
-				appliedFullText: [...e.appliedFullText, {
-					name: t,
-					columns: [...n],
-					...r?.config === void 0 ? {} : { config: r.config },
-					...r?.weights === void 0 ? {} : { weights: r.weights }
-				}],
-				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-			});
-		}),
-		with: ((...t) => {
-			let n = A(t), r = { ...e.fields }, i = /* @__PURE__ */ new Map();
-			for (let e of Object.keys(r)) i.set(e, {
-				id: "<table>",
-				fields: {}
-			});
-			for (let t of n) for (let [n, a] of Object.entries(t.fields)) {
-				let o = i.get(n);
-				if (o !== void 0) throw Error(`mixin collision on column '${n}' in table '${e.tableName}': '${Je(o)}' and '${Je(t)}' both define it. If they're the same mixin reached via different paths, set a shared 'id' on both. If they're genuinely different concerns, rename one of the columns.`);
-				b(e.tableName, n), r[n] = a, i.set(n, t);
-			}
-			let a = [...e.appliedIndexes];
-			for (let t of n) for (let n of t.indexes ?? []) {
-				let t = n.name ?? j(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (x(e.tableName, t, n.name === void 0, n.fields), M(e.tableName, t, n.kind, n.fields, r), a.push({
-					name: t,
-					fields: n.fields,
-					...n.kind === void 0 ? {} : { kind: n.kind },
-					...n.kindOptions === void 0 ? {} : { kindOptions: n.kindOptions }
-				}));
-			}
-			return N({
-				...e,
-				tableName: e.tableName,
-				fields: r,
-				isReactive: e.isReactive,
-				appliedMixins: [...e.appliedMixins, ...n],
-				appliedIndexes: a,
-				appliedUniques: e.appliedUniques,
-				appliedFullText: e.appliedFullText,
-				appliedChecks: e.appliedChecks,
-				appliedPrimaryKey: e.appliedPrimaryKey,
-				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-			});
-		}),
-		index: ((...t) => {
-			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = j(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`index '${n}' on table '${e.tableName}' has no fields — an index must cover at least one column.`);
-			let o = r.filter((e) => typeof e == "string");
-			if (x(e.tableName, n, a, o), M(e.tableName, n, i?.kind, r, e.fields), e.appliedIndexes.some((e) => e.name === n)) throw t.length === 1 ? Error(`duplicate auto-named index '${n}' on table '${e.tableName}' — you've called .index(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (rare).`) : Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table.`);
-			return N({
-				...e,
-				tableName: e.tableName,
-				fields: e.fields,
-				isReactive: e.isReactive,
-				appliedMixins: e.appliedMixins,
-				appliedIndexes: [...e.appliedIndexes, {
-					name: n,
-					fields: [...r],
-					...i?.where === void 0 ? {} : { where: i.where },
-					...i?.kind === void 0 ? {} : { kind: i.kind },
-					...i?.kindOptions === void 0 ? {} : { kindOptions: i.kindOptions }
-				}],
-				appliedUniques: e.appliedUniques,
-				appliedFullText: e.appliedFullText,
-				appliedChecks: e.appliedChecks,
-				appliedPrimaryKey: e.appliedPrimaryKey,
-				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-			});
-		}),
-		expressionIndex: ((t, n, r) => {
-			if (n.length === 0) throw Error(`expressionIndex '${t}' on table '${e.tableName}' has no fields — an index must cover at least one column or expression.`);
-			let i = n.filter((e) => typeof e == "string");
-			if (x(e.tableName, t, !1, i), M(e.tableName, t, r?.kind, n, e.fields), e.appliedIndexes.some((e) => e.name === t)) throw Error(`duplicate index '${t}' on table '${e.tableName}': each index name must be unique within a table.`);
-			return N({
-				...e,
-				tableName: e.tableName,
-				fields: e.fields,
-				isReactive: e.isReactive,
-				appliedMixins: e.appliedMixins,
-				appliedIndexes: [...e.appliedIndexes, {
-					name: t,
-					fields: [...n],
-					...r?.where === void 0 ? {} : { where: r.where },
-					...r?.kind === void 0 ? {} : { kind: r.kind },
-					...r?.kindOptions === void 0 ? {} : { kindOptions: r.kindOptions }
-				}],
-				appliedUniques: e.appliedUniques,
-				appliedFullText: e.appliedFullText,
-				appliedChecks: e.appliedChecks,
-				appliedPrimaryKey: e.appliedPrimaryKey,
-				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-			});
-		}),
-		unique: ((...t) => {
-			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = Ye(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`unique '${n}' on table '${e.tableName}' has no fields — a UNIQUE constraint must cover at least one column.`);
-			if (x(e.tableName, n, a, r), e.appliedUniques.some((e) => e.name === n)) throw Error(a ? `duplicate auto-named UNIQUE '${n}' on table '${e.tableName}' — you've called .unique(${JSON.stringify(r)}) twice. Pass an explicit name to the second one if both are intended (very rare).` : `duplicate UNIQUE '${n}' on table '${e.tableName}': each constraint name must be unique within a table.`);
-			return N({
-				...e,
-				tableName: e.tableName,
-				fields: e.fields,
-				isReactive: e.isReactive,
-				appliedMixins: e.appliedMixins,
-				appliedIndexes: e.appliedIndexes,
-				appliedUniques: [...e.appliedUniques, {
-					name: n,
-					fields: [...r],
-					...i?.dedup === void 0 ? {} : { dedup: i.dedup }
-				}],
-				appliedFullText: e.appliedFullText,
-				appliedChecks: e.appliedChecks,
-				appliedPrimaryKey: e.appliedPrimaryKey,
-				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-			});
-		}),
-		uniqueActive: ((...t) => {
-			let n, r, i, a = Array.isArray(t[0]);
-			if (a ? (r = t[0], i = t[1], n = j(e.tableName, r)) : (n = t[0], r = t[1], i = t[2]), r.length === 0) throw Error(`uniqueActive '${n}' on table '${e.tableName}' has no fields — a partial UNIQUE must cover at least one column.`);
-			if (x(e.tableName, n, a, r), e.appliedIndexes.some((e) => e.name === n)) throw Error(`duplicate index '${n}' on table '${e.tableName}': each index name must be unique within a table (uniqueActive shares the index namespace).`);
-			let o = i?.where ?? "\"deletedAt\" IS NULL";
-			return N({
-				...e,
-				tableName: e.tableName,
-				fields: e.fields,
-				isReactive: e.isReactive,
-				appliedMixins: e.appliedMixins,
-				appliedIndexes: [...e.appliedIndexes, {
-					name: n,
-					fields: [...r],
-					where: o,
-					unique: !0
-				}],
-				appliedUniques: e.appliedUniques,
-				appliedFullText: e.appliedFullText,
-				appliedChecks: e.appliedChecks,
-				appliedPrimaryKey: e.appliedPrimaryKey,
-				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-			});
-		}),
-		check: ((t, n) => {
-			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
-			if (x(e.tableName, t, !1, []), e.appliedChecks.some((e) => e.name === t)) throw Error(`duplicate CHECK '${t}' on table '${e.tableName}': each constraint name must be unique within a table.`);
-			return N({
-				...e,
-				tableName: e.tableName,
-				fields: e.fields,
-				isReactive: e.isReactive,
-				appliedMixins: e.appliedMixins,
-				appliedIndexes: e.appliedIndexes,
-				appliedUniques: e.appliedUniques,
-				appliedFullText: e.appliedFullText,
-				appliedChecks: [...e.appliedChecks, {
-					name: t,
-					expr: n
-				}],
-				appliedPrimaryKey: e.appliedPrimaryKey,
-				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-				...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 N({
-				...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 y(t), N({
-				...e,
-				previousTableName: t
-			});
-		}),
-		primaryKey: ((t) => {
-			if (t.length === 0) throw Error(`primaryKey([...]) on table '${e.tableName}' needs at least one column.`);
-			let r = /* @__PURE__ */ new Set();
-			for (let n of t) {
-				if (!(n in e.fields)) throw Error(`primaryKey([...]) on table '${e.tableName}' references unknown column '${n}'.`);
-				if (r.has(n)) throw Error(`primaryKey([...]) on table '${e.tableName}' lists column '${n}' twice.`);
-				r.add(n);
-			}
-			if (n.length > 0) throw Error(`primaryKey([...]) declared twice on table '${e.tableName}'.`);
-			for (let [n, r] of Object.entries(e.fields)) if (r.type === "id" && !t.includes(n)) throw Error(`primaryKey([...]) on table '${e.tableName}' conflicts with the id() column '${n}'. The explicit primary key IS the key — drop the id() column, or include '${n}' in the composite key.`);
-			return N({
-				...e,
-				tableName: e.tableName,
-				fields: e.fields,
-				isReactive: e.isReactive,
-				appliedMixins: e.appliedMixins,
-				appliedIndexes: e.appliedIndexes,
-				appliedUniques: e.appliedUniques,
-				appliedFullText: e.appliedFullText,
-				appliedChecks: e.appliedChecks,
-				appliedPrimaryKey: [...t],
-				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-			});
-		}),
-		nonReactive: (() => N({
-			...e,
-			tableName: e.tableName,
-			fields: e.fields,
-			isReactive: !1,
-			appliedMixins: e.appliedMixins,
-			appliedIndexes: e.appliedIndexes,
-			appliedUniques: e.appliedUniques,
-			appliedFullText: e.appliedFullText,
-			appliedChecks: e.appliedChecks,
-			appliedPrimaryKey: e.appliedPrimaryKey,
-			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-		})),
-		validate: ((t) => N({
-			...e,
-			tableName: e.tableName,
-			fields: e.fields,
-			isReactive: e.isReactive,
-			appliedMixins: e.appliedMixins,
-			appliedIndexes: e.appliedIndexes,
-			appliedUniques: e.appliedUniques,
-			appliedFullText: e.appliedFullText,
-			appliedChecks: e.appliedChecks,
-			appliedPrimaryKey: e.appliedPrimaryKey,
-			insertSchema: t,
-			...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
-		})),
-		validatePatch: ((n) => N({
-			...e,
-			tableName: e.tableName,
-			fields: e.fields,
-			isReactive: e.isReactive,
-			appliedMixins: e.appliedMixins,
-			appliedIndexes: e.appliedIndexes,
-			appliedUniques: e.appliedUniques,
-			appliedFullText: e.appliedFullText,
-			appliedChecks: e.appliedChecks,
-			appliedPrimaryKey: e.appliedPrimaryKey,
-			...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
-			validatePatchSchema: t.partial(n)
-		}))
-	};
-}, Ze = (e, t) => {
-	y(e);
-	let n = Object.entries(t).flatMap(([e, t]) => {
-		let n = m(t);
-		return n === void 0 ? [] : [{
-			column: e,
-			...n
-		}];
-	}), r = Xe(f(t), e);
-	for (let t of Object.keys(r)) b(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 = N({
-		appliedPluginRefs: n,
-		tableName: e,
-		fields: r,
-		isReactive: !0,
-		appliedMixins: [],
-		appliedIndexes: [],
-		appliedUniques: [],
-		appliedFullText: [],
-		appliedChecks: [],
-		appliedRules: []
-	}), i;
-}, Qe = (e) => e === "sqlite" || e === "turso", $e = (e) => e === "mysql" || e === "mariadb", P = (e, t) => {
-	switch (t) {
-		case "mysql":
-		case "mariadb": return `\`${e.replace(/`/g, "``")}\``;
-		case "mssql": return `[${e.replace(/\]/g, "]]")}]`;
-		case "postgres":
-		case "sqlite":
-		case "turso": return `"${e.replace(/"/g, "\"\"")}"`;
-	}
-}, et = 1e4, tt = Symbol.for("@voltro/database/tableRegistry"), F = globalThis, I = F[tt] ?? (F[tt] = /* @__PURE__ */ new Map()), L = (e) => {
-	let t = I.get(e.tableName);
-	if (t === void 0) {
-		I.set(e.tableName, e);
-		return;
-	}
-	if (t !== e) throw Error(`duplicate table '${e.tableName}' registration: two different table descriptors claim the same name. Rename one or import the shared module that defines it.`);
-}, nt = (e) => {
-	I.get(e.tableName) === void 0 && I.set(e.tableName, e);
-}, R = (e) => I.get(e), rt = (e) => {
-	let t = I.get(e);
-	if (t === void 0) throw Error(`table '${e}' is not registered. Register it by wrapping it in \`databaseHandle({ ... })\` (the usual path) or call \`registerTable(t)\` explicitly before this runs. Note a \`queryFor(t)\` query carries its own source table, so eager-loads don't hit this — this error means a reconstructed descriptor or by-name tooling reached an unregistered table.`);
-	return t;
-}, it = () => [...I.values()], at = (e) => I.delete(e), ot = () => {
-	I.clear();
-}, st = (e) => I.get(e)?.isReactive !== !1, ct = (e) => e.order ?? [], lt = (e) => ({
-	op: "count",
-	alias: e ?? "count"
-}), ut = (e, t) => ({
-	op: "count-distinct",
-	column: e,
-	alias: t ?? `count_distinct_${e}`
-}), dt = (e, t) => ({
-	op: "sum",
-	column: e,
-	alias: t ?? `sum_${e}`
-}), ft = (e, t) => ({
-	op: "avg",
-	column: e,
-	alias: t ?? `avg_${e}`
-}), pt = (e, t) => ({
-	op: "min",
-	column: e,
-	alias: t ?? `min_${e}`
-}), mt = (e, t) => ({
-	op: "max",
-	column: e,
-	alias: t ?? `max_${e}`
-}), ht = (e, t) => ({
-	op: "column",
-	column: e,
-	alias: t ?? e
-}), z = (e) => (...t) => {
-	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return H({
-		table: t[0].descriptor.table,
-		predicate: void 0,
-		order: [],
-		take: void 0,
-		skip: void 0,
-		projection: void 0,
-		setOp: {
-			kind: e,
-			queries: t.map((e) => e.descriptor)
-		}
-	});
-}, gt = z("union"), _t = z("union-all"), vt = z("intersect"), yt = z("except"), B = (e) => ({ over: (t) => ({
-	...e,
-	window: t
-}) }), bt = (e = "rowNumber") => B({
-	op: "window-row-number",
-	alias: e
-}), xt = (e = "rank") => B({
-	op: "window-rank",
-	alias: e
-}), St = (e = "denseRank") => B({
-	op: "window-dense-rank",
-	alias: e
-}), Ct = (e, t = 1, n) => B({
-	op: "window-lag",
-	column: e,
-	alias: n ?? `lag_${e}`,
-	offset: t
-}), wt = (e, t = 1, n) => B({
-	op: "window-lead",
-	column: e,
-	alias: n ?? `lead_${e}`,
-	offset: t
-}), Tt = (e, t) => B({
-	op: "window-sum-over",
-	column: e,
-	alias: t ?? `sum_${e}_over`
-}), Et = (e, t) => B({
-	op: "window-avg-over",
-	column: e,
-	alias: t ?? `avg_${e}_over`
-}), V = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? R(e)?.appliedFullText?.find((e) => e.name === t);
-	if (r === void 0) throw Error(`.matching('${t}', ...): no full-text index named '${t}' is declared on table '${e}'. Declare it with \`table(...).fullTextIndex('${t}', [columns])\` first.`);
-	return {
-		columns: r.columns,
-		...r.config === void 0 ? {} : { config: r.config },
-		...r.weights === void 0 ? {} : { weights: r.weights }
-	};
-}, H = (e) => ({
-	descriptor: e,
-	where(t) {
-		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return H({
-			...e,
-			predicate: n
-		});
-	},
-	orderBy(t, n = "asc") {
-		return H({
-			...e,
-			order: [...e.order, {
-				column: t,
-				direction: n
-			}]
-		});
-	},
-	limit(t) {
-		return H({
-			...e,
-			take: t
-		});
-	},
-	offset(t) {
-		return H({
-			...e,
-			skip: t
-		});
-	},
-	select(...t) {
-		return H({
-			...e,
-			projection: t
-		});
-	},
-	using(t) {
-		return H({
-			...e,
-			usingIndex: t
-		});
-	},
-	withDeleted() {
-		return H({
-			...e,
-			includeDeleted: !0
-		});
-	},
-	forUpdate() {
-		return H({
-			...e,
-			lock: "update"
-		});
-	},
-	unscoped() {
-		return H({
-			...e,
-			crossTenant: !0
-		});
-	},
-	with(t) {
-		let n = {
-			...e.eager ?? {},
-			...t
-		};
-		return H({
-			...e,
-			eager: n
-		});
-	},
-	count() {
-		return H({
-			...e,
-			projection: void 0,
-			aggregations: [{
-				op: "count",
-				alias: "count"
-			}]
-		});
-	},
-	aggregate(t) {
-		let n = Object.entries(t).map(([e, t]) => ({
-			...t,
-			alias: e
-		}));
-		return H({
-			...e,
-			projection: void 0,
-			aggregations: n
-		});
-	},
-	matching(t, n) {
-		let r = V(e.table, t, e.fullTextIndexes);
-		return H({
-			...e,
-			fullTextSearch: {
-				indexName: t,
-				query: n,
-				columns: r.columns,
-				...r.config === void 0 ? {} : { config: r.config },
-				...r.weights === void 0 ? {} : { weights: r.weights }
-			}
-		});
-	},
-	rankBy(t) {
-		let n = e.fullTextSearch;
-		if (n === void 0) throw Error(".rankBy() requires a preceding .matching(...) clause — there is no full-text search to rank on this query.");
-		return H({
-			...e,
-			fullTextSearch: {
-				...n,
-				rank: {
-					alias: t?.alias ?? "rank",
-					order: t?.order ?? !0
-				}
-			}
-		});
-	},
-	nearestNeighbours(t, n, r) {
-		if (typeof t == "string" && Array.isArray(n)) {
-			let i = {
-				column: t,
-				queryVector: n,
-				distance: r?.distance ?? "cosine",
-				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
-			};
-			return H({
-				...e,
-				annClause: i
-			});
-		}
-		if (typeof t == "string" && typeof n == "number") {
-			let r = {
-				column: "",
-				queryText: t,
-				distance: "cosine",
-				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
-			};
-			return H({
-				...e,
-				annClause: r,
-				take: n
-			});
-		}
-		throw Error("nearestNeighbours: call as (column, queryVector, options?) or (queryString, k).");
-	},
-	efSearch(t) {
-		let n = e.annClause ?? {
-			column: "",
-			distance: "cosine"
-		};
-		return H({
-			...e,
-			annClause: {
-				...n,
-				ef: t
-			}
-		});
-	},
-	use(t) {
-		return H({ ...t(e) });
-	},
-	distinct() {
-		return H({
-			...e,
-			distinct: !0
-		});
-	},
-	distinctOn(t) {
-		return H({
-			...e,
-			distinctOn: [...t]
-		});
-	},
-	as(t) {
-		return H({
-			...e,
-			alias: t
-		});
-	},
-	innerJoin(t, n, r) {
-		let i = typeof t == "string" ? t : t.tableName, a = [...e.joins ?? [], {
-			kind: "inner",
-			table: i,
-			alias: n,
-			on: r
-		}];
-		return H({
-			...e,
-			joins: a
-		});
-	},
-	leftJoin(t, n, r) {
-		let i = typeof t == "string" ? t : t.tableName, a = [...e.joins ?? [], {
-			kind: "left",
-			table: i,
-			alias: n,
-			on: r
-		}];
-		return H({
-			...e,
-			joins: a
-		});
-	},
-	selectJoined(t) {
-		let n = Object.entries(t).map(([e, t]) => ({
-			outputKey: e,
-			source: t
-		}));
-		return H({
-			...e,
-			projection: void 0,
-			joinedProjection: n
-		});
-	},
-	withCte(t, n) {
-		let r = e.ctes ?? [];
-		if (r.some((e) => e.name === t)) throw Error(`Query.withCte: duplicate CTE name '${t}'`);
-		return H({
-			...e,
-			ctes: [...r, {
-				name: t,
-				descriptor: n
-			}]
-		});
-	},
-	recursiveCte(t, n) {
-		let r = e.ctes ?? [];
-		if (r.some((e) => e.name === t)) throw Error(`Query.recursiveCte: duplicate CTE name '${t}'`);
-		return H({
-			...e,
-			ctes: [...r, {
-				name: t,
-				descriptor: n,
-				recursive: !0
-			}]
-		});
-	},
-	groupBy(t) {
-		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return H({
-			...e,
-			groupBy: n
-		});
-	},
-	having(t) {
-		let n = e.having ? { and: [e.having, t] } : t;
-		return H({
-			...e,
-			having: n
-		});
-	},
-	exists() {
-		return H({
-			...e,
-			projection: void 0,
-			aggregations: [{
-				op: "count",
-				alias: "__exists__"
-			}],
-			take: 1
-		});
-	}
-});
-function U(e) {
-	return H({
-		table: e.tableName,
-		predicate: void 0,
-		order: [],
-		take: void 0,
-		skip: void 0,
-		projection: void 0,
-		fullTextIndexes: e.appliedFullText,
-		sourceTable: e
-	});
-}
-var Dt = (e, t, n) => W(e, "id", t, n), W = (e, t, n, r, i = "asc") => {
-	let a = [...e.order.filter((e) => e.column !== t), {
-		column: t,
-		direction: i
-	}], o = n === void 0 ? void 0 : {
-		column: t,
-		op: i === "desc" ? "lt" : "gt",
-		value: n
-	}, s = o === void 0 ? e.predicate : e.predicate === void 0 ? o : { and: [e.predicate, o] };
-	return {
-		...e,
-		predicate: s,
-		order: a,
-		take: r
-	};
-}, Ot = (e) => {
-	let t = {};
-	for (let [n, r] of Object.entries(e)) L(r), t[n] = U(r);
-	return t;
-}, kt = (e) => e.isView === !0, At = (e, t, n) => {
-	if (y(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
-	let r = f(t);
-	for (let t of Object.keys(r)) b(e, t);
-	return {
-		tableName: e,
-		fields: r,
-		isView: !0,
-		viewSelect: n
-	};
-}, jt = (e) => U({
-	...e,
-	isReactive: !1,
-	appliedMixins: [],
-	appliedIndexes: [],
-	appliedUniques: [],
-	appliedFullText: [],
-	appliedChecks: []
-}), Mt = (e, t, n = null) => {
-	let r = n === null ? P(e.tableName, t) : `${P(n, t)}.${P(e.tableName, t)}`, i = e.viewSelect.trim();
-	switch (t) {
-		case "postgres":
-		case "mysql":
-		case "mariadb": return `CREATE OR REPLACE VIEW ${r} AS ${i};`;
-		case "mssql": return `CREATE OR ALTER VIEW ${r} AS ${i};`;
-		case "sqlite":
-		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
-	}
-}, Nt = (e) => e == null || typeof e == "boolean" ? e : typeof e == "number" ? e !== 0 : typeof e == "bigint" ? e !== 0n : typeof e == "string" ? e === "1" || e.toLowerCase() === "true" : e, G = (e) => {
-	if (e == null || typeof e != "string") return e;
-	let t = e.trim();
-	if (t.length === 0) return e;
-	let n = t.charAt(0);
-	if (n !== "{" && n !== "[" && n !== "\"" && n !== "t" && n !== "f" && n !== "n" && (n < "0" || n > "9") && n !== "-") return e;
-	try {
-		return JSON.parse(t);
-	} catch {
-		return e;
-	}
-}, Pt = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, Ft = (e) => {
-	if (e == null || e instanceof Date) return e;
-	if (typeof e == "string") {
-		let t = new Date(e);
-		return isNaN(t.getTime()) ? e : t;
-	}
-	if (typeof e == "number") {
-		let t = new Date(e);
-		return isNaN(t.getTime()) ? e : t;
-	}
-	return e;
-}, K = (e, t, n) => {
-	if (e == null) return e;
-	switch (t) {
-		case "boolean": return n === "postgres" ? e : Nt(e);
-		case "vector": return n === "postgres" ? G(e) : e;
-		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : G(e);
-		case "array": return n === "postgres" ? e : G(e);
-		case "timestamp":
-		case "date": return n === "sqlite" || n === "turso" ? Ft(e) : e;
-		case "decimal":
-		case "bigint": return Pt(e);
-		default: return e;
-	}
-}, It = (e, t, n) => {
-	if (e.length === 0) return e;
-	let r = R(t);
-	return r === void 0 ? e : q(e, r, n);
-}, q = (e, t, n) => {
-	if (e.length === 0) return e;
-	let r = t.fields, i = [];
-	for (let [e, t] of Object.entries(r)) i.push({
-		key: e,
-		type: t.type
-	});
-	return e.map((e) => {
-		let t = { ...e };
-		for (let { key: e, type: r } of i) e in t && (t[e] = K(t[e], r, n));
-		return t;
-	});
-}, Lt = (e, t) => {
-	if (e == null) return e;
-	switch (t) {
-		case "json": return JSON.stringify(e);
-		case "array":
-		case "vector": return typeof e == "string" ? e : JSON.stringify(e);
-		default: return e;
-	}
-}, Rt = (e, t, n = ["json", "array"]) => {
-	let r = R(t);
-	if (r === void 0) return e;
-	let i = r.fields, a = null;
-	for (let [t, r] of Object.entries(i)) if (n.includes(r.type) && t in e) {
-		let n = Lt(e[t], r.type);
-		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
-	}
-	return a ?? e;
-}, zt = /^[A-Za-z_][A-Za-z0-9_]*$/, Bt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : zt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), Vt = (e) => "{" + e.map((e) => {
-	let t = String(e);
-	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", Ht = (e, t, n, r = {}) => {
-	let i = P(e, n), a = r.numeric ?? !1;
-	if (n === "postgres") {
-		let e = `(${i} #>> '${Vt(t)}'::text[])`;
-		return a ? `${e}::numeric` : e;
-	}
-	let o = Bt(t);
-	switch (n) {
-		case "mysql":
-		case "mariadb": {
-			let e = `JSON_UNQUOTE(JSON_EXTRACT(${i}, '${o}'))`;
-			return a ? `CAST(${e} AS DECIMAL(38,10))` : e;
-		}
-		case "mssql": {
-			let e = `JSON_VALUE(${i}, '${o}')`;
-			return a ? `CAST(${e} AS FLOAT)` : e;
-		}
-		case "sqlite":
-		case "turso": {
-			let e = `json_extract(${i}, '${o}')`;
-			return a ? `CAST(${e} AS REAL)` : e;
-		}
-	}
-}, J = (e, t) => {
-	let n = (e) => {
-		if (typeof e != "string" || !/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)$/.test(e)) return null;
-		let [t = "", n = ""] = e.replace(/^[+-]/, "").split("."), r = t.replace(/^0+/, "") || "0";
-		return {
-			negative: e.startsWith("-") && /[1-9]/.test(r + n),
-			whole: r,
-			fraction: n
-		};
-	}, r = n(e), i = n(t);
-	if (!r || !i) return null;
-	if (r.negative !== i.negative) return r.negative ? -1 : 1;
-	let a = r.whole.length - i.whole.length;
-	if (a === 0 && (a = r.whole === i.whole ? 0 : r.whole > i.whole ? 1 : -1), a === 0) {
-		let e = Math.max(r.fraction.length, i.fraction.length), t = r.fraction.padEnd(e, "0"), n = i.fraction.padEnd(e, "0");
-		a = t === n ? 0 : t > n ? 1 : -1;
-	}
-	return a === 0 ? 0 : (a > 0 ? 1 : -1) * (r.negative ? -1 : 1);
-}, Ut = (e, t) => ({
-	column: e,
-	op: "eq",
-	value: t
-}), Wt = (e, t) => ({
-	column: e,
-	op: "neq",
-	value: t
-}), Gt = (e, t) => ({
-	column: e,
-	op: "gt",
-	value: t
-}), Kt = (e, t) => ({
-	column: e,
-	op: "gte",
-	value: t
-}), qt = (e, t) => ({
-	column: e,
-	op: "lt",
-	value: t
-}), Jt = (e, t) => ({
-	column: e,
-	op: "lte",
-	value: t
-}), Yt = (e, t) => ({
-	column: e,
-	op: "in",
-	value: t
-}), Xt = (e, t) => ({
-	column: e,
-	op: "notIn",
-	value: t
-}), Zt = (e, t) => ({
-	column: e,
-	op: "contains",
-	value: t
-}), Qt = (e, t) => ({
-	column: e,
-	op: "startsWith",
-	value: t
-}), $t = (e, t) => ({
-	column: e,
-	op: "arrayContains",
-	value: t
-}), en = (e, t) => ({
-	column: e,
-	op: "arrayOverlaps",
-	value: t
-}), tn = (e, t) => ({
-	column: e,
-	op: "arrayHas",
-	value: t
-}), nn = {
-	column: "id",
-	op: "in",
-	value: []
-}, rn = (e) => ({
-	column: e,
-	op: "isNull"
-}), an = (e) => ({
-	column: e,
-	op: "isNotNull"
-}), on = (e, t) => ({
-	column: e,
-	op: "spatial",
-	value: t
-}), sn = (...e) => ({ and: e }), cn = (...e) => ({ or: e }), ln = (e) => ({ not: e }), un = (e, ...t) => {
-	if (t.length === 0) throw Error(`jsonField("${e}"): at least one path segment is required`);
-	let n = (n, r) => ({
-		column: e,
-		path: t,
-		op: n,
-		value: r
-	});
-	return {
-		eq: (e) => n("eq", e),
-		neq: (e) => n("neq", e),
-		gt: (e) => n("gt", e),
-		gte: (e) => n("gte", e),
-		lt: (e) => n("lt", e),
-		lte: (e) => n("lte", e),
-		inSet: (e) => n("in", e),
-		notInSet: (e) => n("notIn", e),
-		contains: (e) => n("contains", e),
-		startsWith: (e) => n("startsWith", e),
-		isNull: () => n("isNull"),
-		isNotNull: () => n("isNotNull")
-	};
-}, Y = (e) => "descriptor" in e ? e.descriptor : e, dn = (e, t) => ({
-	column: e,
-	op: "subquery-in",
-	subquery: Y(t)
-}), fn = (e, t) => ({
-	column: e,
-	op: "subquery-not-in",
-	subquery: Y(t)
-}), pn = (e) => ({
-	op: "exists",
-	subquery: Y(e)
-}), mn = (e) => ({
-	op: "not-exists",
-	subquery: Y(e)
-}), hn = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, gn = (e) => {
-	if (e instanceof Date) return e.getTime();
-	if (typeof e == "string" && hn.test(e)) {
-		let t = Date.parse(e);
-		return Number.isNaN(t) ? void 0 : t;
-	}
-}, _n = (e, t) => {
-	if (!(e instanceof Date) && !(t instanceof Date)) return;
-	let n = gn(e), r = gn(t);
-	return n === void 0 || r === void 0 ? void 0 : [n, r];
-}, vn = (e, t) => {
-	if (e === t) return !0;
-	let n = _n(e, t);
-	return n !== void 0 && n[0] === n[1];
-}, yn = (e, t) => {
-	if (e == null || t == null) return null;
-	let n = _n(e, t);
-	if (n !== void 0) return n[0] === n[1] ? 0 : n[0] > n[1] ? 1 : -1;
-	let r = e instanceof Date ? e.getTime() : e, i = t instanceof Date ? t.getTime() : t;
-	return typeof r == typeof i ? r === i ? 0 : r > i ? 1 : -1 : null;
-}, X = (e, t, n = null, r = {}) => {
-	if (!t) return !1;
-	if ("not" in e) return !X(e.not, t, n, r);
-	if ("and" in e) {
-		for (let i of e.and) if (!X(i, t, n, r)) return !1;
-		return !0;
-	}
-	if ("or" in e) {
-		for (let i of e.or) if (X(i, t, n, r)) return !0;
-		return !1;
-	}
-	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
-		if (!n) return !1;
-		let i = n.get(e.subquery);
-		if (!(i instanceof Set)) return !1;
-		let a = t[e.column], o = r[e.column]?.type === "decimal" ? [...i].some((e) => J(a, e) === 0) : i.has(a);
-		return e.op === "subquery-in" ? o : !o;
-	}
-	if (e.op === "exists" || e.op === "not-exists") {
-		if (!n) return !1;
-		let t = n.get(e.subquery), r = typeof t == "number" ? t > 0 : t instanceof Set && t.size > 0;
-		return e.op === "exists" ? r : !r;
-	}
-	let i = e, a = t[i.column], o = r[i.column]?.type === "decimal", s = (e, t) => o && e != null && t != null ? J(e, t) === 0 : vn(e, t), c = o ? J : yn;
-	switch (i.op) {
-		case "eq": return s(a, i.value);
-		case "neq": return !s(a, i.value);
-		case "gt": return (c(a, i.value) ?? -1) > 0;
-		case "gte": return (c(a, i.value) ?? -1) >= 0;
-		case "lt": return (c(a, i.value) ?? 1) < 0;
-		case "lte": return (c(a, i.value) ?? 1) <= 0;
-		case "in": return Array.isArray(i.value) && i.value.some((e) => s(a, e));
-		case "notIn": return Array.isArray(i.value) && !i.value.some((e) => s(a, e));
-		case "contains": return typeof a == "string" && typeof i.value == "string" && a.toLowerCase().includes(i.value.toLowerCase());
-		case "startsWith": return typeof a == "string" && typeof i.value == "string" && a.startsWith(i.value);
-		case "arrayContains": {
-			let e = Array.isArray(a) ? a : [];
-			return (Array.isArray(i.value) ? i.value : []).every((t) => e.includes(t));
-		}
-		case "arrayOverlaps": {
-			let e = Array.isArray(a) ? a : [];
-			return (Array.isArray(i.value) ? i.value : []).some((t) => e.includes(t));
-		}
-		case "arrayHas": return Array.isArray(a) && a.includes(i.value);
-		case "isNull": return a == null;
-		case "isNotNull": return a != null;
-		case "spatial": throw Error("@voltro/plugin-postgis: spatial predicates (ST_DWithin / ST_Contains / ST_Within / ST_Intersects / bbox &&) are not evaluable in-memory — use them in one-shot ctx.store.query reads, not reactive subscriptions.");
-	}
-}, Z = function* (e) {
-	if ("not" in e) {
-		yield* Z(e.not);
-		return;
-	}
-	if ("and" in e) {
-		for (let t of e.and) yield* Z(t);
-		return;
-	}
-	if ("or" in e) {
-		for (let t of e.or) yield* Z(t);
-		return;
-	}
-	e.op === "subquery-in" || e.op === "subquery-not-in" ? yield {
-		kind: "in",
-		descriptor: e.subquery
-	} : (e.op === "exists" || e.op === "not-exists") && (yield {
-		kind: "exists",
-		descriptor: e.subquery
-	});
-}, Q = function* (e, t = !0) {
-	if ("not" in e) {
-		yield* Q(e.not, !1);
-		return;
-	}
-	if ("and" in e) {
-		for (let n of e.and) yield* Q(n, t);
-		return;
-	}
-	if ("or" in e) {
-		for (let t of e.or) yield* Q(t, !1);
-		return;
-	}
-	e.op !== "subquery-in" && e.op !== "subquery-not-in" && e.op !== "exists" && e.op !== "not-exists" && (yield {
-		...e,
-		conjunctive: t
-	});
-}, bn = (e, t) => ({
-	name: e,
-	body: t
-}), xn = (e) => {
-	if (e.lifecycle === "cron" && !e.cron) throw Error(`seed "${e.id}": lifecycle 'cron' requires a 'cron' field`);
-	if (e.lifecycle === "onSchemaChange" && (!e.watchedTables || e.watchedTables.length === 0)) throw Error(`seed "${e.id}": lifecycle 'onSchemaChange' requires at least one entry in 'watchedTables'`);
-	let t = e.steps({ step: bn });
-	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
-	};
-}, Sn = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, Cn = null, wn = null, Tn = (e) => {
-	Cn = e;
-}, En = (e) => {
-	wn = e;
-}, Dn = async (e) => {
-	let t = Cn;
-	t !== null && await t(e);
-}, On = async (e) => {
-	let t = wn;
-	t !== null && e.changedTables.length !== 0 && await t(e);
-}, kn = (e) => {
-	if (!e.id || e.id.length === 0) throw Error("migration: `id` is required + must be non-empty");
-	if (!e.up || !e.down) throw Error(`migration ${e.id}: both \`up\` and \`down\` must be functions`);
-	return e;
-}, $ = Symbol.for("voltro.migration.irreversible"), An = class extends Error {
-	migrationId;
-	reason;
-	_tag = "IrreversibleMigrationError";
-	constructor(e, t) {
-		super(`migration ${e} cannot be rolled back: ${t}`), this.migrationId = e, this.reason = t, this.name = "IrreversibleMigrationError";
-	}
-}, jn = (t) => {
-	if (!t || t.trim().length === 0) throw Error("irreversible(): a reason is required");
-	return Object.assign(() => e.fail(new An("<unknown>", t)), { [$]: t });
-}, Mn = (e) => {
-	let t = e[$];
-	return typeof t == "string" ? t : void 0;
-}, Nn = class {
-	reason;
-	_tag = "MigrationSkipped";
-	constructor(e) {
-		this.reason = e;
-	}
-}, Pn = class extends Error {
-	migrationId;
-	failed;
-	_tag = "MigrationExpectationFailed";
-	constructor(e, t) {
-		super(`migration ${e}: ${t.length} post-condition(s) did not hold after up():\n` + t.map((e) => `  - ${e}`).join("\n") + "\n  The migration is NOT recorded; the next run applies it again."), this.migrationId = e, this.failed = t, this.name = "MigrationExpectationFailed";
-	}
-}, Fn = class extends Error {
-	migrationId;
-	dialect;
-	_tag = "TransactionBrokenByBodyError";
-	constructor(e, t) {
-		super(`migration ${e} is transactional, and its body COMMITTED the transaction from inside — on ${t} a DDL statement commits everything before it. The work is in the database and the migration is recorded; it will not run again. What did not hold is the all-or-nothing guarantee. Either mark it \`transactional: false\` (per-statement, resumable through your own idempotency) or move the schema change into \`ctx.schema\` in a migration of its own and keep this one to data.`), this.migrationId = e, this.dialect = t, this.name = "TransactionBrokenByBodyError";
-	}
-}, In = class extends Error {
-	table;
-	report;
-	_tag = "RewriteUnstableError";
-	constructor(e, t) {
-		super(`rewrite of ${e} did not stabilise after ${t.passes} pass(es): ${t.rewritten} rewritten, ${t.contended} contended on the last pass. Something is still writing these rows — raise maxPasses, or stop the writer first.`), this.table = e, this.report = t, this.name = "RewriteUnstableError";
-	}
-}, Ln = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Rn = (e) => typeof e == "object" && !!e && "id" in e && "up" in e && "down" in e && typeof e.id == "string" && typeof e.up == "function" && typeof e.down == "function", zn = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Bn = (e) => zn.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Vn = "_voltro_staging_", Hn = (e) => e.startsWith(Vn), Un = /__dropped_\d{14}$/, Wn = (e) => Un.test(e), Gn = 7, Kn = (e) => {
-	let t = /__dropped_(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})$/.exec(e);
-	if (t === null) return;
-	let [, n, r, i, a, o, s] = t;
-	return new Date(Date.UTC(Number(n), Number(r) - 1, Number(i), Number(a), Number(o), Number(s)));
-}, qn = (e, t = {}) => {
-	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
-		let a = Kn(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), !Wn(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
-	return i;
-}, Jn = (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 { Q as $, D as $t, en as A, ge as An, dt as At, an as B, o as Bn, rt as Bt, Sn as C, pe as Cn, ct as Ct, sn as D, le as Dn, xt as Dt, nn as E, fe as En, U as Et, pn as F, ye as Fn, ot as Ft, Wt as G, u as Gn, P as Gt, un as H, he as Hn, et as Ht, Gt as I, ue as In, nt as It, Xt as J, Ze as Jt, ln as K, ce as Kn, qe as Kt, Kt as L, f as Ln, R as Lt, Zt as M, xe as Mn, gt as Mt, Ut as N, ee as Nn, _t as Nt, $t as O, oe as On, V as Ot, X as P, te as Pn, it as Pt, Qt as Q, A as Qt, Yt as R, ie as Rn, st as Rt, Dn as S, de as Sn, pt as St, Tn as T, a as Tn, Dt as Tt, qt as U, me as Un, $e as Ut, rn as V, ne as Vn, at as Vt, Jt as W, i as Wn, Qe as Wt, cn as X, We as Xt, fn as Y, Ke as Yt, on as Z, k as Zt, Mn as _, c as _n, yt as _t, Jn as a, ke as an, Rt as at, xn as b, ae as bn, wt as bt, Hn as c, x as cn, At as ct, An as d, Ee as dn, Et as dt, Ue as en, J as et, Pn as f, De as fn, ht as ft, jn as g, m as gn, St as gt, Fn as h, Ce as hn, Ot as ht, qn as i, Oe as in, It as it, Z as j, be as jn, Tt as jt, tn as k, re as kn, bt as kt, Kn as l, y as ln, Mt as lt, In as m, Te as mn, ut as mt, zn as n, E as nn, K as nt, Bn as o, Ae as on, kt as ot, Nn as p, we as pn, lt as pt, mn as q, _e as qn, Ge as qt, Vn as r, Ve as rn, q as rt, Wn as s, b as sn, jt as st, Gn as t, O as tn, Ht as tt, Ln as u, S as un, ft as ut, Rn as v, d as vn, vt, En as w, s as wn, W as wt, On as x, se as xn, mt as xt, kn as y, ve as yn, Ct as yt, dn as z, Se as zn, L as zt };