The new reader app replaces the old UI: Checklist with a rail (focus pills, Next to expire, today's dailies, pinned routines), Timeline in a new and a classic look, Routines, Archive and a Settings area, in a Structured (default) and a Relaxed interface. It follows the approved Round 6 B and Round 7 mockups, corrected screen by screen with the owner. Reader data moves to a v2 store (gacha-tracker:v2:*). Existing v1 data is migrated on first load, a recovery copy is written first, and the v1 keys are never removed, so a rollback finds them unchanged. Redeem codes for Genshin arrive as their own feed. Also: live's urgency ramp, editable per theme; completion and section-complete fireworks; a returning-user tour; the design mockups, specs, plans, reviews and handoff record. Co-Authored-By: Claude Opus 5.5 <[email protected]>
91 lines
2.9 KiB
TypeScript
91 lines
2.9 KiB
TypeScript
import { expect, test } from "bun:test";
|
|
import {
|
|
deleteManualBackup,
|
|
MANUAL_BACKUP_BYTES,
|
|
MANUAL_BACKUP_LIMIT,
|
|
readBackups,
|
|
readManualBackups,
|
|
saveBackup,
|
|
saveManualBackup,
|
|
} from "../src/client/state/reader/backups.ts";
|
|
import { migrateLegacy } from "../src/client/state/reader/migration.ts";
|
|
import { READER_KEYS } from "../src/client/state/reader/schema.ts";
|
|
|
|
const memory = (): Storage => {
|
|
const m = new Map<string, string>();
|
|
return {
|
|
get length() {
|
|
return m.size;
|
|
},
|
|
key: (i) => [...m.keys()][i] ?? null,
|
|
getItem: (k) => m.get(k) ?? null,
|
|
setItem: (k, v) => void m.set(k, String(v)),
|
|
removeItem: (k) => void m.delete(k),
|
|
clear: () => m.clear(),
|
|
};
|
|
};
|
|
const at = "2026-10-17T12:00:00.000Z";
|
|
const state = migrateLegacy({}, ["genshin"], at, () => "account:one");
|
|
|
|
test("Back up now keeps its own list and never replaces the day's automatic snapshot", () => {
|
|
const storage = memory();
|
|
saveBackup(storage, state, at);
|
|
const automatic = readBackups(storage);
|
|
expect(saveManualBackup(storage, state, "2026-10-17T13:00:00.000Z").ok).toBe(
|
|
true,
|
|
);
|
|
expect(saveManualBackup(storage, state, "2026-10-17T14:00:00.000Z").ok).toBe(
|
|
true,
|
|
);
|
|
expect(readBackups(storage)).toEqual(automatic);
|
|
const manual = readManualBackups(storage);
|
|
expect(manual.map((b) => b.at)).toEqual([
|
|
"2026-10-17T14:00:00.000Z",
|
|
"2026-10-17T13:00:00.000Z",
|
|
]);
|
|
expect(storage.getItem(READER_KEYS.manualBackups)).not.toBeNull();
|
|
});
|
|
|
|
test("a manual backup can be deleted, and the list has a cap", () => {
|
|
const storage = memory();
|
|
saveManualBackup(storage, state, at);
|
|
const [only] = readManualBackups(storage);
|
|
expect(deleteManualBackup(storage, only!.id).ok).toBe(true);
|
|
expect(readManualBackups(storage)).toEqual([]);
|
|
for (let i = 0; i < MANUAL_BACKUP_LIMIT; i++)
|
|
expect(
|
|
saveManualBackup(
|
|
storage,
|
|
state,
|
|
new Date(Date.parse(at) + i).toISOString(),
|
|
).ok,
|
|
).toBe(true);
|
|
const full = saveManualBackup(storage, state, "2026-10-18T00:00:00.000Z");
|
|
expect(full).toEqual({ ok: false, reason: "full" });
|
|
expect(readManualBackups(storage)).toHaveLength(MANUAL_BACKUP_LIMIT);
|
|
});
|
|
|
|
test("one unreadable entry does not discard the other manual backups", () => {
|
|
const storage = memory();
|
|
saveManualBackup(storage, state, at);
|
|
const list = JSON.parse(storage.getItem(READER_KEYS.manualBackups)!);
|
|
storage.setItem(
|
|
READER_KEYS.manualBackups,
|
|
JSON.stringify([...list, { id: 1, at: "not a date" }]),
|
|
);
|
|
expect(readManualBackups(storage)).toHaveLength(1);
|
|
});
|
|
|
|
test("the list refuses a copy that would push it past its size budget", () => {
|
|
const storage = memory();
|
|
const big = {
|
|
...state,
|
|
prefs: { ...state.prefs, filler: "x".repeat(MANUAL_BACKUP_BYTES) },
|
|
};
|
|
expect(saveManualBackup(storage, big, at)).toEqual({
|
|
ok: false,
|
|
reason: "full",
|
|
});
|
|
expect(readManualBackups(storage)).toEqual([]);
|
|
});
|