Reduce entries, optionally filtered by a set of keys.
For time-travel progressive view: pass the keys visible at the
current slider position. Without keys, reduces all entries (same
as aggregate).
Clear all stored data. Recorders typically call this from their own
clear() method, which the executor invokes before each run.
Remove an entry. Returns true if the key existed, false otherwise.
Return entries whose keys are in the set, preserving insertion order.
All entries as a read-only Map (insertion-ordered).
True if a value exists for the key.
Store a single entry. Replaces any existing entry for the same key.
All values as an array (insertion-ordered).
KeyedStore — concrete, composable 1:1 storage keyed by string id.
Pattern: COMPOSITION primitive. Concrete class — instantiate with
new KeyedStore<T>()and own it as a field on your recorder. Replaces the abstractKeyedRecorder<T>base class for the v5 "one purpose per recorder" rule. Role: 1:1 Map keyed byruntimeStageId(or any string). Insertion-ordered iteration.Contrast with
SequenceStore<T>: KeyedStore is 1:1 — one entry per key. Use SequenceStore for 1:N (multiple entries per runtimeStageId, ordering matters).Example