Lines Matching full:ncolors
30 * image. We use a map consisting of all combinations of Ncolors[i] color
31 * values for the i'th component. The Ncolors[] values are chosen so that
155 int Ncolors[MAX_Q_COMPS]; /* # of values alloced to each component */
185 select_ncolors (j_decompress_ptr cinfo, int Ncolors[])
187 /* and fill in Ncolors[] array to indicate choice. */
188 /* Return value is total number of colors (product of Ncolors[] values). */
218 Ncolors[i] = iroot;
231 /* calculate new total_colors if Ncolors[j] is incremented */
232 temp = total_colors / Ncolors[j];
233 temp *= Ncolors[j]+1; /* done in long arith to avoid oflo */
236 Ncolors[j]++; /* OK, apply the increment */
283 total_colors = select_ncolors(cinfo, cquantize->Ncolors);
288 total_colors, cquantize->Ncolors[0],
289 cquantize->Ncolors[1], cquantize->Ncolors[2]);
307 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
364 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
393 * Create an ordered-dither array for a component having ncolors
398 make_odither_array (j_decompress_ptr cinfo, int ncolors)
407 /* The inter-value distance for this color is MAXJSAMPLE/(ncolors-1).
409 * (f=0..N-1) should be (N-1-2*f)/(2*N) * MAXJSAMPLE/(ncolors-1).
412 den = 2 * ODITHER_CELLS * ((INT32) (ncolors - 1));
441 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
444 if (nci == cquantize->Ncolors[j]) {
