HomeSort by relevance Sort by last modified time
    Searched refs:fX (Results 1 - 25 of 458) 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;
23 fX += v.fX;
28 fX -= v.fX;
33 fX /= s;
38 fX *= 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 22 if (!between(quad[0].fX, quad[1].fX, quad[2].fX)) {
23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues);
49 if (!is_bounded_by_end_points(c[0].fX, c[1].fX, c[2].fX, c[3].fX)) {
    [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 };
67 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX)
73 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRa
    [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;
405 double fx = interp_cubic_coords(&fPts[0].fX, (t1+t2*2)\/3); local
    [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);
115 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX)
    [all...]
SkLineParameters.h 67 b = pts[e].fX - pts[s].fX;
68 c = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
81 b = pts[1].fX - pts[0].fX;
82 c = pts[0].fX * pts[1].fY - pts[1].fX * pts[0].fY;
104 b = pts[e].fX - pts[s].fX;
    [all...]
  /external/skia/src/pathops/
SkPathOpsPoint.h 14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
18 double fX, fY;
23 fX += v.fX;
28 fX -= v.fX;
33 fX /= s;
38 fX *= 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 22 if (!between(quad[0].fX, quad[1].fX, quad[2].fX)) {
23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues);
49 if (!is_bounded_by_end_points(c[0].fX, c[1].fX, c[2].fX, c[3].fX)) {
    [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 };
67 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX)
73 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRa
    [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;
405 double fx = interp_cubic_coords(&fPts[0].fX, (t1+t2*2)\/3); local
    [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);
115 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX)
    [all...]
SkLineParameters.h 67 b = pts[e].fX - pts[s].fX;
68 c = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
81 b = pts[1].fX - pts[0].fX;
82 c = pts[0].fX * pts[1].fY - pts[1].fX * pts[0].fY;
104 b = pts[e].fX - pts[s].fX;
    [all...]
  /external/clang/test/CodeGenCXX/
constructor-conversion.cpp 11 X(int) : iX(2), fX(2.3) , name("HELLO\n") { }
13 X(const char* arg, int ix=0) { iX = ix; fX = 6.0; name = arg+ix; }
14 X(): iX(100), fX(1.2) {}
16 float fX;
19 printf("iX = %d fX = %f name = %s\n", iX, fX, name);
  /external/chromium_org/third_party/skia/include/core/
SkPoint.h 19 int32_t fX, fY;
27 int32_t x() const { return fX; }
29 void setX(int32_t x) { fX = x; }
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;
27 int32_t x() const { return fX; }
29 void setX(int32_t x) { fX = x; }
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/tests/
PathOpsDRectTest.cpp 48 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(line[0].fX, line[1].fX));
50 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(line[0].fX, line[1].fX));
54 REPORTER_ASSERT(reporter, rect2.fLeft == SkTMin(line[0].fX, line[1].fX));
56 REPORTER_ASSERT(reporter, rect2.fRight == SkTMax(line[0].fX, line[1].fX));
65 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(quad[0].fX,
66 SkTMin(quad[1].fX, quad[2].fX)))
    [all...]
  /external/chromium_org/third_party/skia/include/gpu/
GrPoint.h 22 int16_t fX, fY;
25 fX = GrToS16(x);
  /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;
25 fX = GrToS16(x);
  /external/skia/include/utils/
SkCubicInterval.h 18 return SkEvalCubicInterval(pts[0].fX, pts[0].fY,
19 pts[1].fX, pts[1].fY, x);
  /external/chromium_org/third_party/skia/src/core/
SkStrokerPriv.cpp 18 path->lineTo(stop.fX, stop.fY);
25 SkScalar px = pivot.fX;
27 SkScalar nx = normal.fX;
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...]
SkLineClipper.cpp 29 return SkScalarAve(src[0].fX, src[1].fX);
34 double X0 = src[0].fX;
36 double X1 = src[1].fX;
45 return src[0].fX + SkScalarMulDiv(Y - src[0].fY, src[1].fX - src[0].fX,
53 SkScalar dx = src[1].fX - src[0].fX;
60 double X0 = src[0].fX;
    [all...]
  /external/skia/src/core/
SkStrokerPriv.cpp 18 path->lineTo(stop.fX, stop.fY);
25 SkScalar px = pivot.fX;
27 SkScalar nx = normal.fX;
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...]

Completed in 726 milliseconds

1 2 3 4 5 6 7 8 91011>>