Lines Matching defs:count
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */
90 The codes are sorted by computing a count of codes for each length,
105 count[len] = 0;
107 count[lens[sym]]++;
112 if (count[max] != 0) break;
116 if (count[min] != 0) break;
123 left -= count[len];
132 offs[len + 1] = offs[len] + count[len];
154 counts are used for this, and so count[] is decremented as codes are
240 /* go to next symbol, update count, len */
242 if (--(count[len]) == 0) {
260 left -= count[curr + drop];