Lines Matching defs:child
623 int child, father, maxelt = h->elements - 1 ;
629 father = 0 ; /* default: move up smallest child */
641 child = HEAP_LEFT(father) ; /* left child */
642 while (child <= maxelt) { /* valid entry */
643 if (child != maxelt && DN_KEY_LT(h->p[child+1].key, h->p[child].key) )
644 child = child+1 ; /* take right child, otherwise left */
645 h->p[father] = h->p[child] ;
647 father = child ;
648 child = HEAP_LEFT(child) ; /* left child for next loop */