Searched refs:SMALLEST (Results 1 – 2 of 2) sorted by relevance
288 #define SMALLEST 1 macro298 top = s->heap[SMALLEST]; \299 s->heap[SMALLEST] = s->heap[s->heap_len--]; \300 pqdownheap(s, tree, SMALLEST); \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()
430 #define SMALLEST 1 macro440 top = s->heap[SMALLEST]; \441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \442 pqdownheap(s, tree, SMALLEST); \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];