Lines Matching refs:heap
324 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ member
1794 top = s->heap[SMALLEST]; \
1795 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
1818 int v = s->heap[k];
1823 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
1827 if (smaller(tree, v, s->heap[j], s->depth)) break;
1830 s->heap[k] = s->heap[j]; k = j;
1835 s->heap[k] = v;
1870 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
1873 n = s->heap[h];
1914 m = s->heap[--h];
1996 s->heap[++(s->heap_len)] = max_code = n;
2009 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2028 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2030 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
2031 s->heap[--(s->heap_max)] = m;
2044 s->heap[SMALLEST] = node++;
2049 s->heap[--(s->heap_max)] = s->heap[SMALLEST];