Searched refs:aHeap (Results 1 – 1 of 1) sorted by relevance
10345 aHeap[i] = x; in btreeHeapInsert()10346 while( (j = i/2)>0 && aHeap[j]>aHeap[i] ){ in btreeHeapInsert()10347 x = aHeap[j]; in btreeHeapInsert()10348 aHeap[j] = aHeap[i]; in btreeHeapInsert()10349 aHeap[i] = x; in btreeHeapInsert()10357 aHeap[1] = aHeap[x]; in btreeHeapPull()10359 aHeap[0]--; in btreeHeapPull()10362 if( aHeap[j]>aHeap[j+1] ) j++; in btreeHeapPull()10363 if( aHeap[i]<aHeap[j] ) break; in btreeHeapPull()10364 x = aHeap[i]; in btreeHeapPull()[all …]