| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsPoint.cpp | 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
15 SkDPoint v = {a.fX + b.fX, a.fY + b.fY};
|
| SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
19 double fY;
23 fY = pt.fY;
30 fY += v.fY;
35 fY -= v.fY;
40 fY /= s
[all...] |
| SkPathOpsRect.cpp | 25 if (!between(quad[0].fY, quad[1].fY, quad[2].fY)) {
26 roots += SkDQuad::FindExtrema(quad[0].fY, quad[1].fY, quad[2].fY, &tValues[roots]);
52 if (!is_bounded_by_end_points(c[0].fY, c[1].fY, c[2].fY, c[3].fY)) {
[all...] |
| SkLineParameters.h | 51 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) {
52 if (pts[0].fY > pts[endIndex].fY) {
61 if (pts[0].fY > pts[3].fY) {
68 fA = pts[s].fY - pts[e].fY;
70 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
[all...] |
| SkPathOpsLine.cpp | 12 fPts[0].fX - t1 * delta.fX, fPts[0].fY - t1 * delta.fY}, {
13 fPts[0].fX - t2 * delta.fX, fPts[0].fY - t2 * delta.fY}}};
52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
68 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) {
73 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRa
[all...] |
| SkPathWriter.cpp | 51 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY);
53 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY);
104 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1].fX, fDefer[1].fY);
106 fPathPtr->lineTo(fDefer[1].fX, fDefer[1].fY);
116 || !AlmostEqualUlps(fDefer[1].fY, fFirstPt.fY)) {
[all...] |
| SkPathOpsQuad.cpp | 53 if (topPt.fY > sub[2].fY || (topPt.fY == sub[2].fY && topPt.fX > sub[2].fX)) {
56 if (!between(sub[0].fY, sub[1].fY, sub[2].fY)) {
58 if (FindExtrema(sub[0].fY, sub[1].fY, sub[2].fY, &extremeT))
[all...] |
| /external/skia/src/pathops/ |
| SkPathOpsPoint.cpp | 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
15 SkDPoint v = {a.fX + b.fX, a.fY + b.fY};
|
| SkPathOpsPoint.h | 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
19 double fY;
23 fY = pt.fY;
30 fY += v.fY;
35 fY -= v.fY;
40 fY /= s
[all...] |
| SkPathOpsRect.cpp | 25 if (!between(quad[0].fY, quad[1].fY, quad[2].fY)) {
26 roots += SkDQuad::FindExtrema(quad[0].fY, quad[1].fY, quad[2].fY, &tValues[roots]);
52 if (!is_bounded_by_end_points(c[0].fY, c[1].fY, c[2].fY, c[3].fY)) {
[all...] |
| SkLineParameters.h | 55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) {
56 if (pts[0].fY > pts[endIndex].fY) {
65 if (pts[0].fY > pts[3].fY) {
72 fA = pts[s].fY - pts[e].fY;
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
[all...] |
| SkPathOpsLine.cpp | 12 fPts[0].fX - t1 * delta.fX, fPts[0].fY - t1 * delta.fY}, {
13 fPts[0].fX - t2 * delta.fX, fPts[0].fY - t2 * delta.fY}}};
52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
68 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) {
73 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRa
[all...] |
| SkPathWriter.cpp | 51 pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY);
53 fPathPtr->cubicTo(pt1.fX, pt1.fY, pt2.fX, pt2.fY, fDefer[1].fX, fDefer[1].fY);
104 SkDebugf("path.lineTo(%1.9g,%1.9g);\n", fDefer[1].fX, fDefer[1].fY);
106 fPathPtr->lineTo(fDefer[1].fX, fDefer[1].fY);
116 || !AlmostEqualUlps(fDefer[1].fY, fFirstPt.fY)) {
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| ActiveEdge_Test.cpp | 51 if ((rh.fAbove.fY - lh.fAbove.fY > lh.fBelow.fY - rh.fAbove.fY
52 && lh.fBelow.fY < rh.fBelow.fY)
53 || (lh.fAbove.fY - rh.fAbove.fY < rh.fBelow.fY - lh.fAbove.fY
[all...] |
| /external/skia/experimental/Intersection/ |
| ActiveEdge_Test.cpp | 51 if ((rh.fAbove.fY - lh.fAbove.fY > lh.fBelow.fY - rh.fAbove.fY
52 && lh.fBelow.fY < rh.fBelow.fY)
53 || (lh.fAbove.fY - rh.fAbove.fY < rh.fBelow.fY - lh.fAbove.fY
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkPoint.h | 19 int16_t fX, fY;
28 int16_t y() const { return fY; }
32 fY = SkToS16(y);
41 int32_t fX, fY;
50 int32_t y() const { return fY; }
52 void setY(int32_t y) { fY = y; }
55 * Returns true iff fX and fY are both zero.
57 bool isZero() const { return (fX | fY) == 0; }
60 * Set both fX and fY to zero. Same as set(0, 0)
62 void setZero() { fX = fY = 0;
[all...] |
| /external/skia/include/core/ |
| SkPoint.h | 19 int16_t fX, fY;
28 int16_t y() const { return fY; }
32 fY = SkToS16(y);
41 int32_t fX, fY;
50 int32_t y() const { return fY; }
52 void setY(int32_t y) { fY = y; }
55 * Returns true iff fX and fY are both zero.
57 bool isZero() const { return (fX | fY) == 0; }
60 * Set both fX and fY to zero. Same as set(0, 0)
62 void setZero() { fX = fY = 0;
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkQuadClipper.cpp | 42 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t);
55 if (srcPts[0].fY > srcPts[2].fY) {
68 if (dst[2].fY <= ctop || dst[0].fY >= cbot) {
76 if (dst[0].fY < ctop) {
86 if (dst[i].fY < ctop) {
87 dst[i].fY = ctop
[all...] |
| SkStrokerPriv.cpp | 18 path->lineTo(stop.fX, stop.fY);
26 SkScalar py = pivot.fY;
28 SkScalar ny = normal.fY;
37 stop.fX, stop.fY);
49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY);
[all...] |
| /external/skia/src/core/ |
| SkQuadClipper.cpp | 42 return chopMonoQuadAt(pts[0].fY, pts[1].fY, pts[2].fY, y, t);
55 if (srcPts[0].fY > srcPts[2].fY) {
68 if (dst[2].fY <= ctop || dst[0].fY >= cbot) {
76 if (dst[0].fY < ctop) {
86 if (dst[i].fY < ctop) {
87 dst[i].fY = ctop
[all...] |
| SkStrokerPriv.cpp | 18 path->lineTo(stop.fX, stop.fY);
26 SkScalar py = pivot.fY;
28 SkScalar ny = normal.fY;
37 stop.fX, stop.fY);
49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY);
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| PathOpsDRectTest.cpp | 49 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(line[0].fY, line[1].fY));
51 REPORTER_ASSERT(reporter, rect.fBottom == SkTMax(line[0].fY, line[1].fY));
55 REPORTER_ASSERT(reporter, rect2.fTop == SkTMin(line[0].fY, line[1].fY));
57 REPORTER_ASSERT(reporter, rect2.fBottom == SkTMax(line[0].fY, line[1].fY));
67 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(quad[0].fY,
68 SkTMin(quad[1].fY, quad[2].fY)))
[all...] |
| /external/skia/tests/ |
| PathOpsDRectTest.cpp | 49 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(line[0].fY, line[1].fY));
51 REPORTER_ASSERT(reporter, rect.fBottom == SkTMax(line[0].fY, line[1].fY));
55 REPORTER_ASSERT(reporter, rect2.fTop == SkTMin(line[0].fY, line[1].fY));
57 REPORTER_ASSERT(reporter, rect2.fBottom == SkTMax(line[0].fY, line[1].fY));
67 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(quad[0].fY,
68 SkTMin(quad[1].fY, quad[2].fY)))
[all...] |
| /external/chromium_org/third_party/skia/include/utils/ |
| SkCubicInterval.h | 18 return SkEvalCubicInterval(pts[0].fX, pts[0].fY,
19 pts[1].fX, pts[1].fY, x);
|
| /external/skia/include/utils/ |
| SkCubicInterval.h | 18 return SkEvalCubicInterval(pts[0].fX, pts[0].fY,
19 pts[1].fX, pts[1].fY, x);
|
