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

/vbox/src/libs/zlib-1.2.6/
H A Dtrees.c424 #define SMALLEST 1 macro
434 top = s->heap[SMALLEST]; \
435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
436 pqdownheap(s, tree, SMALLEST); \
629 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
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];

Completed in 363 milliseconds