summaryrefslogtreecommitdiff
path: root/anim/test/column_sort.script
diff options
context:
space:
mode:
authorGabriel Schneider <[email protected]>2026-11-10 11:46:18 -0300
committerGabriel Schneider <[email protected]>2026-11-10 11:47:26 -0300
commit5f1f95098611b077bd7e0ca27283fa0e02d1adbc (patch)
tree59385d79fa57e94bbaa489fbef0b8c5abc88c500 /anim/test/column_sort.script
parent233d9cf30b178501e3194297434791b6de35eff2 (diff)
downloadcomputeranim-5f1f95098611b077bd7e0ca27283fa0e02d1adbc.tar.gz
computeranim-5f1f95098611b077bd7e0ca27283fa0e02d1adbc.zip
recorder: a moment is its events, state is at keyframes
Folding every event into persistent state at every moment cost 750 bytes a step and 2 KB a scattered 8-byte write: the tree's path copied each time. Now a moment stores its events alone, in a compact code (a flags byte, varints, time as a difference, registers as the ones that changed), and the state (threads, memory, heap, variables, mappings, strings) is written at a keyframe a batch, sharing with the one before. A reader replays at most a batch over a keyframe, and keeps four positions replayed, so playing forward reads one moment a step. Of a memory write the recorder keeps the spans that differ from what it holds, so a region read again costs what changed in it. It stops at max_bytes (1 GiB). A step with registers: 749 bytes to 57. fib(12) by instruction, 142 000 moments: 111 MB to 8 MB, 197 000 moments/s. bench-store measures the rest.
Diffstat (limited to 'anim/test/column_sort.script')
0 files changed, 0 insertions, 0 deletions