HomeSort by relevance Sort by last modified time
    Searched refs:fX (Results 51 - 75 of 458) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsBounds.h 37 if (pt.fX < fLeft) fLeft = pt.fX;
39 if (pt.fX > fRight) fRight = pt.fX;
44 return AlmostLessOrEqualUlps(fLeft, pt.fX)
45 && AlmostLessOrEqualUlps(pt.fX, fRight)
63 fLeft = fRight = pt.fX;
SkPathOpsCurve.h 127 return AlmostEqualUlps(dst[0].fX, dst[1].fX);
134 return AlmostEqualUlps(dst[0].fX, dst[1].fX) && AlmostEqualUlps(dst[1].fX, dst[2].fX);
141 return AlmostEqualUlps(dst[0].fX, dst[1].fX) && AlmostEqualUlps(dst[1].fX, dst[2].fX)
    [all...]
SkDCubicToQuads.cpp 69 double dx = c[3].fX - 3 * (c[2].fX - c[1].fX) - c[0].fX;
83 const SkDPoint fromC1 = {(3 * fPts[1].fX - fPts[0].fX) / 2, (3 * fPts[1].fY - fPts[0].fY) / 2};
84 const SkDPoint fromC2 = {(3 * fPts[2].fX - fPts[3].fX) / 2, (3 * fPts[2].fY - fPts[3].fY) / 2};
85 quad[1].fX = (fromC1.fX + fromC2.fX) / 2
    [all...]
  /external/skia/src/pathops/
SkPathOpsBounds.h 37 if (pt.fX < fLeft) fLeft = pt.fX;
39 if (pt.fX > fRight) fRight = pt.fX;
44 return AlmostLessOrEqualUlps(fLeft, pt.fX)
45 && AlmostLessOrEqualUlps(pt.fX, fRight)
63 fLeft = fRight = pt.fX;
SkPathOpsCurve.h 127 return AlmostEqualUlps(dst[0].fX, dst[1].fX);
134 return AlmostEqualUlps(dst[0].fX, dst[1].fX) && AlmostEqualUlps(dst[1].fX, dst[2].fX);
141 return AlmostEqualUlps(dst[0].fX, dst[1].fX) && AlmostEqualUlps(dst[1].fX, dst[2].fX)
    [all...]
SkDCubicToQuads.cpp 69 double dx = c[3].fX - 3 * (c[2].fX - c[1].fX) - c[0].fX;
83 const SkDPoint fromC1 = {(3 * fPts[1].fX - fPts[0].fX) / 2, (3 * fPts[1].fY - fPts[0].fY) / 2};
84 const SkDPoint fromC2 = {(3 * fPts[2].fX - fPts[3].fX) / 2, (3 * fPts[2].fY - fPts[3].fY) / 2};
85 quad[1].fX = (fromC1.fX + fromC2.fX) / 2
    [all...]
  /external/chromium_org/third_party/skia/src/utils/
SkParsePath.cpp 51 str = SkParse::FindScalars(str, &value[0].fX, count * 2);
54 value[index].fX += relative->fX;
113 data = find_scalar(data, &x, relative, c.fX);
115 c.fX = x;
120 path.lineTo(c.fX, y);
130 points[0].fX -= lastc.fX - c.fX;
145 points[0].fX = c.fX * 2 - lastc.fX
    [all...]
  /external/skia/gm/
