@voltro/database 0.83.1 → 0.85.0

package/dist/replaceInProgress-Z1aAw3GD.js

@@ -1,2365 +0,0 @@
-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
-		})
-	};
-}, _ = () => d("boolean"), v = () => d("timestamp"), re = () => d("date"), y = () => d("json"), b = () => d("bytes"), x = () => new u({
-	type: "bytes",
-	nullable: !0,
-	unique: !1,
-	hasDefault: !1,
-	crdtManaged: !0
-}), ie = () => new u({
-	type: "bytes",
-	nullable: !0,
-	unique: !1,
-	hasDefault: !1,
-	crdtManaged: !0
-}), S = () => {
-	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 ae(e) {
-	return oe(S, e);
-}
-function oe(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 se = () => new u({
-	type: "text",
-	nullable: !0,
-	unique: !1,
-	hasDefault: !1,
-	dropped: !0
-}), ce = (e) => Object.keys(e.fields).filter((t) => e.fields[t]?.dropped !== !0), le = (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"
-	});
-}, ue = (e) => new u({
-	type: "array",
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1,
-	arrayElement: e.__definition().type
-}), de = () => d("interval"), fe = (e, t = 4326) => new u({
-	type: "text",
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1,
-	spatial: {
-		kind: "geography",
-		geomKind: e,
-		srid: t
-	}
-}), pe = (e, t = 4326) => new u({
-	type: "text",
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1,
-	spatial: {
-		kind: "geometry",
-		geomKind: e,
-		srid: t
-	}
-}), me = (e) => new u({
-	type: "raw",
-	nullable: !1,
-	unique: !1,
-	hasDefault: !1,
-	rawDdl: e
-}), C = (e) => {
-	let t = {};
-	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
-	return t;
-}, he = /* @__PURE__ */ new WeakMap(), ge = (e) => typeof e == "object" && e ? he.get(e) : void 0, _e = (e, t = {}) => {
-	let n = p();
-	return he.set(n, {
-		target: e,
-		orphanPolicy: t.orphanPolicy ?? "keep",
-		onSoftDelete: t.onSoftDelete ?? !1
-	}), n;
-}, w = /* @__PURE__ */ new Map(), ve = (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 = w.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), w.set(e, n);
-}, ye = (e) => w.get(e) ?? [], be = () => w, xe = () => {
-	w.clear();
-}, Se = (t) => {
-	let r = t;
-	for (let t = 0; t < 4 && n.isFiberFailure(r); t++) r = e.squash(r[n.FiberFailureCauseId]);
-	return r;
-}, T = (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(...T(e, r + 1));
-	return o;
-}, Ce = (e) => e.dbCode !== void 0 || e.dbErrno !== void 0 || e.dbNumber !== void 0 || e.dbSqlState !== void 0 || e.dbConstraint !== void 0, we = (e) => {
-	let t = {}, n = [], r = Se(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 = Se(e.cause);
-	}
-	return n.length > 0 && (t.dbCauseChain = n.join(" ← "), t.dbMessage === void 0 && (t.dbMessage = n[n.length - 1])), t;
-}, Te = (e) => {
-	let t = T(e).map(we);
-	if (t.length <= 1) return t[0] ?? {};
-	let n = t.find(Ce) ?? 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(" ‖ ")
-	};
-}, Ee = (e, t) => {
-	let n = Oe(e);
-	if (n !== void 0) return n;
-	let r = Te(e), i = Pe(r, t);
-	if (i !== void 0) {
-		let e = i.constraint ?? i.column;
-		return e === void 0 ? i.kind : `${i.kind}: ${e}`;
-	}
-	let a = r.dbCode ?? r.dbSqlState ?? r.dbErrno ?? r.dbNumber, o = je(e);
-	return a !== void 0 && ke.test(String(a)) ? `${o} (${String(a)})` : o;
-}, De = Symbol.for("@voltro/database/authoredMessage"), E = (e, t) => {
-	let n = t === void 0 ? Error(e) : Error(e, t);
-	return Object.defineProperty(n, De, {
-		value: !0,
-		enumerable: !1
-	}), n;
-}, Oe = (e) => {
-	for (let t of T(e)) {
-		let e = t;
-		for (let t = 0; typeof e == "object" && e && t < 8; t += 1) {
-			if (e[De] === !0) {
-				let t = e.message;
-				if (typeof t == "string" && t.length > 0) return t;
-			}
-			e = e.cause;
-		}
-	}
-}, ke = /^[A-Za-z0-9_]{1,32}$/, Ae = /^[A-Za-z_][A-Za-z0-9_]{0,63}$/, je = (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 && Ae.test(r) ? r : "unknown";
-}, Me = /^[A-Za-z_][A-Za-z0-9_$]*$/, D = (e) => e !== void 0 && e.length <= 128 && Me.test(e) ? e : void 0, Ne = (e) => e === void 0 ? void 0 : e.split(".").pop() ?? e, O = (e, ...t) => {
-	for (let n of t) {
-		let t = n.exec(e);
-		if (t?.[1] !== void 0) return t[1];
-	}
-}, Pe = (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 = D(e.dbConstraint);
-		return {
-			kind: /is still referenced from table/i.test(o) ? "foreignKeyInUse" : "foreignKey",
-			...t === void 0 ? {} : { constraint: t }
-		};
-	}
-	if (n === "23505") {
-		let t = D(e.dbConstraint);
-		return {
-			kind: "unique",
-			...t === void 0 ? {} : { constraint: t }
-		};
-	}
-	if (n === "23502") {
-		let t = D(e.dbColumn);
-		return {
-			kind: "notNull",
-			...t === void 0 ? {} : { column: t }
-		};
-	}
-	if (n === "23514") {
-		let t = D(e.dbConstraint);
-		return {
-			kind: "check",
-			...t === void 0 ? {} : { constraint: t }
-		};
-	}
-	if (r === 1452 || r === 1451) {
-		let e = D(O(o, /CONSTRAINT `([^`]+)`/));
-		return {
-			kind: r === 1451 ? "foreignKeyInUse" : "foreignKey",
-			...e === void 0 ? {} : { constraint: e }
-		};
-	}
-	if (r === 1062) {
-		let e = D(Ne(O(o, /for key '([^']+)'/)));
-		return {
-			kind: "unique",
-			...e === void 0 ? {} : { constraint: e }
-		};
-	}
-	if (r === 1048 || r === 1364) {
-		let e = D(O(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 = D(O(o, /Check constraint '([^']+)'/, /CONSTRAINT `([^`]+)` failed/));
-		return {
-			kind: "check",
-			...e === void 0 ? {} : { constraint: e }
-		};
-	}
-	if (i === 547) {
-		let e = O(o, /(?:FOREIGN KEY|REFERENCE) constraint "([^"]+)"/), t = O(o, /CHECK constraint "([^"]+)"/);
-		if (t !== void 0 && e === void 0) {
-			let e = D(t);
-			return {
-				kind: "check",
-				...e === void 0 ? {} : { constraint: e }
-			};
-		}
-		let n = /REFERENCE constraint/.test(o), r = D(e);
-		return {
-			kind: n ? "foreignKeyInUse" : "foreignKey",
-			...r === void 0 ? {} : { constraint: r }
-		};
-	}
-	if (i === 2627 || i === 2601) {
-		let e = D(O(o, /(?:UNIQUE KEY|PRIMARY KEY) constraint '([^']+)'/, /index '([^']+)'/));
-		return {
-			kind: "unique",
-			...e === void 0 ? {} : { constraint: e }
-		};
-	}
-	if (i === 515) {
-		let e = D(O(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 = D(Ne(O(o, /UNIQUE constraint failed: ([^,\s]+)/)));
-		return {
-			kind: "unique",
-			...e === void 0 ? {} : { column: e }
-		};
-	}
-	if (n === "SQLITE_CONSTRAINT_NOTNULL") {
-		let e = D(Ne(O(o, /NOT NULL constraint failed: ([^,\s]+)/)));
-		return {
-			kind: "notNull",
-			...e === void 0 ? {} : { column: e }
-		};
-	}
-	if (n === "SQLITE_CONSTRAINT_CHECK") {
-		let e = D(O(a, /CHECK constraint failed: (.+)$/));
-		return {
-			kind: "check",
-			...e === void 0 ? {} : { constraint: e }
-		};
-	}
-}, Fe = (e) => {
-	let t = Pe(e)?.kind;
-	return t === "foreignKey" || t === "foreignKeyInUse";
-}, Ie = (e) => {
-	let t = e.dbCode, n = e.dbErrno;
-	return t === "57014" || n === 3024 || n === 1969 || t === "ETIMEOUT" || t === "SQLITE_INTERRUPT";
-}, Le = (e) => {
-	if (e.dbErrno !== 1366) return;
-	let t = `${typeof e.dbCauseChain == "string" ? e.dbCauseChain : ""} ${typeof e.dbMessage == "string" ? e.dbMessage : ""}`;
-	if (/Incorrect string value: '\\x(F[0-4])/i.exec(t) === null) return;
-	let n = O(t, /for column [`']?(?:[^`'.]+[`']?\.[`']?)*([^`'.]+)[`']? at row/);
-	return `${n === void 0 ? "the column" : `column '${n}'`} is stored in a character set that cannot hold a 4-byte character (utf8mb3). Declare the store's character set in app.config.ts — store: { dialect: 'mariadb' | 'mysql', charset: 'utf8mb4' } — and run \`voltro db plan\`: every declared table is created with it and converted to it.`;
-}, Re = (e) => {
-	let t = Te(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;
-	let c = Le(t), l = c === void 0 ? "" : `\n  hint: ${c}`;
-	return [a, n.length > 0 ? `[${n.join(" ")}]` : void 0].filter((e) => e !== void 0 && e !== "").join(" ") + l + s + o;
-}, ze = (e) => Object.entries(e).map(([e, t]) => `${e}:${Be(t)}`).join(" "), Be = (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";
-}, Ve = 63, He = 60, k = [], A = (e) => {
-	k.includes(e) || k.push(e);
-}, Ue = () => {
-	let e = k.slice();
-	return k.length = 0, e;
-}, We = /^[a-zA-Z_][a-zA-Z0-9_]*$/, Ge = (e, t) => {
-	if (t.length === 0) throw Error(`${e} cannot be empty.`);
-	if (!We.test(t)) throw Error(`${e} '${t}' contains characters outside [A-Za-z0-9_] or starts with a digit. Dialect-portable identifiers must match /^[a-zA-Z_][a-zA-Z0-9_]*$/.`);
-}, j = (e) => {
-	if (Ge("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 && A(`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.`);
-}, M = (e, t) => {
-	if (Ge("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 && A(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
-}, N = (e, t, n, r) => {
-	if (Ge("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 && A(`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.` : ""}`);
-}, P = (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 && A(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — close to the 63-byte limit. Generated ids will be even longer (prefix + '_' + 26).`);
-}, Ke = 1704067200000n, qe = 10n, Je = 12n, Ye = (1n << qe) - 1n, Xe = (1n << Je) - 1n, Ze = Je, Qe = 22n, $e = () => {
-	let e = process.env.SNOWFLAKE_MACHINE_ID;
-	if (e === void 0 || e === "") return 0n;
-	let t = BigInt(e);
-	if (t < 0n || t > Ye) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${Ye}.`);
-	return t;
-}, et = () => ({
-	lastMs: 0n,
-	sequence: 0n,
-	machineId: $e()
-}), F, tt = () => (F === void 0 && (F = et()), F), nt = () => {
-	F = et();
-}, rt = () => BigInt(Date.now()), it = (e) => {
-	let t = rt();
-	for (; t <= e;) t = rt();
-	return t;
-}, at = () => {
-	let e = tt(), t = rt();
-	t === e.lastMs ? (e.sequence = e.sequence + 1n & Xe, e.sequence === 0n && (t = it(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
-	let n = t - Ke;
-	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
-	return (n << Qe | e.machineId << Ze | e.sequence).toString();
-}, ot = (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 P(n, {
-		kind: "derived",
-		tableName: e
-	}), n;
-}, st = (e, t) => {
-	if (e === void 0) return {
-		kind: "typeid",
-		prefix: ot(t)
-	};
-	if ("prefix" in e && !("scheme" in e)) return P(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 ?? ot(t);
-			return e.prefix !== void 0 && P(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
-		};
-	}
-}, ct = (e, t) => {
-	switch (e.kind) {
-		case "typeid": return i(e.prefix).toString();
-		case "ulid": return a();
-		case "numeric": return null;
-		case "snowflake": return at();
-		case "custom": return e.generate(t);
-	}
-}, lt = (e) => ({
-	fields: C(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 }
-}), ut = lt, dt = (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;
-}, ft = (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);
-}, pt = (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`;
-	}
-}, mt = [
-	"id",
-	"tenantId",
-	"createdAt",
-	"updatedAt",
-	"createdBy",
-	"updatedBy",
-	"deletedAt",
-	"deletedBy"
-], ht = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, gt = (e, t) => `${e}_${t.join("_")}_idx`, _t = (e, t) => `${e}_${t.join("_")}_uq`, vt = (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.`);
-}, yt = (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: st(i.idSchemeInput, t)
-	});
-	return n ?? e;
-}, I = (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 (N(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
-			return I({
-				...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 = dt(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}': '${ht(o)}' and '${ht(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.`);
-				M(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 ?? gt(e.tableName, n.fields);
-				a.some((e) => e.name === t) || (N(e.tableName, t, n.name === void 0, n.fields), vt(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 I({
-				...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 = gt(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 (N(e.tableName, n, a, o), vt(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 I({
-				...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 (N(e.tableName, t, !1, i), vt(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 I({
-				...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 = _t(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 (N(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 I({
-				...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 = gt(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 (N(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 I({
-				...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 (N(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 I({
-				...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 I({
-				...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 j(t), I({
-				...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 I({
-				...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: (() => I({
-			...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) => I({
-			...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) => I({
-			...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)
-		}))
-	};
-}, L = (e, t) => {
-	j(e);
-	let n = Object.entries(t).flatMap(([e, t]) => {
-		let n = ge(t);
-		return n === void 0 ? [] : [{
-			column: e,
-			...n
-		}];
-	}), r = yt(C(t), e);
-	for (let t of Object.keys(r)) M(e, t);
-	let i;
-	for (let [t, n] of Object.entries(r)) n.references === S && (n.references = () => {
-		if (i === void 0) throw Error(`selfReference() on '${e}.${t}' read before table() returned`);
-		return i;
-	});
-	return i = I({
-		appliedPluginRefs: n,
-		tableName: e,
-		fields: r,
-		isReactive: !0,
-		appliedMixins: [],
-		appliedIndexes: [],
-		appliedUniques: [],
-		appliedFullText: [],
-		appliedChecks: [],
-		appliedRules: []
-	}), i;
-}, bt = (e) => e === "sqlite" || e === "turso", xt = (e) => e === "mysql" || e === "mariadb", R = (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, "\"\"")}"`;
-	}
-}, St = 1e4, Ct = Symbol.for("@voltro/database/tableRegistry"), wt = globalThis, z = wt[Ct] ?? (wt[Ct] = /* @__PURE__ */ new Map()), Tt = (e) => {
-	let t = z.get(e.tableName);
-	if (t === void 0) {
-		z.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.`);
-}, Et = (e) => {
-	z.get(e.tableName) === void 0 && z.set(e.tableName, e);
-}, B = (e) => z.get(e), Dt = (e) => {
-	let t = z.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;
-}, Ot = () => [...z.values()], kt = (e) => z.delete(e), At = () => {
-	z.clear();
-}, jt = (e) => z.get(e)?.isReactive !== !1, V = (e) => e.order ?? [], Mt = (e) => ({
-	op: "count",
-	alias: e ?? "count"
-}), Nt = (e, t) => ({
-	op: "count-distinct",
-	column: e,
-	alias: t ?? `count_distinct_${e}`
-}), Pt = (e, t) => ({
-	op: "sum",
-	column: e,
-	alias: t ?? `sum_${e}`
-}), Ft = (e, t) => ({
-	op: "avg",
-	column: e,
-	alias: t ?? `avg_${e}`
-}), It = (e, t) => ({
-	op: "min",
-	column: e,
-	alias: t ?? `min_${e}`
-}), Lt = (e, t) => ({
-	op: "max",
-	column: e,
-	alias: t ?? `max_${e}`
-}), Rt = (e, t) => ({
-	op: "column",
-	column: e,
-	alias: t ?? e
-}), H = (e) => (...t) => {
-	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return W({
-		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)
-		}
-	});
-}, zt = H("union"), Bt = H("union-all"), Vt = H("intersect"), Ht = H("except"), U = (e) => ({ over: (t) => ({
-	...e,
-	window: t
-}) }), Ut = (e = "rowNumber") => U({
-	op: "window-row-number",
-	alias: e
-}), Wt = (e = "rank") => U({
-	op: "window-rank",
-	alias: e
-}), Gt = (e = "denseRank") => U({
-	op: "window-dense-rank",
-	alias: e
-}), Kt = (e, t = 1, n) => U({
-	op: "window-lag",
-	column: e,
-	alias: n ?? `lag_${e}`,
-	offset: t
-}), qt = (e, t = 1, n) => U({
-	op: "window-lead",
-	column: e,
-	alias: n ?? `lead_${e}`,
-	offset: t
-}), Jt = (e, t) => U({
-	op: "window-sum-over",
-	column: e,
-	alias: t ?? `sum_${e}_over`
-}), Yt = (e, t) => U({
-	op: "window-avg-over",
-	column: e,
-	alias: t ?? `avg_${e}_over`
-}), Xt = (e, t, n) => {
-	let r = n?.find((e) => e.name === t) ?? B(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 }
-	};
-}, W = (e) => ({
-	descriptor: e,
-	where(t) {
-		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return W({
-			...e,
-			predicate: n
-		});
-	},
-	orderBy(t, n = "asc") {
-		return W({
-			...e,
-			order: [...e.order, {
-				column: t,
-				direction: n
-			}]
-		});
-	},
-	limit(t) {
-		return W({
-			...e,
-			take: t
-		});
-	},
-	offset(t) {
-		return W({
-			...e,
-			skip: t
-		});
-	},
-	select(...t) {
-		return W({
-			...e,
-			projection: t
-		});
-	},
-	using(t) {
-		return W({
-			...e,
-			usingIndex: t
-		});
-	},
-	withDeleted() {
-		return W({
-			...e,
-			includeDeleted: !0
-		});
-	},
-	forUpdate() {
-		return W({
-			...e,
-			lock: "update"
-		});
-	},
-	unscoped() {
-		return W({
-			...e,
-			crossTenant: !0
-		});
-	},
-	with(t) {
-		let n = {
-			...e.eager ?? {},
-			...t
-		};
-		return W({
-			...e,
-			eager: n
-		});
-	},
-	count() {
-		return W({
-			...e,
-			projection: void 0,
-			aggregations: [{
-				op: "count",
-				alias: "count"
-			}]
-		});
-	},
-	aggregate(t) {
-		let n = Object.entries(t).map(([e, t]) => ({
-			...t,
-			alias: e
-		}));
-		return W({
-			...e,
-			projection: void 0,
-			aggregations: n
-		});
-	},
-	matching(t, n, r) {
-		let i = Xt(e.table, t, e.fullTextIndexes);
-		return W({
-			...e,
-			fullTextSearch: {
-				indexName: t,
-				query: n,
-				columns: i.columns,
-				...r?.prefix === !0 ? { prefix: !0 } : {},
-				...i.config === void 0 ? {} : { config: i.config },
-				...i.weights === void 0 ? {} : { weights: i.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 W({
-			...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 W({
-				...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 W({
-				...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 W({
-			...e,
-			annClause: {
-				...n,
-				ef: t
-			}
-		});
-	},
-	use(t) {
-		return W({ ...t(e) });
-	},
-	distinct() {
-		return W({
-			...e,
-			distinct: !0
-		});
-	},
-	distinctOn(t) {
-		return W({
-			...e,
-			distinctOn: [...t]
-		});
-	},
-	as(t) {
-		return W({
-			...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,
-			...typeof t == "string" ? {} : { sourceTable: t }
-		}];
-		return W({
-			...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,
-			...typeof t == "string" ? {} : { sourceTable: t }
-		}];
-		return W({
-			...e,
-			joins: a
-		});
-	},
-	selectJoined(t) {
-		let n = Object.entries(t).map(([e, t]) => ({
-			outputKey: e,
-			source: t
-		}));
-		return W({
-			...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 W({
-			...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 W({
-			...e,
-			ctes: [...r, {
-				name: t,
-				descriptor: n,
-				recursive: !0
-			}]
-		});
-	},
-	groupBy(t) {
-		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return W({
-			...e,
-			groupBy: n
-		});
-	},
-	having(t) {
-		let n = e.having ? { and: [e.having, t] } : t;
-		return W({
-			...e,
-			having: n
-		});
-	},
-	exists() {
-		return W({
-			...e,
-			projection: void 0,
-			aggregations: [{
-				op: "count",
-				alias: "__exists__"
-			}],
-			take: 1
-		});
-	}
-});
-function Zt(e) {
-	return W({
-		table: e.tableName,
-		predicate: void 0,
-		order: [],
-		take: void 0,
-		skip: void 0,
-		projection: void 0,
-		fullTextIndexes: e.appliedFullText,
-		sourceTable: e
-	});
-}
-var Qt = (e, t, n) => $t(e, "id", t, n), $t = (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
-	};
-}, en = (e) => {
-	let t = {};
-	for (let [n, r] of Object.entries(e)) Tt(r), t[n] = Zt(r);
-	return t;
-}, tn = (e) => e.isView === !0, nn = (e, t, n) => {
-	if (j(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
-	let r = C(t);
-	for (let t of Object.keys(r)) M(e, t);
-	return {
-		tableName: e,
-		fields: r,
-		isView: !0,
-		viewSelect: n
-	};
-}, rn = (e) => Zt({
-	...e,
-	isReactive: !1,
-	appliedMixins: [],
-	appliedIndexes: [],
-	appliedUniques: [],
-	appliedFullText: [],
-	appliedChecks: []
-}), an = (e, t, n = null) => {
-	let r = n === null ? R(e.tableName, t) : `${R(n, t)}.${R(e.tableName, t)}`, i = e.viewSelect.trim();
-	switch (t) {
-		case "postgres":
-		case "mysql":
-		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};`;
-	}
-}, on = (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, sn = (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;
-	}
-}, cn = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, ln = (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;
-}, un = (e, t, n) => {
-	if (e == null) return e;
-	switch (t) {
-		case "boolean": return n === "postgres" ? e : on(e);
-		case "vector": return n === "postgres" ? sn(e) : e;
-		case "json": return n === "postgres" || n === "mysql" || n === "mariadb" ? e : sn(e);
-		case "array": return n === "postgres" ? e : sn(e);
-		case "timestamp":
-		case "date": return n === "sqlite" || n === "turso" ? ln(e) : e;
-		case "decimal":
-		case "bigint": return cn(e);
-		default: return e;
-	}
-}, dn = (e, t, n) => {
-	if (e.length === 0) return e;
-	let r = B(t);
-	return r === void 0 ? e : fn(e, r, n);
-}, fn = (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] = un(t[e], r, n));
-		return t;
-	});
-}, pn = (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;
-	}
-}, mn = (e, t, n = ["json", "array"]) => {
-	let r = B(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 = pn(e[t], r.type);
-		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
-	}
-	return a ?? e;
-}, hn = (e) => {
-	if (e.length === 0) throw RangeError("Column reference must not be empty");
-	return {
-		_tag: "ColumnReference",
-		column: e
-	};
-}, G = (e) => typeof e == "object" && !!e && "_tag" in e && e._tag === "ColumnReference" && "column" in e && typeof e.column == "string", gn = [
-	"eq",
-	"neq",
-	"gt",
-	"gte",
-	"lt",
-	"lte"
-], _n = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => _n(e)) : e, vn = /^[A-Za-z_][A-Za-z0-9_]*$/, yn = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : vn.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), bn = (e) => "{" + e.map((e) => {
-	let t = String(e);
-	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", K = (e, t, n, r = {}) => {
-	let i = R(e, n), a = r.numeric ?? !1;
-	if (n === "postgres") {
-		let e = `(${i} #>> '${bn(t)}'::text[])`;
-		return a ? `${e}::numeric` : e;
-	}
-	let o = yn(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;
-		}
-	}
-}, xn = class extends Error {
-	_tag = "TenantNamespaceUnresolved";
-	constructor(e) {
-		super(e), this.name = "TenantNamespaceUnresolved";
-	}
-}, Sn = class extends Error {
-	_tag = "TenantNamespaceInvalid";
-	constructor(e) {
-		super(e), this.name = "TenantNamespaceInvalid";
-	}
-}, Cn = 63, wn = "tenant_", Tn = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), En = (e) => {
-	if (e == null || e === "") throw new xn("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 = Tn(e);
-	if (t.replace(/_/g, "") === "") throw new Sn(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
-	let n = `${wn}${t}`;
-	if (n.length > Cn) throw new Sn(`namespace '${n}' for tenant '${e}' exceeds the ${Cn}-byte identifier limit. Use a shorter tenant id.`);
-	return n;
-}, q = (e, t) => e === null ? t : `${e}.${t}`, Dn = /* @__PURE__ */ new Set(["timestamp", "date"]), On = /^\d{4}-\d{2}-\d{2}([T ]\d{2}:\d{2})?/, kn = (e, t) => {
-	if (e === void 0 || t == null || !Dn.has(e) || t instanceof Date) return t;
-	if (typeof t == "number" && Number.isFinite(t)) return new Date(t);
-	if (typeof t == "string" && On.test(t)) {
-		let e = new Date(t);
-		return Number.isNaN(e.getTime()) ? t : e;
-	}
-	return t;
-}, An = (e, t) => e === void 0 || !Dn.has(e) ? t : t.map((t) => kn(e, t)), jn = (e, t) => {
-	let n = e.lastIndexOf("."), r = n < 0 ? e : e.slice(n + 1), i = n < 0 ? void 0 : e.slice(0, n), a = i === void 0 || i === t.alias || i === t.table, o = a ? void 0 : t.joins?.find((e) => e.alias === i), s = a ? t.table : o?.table, c = a ? t.sourceTable : o?.sourceTable;
-	return (c?.tableName === s ? c : s === void 0 ? void 0 : B(s))?.fields[r];
-}, Mn = (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}`;
-}, J = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), Y = (e, t, n = null, r) => {
-	if ("not" in e) return t`NOT (${Y(e.not, t, n, r)})`;
-	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => Y(e, t, n, r)));
-	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => Y(e, t, n, r)));
-	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
-		let r = e, i = Z(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 = Z(r.subquery, t, n);
-		return r.op === "exists" ? t`EXISTS (${i})` : t`NOT EXISTS (${i})`;
-	}
-	let i = e;
-	if (G(i.value)) {
-		if (!gn.some((e) => e === i.op) || i.path !== void 0) throw E("Column references require a scalar comparison without a JSON path");
-		let e = t(i.value.column), n = t(i.column);
-		switch (i.op) {
-			case "eq": return t`${n} = ${e}`;
-			case "neq": return t`${n} <> ${e}`;
-			case "gt": return t`${n} > ${e}`;
-			case "gte": return t`${n} >= ${e}`;
-			case "lt": return t`${n} < ${e}`;
-			case "lte": return t`${n} <= ${e}`;
-		}
-	}
-	let a = t(i.column), o = i.path, s = o !== void 0 && o.length > 0, c = () => t.onDialectOrElse({
-		mysql: () => t.unsafe(K(i.column, o, "mysql")),
-		mssql: () => t.unsafe(K(i.column, o, "mssql")),
-		sqlite: () => t.unsafe(K(i.column, o, "sqlite")),
-		orElse: () => t.unsafe(K(i.column, o, "postgres"))
-	}), l = () => t.onDialectOrElse({
-		mysql: () => t.unsafe(K(i.column, o, "mysql", { numeric: !0 })),
-		mssql: () => t.unsafe(K(i.column, o, "mssql", { numeric: !0 })),
-		sqlite: () => t.unsafe(K(i.column, o, "sqlite", { numeric: !0 })),
-		orElse: () => t.unsafe(K(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 : B(r)?.fields?.[i.column]?.type, h = (e) => {
-		let n = kn(m, e);
-		return n instanceof Date ? t.onDialectOrElse({
-			sqlite: () => _n(n),
-			orElse: () => n
-		}) : n;
-	};
-	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(h(i.value))}`;
-		case "gte": return t`${d} >= ${p(h(i.value))}`;
-		case "lt": return t`${d} < ${p(h(i.value))}`;
-		case "lte": return t`${d} <= ${p(h(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.map(h))}`;
-		}
-		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.map(h))}`;
-		}
-		case "contains": {
-			let e = `%${J(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 = `${J(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 E("@voltro/plugin-postgis: spatial predicates are postgres-only");
-				},
-				mssql: () => {
-					throw E("@voltro/plugin-postgis: spatial predicates are postgres-only");
-				},
-				sqlite: () => {
-					throw E("@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})`
-			});
-		}
-	}
-}, Nn = (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}`);
-}, Pn = (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 = Nn(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 E(`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 E(`compileAggregateProjection: 'column' projection requires a column name (alias '${e.alias}')`);
-			return t`${t(e.column)} AS ${t(e.alias)}`;
-		default: throw E(`compileAggregateProjection: unknown op '${e.op}'`);
-	}
-})), Fn = (e) => `[${e.join(",")}]`, In = (e, t) => {
-	if (e.queryVector === void 0) return null;
-	let n = t(e.column), r = Fn(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`
-	});
-}, Ln = (e, t) => {
-	let n = t.unsafe(e.useGeography ? "::geography" : "::geometry");
-	return t`ST_Distance(${t(e.column)}${n}, ${e.geom}${n})`;
-}, Rn = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, X = (e, t) => t`${t(`${e.indexName}_tsv`)}`, zn = (e, t) => `${t}_${e.indexName}_fts`, Bn = (e) => e.toLowerCase().split(/[^\p{L}\p{N}]+/u).filter((e) => e !== ""), Vn = (e) => {
-	if (e.prefix !== !0) return;
-	let t = Bn(e.query);
-	if (t.length !== 0) return {
-		pg: t.map((e) => `${e}:*`).join(" & "),
-		mysql: t.map((e) => `+${e}*`).join(" "),
-		sqlite: t.map((e) => `"${e}"*`).join(" ")
-	};
-}, Hn = (e, t, n) => {
-	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${J(e.query)}%`, a = Vn(e), o = () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`));
-	return e.fallback === "like" ? o() : n.onDialectOrElse({
-		mysql: () => a === void 0 ? n`MATCH(${r}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)` : n`MATCH(${r}) AGAINST(${a.mysql} IN BOOLEAN MODE)`,
-		sqlite: () => {
-			let r = n(zn(e, t));
-			return n`${n("id")} IN (SELECT ${n("row_id")} FROM ${r} WHERE ${r} MATCH ${a?.sqlite ?? e.query})`;
-		},
-		mssql: o,
-		orElse: () => a === void 0 ? n`${X(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})` : n`${X(e, n)} @@ to_tsquery(${e.config ?? "english"}, ${a.pg})`
-	});
-}, Un = (e, t, n) => {
-	let r = `%${J(e.query)}%`, i = Vn(e), a = () => 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}`);
-	return e.fallback === "like" ? a() : n.onDialectOrElse({
-		mysql: () => i === void 0 ? n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)` : n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${i.mysql} IN BOOLEAN MODE)`,
-		sqlite: () => {
-			let r = n(zn(e, t));
-			return n`COALESCE((SELECT -bm25(${r}) FROM ${r} WHERE ${r} MATCH ${i?.sqlite ?? e.query} AND ${r}.${n("row_id")} = ${n("id")}), 0)`;
-		},
-		mssql: a,
-		orElse: () => i === void 0 ? n`ts_rank(${X(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))` : n`ts_rank(${X(e, n)}, to_tsquery(${e.config ?? "english"}, ${i.pg}))`
-	});
-}, Wn = (e, t, n, r) => {
-	let i = (e) => t(r && !e.includes(".") ? `${r}.${e}` : e), a = () => n?.length ? t.csv(n.map((e) => t`${i(e)}`)) : r ? t`${t(r)}.*` : t`*`;
-	return !e || !Object.values(e).some((e) => e.type === "bigint") ? a() : t.onDialectOrElse({
-		sqlite: () => t.csv((n?.length ? n : Object.keys(e)).map((n) => e[n]?.type === "bigint" ? t`CAST(${i(n)} AS TEXT) AS ${t(n)}` : t`${i(n)}`)),
-		orElse: a
-	});
-}, Gn = (e, t, n) => Wn(B(e)?.fields, t, n), Z = (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`(${Z(e, t, n)})`).reduce((e, n, i) => i === 0 ? n : t`${e} ${t.unsafe(r)} ${n}`), a = [];
-		if (V(e).length > 0 && a.push(t` ORDER BY ${t.csv(V(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 E(`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 E(`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 : In(e.annClause, t);
-	e.spatialClause !== void 0 && t.onDialectOrElse({
-		mysql: () => {
-			throw E("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
-		},
-		mssql: () => {
-			throw E("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
-		},
-		sqlite: () => {
-			throw E("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
-		},
-		orElse: () => t``
-	});
-	let i = e.spatialClause?.projectAs === void 0 ? null : Ln(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? Pn(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((n) => {
-		let r = t`${t(n.source)}`;
-		return t`${jn(n.source, e)?.type === "bigint" ? t.onDialectOrElse({
-			sqlite: () => t`CAST(${r} AS TEXT)`,
-			orElse: () => r
-		}) : r} AS ${t(n.outputKey)}`;
-	})) : Wn((e.sourceTable?.tableName === e.table ? e.sourceTable : B(e.table))?.fields, t, e.projection, (e.joins?.length ?? 0) > 0 ? e.alias ?? e.table : void 0), 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 ? Un(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(q(n, e.table))}${m}` : t`${t(q(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(q(n, e.table))} AS ${t(e.alias)} ON ${Y(e.on, t, n)}`;
-	}), te = ee.length > 0 ? ee.reduce((e, n) => t`${e}${n}`, g) : g, ne = c === void 0 ? null : Hn(c, e.table, t), _ = [e.predicate ? Y(e.predicate, t, n, e.table) : null, ne].filter((e) => e !== null), v = _.length > 0 ? t` WHERE ${t.and(_)}` : t``, re = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, y = e.having ? t` HAVING ${Y(e.having, t, n, e.table)}` : t``, b = e.skip !== void 0, x = [];
-	r !== null && x.push(t`${r} ASC`), e.spatialClause?.order !== void 0 && x.push(e.spatialClause.order === "desc" ? t`${Rn(e.spatialClause, t)} DESC` : t`${Rn(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && x.push(t`${l} DESC`);
-	for (let n of V(e)) {
-		let r = e.joinedProjection?.find((e) => e.outputKey === n.column)?.source ?? n.column, i = !o && jn(r, e)?.type === "bigint" ? t.onDialectOrElse({
-			sqlite: () => t`${t(r.includes(".") ? r : `${e.alias ?? e.table}.${r}`)}`,
-			orElse: () => t`${t(n.column)}`
-		}) : t`${t(n.column)}`;
-		x.push(n.direction === "desc" ? t`${i} DESC` : t`${i} ASC`);
-	}
-	let ie = x.length > 0 ? t` ORDER BY ${t.csv(x)}` : b ? t.onDialectOrElse({
-		mssql: () => t` ORDER BY (SELECT NULL)`,
-		orElse: () => t``
-	}) : t``, S = (e) => {
-		if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw E(`compileSelect: expected non-negative integer take/skip, got ${e}`);
-		return t.unsafe(String(e));
-	}, ae = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${Z(e.descriptor, t, n)})`), oe = (e.ctes ?? []).some((e) => e.recursive === !0), se = ae.length > 0 ? t`WITH ${t.unsafe(oe ? "RECURSIVE " : "")}${t.csv(ae)} ` : t``;
-	return t.onDialectOrElse({
-		mssql: () => {
-			let n = e.take !== void 0 && !b ? t`TOP ${S(e.take)} ` : t``, r = b ? t` OFFSET ${S(e.skip)} ROWS FETCH NEXT ${S(e.take ?? 2 ** 53 - 1)} ROWS ONLY` : t``;
-			return t`${se}SELECT ${n}${f}${d} FROM ${te}${v}${re}${y}${ie}${r}`;
-		},
-		orElse: () => {
-			let n = e.take === void 0 ? b ? t.onDialectOrElse({
-				sqlite: () => t` LIMIT -1`,
-				mysql: () => t` LIMIT 18446744073709551615`,
-				orElse: () => t``
-			}) : t`` : t` LIMIT ${S(e.take)}`, r = b ? t` OFFSET ${S(e.skip)}` : t``;
-			return t`${se}SELECT ${f}${d} FROM ${te}${v}${re}${y}${ie}${n}${r}${h}`;
-		}
-	});
-}, Q = (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);
-}, Kn = (e, t) => ({
-	column: e,
-	op: "eq",
-	value: t
-}), qn = (e, t) => ({
-	column: e,
-	op: "neq",
-	value: t
-}), Jn = (e, t) => ({
-	column: e,
-	op: "gt",
-	value: t
-}), Yn = (e, t) => ({
-	column: e,
-	op: "gte",
-	value: t
-}), Xn = (e, t) => ({
-	column: e,
-	op: "lt",
-	value: t
-}), Zn = (e, t) => ({
-	column: e,
-	op: "lte",
-	value: t
-}), Qn = (e, t) => ({
-	column: e,
-	op: "in",
-	value: t
-}), $n = (e, t) => ({
-	column: e,
-	op: "notIn",
-	value: t
-}), er = (e, t) => ({
-	column: e,
-	op: "contains",
-	value: t
-}), tr = (e, t) => ({
-	column: e,
-	op: "startsWith",
-	value: t
-}), nr = (e, t) => ({
-	column: e,
-	op: "arrayContains",
-	value: t
-}), rr = (e, t) => ({
-	column: e,
-	op: "arrayOverlaps",
-	value: t
-}), ir = (e, t) => ({
-	column: e,
-	op: "arrayHas",
-	value: t
-}), ar = {
-	column: "id",
-	op: "in",
-	value: []
-}, or = (e) => ({
-	column: e,
-	op: "isNull"
-}), sr = (e) => ({
-	column: e,
-	op: "isNotNull"
-}), cr = (e, t) => ({
-	column: e,
-	op: "spatial",
-	value: t
-}), lr = (...e) => ({ and: e }), ur = (...e) => ({ or: e }), dr = (e) => ({ not: e }), fr = (e, ...t) => {
-	if (t.length === 0) throw E(`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")
-	};
-}, $ = (e) => "descriptor" in e ? e.descriptor : e, pr = (e, t) => ({
-	column: e,
-	op: "subquery-in",
-	subquery: $(t)
-}), mr = (e, t) => ({
-	column: e,
-	op: "subquery-not-in",
-	subquery: $(t)
-}), hr = (e) => ({
-	op: "exists",
-	subquery: $(e)
-}), gr = (e) => ({
-	op: "not-exists",
-	subquery: $(e)
-}), _r = /^\d{4}-\d{2}-\d{2}(?:[T ]\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?(?:Z|[+-]\d{2}:?\d{2})?)?$/, vr = (e) => {
-	if (e instanceof Date) return e.getTime();
-	if (typeof e == "string" && _r.test(e)) {
-		let t = Date.parse(e);
-		return Number.isNaN(t) ? void 0 : t;
-	}
-}, yr = (e, t) => {
-	if (!(e instanceof Date) && !(t instanceof Date)) return;
-	let n = vr(e), r = vr(t);
-	return n === void 0 || r === void 0 ? void 0 : [n, r];
-}, br = (e, t) => {
-	if (e === t) return !0;
-	let n = yr(e, t);
-	return n !== void 0 && n[0] === n[1];
-}, xr = (e, t) => {
-	if (e == null || t == null) return null;
-	let n = yr(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;
-}, Sr = (e, t, n = null, r = {}) => Cr(e, t, n, r) === !0, Cr = (e, t, n = null, r = {}) => {
-	if (!t) return !1;
-	if ("not" in e) {
-		let i = Cr(e.not, t, n, r);
-		return i === null ? null : !i;
-	}
-	if ("and" in e) {
-		let i = !1;
-		for (let a of e.and) {
-			let e = Cr(a, t, n, r);
-			if (e === !1) return !1;
-			e === null && (i = !0);
-		}
-		return !i || null;
-	}
-	if ("or" in e) {
-		let i = !1;
-		for (let a of e.or) {
-			let e = Cr(a, t, n, r);
-			if (e === !0) return !0;
-			e === null && (i = !0);
-		}
-		return i ? null : !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) => Q(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 = G(i.value) ? i.value : void 0;
-	if (o !== void 0 && (!gn.some((e) => e === i.op) || i.path !== void 0)) throw E("Column references require a scalar comparison without a JSON path");
-	let s = o === void 0 ? i.value : t[o.column];
-	if (o !== void 0 && (a == null || s == null)) return null;
-	let c = r[i.column]?.type === "decimal", l = (e, t) => c && e != null && t != null ? Q(e, t) === 0 : br(e, t), u = c ? Q : xr;
-	switch (i.op) {
-		case "eq": return l(a, s);
-		case "neq": return !l(a, s);
-		case "gt": return (u(a, s) ?? -1) > 0;
-		case "gte": return (u(a, s) ?? -1) >= 0;
-		case "lt": return (u(a, s) ?? 1) < 0;
-		case "lte": return (u(a, s) ?? 1) <= 0;
-		case "in": return Array.isArray(s) && s.some((e) => l(a, e));
-		case "notIn": return Array.isArray(s) && !s.some((e) => l(a, e));
-		case "contains": return typeof a == "string" && typeof s == "string" && a.toLowerCase().includes(s.toLowerCase());
-		case "startsWith": return typeof a == "string" && typeof s == "string" && a.startsWith(s);
-		case "arrayContains": {
-			let e = Array.isArray(a) ? a : [];
-			return (Array.isArray(s) ? s : []).every((t) => e.includes(t));
-		}
-		case "arrayOverlaps": {
-			let e = Array.isArray(a) ? a : [];
-			return (Array.isArray(s) ? s : []).some((t) => e.includes(t));
-		}
-		case "arrayHas": return Array.isArray(a) && a.includes(s);
-		case "isNull": return a == null;
-		case "isNotNull": return a != null;
-		case "spatial": throw E("@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.");
-	}
-}, wr = function* (e) {
-	if ("not" in e) {
-		yield* wr(e.not);
-		return;
-	}
-	if ("and" in e) {
-		for (let t of e.and) yield* wr(t);
-		return;
-	}
-	if ("or" in e) {
-		for (let t of e.or) yield* wr(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
-	});
-}, Tr = function* (e, t = !0) {
-	if ("not" in e) {
-		yield* Tr(e.not, !1);
-		return;
-	}
-	if ("and" in e) {
-		for (let n of e.and) yield* Tr(n, t);
-		return;
-	}
-	if ("or" in e) {
-		for (let t of e.or) yield* Tr(t, !1);
-		return;
-	}
-	e.op !== "subquery-in" && e.op !== "subquery-not-in" && e.op !== "exists" && e.op !== "not-exists" && (yield {
-		...e,
-		conjunctive: t && !G(e.value)
-	});
-}, Er = (e, t) => ({
-	name: e,
-	body: t
-}), Dr = (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: Er });
-	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
-	};
-}, Or = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, kr = null, Ar = null, jr = (e) => {
-	kr = e;
-}, Mr = (e) => {
-	Ar = e;
-}, Nr = async (e) => {
-	let t = kr;
-	t !== null && await t(e);
-}, Pr = async (e) => {
-	let t = Ar;
-	t !== null && e.changedTables.length !== 0 && await t(e);
-}, Fr = ["before-schema", "after-schema"], Ir = (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`);
-	if (!Fr.includes(e.phase)) throw Error(`migration ${e.id}: \`phase\` is required and must be one of ${Fr.map((e) => `'${e}'`).join(" | ")} — 'before-schema' runs before the declarative apply (a shape change the planner must not compute against), 'after-schema' runs after it (a body that needs the new shape, such as a back-fill into a table this deploy creates)`);
-	return e;
-}, Lr = Symbol.for("voltro.migration.irreversible"), Rr = 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";
-	}
-}, zr = (e) => {
-	if (!e || e.trim().length === 0) throw Error("irreversible(): a reason is required");
-	return Object.assign(() => t.fail(new Rr("<unknown>", e)), { [Lr]: e });
-}, Br = (e) => {
-	let t = e[Lr];
-	return typeof t == "string" ? t : void 0;
-}, Vr = class {
-	reason;
-	_tag = "MigrationSkipped";
-	constructor(e) {
-		this.reason = e;
-	}
-}, Hr = 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";
-	}
-}, Ur = 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";
-	}
-}, Wr = class extends Error {
-	migrationId;
-	operation;
-	_tag = "MigrationNeedsSqlClient";
-	constructor(e, t, n) {
-		super(`migration ${e}: ${t} — ${n}`), this.migrationId = e, this.operation = t, this.name = "MigrationNeedsSqlClient";
-	}
-}, Gr = 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$/, qr = (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"]), Yr = (e) => Jr.has(e) || e.startsWith("_voltro_") || e.startsWith("_cloud_") || e.startsWith("cluster_") || e.startsWith("__turso_internal_"), Xr = "_voltro_staging_", Zr = (e) => e.startsWith(Xr), Qr = /__dropped_\d{14}$/, $r = (e) => Qr.test(e), ei = 7, ti = (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)));
-}, ni = (e, t = {}) => {
-	let n = t.now ?? /* @__PURE__ */ new Date(), r = t.retentionDays ?? 7, i = [], a = (e, t) => {
-		let a = ti(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), !$r(t.name)) for (let e of t.columns ?? []) a(e.name, `${t.name}.${e.name}`);
-	return i;
-}, ri = (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.`;
-}, ii = (e, t) => e.filter((e) => !Yr(e.name) || t.has(e.name)), ai = L("_voltro_migrations", {
-	id: f({ prefix: "mig" }),
-	name: p(),
-	hash: p(),
-	status: p(),
-	appliedAt: v().nullable(),
-	durationMs: m().nullable(),
-	errorMessage: p().nullable(),
-	errorStack: p().nullable(),
-	workflowRunId: p().nullable(),
-	createdAt: v().default("now"),
-	updatedAt: v().default("now").onUpdate("now")
-}).index(["status"]), oi = L("_voltro_seeds", {
-	id: f({ prefix: "seed" }),
-	name: p(),
-	lifecycle: p(),
-	fingerprint: p(),
-	cronSchedule: p().nullable(),
-	watchedTables: y().nullable(),
-	nextRunAt: v().nullable(),
-	lastRunStatus: p().nullable(),
-	lastRunAt: v().nullable(),
-	lastRunDurationMs: m().nullable(),
-	lastRunRowsTouched: m().nullable(),
-	lastError: p().nullable(),
-	workflowRunId: p().nullable(),
-	createdAt: v().default("now"),
-	updatedAt: v().default("now").onUpdate("now")
-}).index(["lifecycle"]).index(["nextRunAt"]), si = L("_voltro_schema_owner", {
-	id: f({ prefix: "own" }),
-	appName: p(),
-	projectName: p().nullable(),
-	frameworkVersion: p().nullable(),
-	claimedAt: v().default("now")
-}), ci = L("_voltro_plugin_migrations", {
-	id: f({ prefix: "plm" }),
-	plugin_name: p(),
-	migration_id: p(),
-	description: p().nullable(),
-	applied_at: p()
-}), li = L("_voltro_migration_plans", {
-	id: f({ prefix: "plan" }),
-	fingerprint: p(),
-	liveFingerprint: p().nullable(),
-	operations: y(),
-	rollbackPlan: y().nullable(),
-	appliedBy: p(),
-	environment: p(),
-	source: p(),
-	onlineStrategy: p().nullable(),
-	durationMs: m(),
-	notes: p().nullable(),
-	squashedAt: v().nullable(),
-	appliedAt: v().default("now"),
-	createdAt: v().default("now"),
-	updatedAt: v().default("now").onUpdate("now")
-}).index(["fingerprint"]).index(["environment"]), ui = L("_voltro_idempotency", {
-	id: f({ prefix: "idem" }),
-	scope: p(),
-	key: p(),
-	status: p(),
-	response: y().nullable(),
-	createdAt: v().default("now")
-}).unique(["scope", "key"]).index(["createdAt"]), di = L("_voltro_devices", {
-	id: f({ prefix: "device" }),
-	tenantId: p(),
-	name: p(),
-	scopes: y().nullable(),
-	pairingHash: p().maxLength(64).nullable(),
-	pairingExpiresAt: v().nullable(),
-	accessHash: p().maxLength(64).nullable(),
-	accessExpiresAt: v().nullable(),
-	refreshHash: p().maxLength(64).nullable(),
-	refreshExpiresAt: v().nullable(),
-	previousRefreshHash: p().maxLength(64).nullable(),
-	generation: m().default(0),
-	pairedAt: v().nullable(),
-	lastSeenAt: v().nullable(),
-	revokedAt: v().nullable(),
-	revokedReason: p().nullable(),
-	createdBy: p().nullable(),
-	metadata: y().nullable(),
-	createdAt: v()
-}).index(["tenantId"]).index(["pairingHash"]).index(["accessHash"]).index(["refreshHash"]).index(["previousRefreshHash"]), fi = L("_voltro_tenant_selections", {
-	id: f({ prefix: "tsel" }),
-	subjectType: p().maxLength(32),
-	subjectId: p(),
-	tenantId: p(),
-	selectedAt: v()
-}).primaryKey(["id"]).nonReactive(), pi = L("_voltro_kv", {
-	id: f({ prefix: "kv" }),
-	key: p().unique(),
-	value: p().nullable(),
-	expiresAt: v().nullable(),
-	createdAt: v().default("now"),
-	updatedAt: v().default("now").onUpdate("now")
-}).index(["expiresAt"]), mi = L("_voltro_api_keys", {
-	id: f({ prefix: "apikey" }),
-	tenantId: p().nullable(),
-	name: p(),
-	hashedKey: p().maxLength(64).unique(),
-	keyPrefix: p(),
-	scopes: y().nullable(),
-	lastUsedAt: v().nullable(),
-	requestCount: m().default(0),
-	expiresAt: v().nullable(),
-	revokedAt: v().nullable(),
-	createdBy: p().nullable(),
-	onBehalfOf: p().nullable(),
-	metadata: y().nullable(),
-	createdAt: v().default("now")
-}).index("byApiKeyTenant", ["tenantId"]), hi = L("_voltro_replica_observations", {
-	id: f({ prefix: "robs" }),
-	replicaId: p().maxLength(191),
-	startedAt: v(),
-	version: p().maxLength(64).nullable(),
-	kind: p().maxLength(64),
-	payload: p().nullable(),
-	reachableAt: p().maxLength(255).nullable(),
-	writtenAt: v().default("now").onUpdate("now")
-}).unique(["replicaId", "kind"]).index(["kind"]), gi = [
-	ai,
-	oi,
-	li
-], _i = "_voltro_replace_in_progress", vi = L(_i, {
-	id: f({ prefix: "repl" }),
-	startedAt: v().default("now"),
-	kind: p().default("replace"),
-	tables: p().nullable(),
-	capture: p().nullable(),
-	via: p(),
-	staging: p().nullable(),
-	heartbeatAt: v().nullable(),
-	resumable: _().nullable()
-}).nonReactive(), yi = 30, bi = (e, t) => {
-	let n = typeof t == "number" && Number.isFinite(t) && t > 0 ? t : 30, r = Number(e.VOLTRO_STAGING_STALE_MINUTES);
-	return (Number.isFinite(r) && r > 0 ? r : n) * 6e4;
-}, xi = (e) => e == null || String(e).length === 0 ? [] : String(e).split(",").map((e) => e.trim()).filter((e) => e.length > 0), Si = (e) => {
-	let t = e.filter((e) => e.kind !== "staging");
-	if (t.length !== 0) return `refusing to start: a destructive data operation did not finish.
-${t.map((e) => {
-		let t = Number.isFinite(e.startedAt.getTime()) ? `${Math.max(0, Math.round((Date.now() - e.startedAt.getTime()) / 6e4))} minute(s) ago` : "at an unknown time";
-		if (e.kind === "restore") return `  - a native \`restore\` over ${e.via} began loading an artefact over this database ${t}\n    and never reported finishing.\n` + (e.capture === null ? "    The artefact it was loading was not recorded. Re-run the restore from your backup\n    directory, or restore from another backup." : `    The artefact it was loading:\n      ${e.capture}\n    Re-run it to completion with:  voltro data restore ${e.capture} --allow-live`);
-		let n = e.tables === null ? "this database" : `${e.tables} table(s)`;
-		return `  - a \`replace\` over ${e.via} began emptying ${n} ${t} and never reported finishing.\n` + (e.capture === null ? "    NO capture was taken for that run, so the previous rows are not recoverable from here.\n    Restore from your own backup." : `    The target's previous rows were captured first:\n      ${e.capture}\n    Restore them with:  voltro data import ${e.capture} --mode replace`);
-	}).join("\n")}\n
-  A half-replaced database is indistinguishable from an empty one from the inside — every table
-  exists, every constraint holds, and every query returns nothing without erroring. That is why
-  this is a refusal and not a warning.
-
-  When the data is back, or you have decided the current state is correct, clear the marker:
-      voltro data clear-replace-marker --yes`;
-}, Ci = (e, t, n) => {
-	let r = e.filter((e) => e.kind === "staging");
-	return {
-		all: r,
-		droppable: r.filter((e) => {
-			if (e.resumable) return !1;
-			let r = (e.heartbeatAt ?? e.startedAt).getTime();
-			return Number.isFinite(r) ? t - r >= n : !1;
-		})
-	};
-}, wi = (e, t) => {
-	if (e.all.length === 0) return;
-	let n = new Set(e.droppable.map((e) => e.id));
-	return `staged data-import leftovers:
-${e.all.map((e) => {
-		let r = e.heartbeatAt ?? e.startedAt, i = Number.isFinite(r.getTime()) ? `${Math.max(0, Math.round((t - r.getTime()) / 6e4))} minute(s) ago` : "at an unknown time", a = `${e.staging.length} staging table(s) from a \`replace\` over ${e.via}, last active ${i}`;
-		return n.has(e.id) ? `  - ${a} — DROPPED: the run is not resumable and has been silent long enough that nothing is loading into them.` : e.resumable ? `  - ${a} — KEPT: the run was started \`--no-atomic\`, so these ARE its resume point. Re-run the same\n    bundle to continue from them, or drop them with: voltro data clear-staging --yes` : `  - ${a} — KEPT: still beating, so an import is loading into them right now.`;
-	}).join("\n")}\n  The target of a staged \`replace\` is untouched until one short swap at the end, so none of this is
-  a reason to refuse the boot — it is a reason to know the disk is holding a copy of a bundle.`;
-};
-//#endregion
-export { rr as $, Le as $n, en as $t, ti as A, mt as An, de as Ar, An as At, Br as B, at as Bn, o as Br, un as Bt, Xr as C, Tt as Cn, ne as Cr, Q as Ct, $r as D, xt as Dn, pe as Dr, Z as Dt, Yr as E, St as En, fe as Er, Gn as Et, Wr as F, lt as Fn, me as Fr, Tn as Ft, Nr as G, M as Gn, rn as Gt, Ir as H, Ve as Hn, v as Hr, dn as Ht, Vr as I, dt as In, c as Ir, K as It, jr as J, P as Jn, Ft as Jt, Or as K, N as Kn, nn as Kt, Gr as L, ot as Ln, h as Lr, _n as Lt, Rr as M, L as Mn, C as Mr, xn as Mt, Fr as N, pt as Nn, ee as Nr, q as Nt, Zr as O, bt as On, f as Or, J as Ot, Hr as P, ut as Pn, ce as Pr, En as Pt, ir as Q, Pe as Qn, Nt as Qt, Ur as R, ct as Rn, oe as Rr, hn as Rt, Jr as S, jt as Sn, re as Sr, Tr as St, ri as T, kt as Tn, se as Tr, Mn as Tt, Dr as U, He as Un, le as Ur, mn as Ut, qr as V, nt as Vn, p as Vr, fn as Vt, Pr as W, Ue as Wn, tn as Wt, lr as X, Oe as Xn, Rt as Xt, ar as Y, E as Yn, Yt, nr as Z, T as Zn, Mt as Zt, si as _, Bt as _n, b as _r, $n as _t, wi as a, Lt as an, Ee as ar, Jn as at, gi as b, Et as bn, s as br, cr as bt, bi as c, $t as cn, ve as cr, pr as ct, ui as d, Wt as dn, ge as dr, fr as dt, Gt as en, Re as er, wr as et, pi as f, Xt as fn, u as fr, Xn as ft, hi as g, zt as gn, _ as gr, gr as gt, ci as h, Jt as hn, te as hr, dr as ht, Si as i, qt as in, Ie as ir, hr as it, Kr as j, ft as jn, y as jr, Sn as jt, ii as k, R as kn, m as kr, kn as kt, mi as l, Qt as ln, ye as lr, sr as lt, ai as m, Pt as mn, ue as mr, qn as mt, yi as n, Vt as nn, Te as nr, Kn as nt, Ci as o, It as on, be as or, Yn as ot, li as p, Ut as pn, S as pr, Zn as pt, Mr as q, j as qn, an as qt, vi as r, Kt as rn, Fe as rr, Sr as rt, xi as s, V as sn, xe as sr, Qn as st, _i as t, Ht as tn, ze as tr, er as tt, di as u, Zt as un, _e as ur, or as ut, oi as v, Ot as vn, ie as vr, mr as vt, ni as w, Dt as wn, g as wr, Y as wt, ei as x, B as xn, x as xr, tr as xt, fi as y, At as yn, l as yr, ur as yt, zr as z, st as zn, ae as zr, G as zt };