Branch :
| Author | Commit | Date | CI | Message |
|---|---|---|---|---|
| 8e43e3a8 | 2023-04-22 10:16:43 | [priority-heap] Comment | ||
| 097fb8b8 | 2023-01-05 14:38:10 | [priority-queue] Use resize instead of shrink To avoid reallocation of smaller array. Not desirable here. | ||
| a7fee43c | 2022-11-23 17:46:32 | [priority-queue] Minor micro-optimize | ||
| 02949cf6 | 2022-11-16 12:06:44 | [priority-queue] More assert adjustment | ||
| 620ddd76 | 2022-11-16 12:04:35 | [priority-queue] Fix asserts | ||
| 73b8360d | 2022-05-19 22:59:51 | [subset] fix fuzzer found underflow when heap push fails. Fixes https://oss-fuzz.com/testcase-detail/5148625505746944. | ||
| 6b62c10f | 2022-05-18 16:27:54 | [priority-queue] Remove old init/fini | ||
| 39a424ca | 2022-05-18 16:17:16 | [priority-queue] Optimize heap access | ||
| 9308659f | 2022-05-18 16:14:25 | [priority-queue] Optimize swap() | ||
| f561fa6e | 2021-03-18 11:13:47 | Change priority queue to use (priority, value) instead of (value, priority). | ||
| 59ac0a0d | 2020-11-05 10:29:56 | [subset] Use priority for comparison in heap. | ||
| 4c8dd41e | 2020-11-05 09:21:25 | [subset] re-write compute distances to use an array lookup for the distance map. | ||
| 5c4e0ffd | 2020-11-04 16:08:01 | [subset] Add a basic priority queue datastructure (binary heap). |