mergeTimelineRuns read an entry's time again on every comparison, and the
vessel layer passed a new arrow for every vessel. Times are now read once
into arrays, the leading older entries the loop would keep one by one are
sliced in one step, and the layer passes one function. The result is the
same entries in the same order; a test checks 3,000 random merges against
the previous algorithm.
Measured in the browser, one implementation per page, 9,000 vessels with
240 kept fixes each, 5 alternating pairs: 65-87 ms -> 57-61 ms per snapshot.
A snapshot timeline may declare spanMs: each record of a snapshot at a
time then carries its own fixes from spanMs before the time to spanMs
after it. Flights, military flights and vessels following the clock are
placed on those fixes, so a seek or a move back within the fixes loaded
is no jump: nothing is cleared and play does not wait. The step there is
asked for once and stands in for every contact; those it has keep their
place. Fixes are merged across snapshots at least 20 s apart, at most
240 a contact, and a contact is not drawn more than a minute before its
first fix.