Searched refs:heap_len (Results 1 – 5 of 5) sorted by relevance
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \458 while (j <= s->heap_len) {460 if (j < s->heap_len &&630 s->heap_len = 0, s->heap_max = HEAP_SIZE;634 s->heap[++(s->heap_len)] = max_code = n;646 while (s->heap_len < 2) {647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);658 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);686 } while (s->heap_len >= 2);
208 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);
485 int heap_len; /* number of elements in the heap */ member2597 s->heap[SMALLEST] = s->heap[s->heap_len--]; \2624 while (j <= s->heap_len) {2626 if (j < s->heap_len &&2817 s->heap_len = 0, s->heap_max = HEAP_SIZE;2821 s->heap[++(s->heap_len)] = max_code = n;2834 while (s->heap_len < 2) {2835 node = s->heap[++(s->heap_len)] = (max_code < 2 ?2848 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);2878 } while (s->heap_len >= 2);
1414 int heap_len; /* number of elements in the heap */ member