@voltro/database 0.1.0

package/dist/index.js

@@ -0,0 +1,1505 @@
+import { $ as e, A as t, B as n, C as r, Ct as i, D as a, Dt as o, E as s, Et as c, F as l, G as u, H as d, I as f, J as p, K as m, L as h, M as g, N as _, O as ee, Ot as v, P as y, Q as b, R as x, S as te, St as S, T as C, Tt as ne, U as re, V as ie, W as ae, X as oe, Y as se, Z as ce, _ as le, _t as ue, a as de, at as fe, b as pe, bt as me, c as he, ct as ge, d as _e, dt as ve, et as ye, f as be, ft as xe, g as Se, gt as Ce, h as we, ht as Te, i as w, it as Ee, j as De, k as Oe, kt as ke, l as Ae, lt as je, m as Me, mt as Ne, n as Pe, nt as Fe, o as Ie, ot as Le, p as Re, pt as ze, q as Be, r as Ve, rt as He, s as Ue, st as We, t as Ge, tt as Ke, u as qe, ut as Je, v as Ye, vt as T, w as Xe, wt as Ze, x as Qe, xt as E, y as $e, yt as D, z as et } from "./fileBased-cc9IzIjU.js";
+import { Chunk as tt, Data as nt, Effect as rt, Option as O, Stream as it } from "effect";
+import { ansi as k } from "@voltro/logger";
+//#region src/arrayCodec.ts
+var at = (e) => e === "mysql" || e === "mariadb" || e === "mssql" || e === "sqlite", ot = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) r.type === "array" && t.push(n);
+	return t;
+}, st = (e, t, n) => {
+	if (!at(n) || !t) return e;
+	let r = ot(t);
+	if (r.length === 0) return e;
+	let i = { ...e };
+	for (let e of r) {
+		let t = i[e];
+		Array.isArray(t) && (i[e] = JSON.stringify(t));
+	}
+	return i;
+}, ct = (e, t, n) => {
+	if (!at(n) || !t) return e;
+	let r = ot(t);
+	return r.length === 0 ? e : e.map((e) => {
+		let t;
+		for (let n of r) {
+			let r = e[n];
+			if (r != null && !Array.isArray(r) && typeof r == "string") try {
+				let i = JSON.parse(r);
+				Array.isArray(i) && (t ||= { ...e }, t[n] = i);
+			} catch {}
+		}
+		return t ?? e;
+	});
+}, lt = "enc:v1:", ut = (e) => typeof e == "string" && e.startsWith("enc:v1:"), dt = (e) => {
+	let t = [];
+	for (let [n, r] of Object.entries(e.fields)) r.encrypted === !0 && t.push(n);
+	return t;
+}, ft = (e, t, n) => {
+	if (!t) return e;
+	let r = dt(t);
+	if (r.length === 0) return e;
+	let i = { ...e };
+	for (let e of r) {
+		let r = i[e];
+		if (!(r == null || ut(r))) {
+			if (!n) throw Error(`column "${t.tableName ?? "?"}.${e}" is .encrypted() but no field cipher is registered — wire @voltro/plugin-governance's fieldEncryption (key via the Secrets-Resolver)`);
+			i[e] = n.encrypt(JSON.stringify(r));
+		}
+	}
+	return i;
+}, pt = (e, t, n) => {
+	if (!t) return e;
+	let r = dt(t);
+	return r.length === 0 || !n ? e : e.map((e) => {
+		let t;
+		for (let i of r) {
+			let r = e[i];
+			ut(r) && (t ??= { ...e }, t[i] = JSON.parse(n.decrypt(r)));
+		}
+		return t ?? e;
+	});
+}, mt = (e) => typeof e == "function" ? e : () => e, ht = (e, t) => ({
+	kind: "one",
+	target: mt(e),
+	...t?.foreignKey === void 0 ? {} : { foreignKey: t.foreignKey },
+	...t?.sourceKey === void 0 ? {} : { sourceKey: t.sourceKey }
+}), gt = (e, t) => ({
+	kind: "many",
+	target: mt(e),
+	...t?.foreignKey === void 0 ? {} : { foreignKey: t.foreignKey },
+	...t?.sourceKey === void 0 ? {} : { sourceKey: t.sourceKey }
+}), _t = (e, t) => ({
+	kind: "manyToMany",
+	target: mt(e),
+	through: mt(t.through),
+	sourceKey: t.sourceKey,
+	targetKey: t.targetKey
+}), vt = {
+	one: ht,
+	many: gt,
+	manyToMany: _t
+}, yt = (e, t) => {
+	let n = typeof e == "function" ? e : () => e;
+	return {
+		source: n,
+		relations: t(vt, n())
+	};
+}, bt = (e) => {
+	if (typeof e != "object" || !e) return !1;
+	let t = e;
+	if (typeof t.source != "function" || typeof t.relations != "object" || t.relations === null) return !1;
+	let n = Object.values(t.relations);
+	return n.length !== 0 && n.every((e) => {
+		let t = e?.kind;
+		return t === "one" || t === "many" || t === "manyToMany";
+	});
+}, xt = ht, St = gt, Ct = _t, A = (e, t, n) => {
+	let r = [];
+	for (let [n, i] of Object.entries(e.fields)) i.type === "reference" && i.references?.()?.tableName === t && r.push(n);
+	if (r.length === 0) throw Error(`relation '${n}': no reference() column on '${e.tableName}' points at '${t}'. Either add one or pass an explicit { foreignKey: '<column>' }.`);
+	if (r.length > 1) throw Error(`relation '${n}': multiple reference() columns on '${e.tableName}' point at '${t}' (${r.join(", ")}). Pass an explicit { foreignKey: '<column>' } to disambiguate.`);
+	return r[0];
+}, wt = Symbol.for("@voltro/database/relationsRegistry"), Tt = globalThis, j = Tt[wt] ?? (Tt[wt] = /* @__PURE__ */ new Map()), Et = (e) => {
+	let t = e.source(), n = j.get(t.tableName);
+	if (n === void 0) {
+		j.set(t.tableName, new Map(Object.entries(e.relations)));
+		return;
+	}
+	for (let [r, i] of Object.entries(e.relations)) {
+		if (n.has(r)) throw Error(`duplicate relation '${r}' on '${t.tableName}': two relations() blocks both declare it. Pick distinct names or merge them into one block.`);
+		n.set(r, i);
+	}
+}, Dt = (e) => {
+	let t = 0;
+	for (let n of Object.values(e)) bt(n) && (Et(n), t += 1);
+	return t;
+}, M = (e) => {
+	let t = j.get(e);
+	if (t !== void 0) return Object.fromEntries(t);
+}, Ot = (e, t) => j.get(e)?.get(t), kt = () => {
+	let e = [];
+	for (let [t, n] of j) for (let [r, i] of n) e.push({
+		source: t,
+		name: r,
+		relation: i
+	});
+	return e;
+}, At = () => {
+	j.clear();
+}, jt = (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, Mt = (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;
+	}
+}, Nt = (e) => e == null || typeof e == "string" ? e : typeof e == "number" || typeof e == "bigint" ? String(e) : e, Pt = (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;
+}, Ft = (e, t, n) => {
+	if (e == null) return e;
+	switch (t) {
+		case "boolean": return n === "postgres" ? e : jt(e);
+		case "json":
+		case "array": return n === "postgres" ? e : Mt(e);
+		case "timestamp":
+		case "date": return n === "sqlite" || n === "turso" ? Pt(e) : e;
+		case "decimal":
+		case "bigint": return Nt(e);
+		default: return e;
+	}
+}, It = (e, t, n) => {
+	if (e.length === 0) return e;
+	let r = y(t);
+	if (r === void 0) return e;
+	let i = r.fields, a = [];
+	for (let [e, t] of Object.entries(i)) a.push({
+		key: e,
+		type: t.type
+	});
+	return e.map((e) => {
+		let t = { ...e };
+		for (let { key: e, type: r } of a) e in t && (t[e] = Ft(t[e], r, n));
+		return t;
+	});
+}, Lt = (e, t) => {
+	if (e == null) return e;
+	switch (t) {
+		case "json":
+		case "array": return typeof e == "string" ? e : JSON.stringify(e);
+		default: return e;
+	}
+}, Rt = (e, t, n = ["json", "array"]) => {
+	let r = y(t);
+	if (r === void 0) return e;
+	let i = r.fields, a = null;
+	for (let [t, r] of Object.entries(i)) if (n.includes(r.type) && t in e) {
+		let n = Lt(e[t], r.type);
+		n !== e[t] && (a === null && (a = { ...e }), a[t] = n);
+	}
+	return a ?? e;
+}, zt = async (e, t, n, r) => {
+	if (e.length === 0) return e;
+	let i = M(n.tableName);
+	if (i === void 0) throw Error(`cannot eager-load on '${n.tableName}': no relations registered. Did you forget to declare \`relations(${n.tableName}, ...)\` or import the file that does?`);
+	let a = e.map((e) => ({ ...e }));
+	for (let [e, o] of Object.entries(t)) {
+		let t = i[e];
+		if (t === void 0) {
+			let t = Object.keys(i).join(", ") || "<none>";
+			throw Error(`unknown relation '${e}' on '${n.tableName}'. Registered relations: ${t}.`);
+		}
+		await Bt(a, e, t, o === !0 ? {} : o, n, r);
+	}
+	return a;
+}, Bt = async (e, t, n, r, i, a) => {
+	switch (n.kind) {
+		case "one":
+			await Vt(e, t, n, r, i, a);
+			return;
+		case "many":
+			await Ht(e, t, n, r, i, a);
+			return;
+		case "manyToMany":
+			await Wt(e, t, n, r, i, a);
+			return;
+	}
+}, Vt = async (e, t, n, r, i, a) => {
+	let o = n.target(), s = n.sourceKey ?? Gt(i, o.tableName);
+	if (s !== void 0) {
+		let n = N(e, s), i = n.length === 0 ? [] : await P(o, "id", n, r, a), c = new Map(i.map((e) => [e.id, e]));
+		for (let n of e) {
+			let e = n[s];
+			n[t] = e == null ? null : c.get(e) ?? null;
+		}
+		await F(i, r.with, o, a);
+		return;
+	}
+	let c = n.foreignKey ?? A(o, i.tableName, t), l = n.sourceKey ?? "id", u = N(e, l), d = u.length === 0 ? [] : await P(o, c, u, r, a), f = /* @__PURE__ */ new Map();
+	for (let e of d) f.set(e[c], e);
+	for (let n of e) {
+		let e = n[l];
+		n[t] = e == null ? null : f.get(e) ?? null;
+	}
+	await F(d, r.with, o, a);
+}, Ht = async (e, t, n, r, i, a) => {
+	let o = n.target(), s = n.foreignKey ?? A(o, i.tableName, t), c = n.sourceKey ?? "id", l = N(e, c), u = Ut(r), d = l.length === 0 ? [] : await P(o, s, l, u, a), f = /* @__PURE__ */ new Map();
+	for (let e of d) {
+		let t = e[s], n = f.get(t);
+		n ? n.push(e) : f.set(t, [e]);
+	}
+	if (r.limit !== void 0 || r.offset !== void 0) {
+		let e = r.offset ?? 0, t = r.limit;
+		for (let [n, r] of f) {
+			let i = t === void 0 ? r.slice(e) : r.slice(e, e + t);
+			f.set(n, i);
+		}
+	}
+	for (let n of e) {
+		let e = n[c];
+		n[t] = f.get(e) ?? [];
+	}
+	await F(d, r.with, o, a);
+}, Ut = (e) => {
+	let { limit: t, offset: n, ...r } = e;
+	return r;
+}, Wt = async (e, t, n, r, i, a) => {
+	let o = n.target(), s = n.through(), c = N(e, "id");
+	if (c.length === 0) {
+		for (let n of e) n[t] = [];
+		return;
+	}
+	let l = {
+		column: n.sourceKey,
+		op: "in",
+		value: c
+	}, u = r.onJunction === void 0 ? l : { and: [l, r.onJunction] }, d = await a({
+		table: s.tableName,
+		predicate: u,
+		order: [],
+		take: void 0,
+		skip: void 0,
+		projection: void 0
+	});
+	if (d.length === 0) {
+		for (let n of e) n[t] = [];
+		return;
+	}
+	let f = await P(o, "id", N(d, n.targetKey), r, a), p = new Map(f.map((e) => [e.id, e])), m = /* @__PURE__ */ new Map();
+	for (let e of d) {
+		let t = e[n.sourceKey], r = e[n.targetKey], i = p.get(r);
+		if (i === void 0) continue;
+		let a = m.get(t);
+		a ? a.push(i) : m.set(t, [i]);
+	}
+	for (let n of e) n[t] = m.get(n.id) ?? [];
+	await F(f, r.with, o, a);
+}, Gt = (e, t) => {
+	for (let [n, r] of Object.entries(e.fields)) if (r.type === "reference" && r.references?.()?.tableName === t) return n;
+}, N = (e, t) => {
+	let n = /* @__PURE__ */ new Set();
+	for (let r of e) {
+		let e = r[t];
+		e != null && n.add(e);
+	}
+	return [...n];
+}, P = (e, t, n, r, i) => {
+	let a = {
+		column: t,
+		op: "in",
+		value: n
+	}, o = r.where === void 0 ? a : { and: [r.where, a] };
+	return i({
+		table: e.tableName,
+		predicate: o,
+		order: r.orderBy ?? [],
+		take: r.limit,
+		skip: r.offset,
+		projection: void 0
+	});
+}, F = async (e, t, n, r) => {
+	t !== void 0 && e.length !== 0 && (await zt(e, t, n, r)).forEach((t, n) => {
+		let r = e[n];
+		for (let [e, n] of Object.entries(t)) e in r || (r[e] = n);
+	});
+}, Kt = (e) => e.eager !== void 0 && Object.keys(e.eager).length > 0, qt = class extends Error {
+	_tag = "TenantNamespaceUnresolved";
+	constructor(e) {
+		super(e), this.name = "TenantNamespaceUnresolved";
+	}
+}, Jt = class extends Error {
+	_tag = "TenantNamespaceInvalid";
+	constructor(e) {
+		super(e), this.name = "TenantNamespaceInvalid";
+	}
+}, Yt = 63, Xt = "tenant_", Zt = (e) => e.toLowerCase().replace(/[^a-z0-9_]/g, "_"), Qt = (e) => {
+	if (e == null || e === "") throw new qt("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 = Zt(e);
+	if (t.replace(/_/g, "") === "") throw new Jt(`tenant id '${e}' has no usable identifier characters after sanitisation — cannot derive a distinct namespace.`);
+	let n = `${Xt}${t}`;
+	if (n.length > Yt) throw new Jt(`namespace '${n}' for tenant '${e}' exceeds the ${Yt}-byte identifier limit. Use a shorter tenant id.`);
+	return n;
+}, I = (e, t) => e === null ? t : `${e}.${t}`, $t = (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}`;
+}, L = (e) => e.replace(/[\\%_]/g, (e) => `\\${e}`), R = (e, t, n = null) => {
+	if ("not" in e) return t`NOT (${R(e.not, t, n)})`;
+	if ("and" in e) return e.and.length === 0 ? t`TRUE` : t.and(e.and.map((e) => R(e, t, n)));
+	if ("or" in e) return e.or.length === 0 ? t`FALSE` : t.or(e.or.map((e) => R(e, t, n)));
+	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 r = e, i = t(r.column), a = r.path, o = a !== void 0 && a.length > 0, s = () => t.onDialectOrElse({
+		mysql: () => t.unsafe(w(r.column, a, "mysql")),
+		mssql: () => t.unsafe(w(r.column, a, "mssql")),
+		sqlite: () => t.unsafe(w(r.column, a, "sqlite")),
+		orElse: () => t.unsafe(w(r.column, a, "postgres"))
+	}), c = () => t.onDialectOrElse({
+		mysql: () => t.unsafe(w(r.column, a, "mysql", { numeric: !0 })),
+		mssql: () => t.unsafe(w(r.column, a, "mssql", { numeric: !0 })),
+		sqlite: () => t.unsafe(w(r.column, a, "sqlite", { numeric: !0 })),
+		orElse: () => t.unsafe(w(r.column, a, "postgres", { numeric: !0 }))
+	}), l = o ? s() : i, u = o ? c() : i, d = (e) => o && e != null ? String(e) : e, f = (e) => o ? Number(e) : e;
+	switch (r.op) {
+		case "eq": return t`${l} = ${d(r.value)}`;
+		case "neq": return t`${l} <> ${d(r.value)}`;
+		case "gt": return t`${u} > ${f(r.value)}`;
+		case "gte": return t`${u} >= ${f(r.value)}`;
+		case "lt": return t`${u} < ${f(r.value)}`;
+		case "lte": return t`${u} <= ${f(r.value)}`;
+		case "in": {
+			let e = r.value ?? [];
+			return e.length === 0 ? t`FALSE` : t`${l} IN ${t.in(o ? e.map((e) => d(e)) : e)}`;
+		}
+		case "notIn": {
+			let e = r.value ?? [];
+			return e.length === 0 ? t`TRUE` : t`${l} NOT IN ${t.in(o ? e.map((e) => d(e)) : e)}`;
+		}
+		case "contains": {
+			let e = `%${L(typeof r.value == "string" ? r.value : String(r.value ?? ""))}%`;
+			return t.onDialectOrElse({
+				mysql: () => t`LOWER(${l}) LIKE LOWER(${e})`,
+				mssql: () => t`LOWER(${l}) LIKE LOWER(${e})`,
+				sqlite: () => t`LOWER(${l}) LIKE LOWER(${e})`,
+				orElse: () => t`${l} ILIKE ${e} ESCAPE '\\'`
+			});
+		}
+		case "arrayContains": {
+			let e = r.value ?? [];
+			return e.length === 0 ? t`TRUE` : t.onDialectOrElse({
+				mysql: () => t`JSON_CONTAINS(${l}, ${JSON.stringify(e)})`,
+				mssql: () => t`(SELECT COUNT(DISTINCT value) FROM OPENJSON(${l}) WHERE value IN ${t.in(e)}) = ${e.length}`,
+				sqlite: () => t`(SELECT COUNT(DISTINCT value) FROM json_each(${l}) WHERE value IN ${t.in(e)}) = ${e.length}`,
+				orElse: () => t`${l} @> ${e}`
+			});
+		}
+		case "arrayOverlaps": {
+			let e = r.value ?? [];
+			return e.length === 0 ? t`FALSE` : t.onDialectOrElse({
+				mysql: () => t.or(e.map((e) => t`JSON_CONTAINS(${l}, ${JSON.stringify(e)})`)),
+				mssql: () => t`EXISTS (SELECT 1 FROM OPENJSON(${l}) WHERE value IN ${t.in(e)})`,
+				sqlite: () => t`EXISTS (SELECT 1 FROM json_each(${l}) WHERE value IN ${t.in(e)})`,
+				orElse: () => t`${l} && ${e}`
+			});
+		}
+		case "arrayHas": return t.onDialectOrElse({
+			mysql: () => t`JSON_CONTAINS(${l}, ${JSON.stringify(r.value)})`,
+			mssql: () => t`${r.value} IN (SELECT value FROM OPENJSON(${l}))`,
+			sqlite: () => t`EXISTS (SELECT 1 FROM json_each(${l}) WHERE value = ${r.value})`,
+			orElse: () => t`${r.value} = ANY(${l})`
+		});
+		case "isNull": return t`${l} IS NULL`;
+		case "isNotNull": return t`${l} IS NOT NULL`;
+		case "spatial": {
+			let e = r.value, n = t.unsafe("::geometry"), a = e.bufferMeters === void 0 ? t`${e.geom}${n}` : t`ST_Buffer(${e.geom}::geography, ${e.bufferMeters})::geometry`;
+			return t.onDialectOrElse({
+				mysql: () => {
+					throw Error("@voltro/plugin-postgis: spatial predicates are postgres-only");
+				},
+				mssql: () => {
+					throw Error("@voltro/plugin-postgis: spatial predicates are postgres-only");
+				},
+				sqlite: () => {
+					throw Error("@voltro/plugin-postgis: spatial predicates are postgres-only");
+				},
+				orElse: () => e.fn === "ST_DWithin" ? t`ST_DWithin(${i}::geography, ${e.geom}::geography, ${e.distanceMeters})` : e.fn === "&&" ? t`${i}${n} && ${a}` : t`${t.unsafe(e.fn)}(${i}${n}, ${a})`
+			});
+		}
+	}
+}, en = (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}`);
+}, tn = (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 = en(e.window ?? {}, t);
+		switch (e.op) {
+			case "window-row-number": return t`ROW_NUMBER() OVER (${r}) AS ${t(e.alias)}`;
+			case "window-rank": return t`RANK() OVER (${r}) AS ${t(e.alias)}`;
+			case "window-dense-rank": return t`DENSE_RANK() OVER (${r}) AS ${t(e.alias)}`;
+			case "window-lag": return t`LAG(${n}, ${t.unsafe(String(e.offset ?? 1))}) OVER (${r}) AS ${t(e.alias)}`;
+			case "window-lead": return t`LEAD(${n}, ${t.unsafe(String(e.offset ?? 1))}) OVER (${r}) AS ${t(e.alias)}`;
+			case "window-sum-over": return t`SUM(${n}) OVER (${r}) AS ${t(e.alias)}`;
+			case "window-avg-over": return t`AVG(${n}) OVER (${r}) AS ${t(e.alias)}`;
+			default: throw Error(`compileAggregateProjection: unknown window op '${e.op}'`);
+		}
+	}
+	switch (e.op) {
+		case "count": return t`COUNT(${n}) AS ${t(e.alias)}`;
+		case "count-distinct": return t`COUNT(DISTINCT ${n}) AS ${t(e.alias)}`;
+		case "sum": return t`SUM(${n}) AS ${t(e.alias)}`;
+		case "avg": return t`AVG(${n}) AS ${t(e.alias)}`;
+		case "min": return t`MIN(${n}) AS ${t(e.alias)}`;
+		case "max": return t`MAX(${n}) AS ${t(e.alias)}`;
+		case "column":
+			if (e.column === void 0) throw Error(`compileAggregateProjection: 'column' projection requires a column name (alias '${e.alias}')`);
+			return t`${t(e.column)} AS ${t(e.alias)}`;
+		default: throw Error(`compileAggregateProjection: unknown op '${e.op}'`);
+	}
+})), nn = (e) => `[${e.join(",")}]`, rn = (e, t) => {
+	if (e.queryVector === void 0) return null;
+	let n = t(e.column), r = nn(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`
+	});
+}, an = (e, t) => {
+	let n = t.unsafe(e.useGeography ? "::geography" : "::geometry");
+	return t`ST_Distance(${t(e.column)}${n}, ${e.geom}${n})`;
+}, on = (e, t) => t`${t(e.column)} <-> ${e.geom}::geometry`, sn = (e, t) => t`${t(`${e.indexName}_tsv`)}`, cn = (e, t) => `${t}_${e.indexName}_fts`, ln = (e, t, n) => {
+	let r = n.csv(e.columns.map((e) => n`${n(e)}`)), i = `%${L(e.query)}%`;
+	return n.onDialectOrElse({
+		mysql: () => n`MATCH(${r}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
+		sqlite: () => {
+			let r = n(cn(e, t));
+			return n`${n("id")} IN (SELECT ${n("row_id")} FROM ${r} WHERE ${r} MATCH ${e.query})`;
+		},
+		mssql: () => n.or(e.columns.map((e) => n`LOWER(${n(e)}) LIKE LOWER(${i}) ESCAPE '\\'`)),
+		orElse: () => n`${sn(e, n)} @@ plainto_tsquery(${e.config ?? "english"}, ${e.query})`
+	});
+}, un = (e, t, n) => {
+	let r = `%${L(e.query)}%`;
+	return n.onDialectOrElse({
+		mysql: () => n`MATCH(${n.csv(e.columns.map((e) => n`${n(e)}`))}) AGAINST(${e.query} IN NATURAL LANGUAGE MODE)`,
+		sqlite: () => {
+			let r = n(cn(e, t));
+			return n`COALESCE((SELECT -bm25(${r}) FROM ${r} WHERE ${r} MATCH ${e.query} AND ${r}.${n("row_id")} = ${n("id")}), 0)`;
+		},
+		mssql: () => e.columns.map((e) => n`(CASE WHEN LOWER(${n(e)}) LIKE LOWER(${r}) ESCAPE '\\' THEN 1 ELSE 0 END)`).reduce((e, t, r) => r === 0 ? t : n`${e} + ${t}`),
+		orElse: () => n`ts_rank(${sn(e, n)}, plainto_tsquery(${e.config ?? "english"}, ${e.query}))`
+	});
+}, 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 (e.order.length > 0 && a.push(t` ORDER BY ${t.csv(e.order.map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`), e.take !== void 0) {
+			if (!Number.isInteger(e.take) || e.take < 0) throw Error(`compileSelect: invalid take ${e.take}`);
+			a.push(t` LIMIT ${t.unsafe(String(e.take))}`);
+		}
+		if (e.skip !== void 0) {
+			if (!Number.isInteger(e.skip) || e.skip < 0) throw Error(`compileSelect: invalid skip ${e.skip}`);
+			a.push(t` OFFSET ${t.unsafe(String(e.skip))}`);
+		}
+		return t`${i}${a.reduce((e, n) => t`${e}${n}`, t``)}`;
+	}
+	let r = e.annClause === void 0 ? null : rn(e.annClause, t);
+	e.spatialClause !== void 0 && t.onDialectOrElse({
+		mysql: () => {
+			throw Error("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+		},
+		mssql: () => {
+			throw Error("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+		},
+		sqlite: () => {
+			throw Error("@voltro/plugin-postgis: spatial distance / KNN ordering is postgres-only");
+		},
+		orElse: () => t``
+	});
+	let i = e.spatialClause?.projectAs === void 0 ? null : an(e.spatialClause, t), a = e.aggregations && e.aggregations.length > 0 ? tn(e.aggregations, t) : e.joinedProjection && e.joinedProjection.length > 0 ? t.csv(e.joinedProjection.map((e) => t`${t(e.source)} AS ${t(e.outputKey)}`)) : e.projection && e.projection.length > 0 ? t.csv(e.projection.map((e) => t`${t(e)}`)) : t`*`, o = (e.aggregations && e.aggregations.length > 0) === !0, s = r !== null && !o ? t`${a}, ${r} AS ${t("distance")}` : a, c = e.fullTextSearch, l = c?.rank !== void 0 && !o ? 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.alias === void 0 ? t`${t(I(n, e.table))}` : t`${t(I(n, e.table))} AS ${t(e.alias)}`, m = (e.joins ?? []).map((e) => {
+		let r = e.kind === "inner" ? "INNER" : "LEFT";
+		return t` ${t.unsafe(r)} JOIN ${t(I(n, e.table))} AS ${t(e.alias)} ON ${R(e.on, t, n)}`;
+	}), h = m.length > 0 ? m.reduce((e, n) => t`${e}${n}`, p) : p, g = c === void 0 ? null : ln(c, e.table, t), _ = [e.predicate ? R(e.predicate, t, n) : null, g].filter((e) => e !== null), ee = _.length > 0 ? t` WHERE ${t.and(_)}` : t``, v = e.groupBy && e.groupBy.length > 0 ? t` GROUP BY ${t.csv(e.groupBy.map((e) => t`${t(e)}`))}` : t``, y = e.having ? t` HAVING ${R(e.having, t, n)}` : 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`${on(e.spatialClause, t)} DESC` : t`${on(e.spatialClause, t)} ASC`), l !== null && c?.rank?.order === !0 && x.push(t`${l} DESC`);
+	for (let n of e.order) x.push(n.direction === "desc" ? t`${t(n.column)} DESC` : t`${t(n.column)} ASC`);
+	let te = 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 Error(`compileSelect: expected non-negative integer take/skip, got ${e}`);
+		return t.unsafe(String(e));
+	}, C = (e.ctes ?? []).map((e) => t`${t(e.name)} AS (${z(e.descriptor, t, n)})`), ne = (e.ctes ?? []).some((e) => e.recursive === !0), re = C.length > 0 ? t`WITH ${t.unsafe(ne ? "RECURSIVE " : "")}${t.csv(C)} ` : 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`${re}SELECT ${n}${f}${d} FROM ${h}${ee}${v}${y}${te}${r}`;
+		},
+		orElse: () => {
+			let n = e.take === void 0 ? t`` : t` LIMIT ${S(e.take)}`, r = b ? t` OFFSET ${S(e.skip)}` : t``;
+			return t`${re}SELECT ${f}${d} FROM ${h}${ee}${v}${y}${te}${n}${r}`;
+		}
+	});
+}, dn = (e, t, n) => {
+	if (e.eager === void 0) return null;
+	let r = fn(e.table, e.eager, e.sourceTable);
+	if (r === null) return null;
+	let i = gn(n, e, r, hn(t, n));
+	return i === null ? null : {
+		fragment: i,
+		decode: _n(r)
+	};
+}, fn = (e, t, n) => {
+	let r = n ?? f(e), i = M(e);
+	if (i === void 0) return null;
+	let a = [];
+	for (let [e, n] of Object.entries(t)) {
+		let t = i[e];
+		if (t === void 0) return null;
+		let o = pn(e, t, r, n === !0 ? {} : n);
+		if (o === null) return null;
+		a.push(o);
+	}
+	return {
+		table: r,
+		children: a
+	};
+}, pn = (e, t, n, r) => {
+	let i = t.target(), a = (t.kind === "manyToMany" ? void 0 : t.sourceKey) ?? "id", o, s;
+	if (t.kind === "manyToMany") o = t.targetKey, s = "target";
+	else if (t.kind === "one") {
+		let r = mn(n, i.tableName);
+		if (r !== void 0) o = r, s = "source";
+		else try {
+			o = t.foreignKey ?? A(i, n.tableName, e), s = "target";
+		} catch {
+			return null;
+		}
+	} else try {
+		o = t.foreignKey ?? A(i, n.tableName, e), s = "target";
+	} catch {
+		return null;
+	}
+	let c = r.with === void 0 ? [] : (() => {
+		let e = M(i.tableName);
+		if (e === void 0 && Object.keys(r.with).length > 0) return null;
+		let t = [];
+		for (let [n, a] of Object.entries(r.with)) {
+			let r = e?.[n];
+			if (r === void 0) return null;
+			let o = pn(n, r, i, a === !0 ? {} : a);
+			if (o === null) return null;
+			t.push(o);
+		}
+		return t;
+	})();
+	return c === null ? null : {
+		relationName: e,
+		relation: t,
+		source: n,
+		target: i,
+		foreignKey: o,
+		sourceKey: a,
+		fkSide: s,
+		branch: r,
+		children: c
+	};
+}, mn = (e, t) => {
+	for (let [n, r] of Object.entries(e.fields)) if (r.type === "reference" && r.references?.()?.tableName === t) return n;
+}, hn = (e, t) => {
+	let n = 0;
+	return {
+		sql: e,
+		dialect: t,
+		nextAlias: () => `__a${n++}`
+	};
+}, gn = (e, t, n, r) => {
+	switch (e) {
+		case "postgres": return yn(t, n, r);
+		case "sqlite":
+		case "turso": return Tn(t, n, r);
+		case "mysql":
+		case "mariadb": return jn(t, n, r);
+		case "mssql": return Rn(t, n, r);
+	}
+}, _n = (e) => {
+	let t = vn(e.table, e.children);
+	return (e) => e.map((e) => {
+		let n = e.__row, r = typeof n == "string" ? JSON.parse(n) : n;
+		return t(r);
+	});
+}, vn = (e, t) => {
+	let n = [];
+	for (let [t, r] of Object.entries(e.fields)) (r.type === "timestamp" || r.type === "date") && n.push(t);
+	let r = t.map((e) => {
+		let t = vn(e.target, e.children), n = e.relation.kind === "one";
+		return {
+			name: e.relationName,
+			decode: t,
+			isSingle: n
+		};
+	});
+	return (e) => {
+		let t = { ...e };
+		for (let e of n) {
+			let n = t[e];
+			typeof n == "string" && (t[e] = new Date(n));
+		}
+		for (let e of r) {
+			let n = t[e.name];
+			if (n == null) {
+				t[e.name] = e.isSingle ? null : [];
+				continue;
+			}
+			e.isSingle ? t[e.name] = e.decode(n) : t[e.name] = n.map((t) => e.decode(t));
+		}
+		return t;
+	};
+}, yn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = r(t.table.tableName), o = r(i), s = B(i, t.children, n);
+	return s === null ? null : r`SELECT ${s} AS "__row" FROM ${a} AS ${o}${e.predicate ? r` WHERE ${K(e.predicate, i, r)}` : r``}${e.order.length > 0 ? r` ORDER BY ${r.csv(e.order.map((e) => e.direction === "desc" ? r`${U(i, e.column, r)} DESC` : r`${U(i, e.column, r)} ASC`))}` : r``}${e.take === void 0 ? r`` : r` LIMIT ${G(e.take, r)}`}${e.skip === void 0 ? r`` : r` OFFSET ${G(e.skip, r)}`}`;
+}, B = (e, t, n) => {
+	let r = n.sql, i = r`to_jsonb(${r(e)}.*)`;
+	if (t.length === 0) return i;
+	let a = [];
+	for (let i of t) {
+		let t = bn(i, e, n);
+		if (t === null) return null;
+		a.push(r`${W(i.relationName, r)}, ${t}`);
+	}
+	return r`${i} || jsonb_build_object(${r.csv(a)})`;
+}, bn = (e, t, n) => {
+	switch (n.sql, e.relation.kind) {
+		case "one": return xn(e, t, n);
+		case "many": return Sn(e, t, n);
+		case "manyToMany": return Cn(e, t, n);
+	}
+}, xn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = B(i, e.children, n);
+	if (a === null) return null;
+	let o = e.fkSide === "source" ? r`${U(i, "id", r)} = ${U(t, e.foreignKey, r)}` : r`${U(i, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${K(e.branch.where, i, r)}`, c = V(i, e.branch.orderBy, r);
+	return r`(SELECT ${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o}${s}${c} LIMIT 1)`;
+}, Sn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = B(i, e.children, n);
+	if (a === null) return null;
+	let o = r`${U(void 0, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${R(e.branch.where, r)}`, c = wn(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${G(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${G(e.branch.offset, r)}`;
+	return r`COALESCE((SELECT jsonb_agg(${a}) FROM (SELECT * FROM ${r(e.target.tableName)} WHERE ${o}${s}${c}${l}${u}) AS ${r(i)}), '[]'::jsonb)`;
+}, Cn = (e, t, n) => {
+	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = B(o, e.children, n);
+	if (c === null) return null;
+	let l = e.branch.where === void 0 ? r`` : r` AND ${R(e.branch.where, r)}`, u = q(e, s, r), d = V(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${G(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${G(e.branch.offset, r)}`;
+	return r`COALESCE((SELECT jsonb_agg(${c}) FROM (SELECT ${r(o)}.* FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${U(o, "id", r)} = ${U(s, i.targetKey, r)} WHERE ${U(s, i.sourceKey, r)} = ${U(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), '[]'::jsonb)`;
+}, V = (e, t, n) => t === void 0 || t.length === 0 ? n`` : n` ORDER BY ${n.csv(t.map((t) => t.direction === "desc" ? n`${U(e, t.column, n)} DESC` : n`${U(e, t.column, n)} ASC`))}`, wn = (e, t) => e === void 0 || e.length === 0 ? t`` : t` ORDER BY ${t.csv(e.map((e) => e.direction === "desc" ? t`${t(e.column)} DESC` : t`${t(e.column)} ASC`))}`, Tn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = En(i, t.table, t.children, n);
+	if (a === null) return null;
+	let o = e.predicate ? r` WHERE ${K(e.predicate, i, r)}` : r``, s = e.order.length > 0 ? r` ORDER BY ${r.csv(e.order.map((e) => e.direction === "desc" ? r`${U(i, e.column, r)} DESC` : r`${U(i, e.column, r)} ASC`))}` : r``, c = e.take === void 0 ? r`` : r` LIMIT ${G(e.take, r)}`, l = e.skip === void 0 ? r`` : r` OFFSET ${G(e.skip, r)}`;
+	return r`SELECT ${a} AS "__row" FROM ${r(t.table.tableName)} AS ${r(i)}${o}${s}${c}${l}`;
+}, En = (e, t, n, r) => {
+	let i = r.sql, a = [];
+	for (let n of Object.keys(t.fields)) a.push(i`${W(n, i)}, ${U(e, n, i)}`);
+	for (let t of n) {
+		let n = Dn(t, e, r);
+		if (n === null) return null;
+		a.push(i`${W(t.relationName, i)}, ${n}`);
+	}
+	return i`json_object(${i.csv(a)})`;
+}, Dn = (e, t, n) => {
+	switch (e.relation.kind) {
+		case "one": return On(e, t, n);
+		case "many": return kn(e, t, n);
+		case "manyToMany": return An(e, t, n);
+	}
+}, On = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = En(i, e.target, e.children, n);
+	if (a === null) return null;
+	let o = e.fkSide === "source" ? r`${U(i, "id", r)} = ${U(t, e.foreignKey, r)}` : r`${U(i, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}`;
+	return r`(SELECT ${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o} LIMIT 1)`;
+}, kn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = En(i, e.target, e.children, n);
+	if (a === null) return null;
+	let o = r`${U(void 0, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${R(J(e.branch.where), r)}`, c = wn(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${G(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${G(e.branch.offset, r)}`;
+	return r`COALESCE((SELECT json_group_array(${a}) FROM (SELECT * FROM ${r(e.target.tableName)} WHERE ${o}${s}${c}${l}${u}) AS ${r(i)}), json('[]'))`;
+}, An = (e, t, n) => {
+	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = En(o, e.target, e.children, n);
+	if (c === null) return null;
+	let l = e.branch.where === void 0 ? r`` : r` AND ${R(J(e.branch.where), r)}`, u = q(e, s, r, !0), d = V(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${G(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${G(e.branch.offset, r)}`;
+	return r`COALESCE((SELECT json_group_array(${c}) FROM (SELECT ${r(o)}.* FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${U(o, "id", r)} = ${U(s, i.targetKey, r)} WHERE ${U(s, i.sourceKey, r)} = ${U(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), json('[]'))`;
+}, jn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = H(i, t.table, t.children, n);
+	if (a === null) return null;
+	let o = e.predicate ? r` WHERE ${K(e.predicate, i, r)}` : r``, s = e.order.length > 0 ? r` ORDER BY ${r.csv(e.order.map((e) => e.direction === "desc" ? r`${U(i, e.column, r)} DESC` : r`${U(i, e.column, r)} ASC`))}` : r``, c = e.take === void 0 ? r`` : r` LIMIT ${G(e.take, r)}`, l = e.skip === void 0 ? r`` : r` OFFSET ${G(e.skip, r)}`;
+	return r`SELECT ${a} AS \`__row\` FROM ${r(t.table.tableName)} AS ${r(i)}${o}${s}${c}${l}`;
+}, H = (e, t, n, r) => {
+	let i = r.sql, a = [];
+	for (let n of Object.keys(t.fields)) a.push(i`${W(n, i)}, ${U(e, n, i)}`);
+	for (let t of n) {
+		let n = Mn(t, e, r);
+		if (n === null) return null;
+		a.push(i`${W(t.relationName, i)}, ${n}`);
+	}
+	return i`JSON_OBJECT(${i.csv(a)})`;
+}, Mn = (e, t, n) => {
+	switch (e.relation.kind) {
+		case "one": return Nn(e, t, n);
+		case "many": return n.dialect === "mariadb" ? In(e, t, n) : Pn(e, t, n);
+		case "manyToMany": return n.dialect === "mariadb" ? Ln(e, t, n) : Fn(e, t, n);
+	}
+}, Nn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = H(i, e.target, e.children, n);
+	if (a === null) return null;
+	let o = e.fkSide === "source" ? r`${U(i, "id", r)} = ${U(t, e.foreignKey, r)}` : r`${U(i, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}`;
+	return r`(SELECT ${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o} LIMIT 1)`;
+}, Pn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = H(i, e.target, e.children, n);
+	if (a === null) return null;
+	let o = r`${U(void 0, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${R(J(e.branch.where), r)}`, c = wn(e.branch.orderBy, r), l = e.branch.limit === void 0 ? r`` : r` LIMIT ${G(e.branch.limit, r)}`, u = e.branch.offset === void 0 ? r`` : r` OFFSET ${G(e.branch.offset, r)}`;
+	return r`COALESCE((SELECT JSON_ARRAYAGG(${a}) FROM (SELECT * FROM ${r(e.target.tableName)} WHERE ${o}${s}${c}${l}${u}) AS ${r(i)}), JSON_ARRAY())`;
+}, Fn = (e, t, n) => {
+	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = H(o, e.target, e.children, n);
+	if (c === null) return null;
+	let l = e.branch.where === void 0 ? r`` : r` AND ${R(J(e.branch.where), r)}`, u = q(e, s, r, !0), d = V(o, e.branch.orderBy, r), f = e.branch.limit === void 0 ? r`` : r` LIMIT ${G(e.branch.limit, r)}`, p = e.branch.offset === void 0 ? r`` : r` OFFSET ${G(e.branch.offset, r)}`;
+	return r`COALESCE((SELECT JSON_ARRAYAGG(${c}) FROM (SELECT ${r(o)}.* FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${U(o, "id", r)} = ${U(s, i.targetKey, r)} WHERE ${U(s, i.sourceKey, r)} = ${U(t, "id", r)}${u}${l}${d}${f}${p}) AS ${r(o)}), JSON_ARRAY())`;
+}, In = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = H(i, e.target, e.children, n);
+	if (a === null) return null;
+	let o = r`${U(i, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}`, s = e.branch.where === void 0 ? r`` : r` AND ${R(J(e.branch.where), r)}`, c = e.branch.orderBy ?? [];
+	if (!(e.branch.limit !== void 0 || e.branch.offset !== void 0)) return r`COALESCE((SELECT JSON_ARRAYAGG(${a}${c.length > 0 ? r` ORDER BY ${r.csv(c.map((e) => e.direction === "desc" ? r`${U(i, e.column, r)} DESC` : r`${U(i, e.column, r)} ASC`))}` : r``}) FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o}${s}), JSON_ARRAY())`;
+	let l = c.length > 0 ? r` ORDER BY ${r.csv(c.map((e) => e.direction === "desc" ? r`${r(e.column)} DESC` : r`${r(e.column)} ASC`))}` : r` ORDER BY ${r("id")}`, u = e.branch.limit, d = e.branch.offset, f = u !== void 0 && d !== void 0 ? r` AND ${U(i, "rn", r)} > ${G(d, r)} AND ${U(i, "rn", r)} <= ${G(d + u, r)}` : u === void 0 ? r` AND ${U(i, "rn", r)} > ${G(d, r)}` : r` AND ${U(i, "rn", r)} <= ${G(u, r)}`;
+	return r`COALESCE((SELECT JSON_ARRAYAGG(${a} ORDER BY ${U(i, "rn", r)}) FROM (SELECT *, ROW_NUMBER() OVER (PARTITION BY ${r(e.foreignKey)}${l}) AS rn FROM ${r(e.target.tableName)}) AS ${r(i)} WHERE ${o}${s}${f}), JSON_ARRAY())`;
+}, Ln = (e, t, n) => {
+	let r = n.sql, i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = H(o, e.target, e.children, n);
+	if (c === null) return null;
+	let l = r`${U(s, i.sourceKey, r)} = ${U(t, "id", r)}`, u = r`${U(o, "id", r)} = ${U(s, i.targetKey, r)}`, d = e.branch.where === void 0 ? r`` : r` AND ${R(J(e.branch.where), r)}`, f = q(e, s, r, !0), p = e.branch.orderBy ?? [];
+	if (!(e.branch.limit !== void 0 || e.branch.offset !== void 0)) return r`COALESCE((SELECT JSON_ARRAYAGG(${c}${p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${U(o, e.column, r)} DESC` : r`${U(o, e.column, r)} ASC`))}` : r``}) FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${u} WHERE ${l}${f}${d}), JSON_ARRAY())`;
+	let m = p.length > 0 ? r` ORDER BY ${r.csv(p.map((e) => e.direction === "desc" ? r`${U(o, e.column, r)} DESC` : r`${U(o, e.column, r)} ASC`))}` : r` ORDER BY ${U(o, "id", r)}`, h = e.branch.limit, g = e.branch.offset, _ = n.nextAlias(), ee = h !== void 0 && g !== void 0 ? r` AND ${U(_, "rn", r)} > ${G(g, r)} AND ${U(_, "rn", r)} <= ${G(g + h, r)}` : h === void 0 ? r` AND ${U(_, "rn", r)} > ${G(g, r)}` : r` AND ${U(_, "rn", r)} <= ${G(h, r)}`, v = e.branch.onJunction === void 0 ? r`` : r` WHERE ${K(J(e.branch.onJunction), s, r)}`;
+	return r`COALESCE((SELECT JSON_ARRAYAGG(${c} ORDER BY ${U(_, "rn", r)}) FROM (SELECT ${r(o)}.*, ${U(s, i.sourceKey, r)} AS ${r(`__src_${i.sourceKey}`)}, ROW_NUMBER() OVER (PARTITION BY ${U(s, i.sourceKey, r)}${m}) AS rn FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${u}${v}) AS ${r(_)} WHERE ${U(_, `__src_${i.sourceKey}`, r)} = ${U(t, "id", r)}${d}${ee}), JSON_ARRAY())`;
+}, Rn = (e, t, n) => {
+	let r = n.sql, i = n.nextAlias(), a = zn(i, t.table, t.children, n);
+	if (a === null) return null;
+	let o = e.predicate ? r` WHERE ${K(e.predicate, i, r)}` : r``, s = e.order.length > 0 ? r` ORDER BY ${r.csv(e.order.map((e) => e.direction === "desc" ? r`${U(i, e.column, r)} DESC` : r`${U(i, e.column, r)} ASC`))}` : r``, c = r``, l = r``;
+	if (e.skip !== void 0) {
+		let t = e.order.length > 0 ? s : r` ORDER BY (SELECT NULL)`;
+		l = e.take === void 0 ? r`${t} OFFSET ${G(e.skip, r)} ROWS` : r`${t} OFFSET ${G(e.skip, r)} ROWS FETCH NEXT ${G(e.take, r)} ROWS ONLY`;
+	} else e.take !== void 0 && (c = r`TOP ${G(e.take, r)} `);
+	let u = e.skip === void 0 ? s : r``;
+	return r`SELECT [__row] = (SELECT ${c}${a} FROM ${r(t.table.tableName)} AS ${r(i)}${o}${u}${l} FOR JSON PATH, INCLUDE_NULL_VALUES, WITHOUT_ARRAY_WRAPPER)`;
+}, zn = (e, t, n, r) => {
+	let i = r.sql, a = [];
+	for (let n of Object.keys(t.fields)) a.push(i`${U(e, n, i)} AS ${i(n)}`);
+	for (let t of n) {
+		let n = Bn(t, e, r);
+		if (n === null) return null;
+		a.push(n);
+	}
+	return i.csv(a);
+}, Bn = (e, t, n) => {
+	let r = n.sql;
+	switch (e.relation.kind) {
+		case "one": {
+			let i = n.nextAlias(), a = zn(i, e.target, e.children, n);
+			if (a === null) return null;
+			let o = e.fkSide === "source" ? r`${U(i, "id", r)} = ${U(t, e.foreignKey, r)}` : r`${U(i, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}`;
+			return r`JSON_QUERY((SELECT TOP 1 ${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${o} FOR JSON PATH, INCLUDE_NULL_VALUES, WITHOUT_ARRAY_WRAPPER)) AS ${r(e.relationName)}`;
+		}
+		case "many": {
+			let i = n.nextAlias(), a = zn(i, e.target, e.children, n);
+			if (a === null) return null;
+			let o = e.branch.where === void 0 ? r`` : r` AND ${K(e.branch.where, i, r)}`, s = V(i, e.branch.orderBy, r), c = r``, l = r``;
+			if (e.branch.offset !== void 0) {
+				let t = e.branch.orderBy && e.branch.orderBy.length > 0 ? s : r` ORDER BY (SELECT NULL)`;
+				l = e.branch.limit === void 0 ? r`${t} OFFSET ${G(e.branch.offset, r)} ROWS` : r`${t} OFFSET ${G(e.branch.offset, r)} ROWS FETCH NEXT ${G(e.branch.limit, r)} ROWS ONLY`;
+			} else e.branch.limit !== void 0 && (c = r`TOP ${G(e.branch.limit, r)} `);
+			let u = e.branch.offset === void 0 ? s : r``;
+			return r`ISNULL(JSON_QUERY((SELECT ${c}${a} FROM ${r(e.target.tableName)} AS ${r(i)} WHERE ${U(i, e.foreignKey, r)} = ${U(t, e.sourceKey, r)}${o}${u}${l} FOR JSON PATH, INCLUDE_NULL_VALUES)), JSON_QUERY('[]')) AS ${r(e.relationName)}`;
+		}
+		case "manyToMany": {
+			let i = e.relation, a = i.through(), o = n.nextAlias(), s = n.nextAlias(), c = zn(o, e.target, e.children, n);
+			if (c === null) return null;
+			let l = e.branch.where === void 0 ? r`` : r` AND ${K(e.branch.where, o, r)}`, u = q(e, s, r), d = V(o, e.branch.orderBy, r), f = r``, p = r``;
+			if (e.branch.offset !== void 0) {
+				let t = e.branch.orderBy && e.branch.orderBy.length > 0 ? d : r` ORDER BY (SELECT NULL)`;
+				p = e.branch.limit === void 0 ? r`${t} OFFSET ${G(e.branch.offset, r)} ROWS` : r`${t} OFFSET ${G(e.branch.offset, r)} ROWS FETCH NEXT ${G(e.branch.limit, r)} ROWS ONLY`;
+			} else e.branch.limit !== void 0 && (f = r`TOP ${G(e.branch.limit, r)} `);
+			let m = e.branch.offset === void 0 ? d : r``;
+			return r`ISNULL(JSON_QUERY((SELECT ${f}${c} FROM ${r(a.tableName)} AS ${r(s)} INNER JOIN ${r(e.target.tableName)} AS ${r(o)} ON ${U(o, "id", r)} = ${U(s, i.targetKey, r)} WHERE ${U(s, i.sourceKey, r)} = ${U(t, "id", r)}${u}${l}${m}${p} FOR JSON PATH, INCLUDE_NULL_VALUES)), JSON_QUERY('[]')) AS ${r(e.relationName)}`;
+		}
+	}
+}, U = (e, t, n) => e === void 0 ? n`${n(t)}` : n`${n(e)}.${n(t)}`, W = (e, t) => t.unsafe(`'${e.replace(/'/g, "''")}'`), G = (e, t) => {
+	if (!Number.isFinite(e) || !Number.isInteger(e) || e < 0) throw Error(`literalInt: expected non-negative integer, got ${e}`);
+	return t.unsafe(String(e));
+}, K = (e, t, n) => R(Vn(e, t), n), q = (e, t, n, r = !1) => {
+	let i = e.branch.onJunction;
+	return i === void 0 ? n`` : n` AND ${K(r ? J(i) : i, t, n)}`;
+}, Vn = (e, t) => {
+	if ("not" in e) return { not: Vn(e.not, t) };
+	if ("and" in e) return { and: e.and.map((e) => Vn(e, t)) };
+	if ("or" in e) return { or: e.or.map((e) => Vn(e, t)) };
+	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
+		let n = e;
+		return {
+			...n,
+			column: `${t}.${n.column}`
+		};
+	}
+	if (e.op === "exists" || e.op === "not-exists") return e;
+	let n = e;
+	return {
+		...n,
+		column: `${t}.${n.column}`
+	};
+}, J = (e) => {
+	if ("not" in e) return { not: J(e.not) };
+	if ("and" in e) return { and: e.and.map((e) => J(e)) };
+	if ("or" in e) return { or: e.or.map((e) => J(e)) };
+	if (e.op === "subquery-in" || e.op === "subquery-not-in" || e.op === "exists" || e.op === "not-exists") return e;
+	let t = e;
+	return {
+		...t,
+		value: Hn(t.value)
+	};
+}, Hn = (e) => e == null ? e : e instanceof Date ? e.toISOString() : typeof e == "boolean" ? +!!e : Array.isArray(e) ? e.map((e) => Hn(e)) : e, Un, Wn, Gn = (e) => {
+	e.actors !== void 0 && (Un = e.actors), e.tenants !== void 0 && (Wn = e.tenants);
+}, Kn = (e, t) => () => {
+	let n = e();
+	if (n === void 0) throw Error(`core '${t}' table not registered; expected the framework CLI or your migrate step to call registerCoreTables({ ${t}: () => ${t}Table }) before the database handle is constructed`);
+	return n();
+}, qn = () => Kn(() => Un, "actors"), Jn = () => Kn(() => Wn, "tenants"), Yn = n("actors", {
+	id: T(),
+	kind: o().oneOf([
+		"user",
+		"serviceAccount",
+		"apiKey",
+		"system"
+	]),
+	displayName: o().nullable(),
+	createdAt: v().default("now")
+}), Xn = (e, t) => ({
+	column: e,
+	op: "eq",
+	value: t
+}), Zn = (e, t) => ({
+	column: e,
+	op: "neq",
+	value: t
+}), Qn = (e, t) => ({
+	column: e,
+	op: "gt",
+	value: t
+}), $n = (e, t) => ({
+	column: e,
+	op: "gte",
+	value: t
+}), er = (e, t) => ({
+	column: e,
+	op: "lt",
+	value: t
+}), tr = (e, t) => ({
+	column: e,
+	op: "lte",
+	value: t
+}), nr = (e, t) => ({
+	column: e,
+	op: "in",
+	value: t
+}), rr = (e, t) => ({
+	column: e,
+	op: "notIn",
+	value: t
+}), ir = (e, t) => ({
+	column: e,
+	op: "contains",
+	value: t
+}), ar = (e, t) => ({
+	column: e,
+	op: "arrayContains",
+	value: t
+}), or = (e, t) => ({
+	column: e,
+	op: "arrayOverlaps",
+	value: t
+}), sr = (e, t) => ({
+	column: e,
+	op: "arrayHas",
+	value: t
+}), cr = (e) => ({
+	column: e,
+	op: "isNull"
+}), lr = (e) => ({
+	column: e,
+	op: "isNotNull"
+}), ur = (e, t) => ({
+	column: e,
+	op: "spatial",
+	value: t
+}), dr = (...e) => ({ and: e }), fr = (...e) => ({ or: e }), pr = (e) => ({ not: e }), mr = (e, ...t) => {
+	if (t.length === 0) throw Error(`jsonField("${e}"): at least one path segment is required`);
+	let n = (n, r) => ({
+		column: e,
+		path: t,
+		op: n,
+		value: r
+	});
+	return {
+		eq: (e) => n("eq", e),
+		neq: (e) => n("neq", e),
+		gt: (e) => n("gt", e),
+		gte: (e) => n("gte", e),
+		lt: (e) => n("lt", e),
+		lte: (e) => n("lte", e),
+		inSet: (e) => n("in", e),
+		notInSet: (e) => n("notIn", e),
+		contains: (e) => n("contains", e),
+		isNull: () => n("isNull"),
+		isNotNull: () => n("isNotNull")
+	};
+}, hr = (e) => "descriptor" in e ? e.descriptor : e, gr = (e, t) => ({
+	column: e,
+	op: "subquery-in",
+	subquery: hr(t)
+}), _r = (e, t) => ({
+	column: e,
+	op: "subquery-not-in",
+	subquery: hr(t)
+}), vr = (e) => ({
+	op: "exists",
+	subquery: hr(e)
+}), yr = (e) => ({
+	op: "not-exists",
+	subquery: hr(e)
+}), br = (e, t) => e == null || t == null ? null : typeof e == typeof t ? e === t ? 0 : e > t ? 1 : -1 : null, xr = (e, t, n = null) => {
+	if (!t) return !1;
+	if ("not" in e) return !xr(e.not, t, n);
+	if ("and" in e) {
+		for (let r of e.and) if (!xr(r, t, n)) return !1;
+		return !0;
+	}
+	if ("or" in e) {
+		for (let r of e.or) if (xr(r, t, n)) return !0;
+		return !1;
+	}
+	if (e.op === "subquery-in" || e.op === "subquery-not-in") {
+		if (!n) return !1;
+		let r = n.get(e.subquery);
+		if (!(r instanceof Set)) return !1;
+		let i = t[e.column], a = r.has(i);
+		return e.op === "subquery-in" ? a : !a;
+	}
+	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 r = e, i = t[r.column];
+	switch (r.op) {
+		case "eq": return i === r.value;
+		case "neq": return i !== r.value;
+		case "gt": return (br(i, r.value) ?? -1) > 0;
+		case "gte": return (br(i, r.value) ?? -1) >= 0;
+		case "lt": return (br(i, r.value) ?? 1) < 0;
+		case "lte": return (br(i, r.value) ?? 1) <= 0;
+		case "in": return Array.isArray(r.value) && r.value.includes(i);
+		case "notIn": return Array.isArray(r.value) && !r.value.includes(i);
+		case "contains": return typeof i == "string" && typeof r.value == "string" && i.toLowerCase().includes(r.value.toLowerCase());
+		case "arrayContains": {
+			let e = Array.isArray(i) ? i : [];
+			return (Array.isArray(r.value) ? r.value : []).every((t) => e.includes(t));
+		}
+		case "arrayOverlaps": {
+			let e = Array.isArray(i) ? i : [];
+			return (Array.isArray(r.value) ? r.value : []).some((t) => e.includes(t));
+		}
+		case "arrayHas": return Array.isArray(i) && i.includes(r.value);
+		case "isNull": return i == null;
+		case "isNotNull": return i != null;
+		case "spatial": throw Error("@voltro/plugin-postgis: spatial predicates (ST_DWithin / ST_Contains / ST_Within / ST_Intersects / bbox &&) are not evaluable in-memory — use them in one-shot ctx.store.query reads, not reactive subscriptions.");
+	}
+}, Sr = function* (e) {
+	if ("not" in e) {
+		yield* Sr(e.not);
+		return;
+	}
+	if ("and" in e) {
+		for (let t of e.and) yield* Sr(t);
+		return;
+	}
+	if ("or" in e) {
+		for (let t of e.or) yield* Sr(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
+	});
+}, Cr = function* (e, t = !0) {
+	if ("not" in e) {
+		yield* Cr(e.not, !1);
+		return;
+	}
+	if ("and" in e) {
+		for (let n of e.and) yield* Cr(n, t);
+		return;
+	}
+	if ("or" in e) {
+		for (let t of e.or) yield* Cr(t, !1);
+		return;
+	}
+	e.op === "subquery-in" || e.op === "subquery-not-in" || e.op === "exists" || e.op === "not-exists" || (yield {
+		...e,
+		conjunctive: t
+	});
+}, wr = class extends nt.TaggedError("TableStreamError") {}, Tr = 1e3, Er = (e, t, n, r) => {
+	let i = O.match(r, {
+		onNone: () => e.where,
+		onSome: (n) => e.where ? dr(e.where, Qn(t, n)) : Qn(t, n)
+	});
+	return {
+		table: e.table,
+		predicate: i,
+		order: [{
+			column: t,
+			direction: "asc"
+		}],
+		take: n,
+		skip: void 0,
+		projection: e.projection,
+		...e.includeDeleted === void 0 ? {} : { includeDeleted: e.includeDeleted },
+		...e.crossTenant === void 0 ? {} : { crossTenant: e.crossTenant }
+	};
+}, Dr = (e, t) => {
+	let n = t.pk ?? "id", r = t.chunkSize ?? Tr;
+	return it.paginateChunkEffect(O.none(), (i) => {
+		let a = rt.tryPromise({
+			try: () => e.query(Er(t, n, r, i)),
+			catch: (e) => new wr({
+				table: t.table,
+				cause: e
+			})
+		});
+		return (t.retry ? a.pipe(rt.retry(t.retry)) : a).pipe(rt.map((e) => [tt.fromIterable(e), e.length === r && e.length > 0 ? O.some(O.some(e[e.length - 1][n])) : O.none()]));
+	});
+}, Or = (e) => {
+	let t = e.alpha ?? .5;
+	if (t < 0 || t > 1) throw Error(`hybridSearch: alpha must be in [0, 1], got ${t}`);
+	return (n) => {
+		let r = Array.isArray(e.vector.query) ? {
+			column: e.vector.col,
+			queryVector: e.vector.query,
+			distance: e.vector.distance ?? "cosine",
+			alpha: t
+		} : {
+			column: e.vector.col,
+			queryText: e.vector.query,
+			distance: e.vector.distance ?? "cosine",
+			alpha: t
+		}, i = C(n.table, e.fts.indexName, n.fullTextIndexes);
+		return {
+			...n,
+			annClause: r,
+			fullTextSearch: {
+				indexName: e.fts.indexName,
+				query: e.fts.query,
+				columns: i.columns,
+				...i.config === void 0 ? {} : { config: i.config },
+				...i.weights === void 0 ? {} : { weights: i.weights }
+			}
+		};
+	};
+}, kr = async (e, t) => {
+	let n = e.as ?? "embedding", r = t.row[e.from];
+	if (typeof r != "string" || r.length === 0) return {};
+	let i = await t.embed(r);
+	return { [n]: i };
+}, Ar = (e) => {
+	if (!Number.isInteger(e.dimensions) || e.dimensions <= 0) throw Error(`vectorEmbedding: dimensions must be a positive integer, got ${String(e.dimensions)}.`);
+	let t = e.as ?? "embedding", n = (t) => kr(e, t);
+	return d({
+		id: "voltro/vectorEmbedding",
+		fields: { [t]: ke(e.dimensions) },
+		...e.index === !1 ? {} : { indexes: [{
+			fields: [t],
+			kind: "hnsw",
+			kindOptions: { hnsw: {
+				...e.index?.m === void 0 ? {} : { m: e.index.m },
+				...e.index?.efConstruction === void 0 ? {} : { efConstruction: e.index.efConstruction },
+				distance: e.distance ?? "cosine"
+			} }
+		}] },
+		behaviors: {
+			beforeInsert: n,
+			beforeUpdate: n
+		}
+	});
+}, jr = 63, Mr = "br_pr", Y = class extends Error {
+	_tag = "BranchNameInvalid";
+	constructor(e) {
+		super(e), this.name = "BranchNameInvalid";
+	}
+}, Nr = (e, t) => {
+	if (!Number.isInteger(t) || t < 0) throw new Y(`prNumber must be a non-negative integer, got ${String(t)}`);
+	let n = Zt(e);
+	if (n.replace(/_/g, "") === "") throw new Y(`app slug '${e}' has no usable identifier characters`);
+	let r = `${Mr}${t}_${n}`;
+	if (r.length > jr) throw new Y(`branch namespace '${r}' exceeds the ${jr}-byte identifier limit — use a shorter app slug`);
+	return r;
+}, Pr = (e) => e.startsWith(Mr), Fr = {
+	requested: {
+		provision: "provisioning",
+		destroy: "destroying"
+	},
+	provisioning: {
+		provisioned: "ready",
+		fail: "failed"
+	},
+	ready: { destroy: "destroying" },
+	failed: {
+		provision: "provisioning",
+		destroy: "destroying"
+	},
+	destroying: {
+		destroyed: "destroyed",
+		fail: "failed"
+	},
+	destroyed: {}
+}, Ir = class extends Error {
+	from;
+	event;
+	_tag = "BranchTransitionInvalid";
+	constructor(e, t) {
+		super(`invalid branch transition: ${e} --${t}-->`), this.from = e, this.event = t, this.name = "BranchTransitionInvalid";
+	}
+}, Lr = (e, t) => {
+	let n = Fr[e][t];
+	if (n === void 0) throw new Ir(e, t);
+	return n;
+}, Rr = (e, t, n, r) => {
+	if (n === "copy" && (r === void 0 || r === "")) throw new Y("seed 'copy' requires a parentNamespace to snapshot from");
+	let i = [{
+		kind: "create-namespace",
+		detail: e
+	}];
+	for (let n of t) i.push({
+		kind: "create-table",
+		table: n,
+		detail: `${e}.${n}`
+	});
+	if (n === "copy") for (let n of t) i.push({
+		kind: "copy-table",
+		table: n,
+		detail: `${r}.${n} → ${e}.${n}`
+	});
+	else n === "fresh" && i.push({
+		kind: "seed",
+		detail: `run boot seeds into ${e}`
+	});
+	return i;
+}, zr = (e) => {
+	if (!Pr(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
+	return [{
+		kind: "drop-namespace",
+		detail: e
+	}];
+}, Br = (e) => {
+	if (e === void 0 || e === "") return !1;
+	try {
+		let t = new URL(e).hostname.toLowerCase();
+		return /(^|\.)neon\.(tech|build)$/.test(t);
+	} catch {
+		return /\bneon\.(tech|build)\b/i.test(e);
+	}
+}, Vr = (e) => e.prefer === void 0 ? e.seed === "copy" && Br(e.dbUrl) ? "neon-cow" : "namespace" : e.prefer, Hr = (e, t = {}) => [{
+	kind: "neon-branch-create",
+	detail: `${t.parentBranch ?? "main"} → ${e} (copy-on-write)`
+}], Ur = (e) => {
+	if (!Pr(e)) throw new Y(`refusing to plan teardown of '${e}' — not a branch namespace`);
+	return [{
+		kind: "neon-branch-delete",
+		detail: e
+	}];
+}, Wr = (e) => e.mechanism === "neon-cow" ? Hr(e.branchId, e.neonParentBranch === void 0 ? {} : { parentBranch: e.neonParentBranch }) : Rr(e.branchId, e.tableNames, e.seed, e.parentNamespace), Gr = (e, t) => e === "neon-cow" ? Ur(t) : zr(t), Kr = (e, t, n) => {
+	let r = e.filter((e) => e.state !== "destroyed" && e.state !== "destroying"), i = r.filter((e) => n - e.createdAtMs > t.ttlMs).map((e) => e.namespace), a = new Set(i);
+	return {
+		evict: i,
+		rejectNew: r.filter((e) => !a.has(e.namespace)).length >= t.maxBranches
+	};
+}, qr = async (e, t) => {
+	let n = Nr(e.appSlug, e.prNumber), r = Vr({
+		seed: e.seed,
+		...e.dbUrl === void 0 ? {} : { dbUrl: e.dbUrl },
+		...e.prefer === void 0 ? {} : { prefer: e.prefer }
+	}), i = Wr({
+		mechanism: r,
+		branchId: n,
+		tableNames: e.tableNames,
+		seed: e.seed,
+		...e.parentNamespace === void 0 ? {} : { parentNamespace: e.parentNamespace },
+		...e.neonParentBranch === void 0 ? {} : { neonParentBranch: e.neonParentBranch }
+	});
+	if (r === "neon-cow") return {
+		branchId: n,
+		mechanism: r,
+		steps: i,
+		connectionString: await t.neonBranchCreate(n, e.neonParentBranch ?? "main")
+	};
+	await t.createNamespace(n);
+	for (let r of e.tableNames) await t.createTable(n, r);
+	if (e.seed === "copy") {
+		if (e.parentNamespace === void 0 || e.parentNamespace === "") throw Error("provisionBranch: seed 'copy' requires parentNamespace");
+		for (let r of e.tableNames) await t.copyTable(e.parentNamespace, n, r);
+	}
+	return {
+		branchId: n,
+		mechanism: r,
+		steps: i
+	};
+}, Jr = async (e, t, n) => {
+	let r = Gr(t, e);
+	return t === "neon-cow" ? await n.neonBranchDelete(e) : await n.dropNamespace(e), r;
+}, Yr = (e, t, n) => Kr(e, t, n), X = (e) => `"${e.replace(/"/g, "\"\"")}"`, Xr = (e) => {
+	let t = () => {
+		throw Error("namespace branch executor: Neon ops require a neon-cow executor (use a Neon connection for copy-on-write branches)");
+	};
+	return {
+		createNamespace: (t) => e.run(`CREATE SCHEMA IF NOT EXISTS ${X(t)}`),
+		createTable: (t, n) => e.run(`CREATE TABLE IF NOT EXISTS ${X(t)}.${X(n)} (LIKE ${X(n)} INCLUDING ALL)`),
+		copyTable: (t, n, r) => e.run(`INSERT INTO ${X(n)}.${X(r)} SELECT * FROM ${X(t)}.${X(r)}`),
+		dropNamespace: (t) => e.run(`DROP SCHEMA IF EXISTS ${X(t)} CASCADE`),
+		neonBranchCreate: t,
+		neonBranchDelete: t
+	};
+}, Zr = class extends Error {
+	_tag = "TenantResidencyUnresolved";
+	constructor(e) {
+		super(e), this.name = "TenantResidencyUnresolved";
+	}
+}, Qr = class extends Error {
+	region;
+	_tag = "TenantRegionUnavailable";
+	constructor(e, t) {
+		super(t), this.region = e, this.name = "TenantRegionUnavailable";
+	}
+}, $r, ei = (e) => {
+	if (e.homes === void 0) throw Error("setResidencyConfig: `homes` is required");
+	if (e.servableRegions === void 0 || e.servableRegions.length === 0) throw Error("setResidencyConfig: `servableRegions` must be non-empty (which regions this deployment serves)");
+	let t = /* @__PURE__ */ new Map();
+	for (let n of e.homes) {
+		let e = t.get(n.tenantId);
+		if (e !== void 0 && e !== n.region) throw Error(`residency: tenant '${n.tenantId}' is mapped to two regions ('${e}' and '${n.region}')`);
+		t.set(n.tenantId, n.region);
+	}
+	return $r = e, e;
+}, ti = () => $r, ni = () => {
+	$r = void 0;
+}, ri = (e, t) => {
+	if (e == null || e === "") throw new Zr("residency is on but the request has no resolvable tenant — refusing to bind a store");
+	let n = t.homes.find((t) => t.tenantId === e);
+	if (n === void 0) throw new Zr(`no residency home is mapped for tenant '${e}' — refusing to fall back to a default store (would be a residency violation)`);
+	return n;
+}, ii = (e, t) => t.servableRegions.includes(e), ai = (e, t) => {
+	let n = ri(e.tenantId, t), r = Qt(n.tenantId);
+	return {
+		region: n.region,
+		namespace: r,
+		...n.connectionKey === void 0 ? {} : { connectionKey: n.connectionKey }
+	};
+}, oi = (e, t, n) => {
+	let r = ai(e, t);
+	if (!ii(r.region, t)) throw new Qr(r.region, `tenant homed in region '${r.region}', which this deployment does not serve — route to the home region`);
+	let i = n.get(r.region);
+	if (i === void 0) throw new Qr(r.region, `no store handle for home region '${r.region}' (declared servable but not wired) — failing closed`);
+	return {
+		store: i,
+		placement: r
+	};
+}, si = async (e, t, n, r) => {
+	let { store: i, placement: a } = oi(e, t, n);
+	return await r(i, a), a;
+}, Z = (e) => {
+	if (typeof e == "string") return e;
+	if ("jsonPath" in e) {
+		let { column: t, path: n, numeric: r } = e.jsonPath;
+		return `(json:${t}->${n.join(".")}${r ? "::num" : ""})`;
+	}
+	return `(${e.expr})`;
+}, Q = (e) => e.map(Z), ci = (e, t) => {
+	if (e.length !== t.length) return !1;
+	for (let n = 0; n < e.length; n++) if (Z(e[n]) !== Z(t[n])) return !1;
+	return !0;
+}, li = (e, t) => {
+	if (e.length >= t.length) return !1;
+	for (let n = 0; n < e.length; n++) if (Z(e[n]) !== Z(t[n])) return !1;
+	return !0;
+}, ui = (e) => {
+	let t = [], n = e.appliedIndexes, r = e.tableName;
+	for (let e = 0; e < n.length; e++) {
+		let i = n[e];
+		for (let a = e + 1; a < n.length; a++) {
+			let e = n[a];
+			if (ci(i.fields, e.fields)) {
+				let [n, a] = i.name < e.name ? [i, e] : [e, i];
+				t.push({
+					kind: "duplicate-fields",
+					table: r,
+					redundant: n,
+					coveredBy: a,
+					message: `'${r}' has two indexes on the same fields [${Q(i.fields).join(", ")}]: '${i.name}' and '${e.name}'. The B-tree engine builds both, costing write throughput + disk space for no read benefit. Drop '${n.name}' (or '${a.name}' if you prefer the other name). Applies to every supported dialect (Postgres / MySQL / MariaDB / MSSQL / SQLite).`
+				});
+				continue;
+			}
+			li(i.fields, e.fields) ? t.push({
+				kind: "redundant-prefix",
+				table: r,
+				redundant: i,
+				coveredBy: e,
+				message: `'${r}' index '${i.name}' on [${Q(i.fields).join(", ")}] is a leading prefix of '${e.name}' on [${Q(e.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Q(i.fields).join(", ")}] query from '${e.name}' too via the leading-prefix rule, so '${i.name}' adds write cost without read benefit. Drop '${i.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
+			}) : li(e.fields, i.fields) && t.push({
+				kind: "redundant-prefix",
+				table: r,
+				redundant: e,
+				coveredBy: i,
+				message: `'${r}' index '${e.name}' on [${Q(e.fields).join(", ")}] is a leading prefix of '${i.name}' on [${Q(i.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${Q(e.fields).join(", ")}] query from '${i.name}' too via the leading-prefix rule, so '${e.name}' adds write cost without read benefit. Drop '${e.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
+			});
+		}
+	}
+	return t;
+}, di = (e) => {
+	let t = [];
+	for (let n of e) t.push(...ui(n));
+	return t;
+}, fi = "\x1B[", pi = `${fi}38;2;245;158;11m`, mi = `${fi}38;2;16;185;129m`, hi = (e, t) => `${e}${t}${k.reset}`, $ = (e, t, n) => e ? typeof t == "function" ? t(n) : hi(t, n) : n, gi = (e, t = {}) => {
+	let n = t.color ?? !0, r = t.indent ?? "  ", i = (e) => $(n, k.dim, e.padEnd(11)), a = (e) => $(n, (e) => k.bold(k.brand(e)), e), o = (e) => $(n, k.brightRed24, e), s = (e) => $(n, mi, e), c = (e) => $(n, pi, e), l = (e) => $(n, k.dim, e), u = `${c("index audit")} ${l("·")} ${$(n, k.bold, e.kind)}`, d = e.redundant.fields.length, f = Q(e.coveredBy.fields.slice(d)), p = (e, t) => {
+		let n = e.slice(0, t), r = e.slice(t), i = [];
+		return n.length > 0 && i.push(s(`[${n.join(", ")}]`)), r.length > 0 && i.push(c(`+ [${r.join(", ")}]`)), i.join(" ");
+	}, m = [];
+	return m.push(u), m.push(""), m.push(`${i("table")}${a(e.table)}`), m.push(""), m.push(`${i("redundant")}${o(e.redundant.name)}`), m.push(`${i("")}${p(Q(e.redundant.fields), d)}`), m.push(""), m.push(`${i("covered by")}${s(e.coveredBy.name)}`), m.push(`${i("")}${p(Q(e.coveredBy.fields), d)}`), f.length > 0 && m.push(`${i("")}${l(`└ extra columns: ${f.join(", ")}`)}`), m.push(""), e.kind === "redundant-prefix" ? (m.push(`${i("why")}B-tree indexes serve queries that filter on a LEADING PREFIX of`), m.push(`${i("")}their column list. The wider index already covers every`), m.push(`${i("")}query the narrower one can serve.`), m.push(`${i("")}${l("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)) : (m.push(`${i("why")}Two indexes on the same columns under different names.`), m.push(`${i("")}The B-tree engine builds both — same coverage, double cost.`), m.push(`${i("")}${l("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)), m.push(""), m.push(`${i("cost")}Every ${a("INSERT")} / ${a("UPDATE")} / ${a("DELETE")} on this table writes`), m.push(`${i("")}to ${$(n, k.bold, "both")} B-trees. Pure write overhead, zero read benefit.`), m.push(""), m.push(`${i("fix")}Drop  ${o(e.redundant.name)}`), m.push(`${i("")}${l("Keep only if profiling shows the smaller index gives a")}`), m.push(`${i("")}${l("measurable cache-locality boost on a write-heavy hot path.")}`), m.push(`${i("")}${l("Silence with VOLTRO_INDEX_AUDIT=off if intentional.")}`), m.map((e) => `${r}${e}`).join("\n");
+}, _i = (e, t) => ({
+	name: e,
+	body: t
+}), vi = (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: _i });
+	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.watchedTables === void 0 ? {} : { watchedTables: e.watchedTables },
+		...e.fingerprint === void 0 ? {} : { fingerprint: e.fingerprint },
+		steps: t
+	};
+}, yi = (e) => typeof e == "object" && !!e && "__seed" in e && e.__seed === !0, bi = (e, { apply: t, undo: n }) => ({
+	name: e,
+	apply: t,
+	undo: n
+}), xi = (e) => {
+	if (!/^\d{14}_/.test(e.id)) throw Error(`migration "${e.id}": id must start with a 14-digit timestamp followed by "_" (convention: <YYYYMMDDHHMMSS>_<slug>)`);
+	let t = e.steps({ step: bi });
+	if (t.length === 0) throw Error(`migration "${e.id}": at least one step is required`);
+	return {
+		__migration: !0,
+		id: e.id,
+		name: e.name,
+		steps: t
+	};
+}, Si = (e) => typeof e == "object" && !!e && "__migration" in e && e.__migration === !0, Ci = n("_voltro_migrations", {
+	id: T({ prefix: "mig" }),
+	name: o(),
+	hash: o(),
+	status: o(),
+	appliedAt: v().nullable(),
+	durationMs: D().nullable(),
+	errorMessage: o().nullable(),
+	errorStack: o().nullable(),
+	workflowRunId: o().nullable(),
+	createdAt: v().default("now"),
+	updatedAt: v().default("now").onUpdate("now")
+}).index(["status"]).reactive(), wi = n("_voltro_seeds", {
+	id: T({ prefix: "seed" }),
+	name: o(),
+	lifecycle: o(),
+	fingerprint: o(),
+	cronSchedule: o().nullable(),
+	watchedTables: E().nullable(),
+	nextRunAt: v().nullable(),
+	lastRunStatus: o().nullable(),
+	lastRunAt: v().nullable(),
+	lastRunDurationMs: D().nullable(),
+	lastRunRowsTouched: D().nullable(),
+	lastError: o().nullable(),
+	workflowRunId: o().nullable(),
+	createdAt: v().default("now"),
+	updatedAt: v().default("now").onUpdate("now")
+}).index(["lifecycle"]).index(["nextRunAt"]).reactive(), Ti = n("_voltro_migration_plans", {
+	id: T({ prefix: "plan" }),
+	fingerprint: o(),
+	operations: E(),
+	rollbackPlan: E().nullable(),
+	appliedBy: o(),
+	environment: o(),
+	source: o(),
+	onlineStrategy: o().nullable(),
+	durationMs: D(),
+	notes: o().nullable(),
+	squashedAt: v().nullable(),
+	appliedAt: v().default("now"),
+	createdAt: v().default("now"),
+	updatedAt: v().default("now").onUpdate("now")
+}).index(["fingerprint"]).index(["environment"]).reactive(), Ei = n("_voltro_idempotency", {
+	id: T({ prefix: "idem" }),
+	scope: o(),
+	key: o(),
+	status: o(),
+	response: E().nullable(),
+	createdAt: v().default("now")
+}).unique(["scope", "key"]).index(["createdAt"]).reactive(), Di = n("_voltro_kv", {
+	id: T({ prefix: "kv" }),
+	key: o().unique(),
+	value: o().nullable(),
+	expiresAt: v().nullable(),
+	createdAt: v().default("now"),
+	updatedAt: v().default("now").onUpdate("now")
+}).index(["expiresAt"]).reactive(), Oi = n("_voltro_api_keys", {
+	id: T({ prefix: "apikey" }),
+	tenantId: o().nullable(),
+	name: o(),
+	hashedKey: o().unique(),
+	keyPrefix: o(),
+	scopes: E().nullable(),
+	lastUsedAt: v().nullable(),
+	expiresAt: v().nullable(),
+	revokedAt: v().nullable(),
+	createdBy: o().nullable(),
+	createdAt: v().default("now")
+}).index("byTenant", ["tenantId"]).reactive(), ki = [
+	Ci,
+	wi,
+	Ti
+], Ai = (e, t, n) => ({
+	_tag: "PrimaryKeyConflictError",
+	table: e,
+	key: t,
+	cause: n
+}), ji = (e) => typeof e == "object" && !!e && e._tag === "PrimaryKeyConflictError", Mi = /* @__PURE__ */ new Map(), Ni = (e) => {
+	if (!e.table || !e.timeColumn) throw Error("registerRetention: table + timeColumn are required");
+	if (!Number.isFinite(e.ttlMs) || e.ttlMs <= 0) throw Error(`registerRetention(${e.table}): ttlMs must be a positive number`);
+	Mi.set(e.table, e);
+}, Pi = () => [...Mi.values()], Fi = () => Mi.clear(), Ii = async (e, t, n, r = 2e4) => {
+	let i = new Date(t - e.ttlMs), a = 0;
+	for (;;) {
+		let t = await n(e.table, e.timeColumn, i, r, e.where);
+		if (a += t, t < r) break;
+	}
+	return a;
+}, Li = (e, t) => {
+	let n = Number(e ?? String(t));
+	return (Number.isFinite(n) && n > 0 ? n : t) * 36e5;
+}, Ri = "postgres";
+//#endregion
+export { Y as BranchNameInvalid, Ir as BranchTransitionInvalid, We as ColumnBuilder, lt as ENCRYPTED_PREFIX, Ri as ENGINE, Ge as FILE_MIGRATION_PATTERN, oe as MAX_IDENTIFIER_LENGTH, wr as TableStreamError, Jt as TenantNamespaceInvalid, qt as TenantNamespaceUnresolved, Qr as TenantRegionUnavailable, Zr as TenantResidencyUnresolved, ce as WARN_IDENTIFIER_LENGTH, Oi as _voltroApiKeysTable, Ei as _voltroIdempotencyTable, Di as _voltroKvTable, Ti as _voltroMigrationPlansTable, Ci as _voltroMigrationsTable, wi as _voltroSeedsTable, Yn as actorsTable, Yr as admitBranch, He as allEnumRenames, kt as allRegisteredRelations, De as allRegisteredTables, dr as and, ge as array, ar as arrayContains, sr as arrayHas, or as arrayOverlaps, zt as attachEagerLoads, di as auditAllTableIndexes, ui as auditTableIndexes, Ae as avg, qe as avgOver, je as bigint, oi as bindResidentStore, Je as boolean, Nr as branchNamespaceName, ve as bytes, Ee as clearEnumRenames, At as clearRelationsRegistry, ni as clearResidencyConfig, Fi as clearRetentions, g as clearTableRegistry, Sr as collectSubqueries, _e as column, dn as compileEagerJson, R as compilePredicate, $t as compileRawFragment, z as compileSelect, kr as computeEmbedding, ir as contains, be as count, Re as countDistinct, Me as databaseHandle, xe as date, ze as dbEnum, Ne as decimal, fe as declareEnumRename, It as decodeRowsFromSchema, pt as decryptFieldsOnRead, xi as defineMigration, d as defineMixin, vi as defineSeed, we as denseRank, u as deriveTypeIdPrefix, ct as deserializeArraysOnRead, b as drainIdentifierWarnings, Te as dropped, Rt as encodeRowForSchema, ft as encryptFieldsForWrite, dt as encryptedColumnsOf, Kr as enforceBranchLimits, _ as ensureTableRegistered, Xn as eq, L as escapeLike, xr as evaluatePredicate, Se as except, vr as exists, gi as formatIndexAuditIssue, ki as frameworkTables, m as generateId, p as generateSnowflake, Ce as geography, ue as geometry, Le as getEnumRenames, Ot as getRelation, M as getRelations, ti as getResidencyConfig, y as getTable, Qn as gt, $n as gte, Kt as hasEagerLoads, Or as hybridSearch, T as id, nr as inSet, gr as inSubquery, A as inferForeignKey, D as integer, le as intersect, me as interval, Pr as isBranchNamespace, ut as isEncrypted, Pe as isFileMigration, Si as isMigrationDefinition, Br as isNeonConnection, lr as isNotNull, cr as isNull, ji as isPrimaryKeyConflictError, ii as isRegionServable, bt as isRelationsSpec, yi as isSeedDefinition, h as isSqliteFamily, de as isView, E as json, mr as jsonField, et as jsonIndex, Ye as lag, $e as lead, Pi as listRetentions, er as lt, tr as lte, Xr as makeNamespaceBranchExecutor, St as many, Ct as manyToMany, S as materializeFields, pe as max, Ve as migration, Qe as min, re as mixin, Zn as neq, Lr as nextBranchState, pr as not, yr as notExists, rr as notInSet, _r as notInSubquery, i as numeric, xt as one, fr as or, te as paginateById, Wr as planBranch, Rr as planBranchProvision, zr as planBranchTeardown, Gr as planBranchTeardownFor, Hr as planNeonBranchProvision, Ur as planNeonBranchTeardown, Ai as primaryKeyConflictError, qr as provisionBranch, si as provisionResidentTenant, I as qualifyTable, r as queryFor, Ie as queryForView, x as quoteIdent, Xe as rank, Ze as raw, ne as real, c as reference, Gn as registerCoreTables, Dt as registerDiscoveredRelations, Et as registerRelations, Ni as registerRetention, l as registerTable, yt as relations, qn as requireActors, f as requireTable, Jn as requireTenants, se as resetSnowflake, ai as residentPlacement, Vr as resolveBranchMechanism, C as resolveFullTextIndex, Be as resolveIdScheme, ae as resolveMixinGraph, ri as resolveTenantHome, Qt as resolveTenantNamespace, Li as retentionTtlMsFromEnv, s as rowNumber, Zt as sanitizeIdentifierFragment, st as serializeArraysForWrite, ei as setResidencyConfig, ur as spatialPredicate, Dr as streamTable, a as sum, ee as sumOver, Ii as sweepRetention, n as table, Jr as teardownBranch, o as text, v as timestamp, Oe as union, t as unionAll, e as validateColumnName, ye as validateIndexName, Ke as validateTableName, Fe as validateTypeIdPrefix, ke as vector, ie as vectorDistanceToOpclass, Ar as vectorEmbedding, Ue as view, he as viewSql, Cr as walkLeaves };