Lines Matching defs:child
314 int child, father, maxelt = h->elements - 1 ;
320 father = 0 ; /* default: move up smallest child */
332 child = HEAP_LEFT(father) ; /* left child */
333 while (child <= maxelt) { /* valid entry */
334 if (child != maxelt && DN_KEY_LT(h->p[child+1].key, h->p[child].key) )
335 child = child+1 ; /* take right child, otherwise left */
336 h->p[father] = h->p[child] ;
338 father = child ;
339 child = HEAP_LEFT(child) ; /* left child for next loop */
377 while ( (temp = HEAP_LEFT(i)) <= maxelt ) { /* found left child */
379 temp++ ; /* select child with min key */