Home
last modified time | relevance | path

Searched refs:fY (Results 1 - 25 of 522) sorted by relevance

12345678910>>...21

/third_party/skia/src/pathops/
H A DSkPathOpsPoint.h14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); in AlmostEqualUlps()
19 double fY; member
23 fY = pt.fY; in set()
30 fY += v.fY; in operator +=()
36 fY -= v.fY; in operator -=()
42 fY / in operator /=()
102 double fY; global() member
[all...]
H A DSkPathOpsCubic.cpp24 if (fPts[endIndex].fY == fPts[ctrlIndex].fY) { in align()
25 dstPt->fY = fPts[endIndex].fY; in align()
42 && approximately_equal_half(lessPt.fY, cubicAtT.fY)) { in binarySearch()
61 && approximately_equal_half(morePt.fY, cubicAtT.fY)) { in binarySearch()
108 dst.pts[1].fY = (fPts[0].fY in chopAt()
[all...]
H A DSkPathOpsLine.cpp17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; in ptAtT()
33 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) { in nearPoint()
38 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearPoint()
40 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearPoint()
51 double tiniest = std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), fPt in nearPoint()
[all...]
H A DSkLineParameters.h55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) { in cubicEndPoints()
56 if (pts[0].fY > pts[endIndex].fY) { in cubicEndPoints()
65 if (pts[0].fY > pts[3].fY) { in cubicEndPoints()
72 fA = pts[s].fY - pts[e].fY; in cubicEndPoints()
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in cubicEndPoints()
[all...]
H A DSkOpCubicHull.cpp10 double dy = cubic[index].fY - cubic[zero].fY; in rotate()
18 rotPath[index].fY = cubic[zero].fY; in rotate()
22 if (approximately_equal(cubic[side1].fY, cubic[zero].fY)) { in rotate()
23 rotPath[side1].fY = cubic[zero].fY; in rotate()
25 if (approximately_equal(cubic[side2].fY, cubic[zero].fY)) { in rotate()
[all...]
H A DSkPathOpsQuad.cpp53 double origY = endPt[0]->fY; in hullIntersects()
55 double opp = endPt[1]->fY - origY; in hullIntersects()
56 double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp; in hullIntersects()
63 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp; in hullIntersects()
191 double tiniest = std::min(std::min(std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), in isLinear()
192 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY); in isLinear()
193 double largest = std::max(std::max(std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), in isLinear()
194 fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY); in isLinear()
[all...]
H A DSkPathOpsBounds.h38 if (pt.fY < fTop) fTop = pt.fY; in add()
40 if (pt.fY > fBottom) fBottom = pt.fY; in add()
45 if (pt.fY < fTop) fTop = SkDoubleToScalar(pt.fY); in add()
47 if (pt.fY > fBottom) fBottom = SkDoubleToScalar(pt.fY); in add()
53 && AlmostLessOrEqualUlps(fTop, pt.fY) in almostContains()
54 && AlmostLessOrEqualUlps(pt.fY, fBotto in almostContains()
[all...]
H A DSkPathOpsTightBounds.cpp18 moveBounds.fTop = std::min(moveBounds.fTop, pts[0].fY); in TightBounds()
20 moveBounds.fBottom = std::max(moveBounds.fBottom, pts[0].fY); in TightBounds()
28 wellBehaved &= between(pts[0].fY, pts[1].fY, pts[2].fY); in TightBounds()
35 wellBehaved &= between(pts[0].fY, pts[1].fY, pts[3].fY); in TightBounds()
37 wellBehaved &= between(pts[0].fY, pts[2].fY, pt in TightBounds()
[all...]
/third_party/skia/include/core/
H A DSkPoint.h29 int32_t fY; //!< y-axis value member
31 /** Sets fX to x, fY to y.
49 @return fY
51 constexpr int32_t y() const { return fY; } in y()
53 /** Returns true if fX and fY are both zero.
55 @return true if fX is zero and fY is zero
57 bool isZero() const { return (fX | fY) == 0; } in isZero()
59 /** Sets fX to x and fY to y.
62 @param y new value for fY
66 fY in set()
164 SkScalar fY; //!< y-axis value global() member
[all...]
H A DSkPoint3.h14 SkScalar fX, fY, fZ; member
30 SkScalar y() const { return fY; } in y()
33 void set(SkScalar x, SkScalar y, SkScalar z) { fX = x; fY = y; fZ = z; } in set()
36 return a.fX == b.fX && a.fY == b.fY && a.fZ == b.fZ; in operator ==()
49 SkScalar length() const { return SkPoint3::Length(fX, fY, fZ); } in length()
61 p.set(scale * fX, scale * fY, scale * fZ); in makeScale()
69 fY *= value; in scale()
79 neg.fY = -fY; in operator -()
[all...]
/third_party/skia/src/core/
H A DSkAnalyticEdge.h34 SkFixed fY; // The current y member
57 // Update fX, fY of this edge so fY = y
59 if (y == fY + SK_Fixed1) { in goY()
61 fY = y; in goY()
62 } else if (y != fY) { in goY()
66 fY = y; in goY()
72 SkASSERT(fDX == 0 || y - fY == SK_Fixed1 >> yShift); in goY()
73 fY = y; in goY()
92 fUpperY, fLowerY, SkFixedToFloat(fY), SkFixedToFloa in dump()
[all...]
H A DSkStrokerPriv.cpp17 path->lineTo(stop.fX, stop.fY); in ButtCapper()
37 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
38 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
40 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
[all...]
H A DSkEdgeClipper.cpp37 if (src[0].fY > src[count - 1].fY) { in sort_increasing_Y()
87 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY()
100 if (pts[0].fY < clip.fTop) { in chop_quad_in_Y()
105 tmp[2].fY = clip.fTop; in chop_quad_in_Y()
106 clamp_ge(tmp[3].fY, clip.fTop); in chop_quad_in_Y()
114 if (pts[i].fY < clip.fTop) { in chop_quad_in_Y()
115 pts[i].fY in chop_quad_in_Y()
[all...]
H A DSkLineClipper.cpp31 SkScalar dy = src[1].fY - src[0].fY; in sect_with_horizontal()
38 double Y0 = src[0].fY; in sect_with_horizontal()
40 double Y1 = src[1].fY; in sect_with_horizontal()
54 return SkScalarAve(src[0].fY, src[1].fY); in sect_with_vertical()
59 double Y0 = src[0].fY; in sect_with_vertical()
61 double Y1 = src[1].fY; in sect_with_vertical()
69 // Our caller expects y to be between src[0].fY and src[1].fY (unsorte in sect_clamp_with_vertical()
[all...]
H A DSkRRect.cpp152 if (radii[i].fX <= 0 || radii[i].fY <= 0) { in clamp_to_zero()
158 radii[i].fY = 0; in clamp_to_zero()
237 scale = compute_min_scale(fRadii[1].fY, fRadii[2].fY, height, scale); in scaleRadii()
239 scale = compute_min_scale(fRadii[3].fY, fRadii[0].fY, height, scale); in scaleRadii()
242 flush_to_zero(fRadii[1].fY, fRadii[2].fY); in scaleRadii()
244 flush_to_zero(fRadii[3].fY, fRadii[0].fY); in scaleRadii()
[all...]
H A DSkQuadClipper.cpp44 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t); in chopMonoQuadAtY()
57 if (srcPts[0].fY > srcPts[2].fY) { in clipQuad()
70 if (dst[2].fY <= ctop || dst[0].fY >= cbot) { in clipQuad()
78 if (dst[0].fY < ctop) { in clipQuad()
88 if (dst[i].fY < ctop) { in clipQuad()
89 dst[i].fY in clipQuad()
[all...]
H A DSkDrawShadowInfo.cpp30 return x*params.fX + y*params.fY + params.fZ; in compute_z()
38 return zPlaneParams.fX*x + zPlaneParams.fY*y + zPlaneParams.fZ; in GetSpotShadowTransform()
47 SkDrawShadowMetrics::GetDirectionalParams(occluderHeight, lightPos.fX, lightPos.fY, in GetSpotShadowTransform()
51 SkDrawShadowMetrics::GetSpotParams(occluderHeight, lightPos.fX, lightPos.fY, in GetSpotShadowTransform()
55 shadowTransform->setScaleTranslate(scale, scale, translate.fX, translate.fY); in GetSpotShadowTransform()
71 pts3D[0].set(pts[0].fX, pts[0].fY, z); in GetSpotShadowTransform()
73 pts3D[1].set(pts[1].fX, pts[1].fY, z); in GetSpotShadowTransform()
75 pts3D[2].set(pts[2].fX, pts[2].fY, z); in GetSpotShadowTransform()
77 pts3D[3].set(pts[3].fX, pts[3].fY, z); in GetSpotShadowTransform()
91 pts3D[i].fY in GetSpotShadowTransform()
[all...]
/third_party/skia/tests/
H A DPathOpsLineIntersectionTest.cpp120 if (line1[0].fY == line1[1].fY) { in testOne()
124 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); in testOne()
127 if (line2[0].fY == line2[1].fY) { in testOne()
131 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); in testOne()
135 double top = std::min(line1[0].fY, line1[1].fY); in testOne()
136 double bottom = std::max(line1[0].fY, line1[1].fY); in testOne()
[all...]
H A DStrokerTest.cpp44 path.moveTo(c[0].fX, c[0].fY); in cubicTest()
45 path.cubicTo(c[1].fX, c[1].fY, c[2].fX, c[2].fY, c[3].fX, c[3].fY); in cubicTest()
51 path.moveTo(c[0].fX, c[0].fY); in quadTest()
52 path.quadTo(c[1].fX, c[1].fY, c[2].fX, c[2].fY); in quadTest()
62 SkPoint c[4] = { {(float) d[0].fX, (float) d[0].fY}, {(float) d[1].fX, (float) d[1].fY}, in cubicSetTest()
63 {(float) d[2].fX, (float) d[2].fY}, {(floa in cubicSetTest()
[all...]
H A DPathOpsTestCommon.cpp33 double dy = c[3].fY - 3 * (c[2].fY - c[1].fY) - c[0].fY; in calc_t_div()
157 if (quad[1].fY < bounds.fTop) { in CubicToQuads()
158 quad[1].fY = bounds.fTop; in CubicToQuads()
159 } else if (quad[1].fY > bounds.fBottom) { in CubicToQuads()
160 quad[1].fY = bounds.fBottom; in CubicToQuads()
174 quadPath->moveTo(pts[0].fX, pts[0].fY);
177 quadPath->lineTo(pts[1].fX, pts[1].fY);
[all...]
H A DPathOpsCubicIntersectionTest.cpp66 __FUNCTION__, (int)index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); in standardTestCases()
400 cubic1[0].fX, cubic1[0].fY, cubic1[1].fX, cubic1[1].fY, in oneOff()
401 cubic1[2].fX, cubic1[2].fY, cubic1[3].fX, cubic1[3].fY); in oneOff()
403 cubic2[0].fX, cubic2[0].fY, cubic2[1].fX, cubic2[1].fY, in oneOff()
404 cubic2[2].fX, cubic2[2].fY, cubic2[3].fX, cubic2[3].fY); in oneOff()
[all...]
/third_party/skia/gm/
H A Dgradients_2pt_conical.cpp58 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutside()
59 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutside()
68 center0.set(pts[0].fX, pts[0].fY); in Make2ConicalOutsideStrip()
69 center1.set(pts[1].fX, pts[1].fY); in Make2ConicalOutsideStrip()
79 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutsideFlip()
80 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutsideFlip()
89 SkScalarAve(pts[0].fY, pts[1].fY)); in Make2ConicalInside()
91 SkScalarInterp(pts[0].fY, pts[1].fY, SkIntToScala in Make2ConicalInside()
[all...]
/third_party/skia/docs/examples/
H A DMatrix_mapRadius.cpp12 matrix.setScale(2, .5f, center.fX, center.fY); in REG_FIDDLE()
13 matrix.postRotate(45, center.fX, center.fY); in REG_FIDDLE()
22 canvas->drawString("mappedRadius", center.fX + mappedRadius + 3, center.fY, paint); in REG_FIDDLE()
31 canvas->drawLine(center.fX, center.fY, center.fX + mappedRadius, center.fY, paint); in REG_FIDDLE()
32 canvas->drawLine(center.fX, center.fY, center.fX, center.fY + mappedRadius, paint); in REG_FIDDLE()
35 canvas->drawCircle(center.fX, center.fY, circleRadius, paint); in REG_FIDDLE()
37 canvas->drawLine(center.fX, center.fY, center.fX + circleRadius, center.fY, pain in REG_FIDDLE()
[all...]
H A Dmapradius.cpp11 matrix.setScale(2, .5f, center.fX, center.fY); in REG_FIDDLE()
12 matrix.postRotate(45, center.fX, center.fY); in REG_FIDDLE()
23 canvas->drawLine(center.fX, center.fY, center.fX + mappedRadius, center.fY, paint); in REG_FIDDLE()
24 canvas->drawLine(center.fX, center.fY, center.fX, center.fY + mappedRadius, paint); in REG_FIDDLE()
28 canvas->drawCircle(center.fX, center.fY, circleRadius, paint); in REG_FIDDLE()
30 canvas->drawLine(center.fX, center.fY, center.fX + circleRadius, center.fY, paint); in REG_FIDDLE()
31 canvas->drawLine(center.fX, center.fY, cente in REG_FIDDLE()
[all...]
/third_party/skia/src/gpu/
H A DGrDistanceFieldGenFromVector.cpp24 double fX, fY; member
28 double dy = fY - p.fY; in distanceSquared()
112 DPoint pt = {src.fX, src.fY}; in mapPoint()
117 return { fMat[0] * src.fX + fMat[1] * src.fY + fMat[2], in mapPoint()
118 fMat[3] * src.fX + fMat[4] * src.fY + fMat[5] }; in mapPoint()
191 return nearly_zero((pts[1].fY - pts[0].fY) * (pts[1].fX - pts[2].fX) - in is_colinear()
192 (pts[1].fY - pts[2].fY) * (pt in is_colinear()
[all...]

Completed in 11 milliseconds

12345678910>>...21