| /development/samples/browseable/SwipeRefreshMultipleViews/src/com.example.android.common/view/ |
| SlidingTabLayout.java | 40 * The colors can be customized in two ways. The first and simplest is to provide an array of colors
51 * Allows complete control over the colors drawn in the tab layout. Set with
116 * Sets the colors to be used for indicating the selected tab. These colors are treated as a
119 public void setSelectedIndicatorColors(int... colors) {
120 mTabStrip.setSelectedIndicatorColors(colors);
124 * Sets the colors to be used for tab dividers. These colors are treated as a circular array.
127 public void setDividerColors(int... colors) {
[all...] |
| /external/skia/src/effects/gradients/ |
| SkGradientShaderPriv.h | 217 // or other (texture gradient). If it is two or symmetric three color, the colors array will
218 // also be filled with the gradient colors
219 GpuColorType getGpuColorType(SkColor colors[3]) const;
248 * Count is the number of colors in the gradient
259 kColorStorageCount = 4, // more than this many colors, and we'll use sk_malloc for the space
265 SkColor* fOrigColors; // original colors, before modulation by paint in context.
367 /** Populates a pair of arrays with colors and stop info to construct a random gradient.
369 the number of colors, which will be capped by kMaxRandomGradientColors. colors should be
376 SkColor colors[kMaxRandomGradientColors]
[all...] |
| /external/skia/gm/ |
| alphagradients.cpp | 27 SkColor colors[] = { c0, c1 }; local
31 SkShader* s = SkGradientShader::CreateLinear(pts, colors, nullptr, 2,
|
| tablecolorfilter.cpp | 16 SkColor colors[] = { local
20 return SkGradientShader::CreateLinear(pts, colors, nullptr, SK_ARRAY_COUNT(colors),
37 SkColor colors[] = { local
40 return SkGradientShader::CreateRadial(SkPoint::Make(cx, cy), cx, colors, nullptr,
41 SK_ARRAY_COUNT(colors), SkShader::kClamp_TileMode);
205 ComposeColorFilterGM(const SkColor colors[], const SkXfermode::Mode modes[],
207 : fColors(colors), fModes(modes)
|
| /external/skia/samplecode/ |
| SampleRepeatTile.cpp | 23 const SkColor colors[] = { local
29 paint.setColor(colors[ix & 3]);
|
| SampleAtlas.cpp | 22 const SkRect tex[], const SkColor colors[], int count, const SkRect* cull,
24 canvas->drawAtlas(atlas, xform, tex, colors, count, SkXfermode::kModulate_Mode, cull, paint);
28 const SkRect tex[], const SkColor colors[], int count, const SkRect* cull,
176 SkColor colors[N]; variable
182 colors[i] = SkColorSetARGB((int)(fRec[i].fAlpha * 0xFF), 0xFF, 0xFF, 0xFF);
189 const SkColor* colorsPtr = fUseColors ? colors : nullptr;
|
| /external/skia/tests/ |
| GradientTest.cpp | 20 const SkColor colors[] = { SK_ColorRED, SK_ColorBLUE }; local
22 SkShader* s = SkGradientShader::CreateLinear(pts, colors, nullptr, 2, SkShader::kClamp_TileMode);
145 SkColor colors[] = { SK_ColorBLUE, SK_ColorBLUE }; local
148 colors,
204 const SkColor colors[] = { SK_ColorBLACK, SK_ColorWHITE }; local
207 SkGradientShader::CreateLinear(pts, colors, pos, 2, SkShader::kClamp_TileMode));
223 const SkColor colors[] = { SK_ColorBLACK, SK_ColorWHITE, SK_ColorBLACK, SK_ColorWHITE }; local
228 SkGradientShader::CreateLinear(pts, colors, pos, 4, SkShader::kClamp_TileMode));
|
| /ndk/tests/ |
| util.py | 22 colors = {
28 return colors[color] + string + end_color
|
| /external/ImageMagick/ImageMagick/api/ |
| quantize.html | 9 <title>ImageMagick: MagickCore, C API for ImageMagick: Reduce the Number of Unique Colors in an Image</title>
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."/>
15 <meta name="keywords" content="magickcore, c, api, for, imagemagick:, reduce, the, number, of, unique, colors, in, an, image, ImageMagick, PerlMagick, image processing, image, photo, software, Magick++, OpenMP, convert"/>
59 <p>QuantizeImage() takes a standard RGB or monochrome images and quantizes them down to some fixed number of colors.</p>
69 <p>The basic algorithm operates in three phases: Classification, Reduction, and Assignment. Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by restorage_class in the reduced tree. Our goal is to minimize the numerical discrepancies between the original colors and quantized colors (quantization error).</p>
71 <p>Classification begins by initializing a color description tree of sufficient depth to represent each possible input color in a leaf. However, it is impractical to generate a fully-formed color description tree in the storage_class phase for realistic values of Cmax. If colors components in the input image are quantized to k-bit precision, so that Cmax= 2k-1, the tree would need k levels below the root node to allow representing each possible input color in a leaf. This becomes prohibitive because the tree's total number of nodes is 1 + sum(i=1, k, 8k).</p>
75 <p>(1) Initializes data structures for nodes only as they are needed; (2) Chooses a maximum depth for the tree as a function of the desired number of colors in the output image (currently log2(colormap size)).</p>
90 <p>Reduction repeatedly prunes the tree until the number of nodes with n2 > 0 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 E (…)
[all...] |
| /external/ImageMagick/coders/ |
| dps.c | 135 *colors;
256 Get the colormap colors.
258 colors=(XColor *) AcquireQuantumMemory(visual_info->colormap_size,
259 sizeof(*colors));
260 if (colors == (XColor *) NULL)
271 colors[i].pixel=(size_t) i;
272 colors[i].pad=0;
295 colors[i].pixel=red | green | blue;
296 colors[i].pad=0;
309 colors,visual_info->colormap_size)
133 *colors; local
[all...] |
| /external/ImageMagick/www/api/ |
| quantize.html | 8 <title>ImageMagick: MagickCore, C API for ImageMagick: Reduce the Number of Unique Colors in an Image</title>
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."/>
17 <meta name="keywords" content="magickcore, c, api, for, imagemagick:, reduce, the, number, of, unique, colors, in, an, image, ImageMagick, PerlMagick, image processing, image, photo, software, Magick++, OpenMP, convert"/>
63 <p>QuantizeImage() takes a standard RGB or monochrome images and quantizes them down to some fixed number of colors.</p>
73 <p>The basic algorithm operates in three phases: Classification, Reduction, and Assignment. Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by restorage_class in the reduced tree. Our goal is to minimize the numerical discrepancies between the original colors and quantized colors (quantization error).</p>
75 <p>Classification begins by initializing a color description tree of sufficient depth to represent each possible input color in a leaf. However, it is impractical to generate a fully-formed color description tree in the storage_class phase for realistic values of Cmax. If colors components in the input image are quantized to k-bit precision, so that Cmax= 2k-1, the tree would need k levels below the root node to allow representing each possible input color in a leaf. This becomes prohibitive because the tree's total number of nodes is 1 + sum(i=1, k, 8k).</p>
79 <p>(1) Initializes data structures for nodes only as they are needed; (2) Chooses a maximum depth for the tree as a function of the desired number of colors in the output image (currently log2(colormap size)).</p>
94 <p>Reduction repeatedly prunes the tree until the number of nodes with n2 > 0 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 E (…)
[all...] |
| quantize.php | 9 <title>ImageMagick: MagickCore, C API for ImageMagick: Reduce the Number of Unique Colors in an Image</title>
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."/>
15 <meta name="keywords" content="magickcore, c, api, for, imagemagick:, reduce, the, number, of, unique, colors, in, an, image, ImageMagick, PerlMagick, image processing, image, photo, software, Magick++, OpenMP, convert"/>
59 <p>QuantizeImage() takes a standard RGB or monochrome images and quantizes them down to some fixed number of colors.</p>
69 <p>The basic algorithm operates in three phases: Classification, Reduction, and Assignment. Classification builds a color description tree for the image. Reduction collapses the tree until the number it represents, at most, the number of colors desired in the output image. Assignment defines the output image's color map and sets each pixel's color by restorage_class in the reduced tree. Our goal is to minimize the numerical discrepancies between the original colors and quantized colors (quantization error).</p>
71 <p>Classification begins by initializing a color description tree of sufficient depth to represent each possible input color in a leaf. However, it is impractical to generate a fully-formed color description tree in the storage_class phase for realistic values of Cmax. If colors components in the input image are quantized to k-bit precision, so that Cmax= 2k-1, the tree would need k levels below the root node to allow representing each possible input color in a leaf. This becomes prohibitive because the tree's total number of nodes is 1 + sum(i=1, k, 8k).</p>
75 <p>(1) Initializes data structures for nodes only as they are needed; (2) Chooses a maximum depth for the tree as a function of the desired number of colors in the output image (currently log2(colormap size)).</p>
90 <p>Reduction repeatedly prunes the tree until the number of nodes with n2 > 0 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 E (…)
[all...] |
| /external/mesa3d/src/gallium/drivers/i915/ |
| i915_state_derived.c | 62 boolean texCoords[I915_TEX_UNITS], colors[2], fog, needW, face; local
67 colors[0] = colors[1] = fog = needW = face = FALSE;
83 colors[fs->info.input_semantic_index[i]] = TRUE;
124 if (colors[0]) {
131 if (colors[1]) {
|
| /external/opencv3/modules/viz/src/vtk/ |
| vtkCloudMatSink.cpp | 58 colors = _colors;
93 if (colors.needed() && scalars_data)
106 buffer.convertTo(colors, CV_8U, vtktype == VTK_FLOAT || VTK_FLOAT == VTK_DOUBLE ? 255.0 : 1.0);
109 colors.release();
156 os << indent << "Colors: " << colors.needed() << "\n";
|
| /external/skia/src/utils/ |
| SkPatchGrid.h | 17 * specified at each one of them. The colors are bilinearly interpolated across the patch.
26 * The array fCornerColors holds the corner colors in the same format as fCornerPts.
99 * The colors and texCoords are the values at the corners of the patch which will be bilerp
102 bool setPatch(int x, int y, const SkPoint cubics[12], const SkColor colors[4],
106 * Get patch at location (x,y). If cubics, colors or texCoords is not nullptr it sets patch's
111 bool getPatch(int x, int y, SkPoint cubics[12], SkColor colors[4], SkPoint texCoords[4]) const;
|
| /frameworks/base/docs/html/training/material/ |
| drawables.jd | 10 <li><a href="#ColorExtract">Extract Prominent Colors from an Image</a></li>
48 <h2 id="ColorExtract">Extract Prominent Colors from an Image</h2>
51 android.support.v7.graphics.Palette} class, which lets you extract prominent colors from an image.
52 This class extracts the following prominent colors:</p>
63 <p>To extract these colors, pass a {@link android.graphics.Bitmap} object to the
69 <p>You can retrieve the prominent colors from the image using the getter methods in the
|
| /packages/apps/Launcher3/src/com/android/launcher3/dynamicui/ |
| ExtractedColors.java | 28 * Saves and loads colors extracted from the wallpaper, as well as the associated wallpaper id.
38 // loading extracted colors. New colors should always be added at the end.
93 * Loads colors and wallpaper id from {@link Utilities#getPrefs(Context)}.
116 * Updates colors based on the palette.
125 // We currently don't use any of the colors defined by the Palette API,
|
| /prebuilts/go/darwin-x86/src/encoding/json/ |
| example_test.go | 21 Colors []string
26 Colors: []string{"Crimson", "Red", "Ruby", "Maroon"},
34 // {"ID":1,"Name":"Reds","Colors":["Crimson","Red","Ruby","Maroon"]}
198 var colors []Color
199 err := json.Unmarshal(j, &colors)
204 for _, c := range colors {
|
| /prebuilts/go/linux-x86/src/encoding/json/ |
| example_test.go | 21 Colors []string
26 Colors: []string{"Crimson", "Red", "Ruby", "Maroon"},
34 // {"ID":1,"Name":"Reds","Colors":["Crimson","Red","Ruby","Maroon"]}
198 var colors []Color
199 err := json.Unmarshal(j, &colors)
204 for _, c := range colors {
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/draw9patch/graphics/ |
| GraphicsUtilities.java | 37 final int[] colors = new int[image.width]; local
43 image.getPixels(0, y, image.width, colors, 0);
44 result.setPixels(1, y + 1, image.width, colors, 0);
82 final int[] colors = new int[image.width]; local
88 image.getPixels(0, y, image.width, colors, 0);
89 result.setPixels(0, y, image.width, colors, 0);
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| BitmapTest.java | 182 int[] colors = createColors(100); local
183 Bitmap bitmap = Bitmap.createBitmap(colors, 10, 10, Config.RGB_565);
265 int[] colors = createColors(100); local
269 Bitmap.createBitmap(colors, 0, 100, -1, 100, Config.RGB_565);
276 Bitmap.createBitmap(colors, 10, 10, 100, 100, Config.RGB_565);
283 Bitmap.createBitmap(colors, -10, 100, 100, 100, Config.RGB_565);
288 //abnormal case: (offset + width) bigger than colors' length
290 Bitmap.createBitmap(colors, 10, 100, 100, 100, Config.RGB_565);
295 //abnormal case: (lastScanline + width) bigger than colors' length
297 Bitmap.createBitmap(colors, 10, 100, 50, 100, Config.RGB_565)
722 int[] colors = createColors(100); local
1022 int[] colors = new int[size]; local
[all...] |
| /prebuilts/misc/windows/sdl2/test/ |
| testautomation_pixels.c | 330 /* Two colors */
334 /* More than two colors */
346 SDLTest_AssertCheck(result->colors != NULL, "Verify value of result.colors is not NULL");
347 if (result->colors != NULL) {
349 SDLTest_AssertCheck(result->colors[i].r == 255, "Verify value of result.colors[%d].r; expected: 255, got %u", i, result->colors[i].r);
350 SDLTest_AssertCheck(result->colors[i].g == 255, "Verify value of result.colors[%d].g; expected: 255, got %u", i, result->colors[i].g)
[all...] |
| /art/test/044-proxy/src/ |
| BasicTest.java | 49 Colors colors = (Colors) proxy; local
50 colors.red(1.0f);
51 colors.blue(777);
52 colors.mauve("sorry");
53 colors.blob();
103 new Class[] { Quads.class, Colors.class, Trace.class });
153 interface Colors {
179 class Mix implements Quads, Colors {
[all...] |
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/app/ |
| BrandedFragment.java | 42 private SearchOrbView.Colors mSearchAffordanceColors;
254 * Sets the {@link android.support.v17.leanback.widget.SearchOrbView.Colors} used to draw the
257 * @param colors Colors used to draw search affordance.
259 public void setSearchAffordanceColors(SearchOrbView.Colors colors) {
260 mSearchAffordanceColors = colors;
268 * Returns the {@link android.support.v17.leanback.widget.SearchOrbView.Colors}
271 public SearchOrbView.Colors getSearchAffordanceColors() {
288 setSearchAffordanceColors(new SearchOrbView.Colors(color))
[all...] |
| BrandedSupportFragment.java | 44 private SearchOrbView.Colors mSearchAffordanceColors;
256 * Sets the {@link android.support.v17.leanback.widget.SearchOrbView.Colors} used to draw the
259 * @param colors Colors used to draw search affordance.
261 public void setSearchAffordanceColors(SearchOrbView.Colors colors) {
262 mSearchAffordanceColors = colors;
270 * Returns the {@link android.support.v17.leanback.widget.SearchOrbView.Colors}
273 public SearchOrbView.Colors getSearchAffordanceColors() {
290 setSearchAffordanceColors(new SearchOrbView.Colors(color))
[all...] |
