Lines Matching full:colors
44 * have as many boxes as desired colors. Then the mean color in each
45 * remaining box becomes one of the possible output colors.
70 * weights of the colors in the NTSC grayscale equation.
100 * desired colors. 16 bits/cell is plenty for that too.)
176 int desired; /* desired # of colors = size of colormap */
481 /* Current algorithm: mean weighted by pixels (not colors) */
550 * colors to the nearest color in the selected colormap.
553 * cache for the results of nearest-color searches. All colors within a
563 * Our method of efficiently finding nearest colors is based on the "locally
578 * nearest colors for only the cells within a small subbox of the histogram.
633 * the colors that need further consideration.
741 * away from some colormap entry. Therefore, only colors that are
757 * given the list of candidate colors prepared by find_nearby_colors.
847 int numcolors; /* number of candidate colors */
869 /* Determine the actually nearest colors. */
1068 * colors; then repeated errors in the same direction cannot cause cascading
1071 * the results even with corner colors allocated.
1117 /* Select the representative colors and fill in cinfo->colormap */
1249 /* Lower bound on # of colors ... somewhat arbitrary as long as > 0 */
