mirror of
https://github.com/Sendouc/sendou.ink.git
synced 2026-06-20 19:43:49 -05:00
68 lines
1.7 KiB
TypeScript
68 lines
1.7 KiB
TypeScript
import { describe, expect, it } from "vitest";
|
|
import { LRUCache } from "./index";
|
|
|
|
describe("LRUCache", () => {
|
|
it("stores and retrieves values", () => {
|
|
const cache = new LRUCache<string, number>({ max: 2 });
|
|
cache.set("a", 1);
|
|
|
|
expect(cache.get("a")).toBe(1);
|
|
expect(cache.has("a")).toBe(true);
|
|
});
|
|
|
|
it("returns undefined for missing keys", () => {
|
|
const cache = new LRUCache<string, number>({ max: 2 });
|
|
|
|
expect(cache.get("missing")).toBeUndefined();
|
|
expect(cache.has("missing")).toBe(false);
|
|
});
|
|
|
|
it("evicts the least recently used entry once over capacity", () => {
|
|
const cache = new LRUCache<string, number>({ max: 2 });
|
|
cache.set("a", 1);
|
|
cache.set("b", 2);
|
|
cache.set("c", 3);
|
|
|
|
expect(cache.has("a")).toBe(false);
|
|
expect(cache.get("b")).toBe(2);
|
|
expect(cache.get("c")).toBe(3);
|
|
});
|
|
|
|
it("counts reads as recent use", () => {
|
|
const cache = new LRUCache<string, number>({ max: 2 });
|
|
cache.set("a", 1);
|
|
cache.set("b", 2);
|
|
cache.get("a");
|
|
cache.set("c", 3);
|
|
|
|
expect(cache.has("a")).toBe(true);
|
|
expect(cache.has("b")).toBe(false);
|
|
});
|
|
|
|
it("updates value without growing past capacity on re-set", () => {
|
|
const cache = new LRUCache<string, number>({ max: 2 });
|
|
cache.set("a", 1);
|
|
cache.set("a", 2);
|
|
|
|
expect(cache.get("a")).toBe(2);
|
|
});
|
|
|
|
it("deletes a single entry", () => {
|
|
const cache = new LRUCache<string, number>({ max: 2 });
|
|
cache.set("a", 1);
|
|
cache.delete("a");
|
|
|
|
expect(cache.has("a")).toBe(false);
|
|
});
|
|
|
|
it("clears all entries", () => {
|
|
const cache = new LRUCache<string, number>({ max: 2 });
|
|
cache.set("a", 1);
|
|
cache.set("b", 2);
|
|
cache.clear();
|
|
|
|
expect(cache.has("a")).toBe(false);
|
|
expect(cache.has("b")).toBe(false);
|
|
});
|
|
});
|