| /external/ImageMagick/utilities/ |
| display.1.in | 36 \-fuzz distance colors within this distance are considered equal
52 \-quantize colorspace reduce colors in this colorspace
84 \-colors value preferred number of colors in the image
97 \-normalize transform image to span the full range of colors
|
| convert.1 | 30 \-colors value preferred number of colors in the image
55 \-fuzz distance colors within this distance are considered equal
86 \-remap filename transform image colors to match this set of colors
188 \-level-colors color,color
189 \ level image with the given colors
205 \-normalize transform image to span the full range of colors
216 \-quantize colorspace reduce colors in this colorspace
261 \-unique-colors discard all but one of any pixel colo
[all...] |
| /external/skia/src/core/ |
| SkBitmapProcState.h | 47 SkPMColor colors[]);
175 int count, SkPMColor colors[]);
177 int count, SkPMColor colors[]);
179 const uint32_t xy[], int count, SkPMColor colors[]);
181 const uint32_t xy[], int count, SkPMColor colors[]);
|
| SkPicturePlayback.cpp | 185 const SkColor* colors = nullptr; local
188 colors = (const SkColor*)reader->skip(count * sizeof(SkColor));
195 canvas->drawAtlas(atlas, xform, tex, colors, count, mode, cull, paint);
296 const SkColor* colors = nullptr; local
298 colors = (const SkColor*)reader->skip(SkPatchUtils::kNumCorners * sizeof(SkColor));
313 canvas->drawPatch(cubics, colors, texCoords, xfer, paint);
440 const SkColor* colors = nullptr; local
447 colors = (const SkColor*)reader->skip(vCount * sizeof(SkColor));
460 canvas->drawVertices(vmode, vCount, verts, texs, colors, xfer, indices, iCount, paint);
|
| /prebuilts/go/darwin-x86/src/image/color/ |
| ycbcr_test.go | 67 // TestYCbCrGray tests that YCbCr colors are a superset of Gray colors.
116 // TestCMYKGray tests that CMYK colors are a superset of Gray colors.
134 // Check that, for a Palette with no repeated colors, the closest color to
|
| /prebuilts/go/linux-x86/src/image/color/ |
| ycbcr_test.go | 67 // TestYCbCrGray tests that YCbCr colors are a superset of Gray colors.
116 // TestCMYKGray tests that CMYK colors are a superset of Gray colors.
134 // Check that, for a Palette with no repeated colors, the closest color to
|
| /external/ImageMagick/coders/ |
| sun.c | 343 image->colors=sun_info.maplength;
346 image->colors=one << sun_info.depth;
348 image->colors=sun_info.maplength/3;
349 if (AcquireImageColormap(image,image->colors,exception) == MagickFalse)
364 sun_colormap=(unsigned char *) AcquireQuantumMemory(image->colors,
368 count=ReadBlob(image,image->colors,sun_colormap);
369 if (count != (ssize_t) image->colors)
371 for (i=0; i < (ssize_t) image->colors; i++)
374 count=ReadBlob(image,image->colors,sun_colormap);
375 if (count != (ssize_t) image->colors)
[all...] |
| viff.c | 382 image->colors=2;
385 image->colors=256UL;
387 image->colors=image->depth <= 8 ? 256UL : 65536UL;
388 status=AcquireImageColormap(image,image->colors,exception);
412 image->colors=viff_info.map_columns;
413 if (AcquireImageColormap(image,image->colors,exception) == MagickFalse)
418 viff_colormap=(unsigned char *) AcquireQuantumMemory(image->colors,
425 count=ReadBlob(image,bytes_per_pixel*image->colors*viff_info.map_rows,
435 MSBOrderShort(viff_colormap,(bytes_per_pixel*image->colors*
442 MSBOrderLong(viff_colormap,(bytes_per_pixel*image->colors*
[all...] |
| map.c | 170 packet_size=(size_t) (image->colors > 256 ? 6UL : 3UL);
171 colormap=(unsigned char *) AcquireQuantumMemory(image->colors,packet_size*
179 count=ReadBlob(image,packet_size*image->colors,colormap);
180 if (count != (ssize_t) (packet_size*image->colors))
184 for (i=0; i < (ssize_t) image->colors; i++)
191 for (i=0; i < (ssize_t) image->colors; i++)
229 if (image->colors > 256)
395 packet_size=(size_t) (image->colors > 256 ? 6UL : 3UL);
396 colormap=(unsigned char *) AcquireQuantumMemory(image->colors,packet_size*
406 for (i=0; i < (ssize_t) image->colors; i++
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g2d/ |
| ParticleEmitter.java | 1262 private float[] colors = {1, 1, 1}; field in class:ParticleEmitter.GradientColorValue
[all...] |
| /external/mesa3d/src/mesa/main/ |
| texcompress_fxt1.c | 368 /* Choose colors from a grid.
379 /* Our solution here is to find the darkest and brightest colors in
380 * the 8x4 tile and use those as the two representative colors.
467 * replace each vector with the centroid of its matching colors.
474 * vec[][MAX_COMP] initial vectors and resulting colors
475 * nv number of resulting colors required
537 /* move each vector to the barycenter of its closest colors */
576 /* add in colors */
629 /* add in colors */
670 /* Our solution here is to find the darkest and brightest colors i
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/drawable/cts/ |
| GradientDrawableTest.java | 307 int[] colors; local
309 colors = new int[] { Color.RED };
310 gradientDrawable.setColors(colors);
311 assertArrayEquals("Color was set to " + Arrays.toString(colors),
312 colors, gradientDrawable.getColors());
314 colors = null;
315 gradientDrawable.setColors(colors);
316 assertArrayEquals("Color was set to " + Arrays.toString(colors),
317 colors, gradientDrawable.getColors());
|
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/ |
| TouchPaint.java | 51 * to perform various actions. Here we use one button to cycle colors and the
56 * the secondary button to cycle colors and the tertiary button to airbrush.
60 * have a button, which we use to cycle through colors.
76 /** Colors to cycle through. */
77 static final int[] COLORS = new int[] {
288 mPaint.setColor(COLORS[mColorIndex]);
444 mColorIndex = (mColorIndex + 1) % COLORS.length;
462 mPaint.setColor(COLORS[mColorIndex]);
474 mPaint.setColor(COLORS[mColorIndex]);
|
| /external/chromium-trace/catapult/third_party/graphy/graphy/backends/google_chart_api/ |
| encoders.py | 136 colors = []
140 colors.append(series.style.color)
141 return util.JoinLists(color = colors)
415 # Colors were overridden by the user
416 colors = chart._colors
418 # Build the list of colors from individual segments
419 colors = []
423 colors.append(segment.color)
424 return util.JoinLists(color = colors)
|
| /external/ImageMagick/ImageMagick/script/ |
| quantize.html | 12 <meta name="description" content="ImageMagick® is a software suite to create, edit, compose, or convert bitmap images. It can read and write images in a variety of formats (over 200) including PNG, JPEG, JPEG-2000, GIF, WebP, Postscript, PDF, and SVG. Use ImageMagick to resize, flip, mirror, rotate, distort, shear and transform images, adjust image colors, apply various special effects, or draw text, lines, polygons, ellipses and Bézier curves."/>
79 <p>Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, is the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by reclassification in the reduced tree. <var>Our goal is to minimize the numerical discrepancies between the original colors and quantized colors</var>. To learn more about quantization error, see <a href="quantize.php#measure">Measuring Color Reduction Error</a>.</p>
96 <li>chooses a maximum depth for the tree as a function of the desired number of colors in the output image (currently the <var>base-two</var> logarithm of <var>Cmax</var>).</li>
122 <p>Reduction repeatedly prunes the tree until the number of nodes with <var>n2</var> > <var>0</var> is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose <var>E</var> value is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, <var>Ep</var>, to govern node selection as follows:</p>
126 while number of nodes with (n2 > 0) > required maximum number of colors
135 <p>For each node, <var>n2</var> pixels exist for which that node represents the smallest volume in RGB space containing those pixel's colors. When <var>n2</var> > <var>0</var> the node will uniquely define a color in the output image. At the beginning of reduction, <var>n2</var> = <var>0</var> for all nodes except the leaves of the tree which represent colors present in the input image.</p>
137 <p>The other pixel count, <var>n1</var>, indicates the total number of colors within the cubic volume which the node represents. This includes <var>n1</var> - <var>n2</var> pix (…)
[all...] |
| /external/ImageMagick/www/ |
| quantize.html | 14 <meta name="description" content="ImageMagick® is a software suite to create, edit, compose, or convert bitmap images. It can read and write images in a variety of formats (over 200) including PNG, JPEG, JPEG-2000, GIF, WebP, Postscript, PDF, and SVG. Use ImageMagick to resize, flip, mirror, rotate, distort, shear and transform images, adjust image colors, apply various special effects, or draw text, lines, polygons, ellipses and Bézier curves."/>
83 <p>Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, is the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by reclassification in the reduced tree. <var>Our goal is to minimize the numerical discrepancies between the original colors and quantized colors</var>. To learn more about quantization error, see <a href="quantize.html#measure">Measuring Color Reduction Error</a>.</p>
100 <li>chooses a maximum depth for the tree as a function of the desired number of colors in the output image (currently the <var>base-two</var> logarithm of <var>Cmax</var>).</li>
126 <p>Reduction repeatedly prunes the tree until the number of nodes with <var>n2</var> > <var>0</var> is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose <var>E</var> value is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, <var>Ep</var>, to govern node selection as follows:</p>
130 while number of nodes with (n2 > 0) > required maximum number of colors
139 <p>For each node, <var>n2</var> pixels exist for which that node represents the smallest volume in RGB space containing those pixel's colors. When <var>n2</var> > <var>0</var> the node will uniquely define a color in the output image. At the beginning of reduction, <var>n2</var> = <var>0</var> for all nodes except the leaves of the tree which represent colors present in the input image.</p>
141 <p>The other pixel count, <var>n1</var>, indicates the total number of colors within the cubic volume which the node represents. This includes <var>n1</var> - <var>n2</var> pix (…)
[all...] |
| /frameworks/base/graphics/java/android/graphics/ |
| Bitmap.java | 420 * well as the ability to display transparent/translucent colors.
[all...] |
| /external/skia/include/gpu/ |
| GrDrawContext.h | 168 * @param colors optional array of per-vertex colors, supercedes
182 const GrColor colors[],
194 * @param colors optional array of per-sprite colors, supercedes
203 const SkColor colors[]);
|
| /prebuilts/misc/darwin-x86_64/sdl2/include/SDL2/ |
| SDL_pixels.h | 266 SDL_Color *colors; member in struct:SDL_Palette
359 * \brief Set a range of colors in a palette.
362 * \param colors An array of colors to copy into the palette.
366 * \return 0 on success, or -1 if not all of the colors could be set.
369 const SDL_Color * colors,
|
| /prebuilts/misc/windows/sdl2/i686-w64-mingw32/include/SDL2/ |
| SDL_pixels.h | 266 SDL_Color *colors; member in struct:SDL_Palette
359 * \brief Set a range of colors in a palette.
362 * \param colors An array of colors to copy into the palette.
366 * \return 0 on success, or -1 if not all of the colors could be set.
369 const SDL_Color * colors,
|
| /prebuilts/misc/windows/sdl2/include/ |
| SDL_pixels.h | 266 SDL_Color *colors; member in struct:SDL_Palette
359 * \brief Set a range of colors in a palette.
362 * \param colors An array of colors to copy into the palette.
366 * \return 0 on success, or -1 if not all of the colors could be set.
369 const SDL_Color * colors,
|
| /prebuilts/misc/windows/sdl2/x86_64-w64-mingw32/include/SDL2/ |
| SDL_pixels.h | 266 SDL_Color *colors; member in struct:SDL_Palette
359 * \brief Set a range of colors in a palette.
362 * \param colors An array of colors to copy into the palette.
366 * \return 0 on success, or -1 if not all of the colors could be set.
369 const SDL_Color * colors,
|
| /external/ImageMagick/scripts/ |
| xsnap | 180 frame .options.processing.colors
181 label .options.processing.colors.label -text "Colors:" -width 9 -anchor w
182 scale .options.processing.colors.scale -orient horizontal -length 11c \
183 -from 0 -to 256 -tickinterval 32 -variable snap(colors)
184 pack .options.processing.colors.label .options.processing.colors.scale \
186 pack .options.processing.colors
194 pack .options.processing.checks .options.processing.colors \
436 if {$snap(colors)} {
[all...] |
| /frameworks/support/core-ui/java/android/support/v4/widget/ |
| MaterialProgressDrawable.java | 74 private static final int[] COLORS = new int[] {
123 mRing.setColors(COLORS);
203 * Set the colors used in the progress animation from color resources.
207 * @param colors
209 public void setColorSchemeColors(int... colors) {
210 mRing.setColors(colors);
583 * Set the colors the progress spinner alternates between.
585 * @param colors Array of integers describing the colors. Must be non-<code>null</code>.
587 public void setColors(@NonNull int[] colors) {
[all...] |
| /cts/suite/cts/utils/ |
| grapher.py | 29 colors = { variable
68 clr = colors.get(name, "#%06X" % (hash(name) % 0xFFFFFF))
|
