Lines Matching refs:heap_len
872 int heap_len; /* number of elements in the heap */
1032 while (j <= G2.heap_len) {
1034 if (j < G2.heap_len && SMALLER(tree, G2.heap[j + 1], G2.heap[j]))
1204 * one less element. Updates heap and heap_len. */
1212 G2.heap[SMALLEST] = G2.heap[G2.heap_len--]; \
1229 G2.heap_len = 0;
1234 G2.heap[++G2.heap_len] = max_code = n;
1246 while (G2.heap_len < 2) {
1247 int new = G2.heap[++G2.heap_len] = (max_code < 2 ? ++max_code : 0);
1258 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
1261 for (n = G2.heap_len / 2; n >= 1; n--)
1288 } while (G2.heap_len >= 2);