@voltro/cache 0.86.0 → 0.88.0

package/dist/Cache.js

@@ -1,26 +1,50 @@
 import { CacheStore as e } from "./CacheStore.js";
 import { Clock as t, Context as n, Deferred as r, Effect as i, HashMap as a, Layer as o, Metric as s, Option as c, SynchronizedRef as l } from "effect";
-//#region src/Cache.ts
-var u = (e) => typeof e == "object" && !!e && e._voltroSwr === 1, d = class d extends n.Service()("@voltro/Cache", { make: i.gen(function* () {
-	let n = yield* e, o = yield* l.make(a.empty()), d = s.counter("voltro_cache_hits"), f = s.counter("voltro_cache_misses"), p = (e, r, a) => {
-		let o = a.tags === void 0 ? {} : { tags: a.tags }, s = a.swrMs;
-		if (s !== void 0) {
-			let c = a.ttlMs ?? 0;
+import { CACHE_FENCE_RETENTION_MS as u } from "@voltro/kv/connection";
+// src/Cache.ts
+var d = () => ({
+	hits: 0,
+	stale: 0,
+	misses: 0,
+	stored: 0,
+	voided: 0,
+	decodeMisses: 0,
+	uncacheable: 0,
+	oversized: 0
+}), f = (e) => typeof e == "object" && !!e && e._voltroSwr === 1, p = class p extends n.Service()("@voltro/Cache", { make: i.gen(function* () {
+	let n = yield* e, o = yield* l.make(a.empty()), p = s.counter("voltro_cache_hits"), m = s.counter("voltro_cache_misses"), h = s.counter("voltro_cache_voided_stores", { description: "Computed values not stored because an invalidation of one of their tags overtook the compute." }), g = s.counter("voltro_query_cache_events_total", { description: "Cached-query outcomes by query name and event (hit, stale, miss, stored, voided, decodeMiss, uncacheable, oversized)." }), _ = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), y = (e, t) => i.suspend(() => {
+		let n = v.get(e);
+		n === void 0 && (n = d(), v.set(e, n)), n[t] += 1;
+		let r = `${e}\u0000${t}`, i = _.get(r);
+		return i === void 0 && (i = s.withAttributes(g, {
+			query: e,
+			event: t
+		}), _.set(r, i)), s.update(i, 1);
+	}), b = (e, r, a, o) => {
+		let s = {
+			...a.tags === void 0 ? {} : { tags: a.tags },
+			...o === void 0 ? {} : { fence: o }
+		}, c = a.swrMs;
+		if (c !== void 0) {
+			let o = a.ttlMs ?? 0;
 			return t.currentTimeMillis.pipe(i.flatMap((t) => n.setWithTags(e, {
 				_voltroSwr: 1,
 				v: r,
-				freshUntil: t + c
+				freshUntil: t + o
 			}, {
-				ttlMs: c + s,
-				...o
+				ttlMs: o + c,
+				...s
 			})));
 		}
-		let c = a.ttlMs === void 0 ? {} : { ttlMs: a.ttlMs };
+		let l = a.ttlMs === void 0 ? {} : { ttlMs: a.ttlMs };
 		return n.setWithTags(e, r, {
-			...c,
-			...o
+			...l,
+			...s
 		});
-	}, m = (e, t, n) => n.pipe(i.tap((n) => p(e, n, t))), h = (e, t) => l.modifyEffect(o, (t) => {
+	}, x = (e, r, a) => i.gen(function* () {
+		let i = yield* n.fence(), o = yield* t.currentTimeMillis, c = yield* a;
+		return (yield* t.currentTimeMillis) - o < u && (yield* b(e, c, r, i)) || (yield* s.update(h, 1)), c;
+	}), S = (e, t) => l.modifyEffect(o, (t) => {
 		let n = a.get(t, e);
 		return c.isSome(n) ? i.succeed([{
 			kind: "await",
@@ -33,27 +57,107 @@ var u = (e) => typeof e == "object" && !!e && e._voltroSwr === 1, d = class d ex
 		if (n.kind === "await") return r.await(n.deferred);
 		let s = n.deferred;
 		return t.pipe(i.onExit((t) => r.done(s, t).pipe(i.andThen(l.update(o, (t) => a.remove(t, e))))));
-	})), g = (e, r, a) => n.get(e).pipe(i.flatMap((n) => {
+	})), C = (e, r, a) => n.get(e).pipe(i.catchTag("CacheError", () => i.succeed(c.none())), i.flatMap((e) => {
+		if (c.isNone(e)) return i.succeed(c.none());
+		let n = e.value, o = f(n) ? n : void 0;
+		return a(o === void 0 ? n : o.v).pipe(i.flatMap((e) => c.isNone(e) ? y(r.label, "decodeMisses").pipe(i.as(c.none())) : o === void 0 ? i.succeed(c.some({
+			value: e.value,
+			fresh: !0
+		})) : t.currentTimeMillis.pipe(i.map((t) => c.some({
+			value: e.value,
+			fresh: t < o.freshUntil
+		})))));
+	})), w = (e, r, a) => i.gen(function* () {
+		let o = yield* n.fence().pipe(i.option), l = yield* t.currentTimeMillis, d = yield* a, f = yield* t.currentTimeMillis;
+		if (d.store === void 0) return d.notApplicable !== !0 && (yield* y(r.label, "uncacheable")), {
+			value: d.value,
+			kept: !1
+		};
+		if (c.isNone(o) || f - l >= u) return yield* y(r.label, "voided"), {
+			value: d.value,
+			kept: !1
+		};
+		let p = yield* b(e, d.store.stored, {
+			ttlMs: r.ttlMs,
+			...r.swrMs === void 0 ? {} : { swrMs: r.swrMs },
+			tags: d.store.tags
+		}, o.value).pipe(i.catchTag("CacheError", () => i.succeed(!1)));
+		return yield* y(r.label, p ? "stored" : "voided"), p || (yield* s.update(h, 1)), {
+			value: d.value,
+			kept: p
+		};
+	}), T = (e, r, a, o) => {
+		let s = n.claim, l = w(e, r, o).pipe(i.map((e) => ({
+			value: e.value,
+			served: "miss",
+			shareable: e.kept
+		})));
+		if (r.leaseMs === void 0 || s === void 0) return l;
+		let u = r.leaseMs, d = `\u0000lease:${e}`, f = l.pipe(i.ensuring(n.remove(d).pipe(i.ignore))), p = s(d, u).pipe(i.catchTag("CacheError", () => i.succeed(!0))), m = (n) => C(e, r, a).pipe(i.flatMap((e) => c.isSome(e) ? y(r.label, "hits").pipe(i.as({
+			value: e.value.value,
+			served: "hit",
+			shareable: !0
+		})) : p.pipe(i.flatMap((e) => e ? f : t.currentTimeMillis.pipe(i.flatMap((e) => e >= n ? l : i.sleep(Math.min(25, n - e)).pipe(i.andThen(m(n)))))))));
+		return p.pipe(i.flatMap((e) => e ? f : t.currentTimeMillis.pipe(i.flatMap((e) => m(e + u)))));
+	}, E = (e, t, n, r) => C(e, t, r).pipe(i.flatMap((a) => {
+		if (c.isSome(a)) {
+			if (a.value.fresh) return y(t.label, "hits").pipe(i.as({
+				value: a.value.value,
+				served: "hit"
+			}));
+			let r = S(e, w(e, t, n)).pipe(i.catchCause(() => i.void));
+			return y(t.label, "stale").pipe(i.andThen(i.forkDetach(r)), i.as({
+				value: a.value.value,
+				served: "stale"
+			}));
+		}
+		return y(t.label, "misses").pipe(i.andThen(D(e, t, r, n)), i.map(({ value: e, served: t }) => ({
+			value: e,
+			served: t
+		})));
+	})), D = (e, t, n, s) => l.modifyEffect(o, (t) => {
+		let n = a.get(t, e);
+		return c.isSome(n) ? i.succeed([{
+			kind: "await",
+			deferred: n.value
+		}, t]) : r.make().pipe(i.map((n) => [{
+			kind: "own",
+			deferred: n
+		}, a.set(t, e, n)]));
+	}).pipe(i.flatMap((u) => u.kind === "own" ? T(e, t, n, s).pipe(i.onExit((t) => r.done(u.deferred, t).pipe(i.andThen(l.update(o, (t) => a.remove(t, e)))))) : r.await(u.deferred).pipe(i.option, i.flatMap((n) => {
+		let r = n;
+		return c.isSome(r) && r.value.shareable ? i.succeed({
+			...r.value,
+			served: "miss"
+		}) : w(e, t, s).pipe(i.map((e) => ({
+			value: e.value,
+			served: "miss",
+			shareable: e.kept
+		})));
+	})))), O = (e, r, a) => n.get(e).pipe(i.flatMap((n) => {
 		if (c.isSome(n)) {
 			let o = n.value;
-			return u(o) ? s.update(d, 1).pipe(i.andThen(t.currentTimeMillis), i.flatMap((t) => {
+			return f(o) ? s.update(p, 1).pipe(i.andThen(t.currentTimeMillis), i.flatMap((t) => {
 				if (t < o.freshUntil) return i.succeed(o.v);
-				let n = h(e, m(e, r, a)).pipe(i.catchCause(() => i.void));
+				let n = S(e, x(e, r, a)).pipe(i.catchCause(() => i.void));
 				return i.forkDetach(n).pipe(i.as(o.v));
-			})) : s.update(d, 1).pipe(i.as(o));
+			})) : s.update(p, 1).pipe(i.as(o));
 		}
-		return s.update(f, 1).pipe(i.andThen(h(e, m(e, r, a))));
+		return s.update(m, 1).pipe(i.andThen(S(e, x(e, r, a))));
 	}));
 	return {
 		get: (e) => n.get(e),
 		set: (e, t, r) => n.set(e, t, r),
-		setWithTags: (e, t, r) => n.setWithTags(e, t, r),
-		put: (e, t, n) => p(e, n, t),
+		setWithTags: (e, t, r) => n.setWithTags(e, t, r).pipe(i.asVoid),
+		put: (e, t, n, r) => b(e, n, t, r).pipe(i.tap((e) => e ? i.void : s.update(h, 1))),
+		fence: () => n.fence(),
 		remove: n.remove,
 		has: n.has,
 		clear: n.clear,
 		invalidateTag: n.invalidateTag,
-		wrap: g,
+		wrap: O,
+		wrapDynamic: E,
+		queryStats: () => i.sync(() => Object.fromEntries([...v].map(([e, t]) => [e, { ...t }]))),
 		partition: (e, t = {}) => {
 			let r = (t) => `${e}:${t}`, i = (e) => ({
 				...t.ttlMs === void 0 ? {} : { ttlMs: t.ttlMs },
@@ -66,24 +170,25 @@ var u = (e) => typeof e == "object" && !!e && e._voltroSwr === 1, d = class d ex
 				set: (e, i, a) => n.set(r(e), i, a ?? (t.ttlMs === void 0 ? void 0 : { ttlMs: t.ttlMs })),
 				has: (e) => n.has(r(e)),
 				remove: (e) => n.remove(r(e)),
-				wrap: (e, t, n) => g(r(e), i(t), n),
+				wrap: (e, t, n) => O(r(e), i(t), n),
 				invalidateTag: (e) => n.invalidateTag(e)
 			};
 		},
 		stats: () => i.all({
-			hits: s.value(d),
-			misses: s.value(f)
-		}).pipe(i.map(({ hits: e, misses: t }) => {
-			let n = Number(e.count), r = Number(t.count), i = n + r;
+			hits: s.value(p),
+			misses: s.value(m),
+			voided: s.value(h)
+		}).pipe(i.map(({ hits: e, misses: t, voided: n }) => {
+			let r = Number(e.count), i = Number(t.count), a = r + i;
 			return {
-				hits: n,
-				misses: r,
-				hitRate: i === 0 ? 0 : n / i
+				hits: r,
+				misses: i,
+				hitRate: a === 0 ? 0 : r / a,
+				voided: Number(n.count)
 			};
 		}))
 	};
 }) }) {
-	static layer = o.effect(d, d.make);
+	static layer = o.effect(p, p.make);
 };
-//#endregion
-export { d as Cache };
+export { p as Cache };

package/dist/CacheStore.js

@@ -1,5 +1,5 @@
 import { Context as e } from "effect";
-//#region src/CacheStore.ts
-var t = class extends e.Service()("@voltro/CacheStore") {};
-//#endregion
-export { t as CacheStore };
+import { CACHE_FENCE_RETENTION_MS as t } from "@voltro/kv/connection";
+// src/CacheStore.ts
+var n = class extends e.Service()("@voltro/CacheStore") {};
+export { t as CACHE_FENCE_RETENTION_MS, n as CacheStore };

package/dist/_virtual/_rolldown/runtime.js

@@ -1,4 +1,4 @@
-//#region \0rolldown/runtime.js
+// \0rolldown/runtime.js
 var e = Object.defineProperty, t = (t, n) => {
 	let r = {};
 	for (var i in t) e(r, i, {
@@ -7,5 +7,4 @@ var e = Object.defineProperty, t = (t, n) => {
 	});
 	return n || e(r, Symbol.toStringTag, { value: "Module" }), r;
 };
-//#endregion
 export { t as __exportAll };

package/dist/backendMemory.js

@@ -1,13 +1,29 @@
 import { CacheStore as e } from "./CacheStore.js";
 import { Clock as t, Effect as n, HashMap as r, HashSet as i, Layer as a, Option as o, Ref as s } from "effect";
-//#region src/backendMemory.ts
-var c = {
+import { CACHE_FENCE_RETENTION_MS as c } from "@voltro/kv/connection";
+// src/backendMemory.ts
+var l = {
 	entries: r.empty(),
 	tagIndex: r.empty(),
 	seq: 0,
 	oldest: void 0,
-	newest: void 0
-}, l = (e, t, n) => {
+	newest: void 0,
+	sequence: 0,
+	epochs: r.empty()
+}, u = 1024, d = (e, t, n) => {
+	let i = e.sequence + 1, a = r.set(e.epochs, t, {
+		sequence: i,
+		at: n
+	});
+	return r.size(a) > u && (a = r.filter(a, (e) => e.at > n - c)), {
+		...e,
+		sequence: i,
+		epochs: a
+	};
+}, f = (e, t, n) => t.some((t) => {
+	let i = r.get(e.epochs, t);
+	return o.isSome(i) && i.value.sequence > n;
+}), p = (e, t, n) => {
 	let a = e;
 	for (let e of n) {
 		let n = r.get(a, e);
@@ -16,7 +32,7 @@ var c = {
 		a = i.size(s) === 0 ? r.remove(a, e) : r.set(a, e, s);
 	}
 	return a;
-}, u = (e, t) => {
+}, m = (e, t) => {
 	let n = r.get(e.entries, t);
 	if (o.isNone(n)) return e;
 	let { older: i, newer: a } = n.value, s = r.remove(e.entries, t);
@@ -35,29 +51,65 @@ var c = {
 		}));
 	}
 	return {
+		...e,
 		entries: s,
-		tagIndex: l(e.tagIndex, t, n.value.tags),
-		seq: e.seq,
+		tagIndex: p(e.tagIndex, t, n.value.tags),
 		oldest: i === void 0 ? a : e.oldest,
 		newest: a === void 0 ? i : e.newest
 	};
-}, d = (e, t, n) => {
+}, h = (e, t, n) => {
 	let a = r.get(e, t), s = o.isSome(a) ? i.add(a.value, n) : i.make(n);
 	return r.set(e, t, s);
-}, f = (e, t) => {
+}, g = (e, t) => {
+	let n = r.get(e.entries, t);
+	if (o.isNone(n) || e.newest === t) return e;
+	let { older: i, newer: a, ...s } = n.value, c = e.entries;
+	if (i !== void 0) {
+		let e = r.get(c, i);
+		o.isSome(e) && (c = r.set(c, i, {
+			...e.value,
+			newer: a
+		}));
+	}
+	if (a !== void 0) {
+		let e = r.get(c, a);
+		o.isSome(e) && (c = r.set(c, a, {
+			...e.value,
+			older: i
+		}));
+	}
+	let l = e.newest;
+	if (l !== void 0) {
+		let e = r.get(c, l);
+		o.isSome(e) && (c = r.set(c, l, {
+			...e.value,
+			newer: t
+		}));
+	}
+	return c = r.set(c, t, {
+		...s,
+		older: l,
+		newer: void 0
+	}), {
+		...e,
+		entries: c,
+		oldest: e.oldest === t ? a : e.oldest,
+		newest: t
+	};
+}, _ = (e, t) => {
 	let n = r.size(e.entries) - t;
 	if (n <= 0) return e;
 	let i = e;
 	for (let e = 0; e < n; e++) {
 		let e = i.oldest;
 		if (e === void 0) break;
-		i = u(i, e);
+		i = m(i, e);
 	}
 	return i;
-}, p = (e, t, n, i, a, s) => {
-	let c = u(e, t), l = c.seq + 1, p = c.tagIndex;
-	for (let e of a) p = d(p, e, t);
-	let m = r.set(c.entries, t, {
+}, v = (e, t, n, i, a, s) => {
+	let c = m(e, t), l = c.seq + 1, u = c.tagIndex;
+	for (let e of a) u = h(u, e, t);
+	let d = r.set(c.entries, t, {
 		value: n,
 		expiresAt: i,
 		tags: a,
@@ -66,49 +118,57 @@ var c = {
 		newer: void 0
 	});
 	if (c.newest !== void 0) {
-		let e = r.get(m, c.newest);
-		o.isSome(e) && (m = r.set(m, c.newest, {
+		let e = r.get(d, c.newest);
+		o.isSome(e) && (d = r.set(d, c.newest, {
 			...e.value,
 			newer: t
 		}));
 	}
-	let h = {
-		entries: m,
-		tagIndex: p,
+	let f = {
+		...c,
+		entries: d,
+		tagIndex: u,
 		seq: l,
 		oldest: c.oldest ?? t,
 		newest: t
 	};
-	return s === void 0 ? h : f(h, s);
-}, m = (e, t) => t === void 0 ? Infinity : e + t, h = (e) => n.gen(function* () {
-	let i = yield* s.make(c), a = e.maxEntries, l = e.now === void 0 ? t.currentTimeMillis : n.sync(e.now);
+	return s === void 0 ? f : _(f, s);
+}, y = (e, t) => t === void 0 ? Infinity : e + t, b = (e) => n.gen(function* () {
+	let i = yield* s.make(l), a = e.maxEntries, c = e.now === void 0 ? t.currentTimeMillis : n.sync(e.now);
 	return {
-		get: (e) => l.pipe(n.flatMap((t) => s.modify(i, (n) => {
+		get: (e) => c.pipe(n.flatMap((t) => s.modify(i, (n) => {
 			let i = r.get(n.entries, e);
-			return o.isNone(i) ? [o.none(), n] : i.value.expiresAt <= t ? [o.none(), u(n, e)] : [o.some(i.value.value), n];
+			return o.isNone(i) ? [o.none(), n] : i.value.expiresAt <= t ? [o.none(), m(n, e)] : [o.some(i.value.value), a === void 0 ? n : g(n, e)];
+		}))),
+		set: (e, t, r) => c.pipe(n.flatMap((n) => s.update(i, (i) => v(i, e, t, y(n, r?.ttlMs), [], a)))),
+		setWithTags: (e, t, r) => c.pipe(n.flatMap((n) => s.modify(i, (i) => {
+			let o = r.tags ?? [];
+			return r.fence !== void 0 && f(i, o, r.fence) ? [!1, i] : [!0, v(i, e, t, y(n, r.ttlMs), o, a)];
 		}))),
-		set: (e, t, r) => l.pipe(n.flatMap((n) => s.update(i, (i) => p(i, e, t, m(n, r?.ttlMs), [], a)))),
-		setWithTags: (e, t, r) => l.pipe(n.flatMap((n) => s.update(i, (i) => p(i, e, t, m(n, r.ttlMs), r.tags ?? [], a)))),
-		remove: (e) => l.pipe(n.flatMap((t) => s.modify(i, (n) => {
+		fence: () => s.get(i).pipe(n.map((e) => e.sequence)),
+		remove: (e) => c.pipe(n.flatMap((t) => s.modify(i, (n) => {
 			let i = r.get(n.entries, e);
-			return o.isNone(i) ? [!1, n] : [i.value.expiresAt > t, u(n, e)];
+			return o.isNone(i) ? [!1, n] : [i.value.expiresAt > t, m(n, e)];
 		}))),
-		has: (e) => l.pipe(n.flatMap((t) => s.modify(i, (n) => {
+		has: (e) => c.pipe(n.flatMap((t) => s.modify(i, (n) => {
 			let i = r.get(n.entries, e);
-			return o.isNone(i) ? [!1, n] : i.value.expiresAt <= t ? [!1, u(n, e)] : [!0, n];
+			return o.isNone(i) ? [!1, n] : i.value.expiresAt <= t ? [!1, m(n, e)] : [!0, n];
 		}))),
-		clear: () => s.set(i, c),
-		invalidateTag: (e) => s.modify(i, (t) => {
-			let n = r.get(t.tagIndex, e);
-			if (o.isNone(n)) return [0, t];
-			let i = t, a = 0;
-			for (let e of n.value) i = u(i, e), a += 1;
-			return [a, {
-				...i,
-				tagIndex: r.remove(i.tagIndex, e)
+		clear: () => s.update(i, (e) => ({
+			...l,
+			sequence: e.sequence,
+			epochs: e.epochs
+		})),
+		invalidateTag: (e) => c.pipe(n.flatMap((t) => s.modify(i, (n) => {
+			let i = d(n, e, t), a = r.get(i.tagIndex, e);
+			if (o.isNone(a)) return [0, i];
+			let s = i, c = 0;
+			for (let e of a.value) s = m(s, e), c += 1;
+			return [c, {
+				...s,
+				tagIndex: r.remove(s.tagIndex, e)
 			}];
-		})
+		})))
 	};
-}), g = (t = {}) => a.effect(e, h(t));
-//#endregion
-export { g as layerMemory };
+}), x = (t = {}) => a.effect(e, b(t));
+export { x as layerMemory };