Lines Matching defs:min
34 /* A binary min heap. The usual properties hold: the root is the lowest
42 struct heap_node* min;
64 heap->min = NULL;
69 return heap->min;
100 heap->min = child;
120 /* Calculate the path from the root to the insertion point. This is a min
128 parent = child = &heap->min;
145 * It's a min heap so parent < child must be true.
164 /* Calculate the path from the min (the root) to the max, the left-most node
172 max = &heap->min;
196 if (child == heap->min) {
197 heap->min = NULL;
216 heap->min = child;
224 * It's a min heap so parent < child must be true. If the parent is bigger,
247 heap_remove(heap, heap->min, less_than);