@voltro/runtime 0.84.0 → 0.86.0

package/dist/rawReadScope.js

@@ -0,0 +1,17 @@
+import { resolveReactiveConfig as e } from "./reactiveConfig.js";
+import { AsyncLocalStorage as t } from "node:async_hooks";
+//#region src/rawReadScope.ts
+var n = new t(), r = () => {
+	n.getStore() !== void 0 && n.enterWith({ observations: [] });
+}, i = (t) => {
+	let r = n.getStore();
+	r === void 0 && (r = { observations: [] }, n.enterWith(r)), r.membership !== void 0 && !a(t) && (r.membership = void 0, r.exposed = !0), !r.exposed && r.membership === void 0 && r.observations.length >= 128 && a(t) && (r.observations.every(a) ? r.membership = new Set(r.observations.map((e) => e.sql)) : r.exposed = !0), !(r.membership?.has(t.sql) ?? r.observations.some((e) => e.sql === t.sql)) && (r.observations.length >= e().rawReadTrackingLimit || (r.observations.push(t), r.membership?.add(t.sql)));
+}, a = (e) => {
+	let t = Object.getOwnPropertyDescriptor(e, "sql");
+	return Object.isFrozen(e) && t !== void 0 && "value" in t && typeof t.value == "string";
+}, o = () => {
+	let e = n.getStore();
+	return e === void 0 ? [] : (e.exposed = !0, e.membership = void 0, e.observations);
+}, s = (e) => n.run({ observations: [] }, e), c = (e) => e.join("?").replace(/\s+/g, " ").trim();
+//#endregion
+export { o as currentRawReads, r as isolateRawReadScope, c as rawSqlPreview, i as recordRawRead, s as runWithRawReadScope };

package/dist/reaction.js

