heap_max 205 lib/zlib/deflate.h int heap_max; /* element of largest frequency */ heap_max 512 lib/zlib/trees.c tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ heap_max 514 lib/zlib/trees.c for (h = s->heap_max+1; h < HEAP_SIZE; h++) { heap_max 634 lib/zlib/trees.c s->heap_len = 0, s->heap_max = HEAP_SIZE; heap_max 672 lib/zlib/trees.c s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ heap_max 673 lib/zlib/trees.c s->heap[--(s->heap_max)] = m; heap_max 692 lib/zlib/trees.c s->heap[--(s->heap_max)] = s->heap[SMALLEST];