@voltro/cache 0.85.0 → 0.86.0

package/dist/index.js

@@ -1,406 +1,9 @@
-import { Clock as e, Config as t, Context as n, Deferred as r, Effect as i, HashMap as a, HashSet as o, Layer as s, Metric as c, Option as l, PubSub as u, Ref as d, Schema as f, Scope as p, Stream as m, SynchronizedRef as h } from "effect";
-import { commandRetry as g, connect as _ } from "@voltro/kv/connection";
-//#region \0rolldown/runtime.js
-var v = Object.defineProperty, y = (e, t) => {
-	let n = {};
-	for (var r in e) v(n, r, {
-		get: e[r],
-		enumerable: !0
-	});
-	return t || v(n, Symbol.toStringTag, { value: "Module" }), n;
-}, b = class extends f.TaggedError()("CacheError", {
-	operation: f.String,
-	key: f.String,
-	cause: f.String
-}) {}, x = class extends n.Service()("@voltro/CacheStore") {}, S = {
-	entries: a.empty(),
-	tagIndex: a.empty(),
-	seq: 0,
-	oldest: void 0,
-	newest: void 0
-}, C = (e, t, n) => {
-	let r = e;
-	for (let e of n) {
-		let n = a.get(r, e);
-		if (l.isNone(n)) continue;
-		let i = o.remove(n.value, t);
-		r = o.size(i) === 0 ? a.remove(r, e) : a.set(r, e, i);
-	}
-	return r;
-}, w = (e, t) => {
-	let n = a.get(e.entries, t);
-	if (l.isNone(n)) return e;
-	let { older: r, newer: i } = n.value, o = a.remove(e.entries, t);
-	if (r !== void 0) {
-		let e = a.get(o, r);
-		l.isSome(e) && (o = a.set(o, r, {
-			...e.value,
-			newer: i
-		}));
-	}
-	if (i !== void 0) {
-		let e = a.get(o, i);
-		l.isSome(e) && (o = a.set(o, i, {
-			...e.value,
-			older: r
-		}));
-	}
-	return {
-		entries: o,
-		tagIndex: C(e.tagIndex, t, n.value.tags),
-		seq: e.seq,
-		oldest: r === void 0 ? i : e.oldest,
-		newest: i === void 0 ? r : e.newest
-	};
-}, T = (e, t, n) => {
-	let r = a.get(e, t), i = l.isSome(r) ? o.add(r.value, n) : o.make(n);
-	return a.set(e, t, i);
-}, E = (e, t) => {
-	let n = a.size(e.entries) - t;
-	if (n <= 0) return e;
-	let r = e;
-	for (let e = 0; e < n; e++) {
-		let e = r.oldest;
-		if (e === void 0) break;
-		r = w(r, e);
-	}
-	return r;
-}, D = (e, t, n, r, i, o) => {
-	let s = w(e, t), c = s.seq + 1, u = s.tagIndex;
-	for (let e of i) u = T(u, e, t);
-	let d = a.set(s.entries, t, {
-		value: n,
-		expiresAt: r,
-		tags: i,
-		seq: c,
-		older: s.newest,
-		newer: void 0
-	});
-	if (s.newest !== void 0) {
-		let e = a.get(d, s.newest);
-		l.isSome(e) && (d = a.set(d, s.newest, {
-			...e.value,
-			newer: t
-		}));
-	}
-	let f = {
-		entries: d,
-		tagIndex: u,
-		seq: c,
-		oldest: s.oldest ?? t,
-		newest: t
-	};
-	return o === void 0 ? f : E(f, o);
-}, O = (e, t) => t === void 0 ? Infinity : e + t, k = (t) => i.gen(function* () {
-	let n = yield* d.make(S), r = t.maxEntries, o = t.now === void 0 ? e.currentTimeMillis : i.sync(t.now);
-	return {
-		get: (e) => o.pipe(i.flatMap((t) => d.modify(n, (n) => {
-			let r = a.get(n.entries, e);
-			return l.isNone(r) ? [l.none(), n] : r.value.expiresAt <= t ? [l.none(), w(n, e)] : [l.some(r.value.value), n];
-		}))),
-		set: (e, t, a) => o.pipe(i.flatMap((i) => d.update(n, (n) => D(n, e, t, O(i, a?.ttlMs), [], r)))),
-		setWithTags: (e, t, a) => o.pipe(i.flatMap((i) => d.update(n, (n) => D(n, e, t, O(i, a.ttlMs), a.tags ?? [], r)))),
-		remove: (e) => o.pipe(i.flatMap((t) => d.modify(n, (n) => {
-			let r = a.get(n.entries, e);
-			return l.isNone(r) ? [!1, n] : [r.value.expiresAt > t, w(n, e)];
-		}))),
-		has: (e) => o.pipe(i.flatMap((t) => d.modify(n, (n) => {
-			let r = a.get(n.entries, e);
-			return l.isNone(r) ? [!1, n] : r.value.expiresAt <= t ? [!1, w(n, e)] : [!0, n];
-		}))),
-		clear: () => d.set(n, S),
-		invalidateTag: (e) => d.modify(n, (t) => {
-			let n = a.get(t.tagIndex, e);
-			if (l.isNone(n)) return [0, t];
-			let r = t, i = 0;
-			for (let e of n.value) r = w(r, e), i += 1;
-			return [i, {
-				...r,
-				tagIndex: a.remove(r.tagIndex, e)
-			}];
-		})
-	};
-}), A = (e = {}) => s.effect(x, k(e)), j = (e) => _({
-	url: e.url,
-	driver: e.driver,
-	...e.token === void 0 ? {} : { token: e.token }
-}).pipe(i.mapError((e) => new b({
-	operation: "connect",
-	key: "",
-	cause: String(e)
-}))), M = "\nlocal NOEXP = 9000000000000000\nlocal ttl = tonumber(ARGV[1])\nlocal now = tonumber(ARGV[2])\nlocal score\nif ttl < 0 then score = NOEXP else score = now + ttl end\nredis.call('ZADD', KEYS[1], score, ARGV[3])\nlocal top = redis.call('ZREVRANGE', KEYS[1], 0, 0, 'WITHSCORES')\nlocal maxScore = tonumber(top[2])\nif maxScore >= NOEXP then\n  redis.call('PERSIST', KEYS[1])\nelse\n  local rem = maxScore - now\n  if rem < 1 then rem = 1 end\n  redis.call('PEXPIRE', KEYS[1], rem)\nend\nreturn 1\n", N = (t) => i.gen(function* () {
-	let n = yield* i.acquireRelease(j(t), (e) => i.promise(() => e.close().catch(() => void 0))), r = t.keyPrefix ?? "voltro:cache", a = (e) => `${r}:v:${e}`, o = (e) => `${r}:t:${e}`, s = (e, t, r) => i.tryPromise({
-		try: () => r(n),
-		catch: (n) => new b({
-			operation: e,
-			key: t,
-			cause: String(n)
-		})
-	}).pipe(i.retry(g)), c = (e, t) => i.try({
-		try: () => JSON.stringify(t),
-		catch: (t) => new b({
-			operation: "serialize",
-			key: e,
-			cause: String(t)
-		})
-	}), u = (e, t) => i.try({
-		try: () => l.some(JSON.parse(t)),
-		catch: (t) => new b({
-			operation: "deserialize",
-			key: e,
-			cause: String(t)
-		})
-	}), d = (e) => s("clear", "", (t) => t.scan(e, `${r}:*`, 200)).pipe(i.flatMap(({ cursor: e, keys: t }) => (t.length > 0 ? s("clear", "", (e) => e.del(t)) : i.succeed(0)).pipe(i.flatMap(() => e === "0" ? i.void : d(e))))), f = (e, t, n) => c(e, t).pipe(i.flatMap((t) => n !== void 0 && n > 0 ? s("set", e, (r) => r.psetex(a(e), Math.ceil(n), t)) : s("set", e, (n) => n.set(a(e), t))), i.asVoid);
-	return {
-		get: (e) => s("get", e, (t) => t.get(a(e))).pipe(i.flatMap((t) => t === null ? i.succeed(l.none()) : u(e, t))),
-		set: (e, t, n) => f(e, t, n?.ttlMs),
-		setWithTags: (t, n, r) => f(t, n, r.ttlMs).pipe(i.flatMap(() => {
-			let n = r.tags ?? [];
-			if (n.length === 0) return i.void;
-			let a = r.ttlMs !== void 0 && r.ttlMs > 0 ? Math.ceil(r.ttlMs) : -1;
-			return e.currentTimeMillis.pipe(i.flatMap((e) => i.forEach(n, (n) => s("setWithTags", t, (r) => r.eval(M, 1, o(n), a, e, t)), { discard: !0 })));
-		})),
-		remove: (e) => s("remove", e, (t) => t.del([a(e)])).pipe(i.map((e) => e > 0)),
-		has: (e) => s("has", e, (t) => t.exists(a(e))).pipe(i.map((e) => e > 0)),
-		clear: () => d("0"),
-		invalidateTag: (e) => s("invalidateTag", e, (t) => t.zrange(o(e))).pipe(i.flatMap((t) => s("invalidateTag", e, async (n) => {
-			let r = t.map(a), i = r.length > 0 ? await n.del(r) : 0;
-			return await n.del([o(e)]), i;
-		})))
-	};
-}), P = (e) => s.effect(x, N(e)), F = (e) => typeof e == "object" && !!e && e._voltroSwr === 1, I = class t extends n.Service()("@voltro/Cache", { make: i.gen(function* () {
-	let t = yield* x, n = yield* h.make(a.empty()), o = c.counter("voltro_cache_hits"), s = c.counter("voltro_cache_misses"), u = (n, r, a) => {
-		let o = a.tags === void 0 ? {} : { tags: a.tags }, s = a.swrMs;
-		if (s !== void 0) {
-			let c = a.ttlMs ?? 0;
-			return e.currentTimeMillis.pipe(i.flatMap((e) => t.setWithTags(n, {
-				_voltroSwr: 1,
-				v: r,
-				freshUntil: e + c
-			}, {
-				ttlMs: c + s,
-				...o
-			})));
-		}
-		let c = a.ttlMs === void 0 ? {} : { ttlMs: a.ttlMs };
-		return t.setWithTags(n, r, {
-			...c,
-			...o
-		});
-	}, d = (e, t, n) => n.pipe(i.tap((n) => u(e, n, t))), f = (e, t) => h.modifyEffect(n, (t) => {
-		let n = a.get(t, e);
-		return l.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((o) => {
-		if (o.kind === "await") return r.await(o.deferred);
-		let s = o.deferred;
-		return t.pipe(i.onExit((t) => r.done(s, t).pipe(i.andThen(h.update(n, (t) => a.remove(t, e))))));
-	})), p = (n, r, a) => t.get(n).pipe(i.flatMap((t) => {
-		if (l.isSome(t)) {
-			let s = t.value;
-			return F(s) ? c.update(o, 1).pipe(i.andThen(e.currentTimeMillis), i.flatMap((e) => {
-				if (e < s.freshUntil) return i.succeed(s.v);
-				let t = f(n, d(n, r, a)).pipe(i.catchCause(() => i.void));
-				return i.forkDetach(t).pipe(i.as(s.v));
-			})) : c.update(o, 1).pipe(i.as(s));
-		}
-		return c.update(s, 1).pipe(i.andThen(f(n, d(n, r, a))));
-	}));
-	return {
-		get: (e) => t.get(e),
-		set: (e, n, r) => t.set(e, n, r),
-		setWithTags: (e, n, r) => t.setWithTags(e, n, r),
-		put: (e, t, n) => u(e, n, t),
-		remove: t.remove,
-		has: t.has,
-		clear: t.clear,
-		invalidateTag: t.invalidateTag,
-		wrap: p,
-		partition: (e, n = {}) => {
-			let r = (t) => `${e}:${t}`, i = (e) => ({
-				...n.ttlMs === void 0 ? {} : { ttlMs: n.ttlMs },
-				...n.swrMs === void 0 ? {} : { swrMs: n.swrMs },
-				...n.tags === void 0 ? {} : { tags: n.tags },
-				...e
-			});
-			return {
-				get: (e) => t.get(r(e)),
-				set: (e, i, a) => t.set(r(e), i, a ?? (n.ttlMs === void 0 ? void 0 : { ttlMs: n.ttlMs })),
-				has: (e) => t.has(r(e)),
-				remove: (e) => t.remove(r(e)),
-				wrap: (e, t, n) => p(r(e), i(t), n),
-				invalidateTag: (e) => t.invalidateTag(e)
-			};
-		},
-		stats: () => i.all({
-			hits: c.value(o),
-			misses: c.value(s)
-		}).pipe(i.map(({ hits: e, misses: t }) => {
-			let n = Number(e.count), r = Number(t.count), i = n + r;
-			return {
-				hits: n,
-				misses: r,
-				hitRate: i === 0 ? 0 : n / i
-			};
-		}))
-	};
-}) }) {
-	static layer = s.effect(t, t.make);
-}, L = (e, t) => `row:${e}:${t}`, R = (e) => `table:${e}`, z = (e) => {
-	let t = R(e.table);
-	return e.op === "insert" || e.id === void 0 ? [t] : [L(e.table, e.id), t];
-}, B = (e, t) => {
-	let n = Math.min(e.length, t.length), r = 0, i = 0, a = 0;
-	for (let o = 0; o < n; o++) {
-		let n = e[o], s = t[o];
-		r += n * s, i += n * n, a += s * s;
-	}
-	let o = Math.sqrt(i) * Math.sqrt(a);
-	return o === 0 ? 0 : r / o;
-}, V = (e) => {
-	let t = 2166136261;
-	for (let n of e) {
-		let e = Math.round(n * 1e6) | 0;
-		for (let n = 0; n < 32; n += 8) t ^= e >>> n & 255, t = Math.imul(t, 16777619);
-	}
-	return `sem:${(t >>> 0).toString(36)}`;
-}, H = {
-	entries: a.empty(),
-	byDep: a.empty(),
-	hits: 0,
-	misses: 0
-}, U = (e, t, n) => {
-	let r = e;
-	for (let e of n) {
-		let n = a.get(r, e);
-		if (l.isNone(n)) continue;
-		let i = o.remove(n.value, t);
-		r = o.size(i) === 0 ? a.remove(r, e) : a.set(r, e, i);
-	}
-	return r;
-}, W = (e, t) => {
-	let n = a.get(e.entries, t);
-	return l.isNone(n) ? e : {
-		...e,
-		entries: a.remove(e.entries, t),
-		byDep: U(e.byDep, t, n.value.deps)
-	};
-}, G = (e, t) => {
-	let n = W(e, t.key), r = n.byDep;
-	for (let e of t.deps) {
-		let n = a.get(r, e);
-		r = a.set(r, e, l.isSome(n) ? o.add(n.value, t.key) : o.make(t.key));
-	}
-	return {
-		...n,
-		entries: a.set(n.entries, t.key, t),
-		byDep: r
-	};
-}, K = (e, t = {}) => i.gen(function* () {
-	let t = yield* d.make(H), n = (n, r) => i.gen(function* () {
-		let i = yield* d.get(t), a = [], o = 0;
-		for (let [, e] of i.entries) {
-			let t = B(n, e.embedding);
-			t >= r.threshold && a.push([
-				e,
-				t,
-				o
-			]), o++;
-		}
-		let s = (e, t) => e[1] > t[1] || e[1] === t[1] && e[2] < t[2], c = (e) => {
-			let t = a[e];
-			for (; e * 2 + 1 < a.length;) {
-				let n = e * 2 + 1;
-				if (n + 1 < a.length && s(a[n + 1], a[n]) && n++, !s(a[n], t)) break;
-				a[e] = a[n], e = n;
-			}
-			a[e] = t;
-		};
-		for (let e = Math.floor(a.length / 2) - 1; e >= 0; e--) c(e);
-		for (; a.length > 0;) {
-			let [n] = a[0], r = a.pop();
-			a.length > 0 && (a[0] = r, c(0));
-			let i = yield* e.get(n.key);
-			if (l.isSome(i)) return yield* d.update(t, (e) => ({
-				...e,
-				hits: e.hits + 1
-			})), l.some(i.value);
-			yield* d.update(t, (e) => W(e, n.key));
-		}
-		return yield* d.update(t, (e) => ({
-			...e,
-			misses: e.misses + 1
-		})), l.none();
-	}), r = (n, r, a) => i.gen(function* () {
-		let i = a.key ?? V(n), o = {
-			tags: a.deps,
-			...a.ttlMs === void 0 ? {} : { ttlMs: a.ttlMs }
-		};
-		yield* e.setWithTags(i, r, o), yield* d.update(t, (e) => G(e, {
-			key: i,
-			embedding: n,
-			deps: a.deps
-		}));
-	}), o = (n) => i.gen(function* () {
-		let r = yield* d.get(t), i = /* @__PURE__ */ new Set();
-		for (let e of n) {
-			let t = a.get(r.byDep, e);
-			if (l.isSome(t)) for (let e of t.value) i.add(e);
-		}
-		for (let t of n) yield* e.invalidateTag(t);
-		return yield* d.update(t, (e) => {
-			let t = e;
-			for (let e of i) t = W(t, e);
-			return t;
-		}), i.size;
-	});
-	return {
-		lookup: n,
-		put: r,
-		evict: o,
-		onSourceChange: (e) => o(z(e)),
-		onTableChange: (e) => o([R(e)]),
-		clear: () => e.clear().pipe(i.andThen(d.set(t, H))),
-		stats: () => d.get(t).pipe(i.map((e) => ({
-			hits: e.hits,
-			misses: e.misses,
-			size: a.size(e.entries)
-		})))
-	};
-}), q = class e extends n.Service()("@voltro/SemanticCache", { make: i.gen(function* () {
-	return yield* K(yield* x);
-}) }) {
-	static layer = s.effect(e, e.make);
-}, J = class e extends n.Service()("@voltro/InvalidationBus", { make: i.gen(function* () {
-	let e = yield* u.unbounded(), t = yield* i.scope;
-	return {
-		publish: (t) => u.publish(e, t).pipe(i.asVoid),
-		changes: m.fromPubSub(e),
-		addSink: (n) => p.provide(u.subscribe(e), t).pipe(i.flatMap((e) => m.fromSubscription(e).pipe(m.runForEach((e) => n(e).pipe(i.ignore)), i.forkIn(t))), i.asVoid)
-	};
-}) }) {
-	static layer = s.effect(e, e.make);
-}, Y = /* @__PURE__ */ y({
-	layer: () => $,
-	storeLayer: () => Q
-}), X = i.gen(function* () {
-	let e = yield* t.Int("CACHE_MAX_ENTRIES").pipe(t.option);
-	return A(l.isSome(e) ? { maxEntries: e.value } : {});
-}), Z = i.gen(function* () {
-	let e = yield* t.String("CACHE_REDIS_URL").pipe(t.orElse(() => t.String("REDIS_URL"))), n = yield* t.Literals(["resp", "http"], "CACHE_REDIS_DRIVER").pipe(t.withDefault("resp")), r = yield* t.String("CACHE_REDIS_TOKEN").pipe(t.orElse(() => t.String("UPSTASH_REDIS_REST_TOKEN")), t.option), i = yield* t.String("CACHE_KEY_PREFIX").pipe(t.option);
-	return P({
-		driver: n,
-		url: e,
-		...l.isSome(r) ? { token: r.value } : {},
-		...l.isSome(i) ? { keyPrefix: i.value } : {}
-	});
-}), Q = s.unwrap(i.gen(function* () {
-	return (yield* t.Literals(["memory", "redis"], "CACHE_BACKEND").pipe(t.withDefault("memory"))) === "redis" ? yield* Z : yield* X;
-})), $ = I.layer.pipe(s.provide(Q));
-//#endregion
-export { I as Cache, b as CacheError, Y as CacheLayer, x as CacheStore, J as InvalidationBus, q as SemanticCache, B as cosineSimilarity, z as depsForChange, A as layerMemory, P as layerRedis, K as makeSemanticCache, L as rowDep, R as tableDep };
+import { CacheError as e } from "./errors.js";
+import { CacheStore as t } from "./CacheStore.js";
+import { layerMemory as n } from "./backendMemory.js";
+import { layerRedis as r } from "./backendRedis.js";
+import { Cache as i } from "./Cache.js";
+import { SemanticCache as a, cosineSimilarity as o, depsForChange as s, makeSemanticCache as c, rowDep as l, tableDep as u } from "./semantic.js";
+import { InvalidationBus as d } from "./invalidationBus.js";
+import { layer_exports as f } from "./layer.js";
+export { i as Cache, e as CacheError, f as CacheLayer, t as CacheStore, d as InvalidationBus, a as SemanticCache, o as cosineSimilarity, s as depsForChange, n as layerMemory, r as layerRedis, c as makeSemanticCache, l as rowDep, u as tableDep };

package/dist/invalidationBus.js

@@ -0,0 +1,14 @@
+import { Context as e, Effect as t, Layer as n, PubSub as r, Scope as i, Stream as a } from "effect";
+//#region src/invalidationBus.ts
+var o = class o extends e.Service()("@voltro/InvalidationBus", { make: t.gen(function* () {
+	let e = yield* r.unbounded(), n = yield* t.scope;
+	return {
+		publish: (n) => r.publish(e, n).pipe(t.asVoid),
+		changes: a.fromPubSub(e),
+		addSink: (o) => i.provide(r.subscribe(e), n).pipe(t.flatMap((e) => a.fromSubscription(e).pipe(a.runForEach((e) => o(e).pipe(t.ignore)), t.forkIn(n))), t.asVoid)
+	};
+}) }) {
+	static layer = n.effect(o, o.make);
+};
+//#endregion
+export { o as InvalidationBus };

package/dist/layer.js

@@ -0,0 +1,25 @@
+import { __exportAll as e } from "./_virtual/_rolldown/runtime.js";
+import { layerMemory as t } from "./backendMemory.js";
+import { layerRedis as n } from "./backendRedis.js";
+import { Cache as r } from "./Cache.js";
+import { Config as i, Effect as a, Layer as o, Option as s } from "effect";
+//#region src/layer.ts
+var c = /* @__PURE__ */ e({
+	layer: () => f,
+	storeLayer: () => d
+}), l = a.gen(function* () {
+	let e = yield* i.Int("CACHE_MAX_ENTRIES").pipe(i.option), n = s.isSome(e) ? { maxEntries: e.value } : {};
+	return t(n);
+}), u = a.gen(function* () {
+	let e = yield* i.String("CACHE_REDIS_URL").pipe(i.orElse(() => i.String("REDIS_URL"))), t = yield* i.Literals(["resp", "http"], "CACHE_REDIS_DRIVER").pipe(i.withDefault("resp")), r = yield* i.String("CACHE_REDIS_TOKEN").pipe(i.orElse(() => i.String("UPSTASH_REDIS_REST_TOKEN")), i.option), a = yield* i.String("CACHE_KEY_PREFIX").pipe(i.option), o = {
+		driver: t,
+		url: e,
+		...s.isSome(r) ? { token: r.value } : {},
+		...s.isSome(a) ? { keyPrefix: a.value } : {}
+	};
+	return n(o);
+}), d = o.unwrap(a.gen(function* () {
+	return (yield* i.Literals(["memory", "redis"], "CACHE_BACKEND").pipe(i.withDefault("memory"))) === "redis" ? yield* u : yield* l;
+})), f = r.layer.pipe(o.provide(d));
+//#endregion
+export { f as layer, c as layer_exports, d as storeLayer };

package/dist/semantic.js

@@ -0,0 +1,131 @@
+import { CacheStore as e } from "./CacheStore.js";
+import { Context as t, Effect as n, HashMap as r, HashSet as i, Layer as a, Option as o, Ref as s } from "effect";
+//#region src/semantic.ts
+var c = (e, t) => `row:${e}:${t}`, l = (e) => `table:${e}`, u = (e) => {
+	let t = l(e.table);
+	return e.op === "insert" || e.id === void 0 ? [t] : [c(e.table, e.id), t];
+}, d = (e, t) => {
+	let n = Math.min(e.length, t.length), r = 0, i = 0, a = 0;
+	for (let o = 0; o < n; o++) {
+		let n = e[o], s = t[o];
+		r += n * s, i += n * n, a += s * s;
+	}
+	let o = Math.sqrt(i) * Math.sqrt(a);
+	return o === 0 ? 0 : r / o;
+}, f = (e) => {
+	let t = 2166136261;
+	for (let n of e) {
+		let e = Math.round(n * 1e6) | 0;
+		for (let n = 0; n < 32; n += 8) t ^= e >>> n & 255, t = Math.imul(t, 16777619);
+	}
+	return `sem:${(t >>> 0).toString(36)}`;
+}, p = {
+	entries: r.empty(),
+	byDep: r.empty(),
+	hits: 0,
+	misses: 0
+}, m = (e, t, n) => {
+	let a = e;
+	for (let e of n) {
+		let n = r.get(a, e);
+		if (o.isNone(n)) continue;
+		let s = i.remove(n.value, t);
+		a = i.size(s) === 0 ? r.remove(a, e) : r.set(a, e, s);
+	}
+	return a;
+}, h = (e, t) => {
+	let n = r.get(e.entries, t);
+	return o.isNone(n) ? e : {
+		...e,
+		entries: r.remove(e.entries, t),
+		byDep: m(e.byDep, t, n.value.deps)
+	};
+}, g = (e, t) => {
+	let n = h(e, t.key), a = n.byDep;
+	for (let e of t.deps) {
+		let n = r.get(a, e);
+		a = r.set(a, e, o.isSome(n) ? i.add(n.value, t.key) : i.make(t.key));
+	}
+	return {
+		...n,
+		entries: r.set(n.entries, t.key, t),
+		byDep: a
+	};
+}, _ = (e, t = {}) => n.gen(function* () {
+	let t = yield* s.make(p), i = (r, i) => n.gen(function* () {
+		let n = yield* s.get(t), a = [], c = 0;
+		for (let [, e] of n.entries) {
+			let t = d(r, e.embedding);
+			t >= i.threshold && a.push([
+				e,
+				t,
+				c
+			]), c++;
+		}
+		let l = (e, t) => e[1] > t[1] || e[1] === t[1] && e[2] < t[2], u = (e) => {
+			let t = a[e];
+			for (; e * 2 + 1 < a.length;) {
+				let n = e * 2 + 1;
+				if (n + 1 < a.length && l(a[n + 1], a[n]) && n++, !l(a[n], t)) break;
+				a[e] = a[n], e = n;
+			}
+			a[e] = t;
+		};
+		for (let e = Math.floor(a.length / 2) - 1; e >= 0; e--) u(e);
+		for (; a.length > 0;) {
+			let [n] = a[0], r = a.pop();
+			a.length > 0 && (a[0] = r, u(0));
+			let i = yield* e.get(n.key);
+			if (o.isSome(i)) return yield* s.update(t, (e) => ({
+				...e,
+				hits: e.hits + 1
+			})), o.some(i.value);
+			yield* s.update(t, (e) => h(e, n.key));
+		}
+		return yield* s.update(t, (e) => ({
+			...e,
+			misses: e.misses + 1
+		})), o.none();
+	}), a = (r, i, a) => n.gen(function* () {
+		let n = a.key ?? f(r), o = {
+			tags: a.deps,
+			...a.ttlMs === void 0 ? {} : { ttlMs: a.ttlMs }
+		};
+		yield* e.setWithTags(n, i, o), yield* s.update(t, (e) => g(e, {
+			key: n,
+			embedding: r,
+			deps: a.deps
+		}));
+	}), c = (i) => n.gen(function* () {
+		let n = yield* s.get(t), a = /* @__PURE__ */ new Set();
+		for (let e of i) {
+			let t = r.get(n.byDep, e);
+			if (o.isSome(t)) for (let e of t.value) a.add(e);
+		}
+		for (let t of i) yield* e.invalidateTag(t);
+		return yield* s.update(t, (e) => {
+			let t = e;
+			for (let e of a) t = h(t, e);
+			return t;
+		}), a.size;
+	});
+	return {
+		lookup: i,
+		put: a,
+		evict: c,
+		onSourceChange: (e) => c(u(e)),
+		onTableChange: (e) => c([l(e)]),
+		clear: () => e.clear().pipe(n.andThen(s.set(t, p))),
+		stats: () => s.get(t).pipe(n.map((e) => ({
+			hits: e.hits,
+			misses: e.misses,
+			size: r.size(e.entries)
+		})))
+	};
+}), v = class r extends t.Service()("@voltro/SemanticCache", { make: n.gen(function* () {
+	return yield* _(yield* e);
+}) }) {
+	static layer = a.effect(r, r.make);
+};
+//#endregion
+export { v as SemanticCache, d as cosineSimilarity, u as depsForChange, _ as makeSemanticCache, c as rowDep, l as tableDep };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@voltro/cache",
-  "version": "0.85.0",
+  "version": "0.86.0",
   "description": "Effect-native cache primitive — memory + RESP (Redis/Valkey/KeyDB/Dragonfly/Upstash) backends, tag invalidation, single-flight wrap.",
   "keywords": [
     "voltro",
@@ -33,7 +33,7 @@
     "node": ">=24.0.0"
   },
   "dependencies": {
-    "@voltro/kv": "0.85.0"
+    "@voltro/kv": "0.86.0"
   },
   "peerDependencies": {
     "effect": "4.0.1"