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
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \466 while (j <= s->heap_len) {468 if (j < s->heap_len &&638 s->heap_len = 0, s->heap_max = HEAP_SIZE;642 s->heap[++(s->heap_len)] = max_code = n;654 while (s->heap_len < 2) {655 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);666 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);694 } while (s->heap_len >= 2);