@voltro/kv 0.87.0 → 0.88.0

package/dist/hotStoreConformance.js

@@ -1,17 +1,16 @@
 import { HotStore as e } from "./hot-contract.js";
 import { Effect as t, Option as n, Result as r, Stream as i } from "effect";
-import { describe as a, expect as o, it as s } from "vitest";
-//#region src/hotStoreConformance.ts
-var c = (c, l) => {
-	let u = (n, r) => s(n, async () => {
-		let n = l();
+// src/hotStoreConformance.ts
+var a = (a, o, s) => {
+	let { describe: c, expect: l, it: u } = s, d = (n, r) => u(n, async () => {
+		let n = o();
 		await t.runPromise(t.gen(function* () {
 			let t = yield* e;
-			o(t.capabilities).toEqual(n.capabilities), yield* r(t, n.advance);
+			l(t.capabilities).toEqual(n.capabilities), yield* r(t, n.advance);
 		}).pipe(t.provide(n.layer)));
 	});
-	a(`hotStoreConformance — ${c}`, () => {
-		u("sorted-set order, reverse ties, negative ranks, inclusive score bounds and limits", (e) => t.gen(function* () {
+	c(`hotStoreConformance — ${a}`, () => {
+		d("sorted-set order, reverse ties, negative ranks, inclusive score bounds and limits", (e) => t.gen(function* () {
 			yield* e.zadd("board", [
 				{
 					member: "b",
@@ -33,25 +32,25 @@ var c = (c, l) => {
 					member: "",
 					score: 30
 				}
-			]), o((yield* e.zrange("board", { byRank: [0, -1] }, "asc")).map((e) => e.member)).toEqual([
+			]), l((yield* e.zrange("board", { byRank: [0, -1] }, "asc")).map((e) => e.member)).toEqual([
 				"a",
 				"b",
 				"c",
 				"",
 				"𐀀"
-			]), o((yield* e.zrange("board", { byScore: [10, 20] }, "desc")).map((e) => e.member)).toEqual([
+			]), l((yield* e.zrange("board", { byScore: [10, 20] }, "desc")).map((e) => e.member)).toEqual([
 				"c",
 				"b",
 				"a"
-			]), o(yield* e.zrange("board", { byRank: [0, -1] }, "asc", { limit: 0 })).toEqual([]), o((yield* e.zrange("board", { byRank: [-2, -1] }, "asc")).length).toBe(2), o((yield* e.zrange("board", { byScore: [10, 20] }, "asc", { limit: 1 }))[0]?.member).toBe("a"), o(n.getOrNull(yield* e.zrank("board", "b", "asc"))).toBe(1), o(n.getOrNull(yield* e.zrank("board", "b", "desc"))).toBe(3), o(n.isNone(yield* e.zrank("board", "absent", "asc"))).toBe(!0), o(yield* e.zcard("board")).toBe(5);
-		})), u("score modes, duplicate members and removal by rank/score", (e) => t.gen(function* () {
+			]), l(yield* e.zrange("board", { byRank: [0, -1] }, "asc", { limit: 0 })).toEqual([]), l((yield* e.zrange("board", { byRank: [-2, -1] }, "asc")).length).toBe(2), l((yield* e.zrange("board", { byScore: [10, 20] }, "asc", { limit: 1 }))[0]?.member).toBe("a"), l(n.getOrNull(yield* e.zrank("board", "b", "asc"))).toBe(1), l(n.getOrNull(yield* e.zrank("board", "b", "desc"))).toBe(3), l(n.isNone(yield* e.zrank("board", "absent", "asc"))).toBe(!0), l(yield* e.zcard("board")).toBe(5);
+		})), d("score modes, duplicate members and removal by rank/score", (e) => t.gen(function* () {
 			yield* e.zadd("z", [{
 				member: "a",
 				score: 10
 			}]), yield* e.zadd("z", [{
 				member: "a",
 				score: 5
-			}], { mode: "max" }), o(n.getOrNull(yield* e.zscore("z", "a"))).toBe(10), yield* e.zadd("z", [{
+			}], { mode: "max" }), l(n.getOrNull(yield* e.zscore("z", "a"))).toBe(10), yield* e.zadd("z", [{
 				member: "a",
 				score: 7
 			}], { mode: "min" }), yield* e.zadd("z", [{
@@ -60,36 +59,36 @@ var c = (c, l) => {
 			}, {
 				member: "a",
 				score: 3
-			}], { mode: "incr" }), o(n.getOrNull(yield* e.zscore("z", "a"))).toBe(12), yield* e.zadd("z", [{
+			}], { mode: "incr" }), l(n.getOrNull(yield* e.zscore("z", "a"))).toBe(12), yield* e.zadd("z", [{
 				member: "b",
 				score: 20
 			}, {
 				member: "c",
 				score: 30
-			}]), o(yield* e.zremRange("z", { byScore: [20, 20] })).toBe(1), o(yield* e.zremRange("z", { byRank: [-1, -1] })).toBe(1), o(yield* e.zrem("z", ["a", "a"])).toBe(1), o(yield* e.zrange("z", { byRank: [0, -1] }, "asc")).toEqual([]), o(n.isNone(yield* e.zscore("z", "a"))).toBe(!0), yield* e.zadd("precise", [{
+			}]), l(yield* e.zremRange("z", { byScore: [20, 20] })).toBe(1), l(yield* e.zremRange("z", { byRank: [-1, -1] })).toBe(1), l(yield* e.zrem("z", ["a", "a"])).toBe(1), l(yield* e.zrange("z", { byRank: [0, -1] }, "asc")).toEqual([]), l(n.isNone(yield* e.zscore("z", "a"))).toBe(!0), yield* e.zadd("precise", [{
 				member: "p",
 				score: 1.2345678901234567
-			}]), o(n.getOrNull(yield* e.zscore("precise", "p"))).toBe(1.2345678901234567), o((yield* e.zrange("precise", { byRank: [0, -1] }, "asc"))[0]?.score).toBe(1.2345678901234567), o((yield* e.zrange("precise", { byScore: [1.2345678901234567, 1.2345678901234567] }, "asc"))[0]?.score).toBe(1.2345678901234567), o(yield* e.zremRange("precise", { byScore: [1.2345678901234567, 1.2345678901234567] })).toBe(1);
-		})), u("hashes preserve arbitrary field names and sets count unique changes", (e) => t.gen(function* () {
+			}]), l(n.getOrNull(yield* e.zscore("precise", "p"))).toBe(1.2345678901234567), l((yield* e.zrange("precise", { byRank: [0, -1] }, "asc"))[0]?.score).toBe(1.2345678901234567), l((yield* e.zrange("precise", { byScore: [1.2345678901234567, 1.2345678901234567] }, "asc"))[0]?.score).toBe(1.2345678901234567), l(yield* e.zremRange("precise", { byScore: [1.2345678901234567, 1.2345678901234567] })).toBe(1);
+		})), d("hashes preserve arbitrary field names and sets count unique changes", (e) => t.gen(function* () {
 			yield* e.hset("hash", Object.fromEntries([
 				["__proto__", "p"],
 				["constructor", "c"],
 				["a", "1"]
-			])), o(n.getOrNull(yield* e.hget("hash", "__proto__"))).toBe("p"), o(yield* e.hgetAll("hash")).toEqual(Object.fromEntries([
+			])), l(n.getOrNull(yield* e.hget("hash", "__proto__"))).toBe("p"), l(yield* e.hgetAll("hash")).toEqual(Object.fromEntries([
 				["__proto__", "p"],
 				["constructor", "c"],
 				["a", "1"]
-			])), o(yield* e.hdel("hash", ["a", "a"])).toBe(1), o(n.isNone(yield* e.hget("hash", "a"))).toBe(!0), o(yield* e.sadd("set", [
+			])), l(yield* e.hdel("hash", ["a", "a"])).toBe(1), l(n.isNone(yield* e.hget("hash", "a"))).toBe(!0), l(yield* e.sadd("set", [
 				"b",
 				"a",
 				"a"
-			])).toBe(2), o(yield* e.sadd("set", ["b"])).toBe(0), o(yield* e.smembers("set")).toEqual(["a", "b"]), o(yield* e.sismember("set", "a")).toBe(!0), o(yield* e.srem("set", ["a", "a"])).toBe(1), o(yield* e.sismember("set", "a")).toBe(!1), o(yield* e.hgetAll("absent")).toEqual({});
-		})), u("counter bounds fail without changing the value; increments are atomic", (e) => t.gen(function* () {
+			])).toBe(2), l(yield* e.sadd("set", ["b"])).toBe(0), l(yield* e.smembers("set")).toEqual(["a", "b"]), l(yield* e.sismember("set", "a")).toBe(!0), l(yield* e.srem("set", ["a", "a"])).toBe(1), l(yield* e.sismember("set", "a")).toBe(!1), l(yield* e.hgetAll("absent")).toEqual({});
+		})), d("counter bounds fail without changing the value; increments are atomic", (e) => t.gen(function* () {
 			let n = yield* t.all(Array.from({ length: 100 }, () => e.incrBy("counter", 1)), { concurrency: "unbounded" });
-			o(new Set(n).size).toBe(100), o(yield* e.incrBy("counter", 0)).toBe(100);
+			l(new Set(n).size).toBe(100), l(yield* e.incrBy("counter", 0)).toBe(100);
 			let i = yield* e.incrBy("counter", 1, { max: 100 }).pipe(t.result);
-			o(r.isFailure(i)).toBe(!0), r.isFailure(i) && o(i.failure.reason).toBe("limit"), o(yield* e.incrBy("counter", -20)).toBe(80);
-		})), u("concurrent batches do not interleave and concurrent leases have one winner", (e) => t.gen(function* () {
+			l(r.isFailure(i)).toBe(!0), r.isFailure(i) && l(i.failure.reason).toBe("limit"), l(yield* e.incrBy("counter", -20)).toBe(80);
+		})), d("concurrent batches do not interleave and concurrent leases have one winner", (e) => t.gen(function* () {
 			let n = yield* t.all(Array.from({ length: 20 }, () => e.multi([{
 				op: "incrBy",
 				key: "atomic",
@@ -99,14 +98,14 @@ var c = (c, l) => {
 				key: "atomic",
 				delta: 1
 			}])), { concurrency: "unbounded" });
-			for (let e of n) o(e[1]).toBe(Number(e[0]) + 1);
-			o(yield* e.incrBy("atomic", 0)).toBe(40);
+			for (let e of n) l(e[1]).toBe(Number(e[0]) + 1);
+			l(yield* e.incrBy("atomic", 0)).toBe(40);
 			let r = yield* t.all(Array.from({ length: 100 }, (t, n) => e.setNx("seat", String(n), 2e3)), { concurrency: "unbounded" });
-			o(r.filter(Boolean)).toHaveLength(1);
-		})), u("conditional lease release and renewal refuse expired owners without changing a successor", (e, n) => t.gen(function* () {
-			o(yield* e.compareDelete("conditional", "old")).toBe(!1), o(yield* e.compareExpire("conditional", "old", 1e3)).toBe(!1), o(yield* e.setNx("conditional", "old", 1e3)).toBe(!0), o(yield* e.compareDelete("conditional", "other")).toBe(!1), o(yield* e.compareExpire("conditional", "other", 1e4)).toBe(!1), yield* n(1100), o(yield* e.setNx("conditional", "successor", 1e3)).toBe(!0), o(yield* e.compareDelete("conditional", "old")).toBe(!1), o(yield* e.compareExpire("conditional", "old", 1e4)).toBe(!1), o(yield* e.setNx("conditional", "contender", 1e3)).toBe(!1), yield* n(1100), o(yield* e.setNx("conditional", "next", 1e3)).toBe(!0), o(yield* e.compareDelete("conditional", "next")).toBe(!0), o(yield* e.compareDelete("conditional", "next")).toBe(!1);
-		})), u("matching renewals reset TTL and batches retain ordered lease comparisons", (e, n) => t.gen(function* () {
-			yield* e.setNx("renewal", "Grüße 🎮", 1e3), o(yield* e.compareExpire("renewal", "Grüße 🎮", 3e3)).toBe(!0), yield* n(1100), o(yield* e.setNx("renewal", "other", 1e3)).toBe(!1), yield* n(2100), o(yield* e.setNx("renewal", "", 1e3)).toBe(!0), o(yield* e.multi([
+			l(r.filter(Boolean)).toHaveLength(1);
+		})), d("conditional lease release and renewal refuse expired owners without changing a successor", (e, n) => t.gen(function* () {
+			l(yield* e.compareDelete("conditional", "old")).toBe(!1), l(yield* e.compareExpire("conditional", "old", 1e3)).toBe(!1), l(yield* e.setNx("conditional", "old", 1e3)).toBe(!0), l(yield* e.compareDelete("conditional", "other")).toBe(!1), l(yield* e.compareExpire("conditional", "other", 1e4)).toBe(!1), yield* n(1100), l(yield* e.setNx("conditional", "successor", 1e3)).toBe(!0), l(yield* e.compareDelete("conditional", "old")).toBe(!1), l(yield* e.compareExpire("conditional", "old", 1e4)).toBe(!1), l(yield* e.setNx("conditional", "contender", 1e3)).toBe(!1), yield* n(1100), l(yield* e.setNx("conditional", "next", 1e3)).toBe(!0), l(yield* e.compareDelete("conditional", "next")).toBe(!0), l(yield* e.compareDelete("conditional", "next")).toBe(!1);
+		})), d("matching renewals reset TTL and batches retain ordered lease comparisons", (e, n) => t.gen(function* () {
+			yield* e.setNx("renewal", "Grüße 🎮", 1e3), l(yield* e.compareExpire("renewal", "Grüße 🎮", 3e3)).toBe(!0), yield* n(1100), l(yield* e.setNx("renewal", "other", 1e3)).toBe(!1), yield* n(2100), l(yield* e.setNx("renewal", "", 1e3)).toBe(!0), l(yield* e.multi([
 				{
 					op: "compareExpire",
 					key: "renewal",
@@ -134,8 +133,8 @@ var c = (c, l) => {
 				!0,
 				!0,
 				!1
-			]), o(yield* e.compareDelete("renewal", "successor")).toBe(!0);
-		})), u("conditional lease operations refuse other structures and validate before batch mutation", (e) => t.gen(function* () {
+			]), l(yield* e.compareDelete("renewal", "successor")).toBe(!0);
+		})), d("conditional lease operations refuse other structures and validate before batch mutation", (e) => t.gen(function* () {
 			yield* e.hset("conditional:hash", { value: "retained" }), yield* e.incrBy("conditional:counter", 7), yield* e.tokenBucket("conditional:bucket", {
 				capacity: 1,
 				refillPerSec: .001
@@ -152,9 +151,9 @@ var c = (c, l) => {
 				"conditional:quota"
 			]) for (let i of [e.compareDelete(n, "7"), e.compareExpire(n, "7", 1e3)]) {
 				let e = yield* i.pipe(t.result);
-				o(r.isFailure(e)).toBe(!0), r.isFailure(e) && o(e.failure.reason).toBe("wrongType");
+				l(r.isFailure(e)).toBe(!0), r.isFailure(e) && l(e.failure.reason).toBe("wrongType");
 			}
-			o(yield* e.hgetAll("conditional:hash")).toEqual({ value: "retained" }), o(yield* e.incrBy("conditional:counter", 0)).toBe(7);
+			l(yield* e.hgetAll("conditional:hash")).toEqual({ value: "retained" }), l(yield* e.incrBy("conditional:counter", 0)).toBe(7);
 			let n = yield* e.multi([{
 				op: "setNx",
 				key: "conditional:untouched",
@@ -166,81 +165,81 @@ var c = (c, l) => {
 				value: "owner",
 				ttlMs: 0
 			}]).pipe(t.result);
-			o(r.isFailure(n)).toBe(!0), o(yield* e.setNx("conditional:untouched", "new", 1e3)).toBe(!0);
+			l(r.isFailure(n)).toBe(!0), l(yield* e.setNx("conditional:untouched", "new", 1e3)).toBe(!0);
 			let i = yield* t.all(Array.from({ length: 40 }, () => e.compareDelete("conditional:untouched", "new")), { concurrency: "unbounded" });
-			o(i.filter(Boolean)).toHaveLength(1);
-		})), u("token bucket admits once per token and refills with elapsed time", (e, n) => t.gen(function* () {
+			l(i.filter(Boolean)).toHaveLength(1);
+		})), d("token bucket admits once per token and refills with elapsed time", (e, n) => t.gen(function* () {
 			let t = {
 				capacity: 2,
 				refillPerSec: 1
 			};
-			o((yield* e.tokenBucket("bucket", t)).allowed).toBe(!0), o((yield* e.tokenBucket("bucket", t)).allowed).toBe(!0);
+			l((yield* e.tokenBucket("bucket", t)).allowed).toBe(!0), l((yield* e.tokenBucket("bucket", t)).allowed).toBe(!0);
 			let r = yield* e.tokenBucket("bucket", t);
-			o(r.allowed).toBe(!1), o(r.retryAfterMs).toBeGreaterThan(0), o(r.retryAfterMs).toBeLessThanOrEqual(1e3), yield* n(1100), o((yield* e.tokenBucket("bucket", t)).allowed).toBe(!0);
-		})), u("concurrent token consumption cannot oversubscribe capacity", (e) => t.gen(function* () {
+			l(r.allowed).toBe(!1), l(r.retryAfterMs).toBeGreaterThan(0), l(r.retryAfterMs).toBeLessThanOrEqual(1e3), yield* n(1100), l((yield* e.tokenBucket("bucket", t)).allowed).toBe(!0);
+		})), d("concurrent token consumption cannot oversubscribe capacity", (e) => t.gen(function* () {
 			let n = yield* t.all(Array.from({ length: 50 }, () => e.tokenBucket("parallel:bucket", {
 				capacity: 10,
 				refillPerSec: .001
 			})), { concurrency: "unbounded" });
-			o(n.filter((e) => e.allowed)).toHaveLength(10);
+			l(n.filter((e) => e.allowed)).toHaveLength(10);
 		}));
 		for (let e of [
 			"fixed-window",
 			"sliding-window",
 			"token-bucket"
-		]) u(`${e} quotas cannot oversubscribe under concurrent requests`, (n) => t.gen(function* () {
+		]) d(`${e} quotas cannot oversubscribe under concurrent requests`, (n) => t.gen(function* () {
 			let r = {
 				algorithm: e,
 				limit: 10,
 				windowMs: 6e4,
 				burst: 10
 			}, i = yield* t.all(Array.from({ length: 120 }, () => n.rateLimit("quota:" + e, r, 1e3)), { concurrency: "unbounded" });
-			o(i.filter((e) => e.allowed)).toHaveLength(10), o(i.filter((e) => !e.allowed).every((e) => e.remaining === 0 && e.retryAfterMs > 0)).toBe(!0);
+			l(i.filter((e) => e.allowed)).toHaveLength(10), l(i.filter((e) => !e.allowed).every((e) => e.remaining === 0 && e.retryAfterMs > 0)).toBe(!0);
 		}));
-		u("rate-limit window edges, weighted previous window and token refill preserve exact decisions", (e) => t.gen(function* () {
+		d("rate-limit window edges, weighted previous window and token refill preserve exact decisions", (e) => t.gen(function* () {
 			let t = {
 				algorithm: "fixed-window",
 				limit: 2,
 				windowMs: 1e3,
 				burst: 2
 			};
-			o(yield* e.rateLimit("fixed", t, 0)).toEqual({
+			l(yield* e.rateLimit("fixed", t, 0)).toEqual({
 				allowed: !0,
 				remaining: 1,
 				resetAtMs: 1e3,
 				retryAfterMs: 0
-			}), yield* e.rateLimit("fixed", t, 0), o(yield* e.rateLimit("fixed", t, 999)).toEqual({
+			}), yield* e.rateLimit("fixed", t, 0), l(yield* e.rateLimit("fixed", t, 999)).toEqual({
 				allowed: !1,
 				remaining: 0,
 				resetAtMs: 1e3,
 				retryAfterMs: 1
-			}), o((yield* e.rateLimit("fixed", t, 1e3)).remaining).toBe(1);
+			}), l((yield* e.rateLimit("fixed", t, 1e3)).remaining).toBe(1);
 			let n = {
 				...t,
 				algorithm: "sliding-window"
 			};
-			yield* e.rateLimit("sliding", n, 0), yield* e.rateLimit("sliding", n, 0), o((yield* e.rateLimit("sliding", n, 1e3)).allowed).toBe(!1), o(yield* e.rateLimit("sliding", n, 1500)).toEqual({
+			yield* e.rateLimit("sliding", n, 0), yield* e.rateLimit("sliding", n, 0), l((yield* e.rateLimit("sliding", n, 1e3)).allowed).toBe(!1), l(yield* e.rateLimit("sliding", n, 1500)).toEqual({
 				allowed: !0,
 				remaining: 0,
 				resetAtMs: 2e3,
 				retryAfterMs: 0
-			}), o((yield* e.rateLimit("sliding", n, 1500)).allowed).toBe(!1), o((yield* e.rateLimit("sliding", n, 4e3)).remaining).toBe(1);
+			}), l((yield* e.rateLimit("sliding", n, 1500)).allowed).toBe(!1), l((yield* e.rateLimit("sliding", n, 4e3)).remaining).toBe(1);
 			let r = {
 				...t,
 				algorithm: "token-bucket",
 				burst: 1
 			};
-			o((yield* e.rateLimit("token", r, 0)).allowed).toBe(!0), o(yield* e.rateLimit("token", r, 499)).toEqual({
+			l((yield* e.rateLimit("token", r, 0)).allowed).toBe(!0), l(yield* e.rateLimit("token", r, 499)).toEqual({
 				allowed: !1,
 				remaining: 0,
 				resetAtMs: 501,
 				retryAfterMs: 2
-			}), o((yield* e.rateLimit("token", r, 500)).allowed).toBe(!0), o((yield* e.rateLimit("fixed", r, 1100)).allowed).toBe(!0), o((yield* e.rateLimit("zero", {
+			}), l((yield* e.rateLimit("token", r, 500)).allowed).toBe(!0), l((yield* e.rateLimit("fixed", r, 1100)).allowed).toBe(!0), l((yield* e.rateLimit("zero", {
 				...t,
 				limit: 0,
 				burst: 0
 			}, 0)).allowed).toBe(!1);
-		})), u("rate-limit validation precedes batch mutation; wrong types do not destroy data", (e) => t.gen(function* () {
+		})), d("rate-limit validation precedes batch mutation; wrong types do not destroy data", (e) => t.gen(function* () {
 			let n = {
 				algorithm: "fixed-window",
 				limit: 1,
@@ -258,10 +257,10 @@ var c = (c, l) => {
 					limit: -1
 				}
 			}]).pipe(t.result);
-			o(r.isFailure(i)).toBe(!0), o(yield* e.incrBy("validation", 0)).toBe(0), yield* e.hset("typed", { value: "retained" });
+			l(r.isFailure(i)).toBe(!0), l(yield* e.incrBy("validation", 0)).toBe(0), yield* e.hset("typed", { value: "retained" });
 			let a = yield* e.rateLimit("typed", n).pipe(t.result);
-			o(r.isFailure(a)).toBe(!0), r.isFailure(a) && o(a.failure.reason).toBe("wrongType"), o(yield* e.hgetAll("typed")).toEqual({ value: "retained" });
-			let s = yield* e.multi([{
+			l(r.isFailure(a)).toBe(!0), r.isFailure(a) && l(a.failure.reason).toBe("wrongType"), l(yield* e.hgetAll("typed")).toEqual({ value: "retained" });
+			let o = yield* e.multi([{
 				op: "rateLimit",
 				key: "batched",
 				config: n,
@@ -272,7 +271,7 @@ var c = (c, l) => {
 				config: n,
 				nowMs: 0
 			}]);
-			o(s).toEqual([{
+			l(o).toEqual([{
 				allowed: !0,
 				remaining: 0,
 				resetAtMs: 1e3,
@@ -283,24 +282,24 @@ var c = (c, l) => {
 				resetAtMs: 1e3,
 				retryAfterMs: 1e3
 			}]);
-		})), u("rate-limit state expires with its structure TTL and remains scan/delete addressable", (e, n) => t.gen(function* () {
+		})), d("rate-limit state expires with its structure TTL and remains scan/delete addressable", (e, n) => t.gen(function* () {
 			let t = {
 				algorithm: "fixed-window",
 				limit: 1,
 				windowMs: 1e3,
 				burst: 1
 			};
-			yield* e.rateLimit("ttl:quota", t, 0), yield* e.expire("ttl:quota", 20), yield* n(40), o((yield* e.rateLimit("ttl:quota", t, 0)).allowed).toBe(!0), o(yield* i.runCollect(e.scanPrefix("ttl:quota"))).toEqual(["ttl:quota"]), o(yield* e.delete("ttl:quota")).toBe(!0);
-		})), u("TTL expires every structure; reads and rejected lease attempts do not extend it", (e, n) => t.gen(function* () {
+			yield* e.rateLimit("ttl:quota", t, 0), yield* e.expire("ttl:quota", 20), yield* n(40), l((yield* e.rateLimit("ttl:quota", t, 0)).allowed).toBe(!0), l(yield* i.runCollect(e.scanPrefix("ttl:quota"))).toEqual(["ttl:quota"]), l(yield* e.delete("ttl:quota")).toBe(!0);
+		})), d("TTL expires every structure; reads and rejected lease attempts do not extend it", (e, n) => t.gen(function* () {
 			yield* e.zadd("ttl:z", [{
 				member: "a",
 				score: 1
-			}], { ttlMs: 1e3 }), yield* e.hset("ttl:h", { a: "b" }, { ttlMs: 1e3 }), yield* e.sadd("ttl:s", ["a"], { ttlMs: 1e3 }), yield* e.incrBy("ttl:c", 1, { ttlMs: 1e3 }), o(yield* e.setNx("ttl:l", "owner", 1e3)).toBe(!0), o(yield* e.setNx("ttl:l", "other", 1e4)).toBe(!1), o(yield* e.zcard("ttl:z")).toBe(1), yield* n(1100), o(yield* e.zcard("ttl:z")).toBe(0), o(yield* e.hgetAll("ttl:h")).toEqual({}), o(yield* e.smembers("ttl:s")).toEqual([]), o(yield* e.incrBy("ttl:c", 1)).toBe(1), o(yield* e.setNx("ttl:l", "newOwner", 1e3)).toBe(!0);
-		})), u("explicit expiry and deletion are scoped; scans treat glob symbols literally", (e, n) => t.gen(function* () {
+			}], { ttlMs: 1e3 }), yield* e.hset("ttl:h", { a: "b" }, { ttlMs: 1e3 }), yield* e.sadd("ttl:s", ["a"], { ttlMs: 1e3 }), yield* e.incrBy("ttl:c", 1, { ttlMs: 1e3 }), l(yield* e.setNx("ttl:l", "owner", 1e3)).toBe(!0), l(yield* e.setNx("ttl:l", "other", 1e4)).toBe(!1), l(yield* e.zcard("ttl:z")).toBe(1), yield* n(1100), l(yield* e.zcard("ttl:z")).toBe(0), l(yield* e.hgetAll("ttl:h")).toEqual({}), l(yield* e.smembers("ttl:s")).toEqual([]), l(yield* e.incrBy("ttl:c", 1)).toBe(1), l(yield* e.setNx("ttl:l", "newOwner", 1e3)).toBe(!0);
+		})), d("explicit expiry and deletion are scoped; scans treat glob symbols literally", (e, n) => t.gen(function* () {
 			yield* e.sadd("literal:*?[]a", ["a"]), yield* e.sadd("literal:other", ["a"]);
 			let t = yield* i.runCollect(e.scanPrefix("literal:*?[]"));
-			o(t).toEqual(["literal:*?[]a"]), yield* e.expire("literal:*?[]a", 1e3), yield* n(1100), o(yield* i.runCollect(e.scanPrefix("literal:*?[]"))).toEqual([]), o(yield* e.delete("literal:other")).toBe(!0), o(yield* e.delete("literal:other")).toBe(!1);
-		})), u("scans traverse multiple pages without duplicates or other prefixes", (e) => t.gen(function* () {
+			l(t).toEqual(["literal:*?[]a"]), yield* e.expire("literal:*?[]a", 1e3), yield* n(1100), l(yield* i.runCollect(e.scanPrefix("literal:*?[]"))).toEqual([]), l(yield* e.delete("literal:other")).toBe(!0), l(yield* e.delete("literal:other")).toBe(!1);
+		})), d("scans traverse multiple pages without duplicates or other prefixes", (e) => t.gen(function* () {
 			let t = Array.from({ length: 250 }, (e, t) => `pages:${t}`);
 			yield* e.multi(t.map((e) => ({
 				op: "sadd",
@@ -308,9 +307,9 @@ var c = (c, l) => {
 				members: ["a"]
 			}))), yield* e.sadd("unrelated", ["a"]);
 			let n = yield* i.runCollect(e.scanPrefix("pages:"));
-			o(n.length).toBe(t.length), o([...n].sort()).toEqual([...t].sort());
-		})), u("batch results reflect ordered writes and reads; arguments validate before writes", (e) => t.gen(function* () {
-			o(yield* e.multi([])).toEqual([]), o(yield* e.multi([
+			l(n.length).toBe(t.length), l([...n].sort()).toEqual([...t].sort());
+		})), d("batch results reflect ordered writes and reads; arguments validate before writes", (e) => t.gen(function* () {
+			l(yield* e.multi([])).toEqual([]), l(yield* e.multi([
 				{
 					op: "incrBy",
 					key: "batch:c",
@@ -336,7 +335,7 @@ var c = (c, l) => {
 				5,
 				1,
 				!0
-			]), o(r.isFailure(yield* e.multi([{
+			]), l(r.isFailure(yield* e.multi([{
 				op: "incrBy",
 				key: "untouched",
 				delta: 10
@@ -344,24 +343,23 @@ var c = (c, l) => {
 				op: "expire",
 				key: "bad",
 				ttlMs: -1
-			}]).pipe(t.result))).toBe(!0), o(yield* e.incrBy("untouched", 0)).toBe(0);
-		})), u("wrong types and non-finite/unsafe arguments are typed failures", (e) => t.gen(function* () {
+			}]).pipe(t.result))).toBe(!0), l(yield* e.incrBy("untouched", 0)).toBe(0);
+		})), d("wrong types and non-finite/unsafe arguments are typed failures", (e) => t.gen(function* () {
 			yield* e.sadd("typed", ["a"]);
 			let n = yield* e.zcard("typed").pipe(t.result);
-			o(r.isFailure(n)).toBe(!0), r.isFailure(n) && o(n.failure.reason).toBe("wrongType"), o(r.isFailure(yield* e.incrBy("bad", .5).pipe(t.result))).toBe(!0), o(r.isFailure(yield* e.zadd("bad", [{
+			l(r.isFailure(n)).toBe(!0), r.isFailure(n) && l(n.failure.reason).toBe("wrongType"), l(r.isFailure(yield* e.incrBy("bad", .5).pipe(t.result))).toBe(!0), l(r.isFailure(yield* e.zadd("bad", [{
 				member: "a",
 				score: NaN
-			}]).pipe(t.result))).toBe(!0), o(r.isFailure(yield* e.setNx("bad", "a", 0).pipe(t.result))).toBe(!0), o(r.isFailure(yield* e.tokenBucket("bad", {
+			}]).pipe(t.result))).toBe(!0), l(r.isFailure(yield* e.setNx("bad", "a", 0).pipe(t.result))).toBe(!0), l(r.isFailure(yield* e.tokenBucket("bad", {
 				capacity: 1,
 				refillPerSec: 1
-			}, 2).pipe(t.result))).toBe(!0), o(r.isFailure(yield* e.sadd("\ud800", ["a"]).pipe(t.result))).toBe(!0), o(r.isFailure(yield* e.tokenBucket("bad", {
+			}, 2).pipe(t.result))).toBe(!0), l(r.isFailure(yield* e.sadd("\ud800", ["a"]).pipe(t.result))).toBe(!0), l(r.isFailure(yield* e.tokenBucket("bad", {
 				capacity: 1e300,
 				refillPerSec: 1
-			}).pipe(t.result))).toBe(!0), yield* e.incrBy("safe", 2 ** 53 - 1), o(r.isFailure(yield* e.incrBy("safe", 1).pipe(t.result))).toBe(!0), o(yield* e.incrBy("safe", 0)).toBe(2 ** 53 - 1);
-		})), u("empty writes do not create keys and deleting last members removes structures", (e) => t.gen(function* () {
-			yield* e.zadd("empty:z", []), yield* e.hset("empty:h", {}), yield* e.sadd("empty:s", []), o(yield* i.runCollect(e.scanPrefix("empty:"))).toEqual([]), yield* e.hset("empty:h", { a: "1" }), yield* e.hdel("empty:h", ["a"]), yield* e.sadd("empty:s", ["a"]), yield* e.srem("empty:s", ["a"]), o(yield* i.runCollect(e.scanPrefix("empty:"))).toEqual([]);
+			}).pipe(t.result))).toBe(!0), yield* e.incrBy("safe", 2 ** 53 - 1), l(r.isFailure(yield* e.incrBy("safe", 1).pipe(t.result))).toBe(!0), l(yield* e.incrBy("safe", 0)).toBe(2 ** 53 - 1);
+		})), d("empty writes do not create keys and deleting last members removes structures", (e) => t.gen(function* () {
+			yield* e.zadd("empty:z", []), yield* e.hset("empty:h", {}), yield* e.sadd("empty:s", []), l(yield* i.runCollect(e.scanPrefix("empty:"))).toEqual([]), yield* e.hset("empty:h", { a: "1" }), yield* e.hdel("empty:h", ["a"]), yield* e.sadd("empty:s", ["a"]), yield* e.srem("empty:s", ["a"]), l(yield* i.runCollect(e.scanPrefix("empty:"))).toEqual([]);
 		}));
 	});
 };
-//#endregion
-export { c as hotStoreConformance };
+export { a as hotStoreConformance };

package/dist/nativeRedisReads.js

@@ -1,6 +1,6 @@
 import { createNativeRedisConnection as e, disconnectNativeRedis as t, nativeRedisTopology as n } from "./nativeRedisTopology.js";
 import { measuredRedisReader as r } from "./redisReadPolicy.js";
-//#region src/nativeRedisReads.ts
+// src/nativeRedisReads.ts
 var i = () => {
 	throw Error("No confirmed native Redis reader is available");
 }, a = (e, t, n) => {
@@ -61,7 +61,7 @@ var i = () => {
 			} else {
 				if (await e.client.ping() !== "PONG" && i(), e !== s) {
 					let [t, n] = await Promise.all([s.client.info("replication"), e.client.info("replication")]), r = (e, t) => e.split(/\r?\n/).find((e) => e.startsWith(t + ":"))?.slice(t.length + 1);
-					(r(n, "role") !== "slave" || r(n, "master_link_status") !== "up" || !r(t, "master_replid") || r(t, "master_replid") !== r(n, "master_replid")) && i();
+					r(n, "role") === "slave" && r(n, "master_link_status") === "up" && r(t, "master_replid") && r(t, "master_replid") === r(n, "master_replid") || i();
 				}
 				Number(await e.client.call("eval_ro", "return 1", 0)) !== 1 && i();
 			}
@@ -74,5 +74,4 @@ var i = () => {
 		throw await p(), e;
 	}
 };
-//#endregion
 export { o as nativeRedisReadConfigs, s as openNativeRedisReaders, a as selectNativeReadNode };

package/dist/nativeRedisTopology.js

@@ -1,49 +1,50 @@
 import { connectionMetadataProblem as e, redisTimeoutsProblem as t } from "./connectionDefinitions.js";
-//#region src/nativeRedisTopology.ts
-var n = (e) => {
+import { missingDriver as n } from "./driverModule.js";
+// src/nativeRedisTopology.ts
+var r = (e) => {
 	throw Error(`Invalid native Redis topology: ${e}`);
-}, r = (e) => !/^\d+$/.test(e) || !Number.isSafeInteger(Number(e)) ? n("database must be a nonnegative integer") : Number(e), i = (i) => {
-	let a = t(i, i.driver);
-	if (a) return n(a);
+}, i = (e) => !/^\d+$/.test(e) || !Number.isSafeInteger(Number(e)) ? r("database must be a nonnegative integer") : Number(e), a = (n) => {
+	let a = t(n, n.driver);
+	if (a) return r(a);
 	try {
-		let t = e(i);
-		if (t) return n(t);
-		if (typeof i.url != "string" || !i.url.trim()) return n("URL is required");
-		if (i.url !== i.url.trim()) return n("URL must not contain surrounding whitespace");
-		if (i.cluster !== void 0 && typeof i.cluster != "boolean") return n("cluster must be boolean");
-		let a = /^([a-z][a-z\d+.-]*):\/\/([^/?#]+)(.*)$/i.exec(i.url);
-		if (!a) return n("URL must declare a native Redis scheme and endpoint");
+		let t = e(n);
+		if (t) return r(t);
+		if (typeof n.url != "string" || !n.url.trim()) return r("URL is required");
+		if (n.url !== n.url.trim()) return r("URL must not contain surrounding whitespace");
+		if (n.cluster !== void 0 && typeof n.cluster != "boolean") return r("cluster must be boolean");
+		let a = /^([a-z][a-z\d+.-]*):\/\/([^/?#]+)(.*)$/i.exec(n.url);
+		if (!a) return r("URL must declare a native Redis scheme and endpoint");
 		let o = a[1].toLowerCase(), s = o === "redis+cluster" || o === "rediss+cluster", c = o === "redis+sentinel" || o === "rediss+sentinel";
-		if (!s && !c && o !== "redis" && o !== "rediss") return n("scheme is not native Redis");
-		if (s && i.cluster === !1) return n("cluster URL conflicts with cluster: false");
-		if (c && i.cluster === !0) return n("Sentinel URL conflicts with cluster: true");
+		if (!s && !c && o !== "redis" && o !== "rediss") return r("scheme is not native Redis");
+		if (s && n.cluster === !1) return r("cluster URL conflicts with cluster: false");
+		if (c && n.cluster === !0) return r("Sentinel URL conflicts with cluster: true");
 		let l = o.startsWith("rediss");
-		if (i.tls === "required" && !l) return n("TLS requires a secure Redis scheme");
-		let u = s || i.cluster === !0, d = a[2], f = d.lastIndexOf("@"), p = f < 0 ? "" : d.slice(0, f + 1), m = (f < 0 ? d : d.slice(f + 1)).split(",");
-		if (!u && !c && m.length !== 1) return n("standalone URL must contain one endpoint");
+		if (n.tls === "required" && !l) return r("TLS requires a secure Redis scheme");
+		let u = s || n.cluster === !0, d = a[2], f = d.lastIndexOf("@"), p = f < 0 ? "" : d.slice(0, f + 1), m = (f < 0 ? d : d.slice(f + 1)).split(",");
+		if (!u && !c && m.length !== 1) return r("standalone URL must contain one endpoint");
 		let h = m.map((e) => {
-			if (!e) return n("endpoint list contains an empty entry");
+			if (!e) return r("endpoint list contains an empty entry");
 			let t = new URL(`redis://${e}`);
-			if (t.username || t.password || t.pathname !== "" || t.search || t.hash || !t.hostname || /\s|%/.test(t.hostname)) return n("endpoint shape is invalid");
-			let r = t.port ? Number(t.port) : c ? 26379 : 6379;
-			return !Number.isInteger(r) || r < 1 || r > 65535 ? n("endpoint port is invalid") : {
+			if (t.username || t.password || t.pathname !== "" || t.search || t.hash || !t.hostname || /\s|%/.test(t.hostname)) return r("endpoint shape is invalid");
+			let n = t.port ? Number(t.port) : c ? 26379 : 6379;
+			return !Number.isInteger(n) || n < 1 || n > 65535 ? r("endpoint port is invalid") : {
 				host: t.hostname.replace(/^\[|\]$/g, ""),
-				port: r
+				port: n
 			};
 		}), g = new URL(`redis://${p}${m[0]}${a[3]}`);
-		if (g.hash) return n("URL fragments are not permitted");
+		if (g.hash) return r("URL fragments are not permitted");
 		let _ = decodeURIComponent(g.username), v = decodeURIComponent(g.password), y = c ? [
 			"db",
 			"sentinelUsername",
 			"sentinelPassword"
 		] : ["db"];
-		for (let e of g.searchParams.keys()) if (!y.includes(e) || g.searchParams.getAll(e).length !== 1) return n("query parameter is unknown or repeated");
+		for (let e of g.searchParams.keys()) if (!y.includes(e) || g.searchParams.getAll(e).length !== 1) return r("query parameter is unknown or repeated");
 		if (!u && !c) {
-			let e = g.pathname === "" || g.pathname === "/" ? void 0 : r(g.pathname.slice(1)), t = g.searchParams.get("db");
-			return t !== null && e !== void 0 && r(t) !== e ? n("database declarations conflict") : {
+			let e = g.pathname === "" || g.pathname === "/" ? void 0 : i(g.pathname.slice(1)), t = g.searchParams.get("db");
+			return t !== null && e !== void 0 && i(t) !== e ? r("database declarations conflict") : {
 				kind: "standalone",
-				url: i.url,
-				db: t === null ? e ?? 0 : r(t)
+				url: n.url,
+				db: t === null ? e ?? 0 : i(t)
 			};
 		}
 		let b = {
@@ -52,15 +53,15 @@ var n = (e) => {
 			...l ? { tls: {} } : {}
 		}, x = [...new Map(h.map((e) => [JSON.stringify([e.host, e.port]), e])).values()];
 		if (u) {
-			let e = g.pathname === "" || g.pathname === "/" ? 0 : r(g.pathname.slice(1)), t = g.searchParams.get("db");
-			return e !== 0 || t !== null && r(t) !== 0 ? n("Cluster requires database zero") : {
+			let e = g.pathname === "" || g.pathname === "/" ? 0 : i(g.pathname.slice(1)), t = g.searchParams.get("db");
+			return e !== 0 || t !== null && i(t) !== 0 ? r("Cluster requires database zero") : {
 				kind: "cluster",
 				nodes: x,
 				options: b
 			};
 		}
 		let S = decodeURIComponent(g.pathname.slice(1));
-		if (!S || /[\s/\\?#]/.test(S)) return n("Sentinel requires one master group name");
+		if (!S || /[\s/\\?#]/.test(S)) return r("Sentinel requires one master group name");
 		let C = g.searchParams.get("sentinelUsername"), w = g.searchParams.get("sentinelPassword"), T = g.searchParams.get("db");
 		return {
 			kind: "sentinel",
@@ -68,7 +69,7 @@ var n = (e) => {
 			name: S,
 			options: {
 				...b,
-				db: T === null ? 0 : r(T),
+				db: T === null ? 0 : i(T),
 				...C === null ? {} : { sentinelUsername: C },
 				...w === null ? {} : { sentinelPassword: w },
 				...l ? {
@@ -79,9 +80,9 @@ var n = (e) => {
 		};
 	} catch (e) {
 		if (e instanceof Error && e.message.startsWith("Invalid native Redis topology:")) throw e;
-		return n("URL or encoded component is invalid");
+		return r("URL or encoded component is invalid");
 	}
-}, a = (e, t = "master") => {
+}, o = (e, t = "master") => {
 	let n = /* @__PURE__ */ new WeakMap(), r = () => /* @__PURE__ */ Error("Native Redis Cluster sockets are not confirmed"), i = (e) => {
 		if (e.status === "ready") return Promise.resolve();
 		let t = n.get(e);
@@ -116,7 +117,7 @@ var n = (e) => {
 		let a = e.nodes(t);
 		if (e.status !== "ready" || a.length !== n.length || a.some((e) => e.status !== "ready" || !n.includes(e))) throw r();
 	};
-}, o = (e, t) => {
+}, s = (e, t) => {
 	let n = 0, r, i = () => /* @__PURE__ */ Error("Native Redis database is not confirmed");
 	return t !== 0 && (e.on("close", () => {
 		n++, r = void 0;
@@ -136,7 +137,7 @@ var n = (e) => {
 		let n = r;
 		if (e.status !== "ready" || t !== 0 && n === void 0 || (await n, e.status !== "ready" || r !== n)) throw i();
 	};
-}, s = (e) => {
+}, c = (e) => {
 	let t = (e.kind === "cluster" ? [e.client, ...e.client.nodes("all")] : [e.client]).map((e) => [
 		"end",
 		"wait",
@@ -149,7 +150,8 @@ var n = (e) => {
 		e.once("close", n), e.once("end", n);
 	}));
 	return e.client.status !== "end" && e.client.disconnect(), Promise.all(t).then(() => void 0);
-}, c = (e, t = {}) => ({
+}, l = (e, t = {}) => ({
+	protocol: 2,
 	lazyConnect: !0,
 	autoResendUnfulfilledCommands: !1,
 	maxRetriesPerRequest: 0,
@@ -165,43 +167,43 @@ var n = (e) => {
 		retryStrategy: () => null,
 		sentinelRetryStrategy: () => null
 	} : {}
-}), l = async (e, t = "command", n = "primary", r) => {
-	let s = i(e), l = await import("ioredis"), u = l.default, d = c(t, e);
-	if (s.kind === "cluster") {
-		let e = new l.Cluster([...s.nodes], {
+}), u = async (e, t = "command", r = "primary", i) => {
+	let c = a(e), u = await import("ioredis").catch(n("ioredis", "A Redis connection")), d = u.default, f = l(t, e);
+	if (c.kind === "cluster") {
+		let e = new u.Cluster([...c.nodes], {
 			lazyConnect: !0,
 			enableOfflineQueue: !1,
-			scaleReads: r ?? "master",
+			scaleReads: i ?? "master",
 			retryDelayOnFailover: 0,
 			redisOptions: {
-				...s.options,
-				...d
+				...c.options,
+				...f
 			},
 			...t === "subscriber" ? { clusterRetryStrategy: () => null } : {}
 		});
 		return {
 			kind: "cluster",
 			client: e,
-			ready: a(e, n === "primary" ? "master" : "all")
+			ready: o(e, r === "primary" ? "master" : "all")
 		};
 	}
-	let f = s.kind === "standalone" ? new u(s.url, {
-		...d,
-		db: s.db,
-		.../^rediss:\/\//i.test(s.url) ? { tls: {} } : {}
-	}) : new u({
-		...s.options,
-		...d,
-		name: s.name,
-		sentinels: [...s.nodes],
-		role: n === "primary" ? "master" : "slave"
-	}), p = s.kind === "standalone" ? s.db : s.options.db ?? 0;
+	let p = c.kind === "standalone" ? new d(c.url, {
+		...f,
+		db: c.db,
+		.../^rediss:\/\//i.test(c.url) ? { tls: {} } : {}
+	}) : new d({
+		...c.options,
+		...f,
+		name: c.name,
+		sentinels: [...c.nodes],
+		role: r === "primary" ? "master" : "slave"
+	}), m = c.kind === "standalone" ? c.db : c.options.db ?? 0;
 	return {
-		kind: s.kind,
-		client: f,
-		ready: o(f, p)
+		kind: c.kind,
+		client: p,
+		ready: s(p, m)
 	};
-}, u = async (e, t, n, r) => {
+}, d = async (e, t, n, r) => {
 	if (e.kind !== "cluster") {
 		let [i, a] = await e.client.scan(t, "MATCH", n, "COUNT", r);
 		return {
@@ -217,5 +219,4 @@ var n = (e) => {
 		keys: c
 	};
 };
-//#endregion
-export { l as createNativeRedisConnection, s as disconnectNativeRedis, a as nativeClusterReadiness, o as nativeDatabaseReadiness, c as nativeRedisOptions, i as nativeRedisTopology, u as scanNativeRedis };
+export { u as createNativeRedisConnection, c as disconnectNativeRedis, o as nativeClusterReadiness, s as nativeDatabaseReadiness, l as nativeRedisOptions, a as nativeRedisTopology, d as scanNativeRedis };

package/dist/redisDiagnostics.js

@@ -1,4 +1,4 @@
-//#region src/redisDiagnostics.ts
+// src/redisDiagnostics.ts
 var e = [
 	"noeviction",
 	"allkeys-lru",
@@ -23,5 +23,4 @@ var e = [
 	e.info("memory"),
 	e.config("GET", "save")
 ])).map((e) => e.status === "fulfilled" ? e.value : void 0));
-//#endregion
 export { r as readRedisNodeDiagnostics, n as redisNodeDiagnostics };