| 76 | } |
| 77 | |
| 78 | static void priorityqueue_append(struct priorityqueue *q, u32 key, s64 value) { |
| 79 | assert(priorityqueue_size(q) < priorityqueue_maxsize(q)); |
| 80 | assert(key < priorityqueue_maxsize(q)); |
| 81 | |
| 82 | const size_t pos = q->heapsize; |
| 83 | |
| 84 | q->base[pos] = key; |
| 85 | q->value[key] = value; |
| 86 | q->heapptr[key] = &(q->base[pos]); |
| 87 | q->heapsize++; |
| 88 | } |
| 89 | |
| 90 | void priorityqueue_update(struct priorityqueue *q, u32 key, s64 value) { |
| 91 | assert(key < priorityqueue_maxsize(q)); |
no test coverage detected