Turns a walk of packet timestamps into the timing facts, in ticks.
Decode order is not presentation order, so the table is sorted before its
gaps are read. A walk that stopped at the cap has read every packet up to a
decode position and no further, which leaves the tail of the sorted table
missing frames that sit between ones it did read; the deepest reordering seen
bounds how much of that tail is untrustworthy, and it is dropped. A walk that
ran to the end of the track has no such tail.
Turns a walk of packet timestamps into the timing facts, in ticks.
Decode order is not presentation order, so the table is sorted before its gaps are read. A walk that stopped at the cap has read every packet up to a decode position and no further, which leaves the tail of the sorted table missing frames that sit between ones it did read; the deepest reordering seen bounds how much of that tail is untrustworthy, and it is dropped. A walk that ran to the end of the track has no such tail.