@voltro/database 0.74.0 → 0.76.0

package/dist/frameworkTables-CSY95jCs.js

@@ -0,0 +1,2186 @@
+import { Cause as e, Effect as t, Runtime as n, Schema as r } from "effect";
+import { typeid as i } from "typeid-js";
+import { ulid as a } from "ulidx";
+//#region src/columns.ts
+var o = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) r.serverOnly === !0 && t.push(n);
+	return t;
+}, s = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
+	return t;
+}, c = (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;
+}, l = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) r.crdtManaged === !0 && t.push(n);
+	return t;
+}, u = 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;
+	}
+}, d = (e) => new u({
+	type: e,
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1
+});
+function f(e) {
+	return new u({
+		type: "id",
+		nullable: !1,
+		unique: !0,
+		hasDefault: !1,
+		idSchemeInput: e
+	});
+}
+var p = () => d("text"), m = () => d("integer"), h = () => d("real"), g = (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 u({
+		type: "decimal",
+		nullable: !1,
+		unique: !1,
+		hasDefault: !1,
+		precision: e,
+		scale: t
+	});
+}, ee = g, te = () => d("bigint"), ne = (e, t) => {
+	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
+	return {
+		name: e,
+		values: t,
+		column: () => new u({
+			type: "enum",
+			nullable: !1,
+			unique: !1,
+			hasDefault: !1,
+			enumName: e,
+			enumValues: t
+		})
+	};
+}, re = () => d("boolean"), _ = () => d("timestamp"), ie = () => d("date"), v = () => d("json"), y = () => d("bytes"), b = () => new u({
+	type: "bytes",
+	nullable: !0,
+	unique: !1,
+	hasDefault: !1,
+	crdtManaged: !0
+}), ae = () => new u({
+	type: "bytes",
+	nullable: !0,
+	unique: !1,
+	hasDefault: !1,
+	crdtManaged: !0
+}), x = () => {
+	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 S(e) {
+	return C(x, e);
+}
+function C(e, t) {
+	return new u({
+		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 oe = () => new u({
+	type: "text",
+	nullable: !0,
+	unique: !1,
+	hasDefault: !1,
+	dropped: !0
+}), se = (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 u({
+		type: "vector",
+		nullable: !1,
+		unique: !1,
+		hasDefault: !1,
+		vectorDim: e,
+		vectorPrecision: t?.precision ?? "float32"
+	});
+}, ce = (e) => new u({
+	type: "array",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	arrayElement: e.__definition().type
+}), le = () => d("interval"), ue = (e, t = 4326) => new u({
+	type: "text",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	spatial: {
+		kind: "geography",
+		geomKind: e,
+		srid: t
+	}
+}), de = (e, t = 4326) => new u({
+	type: "text",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	spatial: {
+		kind: "geometry",
+		geomKind: e,
+		srid: t
+	}
+}), fe = (e) => new u({
+	type: "raw",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	rawDdl: e
+}), w = (e) => {
+	let t = {};
+	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
+	return t;
+}, pe = /* @__PURE__ */ new WeakMap(), me = (e) => typeof e == "object" && e ? pe.get(e) : void 0, he = (e, t = {}) => {
+	let n = p();
+	return pe.set(n, {
+		target: e,
+		orphanPolicy: t.orphanPolicy ?? "keep",
+		onSoftDelete: t.onSoftDelete ?? !1
+	}), n;
+}, T = /* @__PURE__ */ new Map(), ge = (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 = T.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), T.set(e, n);
+}, _e = (e) => T.get(e) ?? [], ve = () => T, ye = () => {
+	T.clear();
+}, be = (t) => {
+	let r = t;
+	for (let t = 0; t < 4 && n.isFiberFailure(r); t++) r = e.squash(r[n.FiberFailureCauseId]);
+	return r;
+}, xe = (t, r = 0) => {
+	if (r >= 4 || !n.isFiberFailure(t)) return [t];
+	let i = t[n.FiberFailureCauseId], a = [...e.failures(i), ...e.defects(i)];
+	if (a.length === 0) return [e.squash(i)];
+	let o = [];
+	for (let e of a.slice(0, 8)) o.push(...xe(e, r + 1));
+	return o;
+}, Se = (e) => e.dbCode !== void 0 || e.dbErrno !== void 0 || e.dbNumber !== void 0 || e.dbSqlState !== void 0 || e.dbConstraint !== void 0, Ce = (e) => {
+	let t = {}, n = [], r = be(e);
+	for (let e = 0; e < 8 && typeof r == "object" && r; e++) {
+		let e = r;
+		t.dbCode === void 0 && (typeof e.code == "string" || typeof e.code == "number") && (t.dbCode = e.code), t.dbErrno === void 0 && typeof e.errno == "number" && (t.dbErrno = e.errno), t.dbNumber === void 0 && typeof e.number == "number" && (t.dbNumber = e.number), t.dbSqlState === void 0 && typeof e.sqlState == "string" && (t.dbSqlState = e.sqlState), t.dbBindings === void 0 && typeof e.voltroBindings == "string" && (t.dbBindings = e.voltroBindings), t.dbStatement === void 0 && typeof e.sql == "string" && e.sql.includes("?") && (t.dbStatement = e.sql, t.dbPlaceholders = (e.sql.match(/\?/g) ?? []).length), t.dbFatal === void 0 && typeof e.fatal == "boolean" && (t.dbFatal = e.fatal), t.dbConstraint === void 0 && typeof e.constraint == "string" && (t.dbConstraint = e.constraint), t.dbTable === void 0 && typeof e.table == "string" && (t.dbTable = e.table), t.dbColumn === void 0 && typeof e.column == "string" && (t.dbColumn = e.column), t.dbSchema === void 0 && typeof e.schema == "string" && (t.dbSchema = e.schema);
+		let i = e.sqlMessage ?? e.detail;
+		t.dbMessage === void 0 && typeof i == "string" && (t.dbMessage = i);
+		let a = typeof e.constructor == "function" ? e.constructor.name : void 0, o = typeof e._tag == "string" && e._tag || typeof e.name == "string" && e.name || (typeof a == "string" && a !== "Object" ? a : void 0), s = typeof e.message == "string" ? e.message : void 0;
+		(o || s) && n.push(`${o || "Error"}${s ? `: ${s.slice(0, 200)}` : ""}`), r = be(e.cause);
+	}
+	return n.length > 0 && (t.dbCauseChain = n.join(" ← "), t.dbMessage === void 0 && (t.dbMessage = n[n.length - 1])), t;
+}, we = (e) => {
+	let t = xe(e).map(Ce);
+	if (t.length <= 1) return t[0] ?? {};
+	let n = t.find(Se) ?? t[0], r = t.filter((e) => e !== n).map((e) => e.dbCauseChain).filter((e) => typeof e == "string");
+	if (r.length === 0) return n;
+	let i = typeof n.dbCauseChain == "string" ? n.dbCauseChain : void 0;
+	return {
+		...n,
+		dbCauseChain: [i, ...r].filter(Boolean).join(" ‖ ")
+	};
+}, Te = (e, t) => {
+	let n = we(e), r = je(n, t);
+	if (r !== void 0) {
+		let e = r.constraint ?? r.column;
+		return e === void 0 ? r.kind : `${r.kind}: ${e}`;
+	}
+	let i = n.dbCode ?? n.dbSqlState ?? n.dbErrno ?? n.dbNumber, a = Oe(e);
+	return i !== void 0 && Ee.test(String(i)) ? `${a} (${String(i)})` : a;
+}, Ee = /^[A-Za-z0-9_]{1,32}$/, De = /^[A-Za-z_][A-Za-z0-9_]{0,63}$/, Oe = (e) => {
+	let t = e?._tag, n = e?.name, r = (typeof t == "string" ? t : typeof n == "string" ? n : "").split(/[^A-Za-z0-9_]+/).filter(Boolean).pop();
+	return r !== void 0 && De.test(r) ? r : "unknown";
+}, ke = /^[A-Za-z_][A-Za-z0-9_$]*$/, E = (e) => e !== void 0 && e.length <= 128 && ke.test(e) ? e : void 0, Ae = (e) => e === void 0 ? void 0 : e.split(".").pop() ?? e, D = (e, ...t) => {
+	for (let n of t) {
+		let t = n.exec(e);
+		if (t?.[1] !== void 0) return t[1];
+	}
+}, je = (e, t) => {
+	let n = e.dbCode, r = e.dbErrno, i = e.dbNumber, a = typeof e.dbMessage == "string" ? e.dbMessage : "", o = `${typeof e.dbCauseChain == "string" ? e.dbCauseChain : ""} ${a}`;
+	if (n === "23503") {
+		let t = E(e.dbConstraint);
+		return {
+			kind: /is still referenced from table/i.test(o) ? "foreignKeyInUse" : "foreignKey",
+			...t === void 0 ? {} : { constraint: t }
+		};
+	}
+	if (n === "23505") {
+		let t = E(e.dbConstraint);
+		return {
+			kind: "unique",
+			...t === void 0 ? {} : { constraint: t }
+		};
+	}
+	if (n === "23502") {
+		let t = E(e.dbColumn);
+		return {
+			kind: "notNull",
+			...t === void 0 ? {} : { column: t }
+		};
+	}
+	if (n === "23514") {
+		let t = E(e.dbConstraint);
+		return {
+			kind: "check",
+			...t === void 0 ? {} : { constraint: t }
+		};
+	}
+	if (r === 1452 || r === 1451) {
+		let e = E(D(o, /CONSTRAINT `([^`]+)`/));
+		return {
+			kind: r === 1451 ? "foreignKeyInUse" : "foreignKey",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+	if (r === 1062) {
+		let e = E(Ae(D(o, /for key '([^']+)'/)));
+		return {
+			kind: "unique",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+	if (r === 1048 || r === 1364) {
+		let e = E(D(o, /Column '([^']+)' cannot be null/, /Field '([^']+)' doesn't have a default value/));
+		return {
+			kind: "notNull",
+			...e === void 0 ? {} : { column: e }
+		};
+	}
+	if (r === 3819 || r === 4025) {
+		let e = E(D(o, /Check constraint '([^']+)'/, /CONSTRAINT `([^`]+)` failed/));
+		return {
+			kind: "check",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+	if (i === 547) {
+		let e = D(o, /(?:FOREIGN KEY|REFERENCE) constraint "([^"]+)"/), t = D(o, /CHECK constraint "([^"]+)"/);
+		if (t !== void 0 && e === void 0) {
+			let e = E(t);
+			return {
+				kind: "check",
+				...e === void 0 ? {} : { constraint: e }
+			};
+		}
+		let n = /REFERENCE constraint/.test(o), r = E(e);
+		return {
+			kind: n ? "foreignKeyInUse" : "foreignKey",
+			...r === void 0 ? {} : { constraint: r }
+		};
+	}
+	if (i === 2627 || i === 2601) {
+		let e = E(D(o, /(?:UNIQUE KEY|PRIMARY KEY) constraint '([^']+)'/, /index '([^']+)'/));
+		return {
+			kind: "unique",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+	if (i === 515) {
+		let e = E(D(o, /Cannot insert the value NULL into column '([^']+)'/));
+		return {
+			kind: "notNull",
+			...e === void 0 ? {} : { column: e }
+		};
+	}
+	if (n === "SQLITE_CONSTRAINT_FOREIGNKEY") return { kind: t === "delete" || t === "deleteMany" || t === "hardDelete" ? "foreignKeyInUse" : "foreignKey" };
+	if (n === "SQLITE_CONSTRAINT_UNIQUE" || n === "SQLITE_CONSTRAINT_PRIMARYKEY") {
+		let e = E(Ae(D(o, /UNIQUE constraint failed: ([^,\s]+)/)));
+		return {
+			kind: "unique",
+			...e === void 0 ? {} : { column: e }
+		};
+	}
+	if (n === "SQLITE_CONSTRAINT_NOTNULL") {
+		let e = E(Ae(D(o, /NOT NULL constraint failed: ([^,\s]+)/)));
+		return {
+			kind: "notNull",
+			...e === void 0 ? {} : { column: e }
+		};
+	}
+	if (n === "SQLITE_CONSTRAINT_CHECK") {
+		let e = E(D(a, /CHECK constraint failed: (.+)$/));
+		return {
+			kind: "check",
+			...e === void 0 ? {} : { constraint: e }
+		};
+	}
+}, Me = (e) => {
+	let t = je(e)?.kind;
+	return t === "foreignKey" || t === "foreignKeyInUse";
+}, Ne = (e) => {
+	let t = e.dbCode, n = e.dbErrno;
+	return t === "57014" || n === 3024 || n === 1969 || t === "ETIMEOUT" || t === "SQLITE_INTERRUPT";
+}, Pe = (e) => {
+	let t = we(e), n = [
+		t.dbCode === void 0 ? void 0 : `code=${String(t.dbCode)}`,
+		t.dbErrno === void 0 ? void 0 : `errno=${String(t.dbErrno)}`,
+		t.dbNumber === void 0 ? void 0 : `number=${String(t.dbNumber)}`,
+		t.dbSqlState === void 0 ? void 0 : `sqlState=${String(t.dbSqlState)}`,
+		t.dbConstraint === void 0 ? void 0 : `constraint=${String(t.dbConstraint)}`,
+		t.dbPlaceholders === void 0 ? void 0 : `placeholders=${String(t.dbPlaceholders)}`
+	].filter((e) => e !== void 0), r = typeof e?.message == "string" ? e.message : void 0, i = typeof t.dbMessage == "string" ? t.dbMessage : void 0, a = i === void 0 ? void 0 : n.length > 0 || i !== r && i !== `Error: ${String(r)}` ? i : void 0, o = typeof t.dbBindings == "string" ? `\n  bindings:  ${t.dbBindings}` : "", s = typeof t.dbStatement == "string" ? `\n  statement: ${t.dbStatement.length <= 400 ? t.dbStatement : `${t.dbStatement.slice(0, 400)}…`}` : "";
+	if (a !== void 0 || n.length !== 0) return [a, n.length > 0 ? `[${n.join(" ")}]` : void 0].filter((e) => e !== void 0 && e !== "").join(" ") + s + o;
+}, Fe = (e) => Object.entries(e).map(([e, t]) => `${e}:${Ie(t)}`).join(" "), Ie = (e) => {
+	if (e === null) return "null";
+	if (e === void 0) return "undefined";
+	if (typeof e == "bigint") return "bigint";
+	if (typeof e != "object") return typeof e;
+	if (e instanceof Date) return Number.isNaN(e.getTime()) ? "Date(Invalid)" : "Date";
+	if (Array.isArray(e)) return "Array";
+	if (globalThis.Buffer !== void 0 && globalThis.Buffer.isBuffer(e)) return "Buffer";
+	let t = e.constructor?.name;
+	return typeof t == "string" && t !== "" ? t : "Object";
+}, Le = 63, Re = 60, O = [], k = (e) => {
+	O.includes(e) || O.push(e);
+}, ze = () => {
+	let e = O.slice();
+	return O.length = 0, e;
+}, Be = /^[a-zA-Z_][a-zA-Z0-9_]*$/, Ve = (e, t) => {
+	if (t.length === 0) throw Error(`${e} cannot be empty.`);
+	if (!Be.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_]*$/.`);
+}, A = (e) => {
+	if (Ve("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 && k(`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.`);
+}, j = (e, t) => {
+	if (Ve("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 && k(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
+}, M = (e, t, n, r) => {
+	if (Ve("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 && k(`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.` : ""}`);
+}, N = (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 && k(`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).`);
+}, He = 1704067200000n, Ue = 10n, We = 12n, Ge = (1n << Ue) - 1n, Ke = (1n << We) - 1n, qe = We, Je = 22n, Ye = () => {
+	let e = process.env.SNOWFLAKE_MACHINE_ID;
+	if (e === void 0 || e === "") return 0n;
+	let t = BigInt(e);
+	if (t < 0n || t > Ge) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Ge}.`);
+	return t;
+}, Xe = () => ({
+	lastMs: 0n,
+	sequence: 0n,
+	machineId: Ye()
+}), P, Ze = () => (P === void 0 && (P = Xe()), P), Qe = () => {
+	P = Xe();
+}, $e = () => BigInt(Date.now()), et = (e) => {
+	let t = $e();
+	for (; t <= e;) t = $e();
+	return t;
+}, tt = () => {
+	let e = Ze(), t = $e();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & Ke, e.sequence === 0n && (t = et(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - He;
+	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
+	return (n << Je | e.machineId << qe | e.sequence).toString();
+}, nt = (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 N(n, {
+		kind: "derived",
+		tableName: e
+	}), n;
+}, rt = (e, t) => {
+	if (e === void 0) return {
+		kind: "typeid",
+		prefix: nt(t)
+	};
+	if ("prefix" in e && !("scheme" in e)) return N(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 ?? nt(t);
+			return e.prefix !== void 0 && N(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
+		};
+	}
+}, it = (e, t) => {
+	switch (e.kind) {
+		case "typeid": return i(e.prefix).toString();
+		case "ulid": return a();
+		case "numeric": return null;
+		case "snowflake": return tt();
+		case "custom": return e.generate(t);
+	}
+}, at = (e) => ({
+	fields: w(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 }
+}), ot = at, st = (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;
+}, ct = (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);
+}, lt = (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`;
+	}
+}, ut = [
+	"id",
+	"tenantId",
+	"createdAt",
+	"updatedAt",
+	"createdBy",
+	"updatedBy",
+	"deletedAt",
+	"deletedBy"
+], dt = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, ft = (e, t) => `${e}_${t.join("_")}_idx`, pt = (e, t) => `${e}_${t.join("_")}_uq`, mt = (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.`);
+}, ht = (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: rt(i.idSchemeInput, t)
+	});
+	return n ?? e;
+}, F = (e) => {
+	let t = 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: t,
+		...e.previousTableName === void 0 ? {} : { previousTableName: e.previousTableName },
+		...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
+		...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema },
+		fullTextIndex: ((t, n, r) => {
+			if (n.length === 0) throw Error(`fullTextIndex '${t}' on '${e.tableName}' has no columns.`);
+			if (M(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
+			return F({
+				...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 = st(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}': '${dt(o)}' and '${dt(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.`);
+				j(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 ?? ft(e.tableName, n.fields);
+				a.some((e) => e.name === t) || (M(e.tableName, t, n.name === void 0, n.fields), mt(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 F({
+				...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 = ft(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 (M(e.tableName, n, a, o), mt(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 F({
+				...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 (M(e.tableName, t, !1, i), mt(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 F({
+				...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 = pt(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 (M(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 F({
+				...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 = ft(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 (M(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 F({
+				...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 (M(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 F({
+				...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 F({
+				...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 A(t), F({
+				...e,
+				previousTableName: t
+			});
+		}),
+		primaryKey: ((n) => {
+			if (n.length === 0) throw Error(`primaryKey([...]) on table '${e.tableName}' needs at least one column.`);
+			let r = /* @__PURE__ */ new Set();
+			for (let t of n) {
+				if (!(t in e.fields)) throw Error(`primaryKey([...]) on table '${e.tableName}' references unknown column '${t}'.`);
+				if (r.has(t)) throw Error(`primaryKey([...]) on table '${e.tableName}' lists column '${t}' twice.`);
+				r.add(t);
+			}
+			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}'. The explicit primary key IS the key — drop the id() column, or include '${t}' in the composite key.`);
+			return F({
+				...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: [...n],
+				...e.insertSchema === void 0 ? {} : { insertSchema: e.insertSchema },
+				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
+			});
+		}),
+		nonReactive: (() => F({
+			...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) => F({
+			...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: ((t) => F({
+			...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: r.partial(t)
+		}))
+	};
+}, I = (e, t) => {
+	A(e);
+	let n = Object.entries(t).flatMap(([e, t]) => {
+		let n = me(t);
+		return n === void 0 ? [] : [{
+			column: e,
+			...n
+		}];
+	}), r = ht(w(t), e);
+	for (let t of Object.keys(r)) j(e, t);
+	let i;
+	for (let [t, n] of Object.entries(r)) n.references === x && (n.references = () => {
+		if (i === void 0) throw Error(`selfReference() on '${e}.${t}' read before table() returned`);
+		return i;
+	});
+	return i = F({
+		appliedPluginRefs: n,
+		tableName: e,
+		fields: r,
+		isReactive: !0,
+		appliedMixins: [],
+		appliedIndexes: [],
+		appliedUniques: [],
+		appliedFullText: [],
+		appliedChecks: [],
+		appliedRules: []
+	}), i;
+}, gt = (e) => e === "sqlite" || e === "turso", _t = (e) => e === "mysql" || e === "mariadb", L = (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, "\"\"")}"`;
+	}
+}, vt = 1e4, yt = Symbol.for("@voltro/database/tableRegistry"), bt = globalThis, R = bt[yt] ?? (bt[yt] = /* @__PURE__ */ new Map()), xt = (e) => {
+	let t = R.get(e.tableName);
+	if (t === void 0) {
+		R.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.`);
+}, St = (e) => {
+	R.get(e.tableName) === void 0 && R.set(e.tableName, e);
+}, z = (e) => R.get(e), Ct = (e) => {
+	let t = R.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;
+}, wt = () => [...R.values()], Tt = (e) => R.delete(e), Et = () => {
+	R.clear();
+}, Dt = (e) => R.get(e)?.isReactive !== !1, B = (e) => e.order ?? [], Ot = (e) => ({
+	op: "count",
+	alias: e ?? "count"
+}), kt = (e, t) => ({
+	op: "count-distinct",
+	column: e,
+	alias: t ?? `count_distinct_${e}`
+}), At = (e, t) => ({
+	op: "sum",
+	column: e,
+	alias: t ?? `sum_${e}`
+}), jt = (e, t) => ({
+	op: "avg",
+	column: e,
+	alias: t ?? `avg_${e}`
+}), Mt = (e, t) => ({
+	op: "min",
+	column: e,
+	alias: t ?? `min_${e}`
+}), Nt = (e, t) => ({
+	op: "max",
+	column: e,
+	alias: t ?? `max_${e}`
+}), Pt = (e, t) => ({
+	op: "column",
+	column: e,
+	alias: t ?? e
+}), V = (e) => (...t) => {
+	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
+	return U({
+		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)
+		}
+	});
+}, Ft = V("union"), It = V("union-all"), Lt = V("intersect"), Rt = V("except"), H = (e) => ({ over: (t) => ({
+	...e,
+	window: t
+}) }), zt = (e = "rowNumber") => H({
+	op: "window-row-number",
+	alias: e
+}), Bt = (e = "rank") => H({
+	op: "window-rank",
+	alias: e
+}), Vt = (e = "denseRank") => H({
+	op: "window-dense-rank",
+	alias: e
+}), Ht = (e, t = 1, n) => H({
+	op: "window-lag",
+	column: e,
+	alias: n ?? `lag_${e}`,
+	offset: t
+}), Ut = (e, t = 1, n) => H({
+	op: "window-lead",
+	column: e,
+	alias: n ?? `lead_${e}`,
+	offset: t
+}), Wt = (e, t) => H({
+	op: "window-sum-over",
+	column: e,
+	alias: t ?? `sum_${e}_over`
+}), Gt = (e, t) => H({
+	op: "window-avg-over",
+	column: e,
+	alias: t ?? `avg_${e}_over`
+}), Kt = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? z(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 }
+	};
+}, U = (e) => ({
+	descriptor: e,
+	where(t) {
+		let n = e.predicate ? { and: [e.predicate, t] } : t;
+		return U({
+			...e,
+			predicate: n
+		});
+	},
+	orderBy(t, n = "asc") {
+		return U({
+			...e,
+			order: [...e.order, {
+				column: t,
+				direction: n
+			}]
+		});
+	},
+	limit(t) {
+		return U({
+			...e,
+			take: t
+		});
+	},
+	offset(t) {
+		return U({
+			...e,
+			skip: t
+		});
+	},
+	select(...t) {
+		return U({
+			...e,
+			projection: t
+		});
+	},
+	using(t) {
+		return U({
+			...e,
+			usingIndex: t
+		});
+	},
+	withDeleted() {
+		return U({
+			...e,
+			includeDeleted: !0
+		});
+	},
+	forUpdate() {
+		return U({
+			...e,
+			lock: "update"
+		});
+	},
+	unscoped() {
+		return U({
+			...e,
+			crossTenant: !0
+		});
+	},
+	with(t) {
+		let n = {
+			...e.eager ?? {},
+			...t
+		};
+		return U({
+			...e,
+			eager: n
+		});
+	},
+	count() {
+		return U({
+			...e,
+			projection: void 0,
+			aggregations: [{
+				op: "count",
+				alias: "count"
+			}]
+		});
+	},
+	aggregate(t) {
+		let n = Object.entries(t).map(([e, t]) => ({
+			...t,
+			alias: e
+		}));
+		return U({
+			...e,
+			projection: void 0,
+			aggregations: n
+		});
+	},
+	matching(t, n) {
+		let r = Kt(e.table, t, e.fullTextIndexes);
+		return U({
+			...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 U({
+			...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 U({
+				...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 U({
+				...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 U({
+			...e,
+			annClause: {
+				...n,
+				ef: t
+			}
+		});
+	},
+	use(t) {
+		return U({ ...t(e) });
+	},
+	distinct() {
+		return U({
+			...e,
+			distinct: !0
+		});
+	},
+	distinctOn(t) {
+		return U({
+			...e,
+			distinctOn: [...t]
+		});
+	},
+	as(t) {
+		return U({
+			...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 U({
+			...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 U({
+			...e,
+			joins: a
+		});
+	},
+	selectJoined(t) {
+		let n = Object.entries(t).map(([e, t]) => ({
+			outputKey: e,
+			source: t
+		}));
+		return U({
+			...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 U({
+			...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 U({
+			...e,
+			ctes: [...r, {
+				name: t,
+				descriptor: n,
+				recursive: !0
+			}]
+		});
+	},
+	groupBy(t) {
+		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
+		return U({
+			...e,
+			groupBy: n
+		});
+	},
+	having(t) {
+		let n = e.having ? { and: [e.having, t] } : t;
+		return U({
+			...e,
+			having: n
+		});
+	},
+	exists() {
+		return U({
+			...e,
+			projection: void 0,
+			aggregations: [{
+				op: "count",
+				alias: "__exists__"
+			}],
+			take: 1
+		});
+	}
+});
+function qt(e) {
+	return U({
+		table: e.tableName,
+		predicate: void 0,
+		order: [],
+		take: void 0,
+		skip: void 0,
+		projection: void 0,
+		fullTextIndexes: e.appliedFullText,
+		sourceTable: e
+	});
+}
+var Jt = (e, t, n) => Yt(e, "id", t, n), Yt = (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
+	};
+}, Xt = (e) => {
+	let t = {};
+	for (let [n, r] of Object.entries(e)) xt(r), t[n] = qt(r);
+	return t;
+}, Zt = (e) => e.isView === !0, Qt = (e, t, n) => {
+	if (A(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
+	let r = w(t);
+	for (let t of Object.keys(r)) j(e, t);
+	return {
+		tableName: e,
+		fields: r,
+		isView: !0,
+		viewSelect: n
+	};
+}, $t = (e) => qt({
+	...e,
+	isReactive: !1,
+	appliedMixins: [],
+	appliedIndexes: [],
+	appliedUniques: [],
+	appliedFullText: [],
+	appliedChecks: []
+}), en = (e, t, n = null) => {
+	let r = n === null ? L(e.tableName, t) : `${L(n, t)}.${L(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};`;
+	}
+}, tn = (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, nn = (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;
+	}
+}, rn = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, an = (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;
+}, on = (e, t, n) => {
+	if (e == null) return e;
+	switch (t) {
+		case "boolean": return n === "postgres" ? e : tn(e);
+		case "vector": return n === "postgres" ? nn(e) : e;
+		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : nn(e);
+		case "array": return n === "postgres" ? e : nn(e);
+		case "timestamp":
+		case "date": return n === "sqlite" || n === "turso" ? an(e) : e;
+		case "decimal":
+		case "bigint": return rn(e);
+		default: return e;
+	}
+}, sn = (e, t, n) => {
+	if (e.length === 0) return e;
+	let r = z(t);
+	return r === void 0 ? e : cn(e, r, n);
+}, cn = (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] = on(t[e], r, n));
+		return t;
+	});
+}, ln = (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;
+	}
+}, un = (e, t, n = ["json", "array"]) => {
+	let r = z(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 = ln(e[t], r.type);
+		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
+	}
+	return a ?? e;
+}, dn = /^[A-Za-z_][A-Za-z0-9_]*$/, fn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : dn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), pn = (e) => "{" + e.map((e) => {
+	let t = String(e);
+	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
+}).join(",") + "}", W = (e, t, n, r = {}) => {
+	let i = L(e, n), a = r.numeric ?? !1;
+	if (n === "postgres") {
+		let e = `(${i} #>> '${pn(t)}'::text[])`;
+		return a ? `${e}::numeric` : e;
+	}
+	let o = fn(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;
+		}
+	}
+}, mn = class extends Error {
+	_tag = "TenantNamespaceUnresolved";
+	constructor(e) {
+		super(e), this.name = "TenantNamespaceUnresolved";
+	}
+}, hn = class extends Error {
+	_tag = "TenantNamespaceInvalid";
+	constructor(e) {
+		super(e), this.name = "TenantNamespaceInvalid";
+	}
+}, gn = 63, _n = "tenant_", vn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), yn = (e) => {
+	if (e == null || e === "") throw new mn("namespace isolation is on but the request has no resolvable tenant (subject.tenantId is null/empty). Refusing to run against a shared/default namespace — this would be a cross-tenant read. Authenticate with a tenant-scoped subject, or disable namespace isolation for this surface.");
+	let t = vn(e);
+	if (t.replace(/_/g, "") === "") throw new hn(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
+	let n = `${_n}${t}`;
+	if (n.length > gn) throw new hn(`namespace '${n}' for tenant '${e}' exceeds the ${gn}-byte identifier limit. Use a shorter tenant id.`);
+	return n;
+}, G = (e, t) => e === null ? t : `${e}.${t}`, bn = /* @__PURE__ */ new Set(["timestamp", "date"]), xn = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, Sn = (e, t) => {
+	if (e === void 0 || t == null || !bn.has(e) || t instanceof Date) return t;
+	if (typeof t == "number" && Number.isFinite(t)) return new Date(t);
+	if (typeof t == "string" && xn.test(t)) {
+		let e = new Date(t);
+		return Number.isNaN(e.getTime()) ? t : e;
+	}
+	return t;
+}, Cn = (e, t) => e === void 0 || !bn.has(e) ? t : t.map((t) => Sn(e, t)), wn = (e, t) => {
+	let { strings: n, values: r } = e, i = t.unsafe(n[0] ?? "");
+	for (let e = 0; e < r.length; e++) i = t`${i}${r[e]}${t.unsafe(n[e + 1] ?? "")}`;
+	return t`${i}`;
+}, K = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), q = (e, t, n = null, r) => {
+	if ("not" in e) return t`NOT (${q(e.not, t, n, r)})`;
+	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => q(e, t, n, r)));
+	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => q(e, t, n, r)));
+	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
+		let r = e, i = J(r.subquery, t, n);
+		return r.op === "subquery-in" ? t`${t(r.column)} IN (${i})` : t`${t(r.column)} NOT IN (${i})`;
+	}
+	if (e.op === "exists" || e.op === "not-exists") {
+		let r = e, i = J(r.subquery, t, n);
+		return r.op === "exists" ? t`EXISTS (${i})` : t`NOT EXISTS (${i})`;
+	}
+	let i = e, a = t(i.column), o = i.path, s = o !== void 0 && o.length > 0, c = () => t.onDialectOrElse({
+		mysql: () => t.unsafe(W(i.column, o, "mysql")),
+		mssql: () => t.unsafe(W(i.column, o, "mssql")),
+		sqlite: () => t.unsafe(W(i.column, o, "sqlite")),
+		orElse: () => t.unsafe(W(i.column, o, "postgres"))
+	}), l = () => t.onDialectOrElse({
+		mysql: () => t.unsafe(W(i.column, o, "mysql", { numeric: !0 })),
+		mssql: () => t.unsafe(W(i.column, o, "mssql", { numeric: !0 })),
+		sqlite: () => t.unsafe(W(i.column, o, "sqlite", { numeric: !0 })),
+		orElse: () => t.unsafe(W(i.column, o, "postgres", { numeric: !0 }))
+	}), u = s ? c() : a, d = s ? l() : a, f = (e) => s && e != null ? String(e) : e, p = (e) => s ? Number(e) : e, m = s || r === void 0 ? void 0 : z(r)?.fields?.[i.column]?.type, h = (e) => Sn(m, e);
+	switch (i.op) {
+		case "eq": return t`${u} = ${f(h(i.value))}`;
+		case "neq": return t`${u} <> ${f(h(i.value))}`;
+		case "gt": return t`${d} > ${p(i.value)}`;
+		case "gte": return t`${d} >= ${p(i.value)}`;
+		case "lt": return t`${d} < ${p(i.value)}`;
+		case "lte": return t`${d} <= ${p(i.value)}`;
+		case "in": {
+			let e = i.value ?? [];
+			return e.length === 0 ? t`FALSE` : t`${u} IN ${t.in(s ? e.map((e) => f(e)) : e)}`;
+		}
+		case "notIn": {
+			let e = i.value ?? [];
+			return e.length === 0 ? t`TRUE` : t`${u} NOT IN ${t.in(s ? e.map((e) => f(e)) : e)}`;
+		}
+		case "contains": {
+			let e = `%${K(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
+			return t.onDialectOrElse({
+				mysql: () => t`LOWER(${u}) LIKE LOWER(${e})`,
+				mssql: () => t`LOWER(${u}) LIKE LOWER(${e})`,
+				sqlite: () => t`LOWER(${u}) LIKE LOWER(${e})`,
+				orElse: () => t`${u} ILIKE ${e} ESCAPE '\\'`
+			});
+		}
+		case "startsWith": {
+			let e = `${K(typeof i.value == "string" ? i.value : String(i.value ?? ""))}%`;
+			return t.onDialectOrElse({
+				mysql: () => t`${u} LIKE ${e}`,
+				orElse: () => t`${u} LIKE ${e} ESCAPE '\\'`
+			});
+		}
+		case "arrayContains": {
+			let e = i.value ?? [];
+			return e.length === 0 ? t`TRUE` : t.onDialectOrElse({
+				mysql: () => t`JSON_CONTAINS(${u}, ${JSON.stringify(e)})`,
+				mssql: () => t`(SELECT COUNT(DISTINCT value) FROM OPENJSON(${u}) WHERE value IN ${t.in(e)}) = ${e.length}`,
+				sqlite: () => t`(SELECT COUNT(DISTINCT value) FROM json_each(${u}) WHERE value IN ${t.in(e)}) = ${e.length}`,
+				orElse: () => t`${u} @> ${e}`
+			});
+		}
+		case "arrayOverlaps": {
+			let e = i.value ?? [];
+			return e.length === 0 ? t`FALSE` : t.onDialectOrElse({
+				mysql: () => t.or(e.map((e) => t`JSON_CONTAINS(${u}, ${JSON.stringify(e)})`)),
+				mssql: () => t`EXISTS (SELECT 1 FROM OPENJSON(${u}) WHERE value IN ${t.in(e)})`,
+				sqlite: () => t`EXISTS (SELECT 1 FROM json_each(${u}) WHERE value IN ${t.in(e)})`,
+				orElse: () => t`${u} && ${e}`
+			});
+		}
+		case "arrayHas": return t.onDialectOrElse({
+			mysql: () => t`JSON_CONTAINS(${u}, ${JSON.stringify(i.value)})`,
+			mssql: () => t`${i.value} IN (SELECT value FROM OPENJSON(${u}))`,
+			sqlite: () => t`EXISTS (SELECT 1 FROM json_each(${u}) WHERE value = ${i.value})`,
+			orElse: () => t`${i.value} = ANY(${u})`
+		});
+		case "isNull": return t`${u} IS NULL`;
+		case "isNotNull": return t`${u} IS NOT NULL`;
+		case "spatial": {
+			let e = i.value, n = t.unsafe("::geometry"), r = e.bufferMeters === void 0 ? t`${e.geom}${n}` : t`ST_Buffer(${e.geom}::geography, ${e.bufferMeters})::geometry`;
+			return t.onDialectOrElse({
+				mysql: () => {
+					throw Error("@voltro/plugin-postgis: spatial predicates are postgres-only");
+				},
+				mssql: () => {
+					throw Error("@voltro/plugin-postgis: spatial predicates are postgres-only");
+				},
+				sqlite: () => {
+					throw Error("@voltro/plugin-postgis: spatial predicates are postgres-only");
+				},
+				orElse: () => e.fn === "ST_DWithin" ? t`ST_DWithin(${a}::geography, ${e.geom}::geography, ${e.distanceMeters})` : e.fn === "&&" ? t`${a}${n} && ${r}` : t`${t.unsafe(e.fn)}(${a}${n}, ${r})`
+			});
+		}
+	}
+}, Tn = (e, t) => {
+	let n = [];
+	return e.partitionBy && e.partitionBy.length > 0 && n.push(t`PARTITION BY ${t.csv(e.partitionBy.map((e) => t`${t(e)}`))}`), e.orderBy && e.orderBy.length > 0 && n.push(t`ORDER BY ${t.csv(e.orderBy.map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), n.length === 0 ? t`` : n.length === 1 ? n[0] : n.reduce((e, n, r) => r === 0 ? n : t`${e} ${n}`);
+}, En = (e, t) => t.csv(e.map((e) => {
+	let n = e.column === void 0 ? t.unsafe("*") : t`${t(e.column)}`;
+	if (e.op.startsWith("window-")) {
+		let r = Tn(e.window ?? {}, t);
+		switch (e.op) {
+			case "window-row-number": return t`ROW_NUMBER() OVER (${r}) AS ${t(e.alias)}`;
+			case "window-rank": return t`RANK() OVER (${r}) AS ${t(e.alias)}`;
+			case "window-dense-rank": return t`DENSE_RANK() OVER (${r}) AS ${t(e.alias)}`;
+			case "window-lag": return t`LAG(${n}, ${t.unsafe(String(e.offset ?? 1))}) OVER (${r}) AS ${t(e.alias)}`;
+			case "window-lead": return t`LEAD(${n}, ${t.unsafe(String(e.offset ?? 1))}) OVER (${r}) AS ${t(e.alias)}`;
+			case "window-sum-over": return t`SUM(${n}) OVER (${r}) AS ${t(e.alias)}`;
+			case "window-avg-over": return t`AVG(${n}) OVER (${r}) AS ${t(e.alias)}`;
+			default: throw Error(`compileAggregateProjection: unknown window op '${e.op}'`);
+		}
+	}
+	switch (e.op) {
+		case "count": return t`COUNT(${n}) AS ${t(e.alias)}`;
+		case "count-distinct": return t`COUNT(DISTINCT ${n}) AS ${t(e.alias)}`;
+		case "sum": return t`SUM(${n}) AS ${t(e.alias)}`;
+		case "avg": return t`AVG(${n}) AS ${t(e.alias)}`;
+		case "min": return t`MIN(${n}) AS ${t(e.alias)}`;
+		case "max": return t`MAX(${n}) AS ${t(e.alias)}`;
+		case "column":
+			if (e.column === void 0) throw Error(`compileAggregateProjection: 'column' projection requires a column name (alias '${e.alias}')`);
+			return t`${t(e.column)} AS ${t(e.alias)}`;
+		default: throw Error(`compileAggregateProjection: unknown op '${e.op}'`);
+	}
+})), Dn = (e) => `[${e.join(",")}]`, On = (e, t) => {
+	if (e.queryVector === void 0) return null;
+	let n = t(e.column), r = Dn(e.queryVector), i = e.distance === "cosine" ? "<=>" : e.distance === "l2" ? "<->" : "<#>", a = e.distance === "cosine" ? "VEC_DISTANCE_COSINE" : "VEC_DISTANCE_EUCLIDEAN";
+	return t.onDialectOrElse({
+		mysql: () => t`${t.unsafe(a)}(${n}, ${r})`,
+		mssql: () => t`NULL`,
+		sqlite: () => t`NULL`,
+		orElse: () => t`${n} ${t.unsafe(i)} ${r}::vector`
+	});
+}, kn = (e, t) => {
+	let n = t.unsafe(e.useGeography ? "::geography" : "::geometry");
+	return t`ST_Distance(${t(e.column)}${n}, ${e.geom}${n})`;
+}, An = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, jn = (e, t) => t`${t(`${e.indexName}_tsv`)}`, Mn = (e, t) => `${t}_${e.indexName}_fts`, Nn = (e, t, n) => {
+	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${K(e.query)}%`;
+	return n.onDialectOrElse({
+		mysql: () => n`MATCH(${r}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
+		sqlite: () => {
+			let r = n(Mn(e, t));
+			return n`${n("id")} IN (SELECT ${n("row_id")} FROM ${r} WHERE ${r} MATCH ${e.query})`;
+		},
+		mssql: () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`)),
+		orElse: () => n`${jn(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})`
+	});
+}, Pn = (e, t, n) => {
+	let r = `%${K(e.query)}%`;
+	return n.onDialectOrElse({
+		mysql: () => n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
+		sqlite: () => {
+			let r = n(Mn(e, t));
+			return n`COALESCE((SELECT -bm25(${r}) FROM ${r} WHERE ${r} MATCH ${e.query} AND ${r}.${n("row_id")} = ${n("id")}), 0)`;
+		},
+		mssql: () => e.columns.map((e) => n`(CASE WHEN LOWER(${n(e)}) LIKE LOWER(${r}) ESCAPE '\\' THEN 1 ELSE 0 END)`).reduce((e, t, r) => r === 0 ? t : n`${e} + ${t}`),
+		orElse: () => n`ts_rank(${jn(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))`
+	});
+}, J = (e, t, n = null) => {
+	if (e.setOp && e.setOp.queries.length >= 2) {
+		let r = e.setOp.kind === "union" ? "UNION" : e.setOp.kind === "union-all" ? "UNION ALL" : e.setOp.kind === "intersect" ? "INTERSECT" : "EXCEPT", i = e.setOp.queries.map((e) => t`(${J(e, t, n)})`).reduce((e, n, i) => i === 0 ? n : t`${e} ${t.unsafe(r)} ${n}`), a = [];
+		if (B(e).length > 0 && a.push(t` ORDER BY ${t.csv(B(e).map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), e.take !== void 0) {
+			if (!Number.isInteger(e.take) || e.take < 0) throw Error(`compileSelect: invalid take ${e.take}`);
+			a.push(t` LIMIT ${t.unsafe(String(e.take))}`);
+		}
+		if (e.skip !== void 0) {
+			if (!Number.isInteger(e.skip) || e.skip < 0) throw Error(`compileSelect: invalid skip ${e.skip}`);
+			a.push(t` OFFSET ${t.unsafe(String(e.skip))}`);
+		}
+		return t`${i}${a.reduce((e, n) => t`${e}${n}`, t``)}`;
+	}
+	let r = e.annClause === void 0 ? null : On(e.annClause, t);
+	e.spatialClause !== void 0 && t.onDialectOrElse({
+		mysql: () => {
+			throw Error("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+		},
+		mssql: () => {
+			throw Error("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+		},
+		sqlite: () => {
+			throw Error("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+		},
+		orElse: () => t``
+	});
+	let i = e.spatialClause?.projectAs === void 0 ? null : kn(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? En(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : e.projection && e.projection.length > 0 ? t.csv(e.projection.map((e) => t`${t(e)}`)) : t`*`, o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? Pn(c, e.table, t) : null, u = l !== null && c?.rank !== void 0 ? t`${s}, ${l} AS ${t(c.rank.alias)}` : s, d = i !== null && !o && e.spatialClause?.projectAs !== void 0 ? t`${u}, ${i} AS ${t(e.spatialClause.projectAs)}` : u, f = e.distinctOn && e.distinctOn.length > 0 ? t.onDialectOrElse({
+		orElse: () => t`DISTINCT ON (${t.csv(e.distinctOn.map((e) => t`${t(e)}`))}) `,
+		mysql: () => t`DISTINCT `,
+		mssql: () => t`DISTINCT `,
+		sqlite: () => t`DISTINCT `
+	}) : e.distinct ? t`DISTINCT ` : t``, p = e.lock === "update", m = p ? t.onDialectOrElse({
+		mssql: () => t` WITH (UPDLOCK, ROWLOCK)`,
+		orElse: () => t``
+	}) : t``, h = p ? t.onDialectOrElse({
+		mssql: () => t``,
+		sqlite: () => t``,
+		orElse: () => t` FOR UPDATE`
+	}) : t``, g = e.alias === void 0 ? t`${t(G(n, e.table))}${m}` : t`${t(G(n, e.table))} AS ${t(e.alias)}${m}`, ee = (e.joins ?? []).map((e) => {
+		let r = e.kind === "inner" ? "INNER" : "LEFT";
+		return t` ${t.unsafe(r)} JOIN ${t(G(n, e.table))} AS ${t(e.alias)} ON ${q(e.on, t, n)}`;
+	}), te = ee.length > 0 ? ee.reduce((e, n) => t`${e}${n}`, g) : g, ne = c === void 0 ? null : Nn(c, e.table, t), re = [e.predicate ? q(e.predicate, t, n, e.table) : null, ne].filter((e) => e !== null), _ = re.length > 0 ? t` WHERE ${t.and(re)}` : t``, ie = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, v = e.having ? t` HAVING ${q(e.having, t, n, e.table)}` : t``, y = e.skip !== void 0, b = [];
+	r !== null && b.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && b.push(e.spatialClause.order === "desc" ? t`${An(e.spatialClause, t)} DESC` : t`${An(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && b.push(t`${l} DESC`);
+	for (let n of B(e)) b.push(n.direction === "desc" ? t`${t(n.column)} DESC` : t`${t(n.column)} ASC`);
+	let ae = b.length > 0 ? t` ORDER BY ${t.csv(b)}` : y ? t.onDialectOrElse({
+		mssql: () => t` ORDER BY (SELECT NULL)`,
+		orElse: () => t``
+	}) : t``, x = (e) => {
+		if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw Error(`compileSelect: expected non-negative integer take/skip, got ${e}`);
+		return t.unsafe(String(e));
+	}, S = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${J(e.descriptor, t, n)})`), C = (e.ctes ?? []).some((e) => e.recursive === !0), oe = S.length > 0 ? t`WITH ${t.unsafe(C ? "RECURSIVE " : "")}${t.csv(S)} ` : t``;
+	return t.onDialectOrElse({
+		mssql: () => {
+			let n = e.take !== void 0 && !y ? t`TOP ${x(e.take)} ` : t``, r = y ? t` OFFSET ${x(e.skip)} ROWS FETCH NEXT ${x(e.take ?? 2 ** 53 - 1)} ROWS ONLY` : t``;
+			return t`${oe}SELECT ${n}${f}${d} FROM ${te}${_}${ie}${v}${ae}${r}`;
+		},
+		orElse: () => {
+			let n = e.take === void 0 ? t`` : t` LIMIT ${x(e.take)}`, r = y ? t` OFFSET ${x(e.skip)}` : t``;
+			return t`${oe}SELECT ${f}${d} FROM ${te}${_}${ie}${v}${ae}${n}${r}${h}`;
+		}
+	});
+}, Y = (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);
+}, Fn = (e, t) => ({
+	column: e,
+	op: "eq",
+	value: t
+}), In = (e, t) => ({
+	column: e,
+	op: "neq",
+	value: t
+}), Ln = (e, t) => ({
+	column: e,
+	op: "gt",
+	value: t
+}), Rn = (e, t) => ({
+	column: e,
+	op: "gte",
+	value: t
+}), zn = (e, t) => ({
+	column: e,
+	op: "lt",
+	value: t
+}), Bn = (e, t) => ({
+	column: e,
+	op: "lte",
+	value: t
+}), Vn = (e, t) => ({
+	column: e,
+	op: "in",
+	value: t
+}), Hn = (e, t) => ({
+	column: e,
+	op: "notIn",
+	value: t
+}), Un = (e, t) => ({
+	column: e,
+	op: "contains",
+	value: t
+}), Wn = (e, t) => ({
+	column: e,
+	op: "startsWith",
+	value: t
+}), Gn = (e, t) => ({
+	column: e,
+	op: "arrayContains",
+	value: t
+}), Kn = (e, t) => ({
+	column: e,
+	op: "arrayOverlaps",
+	value: t
+}), qn = (e, t) => ({
+	column: e,
+	op: "arrayHas",
+	value: t
+}), Jn = {
+	column: "id",
+	op: "in",
+	value: []
+}, Yn = (e) => ({
+	column: e,
+	op: "isNull"
+}), Xn = (e) => ({
+	column: e,
+	op: "isNotNull"
+}), Zn = (e, t) => ({
+	column: e,
+	op: "spatial",
+	value: t
+}), Qn = (...e) => ({ and: e }), $n = (...e) => ({ or: e }), er = (e) => ({ not: e }), tr = (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")
+	};
+}, X = (e) => "descriptor" in e ? e.descriptor : e, nr = (e, t) => ({
+	column: e,
+	op: "subquery-in",
+	subquery: X(t)
+}), rr = (e, t) => ({
+	column: e,
+	op: "subquery-not-in",
+	subquery: X(t)
+}), ir = (e) => ({
+	op: "exists",
+	subquery: X(e)
+}), ar = (e) => ({
+	op: "not-exists",
+	subquery: X(e)
+}), or = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, sr = (e) => {
+	if (e instanceof Date) return e.getTime();
+	if (typeof e == "string" && or.test(e)) {
+		let t = Date.parse(e);
+		return Number.isNaN(t) ? void 0 : t;
+	}
+}, cr = (e, t) => {
+	if (!(e instanceof Date) && !(t instanceof Date)) return;
+	let n = sr(e), r = sr(t);
+	return n === void 0 || r === void 0 ? void 0 : [n, r];
+}, lr = (e, t) => {
+	if (e === t) return !0;
+	let n = cr(e, t);
+	return n !== void 0 && n[0] === n[1];
+}, ur = (e, t) => {
+	if (e == null || t == null) return null;
+	let n = cr(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;
+}, Z = (e, t, n = null, r = {}) => {
+	if (!t) return !1;
+	if ("not" in e) return !Z(e.not, t, n, r);
+	if ("and" in e) {
+		for (let i of e.and) if (!Z(i, t, n, r)) return !1;
+		return !0;
+	}
+	if ("or" in e) {
+		for (let i of e.or) if (Z(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) => Y(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 ? Y(e, t) === 0 : lr(e, t), c = o ? Y : ur;
+	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.");
+	}
+}, Q = function* (e) {
+	if ("not" in e) {
+		yield* Q(e.not);
+		return;
+	}
+	if ("and" in e) {
+		for (let t of e.and) yield* Q(t);
+		return;
+	}
+	if ("or" in e) {
+		for (let t of e.or) yield* Q(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
+	});
+}, $ = function* (e, t = !0) {
+	if ("not" in e) {
+		yield* $(e.not, !1);
+		return;
+	}
+	if ("and" in e) {
+		for (let n of e.and) yield* $(n, t);
+		return;
+	}
+	if ("or" in e) {
+		for (let t of e.or) yield* $(t, !1);
+		return;
+	}
+	e.op !== "subquery-in" && e.op !== "subquery-not-in" && e.op !== "exists" && e.op !== "not-exists" && (yield {
+		...e,
+		conjunctive: t
+	});
+}, dr = (e, t) => ({
+	name: e,
+	body: t
+}), fr = (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: dr });
+	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
+	};
+}, pr = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, mr = null, hr = null, gr = (e) => {
+	mr = e;
+}, _r = (e) => {
+	hr = e;
+}, vr = async (e) => {
+	let t = mr;
+	t !== null && await t(e);
+}, yr = async (e) => {
+	let t = hr;
+	t !== null && e.changedTables.length !== 0 && await t(e);
+}, br = (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;
+}, xr = Symbol.for("voltro.migration.irreversible"), Sr = 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";
+	}
+}, Cr = (e) => {
+	if (!e || e.trim().length === 0) throw Error("irreversible(): a reason is required");
+	return Object.assign(() => t.fail(new Sr("<unknown>", e)), { [xr]: e });
+}, wr = (e) => {
+	let t = e[xr];
+	return typeof t == "string" ? t : void 0;
+}, Tr = class {
+	reason;
+	_tag = "MigrationSkipped";
+	constructor(e) {
+		this.reason = e;
+	}
+}, Er = 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";
+	}
+}, Dr = 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";
+	}
+}, Or = 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. Check for concurrent writes and guard values that cannot round-trip exactly before raising maxPasses.`), this.table = e, this.report = t, this.name = "RewriteUnstableError";
+	}
+}, kr = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, Ar = (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", jr = /* @__PURE__ */ new Set(["voltro_isr_cache"]), Mr = (e) => jr.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Nr = "_voltro_staging_", Pr = (e) => e.startsWith(Nr), Fr = /__dropped_\d{14}$/, Ir = (e) => Fr.test(e), Lr = 7, Rr = (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)));
+}, zr = (e, t = {}) => {
+	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
+		let a = Rr(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), !Ir(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
+	return i;
+}, Br = (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.`;
+}, Vr = (e, t) => e.filter((e) => !Mr(e.name) || t.has(e.name)), Hr = I("_voltro_migrations", {
+	id: f({ prefix: "mig" }),
+	name: p(),
+	hash: p(),
+	status: p(),
+	appliedAt: _().nullable(),
+	durationMs: m().nullable(),
+	errorMessage: p().nullable(),
+	errorStack: p().nullable(),
+	workflowRunId: p().nullable(),
+	createdAt: _().default("now"),
+	updatedAt: _().default("now").onUpdate("now")
+}).index(["status"]), Ur = I("_voltro_seeds", {
+	id: f({ prefix: "seed" }),
+	name: p(),
+	lifecycle: p(),
+	fingerprint: p(),
+	cronSchedule: p().nullable(),
+	watchedTables: v().nullable(),
+	nextRunAt: _().nullable(),
+	lastRunStatus: p().nullable(),
+	lastRunAt: _().nullable(),
+	lastRunDurationMs: m().nullable(),
+	lastRunRowsTouched: m().nullable(),
+	lastError: p().nullable(),
+	workflowRunId: p().nullable(),
+	createdAt: _().default("now"),
+	updatedAt: _().default("now").onUpdate("now")
+}).index(["lifecycle"]).index(["nextRunAt"]), Wr = I("_voltro_migration_plans", {
+	id: f({ prefix: "plan" }),
+	fingerprint: p(),
+	liveFingerprint: p().nullable(),
+	operations: v(),
+	rollbackPlan: v().nullable(),
+	appliedBy: p(),
+	environment: p(),
+	source: p(),
+	onlineStrategy: p().nullable(),
+	durationMs: m(),
+	notes: p().nullable(),
+	squashedAt: _().nullable(),
+	appliedAt: _().default("now"),
+	createdAt: _().default("now"),
+	updatedAt: _().default("now").onUpdate("now")
+}).index(["fingerprint"]).index(["environment"]), Gr = I("_voltro_idempotency", {
+	id: f({ prefix: "idem" }),
+	scope: p(),
+	key: p(),
+	status: p(),
+	response: v().nullable(),
+	createdAt: _().default("now")
+}).unique(["scope", "key"]).index(["createdAt"]), Kr = I("_voltro_devices", {
+	id: f({ prefix: "device" }),
+	tenantId: p(),
+	name: p(),
+	scopes: v().nullable(),
+	pairingHash: p().maxLength(64).nullable(),
+	pairingExpiresAt: _().nullable(),
+	accessHash: p().maxLength(64).nullable(),
+	accessExpiresAt: _().nullable(),
+	refreshHash: p().maxLength(64).nullable(),
+	refreshExpiresAt: _().nullable(),
+	previousRefreshHash: p().maxLength(64).nullable(),
+	generation: m().default(0),
+	pairedAt: _().nullable(),
+	lastSeenAt: _().nullable(),
+	revokedAt: _().nullable(),
+	revokedReason: p().nullable(),
+	createdBy: p().nullable(),
+	metadata: v().nullable(),
+	createdAt: _()
+}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), qr = I("_voltro_tenant_selections", {
+	id: f({ prefix: "tsel" }),
+	subjectType: p().maxLength(32),
+	subjectId: p(),
+	tenantId: p(),
+	selectedAt: _()
+}).primaryKey(["id"]).nonReactive(), Jr = I("_voltro_kv", {
+	id: f({ prefix: "kv" }),
+	key: p().unique(),
+	value: p().nullable(),
+	expiresAt: _().nullable(),
+	createdAt: _().default("now"),
+	updatedAt: _().default("now").onUpdate("now")
+}).index(["expiresAt"]), Yr = I("_voltro_api_keys", {
+	id: f({ prefix: "apikey" }),
+	tenantId: p().nullable(),
+	name: p(),
+	hashedKey: p().maxLength(64).unique(),
+	keyPrefix: p(),
+	scopes: v().nullable(),
+	lastUsedAt: _().nullable(),
+	requestCount: m().default(0),
+	expiresAt: _().nullable(),
+	revokedAt: _().nullable(),
+	createdBy: p().nullable(),
+	onBehalfOf: p().nullable(),
+	metadata: v().nullable(),
+	createdAt: _().default("now")
+}).index("byApiKeyTenant", ["tenantId"]), Xr = I("_voltro_replica_observations", {
+	id: f({ prefix: "robs" }),
+	replicaId: p().maxLength(191),
+	startedAt: _(),
+	version: p().maxLength(64).nullable(),
+	kind: p().maxLength(64),
+	payload: p().nullable(),
+	reachableAt: p().maxLength(255).nullable(),
+	writtenAt: _().default("now").onUpdate("now")
+}).unique(["replicaId", "kind"]).index(["kind"]), Zr = [
+	Hr,
+	Ur,
+	Wr
+];
+//#endregion
+export { tr as $, ae as $n, Wt as $t, br as A, M as An, Qt as At, qn as B, Te as Bn, Lt as Bt, Er as C, rt as Cn, se as Cr, W as Ct, Cr as D, Re as Dn, un as Dt, Dr as E, Le as En, sn as Et, _r as F, Pe as Fn, Ot as Ft, Z as G, he as Gn, B as Gt, Q as H, ye as Hn, Ut as Ht, gr as I, Fe as In, kt as It, Rn as J, x as Jn, qt as Jt, ir as K, me as Kn, Yt as Kt, Jn as L, we as Ln, Xt as Lt, yr as M, N as Mn, jt as Mt, vr as N, xe as Nn, Gt as Nt, wr as O, ze as On, Zt as Ot, pr as P, je as Pn, Pt, Yn as Q, y as Qn, At as Qt, Qn as R, Me as Rn, Vt as Rt, Sr as S, it as Sn, _ as Sr, vn as St, Or as T, Qe as Tn, cn as Tt, Un as U, ge as Un, Nt as Ut, Kn as V, ve as Vn, Ht as Vt, Fn as W, _e as Wn, Mt as Wt, nr as X, te as Xn, Kt as Xt, Vn as Y, ce as Yn, Bt as Yt, Xn as Z, re as Zn, zt as Zt, Ir as _, lt as _n, h as _r, Cn as _t, Wr as a, z as an, g as ar, Hn as at, Rr as b, st as bn, o as br, G as bt, Ur as c, Ct as cn, de as cr, Zn as ct, Lr as d, _t as dn, le as dr, Y as dt, Ft as en, l as er, zn as et, jr as f, gt as fn, v as fr, q as ft, Mr as g, I as gn, c as gr, Sn as gt, Br as h, ct as hn, fe as hr, K as ht, Jr as i, St as in, ne as ir, ar as it, fr as j, A as jn, en as jt, Ar as k, j as kn, $t as kt, qr as l, Tt as ln, f as lr, Wn as lt, zr as m, ut as mn, ee as mr, J as mt, Kr as n, wt as nn, b as nr, In as nt, Hr as o, Dt as on, oe as or, rr as ot, Nr as p, L as pn, w as pr, wn as pt, Ln as q, u as qn, Jt as qt, Gr as r, Et as rn, ie as rr, er as rt, Xr as s, xt as sn, ue as sr, $n as st, Yr as t, It as tn, s as tr, Bn as tt, Zr as u, vt as un, m as ur, $ as ut, Pr as v, ot as vn, C as vr, hn as vt, Tr as w, tt as wn, on as wt, kr as x, nt as xn, p as xr, yn as xt, Vr as y, at as yn, S as yr, mn as yt, Gn as z, Ne as zn, Rt as zt };