Lines Matching defs:count
60 unsigned short count[MAXBITS+1]; /* number of codes of each length */
95 The codes are sorted by computing a count of codes for each length,
110 count[len] = 0;
112 count[lens[sym]]++;
117 if (count[max] != 0) break;
129 if (count[min] != 0) break;
136 left -= count[len];
145 offs[len + 1] = offs[len] + count[len];
167 counts are used for this, and so count[] is decremented as codes are
254 /* go to next symbol, update count, len */
256 if (--(count[len]) == 0) {
274 left -= count[curr + drop];