Searched refs:SMALLEST (Results 1 – 1 of 1) sorted by relevance
480 #define SMALLEST 1 macro490 top = s->heap[SMALLEST]; \491 s->heap[SMALLEST] = s->heap[s->heap_len--]; \492 pqdownheap(s, tree, SMALLEST); \675 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()692 s->heap[SMALLEST] = node++; in build_tree()693 pqdownheap(s, tree, SMALLEST); in build_tree()697 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()