dist/zopfli/katajainen.c

99 numsymbols: Number of leaves.
106     Node* leaves, int numsymbols, NodePool* pool, int index, char final) {
111   if (index == 0 && lastcount >= numsymbols) return;
126     if (lastcount < numsymbols && sum > leaves[lastcount].weight) {
134         BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0);
135         BoundaryPM(lists, maxbits, leaves, numsymbols, pool, index - 1, 0);
184   int numsymbols = 0;  /* Amount of symbols with frequency > 0. */
191   /* One leaf per symbol. Only numsymbols leaves will be used. */
202       leaves[numsymbols].weight = frequencies[i];
203       leaves[numsymbols].count = i;  /* Index of symbol this leaf represents. */
204       numsymbols++;
209   if ((1 << maxbits) < numsymbols) {
213   if (numsymbols == 0) {
217   if (numsymbols == 1) {
224   qsort(leaves, numsymbols, sizeof(Node), LeafComparator);
237   /* In the last list, 2 * numsymbols - 2 active chains need to be created. Two
239   numBoundaryPMRuns = 2 * numsymbols - 4;
242     BoundaryPM(lists, maxbits, leaves, numsymbols, &pool, maxbits - 1, final);