Rebasely Beta: data may be purged

justintypescript-ultra-strict Public

JavaScript · 139 lines · 3.8 KiB · at 9c48a39

import { test } from "node:test";import assert from "node:assert/strict";import { h, load } from "../../lib/harness.mjs";const { createLru } = await load();const make = (capacity) => h.okOf(h.res(() => createLru(capacity)));const get = (cache, key) => h.opt(cache.get(key));const some = (value) => ({ some: true, value });const none = { some: false };test("set then get, missing key is absent", () => {  const c = make(2);  c.set("a", 1);  assert.deepEqual(get(c, "a"), some(1));  assert.deepEqual(get(c, "b"), none);  assert.equal(c.size(), 1);});test("falsy values are stored and returned", () => {  const c = make(5);  c.set("zero", 0);  c.set("empty", "");  c.set("no", false);  assert.deepEqual(get(c, "zero"), some(0));  assert.deepEqual(get(c, "empty"), some(""));  assert.deepEqual(get(c, "no"), some(false));  assert.equal(c.size(), 3);});test("evicts the least recently used entry", () => {  const c = make(2);  c.set("a", 1);  c.set("b", 2);  c.set("c", 3);  assert.deepEqual(get(c, "a"), none);  assert.deepEqual(get(c, "b"), some(2));  assert.deepEqual(get(c, "c"), some(3));  assert.equal(c.size(), 2);});test("get refreshes recency, including for a falsy value", () => {  const c = make(2);  c.set("a", 0);  c.set("b", 1);  assert.deepEqual(get(c, "a"), some(0));  c.set("c", 2);  assert.deepEqual(get(c, "b"), none);  assert.deepEqual(get(c, "a"), some(0));  assert.deepEqual(c.keys(), ["a", "c"]);});test("get of a missing key changes nothing", () => {  const c = make(2);  c.set("a", 1);  c.set("b", 2);  assert.deepEqual(get(c, "zzz"), none);  assert.deepEqual(c.keys(), ["b", "a"]);  assert.equal(c.size(), 2);});test("set on an existing key updates, refreshes, and does not evict", () => {  const c = make(2);  c.set("a", 1);  c.set("b", 2);  c.set("a", 10);  assert.equal(c.size(), 2);  assert.deepEqual(c.keys(), ["a", "b"]);  assert.deepEqual(get(c, "b"), some(2));  assert.deepEqual(get(c, "a"), some(10));  c.set("c", 3);  assert.deepEqual(get(c, "b"), none);});test("capacity 0 stores nothing", () => {  const c = make(0);  c.set("a", 1);  assert.deepEqual(get(c, "a"), none);  assert.equal(c.size(), 0);  assert.deepEqual(c.keys(), []);  assert.equal(c.delete("a"), false);});test("capacity 1 keeps only the newest key", () => {  const c = make(1);  c.set("a", 1);  c.set("b", 2);  assert.deepEqual(get(c, "a"), none);  assert.deepEqual(get(c, "b"), some(2));  assert.deepEqual(c.keys(), ["b"]);});test("invalid capacity fails at creation", () => {  for (const cap of [-1, 1.5, Number.NaN, Number.POSITIVE_INFINITY]) {    assert.deepEqual(h.res(() => createLru(cap)), { ok: false, error: { kind: "invalid_capacity" } }, `capacity ${cap}`);  }});test("delete reports presence, including for falsy values", () => {  const c = make(3);  c.set("a", false);  c.set("b", 0);  assert.equal(c.delete("a"), true);  assert.equal(c.delete("a"), false);  assert.equal(c.delete("missing"), false);  assert.deepEqual(get(c, "a"), none);  assert.equal(c.size(), 1);  c.set("c", 1);  c.set("d", 2);  assert.deepEqual(c.keys(), ["d", "c", "b"]);});test("keys returns a fresh array", () => {  const c = make(3);  c.set("a", 1);  c.set("b", 2);  const ks = c.keys();  ks.push("x");  ks.reverse();  assert.deepEqual(c.keys(), ["b", "a"]);  assert.deepEqual(make(3).keys(), []);});test("keys that collide with object prototype names", () => {  const c = make(3);  assert.deepEqual(get(c, "constructor"), none);  assert.deepEqual(get(c, "toString"), none);  assert.equal(c.delete("hasOwnProperty"), false);  c.set("constructor", 7);  assert.deepEqual(get(c, "constructor"), some(7));  assert.equal(c.size(), 1);});test("separate caches do not share state", () => {  const a = make(2);  const b = make(2);  a.set("k", 1);  assert.deepEqual(get(b, "k"), none);  assert.equal(b.size(), 0);});