Searched refs:heap_len (Results 1 – 4 of 4) sorted by relevance
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \462 while (j <= s->heap_len) {464 if (j < s->heap_len &&634 s->heap_len = 0, s->heap_max = HEAP_SIZE;638 s->heap[++(s->heap_len)] = max_code = n;650 while (s->heap_len < 2) {651 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);662 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);690 } while (s->heap_len >= 2);
204 int heap_len; /* number of elements in the heap */ member
325 int heap_len; /* number of elements in the heap */ member1795 s->heap[SMALLEST] = s->heap[s->heap_len--]; \1820 while (j <= s->heap_len) {1822 if (j < s->heap_len &&1992 s->heap_len = 0, s->heap_max = HEAP_SIZE;1996 s->heap[++(s->heap_len)] = max_code = n;2008 while (s->heap_len < 2) {2009 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);2020 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);2047 } while (s->heap_len >= 2);
487 int heap_len; /* number of elements in the heap */ member2599 s->heap[SMALLEST] = s->heap[s->heap_len--]; \2626 while (j <= s->heap_len) {2628 if (j < s->heap_len &&2819 s->heap_len = 0, s->heap_max = HEAP_SIZE;2823 s->heap[++(s->heap_len)] = max_code = n;2836 while (s->heap_len < 2) {2837 node = s->heap[++(s->heap_len)] = (max_code < 2 ?2850 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);2880 } while (s->heap_len >= 2);