feat(combat): add first-class undo and redo controls Add undo and redo controls to the combat UI so the DM can recover from recent actions without leaving the encounter view. Undo and redo operate on the current encounter's combat history. Empty stacks produce clear feedback instead of failing silently. Redo order follows normal stack behavior after multiple undos. This makes combat history actionable during play, not just visible in the log. feat(logs): make combat logs replayable Replace plain combat log messages with structured combat events that can be used by the UI, exported as JSON, replayed, and verified. Each new log entry records the action type, encounter identity, participant identity, a small action delta, undo intent, and a turn snapshot. Download and copy now export the event stream as JSON so a saved combat log is useful for offline analysis and debugging. Legacy logs remain viewable, but new logs use the structured event format. feat(logs): make undo and redo transactional Apply undo and redo as single storage operations so the encounter state and log state cannot drift apart. Server storage applies the encounter update and the log undone flag inside one SQLite transaction. Firebase storage uses a batch write for the same behavior. The storage contract now includes undo/redo semantics. This replaces fragile multi-write undo behavior where a failure could update the encounter without marking the log, or mark the log without updating the encounter. feat(combat): add unified replay and verification tool Add one combat CLI for replaying live combat and verifying combat logs. Replay drives the live backend through the same shared combat logic used by the app, writes a JSON event log to an explicit output path, and automatically verifies the result. Verification checks for DM-visible combat problems such as skipped turns, double actions, bad round changes, and unexpected turn order changes. The tool uses the same JSON event stream produced by log downloads, supports verbose turn output, and handles Ctrl-C by ending the encounter, writing the partial log, and verifying what was captured. fix(perf): keep long combat logging fast Remove the combat-time log query bottleneck that made long replays slow as log volume grew. Combat controls no longer subscribe to the log collection just to keep undo and redo state warm. Undo and redo now query the latest matching encounter log only when clicked. Server collection queries support exact filters, ordering, limits, and offsets, and SQLite indexes keep latest-log and per-encounter log lookups fast. Also fix duplicate WebSocket handler registration so realtime updates do not double-fire under write load. fix(turns): make toggle active a status change Make toggle active a roster/status edit instead of a turn advance. Deactivating the current participant no longer passes the turn or increments the round. The current turn stays where it is until the DM explicitly clicks Next Turn, and Next Turn skips inactive participants during normal rotation. This matches the initiative design: slot order is stable, toggle active does not move participants, and round changes only come from explicit turn advance. chore(ci): make warnings and hangs fail fast Tighten test and build checks so failures are visible instead of noisy or silent. Builds run with CI enabled so warnings fail production builds. The full test command runs app, shared, and server suites with hard timeouts so hangs fail quickly. Static eslint coverage fails on warnings as well as errors. Tests were updated around the new async combat logging flow, structured log events, transactional undo, replay verification, and toggle-active semantics.
127 lines
5.3 KiB
JavaScript
127 lines
5.3 KiB
JavaScript
// INVARIANT test: ONE list. turnOrderIds === participants.map(id) always.
|
|
// No re-sort after startEncounter. nextTurn follows list order, skipping inactive.
|
|
// Drag (reorder) overrides initiative — cross-init drag allowed + reflected.
|
|
// Display === rotation by construction (same array).
|
|
//
|
|
// RED now: current code has two lists (sort on display, frozen turnOrderIds),
|
|
// reorder throws on cross-init. Refactor (1-list model) greens these.
|
|
//
|
|
// New API: mutating funcs are async, take ctx last, write encounter + log
|
|
// internally, return newEnc. Chained calls become `e = await fn(e, ctx)`.
|
|
// No-ops (reorder blocked) return the same enc ref.
|
|
|
|
'use strict';
|
|
|
|
const shared = require('@ttrpg/shared');
|
|
const {
|
|
makeParticipant,
|
|
startEncounter, nextTurn, addParticipant, removeParticipant,
|
|
toggleParticipantActive, togglePause, applyHpChange,
|
|
reorderParticipants, endEncounter,
|
|
} = shared;
|
|
const { mockCtx } = require('./_helpers');
|
|
|
|
function p(id, init, extra = {}) {
|
|
return makeParticipant({ id, name: id, type: 'monster',
|
|
initiative: init, maxHp: 100, currentHp: 100, ...extra });
|
|
}
|
|
function enc(ps, extra = {}) {
|
|
return { name:'t', participants:ps, isStarted:false, isPaused:false,
|
|
round:0, currentTurnParticipantId:null, turnOrderIds:[], ...extra };
|
|
}
|
|
|
|
describe('1-list model: turnOrderIds === participants.map(id), no re-sort', () => {
|
|
test('startEncounter: list = sorted-active participants order', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',3),p('b',10),p('c',5)]);
|
|
e = await startEncounter(e, ctx);
|
|
expect(e.turnOrderIds).toEqual(['b','c','a']); // 10,5,3
|
|
expect(e.turnOrderIds).toEqual(e.participants.map(x => x.id));
|
|
});
|
|
|
|
test('startEncounter: inactive stays in list slot (skipped by nextTurn)', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10),p('b',5,{isActive:false}),p('c',3)]);
|
|
e = await startEncounter(e, ctx);
|
|
// 1-list: inactive b stays in slot, nextTurn skips it
|
|
expect(e.turnOrderIds).toEqual(['a','b','c']);
|
|
expect(e.turnOrderIds).toEqual(e.participants.map(x => x.id));
|
|
expect(e.currentTurnParticipantId).toBe('a'); // b inactive, skipped on start
|
|
});
|
|
|
|
test('addParticipant mid-encounter: inserted by init, list synced', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10),p('c',3)]);
|
|
e = await startEncounter(e, ctx); // [a,c]
|
|
e = await addParticipant(e, p('b',7), ctx); // insert between a,c
|
|
expect(e.turnOrderIds).toEqual(['a','b','c']);
|
|
expect(e.turnOrderIds).toEqual(e.participants.map(x => x.id));
|
|
});
|
|
|
|
test('addParticipant: list === participants.map(id) after add', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10)]);
|
|
e = await startEncounter(e, ctx);
|
|
e = await addParticipant(e, p('b',5), ctx);
|
|
expect(e.turnOrderIds).toEqual(e.participants.map(x => x.id));
|
|
});
|
|
|
|
test('removeParticipant: list synced, order preserved', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10),p('b',7),p('c',3)]);
|
|
e = await startEncounter(e, ctx);
|
|
e = await removeParticipant(e, 'b', ctx);
|
|
expect(e.turnOrderIds).toEqual(['a','c']);
|
|
expect(e.turnOrderIds).toEqual(e.participants.map(x => x.id));
|
|
});
|
|
|
|
test('reorder cross-init: blocked (no-op)', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10),p('b',7),p('c',3)]);
|
|
e = await startEncounter(e, ctx); // [a,b,c]
|
|
const newEnc = await reorderParticipants(e, 'c', 'a', ctx); // cross-init
|
|
expect(newEnc).toBe(e); // same ref = no write
|
|
expect(e.turnOrderIds).toEqual(['a','b','c']); // unchanged
|
|
});
|
|
|
|
test('reorder same-init: within upcoming side of pointer follows new order', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10),p('b',10),p('c',10),p('d',3)]); // a,b,c tie
|
|
e = await startEncounter(e, ctx); // [a,b,c,d], cur=a (idx0)
|
|
// Reorder c before b (both upcoming idx1,2). Within same side = allowed.
|
|
e = await reorderParticipants(e, 'c', 'b', ctx); // [a,c,b,d], cur=a
|
|
expect(e.turnOrderIds).toEqual(['a','c','b','d']);
|
|
// walk: a current, next c, next b, next d, wrap a
|
|
e = await nextTurn(e, ctx);
|
|
expect(e.currentTurnParticipantId).toBe('c');
|
|
});
|
|
|
|
test('toggle inactive: list unchanged (stays in rotation slot)', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10),p('b',7),p('c',3)]);
|
|
e = await startEncounter(e, ctx); // [a,b,c]
|
|
e = await toggleParticipantActive(e, 'b', ctx); // b off
|
|
expect(e.turnOrderIds).toEqual(['a','b','c']); // b stays in slot
|
|
});
|
|
|
|
test('toggle inactive: nextTurn skips b, visits a→c', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10),p('b',7),p('c',3)]);
|
|
e = await startEncounter(e, ctx); // cur=a
|
|
e = await toggleParticipantActive(e, 'b', ctx); // b inactive
|
|
e = await nextTurn(e, ctx); // skip b → c
|
|
expect(e.currentTurnParticipantId).toBe('c');
|
|
});
|
|
|
|
test('hp death + revive: list unchanged', async () => {
|
|
const { ctx } = mockCtx();
|
|
let e = enc([p('a',10),p('b',7),p('c',3)]);
|
|
e = await startEncounter(e, ctx);
|
|
e = await applyHpChange(e, 'b', 'damage', 100, ctx); // b dies
|
|
expect(e.turnOrderIds).toEqual(['a','b','c']);
|
|
e = await applyHpChange(e, 'b', 'heal', 50, ctx); // b revive
|
|
expect(e.turnOrderIds).toEqual(['a','b','c']);
|
|
expect(e.turnOrderIds).toEqual(e.participants.map(x => x.id));
|
|
});
|
|
});
|