Lines Matching defs:count

53     unsigned short count[MAXBITS+1];    /* number of codes of each length */
88        The codes are sorted by computing a count of codes for each length,
103         count[len] = 0;
105         count[lens[sym]]++;
110         if (count[max] != 0) break;
122         if (count[min] != 0) break;
129         left -= count[len];
138         offs[len + 1] = offs[len] + count[len];
160        counts are used for this, and so count[] is decremented as codes are
245         /* go to next symbol, update count, len */
247         if (--(count[len]) == 0) {
265                 left -= count[curr + drop];