Lines Matching defs:min
33 /* A binary min heap. The usual properties hold: the root is the lowest
41 struct heap_node* min;
63 heap->min = NULL;
68 return heap->min;
99 heap->min = child;
119 /* Calculate the path from the root to the insertion point. This is a min
127 parent = child = &heap->min;
144 * It's a min heap so parent < child must be true.
163 /* Calculate the path from the min (the root) to the max, the left-most node
171 max = &heap->min;
189 if (child == heap->min) {
190 heap->min = NULL;
209 heap->min = child;
217 * It's a min heap so parent < child must be true. If the parent is bigger,
240 heap_remove(heap, heap->min, less_than);