Lines Matching refs:SMALLEST
430 #define SMALLEST 1
435 * Remove the smallest element from the heap and recreate the heap with
440 top = s->heap[SMALLEST]; \
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
442 pqdownheap(s, tree, SMALLEST); \
455 * exchanging a node with the smallest of its two sons if necessary, stopping
467 /* Set j to the smallest of the two sons: */
475 /* Exchange v with the smallest son */
635 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
674 m = s->heap[SMALLEST]; /* m = node of next least frequency */
691 s->heap[SMALLEST] = node++;
692 pqdownheap(s, tree, SMALLEST);
696 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
