defmodule Chesstrainer.CacheTest do use ExUnit.Case, async: true alias Chesstrainer.Cache setup context do table = :"test_#{System.unique_integer([:positive])}" {:ok, pid} = Cache.start_link(table, Map.get(context, :cache_opts, [])) on_exit(fn -> if Process.alive?(pid), do: GenServer.stop(pid) end) {:ok, %{pid: pid, table: table}} end describe "basic operations" do test "cache is started", %{pid: pid, table: table} do assert is_pid(pid) assert 0 = Cache.size(table) end test "put/3 and get/2", %{table: table} do assert :ok = Cache.put(table, "key1", "value1") assert {:ok, "value1"} = Cache.get(table, "key1") assert 1 = Cache.size(table) assert :ok = Cache.put(table, "key2", "value2") assert {:ok, "value2"} = Cache.get(table, "key2") assert 2 = Cache.size(table) end test "delete/2", %{table: table} do assert :ok = Cache.put(table, "key1", "value1") assert :ok = Cache.put(table, "key2", "value2") assert 2 = Cache.size(table) assert :ok = Cache.delete(table, "key1") assert 1 = Cache.size(table) assert :error = Cache.get(table, "key1") end end describe "frequency tracking" do test "get/2 increments the entry frequency", %{table: table} do Cache.put(table, "key", "value") Cache.get(table, "key") Cache.get(table, "key") Cache.get(table, "key") assert [{"key", "value", frequency, _last_access}] = Cache.show(table) assert frequency == 4 end end describe "LFU eviction" do @describetag cache_opts: [max_size: 2] test "evicts the least-frequently-used entry on overflow", %{table: table} do Cache.put(table, "hot", "value") for _ <- 1..5, do: Cache.get(table, "hot") Cache.put(table, "cold", "value") Cache.put(table, "new", "value") assert Cache.size(table) == 2 assert {:ok, "value"} = Cache.get(table, "hot") assert :error = Cache.get(table, "cold") assert {:ok, "value"} = Cache.get(table, "new") end test "breaks frequency ties by least-recently-used", %{table: table} do Cache.put(table, "older", "value") Cache.put(table, "newer", "value") Cache.put(table, "newest", "value") assert Cache.size(table) == 2 assert :error = Cache.get(table, "older") assert {:ok, "value"} = Cache.get(table, "newer") assert {:ok, "value"} = Cache.get(table, "newest") end end describe "weekly sweep" do test "halves every entry frequency", %{table: table} do Cache.put(table, "busy", "value") for _ <- 1..5, do: Cache.get(table, "busy") Cache.put(table, "idle", "value") Chesstrainer.Cache.Sweep.halve_frequencies(table) frequencies = Map.new(Cache.show(table), fn {k, _v, f, _t} -> {k, f} end) assert frequencies["busy"] == 3 assert frequencies["idle"] == 0 end end describe "persistence" do test "backup and restore preserve frequencies" do table = :"test_persist_#{System.unique_integer([:positive])}" backup = Path.join("priv/static/backups", "#{table}.v2.det") on_exit(fn -> File.rm(backup) end) {:ok, pid} = Cache.start_link(table) Cache.put(table, "key", "value") Cache.get(table, "key") Cache.get(table, "key") assert :ok = Cache.backup(table) assert :ok = GenServer.stop(pid) {:ok, restored_pid} = Cache.start_link(table) on_exit(fn -> if Process.alive?(restored_pid), do: GenServer.stop(restored_pid) end) assert [{"key", "value", frequency, _last_access}] = Cache.show(table) assert frequency == 3 end end end