EmptyChaos 17c34ae0b1 CoreTiming: Data structure cleanup ...

Replace adhoc linked list with a priority heap. Performance
characteristics are mostly the same, but is more cache friendly.

[Priority Queues have O(log n) push/pop compared to the linked
list's O(n) push/O(1) pop but the queue is not big enough for
that to matter, so linear is faster over linked. Very slight gains
when framelimit is unlimited (Wind Waker), 1900% -> 1950%]

2016-09-03 12:46:14 +10:00

9.3 KiB

Raw Blame History

View Raw