@@ -0,0 +1,85 @@
+//#region src/reaction.ts
+var e = (e) => typeof e.query == "string", t = (t) => e(t.watch), n = /^(\d+(?:\.\d+)?)\s*(ms|milliseconds?|s|seconds?|m|minutes?|h|hours?|d|days?)$/i, r = (e, t, r) => {
+	if (typeof e == "number") {
+		if (!Number.isFinite(e) || e <= 0) throw Error(`reaction '${r}': ${t} must be a positive duration`);
+		return e;
+	}
+	let i = n.exec(e.trim());
+	if (i === null) throw Error(`reaction '${r}': ${t} ${JSON.stringify(e)} is not a duration like '5 minutes' or '30s'`);
+	let a = Number(i[1]), o = i[2].toLowerCase();
+	return a * (o.startsWith("ms") || o.startsWith("milli") ? 1 : o.startsWith("s") ? 1e3 : o.startsWith("m") ? 6e4 : o.startsWith("h") ? 36e5 : 864e5);
+}, i = 3e5, a = 3e4, o = 9e5;
+function s(t) {
+	if (typeof t.name != "string" || t.name.length === 0) throw Error("defineReaction: a non-empty `name` is required");
+	if (t.watch !== void 0 && e(t.watch)) return c(t);
+	if (t.watch === void 0 || typeof t.watch.table != "string" || t.watch.table.length === 0) throw Error(`reaction '${t.name}': watch.table is required`);
+	if (t.act === void 0 || t.act.kind !== "agent" && t.act.kind !== "workflow") throw Error(`reaction '${t.name}': act must be { kind: 'agent' | 'workflow', … }`);
+	let n = t;
+	if (n.guards === void 0 || typeof n.guards.dedupeKey != "function") throw Error(`reaction '${t.name}': guards.dedupeKey is REQUIRED — an ungated reaction whose act writes the watched table self-triggers into a spend storm.`);
+	if (n.guards.rateLimit !== void 0 && (n.guards.rateLimit.limit <= 0 || n.guards.rateLimit.windowMs <= 0)) throw Error(`reaction '${t.name}': guards.rateLimit needs positive limit + windowMs`);
+	if (n.guards.costBudgetUsd !== void 0 && n.guards.costBudgetUsd < 0) throw Error(`reaction '${t.name}': guards.costBudgetUsd must be >= 0`);
+	return t;
+}
+var c = (e) => {
+	let t = `reaction '${e.name}'`;
+	if (e.watch.query.trim() === "") throw Error(`${t}: watch.query names the live query to watch`);
+	if (e.watch.api !== void 0 && !/^[a-z][a-zA-Z0-9]*$/.test(e.watch.api)) throw Error(`${t}: watch.api ${JSON.stringify(e.watch.api)} is not a binding name from \`apis:\``);
+	if (e.act === void 0 || e.act.kind !== "workflow") throw Error(`${t}: a reaction to a query's rows acts through a WORKFLOW — its idempotencyKey is what makes the act exactly-once across every replica that sees the row. An agent act has no such identity.`);
+	if (typeof e.key != "function") throw Error(`${t}: \`key: (row) => string\` is required — the identity of a row in the set`);
+	if (e.guards?.dedupeKey !== void 0) throw Error(`${t}: \`guards.dedupeKey\` belongs to the table form. Watching a query, the row's \`key\` and the workflow's idempotencyKey replace it — drop dedupeKey.`);
+	if (e.resync !== void 0 && r(e.resync, "resync", e.name) < 3e4) throw Error(`${t}: resync must be at least 30 seconds — it re-reads the whole set`);
+	e.stuckAfter !== void 0 && r(e.stuckAfter, "stuckAfter", e.name);
+	let n = e.guards?.rateLimit;
+	if (n !== void 0 && (n.limit <= 0 || n.windowMs <= 0)) throw Error(`${t}: guards.rateLimit needs positive limit + windowMs`);
+	return e;
+}, l = (e, t) => e === void 0 ? !0 : Array.isArray(e) ? e.includes(t) : e === t, u = (e) => e.new?.tenantId ?? e.old?.tenantId ?? null, d = class {
+	hits = /* @__PURE__ */ new Map();
+	sweep;
+	allow(e, t, n, r) {
+		this.sweep ??= this.hits.entries();
+		for (let t = 0; t < 16; t++) {
+			let t = this.sweep.next();
+			if (t.done) {
+				this.sweep = void 0;
+				break;
+			}
+			let [n, i] = t.value;
+			n !== e && i.expiresAt <= r && this.hits.delete(n);
+		}
+		let i = r - n, a = this.hits.get(e) ?? {
+			times: [],
+			head: 0,
+			ordered: !0,
+			expiresAt: r + n
+		};
+		if (!a.ordered || Number.isNaN(i)) a.times = a.times.slice(a.head).filter((e) => e > i), a.head = 0, a.ordered = a.times.every((e, t) => t === 0 || e >= a.times[t - 1]);
+		else for (; a.head < a.times.length && !(a.times[a.head] > i);) a.head++;
+		if (a.head > 0 && (a.head >= 1024 || a.head * 2 >= a.times.length) && (a.times = a.times.slice(a.head), a.head = 0), a.expiresAt = Math.max(r + n, a.expiresAt), a.times.length - a.head >= t) return !1;
+		let o = a.times[a.times.length - 1];
+		return (Number.isNaN(r) || o !== void 0 && r < o) && (a.ordered = !1), a.times.push(r), this.hits.set(e, a), !0;
+	}
+}, f = (e, t, n, r) => JSON.stringify([
+	e,
+	t,
+	Math.floor(r / n)
+]), p = async (e, t, n) => {
+	if (t.table !== e.watch.table || !l(e.watch.on, t.op)) return "skipped-op";
+	if (e.when !== void 0 && !e.when(t)) return "skipped-when";
+	let r = `${e.name}:${e.guards.dedupeKey(t)}`;
+	if (!await n.dedupe.claim(r)) return "skipped-dedupe";
+	let i = e.guards.rateLimit;
+	if (i !== void 0) {
+		let r = n.now?.() ?? Date.now(), a = i.key === void 0 ? "" : i.key(t);
+		if (n.claimRate !== void 0) {
+			let t = new Date((Math.floor(r / i.windowMs) + 1) * i.windowMs);
+			if (!await n.claimRate(f(e.name, a, i.windowMs, r), i.limit, t)) return "skipped-ratelimit";
+		} else if (n.rateLimiter !== void 0 && !n.rateLimiter.allow(`${e.name} ${a}`, i.limit, i.windowMs, r)) return "skipped-ratelimit";
+	}
+	let a = u(t);
+	return e.guards.costBudgetUsd !== void 0 && n.checkBudget !== void 0 && !await n.checkBudget(a, e.guards.costBudgetUsd) ? "skipped-budget" : (await n.runAct(e.act, t, {
+		id: a,
+		via: "agent"
+	}), "acted");
+};
+//#endregion
+export { i as DEFAULT_LEVEL_RESYNC_MS, o as DEFAULT_LEVEL_STUCK_MS, a as MIN_LEVEL_RESYNC_MS, d as ReactionRateLimiter, s as defineReaction, t as isLevelReaction, e as isLevelWatch, r as reactionDurationMs, f as reactionRateBucketKey, p as runReaction };

