Lines Matching refs:hCurr
100 PQhandle hCurr, hChild;
103 hCurr = n[curr].handle;
114 if( child > pq->size || LEQ( h[hCurr].key, h[hChild].key )) {
115 n[curr].handle = hCurr;
116 h[hCurr].node = curr;
130 PQhandle hCurr, hParent;
133 hCurr = n[curr].handle;
137 if( parent == 0 || LEQ( h[hParent].key, h[hCurr].key )) {
138 n[curr].handle = hCurr;
139 h[hCurr].node = curr;
234 void pqDelete( PriorityQ *pq, PQhandle hCurr )
240 assert( hCurr >= 1 && hCurr <= pq->max && h[hCurr].key != NULL );
242 curr = h[hCurr].node;
253 h[hCurr].key = NULL;
254 h[hCurr].node = pq->freeList;
255 pq->freeList = hCurr;