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
..
2016-07-13 17:29:27 +02:00
2016-08-23 07:37:54 -04:00
2016-08-07 13:03:07 -04:00
2016-08-01 18:33:46 -04:00
2016-08-19 00:31:54 -04:00
2016-09-01 17:15:43 +02:00
2016-08-11 12:45:57 +02:00
2016-09-03 12:46:14 +10:00
2016-06-24 10:43:46 +02:00
2016-06-24 10:43:46 +02:00
2016-06-26 00:49:51 -04:00
2016-06-24 10:43:46 +02:00
2016-06-24 10:43:46 +02:00
2016-06-24 10:43:46 +02:00
2016-08-10 12:16:20 -04:00
2015-05-25 13:22:31 +02:00
2016-08-11 12:53:44 +02:00
2016-07-29 15:03:01 +02:00
2016-07-29 15:03:01 +02:00
2016-08-19 11:04:45 +02:00
2016-06-24 10:43:46 +02:00
2016-08-11 12:53:44 +02:00
2016-08-11 12:53:44 +02:00
2016-09-03 12:46:14 +10:00
2016-09-03 12:46:14 +10:00
2016-06-24 10:43:46 +02:00
2016-06-24 10:43:46 +02:00
2016-06-24 10:43:46 +02:00
2016-06-24 10:43:46 +02:00
2016-06-24 10:43:46 +02:00
2016-06-24 10:43:46 +02:00
2016-08-07 01:18:59 -05:00
2016-06-24 10:43:46 +02:00
2016-06-26 12:34:59 +02:00
2016-08-19 23:14:56 -05:00
2016-08-19 23:14:56 -05:00
2016-07-17 22:15:14 -06:00
2016-08-11 12:45:57 +02:00
2016-06-24 10:43:46 +02:00
2016-07-17 22:15:14 -06:00
2016-06-24 10:43:46 +02:00
2016-08-09 23:02:31 -04:00
2016-08-04 15:24:44 -04:00
2016-08-10 16:08:15 +02:00
2016-08-10 16:08:15 +02:00
2016-07-16 22:48:46 +02:00
2016-07-26 02:12:22 +02:00
2016-07-23 20:04:07 +02:00
2016-07-01 13:07:57 +02:00
2016-06-24 10:43:46 +02:00
2016-09-03 12:46:14 +10:00
2016-06-24 10:43:46 +02:00