Lines Matching defs:index
42 * not 0-based. The parent is index/2, and the left-child is index*2.
43 * The right child is index*2+1.
72 isc_heapindex_t index;
77 isc_heapindex_t index, unsigned int size_increment,
99 heap->index = index;
153 if (heap->index != NULL)
154 (heap->index)(heap->array[i], i);
157 if (heap->index != NULL)
158 (heap->index)(heap->array[i], i);
177 if (heap->index != NULL)
178 (heap->index)(heap->array[i], i);
182 if (heap->index != NULL)
183 (heap->index)(heap->array[i], i);
206 isc_heap_delete(isc_heap_t *heap, unsigned int index) {
211 REQUIRE(index >= 1 && index <= heap->last);
213 if (index == heap->last) {
221 less = heap->compare(elt, heap->array[index]);
222 heap->array[index] = elt;
224 float_up(heap, index, heap->array[index]);
226 sink_down(heap, index, heap->array[index]);
231 isc_heap_increased(isc_heap_t *heap, unsigned int index) {
233 REQUIRE(index >= 1 && index <= heap->last);
235 float_up(heap, index, heap->array[index]);
239 isc_heap_decreased(isc_heap_t *heap, unsigned int index) {
241 REQUIRE(index >= 1 && index <= heap->last);
243 sink_down(heap, index, heap->array[index]);
247 isc_heap_element(isc_heap_t *heap, unsigned int index) {
249 REQUIRE(index >= 1);
251 if (index <= heap->last)
252 return (heap->array[index]);