/external/skia/src/pathops/ |
SkDCubicLineIntersection.cpp | 86 : fCubic(c) 101 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); 127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp; 136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp 137 + (fCubic[n].fX - fLine[0].fX) * adj; 190 int count = HorizontalIntersect(fCubic, axisIntercept, roots); 193 SkDPoint pt = { fCubic.ptAtT(cubicT).fX, axisIntercept }; 217 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); 223 SkDPoint cPt = fCubic.ptAtT(cubicT) [all...] |
SkPathOpsCubic.h | 186 SkDCubic fCubic; 191 : fCubic(c) { 196 const SkDPoint& operator[](int n) const override { return fCubic[n]; } 197 SkDPoint& operator[](int n) override { return fCubic[n]; } 199 bool collapsed() const override { return fCubic.collapsed(); } 200 bool controlsInside() const override { return fCubic.controlsInside(); } 201 void debugInit() override { return fCubic.debugInit(); } 203 void dumpID(int id) const override { return fCubic.dumpID(id); } 205 SkDVector dxdyAtT(double t) const override { return fCubic.dxdyAtT(t); } 207 SkOpGlobalState* globalState() const override { return fCubic.globalState(); [all...] |
SkReduceOrder.h | 32 SkDCubic fCubic;
|
SkPathOpsCurve.cpp | 15 double minX = fCubic.fPts[0].fX; 18 minX = SkTMin(minX, fCubic.fPts[index].fX); 19 maxX = SkTMax(maxX, fCubic.fPts[index].fX); 24 double minY = fCubic.fPts[0].fY; 27 minY = SkTMin(minY, fCubic.fPts[index].fY); 28 maxY = SkTMax(maxY, fCubic.fPts[index].fY); 58 fCubic.fPts[index] += off; 77 dRect.setBounds(dCurve, fCubic, tStart, tEnd);
|
SkReduceOrder.cpp | 227 return coincident_line(cubic, fCubic); 229 return vertical_line(cubic, fCubic); 232 return horizontal_line(cubic, fCubic); 234 int result = check_linear(cubic, minX, maxX, minY, maxY, fCubic); 239 && (result = check_quadratic(cubic, fCubic))) { 242 fCubic = cubic;
|
SkPathOpsCurve.h | 53 SkDCubic fCubic; 59 return fCubic[n]; 64 return fCubic[n]; 147 return c.fCubic.ptAtT(t); 227 return c.fCubic.dxdyAtT(t); 349 i->intersectRay(c.fCubic, ray);
|
SkOpSegment.cpp | 188 path->cubicTo(curvePart.fCurve.fCubic[1].asSkPoint(), 189 curvePart.fCurve.fCubic[2].asSkPoint(), end->ptT()); [all...] |
SkPathOpsCubic.cpp | 737 return i->intersectRay(fCubic, line); 741 return quad.hullIntersects(fCubic, isLinear); 745 return conic.hullIntersects(fCubic, isLinear); 749 rect->setBounds(fCubic);
|
SkOpSegment.h | 55 curve.fCubic.set(pts);
|
SkOpAngle.cpp | [all...] |
/external/skqp/src/pathops/ |
SkDCubicLineIntersection.cpp | 86 : fCubic(c) 101 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); 127 c[n].fX = (fCubic[n].fY - fLine[0].fY) * adj - (fCubic[n].fX - fLine[0].fX) * opp; 136 c[n].fY = (fCubic[n].fY - fLine[0].fY) * opp 137 + (fCubic[n].fX - fLine[0].fX) * adj; 190 int count = HorizontalIntersect(fCubic, axisIntercept, roots); 193 SkDPoint pt = { fCubic.ptAtT(cubicT).fX, axisIntercept }; 217 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); 223 SkDPoint cPt = fCubic.ptAtT(cubicT) [all...] |
SkPathOpsCubic.h | 186 SkDCubic fCubic; 191 : fCubic(c) { 196 const SkDPoint& operator[](int n) const override { return fCubic[n]; } 197 SkDPoint& operator[](int n) override { return fCubic[n]; } 199 bool collapsed() const override { return fCubic.collapsed(); } 200 bool controlsInside() const override { return fCubic.controlsInside(); } 201 void debugInit() override { return fCubic.debugInit(); } 203 void dumpID(int id) const override { return fCubic.dumpID(id); } 205 SkDVector dxdyAtT(double t) const override { return fCubic.dxdyAtT(t); } 207 SkOpGlobalState* globalState() const override { return fCubic.globalState(); [all...] |
SkReduceOrder.h | 32 SkDCubic fCubic;
|
SkPathOpsCurve.cpp | 15 double minX = fCubic.fPts[0].fX; 18 minX = SkTMin(minX, fCubic.fPts[index].fX); 19 maxX = SkTMax(maxX, fCubic.fPts[index].fX); 24 double minY = fCubic.fPts[0].fY; 27 minY = SkTMin(minY, fCubic.fPts[index].fY); 28 maxY = SkTMax(maxY, fCubic.fPts[index].fY); 58 fCubic.fPts[index] += off; 77 dRect.setBounds(dCurve, fCubic, tStart, tEnd);
|
SkReduceOrder.cpp | 227 return coincident_line(cubic, fCubic); 229 return vertical_line(cubic, fCubic); 232 return horizontal_line(cubic, fCubic); 234 int result = check_linear(cubic, minX, maxX, minY, maxY, fCubic); 239 && (result = check_quadratic(cubic, fCubic))) { 242 fCubic = cubic;
|
SkPathOpsCurve.h | 53 SkDCubic fCubic; 59 return fCubic[n]; 64 return fCubic[n]; 147 return c.fCubic.ptAtT(t); 227 return c.fCubic.dxdyAtT(t); 349 i->intersectRay(c.fCubic, ray);
|
SkOpSegment.cpp | 188 path->cubicTo(curvePart.fCurve.fCubic[1].asSkPoint(), 189 curvePart.fCurve.fCubic[2].asSkPoint(), end->ptT()); [all...] |
SkPathOpsCubic.cpp | 737 return i->intersectRay(fCubic, line); 741 return quad.hullIntersects(fCubic, isLinear); 745 return conic.hullIntersects(fCubic, isLinear); 749 rect->setBounds(fCubic);
|
SkOpSegment.h | 55 curve.fCubic.set(pts);
|
SkOpAngle.cpp | [all...] |
/external/skia/bench/ |
BezierBench.cpp | 18 SkPath fCubic; 39 const SkPath& path = rec->fCubic; 72 fRec.fCubic.moveTo(20, 20); 73 fRec.fCubic.cubicTo(40, 20, 60, 40, 60, 60); 74 fRec.fCubic.cubicTo(40, 60, 20, 80, 20, 100);
|
/external/skqp/bench/ |
BezierBench.cpp | 18 SkPath fCubic; 39 const SkPath& path = rec->fCubic; 72 fRec.fCubic.moveTo(20, 20); 73 fRec.fCubic.cubicTo(40, 20, 60, 40, 60, 60); 74 fRec.fCubic.cubicTo(40, 60, 20, 80, 20, 100);
|
/external/skia/tests/ |
PathOpsBoundsTest.cpp | 70 curve.fCubic.set(curvePts);
|
PathOpsDebug.cpp | 132 fCubic.dumpID(id); 138 fCubic.dumpID(id); [all...] |
/external/skqp/tests/ |
PathOpsBoundsTest.cpp | 70 curve.fCubic.set(curvePts);
|