Lines Matching refs:count
37 size_t count; /* Used as index to last element. Also is num of items. */ member
55 heap->count = 0; in heap_alloc()
81 if (heap->capacity - 1 <= heap->count) in heap_insert()
85 heap->array[++heap->count] = item; in heap_insert()
86 heapify_up (heap->array, heap->count, heap->compare); in heap_insert()
98 if (heap->count == 0) in heap_remove_top()
102 heap->array[1] = heap->array[heap->count--]; in heap_remove_top()
103 heapify_down (heap->array, heap->count, 1, heap->compare); in heap_remove_top()
111 heapify_down (void **array, size_t count, size_t initial, in heapify_down() argument
117 while (parent <= count / 2) in heapify_down()
121 if (child < count && compare (array[child], array[child + 1]) < 0) in heapify_down()
138 heapify_up (void **array, size_t count, in heapify_up() argument
141 size_t k = count; in heapify_up()