Lines Matching defs:SMALLEST
422 #define SMALLEST 1
427 * Remove the smallest element from the heap and recreate the heap with
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
447 * exchanging a node with the smallest of its two sons if necessary, stopping
459 /* Set j to the smallest of the two sons: */
467 /* Exchange v with the smallest son */
627 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
666 m = s->heap[SMALLEST]; /* m = node of next least frequency */
683 s->heap[SMALLEST] = node++;
684 pqdownheap(s, tree, SMALLEST);
688 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
