53 			  ! heap->compare(heap->array[(i)], \
54 					  heap->array[heap_parent(i)]))
61 	void				**array;  member
85 	heap->array = NULL;  in isc_heap_create()
101 	free(heap->array);  in isc_heap_destroy()
116 	if (heap->array != NULL) {  in resize()
117 		memmove(new_array, heap->array, heap->size * sizeof(void *));  in resize()
118 		free(heap->array);  in resize()
121 	heap->array = new_array;  in resize()
131 	     i > 1 && heap->compare(elt, heap->array[p]) ;  in float_up()
133 		heap->array[i] = heap->array[p];  in float_up()
135 			(heap->index)(heap->array[i], i);  in float_up()
137 	heap->array[i] = elt;  in float_up()
139 		(heap->index)(heap->array[i], i);  in float_up()
152 		if (j < size && heap->compare(heap->array[j+1],  in sink_down()
153 					      heap->array[j]))  in sink_down()
155 		if (heap->compare(elt, heap->array[j]))  in sink_down()
157 		heap->array[i] = heap->array[j];  in sink_down()
159 			(heap->index)(heap->array[i], i);  in sink_down()
162 	heap->array[i] = elt;  in sink_down()
164 		(heap->index)(heap->array[i], i);  in sink_down()
192 		(heap->index)(heap->array[idx], 0);  in isc_heap_delete()
194 		heap->array[heap->last] = NULL;  in isc_heap_delete()
197 		elt = heap->array[heap->last];  in isc_heap_delete()
198 		heap->array[heap->last] = NULL;  in isc_heap_delete()
201 		less = heap->compare(elt, heap->array[idx]);  in isc_heap_delete()
202 		heap->array[idx] = elt;  in isc_heap_delete()
204 			float_up(heap, idx, heap->array[idx]);  in isc_heap_delete()
206 			sink_down(heap, idx, heap->array[idx]);  in isc_heap_delete()
214 	float_up(heap, idx, heap->array[idx]);  in isc_heap_increased()
221 	sink_down(heap, idx, heap->array[idx]);  in isc_heap_decreased()
229 		return (heap->array[idx]);  in isc_heap_element()