Lines Matching refs:heap
85 * need for the L_CODES extra codes used during heap construction. However
289 /* Index within the heap array of least frequent node in the Huffman tree */
293 * Remove the smallest element from the heap and recreate the heap with
294 * one less element. Updates heap and heap_len.
298 top = s->heap[SMALLEST]; \
299 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
312 * Restore the heap property by moving down the tree starting at node k,
314 * when the heap property is re-established (each father smaller than its
323 int v = s->heap[k];
328 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
332 if (smaller(tree, v, s->heap[j], s->depth)) break;
335 s->heap[k] = s->heap[j]; k = j;
340 s->heap[k] = v;
346 * IN assertion: the fields freq and dad are set, heap[heap_max] and
364 int h; /* heap index */
376 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
379 n = s->heap[h];
420 m = s->heap[--h];
492 int n, m; /* iterate over heap elements */
496 /* Construct the initial heap, with least frequent element in
497 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
498 * heap[0] is not used.
504 s->heap[++(s->heap_len)] = max_code = n;
517 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
525 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
536 m = s->heap[SMALLEST]; /* m = node of next least frequency */
538 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
539 s->heap[--(s->heap_max)] = m;
551 /* and insert the new node in the heap */
552 s->heap[SMALLEST] = node++;
557 s->heap[--(s->heap_max)] = s->heap[SMALLEST];