/external/skqp/fuzz/ |
H A D | FuzzScaleToSides.cpp | 19 float radius1, radius2, width; local 20 fuzz->next(&radius1, &radius2, &width); 22 if (!std::isfinite(radius1) || 25 radius1 <= 0.0f || 32 double scale = (double)width / ((double)radius1 + (double)radius2); 36 SkDebugf("%g %g %g %g\n", radius1, radius2, width, scale); 37 SkScaleToSides::AdjustRadii(width, scale, &radius1, &radius2); 41 junk *= radius1;
|
/external/skia/tests/ |
H A D | ScaleToSidesTest.cpp | 49 float radius1 = (float)interestingValues[i]; local 52 double scale = width / ((double)radius1 + (double)radius2); 58 SkScaleToSides::AdjustRadii(width, scale, &radius1, &radius2);
|
/external/skqp/tests/ |
H A D | ScaleToSidesTest.cpp | 49 float radius1 = (float)interestingValues[i]; local 52 double scale = width / ((double)radius1 + (double)radius2); 58 SkScaleToSides::AdjustRadii(width, scale, &radius1, &radius2);
|
/external/skia/gm/ |
H A D | gradients_2pt_conical.cpp | 45 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 47 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 48 return SkGradientShader::MakeTwoPointConical(center0, radius0, center1, radius1, data.fColors, 66 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 68 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 69 return SkGradientShader::MakeTwoPointConical(center1, radius1, center0, radius0, data.fColors, 155 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 157 center1.set(pts[1].fX - radius1, pt 168 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 179 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 191 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 204 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 216 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 228 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 240 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local [all...] |
H A D | gradients_no_texture.cpp | 63 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 65 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 66 return SkGradientShader::MakeTwoPointConical(center1, radius1,
|
H A D | gradients.cpp | 138 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 140 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 141 return SkGradientShader::MakeTwoPointConical(center1, radius1, center0, radius0, 150 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 152 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 154 return SkGradientShader::MakeTwoPointConical(center1, radius1, center0, radius0,
|
/external/skqp/gm/ |
H A D | gradients_2pt_conical.cpp | 45 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 47 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 48 return SkGradientShader::MakeTwoPointConical(center0, radius0, center1, radius1, data.fColors, 66 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 68 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 69 return SkGradientShader::MakeTwoPointConical(center1, radius1, center0, radius0, data.fColors, 155 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 157 center1.set(pts[1].fX - radius1, pt 168 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 179 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 191 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 204 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 216 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 228 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 240 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local [all...] |
H A D | gradients_no_texture.cpp | 63 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 65 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 66 return SkGradientShader::MakeTwoPointConical(center1, radius1,
|
H A D | gradients.cpp | 138 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 140 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 141 return SkGradientShader::MakeTwoPointConical(center1, radius1, center0, radius0, 150 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 152 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 154 return SkGradientShader::MakeTwoPointConical(center1, radius1, center0, radius0,
|
/external/skia/src/shaders/gradients/ |
H A D | SkTwoPointConicalGradient_gpu.cpp | 148 SkScalar radius1 = d->fRandom->nextUScalar1(); 164 if (SkScalarNearlyZero(radius1 - radius2)) { 168 radius1 = SkTMax(radius1, .1f); // Make sure that the radius is non-zero 169 radius2 = radius1; 181 radius1 = 0; 184 radius2 = radius1 + SkPoint::Distance(center1, center2); 187 std::swap(radius1, radius2); 192 if (SkScalarNearlyZero(radius1 - radius2)) { 197 if (SkScalarNearlyZero(radius1 [all...] |
/external/skqp/src/shaders/gradients/ |
H A D | SkTwoPointConicalGradient_gpu.cpp | 148 SkScalar radius1 = d->fRandom->nextUScalar1(); 164 if (SkScalarNearlyZero(radius1 - radius2)) { 168 radius1 = SkTMax(radius1, .1f); // Make sure that the radius is non-zero 169 radius2 = radius1; 181 radius1 = 0; 184 radius2 = radius1 + SkPoint::Distance(center1, center2); 187 std::swap(radius1, radius2); 192 if (SkScalarNearlyZero(radius1 - radius2)) { 197 if (SkScalarNearlyZero(radius1 [all...] |
/external/skia/bench/ |
H A D | GradientBench.cpp | 104 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 106 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 108 center1, radius1, 118 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 120 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 122 center1, radius1,
|
/external/skqp/bench/ |
H A D | GradientBench.cpp | 104 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 106 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 108 center1, radius1, 118 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; local 120 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); 122 center1, radius1,
|
/external/opencv/cvaux/src/ |
H A D | cvlee.cpp | 2650 float radius1,radius2,dist1,dist2; local 2691 radius1 = -1; radius2 = -2; 2703 dist1 = _cvCalcEdgeIntersection(pEdge1, pEdge_left, &Point1,radius1); 2705 dist1 = _cvCalcEdgeIntersection(pEdge2, pEdge_left, &Point1,radius1); 2836 _cvInitVoronoiNode(pNode_begin, &Point1,radius1); 3085 float radius1, radius2,dist1, dist2; local 3095 radius1 = -1; radius2 = -2; 3098 dist1 = _cvCalcEdgeIntersection(pEdge, pEdge_left, &Point1,radius1); 3141 float radius1, radius2; local 3151 radius1 3211 float radius1,radius2,dist1,dist2; local [all...] |
H A D | cvscanlines.cpp | 1403 float radius1, radius2, radius3, radius4; local 1463 radius1 = l_epipole[0] * l_epipole[0] + (l_epipole[1] - height) * (l_epipole[1] - height); 1473 l_radius = (float) sqrt( (double)MAX( MAX( radius1, radius2 ), MAX( radius3, radius4 ))); 1475 radius1 = r_epipole[0] * r_epipole[0] + (r_epipole[1] - height) * (r_epipole[1] - height); 1485 r_radius = (float) sqrt( (double)MAX( MAX( radius1, radius2 ), MAX( radius3, radius4 )));
|
/external/ImageMagick/www/api/ |
H A D | morphology.php | 250 <dd> Ring:{radius1},{radius2}[,{scale}] A ring of the values given that falls between the two radii. Defaults to a ring of approximataly 3 radius in a 7x7 kernel. This is the 'edge' pixels of the default "Disk" kernel, More specifically, "Ring" -> "Ring:2.5,3.5,1.0" </dd> 254 <dd> Peak:radius1,radius2 Find any peak larger than the pixels the fall between the two radii. The default ring of pixels is as per "Ring". Edges Find flat orthogonal edges of a binary shape Corners Find 90 degree corners of a binary shape Diagonals:type A special kernel to thin the 'outside' of diagonals LineEnds:type Find end points of lines (for pruning a skeletion) Two types of lines ends (default to both) can be searched for Type 0: All line ends Type 1: single kernel for 4-conneected line ends Type 2: single kernel for simple line ends LineJunctions Find three line junctions (within a skeletion) Type 0: all line junctions Type 1: Y Junction kernel Type 2: Diagonal T Junction kernel Type 3: Orthogonal T Junction kernel Type 4: Diagonal X Junction kernel Type 5: Orthogonal + Junction kernel Ridges:type Find single pixel ridges or thin lines Type 1: Fine single pixel thick lines and ridges Type 2: Find two pixel thick lines and ridges ConvexHull Octagonal Thickening Kernel, to generate convex hulls of 45 degrees Skeleton:type Traditional skeleton generating kernels. Type 1: Tradional Skeleton kernel (4 connected skeleton) Type 2: HIPR2 Skeleton kernel (8 connected skeleton) Type 3: Thinning skeleton based on a ressearch paper by Dan S. Bloomberg (Default Type) ThinSE:type A huge variety of Thinning Kernels designed to preserve conectivity. many other kernel sets use these kernels as source definitions. Type numbers are 41-49, 81-89, 481, and 482 which are based on the super and sub notations used in the source research paper. </dd>
|