Lines Matching defs:child
101 long child;105 child = curr << 1;106 if( child < pq->size && LEQ( h[n[child+1].handle].key,107 h[n[child].handle].key )) {108 ++child;111 assert(child <= pq->max);113 hChild = n[child].handle;114 if( child > pq->size || LEQ( h[hCurr].key, h[hChild].key )) {121 curr = child;