Lines Matching refs:SMALLEST
426 #define SMALLEST 1
431 * Remove the smallest element from the heap and recreate the heap with
436 top = s->heap[SMALLEST]; \
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
438 pqdownheap(s, tree, SMALLEST); \
451 * exchanging a node with the smallest of its two sons if necessary, stopping
463 /* Set j to the smallest of the two sons: */
471 /* Exchange v with the smallest son */
631 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
670 m = s->heap[SMALLEST]; /* m = node of next least frequency */
687 s->heap[SMALLEST] = node++;
688 pqdownheap(s, tree, SMALLEST);
692 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
