Home
last modified time | relevance | path

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

12345678910>>...28

/external/chromium_org/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;
34 fX -= v.fX;
39 fX /= s;
44 fX *= s;
49 SkVector v = {SkDoubleToScalar(fX), SkDoubleToScalar(fY)}; in asSkVector()
54 return fX * a.fY - fY * a.fX; in cross()
59 double xy = fX * a.fY; in crossCheck()
[all …]
DSkPathOpsCubic.cpp23 double calcPos = (&cubicAtT.fX)[xAxis]; in binarySearch()
29 if (approximately_equal(lessPt.fX, cubicAtT.fX) in binarySearch()
33 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept; in binarySearch()
46 if (approximately_equal(morePt.fX, cubicAtT.fX) in binarySearch()
50 double moreDist = (&morePt.fX)[xAxis] - axisIntercept; in binarySearch()
58 calcPos = (&cubicAtT.fX)[xAxis]; in binarySearch()
74 double sum = (fPts[0].fX - fPts[3].fX) * (fPts[0].fY + fPts[3].fY); in clockwise()
76 sum += (fPts[idx + 1].fX - fPts[idx].fX) * (fPts[idx + 1].fY + fPts[idx].fY); in clockwise()
93 if (startTan.fX == 0 && startTan.fY == 0) { in controlsContainedByEnds()
97 if (endTan.fX == 0 && endTan.fY == 0) { in controlsContainedByEnds()
[all …]
DSkPathOpsLine.cpp12 fPts[0].fX - t1 * delta.fX, fPts[0].fY - t1 * delta.fY}, { in subDivide()
13 fPts[0].fX - t2 * delta.fX, fPts[0].fY - t2 * delta.fY}}}; in subDivide()
52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; in ptAtT()
67 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX) in nearPoint()
73 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearPoint()
75 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearPoint()
83 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
84 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
100 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearRay()
102 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearRay()
[all …]
DSkPathOpsQuad.cpp53 if (topPt.fY > sub[2].fY || (topPt.fY == sub[2].fY && topPt.fX > sub[2].fX)) { in top()
61 if (topPt.fY > test.fY || (topPt.fY == test.fY && topPt.fX > test.fX)) { in top()
151 cubic[1].fX = (cubic[0].fX + cubic[2].fX * 2) / 3; in toCubic()
153 cubic[2].fX = (cubic[3].fX + cubic[2].fX * 2) / 3; in toCubic()
162 SkDVector result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX, in dxdyAtT()
179 SkDPoint result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX, in ptAtT()
220 double ax = dst[0].fX = interp_quad_coords(&fPts[0].fX, t1); in subDivide()
222 double dx = interp_quad_coords(&fPts[0].fX, (t1 + t2) / 2); in subDivide()
224 double cx = dst[2].fX = interp_quad_coords(&fPts[0].fX, t2); in subDivide()
226 /* bx = */ dst[1].fX = 2*dx - (ax + cx)/2; in subDivide()
[all …]
DSkPathWriter.cpp51 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); in cubicTo()
53 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); in cubicTo()
104 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1].fX, fDefer[1].fY); in lineTo()
106 fPathPtr->lineTo(fDefer[1].fX, fDefer[1].fY); in lineTo()
115 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX) in nudge()
134 pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY); in quadTo()
136 fPathPtr->quadTo(pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY); in quadTo()
148 SkScalar deferDx = fDefer[1].fX - fDefer[0].fX; in changedSlopes()
150 SkScalar lineDx = pt.fX - fDefer[1].fX; in changedSlopes()
161 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fDefer[0].fX, fDefer[0].fY); in moveTo()
[all …]
/external/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;
34 fX -= v.fX;
39 fX /= s;
44 fX *= s;
49 SkVector v = {SkDoubleToScalar(fX), SkDoubleToScalar(fY)}; in asSkVector()
54 return fX * a.fY - fY * a.fX; in cross()
59 double xy = fX * a.fY; in crossCheck()
[all …]
DSkPathOpsCubic.cpp23 double calcPos = (&cubicAtT.fX)[xAxis]; in binarySearch()
29 if (approximately_equal(lessPt.fX, cubicAtT.fX) in binarySearch()
33 double lessDist = (&lessPt.fX)[xAxis] - axisIntercept; in binarySearch()
46 if (approximately_equal(morePt.fX, cubicAtT.fX) in binarySearch()
50 double moreDist = (&morePt.fX)[xAxis] - axisIntercept; in binarySearch()
58 calcPos = (&cubicAtT.fX)[xAxis]; in binarySearch()
74 double sum = (fPts[0].fX - fPts[3].fX) * (fPts[0].fY + fPts[3].fY); in clockwise()
76 sum += (fPts[idx + 1].fX - fPts[idx].fX) * (fPts[idx + 1].fY + fPts[idx].fY); in clockwise()
93 if (startTan.fX == 0 && startTan.fY == 0) { in controlsContainedByEnds()
97 if (endTan.fX == 0 && endTan.fY == 0) { in controlsContainedByEnds()
[all …]
DSkPathOpsLine.cpp12 fPts[0].fX - t1 * delta.fX, fPts[0].fY - t1 * delta.fY}, { in subDivide()
13 fPts[0].fX - t2 * delta.fX, fPts[0].fY - t2 * delta.fY}}}; in subDivide()
52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY }; in ptAtT()
67 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX) in nearPoint()
73 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearPoint()
75 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearPoint()
83 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
84 double largest = SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint()
100 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay in nearRay()
102 double numer = len.fX * ab0.fX + ab0.fY * len.fY; in nearRay()
[all …]
DSkPathOpsQuad.cpp53 if (topPt.fY > sub[2].fY || (topPt.fY == sub[2].fY && topPt.fX > sub[2].fX)) { in top()
61 if (topPt.fY > test.fY || (topPt.fY == test.fY && topPt.fX > test.fX)) { in top()
151 cubic[1].fX = (cubic[0].fX + cubic[2].fX * 2) / 3; in toCubic()
153 cubic[2].fX = (cubic[3].fX + cubic[2].fX * 2) / 3; in toCubic()
162 SkDVector result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX, in dxdyAtT()
179 SkDPoint result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX, in ptAtT()
220 double ax = dst[0].fX = interp_quad_coords(&fPts[0].fX, t1); in subDivide()
222 double dx = interp_quad_coords(&fPts[0].fX, (t1 + t2) / 2); in subDivide()
224 double cx = dst[2].fX = interp_quad_coords(&fPts[0].fX, t2); in subDivide()
226 /* bx = */ dst[1].fX = 2*dx - (ax + cx)/2; in subDivide()
[all …]
DSkPathWriter.cpp51 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); in cubicTo()
53 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY); in cubicTo()
104 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1].fX, fDefer[1].fY); in lineTo()
106 fPathPtr->lineTo(fDefer[1].fX, fDefer[1].fY); in lineTo()
115 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX) in nudge()
134 pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY); in quadTo()
136 fPathPtr->quadTo(pt1.fX, pt1.fY, fDefer[1].fX, fDefer[1].fY); in quadTo()
148 SkScalar deferDx = fDefer[1].fX - fDefer[0].fX; in changedSlopes()
150 SkScalar lineDx = pt.fX - fDefer[1].fX; in changedSlopes()
161 SkDebugf("path.moveTo(%1.9g,%1.9g);\n", fDefer[0].fX, fDefer[0].fY); in moveTo()
[all …]
/external/chromium_org/third_party/skia/include/core/
DSkPoint.h19 int16_t fX, fY; member
27 int16_t x() const { return fX; } in x()
31 fX = SkToS16(x); in set()
41 int32_t fX, fY; member
49 int32_t x() const { return fX; } in x()
51 void setX(int32_t x) { fX = x; } in setX()
57 bool isZero() const { return (fX | fY) == 0; } in isZero()
62 void setZero() { fX = fY = 0; } in setZero()
65 void set(int32_t x, int32_t y) { fX = x; fY = y; } in set()
89 void negate() { fX = -fX; fY = -fY; } in negate()
[all …]
/external/skia/include/core/
DSkPoint.h19 int16_t fX, fY; member
27 int16_t x() const { return fX; } in x()
31 fX = SkToS16(x); in set()
41 int32_t fX, fY; member
49 int32_t x() const { return fX; } in x()
51 void setX(int32_t x) { fX = x; } in setX()
57 bool isZero() const { return (fX | fY) == 0; } in isZero()
62 void setZero() { fX = fY = 0; } in setZero()
65 void set(int32_t x, int32_t y) { fX = x; fY = y; } in set()
89 void negate() { fX = -fX; fY = -fY; } in negate()
[all …]
/external/chromium_org/third_party/skia/gm/
Dgradients_2pt_conical.cpp43 SkScalar radius0 = SkScalarDiv(pts[1].fX - pts[0].fX, 10); in Make2ConicalOutside()
44 SkScalar radius1 = SkScalarDiv(pts[1].fX - pts[0].fX, 3); in Make2ConicalOutside()
45 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutside()
46 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutside()
56 SkScalar radius0 = SkScalarDiv(pts[1].fX - pts[0].fX, 10); in Make2ConicalOutsideFlip()
57 SkScalar radius1 = SkScalarDiv(pts[1].fX - pts[0].fX, 3); in Make2ConicalOutsideFlip()
58 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutsideFlip()
59 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutsideFlip()
69 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2ConicalInside()
71 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in Make2ConicalInside()
[all …]
/external/skia/gm/
Dgradients_2pt_conical.cpp43 SkScalar radius0 = SkScalarDiv(pts[1].fX - pts[0].fX, 10); in Make2ConicalOutside()
44 SkScalar radius1 = SkScalarDiv(pts[1].fX - pts[0].fX, 3); in Make2ConicalOutside()
45 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutside()
46 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutside()
56 SkScalar radius0 = SkScalarDiv(pts[1].fX - pts[0].fX, 10); in Make2ConicalOutsideFlip()
57 SkScalar radius1 = SkScalarDiv(pts[1].fX - pts[0].fX, 3); in Make2ConicalOutsideFlip()
58 center0.set(pts[0].fX + radius0, pts[0].fY + radius0); in Make2ConicalOutsideFlip()
59 center1.set(pts[1].fX - radius1, pts[1].fY - radius1); in Make2ConicalOutsideFlip()
69 center0.set(SkScalarAve(pts[0].fX, pts[1].fX), in Make2ConicalInside()
71 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5), in Make2ConicalInside()
[all …]
/external/chromium_org/third_party/skia/src/core/
DSkStrokerPriv.cpp18 path->lineTo(stop.fX, stop.fY); in ButtCapper()
25 SkScalar px = pivot.fX; in RoundCapper()
27 SkScalar nx = normal.fX; in RoundCapper()
37 stop.fX, stop.fY); in RoundCapper()
49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
54 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
55 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
56 path->lineTo(stop.fX, stop.fY); in SquareCapper()
64 return SkScalarMul(before.fX, after.fY) - SkScalarMul(before.fY, after.fX) > 0; in is_clockwise()
[all …]
DSkRRect.cpp114 if (fRadii[i].fX <= 0 || fRadii[i].fY <= 0) { in setRectRadii()
119 fRadii[i].fX = 0; in setRectRadii()
143 if (fRadii[0].fX + fRadii[1].fX > rect.width()) { in setRectRadii()
145 SkScalarDiv(rect.width(), fRadii[0].fX + fRadii[1].fX)); in setRectRadii()
151 if (fRadii[2].fX + fRadii[3].fX > rect.width()) { in setRectRadii()
153 SkScalarDiv(rect.width(), fRadii[2].fX + fRadii[3].fX)); in setRectRadii()
162 fRadii[i].fX = SkScalarMul(fRadii[i].fX, scale); in setRectRadii()
185 if (x < fRect.fLeft + fRadii[kUpperLeft_Corner].fX && in checkCornerContainment()
189 canonicalPt.set(x - (fRect.fLeft + fRadii[kUpperLeft_Corner].fX), in checkCornerContainment()
191 SkASSERT(canonicalPt.fX < 0 && canonicalPt.fY < 0); in checkCornerContainment()
[all …]
DSkLineClipper.cpp29 return SkScalarAve(src[0].fX, src[1].fX); in sect_with_horizontal()
33 double X0 = src[0].fX; in sect_with_horizontal()
35 double X1 = src[1].fX; in sect_with_horizontal()
48 SkScalar dx = src[1].fX - src[0].fX; in sect_with_vertical()
54 double X0 = src[0].fX; in sect_with_vertical()
56 double X1 = src[1].fX; in sect_with_vertical()
118 if (tmp[0].fX < tmp[1].fX) { in IntersectLine()
127 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) && in IntersectLine()
128 tmp[index0].fX < tmp[index1].fX) { in IntersectLine()
133 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
[all …]
/external/skia/src/core/
DSkStrokerPriv.cpp18 path->lineTo(stop.fX, stop.fY); in ButtCapper()
25 SkScalar px = pivot.fX; in RoundCapper()
27 SkScalar nx = normal.fX; in RoundCapper()
37 stop.fX, stop.fY); in RoundCapper()
49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
54 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
55 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
56 path->lineTo(stop.fX, stop.fY); in SquareCapper()
64 return SkScalarMul(before.fX, after.fY) - SkScalarMul(before.fY, after.fX) > 0; in is_clockwise()
[all …]
DSkRRect.cpp114 if (fRadii[i].fX <= 0 || fRadii[i].fY <= 0) { in setRectRadii()
119 fRadii[i].fX = 0; in setRectRadii()
143 if (fRadii[0].fX + fRadii[1].fX > rect.width()) { in setRectRadii()
145 SkScalarDiv(rect.width(), fRadii[0].fX + fRadii[1].fX)); in setRectRadii()
151 if (fRadii[2].fX + fRadii[3].fX > rect.width()) { in setRectRadii()
153 SkScalarDiv(rect.width(), fRadii[2].fX + fRadii[3].fX)); in setRectRadii()
162 fRadii[i].fX = SkScalarMul(fRadii[i].fX, scale); in setRectRadii()
185 if (x < fRect.fLeft + fRadii[kUpperLeft_Corner].fX && in checkCornerContainment()
189 canonicalPt.set(x - (fRect.fLeft + fRadii[kUpperLeft_Corner].fX), in checkCornerContainment()
191 SkASSERT(canonicalPt.fX < 0 && canonicalPt.fY < 0); in checkCornerContainment()
[all …]
DSkLineClipper.cpp29 return SkScalarAve(src[0].fX, src[1].fX); in sect_with_horizontal()
33 double X0 = src[0].fX; in sect_with_horizontal()
35 double X1 = src[1].fX; in sect_with_horizontal()
48 SkScalar dx = src[1].fX - src[0].fX; in sect_with_vertical()
54 double X0 = src[0].fX; in sect_with_vertical()
56 double X1 = src[1].fX; in sect_with_vertical()
118 if (tmp[0].fX < tmp[1].fX) { in IntersectLine()
127 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) && in IntersectLine()
128 tmp[index0].fX < tmp[index1].fX) { in IntersectLine()
133 if (tmp[index0].fX < clip.fLeft) { in IntersectLine()
[all …]
/external/skia/tests/
DPathOpsLineIntersectionTest.cpp106 double left = SkTMin(line1[0].fX, line1[1].fX); in testOne()
107 double right = SkTMax(line1[0].fX, line1[1].fX); in testOne()
109 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); in testOne()
113 double left = SkTMin(line2[0].fX, line2[1].fX); in testOne()
114 double right = SkTMax(line2[0].fX, line2[1].fX); in testOne()
116 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); in testOne()
119 if (line1[0].fX == line1[1].fX) { in testOne()
123 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); in testOne()
126 if (line2[0].fX == line2[1].fX) { in testOne()
130 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); in testOne()
[all …]
DPathOpsDRectTest.cpp48 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(line[0].fX, line[1].fX)); in DEF_TEST()
50 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(line[0].fX, line[1].fX)); in DEF_TEST()
54 REPORTER_ASSERT(reporter, rect2.fLeft == SkTMin(line[0].fX, line[1].fX)); in DEF_TEST()
56 REPORTER_ASSERT(reporter, rect2.fRight == SkTMax(line[0].fX, line[1].fX)); in DEF_TEST()
65 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(quad[0].fX, in DEF_TEST()
66 SkTMin(quad[1].fX, quad[2].fX))); in DEF_TEST()
69 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(quad[0].fX, in DEF_TEST()
70 SkTMax(quad[1].fX, quad[2].fX))); in DEF_TEST()
85 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(cubic[0].fX, in DEF_TEST()
86 SkTMin(cubic[1].fX, SkTMin(cubic[2].fX, cubic[3].fX)))); in DEF_TEST()
[all …]
/external/chromium_org/third_party/skia/tests/
DPathOpsLineIntersectionTest.cpp113 double left = SkTMin(line1[0].fX, line1[1].fX); in testOne()
114 double right = SkTMax(line1[0].fX, line1[1].fX); in testOne()
116 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); in testOne()
120 double left = SkTMin(line2[0].fX, line2[1].fX); in testOne()
121 double right = SkTMax(line2[0].fX, line2[1].fX); in testOne()
123 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); in testOne()
126 if (line1[0].fX == line1[1].fX) { in testOne()
130 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); in testOne()
133 if (line2[0].fX == line2[1].fX) { in testOne()
137 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); in testOne()
[all …]
DPathOpsDRectTest.cpp48 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(line[0].fX, line[1].fX)); in DEF_TEST()
50 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(line[0].fX, line[1].fX)); in DEF_TEST()
54 REPORTER_ASSERT(reporter, rect2.fLeft == SkTMin(line[0].fX, line[1].fX)); in DEF_TEST()
56 REPORTER_ASSERT(reporter, rect2.fRight == SkTMax(line[0].fX, line[1].fX)); in DEF_TEST()
65 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(quad[0].fX, in DEF_TEST()
66 SkTMin(quad[1].fX, quad[2].fX))); in DEF_TEST()
69 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(quad[0].fX, in DEF_TEST()
70 SkTMax(quad[1].fX, quad[2].fX))); in DEF_TEST()
85 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(cubic[0].fX, in DEF_TEST()
86 SkTMin(cubic[1].fX, SkTMin(cubic[2].fX, cubic[3].fX)))); in DEF_TEST()
[all …]
/external/skia/experimental/Intersection/
DLogoPlay.cpp69 dest.set(SkScalarAve(a.fX, b.fX),SkScalarAve(a.fY, b.fY)); in midPt()
85 m.set(SkScalarHalf(3*j.fX - c.fX), SkScalarHalf(3*j.fY - c.fY)); in quadApprox()
86 n.set(SkScalarHalf(3*o.fX -q.fX), SkScalarHalf(3*o.fY - q.fY)); in quadApprox()
91 m.set(SkScalarHalf(3*p.fX - c.fX), SkScalarHalf(3*p.fY - c.fY)); in quadApprox()
92 n.set(SkScalarHalf(3*l.fX -p2.fX),SkScalarHalf(3*l.fY -p2.fY)); in quadApprox()
138 str = SkParse::FindScalars(str, &value[0].fX, count * 2); in find_points()
141 value[index].fX += relative->fX; in find_points()
163 SkDebugf("path.moveTo(%1.9gf,%1.9gf);\n", pts[0].fX, pts[0].fY); in showPathContour()
166 SkDebugf("path.lineTo(%1.9gf,%1.9gf);\n", pts[1].fX, pts[1].fY); in showPathContour()
170 pts[1].fX, pts[1].fY, pts[2].fX, pts[2].fY); in showPathContour()
[all …]

12345678910>>...28