Lines Matching full:heap
93 * need for the L_CODES extra codes used during heap construction. However
431 /* Index within the heap array of least frequent node in the Huffman tree */
435 * Remove the smallest element from the heap and recreate the heap with
436 * one less element. Updates heap and heap_len.
440 top = s->heap[SMALLEST]; \
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
454 * Restore the heap property by moving down the tree starting at node k,
456 * when the heap property is re-established (each father smaller than its
464 int v = s->heap[k];
469 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
473 if (smaller(tree, v, s->heap[j], s->depth)) break;
476 s->heap[k] = s->heap[j]; k = j;
481 s->heap[k] = v;
487 * IN assertion: the fields freq and dad are set, heap[heap_max] and
504 int h; /* heap index */
516 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
519 n = s->heap[h];
560 m = s->heap[--h];
630 int n, m; /* iterate over heap elements */
634 /* Construct the initial heap, with least frequent element in
635 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
636 * heap[0] is not used.
642 s->heap[++(s->heap_len)] = max_code = n;
655 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
663 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
674 m = s->heap[SMALLEST]; /* m = node of next least frequency */
676 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
677 s->heap[--(s->heap_max)] = m;
690 /* and insert the new node in the heap */
691 s->heap[SMALLEST] = node++;
696 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
