60 			  ! heap->compare(heap->array[(i)], \
61 					  heap->array[heap_parent(i)]))
70 	void				**array;  member
97 	heap->array = NULL;  in isc_heap_create()
114 	if (heap->array != NULL)  in isc_heap_destroy()
115 		isc_mem_put(heap->mctx, heap->array,  in isc_heap_destroy()
134 	if (heap->array != NULL) {  in resize()
135 		memcpy(new_array, heap->array, heap->size * sizeof(void *));  in resize()
136 		isc_mem_put(heap->mctx, heap->array,  in resize()
140 	heap->array = new_array;  in resize()
150 	     i > 1 && heap->compare(elt, heap->array[p]) ;  in float_up()
152 		heap->array[i] = heap->array[p];  in float_up()
154 			(heap->index)(heap->array[i], i);  in float_up()
156 	heap->array[i] = elt;  in float_up()
158 		(heap->index)(heap->array[i], i);  in float_up()
171 		if (j < size && heap->compare(heap->array[j+1],  in sink_down()
172 					      heap->array[j]))  in sink_down()
174 		if (heap->compare(elt, heap->array[j]))  in sink_down()
176 		heap->array[i] = heap->array[j];  in sink_down()
178 			(heap->index)(heap->array[i], i);  in sink_down()
181 	heap->array[i] = elt;  in sink_down()
183 		(heap->index)(heap->array[i], i);  in sink_down()
214 		heap->array[heap->last] = NULL;  in isc_heap_delete()
217 		elt = heap->array[heap->last];  in isc_heap_delete()
218 		heap->array[heap->last] = NULL;  in isc_heap_delete()
221 		less = heap->compare(elt, heap->array[index]);  in isc_heap_delete()
222 		heap->array[index] = elt;  in isc_heap_delete()
224 			float_up(heap, index, heap->array[index]);  in isc_heap_delete()
226 			sink_down(heap, index, heap->array[index]);  in isc_heap_delete()
235 	float_up(heap, index, heap->array[index]);  in isc_heap_increased()
243 	sink_down(heap, index, heap->array[index]);  in isc_heap_decreased()
252 		return (heap->array[index]);  in isc_heap_element()
264 		(action)(heap->array[i], uap);  in isc_heap_foreach()