@voltro/database 0.13.0 → 0.14.0

package/dist/{fileBased-DEW2BvnP.js → fileBased-Dfuv6JWP.js}

@@ -617,10 +617,10 @@ var r = (e) => {
 				...e.validatePatchSchema === void 0 ? {} : { validatePatchSchema: e.validatePatchSchema }
 			});
 		}),
-		reactive: (() => B({
+		nonReactive: (() => B({
 			tableName: e.tableName,
 			fields: e.fields,
-			isReactive: !0,
+			isReactive: !1,
 			appliedMixins: e.appliedMixins,
 			appliedIndexes: e.appliedIndexes,
 			appliedUniques: e.appliedUniques,
@@ -664,7 +664,7 @@ var r = (e) => {
 	return B({
 		tableName: e,
 		fields: n,
-		isReactive: !1,
+		isReactive: !0,
 		appliedMixins: [],
 		appliedIndexes: [],
 		appliedUniques: [],
@@ -693,38 +693,38 @@ var r = (e) => {
 	let t = W.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;
-}, q = () => [...W.values()], Le = () => {
+}, Le = () => [...W.values()], Re = () => {
 	W.clear();
-}, Re = (e) => ({
+}, ze = (e) => W.get(e)?.isReactive !== !1, Be = (e) => ({
 	op: "count",
 	alias: e ?? "count"
-}), ze = (e, t) => ({
+}), Ve = (e, t) => ({
 	op: "count-distinct",
 	column: e,
 	alias: t ?? `count_distinct_${e}`
-}), Be = (e, t) => ({
+}), He = (e, t) => ({
 	op: "sum",
 	column: e,
 	alias: t ?? `sum_${e}`
-}), Ve = (e, t) => ({
+}), Ue = (e, t) => ({
 	op: "avg",
 	column: e,
 	alias: t ?? `avg_${e}`
-}), He = (e, t) => ({
+}), We = (e, t) => ({
 	op: "min",
 	column: e,
 	alias: t ?? `min_${e}`
-}), Ue = (e, t) => ({
+}), Ge = (e, t) => ({
 	op: "max",
 	column: e,
 	alias: t ?? `max_${e}`
-}), We = (e, t) => ({
+}), Ke = (e, t) => ({
 	op: "column",
 	column: e,
 	alias: t ?? e
-}), J = (e) => (...t) => {
+}), q = (e) => (...t) => {
 	if (t.length < 2) throw Error(`${e}: requires at least two queries`);
-	return Z({
+	return X({
 		table: t[0].descriptor.table,
 		predicate: void 0,
 		order: [],
@@ -736,37 +736,37 @@ var r = (e) => {
 			queries: t.map((e) => e.descriptor)
 		}
 	});
-}, Ge = J("union"), Ke = J("union-all"), qe = J("intersect"), Je = J("except"), Y = (e) => ({ over: (t) => ({
+}, qe = q("union"), Je = q("union-all"), Ye = q("intersect"), Xe = q("except"), J = (e) => ({ over: (t) => ({
 	...e,
 	window: t
-}) }), Ye = (e = "rowNumber") => Y({
+}) }), Ze = (e = "rowNumber") => J({
 	op: "window-row-number",
 	alias: e
-}), Xe = (e = "rank") => Y({
+}), Qe = (e = "rank") => J({
 	op: "window-rank",
 	alias: e
-}), Ze = (e = "denseRank") => Y({
+}), $e = (e = "denseRank") => J({
 	op: "window-dense-rank",
 	alias: e
-}), Qe = (e, t = 1, n) => Y({
+}), et = (e, t = 1, n) => J({
 	op: "window-lag",
 	column: e,
 	alias: n ?? `lag_${e}`,
 	offset: t
-}), $e = (e, t = 1, n) => Y({
+}), tt = (e, t = 1, n) => J({
 	op: "window-lead",
 	column: e,
 	alias: n ?? `lead_${e}`,
 	offset: t
-}), et = (e, t) => Y({
+}), nt = (e, t) => J({
 	op: "window-sum-over",
 	column: e,
 	alias: t ?? `sum_${e}_over`
-}), tt = (e, t) => Y({
+}), rt = (e, t) => J({
 	op: "window-avg-over",
 	column: e,
 	alias: t ?? `avg_${e}_over`
-}), X = (e, t, n) => {
+}), Y = (e, t, n) => {
 	let r = n?.find((e) => e.name === t) ?? K(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 {
@@ -774,17 +774,17 @@ var r = (e) => {
 		...r.config === void 0 ? {} : { config: r.config },
 		...r.weights === void 0 ? {} : { weights: r.weights }
 	};
-}, Z = (e) => ({
+}, X = (e) => ({
 	descriptor: e,
 	where(t) {
 		let n = e.predicate ? { and: [e.predicate, t] } : t;
-		return Z({
+		return X({
 			...e,
 			predicate: n
 		});
 	},
 	orderBy(t, n = "asc") {
-		return Z({
+		return X({
 			...e,
 			order: [...e.order, {
 				column: t,
@@ -793,37 +793,37 @@ var r = (e) => {
 		});
 	},
 	limit(t) {
-		return Z({
+		return X({
 			...e,
 			take: t
 		});
 	},
 	offset(t) {
-		return Z({
+		return X({
 			...e,
 			skip: t
 		});
 	},
 	select(...t) {
-		return Z({
+		return X({
 			...e,
 			projection: t
 		});
 	},
 	using(t) {
-		return Z({
+		return X({
 			...e,
 			usingIndex: t
 		});
 	},
 	withDeleted() {
-		return Z({
+		return X({
 			...e,
 			includeDeleted: !0
 		});
 	},
 	unscoped() {
-		return Z({
+		return X({
 			...e,
 			crossTenant: !0
 		});
@@ -833,13 +833,13 @@ var r = (e) => {
 			...e.eager ?? {},
 			...t
 		};
-		return Z({
+		return X({
 			...e,
 			eager: n
 		});
 	},
 	count() {
-		return Z({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -853,15 +853,15 @@ var r = (e) => {
 			...t,
 			alias: e
 		}));
-		return Z({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: n
 		});
 	},
 	matching(t, n) {
-		let r = X(e.table, t, e.fullTextIndexes);
-		return Z({
+		let r = Y(e.table, t, e.fullTextIndexes);
+		return X({
 			...e,
 			fullTextSearch: {
 				indexName: t,
@@ -875,7 +875,7 @@ var r = (e) => {
 	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({
+		return X({
 			...e,
 			fullTextSearch: {
 				...n,
@@ -894,7 +894,7 @@ var r = (e) => {
 				distance: r?.distance ?? "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return Z({
+			return X({
 				...e,
 				annClause: i
 			});
@@ -906,7 +906,7 @@ var r = (e) => {
 				distance: "cosine",
 				...e.annClause?.ef === void 0 ? {} : { ef: e.annClause.ef }
 			};
-			return Z({
+			return X({
 				...e,
 				annClause: r,
 				take: n
@@ -919,7 +919,7 @@ var r = (e) => {
 			column: "",
 			distance: "cosine"
 		};
-		return Z({
+		return X({
 			...e,
 			annClause: {
 				...n,
@@ -928,22 +928,22 @@ var r = (e) => {
 		});
 	},
 	use(t) {
-		return Z({ ...t(e) });
+		return X({ ...t(e) });
 	},
 	distinct() {
-		return Z({
+		return X({
 			...e,
 			distinct: !0
 		});
 	},
 	distinctOn(t) {
-		return Z({
+		return X({
 			...e,
 			distinctOn: [...t]
 		});
 	},
 	as(t) {
-		return Z({
+		return X({
 			...e,
 			alias: t
 		});
@@ -955,7 +955,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return Z({
+		return X({
 			...e,
 			joins: a
 		});
@@ -967,7 +967,7 @@ var r = (e) => {
 			alias: n,
 			on: r
 		}];
-		return Z({
+		return X({
 			...e,
 			joins: a
 		});
@@ -977,7 +977,7 @@ var r = (e) => {
 			outputKey: e,
 			source: t
 		}));
-		return Z({
+		return X({
 			...e,
 			projection: void 0,
 			joinedProjection: n
@@ -986,7 +986,7 @@ var r = (e) => {
 	withCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.withCte: duplicate CTE name '${t}'`);
-		return Z({
+		return X({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -997,7 +997,7 @@ var r = (e) => {
 	recursiveCte(t, n) {
 		let r = e.ctes ?? [];
 		if (r.some((e) => e.name === t)) throw Error(`Query.recursiveCte: duplicate CTE name '${t}'`);
-		return Z({
+		return X({
 			...e,
 			ctes: [...r, {
 				name: t,
@@ -1008,20 +1008,20 @@ var r = (e) => {
 	},
 	groupBy(t) {
 		let n = e.groupBy ? [...e.groupBy, ...t] : [...t];
-		return Z({
+		return X({
 			...e,
 			groupBy: n
 		});
 	},
 	having(t) {
 		let n = e.having ? { and: [e.having, t] } : t;
-		return Z({
+		return X({
 			...e,
 			having: n
 		});
 	},
 	exists() {
-		return Z({
+		return X({
 			...e,
 			projection: void 0,
 			aggregations: [{
@@ -1032,8 +1032,8 @@ var r = (e) => {
 		});
 	}
 });
-function Q(e) {
-	return Z({
+function Z(e) {
+	return X({
 		table: e.tableName,
 		predicate: void 0,
 		order: [],
@@ -1044,7 +1044,7 @@ function Q(e) {
 		sourceTable: e
 	});
 }
-var nt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
+var Q = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 	let a = [...e.order.filter((e) => e.column !== t), {
 		column: t,
 		direction: i
@@ -1059,11 +1059,11 @@ var nt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 		order: a,
 		take: r
 	};
-}, rt = (e) => {
+}, it = (e) => {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) G(r), t[n] = Q(r);
+	for (let [n, r] of Object.entries(e)) G(r), t[n] = Z(r);
 	return t;
-}, it = (e) => e.isView === !0, at = (e, t, n) => {
+}, at = (e) => e.isView === !0, ot = (e, t, n) => {
 	if (v(e), n.trim().length === 0) throw Error(`view('${e}', …): the SELECT body is empty — a view must define a query.`);
 	let r = u(t);
 	for (let t of Object.keys(r)) y(e, t);
@@ -1073,7 +1073,7 @@ var nt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 		isView: !0,
 		viewSelect: n
 	};
-}, ot = (e) => Q({
+}, st = (e) => Z({
 	...e,
 	isReactive: !1,
 	appliedMixins: [],
@@ -1081,7 +1081,7 @@ var nt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 	appliedUniques: [],
 	appliedFullText: [],
 	appliedChecks: []
-}), st = (e, t, n = null) => {
+}), ct = (e, t, n = null) => {
 	let r = n === null ? V(e.tableName, t) : `${V(n, t)}.${V(e.tableName, t)}`, i = e.viewSelect.trim();
 	switch (t) {
 		case "postgres":
@@ -1091,16 +1091,16 @@ var nt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 		case "sqlite":
 		case "turso": return `DROP VIEW IF EXISTS ${r};\nCREATE VIEW ${r} AS ${i};`;
 	}
-}, ct = /^[A-Za-z_][A-Za-z0-9_]*$/, lt = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : ct.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), ut = (e) => "{" + e.map((e) => {
+}, lt = /^[A-Za-z_][A-Za-z0-9_]*$/, ut = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : lt.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), dt = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
-}).join(",") + "}", dt = (e, t, n, r = {}) => {
+}).join(",") + "}", ft = (e, t, n, r = {}) => {
 	let i = V(e, n), a = r.numeric ?? !1;
 	if (n === "postgres") {
-		let e = `(${i} #>> '${ut(t)}'::text[])`;
+		let e = `(${i} #>> '${dt(t)}'::text[])`;
 		return a ? `${e}::numeric` : e;
 	}
-	let o = lt(t);
+	let o = ut(t);
 	switch (n) {
 		case "mysql":
 		case "mariadb": {
@@ -1117,10 +1117,10 @@ var nt = (e, t, n) => $(e, "id", t, n), $ = (e, t, n, r, i = "asc") => {
 			return a ? `CAST(${e} AS REAL)` : e;
 		}
 	}
-}, ft = (e) => {
+}, pt = (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;
-}, pt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, mt = (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";
+}, mt = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, ht = (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 { m as $, Ge as A, s as At, Ae as B, nt as C, se as Ct, Ye as D, te as Dt, X as E, ge as Et, K as F, F as G, Ne as H, G as I, Ee as J, I as K, Ie as L, q as M, de as Mt, Le as N, Be as O, le as Ot, Fe as P, p as Q, Pe as R, $ as S, pe as St, Xe as T, ne as Tt, ke as U, Oe as V, De as W, M as X, P as Y, we as Z, qe as _, ue as _t, it as a, ye as at, Ue as b, o as bt, st as c, ve as ct, We as d, re as dt, be as et, Re as f, ae as ft, Je as g, c as gt, Ze as h, ie as ht, dt as i, x as it, Ke as j, oe as jt, et as k, r as kt, Ve as l, i as lt, rt as m, l as mt, mt as n, b as nt, ot as o, f as ot, ze as p, ce as pt, N as q, ft as r, v as rt, at as s, _e as st, pt as t, y as tt, tt as u, fe as ut, Qe as v, me as vt, Q as w, u as wt, He as x, ee as xt, $e as y, he as yt, V as z };
+export { p as $, qe as A, r as At, V as B, Q as C, pe as Ct, Ze as D, ge as Dt, Y as E, ne as Et, K as F, De as G, Oe as H, ze as I, N as J, F as K, G as L, Le as M, oe as Mt, Re as N, de as Nt, He as O, te as Ot, Fe as P, we as Q, Ie as R, $ as S, ee as St, Qe as T, u as Tt, Ne as U, Ae as V, ke as W, P as X, Ee as Y, M as Z, Ye as _, c as _t, at as a, x as at, Ge as b, he as bt, ct as c, _e as ct, Ke as d, fe as dt, m as et, Be as f, re as ft, Xe as g, ie as gt, $e as h, l as ht, ft as i, v as it, Je as j, s as jt, nt as k, le as kt, Ue as l, ve as lt, it as m, ce as mt, ht as n, y as nt, st as o, ye as ot, Ve as p, ae as pt, I as q, pt as r, b as rt, ot as s, f as st, mt as t, be as tt, rt as u, i as ut, et as v, ue as vt, Z as w, se as wt, We as x, o as xt, tt as y, me as yt, Pe as z };

package/dist/index.d.ts

@@ -11,7 +11,7 @@ import { VoidIfEmpty } from 'effect/Types';
 import { YieldableError } from 'effect/Cause';
 
 /** The framework's built-in `actors` core table. */
-export declare const actorsTable: Table<'actors', Record<string, ColumnDefinition<unknown>>, false, never>;
+export declare const actorsTable: Table<'actors', Record<string, ColumnDefinition<unknown>>, true, never>;
 
 /**
  * Admission decision for a NEW branch request: evict TTL-expired branches and
@@ -2603,6 +2603,23 @@ export declare const isSeedDefinition: (value: unknown) => value is SeedDefiniti
  */
 export declare const isSqliteFamily: (dialect: DialectId) => boolean;
 
+/**
+ * Does this table emit change events at all?
+ *
+ * `false` ONLY for a table that registered itself with `.nonReactive()`. An
+ * unregistered name answers `true`, and that default is deliberate: a store
+ * writing to a table the registry has never seen (a raw write, a framework
+ * bootstrap before registration, a test fixture) must keep behaving exactly as
+ * before. Silence is something an author opts into, never something a lookup
+ * miss produces.
+ *
+ * Consulted by EVERY dialect store at its emit choke point. It lives here, next
+ * to the registry that owns the answer, so the rule exists once — five copies
+ * of `isReactive !== false` in five stores is how the postgres and mariadb
+ * paths came to disagree about this flag in the first place.
+ */
+export declare const isTableReactive: (tableName: string) => boolean;
+
 /** Type guard: is this descriptor a read-only view (vs a base table)? */
 export declare const isView: (t: TableLike) => t is View<string, Record<string, ColumnDefinition<unknown>>>;
 
@@ -4720,7 +4737,7 @@ export declare const sumOver: (column: string, alias?: string) => WindowBuilder;
  */
 export declare const sweepRetention: (spec: RetentionSpec, now: number, deleteOlderThan: (table: string, timeColumn: string, cutoff: Date, batch: number, where?: Predicate) => Promise<number>, batch?: number) => Promise<number>;
 
-export declare interface Table<Name extends string, Fields extends Record<string, ColumnDefinition<unknown>>, Reactive extends boolean = false, IxNames extends string = never> extends TableLike {
+export declare interface Table<Name extends string, Fields extends Record<string, ColumnDefinition<unknown>>, Reactive extends boolean = true, IxNames extends string = never> extends TableLike {
     readonly tableName: Name;
     readonly fields: Fields;
     readonly isReactive: Reactive;
@@ -5032,14 +5049,42 @@ export declare interface Table<Name extends string, Fields extends Record<string
      */
     primaryKey: <const F extends readonly [keyof Fields & string, keyof Fields & string, ...Array<keyof Fields & string>]>(fields: F) => Table<Name, Fields, Reactive, IxNames>;
     /**
-     * Opt the table into the reactive engine. Applies
-     * `alter table <name> replica identity full` at migration time so the WAL
-     * stream carries full pre-images on UPDATE/DELETE. See the schema-DSL plan.
+     * Turn reactivity OFF for this table.
+     *
+     * Not "off across instances" — off. The table emits no change events at all:
+     * no local subscriber fires, no cross-instance transport carries it. That is
+     * what the name says, and a version of this that only silenced the
+     * cross-instance half would leave every in-process subscription live on a
+     * table declared non-reactive.
+     *
+     * Reactivity is the default because that is what this framework is for. The
+     * inverse (`.reactive()`) was the API for a long time and failed in both
+     * directions silently: written on mariadb it did nothing at all, omitted on
+     * postgres+cdc it meant a write on one instance never reached another
+     * instance's subscribers.
+     *
+     * Implemented in EVERY dialect, at the store's emit:
+     *
+     *   memory      the store's single emit point drops the event
+     *   sqlite /    same, and turso reuses that store
+     *   turso
+     *   postgres    also: no `REPLICA IDENTITY FULL`, no `pg_notify` trigger
+     *   mysql /     also: excluded from the binlog reader's table filter
+     *   mariadb
+     *   mssql       also: excluded from the Change Tracking table set
+     *
+     * The WRITE is unaffected — this is about notification, never persistence.
+     *
+     * Worth using for a genuinely hot table nobody subscribes to: an append-only
+     * event log, a metrics sink. On postgres it also drops `REPLICA IDENTITY
+     * FULL`, which widens every UPDATE/DELETE in the WAL. Do NOT use it on a
+     * table a query reads — that subscription simply never fires. `voltro dev`
+     * says so at boot.
      */
-    reactive: () => Table<Name, Fields, true, IxNames>;
+    nonReactive: () => Table<Name, Fields, false, IxNames>;
 }
 
-export declare const table: <const Name extends string, const Input extends FieldsInput>(name: Name, fields: Input) => Table<Name, FieldDefinitions<Input>, false, never>;
+export declare const table: <const Name extends string, const Input extends FieldsInput>(name: Name, fields: Input) => Table<Name, FieldDefinitions<Input>, true, never>;
 
 /**
  * A named table-level `CHECK` constraint, set by `.check(name, expr)`.