Searched refs:largest (Results 1 – 1 of 1) sorted by relevance
57 int largest = pos; in heap_insert() local59 largest = left; in heap_insert()60 if (right < heap->size && heap->gt(ptrs[right], ptrs[largest])) in heap_insert()61 largest = right; in heap_insert()62 if (largest == pos) in heap_insert()65 ptrs[pos] = ptrs[largest]; in heap_insert()66 ptrs[largest] = p; in heap_insert()67 pos = largest; in heap_insert()