Searched defs:fCubic (Results 1 - 4 of 4) sorted by relevance
/external/skia/src/pathops/ |
H A D | SkReduceOrder.h | 32 SkDCubic fCubic; member in union:SkReduceOrder
|
H A D | 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 412 const SkDCubic& fCubic; member in class:LineCubicIntersections [all...] |
H A D | SkPathOpsCurve.h | 53 SkDCubic fCubic; member in union:SkDCurve::__anon17138 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);
|
/external/skia/bench/ |
H A D | BezierBench.cpp | 18 SkPath fCubic; member in struct:BezierRec 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);
|
Completed in 123 milliseconds