Lines Matching defs:count
44 unsigned short count[MAXBITS+1]; /* number of codes of each length */
79 The codes are sorted by computing a count of codes for each length,
94 count[len] = 0;
96 count[lens[sym]]++;
101 if (count[max] != 0) break;
113 if (count[min] != 0) break;
120 left -= count[len];
129 offs[len + 1] = offs[len] + count[len];
151 counts are used for this, and so count[] is decremented as codes are
238 /* go to next symbol, update count, len */
240 if (--(count[len]) == 0) {
258 left -= count[curr + drop];