Searched refs:SMALLEST (Results 1 – 1 of 1) sorted by relevance
424 #define SMALLEST 1 macro434 top = s->heap[SMALLEST]; \435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \436 pqdownheap(s, tree, SMALLEST); \668 m = s->heap[SMALLEST]; /* m = node of next least frequency */685 s->heap[SMALLEST] = node++;686 pqdownheap(s, tree, SMALLEST);690 s->heap[--(s->heap_max)] = s->heap[SMALLEST];