package/dist/reactiveConfig.js

@@ -0,0 +1,11 @@
+//#region src/reactiveConfig.ts
+var e = 8, t = 32, n = (e) => {
+	if (e == null || e === "") return;
+	let t = Number(e);
+	return Number.isFinite(t) && t >= 1 ? Math.floor(t) : void 0;
+}, r = (e, t = process.env) => ({
+	deliveryConcurrency: n(t.VOLTRO_REACTIVE_DELIVERY_CONCURRENCY) ?? n(e?.deliveryConcurrency) ?? 8,
+	rawReadTrackingLimit: n(t.VOLTRO_RAW_READ_TRACKING_LIMIT) ?? n(e?.rawReadTrackingLimit) ?? 32
+});
+//#endregion
+export { e as DEFAULT_DELIVERY_CONCURRENCY, t as DEFAULT_RAW_READ_TRACKING_LIMIT, r as resolveReactiveConfig };

package/dist/readClassification.js

@@ -0,0 +1,57 @@
+import { getRelations as e } from "@voltro/database";
+//#region src/readClassification.ts
+var t = (e) => {
+	if (typeof e != "object" || !e) return;
+	let t = e.subquery;
+	return typeof t == "object" && t && typeof t.table == "string" ? t : void 0;
+}, n = (e, r) => {
+	if (typeof e != "object" || !e) return;
+	let i = t(e);
+	if (i !== void 0) {
+		r.add(i.table);
+		for (let e of i.joins ?? []) r.add(e.table);
+		n(i.predicate, r);
+	} else for (let t of Object.values(e)) if (Array.isArray(t)) for (let e of t) n(e, r);
+	else n(t, r);
+}, r = (t, n, a, o = 0) => {
+	if (o > 10 || typeof n != "object" || !n) return;
+	let s = e(t);
+	if (s !== void 0) for (let [e, t] of Object.entries(n)) {
+		let n = s[e];
+		if (n === void 0) continue;
+		let c = i(n.through);
+		c !== void 0 && a.add(c);
+		let l = i(n.target);
+		if (l === void 0) continue;
+		a.add(l);
+		let u = typeof t == "object" && t ? t.with : void 0;
+		u !== void 0 && r(l, u, a, o + 1);
+	}
+}, i = (e) => {
+	try {
+		let t = (typeof e == "function" ? e() : e)?.tableName;
+		return typeof t == "string" && t.length > 0 ? t : void 0;
+	} catch {
+		return;
+	}
+}, a = (e, t = !1) => {
+	let i = /* @__PURE__ */ new Set();
+	if (n(e.predicate, i), t) {
+		i.add(e.table);
+		for (let t of e.joins ?? []) i.add(t.table);
+		return r(e.table, e.eager, i), {
+			composed: /* @__PURE__ */ new Set(),
+			restricting: i
+		};
+	}
+	let a = /* @__PURE__ */ new Set([e.table]);
+	for (let t of e.joins ?? []) a.add(t.table);
+	r(e.table, e.eager, a);
+	for (let e of a) i.delete(e);
+	return {
+		composed: a,
+		restricting: i
+	};
+};
+//#endregion
+export { a as classifyRead };

package/dist/readRecorder.js