gradients_no_texture.cpp 38 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
40 return SkGradientShader::CreateRadial(center, center.fX, data.fColors,
47 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
49 return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors,
56 center0.set(SkScalarAve(pts[0].fX, pts[1].fX),
58 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5)
    [all...]
  /external/skia/src/utils/
SkParsePath.cpp 51 str = SkParse::FindScalars(str, &value[0].fX, count * 2);
54 value[index].fX += relative->fX;
113 data = find_scalar(data, &x, relative, c.fX);
115 c.fX = x;
120 path.lineTo(c.fX, y);
130 points[0].fX -= lastc.fX - c.fX;
145 points[0].fX = c.fX * 2 - lastc.fX
    [all...]
  /external/skia/tests/
PathOpsCubicReduceOrderTest.cpp 17 return between(cubic[0].fX, cubic[1].fX, cubic[3].fX)
18 && between(cubic[0].fX, cubic[2].fX, cubic[3].fX)
27 if (cubic[minX].fX > cubic[index].fX) {
33 if (cubic[maxX].fX < cubic[index].fX) {
    [all...]
PathOpsQuadLineIntersectionThreadedTest.cpp 18 if (line[0].fX == line[1].fX) {
25 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped);
27 double left = line[0].fX;
28 double right = line[1].fX;
46 str += sprintf(str, " path.moveTo(%1.9g, %1.9g);\n", quad[0].fX, quad[0].fY);
47 str += sprintf(str, " path.quadTo(%1.9g, %1.9g, %1.9g, %1.9g);\n", quad[1].fX,
48 quad[1].fY, quad[2].fX, quad[2].fY);
49 str += sprintf(str, " path.moveTo(%1.9g, %1.9g);\n", line[0].fX, line[0].fY);
50 str += sprintf(str, " path.lineTo(%1.9g, %1.9g);\n", line[1].fX, line[1].fY)
    [all...]
PathOpsDVectorTest.cpp 30 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0);
34 REPORTER_ASSERT(reporter, v2.fX == 0 && v2.fY == 0);
39 REPORTER_ASSERT(reporter, v1.fX == 0 && v1.fY == 0);
41 REPORTER_ASSERT(reporter, sv.fX == 0 && sv.fY == 0);
PathOpsQuadParameterizationTest.cpp 13 double xx = q.x2() * point.fX * point.fX;
14 double xy = q.xy() * point.fX * point.fY;
16 double x = q.x() * point.fX;
ClipCubicTest.cpp 35 (float)crv[0].fX, (float)crv[0].fY,
36 (float)crv[1].fX, (float)crv[1].fY,
37 (float)crv[2].fX, (float)crv[2].fY,
38 (float)crv[3].fX, (float)crv[3].fY);
47 if (SkScalarAbs(c0[i].fX - c1[i].fX) > tol ||
64 crv[0].fX = x0; crv[0].fY = y0;
65 crv[1].fX = x1; crv[1].fY = y1;
66 crv[2].fX = x2; crv[2].fY = y2;
67 crv[3].fX = x3; crv[3].fY = y3
    [all...]
PathOpsCubicLineIntersectionTest.cpp 72 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
101 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prev.fX, prev.fY, sect.fX, sect.fY);
102 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", sect.fX, sect.fY, cubic[3].fX, cubic[3].fY);
104 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prevL.fX, prevL.fY, i.pt(0).fX, i.pt(0).fY);
106 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", i.pt(0).fX, i.pt(0).fY, nextL.fX, nextL.fY)
    [all...]
  /external/skia/bench/
GradientBench.cpp 58 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
60 return SkGradientShader::CreateRadial(center, center.fX * scale,
70 center.set(SkScalarAve(pts[0].fX, pts[1].fX),
72 return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors,
81 center0.set(SkScalarAve(pts[0].fX, pts[1].fX),
83 center1.set(SkScalarInterp(pts[0].fX, pts[1].fX, SkIntToScalar(3)/5)
    [all...]
  /external/chromium_org/third_party/skia/src/core/
SkPerspIter.h 43 SkFixed fX, fY;
SkGeometry.cpp 31 if (pt.fX > pts[0].fX && pt.fX > pts[1].fX)
36 if (SkScalarNearlyZero(pts[0].fX - pts[1].fX)) {
39 if (pt.fX <= pts[0].fX) {
49 if (pt.fX <= pts[1].fX) {
    [all...]
  /external/chromium_org/third_party/skia/src/gpu/
GrClipData.cpp 26 fClipStack->getConservativeBounds(-fOrigin.fX,
FlingState.cpp 42 if (SkScalarAbs(unit->fX) < TOLERANCE) {
43 unit->fX = 0;
46 unit->fX = SkScalarSign(unit->fX);
59 // printf("---- speed %g dir %g %g\n", fSpeed0, fDirection.fX, fDirection.fY);
79 float tx = fDirection.fX * dist;
  /external/skia/src/core/
SkPerspIter.h 43 SkFixed fX, fY;
SkGeometry.cpp 31 if (pt.fX > pts[0].fX && pt.fX > pts[1].fX)
36 if (SkScalarNearlyZero(pts[0].fX - pts[1].fX)) {
39 if (pt.fX <= pts[0].fX) {
49 if (pt.fX <= pts[1].fX) {
    [all...]
  /external/skia/src/gpu/
GrClipData.cpp 26 fClipStack->getConservativeBounds(-fOrigin.fX,
  /external/chromium_org/skia/ext/
platform_device_mac.cc 51 CGContextMoveToPoint(context, points[0].fX, points[0].fY);
55 CGContextAddLineToPoint(context, points[1].fX, points[1].fY);
59 CGContextAddQuadCurveToPoint(context, points[1].fX, points[1].fY,
60 points[2].fX, points[2].fY);
64 CGContextAddCurveToPoint(context, points[1].fX, points[1].fY,
65 points[2].fX, points[2].fY,
66 points[3].fX, points[3].fY);
  /external/icu4c/layout/
MarkToBasePosnSubtables.cpp 80 float anchorDiffX = baseAnchor.fX - markAnchor.fX;
88 glyphIterator->setCurrGlyphPositionAdjustment(anchorDiffX, anchorDiffY, -markAdvance.fX, -markAdvance.fY);
101 pixels.fX += px.fX; // and add that to the base glyph's advance
109 glyphIterator->setCurrGlyphPositionAdjustment(anchorDiffX - baseAdvance.fX, anchorDiffY - baseAdvance.fY, -markAdvance.fX, -markAdvance.fY);

Completed in 357 milliseconds

1 23 4 5 6 7 8 91011>>