Lines Matching full:smallest

288 #define SMALLEST 1  macro
293  * Remove the smallest element from the heap and recreate the heap with
298     top = s->heap[SMALLEST]; \
299     s->heap[SMALLEST] = s->heap[s->heap_len--]; \
300     pqdownheap(s, tree, SMALLEST); \
313  * exchanging a node with the smallest of its two sons if necessary, stopping
326         /* Set j to the smallest of the two sons: */  in pqdownheap()
334         /* Exchange v with the smallest son */  in pqdownheap()
497      * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].  in build_tree()
536         m = s->heap[SMALLEST]; /* m = node of next least frequency */  in build_tree()
552         s->heap[SMALLEST] = node++;  in build_tree()
553         pqdownheap(s, tree, SMALLEST);  in build_tree()
557     s->heap[--(s->heap_max)] = s->heap[SMALLEST];  in build_tree()