min_heap_elem_greater
if (e->min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last))
while (hole_index && min_heap_elem_greater(s->p[parent], e)) {
min_heap_elem_greater(s->p[min_child], s->p[min_child - 1]))
if (!(min_heap_elem_greater(e, s->p[min_child])))
static inline int min_heap_elem_greater(struct event * a, struct event * b);