@voltro/database 0.1.0

package/dist/fileBased-cc9IzIjU.js

@@ -0,0 +1,1083 @@
+import { typeid as e } from "typeid-js";
+import { ulid as t } from "ulidx";
+import { Schema as n } from "effect";
+//#region src/columns.ts
+var r = 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
+		});
+	}
+	encrypted() {
+		return this.rejectIfRaw("encrypted"), new e({
+			...this.definition,
+			encrypted: !0
+		});
+	}
+	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;
+	}
+}, i = (e) => new r({
+	type: e,
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1
+}), a = (e) => new r({
+	type: "id",
+	nullable: !1,
+	unique: !0,
+	hasDefault: !1,
+	idSchemeInput: e
+}), o = () => i("text"), ee = () => i("integer"), te = () => i("real"), s = (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 r({
+		type: "decimal",
+		nullable: !1,
+		unique: !1,
+		hasDefault: !1,
+		precision: e,
+		scale: t
+	});
+}, ne = s, re = () => i("bigint"), ie = (e, t) => {
+	if (t.length === 0) throw Error(`dbEnum('${e}', []): enum must have at least one value`);
+	return {
+		name: e,
+		values: t,
+		column: () => new r({
+			type: "enum",
+			nullable: !1,
+			unique: !1,
+			hasDefault: !1,
+			enumName: e,
+			enumValues: t
+		})
+	};
+}, ae = () => i("boolean"), oe = () => i("timestamp"), se = () => i("date"), ce = () => i("json"), c = () => i("bytes"), l = (e, t) => new r({
+	type: "reference",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	references: e,
+	onDelete: t?.onDelete ?? "restrict",
+	refOnUpdate: t?.onUpdate ?? "noAction",
+	fkAutoIndex: t?.index ?? !0,
+	...t?.orphanPolicy ? { orphanPolicy: t.orphanPolicy } : {}
+}), u = () => new r({
+	type: "text",
+	nullable: !0,
+	unique: !1,
+	hasDefault: !1,
+	dropped: !0
+}), d = (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 r({
+		type: "vector",
+		nullable: !1,
+		unique: !1,
+		hasDefault: !1,
+		vectorDim: e,
+		vectorPrecision: t?.precision ?? "float32"
+	});
+}, le = (e) => new r({
+	type: "array",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	arrayElement: e.__definition().type
+}), ue = () => i("interval"), de = (e, t = 4326) => new r({
+	type: "text",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	spatial: {
+		kind: "geography",
+		geomKind: e,
+		srid: t
+	}
+}), fe = (e, t = 4326) => new r({
+	type: "text",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	spatial: {
+		kind: "geometry",
+		geomKind: e,
+		srid: t
+	}
+}), pe = (e) => new r({
+	type: "raw",
+	nullable: !1,
+	unique: !1,
+	hasDefault: !1,
+	rawDdl: e
+}), f = (e) => {
+	let t = {};
+	for (let [n, r] of Object.entries(e)) t[n] = r.__definition();
+	return t;
+}, p = /* @__PURE__ */ new Map(), me = (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 = p.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), p.set(e, n);
+}, he = (e) => p.get(e) ?? [], ge = () => p, _e = () => {
+	p.clear();
+}, ve = 63, ye = 60, m = [], h = (e) => {
+	m.includes(e) || m.push(e);
+}, be = () => {
+	let e = m.slice();
+	return m.length = 0, e;
+}, xe = /^[a-zA-Z_][a-zA-Z0-9_]*$/, g = (e, t) => {
+	if (t.length === 0) throw Error(`${e} cannot be empty.`);
+	if (!xe.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_]*$/.`);
+}, _ = (e) => {
+	if (g("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 && h(`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.`);
+}, v = (e, t) => {
+	if (g("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 && h(`column '${t}' on table '${e}' is ${t.length} chars — close to the 63-byte limit.`);
+}, y = (e, t, n, r) => {
+	if (g("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 && h(`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.` : ""}`);
+}, b = (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 && h(`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).`);
+}, Se = 1704067200000n, x = 10n, S = 12n, C = (1n << x) - 1n, w = (1n << S) - 1n, T = S, E = 22n, D = () => {
+	let e = process.env.SNOWFLAKE_MACHINE_ID;
+	if (e === void 0 || e === "") return 0n;
+	let t = BigInt(e);
+	if (t < 0n || t > C) throw Error(`SNOWFLAKE_MACHINE_ID out of range: ${e}. Must be 0..${C}.`);
+	return t;
+}, O = () => ({
+	lastMs: 0n,
+	sequence: 0n,
+	machineId: D()
+}), k, A = () => (k === void 0 && (k = O()), k), j = () => {
+	k = O();
+}, M = () => BigInt(Date.now()), Ce = (e) => {
+	let t = M();
+	for (; t <= e;) t = M();
+	return t;
+}, N = () => {
+	let e = A(), t = M();
+	t === e.lastMs ? (e.sequence = e.sequence + 1n & w, e.sequence === 0n && (t = Ce(e.lastMs), e.lastMs = t)) : (e.sequence = 0n, e.lastMs = t);
+	let n = t - Se;
+	if (n < 0n) throw Error("Snowflake timestamp before configured epoch (2024-01-01). System clock is wrong.");
+	return (n << E | e.machineId << T | e.sequence).toString();
+}, P = (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 b(n, {
+		kind: "derived",
+		tableName: e
+	}), n;
+}, F = (e, t) => {
+	if (e === void 0) return {
+		kind: "typeid",
+		prefix: P(t)
+	};
+	if ("prefix" in e && !("scheme" in e)) return b(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 ?? P(t);
+			return e.prefix !== void 0 && b(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
+		};
+	}
+}, we = (n, r) => {
+	switch (n.kind) {
+		case "typeid": return e(n.prefix).toString();
+		case "ulid": return t();
+		case "numeric": return null;
+		case "snowflake": return N();
+		case "custom": return n.generate(r);
+	}
+}, I = (e) => ({
+	fields: f(e.fields),
+	...e.id === void 0 ? {} : { id: e.id },
+	...e.requires === void 0 ? {} : { requires: e.requires },
+	...e.indexes === void 0 ? {} : { indexes: e.indexes },
+	...e.behaviors === void 0 ? {} : { behaviors: e.behaviors },
+	...e.policies === void 0 ? {} : { policies: e.policies }
+}), Te = I, L = (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;
+}, Ee = (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);
+}, De = (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`;
+	}
+}, R = (e) => e.id ?? `<anonymous mixin: ${Object.keys(e.fields).join(", ")}>`, z = (e, t) => `${e}_${t.join("_")}_idx`, Oe = (e, t) => `${e}_${t.join("_")}_uq`, B = (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.`);
+}, ke = (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: F(i.idSchemeInput, t)
+	});
+	return n ?? e;
+}, V = (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,
+		appliedPrimaryKey: t,
+		...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 (y(e.tableName, t, !1, n), e.appliedFullText.some((e) => e.name === t)) throw Error(`duplicate full-text index '${t}' on table '${e.tableName}'.`);
+			return V({
+				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 = L(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}': '${R(o)}' and '${R(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.`);
+				v(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 ?? z(e.tableName, n.fields);
+				a.some((e) => e.name === t) || (y(e.tableName, t, n.name === void 0, n.fields), B(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 V({
+				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 = z(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 (y(e.tableName, n, a, o), B(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 V({
+				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 (y(e.tableName, t, !1, i), B(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 V({
+				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 = Oe(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 (y(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 V({
+				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 }
+			});
+		}),
+		check: ((t, n) => {
+			if (n.trim().length === 0) throw Error(`CHECK '${t}' on table '${e.tableName}' has an empty expression.`);
+			if (y(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 V({
+				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 }
+			});
+		}),
+		primaryKey: ((n) => {
+			if (n.length < 2) throw Error(`primaryKey([...]) on table '${e.tableName}' needs at least two columns — a single-column key is the default \`id()\` primary key.`);
+			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}'. A composite primary key IS the key — drop the id() column, or include '${t}' in the composite key.`);
+			return V({
+				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 }
+			});
+		}),
+		reactive: (() => V({
+			tableName: e.tableName,
+			fields: e.fields,
+			isReactive: !0,
+			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) => V({
+			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) => V({
+			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: n.partial(t)
+		}))
+	};
+}, Ae = (e, t) => {
+	_(e);
+	let n = ke(f(t), e);
+	for (let t of Object.keys(n)) v(e, t);
+	return V({
+		tableName: e,
+		fields: n,
+		isReactive: !1,
+		appliedMixins: [],
+		appliedIndexes: [],
+		appliedUniques: [],
+		appliedFullText: [],
+		appliedChecks: []
+	});
+}, je = (e) => e === "sqlite" || e === "turso", H = (e, t) => {
+	switch (t) {
+		case "mysql":
+		case "mariadb": return `\`${e}\``;
+		case "mssql": return `[${e}]`;
+		case "postgres":
+		case "sqlite":
+		case "turso": return `"${e}"`;
+	}
+}, U = Symbol.for("@voltro/database/tableRegistry"), W = globalThis, G = W[U] ?? (W[U] = /* @__PURE__ */ new Map()), K = (e) => {
+	let t = G.get(e.tableName);
+	if (t === void 0) {
+		G.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.`);
+}, Me = (e) => {
+	G.get(e.tableName) === void 0 && G.set(e.tableName, e);
+}, q = (e) => G.get(e), Ne = (e) => {
+	let t = G.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;
+}, Pe = () => [...G.values()], Fe = () => {
+	G.clear();
+}, Ie = (e) => ({
+	op: "count",
+	alias: e ?? "count"
+}), Le = (e, t) => ({
+	op: "count-distinct",
+	column: e,
+	alias: t ?? `count_distinct_${e}`
+}), Re = (e, t) => ({
+	op: "sum",
+	column: e,
+	alias: t ?? `sum_${e}`
+}), ze = (e, t) => ({
+	op: "avg",
+	column: e,
+	alias: t ?? `avg_${e}`
+}), Be = (e, t) => ({
+	op: "min",
+	column: e,
+	alias: t ?? `min_${e}`
+}), Ve = (e, t) => ({
+	op: "max",
+	column: e,
+	alias: t ?? `max_${e}`
+}), He = (e, t) => ({
+	op: "column",
+	column: e,
+	alias: t ?? e
+}), J = (e) => (...t) => {
+	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
+	return Z({
+		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)
+		}
+	});
+}, Ue = J("union"), We = J("union-all"), Ge = J("intersect"), Ke = J("except"), Y = (e) => ({ over: (t) => ({
+	...e,
+	window: t
+}) }), qe = (e = "rowNumber") => Y({
+	op: "window-row-number",
+	alias: e
+}), Je = (e = "rank") => Y({
+	op: "window-rank",
+	alias: e
+}), Ye = (e = "denseRank") => Y({
+	op: "window-dense-rank",
+	alias: e
+}), Xe = (e, t = 1, n) => Y({
+	op: "window-lag",
+	column: e,
+	alias: n ?? `lag_${e}`,
+	offset: t
+}), Ze = (e, t = 1, n) => Y({
+	op: "window-lead",
+	column: e,
+	alias: n ?? `lead_${e}`,
+	offset: t
+}), Qe = (e, t) => Y({
+	op: "window-sum-over",
+	column: e,
+	alias: t ?? `sum_${e}_over`
+}), $e = (e, t) => Y({
+	op: "window-avg-over",
+	column: e,
+	alias: t ?? `avg_${e}_over`
+}), X = (e, t, n) => {
+	let r = n?.find((e) => e.name === t) ?? q(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 }
+	};
+}, Z = (e) => ({
+	descriptor: e,
+	where(t) {
+		let n = e.predicate ? { and: [e.predicate, t] } : t;
+		return Z({
+			...e,
+			predicate: n
+		});
+	},
+	orderBy(t, n = "asc") {
+		return Z({
+			...e,
+			order: [...e.order, {
+				column: t,
+				direction: n
+			}]
+		});
+	},
+	limit(t) {
+		return Z({
+			...e,
+			take: t
+		});
+	},
+	offset(t) {
+		return Z({
+			...e,
+			skip: t
+		});
+	},
+	select(...t) {
+		return Z({
+			...e,
+			projection: t
+		});
+	},
+	using(t) {
+		return Z({
+			...e,
+			usingIndex: t
+		});
+	},
+	withDeleted() {
+		return Z({
+			...e,
+			includeDeleted: !0
+		});
+	},
+	unscoped() {
+		return Z({
+			...e,
+			crossTenant: !0
+		});
+	},
+	with(t) {
+		let n = {
+			...e.eager ?? {},
+			...t
+		};
+		return Z({
+			...e,
+			eager: n
+		});
+	},
+	count() {
+		return Z({
+			...e,
+			projection: void 0,
+			aggregations: [{
+				op: "count",
+				alias: "count"
+			}]
+		});
+	},
+	aggregate(t) {
+		let n = Object.entries(t).map(([e, t]) => ({
+			...t,
+			alias: e
+		}));
+		return Z({
+			...e,
+			projection: void 0,
+			aggregations: n
+		});
+	},
+	matching(t, n) {
+		let r = X(e.table, t, e.fullTextIndexes);
+		return Z({
+			...e,
+			fullTextSearch: {
+				indexName: t,
+				query: n,
+				columns: r.columns,
+				...r.config === void 0 ? {} : { config: r.config },
+				...r.weights === void 0 ? {} : { weights: r.weights }
+			}
+		});
+	},
+	rankBy(t) {
+		let n = e.fullTextSearch;
+		if (n === void 0) throw Error(".rankBy() requires a preceding .matching(...) clause — there is no full-text search to rank on this query.");
+		return Z({
+			...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 Z({
+				...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 Z({
+				...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 Z({
+			...e,
+			annClause: {
+				...n,
+				ef: t
+			}
+		});
+	},
+	use(t) {
+		return Z({ ...t(e) });
+	},
+	distinct() {
+		return Z({
+			...e,
+			distinct: !0
+		});
+	},
+	distinctOn(t) {
+		return Z({
+			...e,
+			distinctOn: [...t]
+		});
+	},
+	as(t) {
+		return Z({
+			...e,
+			alias: t
+		});
+	},
+	innerJoin(t, n, r) {
+		let i = typeof t == "string" ? t : t.tableName, a = [...e.joins ?? [], {
+			kind: "inner",
+			table: i,
+			alias: n,
+			on: r
+		}];
+		return Z({
+			...e,
+			joins: a
+		});
+	},
+	leftJoin(t, n, r) {
+		let i = typeof t == "string" ? t : t.tableName, a = [...e.joins ?? [], {
+			kind: "left",
+			table: i,
+			alias: n,
+			on: r
+		}];
+		return Z({
+			...e,
+			joins: a
+		});
+	},
+	selectJoined(t) {
+		let n = Object.entries(t).map(([e, t]) => ({
+			outputKey: e,
+			source: t
+		}));
+		return Z({
+			...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 Z({
+			...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 Z({
+			...e,
+			ctes: [...r, {
+				name: t,
+				descriptor: n,
+				recursive: !0
+			}]
+		});
+	},
+	groupBy(t) {
+		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
+		return Z({
+			...e,
+			groupBy: n
+		});
+	},
+	having(t) {
+		let n = e.having ? { and: [e.having, t] } : t;
+		return Z({
+			...e,
+			having: n
+		});
+	},
+	exists() {
+		return Z({
+			...e,
+			projection: void 0,
+			aggregations: [{
+				op: "count",
+				alias: "__exists__"
+			}],
+			take: 1
+		});
+	}
+});
+function Q(e) {
+	return Z({
+		table: e.tableName,
+		predicate: void 0,
+		order: [],
+		take: void 0,
+		skip: void 0,
+		projection: void 0,
+		fullTextIndexes: e.appliedFullText,
+		sourceTable: e
+	});
+}
+var et = (e, t, n) => {
+	let r = [...e.order.filter((e) => e.column !== "id"), {
+		column: "id",
+		direction: "asc"
+	}], i = t === void 0 ? void 0 : {
+		column: "id",
+		op: "gt",
+		value: t
+	}, a = i === void 0 ? e.predicate : e.predicate === void 0 ? i : { and: [e.predicate, i] };
+	return {
+		...e,
+		predicate: a,
+		order: r,
+		take: n
+	};
+}, tt = (e) => {
+	let t = {};
+	for (let [n, r] of Object.entries(e)) K(r), t[n] = Q(r);
+	return t;
+}, nt = (e) => e.isView === !0, rt = (e, t, n) => {
+	if (_(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
+	let r = f(t);
+	for (let t of Object.keys(r)) v(e, t);
+	return {
+		tableName: e,
+		fields: r,
+		isView: !0,
+		viewSelect: n
+	};
+}, it = (e) => Q({
+	...e,
+	isReactive: !1,
+	appliedMixins: [],
+	appliedIndexes: [],
+	appliedUniques: [],
+	appliedFullText: [],
+	appliedChecks: []
+}), $ = (e, t, n = null) => {
+	let r = n === null ? H(e.tableName, t) : `${H(n, t)}.${H(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};`;
+	}
+}, at = /^[A-Za-z_][A-Za-z0-9_]*$/, ot = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : at.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), st = (e) => "{" + e.map((e) => {
+	let t = String(e);
+	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
+}).join(",") + "}", ct = (e, t, n, r = {}) => {
+	let i = H(e, n), a = r.numeric ?? !1;
+	if (n === "postgres") {
+		let e = `(${i} #>> '${st(t)}'::text[])`;
+		return a ? `${e}::numeric` : e;
+	}
+	let o = ot(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;
+		}
+	}
+}, lt = (e) => {
+	if (!e.id || e.id.length === 0) throw Error("migration: `id` is required + must be non-empty");
+	if (!e.up || !e.down) throw Error(`migration ${e.id}: both \`up\` and \`down\` must be functions`);
+	return e;
+}, ut = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, dt = (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";
+//#endregion
+export { v as $, We as A, Ae as B, Q as C, ne as Ct, Re as D, o as Dt, qe as E, l as Et, K as F, P as G, Te as H, Ne as I, N as J, we as K, je as L, Fe as M, Me as N, Qe as O, oe as Ot, q as P, be as Q, H as R, et as S, f as St, X as T, te as Tt, I as U, De as V, L as W, ve as X, j as Y, ye as Z, Ge as _, fe as _t, nt as a, me as at, Ve as b, ue as bt, $ as c, le as ct, He as d, c as dt, y as et, Ie as f, se as ft, Ke as g, de as gt, Ye as h, u as ht, ct as i, _e as it, Pe as j, Ue as k, d as kt, ze as l, re as lt, tt as m, s as mt, dt as n, b as nt, it as o, he as ot, Le as p, ie as pt, F as q, lt as r, ge as rt, rt as s, r as st, ut as t, _ as tt, $e as u, ae as ut, Xe as v, a as vt, Je as w, pe as wt, Be as x, ce as xt, Ze as y, ee as yt, Ee as z };