Searched refs:SMALLEST (Results 1 – 1 of 1) sorted by relevance
342 #define SMALLEST 1 macro352 top = s->heap[SMALLEST]; \353 s->heap[SMALLEST] = s->heap[s->heap_len--]; \354 pqdownheap(s, tree, SMALLEST); \590 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()606 s->heap[SMALLEST] = node++; in build_tree()607 pqdownheap(s, tree, SMALLEST); in build_tree()611 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()