Function __pushdown

src/util/heap.c:78–118

}

static void __pushdown
(
	heap_t *hp,
	unsigned int idx
) {
	while (1) {
		unsigned int childl, childr, child;

		// get left and right child indices
		childl = __child_left(idx);
		childr = __child_right(idx);

		// see if right child index is within bounds
		if(childr >= hp->count) {
			// see if left child index is within bounds
			if(childl >= hp->count) {
				// we've reached a leaf node
				// can't push down any further
				return;
			}

			// only left child should be considered
			child = childl;
		}
		// find smallest child
		else if(hp->cmp(hp->array[childl], hp->array[childr], hp->udata) > 0) {
			child = childl;
		} else {
			child = childr;
		}

		// idx is smaller than child
		if(hp->cmp(hp->array[idx], hp->array[child], hp->udata) < 0) {
			__swap(hp, idx, child);
			idx = child;
		} else {
			// parent is smaller than its children we can stop
			return;
		}
	}
}

// return item's index on the heap's array; otherwise -1
static int __item_get_idx