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

/xnu-2422.115.4/libkern/zlib/
H A Dtrees.c453 #define SMALLEST 1 macro
463 top = s->heap[SMALLEST]; \
464 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
465 pqdownheap(s, tree, SMALLEST); \
658 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
697 m = s->heap[SMALLEST]; /* m = node of next least frequency */
714 s->heap[SMALLEST] = node++;
715 pqdownheap(s, tree, SMALLEST);
719 s->heap[--(s->heap_max)] = s->heap[SMALLEST];

Completed in 18 milliseconds