Searched refs:heap_len (Results 1 – 2 of 2) sorted by relevance
299 s->heap[SMALLEST] = s->heap[s->heap_len--]; \325 while (j <= s->heap_len) { in pqdownheap()327 if (j < s->heap_len && in pqdownheap()500 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()504 s->heap[++(s->heap_len)] = max_code = n; in build_tree()516 while (s->heap_len < 2) { in build_tree()517 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()528 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); in build_tree()555 } while (s->heap_len >= 2); in build_tree()
182 int heap_len; /* number of elements in the heap */ member
