last_key = heap->data[index*2];
last_data = heap->data[index*2+1];
while (index > 0) {
- parent = (index - 1) >> 1;
- res = heap->comparator(last_key, heap->data[parent*2]);
- if (res > 0) break;
- heap->data[index*2] = heap->data[parent*2];
- heap->data[index*2+1] = heap->data[parent*2+1];
- index = parent;
+ parent = (index - 1) >> 1;
+ res = heap->comparator(last_key, heap->data[parent*2]);
+ if (res > 0) break;
+ heap->data[index*2] = heap->data[parent*2];
+ heap->data[index*2+1] = heap->data[parent*2+1];
+ index = parent;
}
heap->data[index*2] = last_key;
heap->data[index*2+1] = last_data;
heap_insert(heap_t heap, void *key, void *data)
{
if (heap->data_used == heap->data_alloc) {
- heap->data_alloc *= 2;
- heap->data = realloc(heap->data, 2*heap->data_alloc*sizeof(void*));
+ heap->data_alloc *= 2;
+ heap->data = realloc(heap->data, 2*heap->data_alloc*sizeof(void*));
}
heap->data[heap->data_used*2] = key;
heap->data[heap->data_used*2+1] = data;
last_data = heap->data[pos*2+1];
/* start at left child */
while ((child=pos*2+1) < heap->data_used) {
- /* use right child if it exists and is smaller */
- if (child+1 < heap->data_used) {
- res = heap->comparator(heap->data[(child+1)*2], heap->data[child*2]);
- if (res < 0) child = child+1;
- }
- res = heap->comparator(last_key, heap->data[child*2]);
- if (res <= 0) break;
- heap->data[pos*2] = heap->data[child*2];
- heap->data[pos*2+1] = heap->data[child*2+1];
- pos = child;
+ /* use right child if it exists and is smaller */
+ if (child+1 < heap->data_used) {
+ res = heap->comparator(heap->data[(child+1)*2], heap->data[child*2]);
+ if (res < 0) child = child+1;
+ }
+ res = heap->comparator(last_key, heap->data[child*2]);
+ if (res <= 0) break;
+ heap->data[pos*2] = heap->data[child*2];
+ heap->data[pos*2+1] = heap->data[child*2+1];
+ pos = child;
}
heap->data[pos*2] = last_key;
heap->data[pos*2+1] = last_data;
pos = 1;
}
while (pos < heap->data_used) {
- if (pred(heap->data[pos*2], heap->data[pos*2+1], extra)) {
+ if (pred(heap->data[pos*2], heap->data[pos*2+1], extra)) {
heap_remove(heap, pos);
pos = 0;
} else {
/* prepackaged comparators */
int
-int_comparator(const void *a, const void *b)
+ulong_comparator(const void *a, const void *b)
{
- return (time_t)a-(time_t)b;
+ return (unsigned long)a-(unsigned long)b;
}