HomeSort by relevance Sort by last modified time
    Searched refs:fY (Results 1 - 25 of 454) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsPoint.h 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
18 double fX, fY;
24 fY += v.fY;
29 fY -= v.fY;
34 fY /= s;
39 fY *= s;
43 SkVector v = {SkDoubleToScalar(fX), SkDoubleToScalar(fY)};
    [all...]
SkPathOpsPoint.cpp 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
15 SkDPoint v = {a.fX + b.fX, a.fY + b.fY};
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 50 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) {
51 if (pts[0].fY > pts[endIndex].fY) {
60 if (pts[0].fY > pts[3].fY) {
66 a = pts[s].fY - pts[e].fY;
68 c = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
    [all...]
SkPathOpsCubic.cpp 25 double sum = (fPts[0].fX - fPts[3].fX) * (fPts[0].fY + fPts[3].fY);
27 sum += (fPts[idx + 1].fX - fPts[idx].fX) * (fPts[idx + 1].fY + fPts[idx].fY);
44 if (startTan.fX == 0 && startTan.fY == 0) {
48 if (endTan.fX == 0 && endTan.fY == 0) {
55 startEdge[1].fX -= startTan.fY;
56 startEdge[1].fY += startTan.fX;
58 endEdge[1].fX -= endTan.fY;
59 endEdge[1].fY += endTan.fX
406 double fy = interp_cubic_coords(&fPts[0].fY, (t1+t2*2)\/3); local
    [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/skia/src/pathops/
SkPathOpsPoint.h 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
18 double fX, fY;
24 fY += v.fY;
29 fY -= v.fY;
34 fY /= s;
39 fY *= s;
43 SkVector v = {SkDoubleToScalar(fX), SkDoubleToScalar(fY)};
    [all...]
SkPathOpsPoint.cpp 10 SkDVector v = {a.fX - b.fX, a.fY - b.fY};
15 SkDPoint v = {a.fX + b.fX, a.fY + b.fY};
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 50 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) {
51 if (pts[0].fY > pts[endIndex].fY) {
60 if (pts[0].fY > pts[3].fY) {
66 a = pts[s].fY - pts[e].fY;
68 c = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
    [all...]
SkPathOpsCubic.cpp 25 double sum = (fPts[0].fX - fPts[3].fX) * (fPts[0].fY + fPts[3].fY);
27 sum += (fPts[idx + 1].fX - fPts[idx].fX) * (fPts[idx + 1].fY + fPts[idx].fY);
44 if (startTan.fX == 0 && startTan.fY == 0) {
48 if (endTan.fX == 0 && endTan.fY == 0) {
55 startEdge[1].fX -= startTan.fY;
56 startEdge[1].fY += startTan.fX;
58 endEdge[1].fX -= endTan.fY;
59 endEdge[1].fY += endTan.fX
406 double fy = interp_cubic_coords(&fPts[0].fY, (t1+t2*2)\/3); local
    [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/include/core/
SkPoint.h 19 int32_t fX, fY;
28 int32_t y() const { return fY; }
30 void setY(int32_t y) { fY = y; }
33 * Returns true iff fX and fY are both zero.
35 bool isZero() const { return (fX | fY) == 0; }
38 * Set both fX and fY to zero. Same as set(0, 0)
40 void setZero() { fX = fY = 0; }
43 void set(int32_t x, int32_t y) { fX = x; fY = y; }
67 void negate() { fX = -fX; fY = -fY; }
    [all...]
  /external/skia/include/core/
SkPoint.h 19 int32_t fX, fY;
28 int32_t y() const { return fY; }
30 void setY(int32_t y) { fY = y; }
33 * Returns true iff fX and fY are both zero.
35 bool isZero() const { return (fX | fY) == 0; }
38 * Set both fX and fY to zero. Same as set(0, 0)
40 void setZero() { fX = fY = 0; }
43 void set(int32_t x, int32_t y) { fX = x; fY = y; }
67 void negate() { fX = -fX; fY = -fY; }
    [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/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/gpu/
GrPoint.h 22 int16_t fX, fY;
26 fY = GrToS16(y);
  /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/gpu/
GrPoint.h 22 int16_t fX, fY;
26 fY = GrToS16(y);
  /external/skia/include/utils/
SkCubicInterval.h 18 return SkEvalCubicInterval(pts[0].fX, pts[0].fY,
19 pts[1].fX, pts[1].fY, x);

Completed in 3262 milliseconds

1 2 3 4 5 6 7 8 91011>>