Home
last modified time | relevance | path

Searched refs:fX (Results 1 – 25 of 555) sorted by relevance

12345678910>>...23

/third_party/skia/src/pathops/
DSkPathOpsPoint.h14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY); in AlmostEqualUlps()
18 double fX; member
22 fX = pt.fX; in set()
29 fX += v.fX;
35 fX -= v.fX;
41 fX /= s;
47 fX *= s;
52 SkVector v = {SkDoubleToScalar(fX), SkDoubleToScalar(fY)}; in asSkVector()
58 return fX * a.fY - fY * a.fX; in cross()
64 double xy = fX * a.fY; in crossCheck()
[all …]
DSkPathOpsCubic.cpp21 if (fPts[endIndex].fX == fPts[ctrlIndex].fX) { in align()
22 dstPt->fX = fPts[endIndex].fX; in align()
36 double calcPos = (&cubicAtT.fX)[xAxis]; in binarySearch()
41 if (approximately_equal_half(lessPt.fX, cubicAtT.fX) in binarySearch()
45 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept; in binarySearch()
60 if (approximately_equal_half(morePt.fX, cubicAtT.fX) in binarySearch()
64 double moreDist = (&morePt.fX)[xAxis] - axisIntercept; in binarySearch()
72 calcPos = (&cubicAtT.fX)[xAxis]; in binarySearch()
107 dst.pts[1].fX = (fPts[0].fX + fPts[1].fX) / 2; in chopAt()
109 dst.pts[2].fX = (fPts[0].fX + 2 * fPts[1].fX + fPts[2].fX) / 4; in chopAt()
[all …]
DSkPathOpsLine.cpp17 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; in ptAtT()
32 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX) 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), fPts[1].fX), fPts[1].fY); in nearPoint()
52 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
68 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearRay()
70 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearRay()
75 double tiniest = std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay()
76 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay()
[all …]
DSkPathOpsQuad.cpp52 double origX = endPt[0]->fX; in hullIntersects()
54 double adj = endPt[1]->fX - origX; 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()
203 SkDVector result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX, in dxdyAtT()
205 if (result.fX == 0 && result.fY == 0) { in dxdyAtT()
[all …]
DSkLineParameters.h73 fB = pts[e].fX - pts[s].fX; in cubicEndPoints()
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in cubicEndPoints()
87 fB = pts[1].fX - pts[0].fX; in lineEndPoints()
88 fC = pts[0].fX * pts[1].fY - pts[1].fX * pts[0].fY; in lineEndPoints()
112 fB = pts[e].fX - pts[s].fX; in quadEndPoints()
113 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY; in quadEndPoints()
141 distance[index].fX = index * oneThird; in cubicDistanceY()
142 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC; in cubicDistanceY()
149 distance[index].fX = index * oneHalf; in quadDistanceY()
150 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC; in quadDistanceY()
[all …]
DSkDLineIntersection.cpp51 double denom = bLen.fY * aLen.fX - aLen.fY * bLen.fX; in intersectRay()
55 double numerA = ab0.fY * bLen.fX - bLen.fY * ab0.fX; in intersectRay()
56 double numerB = ab0.fY * aLen.fX - aLen.fY * ab0.fX; in intersectRay()
68 if (!AlmostEqualUlps(aLen.fX * a[0].fY - aLen.fY * a[0].fX, in intersectRay()
69 aLen.fX * b[0].fY - aLen.fY * b[0].fX)) { in intersectRay()
99 double axLen = a[1].fX - a[0].fX; in intersect()
101 double bxLen = b[1].fX - b[0].fX; in intersect()
117 double ab0x = a[0].fX - b[0].fX; in intersect()
193 if (AlmostEqualUlps(min, max) && max - min < fabs(line[0].fX - line[1].fX)) { in horizontal_coincident()
227 double xIntercept = line[0].fX + fT[0][0] * (line[1].fX - line[0].fX); in horizontal()
[all …]
DSkPathOpsAsWinding.cpp56 if (bounds.fLeft >= edge.fX) { in contains_edge()
67 SkScalar intersectX = (*CurvePointAtT[verb])(pts, weight, tVals[index]).fX; in contains_edge()
68 if (intersectX < edge.fX) { in contains_edge()
72 if (intersectX > edge.fX) { in contains_edge()
77 if (pts[0].fX < edge.fX && pts[kPtCount[verb]].fX < edge.fX) { in contains_edge()
112 result = pts[0].fX < pts[1].fX ? pts[0] : pts[1]; in left_edge()
118 roots = SkDQuad::FindExtrema(&quad[0].fX, &t); in left_edge()
123 result = pts[0].fX < pts[2].fX ? pts[0] : pts[2]; in left_edge()
124 t = pts[0].fX < pts[2].fX ? 0 : 1; in left_edge()
131 roots = SkDConic::FindExtrema(&conic[0].fX, weight, &t); in left_edge()
[all …]
DSkPathOpsBounds.h37 if (pt.fX < fLeft) fLeft = pt.fX; in add()
39 if (pt.fX > fRight) fRight = pt.fX; in add()
44 if (pt.fX < fLeft) fLeft = SkDoubleToScalar(pt.fX); in add()
46 if (pt.fX > fRight) fRight = SkDoubleToScalar(pt.fX); in add()
51 return AlmostLessOrEqualUlps(fLeft, pt.fX) in almostContains()
52 && AlmostLessOrEqualUlps(pt.fX, fRight) in almostContains()
58 return fLeft <= pt.fX && fTop <= pt.fY && in contains()
59 fRight >= pt.fX && fBottom >= pt.fY; in contains()
/third_party/skia/include/core/
DSkPoint.h28 int32_t fX; //!< x-axis value member
45 constexpr int32_t x() const { return fX; } in x()
57 bool isZero() const { return (fX | fY) == 0; } in isZero()
65 fX = x; in set()
74 return {-fX, -fY};
82 fX = Sk32_sat_add(fX, v.fX);
91 fX = Sk32_sat_sub(fX, v.fX);
102 return fX == x && fY == y; in equals()
112 return a.fX == b.fX && a.fY == b.fY;
122 return a.fX != b.fX || a.fY != b.fY;
[all …]
DSkPoint3.h14 SkScalar fX, fY, fZ; member
29 SkScalar x() const { return fX; } in x()
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;
49 SkScalar length() const { return SkPoint3::Length(fX, fY, fZ); } in length()
61 p.set(scale * fX, scale * fY, scale * fZ); in makeScale()
68 fX *= value; in scale()
78 neg.fX = -fX;
88 return { a.fX - b.fX, a.fY - b.fY, a.fZ - b.fZ };
94 return { a.fX + b.fX, a.fY + b.fY, a.fZ + b.fZ };
[all …]
/third_party/skia/gm/
Dgradients_2pt_conical.cpp56 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10; in Make2ConicalOutside()
57 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutside()
58 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()
67 SkScalar radius = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutsideStrip()
68 center0.set(pts[0].fX, pts[0].fY); in Make2ConicalOutsideStrip()
69 center1.set(pts[1].fX, pts[1].fY); in Make2ConicalOutsideStrip()
77 SkScalar radius0 = (pts[1].fX - pts[0].fX) / 10; in Make2ConicalOutsideFlip()
78 SkScalar radius1 = (pts[1].fX - pts[0].fX) / 3; in Make2ConicalOutsideFlip()
79 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutsideFlip()
[all …]
/third_party/skia/src/core/
DSkLineClipper.cpp33 return SkScalarAve(src[0].fX, src[1].fX); in sect_with_horizontal()
37 double X0 = src[0].fX; in sect_with_horizontal()
39 double X1 = src[1].fX; in sect_with_horizontal()
52 SkScalar dx = src[1].fX - src[0].fX; in sect_with_vertical()
58 double X0 = src[0].fX; in sect_with_vertical()
60 double X1 = src[1].fX; in sect_with_vertical()
131 if (tmp[0].fX < tmp[1].fX) { in IntersectLine()
140 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight)) { in IntersectLine()
143 if (tmp[0].fX != tmp[1].fX || tmp[0].fX < clip.fLeft || tmp[0].fX > clip.fRight) { in IntersectLine()
148 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
[all …]
DSkRRect.cpp152 if (radii[i].fX <= 0 || radii[i].fY <= 0) { in clamp_to_zero()
157 radii[i].fX = 0; in clamp_to_zero()
172 if (!SkScalarsAreFinite(&radii[0].fX, 8)) { in setRectRadii()
236 scale = compute_min_scale(fRadii[0].fX, fRadii[1].fX, width, scale); in scaleRadii()
238 scale = compute_min_scale(fRadii[2].fX, fRadii[3].fX, width, scale); in scaleRadii()
241 flush_to_zero(fRadii[0].fX, fRadii[1].fX); in scaleRadii()
243 flush_to_zero(fRadii[2].fX, fRadii[3].fX); in scaleRadii()
247 SkScaleToSides::AdjustRadii(width, scale, &fRadii[0].fX, &fRadii[1].fX); in scaleRadii()
249 SkScaleToSides::AdjustRadii(width, scale, &fRadii[2].fX, &fRadii[3].fX); in scaleRadii()
275 if (x < fRect.fLeft + fRadii[kUpperLeft_Corner].fX && in checkCornerContainment()
[all …]
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()
41 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
42 path->lineTo(stop.fX, stop.fY); in SquareCapper()
49 return before.fX * after.fY > before.fY * after.fX; in is_clockwise()
78 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
81 inner->lineTo(pivot.fX - after.fX, pivot.fY - after.fY); in HandleInnerJoin()
96 outer->lineTo(pivot.fX + after.fX, pivot.fY + after.fY); in BluntJoiner()
[all …]
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()
87 pts3D[i].fX -= (lightPos.fX - pts3D[i].fX)*zRatio; in GetSpotShadowTransform()
[all …]
DSkPointPriv.h23 return SkScalarsAreFinite(&array[0].fX, count << 1); in AreFinite()
26 static const SkScalar* AsScalars(const SkPoint& pt) { return &pt.fX; } in AsScalars()
49 SkScalar dx = pt.fX - a.fX; in DistanceToSqd()
55 return !CanNormalize(p1.fX - p2.fX, p1.fY - p2.fY); in EqualsWithinTolerance()
59 return SkScalarNearlyZero(pt.fX - p.fX, tol) in EqualsWithinTolerance()
68 pt.fX = -pt.fX; in Negate()
74 SkScalar tmp = src.fX; in RotateCCW()
75 dst->fX = src.fY; in RotateCCW()
85 SkScalar tmp = src.fX; in RotateCW()
86 dst->fX = -src.fY; in RotateCW()
[all …]
/third_party/skia/tests/
DPathOpsLineIntersectionTest.cpp121 double left = std::min(line1[0].fX, line1[1].fX); in testOne()
122 double right = std::max(line1[0].fX, line1[1].fX); in testOne()
124 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); in testOne()
128 double left = std::min(line2[0].fX, line2[1].fX); in testOne()
129 double right = std::max(line2[0].fX, line2[1].fX); in testOne()
131 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); in testOne()
134 if (line1[0].fX == line1[1].fX) { in testOne()
138 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); in testOne()
141 if (line2[0].fX == line2[1].fX) { in testOne()
145 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); in testOne()
[all …]
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}, {(float) d[3].fX, (float) d[3].fY} }; in cubicSetTest()
78 SkPoint c[4] = { {(float) d[0].fX, (float) d[0].fY}, {(float) d[1].fX, (float) d[1].fY}, in cubicPairSetTest()
79 … {(float) d[2].fX, (float) d[2].fY}, {(float) d[3].fX, (float) d[3].fY} }; in cubicPairSetTest()
94 SkPoint c[3] = { {(float) d[0].fX, (float) d[0].fY}, {(float) d[1].fX, (float) d[1].fY}, in quadSetTest()
95 {(float) d[2].fX, (float) d[2].fY} }; in quadSetTest()
[all …]
DPathOpsTestCommon.cpp32 double dx = c[3].fX - 3 * (c[2].fX - c[1].fX) - c[0].fX; in calc_t_div()
152 if (quad[1].fX < bounds.fLeft) { in CubicToQuads()
153 quad[1].fX = bounds.fLeft; in CubicToQuads()
154 } else if (quad[1].fX > bounds.fRight) { in CubicToQuads()
155 quad[1].fX = bounds.fRight; in CubicToQuads()
174 quadPath->moveTo(pts[0].fX, pts[0].fY); in CubicPathToQuads()
177 quadPath->lineTo(pts[1].fX, pts[1].fY); in CubicPathToQuads()
180 quadPath->quadTo(pts[1].fX, pts[1].fY, pts[2].fX, pts[2].fY); in CubicPathToQuads()
191 quadPath->quadTo(qPts[0].fX, qPts[0].fY, qPts[1].fX, qPts[1].fY); in CubicPathToQuads()
210 simplePath->moveTo(pts[0].fX, pts[0].fY); in CubicPathToSimple()
[all …]
/third_party/skia/src/gpu/
DGrDistanceFieldGenFromVector.cpp24 double fX, fY; member
27 double dx = fX - p.fX; 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) * (pts[1].fX - pts[0].fX), kCloseSqd); in is_colinear()
230 const DPoint p0 = { fPts[0].fX, fPts[0].fY }; in init()
231 const DPoint p2 = { this->endPt().fX, this->endPt().fY }; in init()
232 const double p0x = p0.fX; in init()
[all …]
/third_party/skia/bench/
DGradientBench.cpp60 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
62 return SkGradientShader::MakeRadial(center, center.fX * scale, data.fColors, in MakeRadial()
70 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
72 return SkGradientShader::MakeSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount); in MakeSweep()
79 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeConical()
81 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in MakeConical()
83 return SkGradientShader::MakeTwoPointConical(center1, (pts[1].fX - pts[0].fX) / 7, in MakeConical()
84 center0, (pts[1].fX - pts[0].fX) / 2, in MakeConical()
92 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeConicalZeroRad()
94 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in MakeConicalZeroRad()
[all …]
/third_party/skia/samplecode/
DSampleGradients.cpp69 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeRadial()
71 return SkGradientShader::MakeRadial(center, center.fX, data.fColors, in MakeRadial()
77 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in MakeSweep()
79 return SkGradientShader::MakeSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount); in MakeSweep()
84 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2Conical()
86 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in Make2Conical()
89 center1, (pts[1].fX - pts[0].fX) / 7, in Make2Conical()
90 center0, (pts[1].fX - pts[0].fX) / 2, in Make2Conical()
97 center.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2ConicalConcentric()
100 center, (pts[1].fX - pts[0].fX) / 7, in Make2ConicalConcentric()
[all …]
/third_party/skia/src/gpu/effects/
DGrRRectEffect.cpp302 radius = SkRRectPriv::GetSimpleRadii(rrect).fX; in onSetData()
307 radius = rrect.radii(SkRRect::kUpperLeft_Corner).fX; in onSetData()
314 radius = rrect.radii(SkRRect::kUpperRight_Corner).fX; in onSetData()
321 radius = rrect.radii(SkRRect::kLowerRight_Corner).fX; in onSetData()
328 radius = rrect.radii(SkRRect::kLowerLeft_Corner).fX; in onSetData()
335 radius = rrect.radii(SkRRect::kUpperLeft_Corner).fX; in onSetData()
342 radius = rrect.radii(SkRRect::kUpperLeft_Corner).fX; in onSetData()
349 radius = rrect.radii(SkRRect::kUpperRight_Corner).fX; in onSetData()
356 radius = rrect.radii(SkRRect::kLowerLeft_Corner).fX; in onSetData()
461 r[SkRRect::kUpperLeft_Corner].fX = d->fRandom->nextRangeF(kRadiusMin, 9.f); in TestCreate()
[all …]
/third_party/skia/docs/examples/
DMatrix_mapRadius.cpp12 matrix.setScale(2, .5f, center.fX, center.fY);
13 matrix.postRotate(45, center.fX, center.fY);
22 canvas->drawString("mappedRadius", center.fX + mappedRadius + 3, center.fY, paint);
31 canvas->drawLine(center.fX, center.fY, center.fX + mappedRadius, center.fY, paint);
32 canvas->drawLine(center.fX, center.fY, center.fX, center.fY + mappedRadius, paint);
35 canvas->drawCircle(center.fX, center.fY, circleRadius, paint);
37 canvas->drawLine(center.fX, center.fY, center.fX + circleRadius, center.fY, paint);
38 canvas->drawLine(center.fX, center.fY, center.fX, center.fY + circleRadius, paint);
/third_party/skia/src/gpu/geometry/
DGrPathUtils.cpp85 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) }, in generateQuadraticPoints()
86 { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) }, in generateQuadraticPoints()
88 SkPoint r = { SkScalarAve(q[0].fX, q[1].fX), SkScalarAve(q[0].fY, q[1].fY) }; in generateQuadraticPoints()
116 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) }, in generateCubicPoints()
117 { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) }, in generateCubicPoints()
118 { SkScalarAve(p2.fX, p3.fX), SkScalarAve(p2.fY, p3.fY) } in generateCubicPoints()
121 { SkScalarAve(q[0].fX, q[1].fX), SkScalarAve(q[0].fY, q[1].fY) }, in generateCubicPoints()
122 { SkScalarAve(q[1].fX, q[2].fX), SkScalarAve(q[1].fY, q[2].fY) } in generateCubicPoints()
124 SkPoint s = { SkScalarAve(r[0].fX, r[1].fX), SkScalarAve(r[0].fY, r[1].fY) }; in generateCubicPoints()
144 double x0 = qPts[0].fX; in set()
[all …]

12345678910>>...23