@@ -0,0 +1,66 @@
+import { classifyRead as e } from "./readClassification.js";
+import { Effect as t } from "effect";
+import { AsyncLocalStorage as n } from "node:async_hooks";
+//#region src/readRecorder.ts
+var r = new n(), i, a = /* @__PURE__ */ new Set(), o = (e) => {
+	i = e, a.clear();
+}, s = () => i !== void 0, c = (e, t) => {
+	if (i === void 0) return;
+	let n = new Set(t), o = a.has(e) || n.size === 0;
+	r.enterWith({
+		procedure: e,
+		declared: n,
+		composed: /* @__PURE__ */ new Set(),
+		restricting: /* @__PURE__ */ new Set(),
+		depth: { n: 0 },
+		...o ? { muted: !0 } : {}
+	});
+}, l = async (e, t, n = []) => {
+	let i = {
+		procedure: e,
+		declared: new Set(n),
+		composed: /* @__PURE__ */ new Set(),
+		restricting: /* @__PURE__ */ new Set(),
+		depth: { n: 0 }
+	};
+	return {
+		result: await r.run(i, t),
+		composed: i.composed,
+		restricting: i.restricting
+	};
+}, u = async (e) => {
+	let t = r.getStore();
+	if (t === void 0) return e();
+	t.depth.n += 1;
+	try {
+		return await e();
+	} finally {
+		--t.depth.n;
+	}
+}, d = (e) => t.suspend(() => {
+	let n = r.getStore();
+	return n === void 0 ? e : t.acquireUseRelease(t.sync(() => {
+		n.depth.n += 1;
+	}), () => e, () => t.sync(() => {
+		--n.depth.n;
+	}));
+}), f = (t) => {
+	let n = r.getStore();
+	if (n === void 0 || n.muted === !0) return;
+	let { composed: o, restricting: s } = e(t, n.depth.n > 0);
+	for (let e of o) n.composed.add(e);
+	for (let e of s) n.composed.has(e) || n.restricting.add(e);
+	if (i === void 0 || a.has(n.procedure)) return;
+	let c = m(n.procedure, n.composed, n.declared, n.restricting);
+	c !== void 0 && (a.add(n.procedure), i(c));
+}, p = (e) => new Proxy(e, { get(e, t) {
+	let n = Reflect.get(e, t, e);
+	return typeof n == "function" && t !== "query" ? n.bind(e) : t !== "query" || typeof n != "function" ? n : (t) => (f(t), n.call(e, t));
+} }), m = (e, t, n, r) => {
+	let i = [...t], a = 0;
+	for (let e of i) n.has(e) || (i[a++] = e);
+	if (i.length = a, i.sort(), i.length !== 0) return `${e}: read ${i.map((e) => `\`${e}\``).join(", ")} without declaring ${i.length === 1 ? "it" : "them"} in \`source:\`.\n  A write to ${i.length === 1 ? "that table" : "those tables"} will not re-run this query, so an open view keeps\n  showing what it showed before. The write itself is fine, which is why nothing else reports this.
+  Observed on this boot — a branch that did not run contributes nothing, so this names what WAS\n  read and never claims the declaration is otherwise complete.` + (r.size > 0 ? `\n  Not counted (read only to narrow the result): ${[...r].sort().map((e) => `\`${e}\``).join(", ")}.` : "");
+};
+//#endregion
+export { c as enterReadRecording, f as noteRead, s as readRecordingActive, l as recordReads, p as recordingStore, u as restrictingReads, d as restrictingReadsEffect, o as setSourceGapSink, m as sourceGapReport };

package/dist/rebac.js

@@ -0,0 +1,104 @@
+import { Schema as e } from "effect";
+//#region src/rebac.ts
+var t = "admin:full", n = class extends e.TaggedError()("AccessDenied", {
+	action: e.String,
+	resourceType: e.String,
+	resourceId: e.String
+}) {}, r = /* @__PURE__ */ new Map(), i = (e) => {
+	if (typeof e.resourceType != "string" || e.resourceType.length === 0) throw Error("defineResourcePolicy: a non-empty `resourceType` is required");
+	if (e.actions === void 0 || Object.keys(e.actions).length === 0) throw Error(`resource policy '${e.resourceType}': at least one action is required`);
+	if (r.has(e.resourceType)) throw Error(`resource policy '${e.resourceType}' is already registered — types must be unique`);
+	return r.set(e.resourceType, e), e;
+}, a = (e) => r.get(e), o = () => [...r.values()], s = () => r.clear(), c = () => o().map((e) => {
+	let t = /* @__PURE__ */ new Set();
+	for (let n of Object.values(e.actions)) for (let e of n) t.add(e);
+	for (let [n, r] of Object.entries(e.implies ?? {})) {
+		t.add(n);
+		for (let e of r) t.add(e);
+	}
+	return {
+		resourceType: e.resourceType,
+		actions: e.actions,
+		relations: [...t],
+		implies: e.implies ?? {}
+	};
+}), l = (e, t) => {
+	let n = new Set(e);
+	if (t === void 0) return n;
+	let r = [...e];
+	for (; r.length > 0;) {
+		let e = r.pop();
+		for (let i of t[e] ?? []) n.has(i) || (n.add(i), r.push(i));
+	}
+	return n;
+}, u = (e, t, n, r) => e.id === null ? /* @__PURE__ */ new Set() : l(n.filter((n) => n.subjectId === e.id && n.resourceType === t.type && n.resourceId === t.id).map((e) => e.relation), r.implies), d = (e, t, n, r) => {
+	if (e.scopes?.includes("admin:full")) return !0;
+	if (e.id === null || n.tenantId != null && e.tenantId !== n.tenantId) return !1;
+	let i = r.policy.actions[t];
+	if (i === void 0 || i.length === 0) return !1;
+	let a = u(e, n, r.tuples, r.policy);
+	return i.some((e) => a.has(e));
+}, f = (e, t, r, i) => {
+	if (!d(e, t, r, i)) throw new n({
+		action: t,
+		resourceType: r.type,
+		resourceId: r.id
+	});
+}, p = (e) => {
+	if (Object.getPrototypeOf(e) !== Array.prototype || e.some !== Array.prototype.some || e[Symbol.iterator] !== Array.prototype[Symbol.iterator]) return !1;
+	for (let t = 0; t < e.length; t++) {
+		let n = Object.getOwnPropertyDescriptor(e, t);
+		if (n === void 0 || !("value" in n) || typeof n.value != "string") return !1;
+	}
+	return !0;
+}, m = (e, t, n, r, i) => {
+	let a = Object.getOwnPropertyDescriptor(e, "policy");
+	if (n.length < 32 || a === void 0 || !("value" in a) || !p(r) || Object.getPrototypeOf(n) !== Array.prototype || n.every !== Array.prototype.every || n.filter !== Array.prototype.filter) return !1;
+	let o = Object.getOwnPropertyDescriptor(t, "tenantId");
+	if (o === void 0 ? "tenantId" in t : !("value" in o)) return !1;
+	let s = Object.getOwnPropertyDescriptor(e.policy, "implies");
+	if (s === void 0 || !("value" in s) || s.value === void 0) return !1;
+	let c = Object.getPrototypeOf(s.value);
+	if (c !== Object.prototype && c !== null) return !1;
+	let l = (e) => !Object.hasOwn(s.value, e) && e in s.value;
+	for (let e of Object.values(Object.getOwnPropertyDescriptors(s.value))) if (!("value" in e) || !Array.isArray(e.value) || !p(e.value) || e.value.some(l)) return !1;
+	for (let e of i.values()) if (e.some(l)) return !1;
+	return n.every((e) => {
+		let t = Object.getOwnPropertyDescriptor(e, "id"), n = Object.getOwnPropertyDescriptor(e, "tenantId");
+		return t !== void 0 && "value" in t && (n === void 0 ? !("tenantId" in e) : "value" in n);
+	});
+}, h = (e, t, n, r, i) => {
+	if (e.scopes?.includes("admin:full")) return r.filter(() => !0);
+	if (e.id === null || r.length === 0) return [];
+	let a = i.policy.actions[t];
+	if (a === void 0 || a.length === 0) return [];
+	if (r.length === 1) return r.filter((r) => d(e, t, {
+		type: n,
+		id: r.id,
+		...r.tenantId === void 0 ? {} : { tenantId: r.tenantId }
+	}, i));
+	let o = /* @__PURE__ */ new Map();
+	for (let t of i.tuples) {
+		if (t.subjectId !== e.id || t.resourceType !== n) continue;
+		let r = o.get(t.resourceId);
+		r === void 0 ? o.set(t.resourceId, [t.relation]) : r.push(t.relation);
+	}
+	let s = /* @__PURE__ */ new Map(), c = m(i, e, r, a, o) ? /* @__PURE__ */ new Map() : void 0;
+	return r.filter((t) => {
+		if (t.tenantId != null && e.tenantId !== t.tenantId) return !1;
+		let n = s.get(t.id);
+		if (n !== void 0) return n;
+		let r = o.get(t.id) ?? [], u = c === void 0 ? l(r, i.policy.implies) : void 0, d = c === void 0 ? a.some((e) => u.has(e)) : r.some((e) => {
+			let t = c.get(e);
+			if (t !== void 0) return t;
+			let n = l([e], i.policy.implies), r = a.some((e) => n.has(e));
+			return c.set(e, r), r;
+		});
+		return s.set(t.id, d), d;
+	});
+}, g = (e, t) => {
+	let n = new Set(t.map((e) => e.id));
+	return e.filter((e) => !n.has(e.id)).map((e) => e.id);
+};
+//#endregion
+export { n as AccessDenied, t as REBAC_ADMIN_SCOPE, f as assertCan, d as can, s as clearResourcePolicies, i as defineResourcePolicy, u as effectiveRelations, a as getResourcePolicy, o as listResourcePolicies, c as rebacPolicyGraph, g as revokedIds, h as visibleRows };

package/dist/rebacInterceptor.js

@@ -0,0 +1,81 @@
+import { AccessDenied as e, can as t, getResourcePolicy as n, visibleRows as r } from "./rebac.js";
+import { Effect as i } from "effect";
+import { and as a, eq as o, id as s, table as c, text as l, timestamp as u } from "@voltro/database";
+//#region src/rebacInterceptor.ts
+var d = c("_voltro_rebac_tuples", {
+	id: s({ prefix: "rbct" }),
+	subjectId: l(),
+	relation: l(),
+	resourceType: l(),
+	resourceId: l(),
+	tenantId: l().nullable(),
+	createdAt: u().default("now")
+}).index([
+	"subjectId",
+	"resourceType",
+	"resourceId"
+]), f = async (e, t, n, r) => t === null ? [] : (await e.query({
+	table: "_voltro_rebac_tuples",
+	predicate: a(o("subjectId", t), o("resourceType", n), o("resourceId", r)),
+	order: [],
+	take: void 0,
+	skip: void 0,
+	projection: void 0
+})).map((e) => ({
+	subjectId: e.subjectId,
+	relation: e.relation,
+	resourceType: e.resourceType,
+	resourceId: e.resourceId
+})), p = (e) => ({
+	id: e.id,
+	tenantId: e.tenantId,
+	...e.scopes === void 0 ? {} : { scopes: e.scopes }
+}), m = (r, a) => {
+	let o = a.getPolicy ?? n;
+	return (n, s) => {
+		let c = r[s.tag];
+		if (c === void 0) return n;
+		let l = o(c.resourceType), u = (t) => i.fail(new e({
+			action: c.action,
+			resourceType: c.resourceType,
+			resourceId: t
+		}));
+		if (l === void 0) return u("");
+		let d = c.resourceId(s.input);
+		if (d === null || d === "") return u("");
+		let f = p(s.subject), m = {
+			type: c.resourceType,
+			id: d,
+			tenantId: s.subject.tenantId
+		};
+		return i.flatMap(i.promise(async () => a.loadTuples(f.id, c.resourceType, d)), (e) => t(f, c.action, m, {
+			policy: l,
+			tuples: e
+		}) ? n : u(d));
+	};
+}, h = async (e, t, n) => t === null ? [] : (await e.query({
+	table: "_voltro_rebac_tuples",
+	predicate: a(o("subjectId", t), o("resourceType", n)),
+	order: [],
+	take: void 0,
+	skip: void 0,
+	projection: void 0
+})).map((e) => ({
+	subjectId: e.subjectId,
+	relation: e.relation,
+	resourceType: e.resourceType,
+	resourceId: e.resourceId
+})), g = (e) => {
+	let t = e.getPolicy ?? n;
+	return async (n, i, a, o) => {
+		let s = t(i);
+		if (s === void 0) return [];
+		let c = p(n), l = await e.loadSubjectTuples(c.id, i);
+		return r(c, a, i, o, {
+			policy: s,
+			tuples: l
+		});
+	};
+};
+//#endregion
+export { d as _voltroRebacTuplesTable, m as buildRebacInterceptor, g as buildRebacReadFilter, f as loadResourceTuples, h as loadSubjectTuples };

package/dist/registry.js

@@ -0,0 +1,29 @@
+import { Effect as e } from "effect";
+import { ValidationError as t, ValidationErrors as n, effectiveScopes as r, hasEffectiveScope as i, recheckGuardsEffect as a } from "@voltro/protocol";
+//#region src/registry.ts
+var o = (t) => ({
+	has: (e) => i(t, e),
+	hasAny: (e) => e.some((e) => i(t, e)),
+	require: (n) => e.suspend(() => a(t, [{ scope: n }], void 0).pipe(e.flatMap((t) => t === null ? e.void : t._tag === "ScopeError" ? e.fail(t) : e.die(t)))),
+	get scopes() {
+		return r(t);
+	}
+}), s = {
+	fail: (n, r, i) => e.fail(new t({
+		field: n,
+		message: r,
+		...i === void 0 ? {} : { params: i }
+	})),
+	failAll: (t) => t.length === 0 ? e.die(/* @__PURE__ */ Error("ctx.validation.failAll([]) — an empty issue list has nothing to route; fail the field(s) you checked.")) : e.fail(new n({ issues: t.map((e) => ({
+		field: e.field,
+		message: e.message,
+		...e.params === void 0 ? {} : { params: e.params }
+	})) })),
+	require: (n, r, i, a) => n ? e.void : e.fail(new t({
+		field: r,
+		message: i,
+		...a === void 0 ? {} : { params: a }
+	}))
+};
+//#endregion
+export { s as appValidation, o as makeAppAccess };

package/dist/relevantFields.js

@@ -0,0 +1,65 @@
+import { resolveDependentTables as e } from "./dependencyGraph.js";
+import { getRelations as t, getTable as n, isColumnReference as r } from "@voltro/database";
+//#region src/relevantFields.ts
+var i = (e) => e.alias !== void 0 || (e.joins?.length ?? 0) > 0 || e.setOp !== void 0 || e.ctes !== void 0 && e.ctes.length > 0 || e.aggregations !== void 0 && e.aggregations.some((e) => e.op.startsWith("window-")), a = /* @__PURE__ */ new Set(["*"]), o = (e, t) => {
+	if (e !== void 0) {
+		if ("not" in e) o(e.not, t);
+		else if ("and" in e) for (let n of e.and) o(n, t);
+		else if ("or" in e) for (let n of e.or) o(n, t);
+		else e.op === "subquery-in" || e.op === "subquery-not-in" ? t.add(e.column) : e.op !== "exists" && e.op !== "not-exists" && (t.add(e.column), "value" in e && r(e.value) && t.add(e.value.column));
+	}
+}, s = (e, t, n) => {
+	let r = e.get(t);
+	r === void 0 && (r = /* @__PURE__ */ new Set(), e.set(t, r));
+	for (let e of n) r.add(e);
+}, c = (e, n, r) => {
+	let i = t(e);
+	if (i !== void 0) for (let [t, a] of Object.entries(n)) {
+		let n = i[t];
+		if (n === void 0) continue;
+		let o = a === !0 ? {} : a;
+		if (n.kind === "manyToMany") {
+			let t = n.through(), i = n.target();
+			s(r, t.tableName, [n.sourceKey, n.targetKey]), s(r, e, ["id"]), s(r, i.tableName, ["id"]), l(i.tableName, o, r), o.with !== void 0 && c(i.tableName, o.with, r);
+			continue;
+		}
+		let u = n.target();
+		n.foreignKey !== void 0 && s(r, u.tableName, [n.foreignKey]), n.sourceKey === void 0 ? s(r, e, ["id"]) : s(r, e, [n.sourceKey]), s(r, u.tableName, ["id"]), l(u.tableName, o, r), o.with !== void 0 && c(u.tableName, o.with, r);
+	}
+}, l = (e, t, r) => {
+	if (t.where !== void 0) {
+		let n = /* @__PURE__ */ new Set();
+		o(t.where, n), s(r, e, n);
+	}
+	t.orderBy !== void 0 && s(r, e, t.orderBy.map((e) => e.column));
+	let i = n(e);
+	i === void 0 ? s(r, e, ["*"]) : s(r, e, Object.keys(i.fields));
+}, u = (t) => {
+	let n = /* @__PURE__ */ new Map();
+	for (let e of t.dependentTables ?? []) s(n, e, ["*"]);
+	if (i(t)) {
+		for (let r of e(t)) s(n, r, ["*"]);
+		return n;
+	}
+	let r = /* @__PURE__ */ new Set();
+	if (t.projection !== void 0) for (let e of t.projection) r.add(e);
+	else r.add("*");
+	o(t.predicate, r);
+	for (let e of t.order) r.add(e.column);
+	return s(n, t.table, r), t.eager !== void 0 && c(t.table, t.eager, n), n;
+}, d = (e) => {
+	if (e.op === "insert" || e.op === "delete" || e.old === null || e.new === null) return a;
+	let t = /* @__PURE__ */ new Set(), n = e.old, r = e.new, i = /* @__PURE__ */ new Set([...Object.keys(n), ...Object.keys(r)]);
+	for (let e of i) Object.is(n[e], r[e]) || t.add(e);
+	return t;
+}, f = (e, t) => {
+	let n = t.get(e.table);
+	if (n === void 0) return !1;
+	if (n.has("*")) return !0;
+	let r = d(e);
+	if (r.has("*")) return !0;
+	for (let e of r) if (n.has(e)) return !0;
+	return !1;
+};
+//#endregion
+export { a as ALL_COLUMNS, f as isEventRelevant, d as mutatedColumns, u as resolveRelevantFields };

package/dist/replicaHealth.js

@@ -0,0 +1,42 @@
+//#region src/replicaHealth.ts
+var e = (e = {}) => {
+	let t = e.thresholdFailures ?? 3, n = e.windowMs ?? 1e4, r = e.blackoutMs ?? 6e4, i = e.now ?? Date.now, a = /* @__PURE__ */ new Map(), o = (e) => {
+		let t = a.get(e);
+		return t === void 0 && (t = {
+			failures: [],
+			blackoutUntilMs: null
+		}, a.set(e, t)), t;
+	}, s = (e, t) => {
+		let r = t - n, i = 0;
+		for (; i < e.failures.length && e.failures[i] < r;) i++;
+		i > 0 && e.failures.splice(0, i);
+	};
+	return {
+		isHealthy(e) {
+			let t = a.get(e);
+			if (t === void 0) return !0;
+			let n = i();
+			return t.blackoutUntilMs !== null && t.blackoutUntilMs > n ? !1 : (t.blackoutUntilMs !== null && t.blackoutUntilMs <= n && (t.blackoutUntilMs = null, t.failures = []), !0);
+		},
+		reportFailure(e, n) {
+			let a = i(), c = o(e);
+			s(c, a), c.failures.push(a), c.failures.length >= t && (c.blackoutUntilMs = a + r);
+		},
+		reportSuccess(e) {
+			let t = a.get(e);
+			t !== void 0 && (t.failures = []);
+		},
+		snapshot() {
+			let e = Array(a.size), t = 0;
+			return a.forEach((n, r) => {
+				e[t++] = {
+					replica: r,
+					failureCount: n.failures.length,
+					blackoutUntilMs: n.blackoutUntilMs
+				};
+			}), e;
+		}
+	};
+};
+//#endregion
+export { e as replicaHealth };

package/dist/replicaLocality.js

@@ -0,0 +1,44 @@
+//#region src/replicaLocality.ts
+var e = (e) => {
+	let { currentRegion: t, replicaRegions: n, inner: r } = e, i = (e) => {
+		if (t === void 0) return {
+			sameRegion: [],
+			otherRegion: e
+		};
+		let r = [], i = [];
+		for (let a of e) n.get(a) === t ? r.push(a) : i.push(a);
+		return {
+			sameRegion: r,
+			otherRegion: i
+		};
+	};
+	return {
+		pick(e) {
+			let { sameRegion: t, otherRegion: n } = i(e);
+			return r.pick(t) ?? r.pick(n);
+		},
+		beforeQuery(e) {
+			r.beforeQuery(e);
+		},
+		afterQuery(e) {
+			r.afterQuery(e);
+		},
+		loadSnapshot() {
+			return r.loadSnapshot();
+		}
+	};
+}, t = (e = process.env) => {
+	for (let t of [
+		"VOLTRO_REGION",
+		"AWS_REGION",
+		"FLY_REGION",
+		"RAILWAY_REGION",
+		"GCP_REGION",
+		"CLOUD_RUN_REGION"
+	]) {
+		let n = e[t];
+		if (typeof n == "string" && n.length > 0) return n;
+	}
+};
+//#endregion
+export { e as localityAwareSelector, t as resolveCurrentRegion };