Searched defs:SMALLEST (Results 1 - 1 of 1) sorted by relevance

/ast/src/lib/libz/
H A Dtrees.c426 #define SMALLEST 1 macro
436 top = s->heap[SMALLEST]; \
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
438 pqdownheap(s, tree, SMALLEST); \
631 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
670 m = s->heap[SMALLEST]; /* m = node of next least frequency */
687 s->heap[SMALLEST] = node++;
688 pqdownheap(s, tree, SMALLEST);
692 s->heap[--(s->heap_max)] = s->heap[SMALLEST];

Completed in 2393 milliseconds