Lines Matching refs:ncolors
31 * image. We use a map consisting of all combinations of Ncolors[i] color
32 * values for the i'th component. The Ncolors[] values are chosen so that
156 int Ncolors[MAX_Q_COMPS]; /* # of values alloced to each component */
186 select_ncolors (j_decompress_ptr cinfo, int Ncolors[])
188 /* and fill in Ncolors[] array to indicate choice. */
189 /* Return value is total number of colors (product of Ncolors[] values). */
219 Ncolors[i] = iroot;
232 /* calculate new total_colors if Ncolors[j] is incremented */
233 temp = total_colors / Ncolors[j];
234 temp *= Ncolors[j]+1; /* done in long arith to avoid oflo */
237 Ncolors[j]++; /* OK, apply the increment */
284 total_colors = select_ncolors(cinfo, cquantize->Ncolors);
289 total_colors, cquantize->Ncolors[0],
290 cquantize->Ncolors[1], cquantize->Ncolors[2]);
308 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
365 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
394 * Create an ordered-dither array for a component having ncolors
399 make_odither_array (j_decompress_ptr cinfo, int ncolors)
408 /* The inter-value distance for this color is MAXJSAMPLE/(ncolors-1).
410 * (f=0..N-1) should be (N-1-2*f)/(2*N) * MAXJSAMPLE/(ncolors-1).
413 den = 2 * ODITHER_CELLS * ((JLONG) (ncolors - 1));
442 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
445 if (nci == cquantize->Ncolors[j]) {
