/external/skia/tests/ |
PathOpsDCubicTest.cpp | 21 const SkDCubic& cubic = tests[index]; local 22 SkASSERT(ValidCubic(cubic)); 23 bool result = cubic.clockwise();
|
GeometryTest.cpp | 51 const SkPoint cubic[] = { local 58 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
|
PathOpsDRectTest.cpp | 82 const SkDCubic& cubic = cubicTests[index]; local 83 SkASSERT(ValidCubic(cubic)); 84 rect.setRawBounds(cubic); 85 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(cubic[0].fX, 86 SkTMin(cubic[1].fX, SkTMin(cubic[2].fX, cubic[3].fX)))); 87 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(cubic[0].fY, 88 SkTMin(cubic[1].fY, SkTMin(cubic[2].fY, cubic[3].fY)))) [all...] |
PathOpsLineParametetersTest.cpp | 43 const SkDCubic& cubic = tests[index]; local 44 SkASSERT(ValidCubic(cubic)); 45 lineParameters.cubicEndPoints(cubic, 0, 3); 47 denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 48 denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2); 67 normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 68 normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
|
PathOpsCubicQuadIntersectionTest.cpp | 15 SkDCubic cubic; member in struct:lineCubic 33 const SkDCubic& cubic = quadCubicTests[index].cubic; local 34 SkASSERT(ValidCubic(cubic)); 39 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics, 43 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 51 int roots = i.intersect(cubic, quad); 55 SkDPoint xy1 = cubic.ptAtT(tt1);
|
PathOpsCubicLineIntersectionTest.cpp | 15 SkDCubic cubic; member in struct:lineCubic 35 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; local 36 SkASSERT(ValidCubic(cubic)); 41 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics, 45 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 54 int roots = i.intersect(cubic, line); 57 SkDPoint xy1 = cubic.ptAtT(tt1); 80 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; local [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
SkPathOpsBounds.cpp | 13 SkDCubic cubic; local 14 cubic.set(a); 16 dRect.setBounds(cubic);
|
SkPathOpsCubic.h | 40 static void Coefficients(const double* cubic, double* A, double* B, double* C, double* D); 48 SkDCubic cubic; local 49 cubic.set(a); 50 return cubic.findInflections(tValues); 63 SkDCubic cubic; local 64 cubic.set(a); 65 return cubic.subDivide(t1, t2); 72 SkDCubic cubic; local 73 cubic.set(pts); 74 cubic.subDivide(a, d, t1, t2, p) [all...] |
SkIntersections.cpp | 46 SkDCubic cubic; local 47 cubic.set(pts); 48 return intersectRay(cubic, line); 186 SkDCubic cubic; local 187 cubic.set(a); 188 return vertical(cubic, top, bottom, x, flipped);
|
SkPathOpsCurve.h | 27 SkDCubic cubic; local 28 cubic.set(a); 29 return cubic.ptAtT(t); 71 SkDCubic cubic; local 72 cubic.set(a); 73 return cubic.dxdyAtT(t); 110 SkDCubic cubic; local 111 cubic.set(a); 112 SkDPoint topPt = cubic.top(startT, endT); 138 SkDCubic cubic; local [all...] |
SkIntersections.h | 52 int cubic(const SkPoint a[4]) { function in class:SkIntersections 53 SkDCubic cubic; local 54 cubic.set(a); 55 return intersect(cubic); 68 SkDCubic cubic; local 69 cubic.set(a); 70 return horizontal(cubic, left, right, y, flipped); 74 SkDCubic cubic; local 75 cubic.set(a); 76 return vertical(cubic, top, bottom, x, flipped) 80 SkDCubic cubic; local 88 SkDCubic cubic; local [all...] |
SkPathOpsQuad.cpp | 147 SkDCubic cubic; local 148 cubic[0] = fPts[0]; 149 cubic[2] = fPts[1]; 150 cubic[3] = fPts[2]; 151 cubic[1].fX = (cubic[0].fX + cubic[2].fX * 2) / 3; 152 cubic[1].fY = (cubic[0].fY + cubic[2].fY * 2) / 3 [all...] |
SkReduceOrder.cpp | 137 // note that three points in a line doesn't simplify a cubic 195 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) { 196 reduction[0] = reduction[1] = cubic[0]; 204 static int vertical_line(const SkDCubic& cubic, SkReduceOrder::Style reduceStyle, 207 reduction[0] = cubic[0]; 208 reduction[1] = cubic[3]; 214 int roots = SkDCubic::FindExtrema(cubic[0].fY, cubic[1].fY, cubic[2].fY, cubic[3].fY, tValues) 442 SkDCubic cubic; local [all...] |
/external/skia/src/pathops/ |
SkPathOpsBounds.cpp | 13 SkDCubic cubic; local 14 cubic.set(a); 16 dRect.setBounds(cubic);
|
SkPathOpsCubic.h | 40 static void Coefficients(const double* cubic, double* A, double* B, double* C, double* D); 48 SkDCubic cubic; local 49 cubic.set(a); 50 return cubic.findInflections(tValues); 63 SkDCubic cubic; local 64 cubic.set(a); 65 return cubic.subDivide(t1, t2); 72 SkDCubic cubic; local 73 cubic.set(pts); 74 cubic.subDivide(a, d, t1, t2, p) [all...] |
SkIntersections.cpp | 46 SkDCubic cubic; local 47 cubic.set(pts); 48 return intersectRay(cubic, line); 186 SkDCubic cubic; local 187 cubic.set(a); 188 return vertical(cubic, top, bottom, x, flipped);
|
SkPathOpsCurve.h | 27 SkDCubic cubic; local 28 cubic.set(a); 29 return cubic.ptAtT(t); 71 SkDCubic cubic; local 72 cubic.set(a); 73 return cubic.dxdyAtT(t); 110 SkDCubic cubic; local 111 cubic.set(a); 112 SkDPoint topPt = cubic.top(startT, endT); 138 SkDCubic cubic; local [all...] |
SkIntersections.h | 52 int cubic(const SkPoint a[4]) { function in class:SkIntersections 53 SkDCubic cubic; local 54 cubic.set(a); 55 return intersect(cubic); 68 SkDCubic cubic; local 69 cubic.set(a); 70 return horizontal(cubic, left, right, y, flipped); 74 SkDCubic cubic; local 75 cubic.set(a); 76 return vertical(cubic, top, bottom, x, flipped) 80 SkDCubic cubic; local 88 SkDCubic cubic; local [all...] |
SkPathOpsQuad.cpp | 147 SkDCubic cubic; local 148 cubic[0] = fPts[0]; 149 cubic[2] = fPts[1]; 150 cubic[3] = fPts[2]; 151 cubic[1].fX = (cubic[0].fX + cubic[2].fX * 2) / 3; 152 cubic[1].fY = (cubic[0].fY + cubic[2].fY * 2) / 3 [all...] |
SkReduceOrder.cpp | 137 // note that three points in a line doesn't simplify a cubic 195 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) { 196 reduction[0] = reduction[1] = cubic[0]; 204 static int vertical_line(const SkDCubic& cubic, SkReduceOrder::Style reduceStyle, 207 reduction[0] = cubic[0]; 208 reduction[1] = cubic[3]; 214 int roots = SkDCubic::FindExtrema(cubic[0].fY, cubic[1].fY, cubic[2].fY, cubic[3].fY, tValues) 442 SkDCubic cubic; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
SVGPathSegListSource.cpp | 101 SVGPathSegCurvetoCubic* cubic = static_cast<SVGPathSegCurvetoCubic*>(m_segment.get()); local 102 point1 = FloatPoint(cubic->x1(), cubic->y1()); 103 point2 = FloatPoint(cubic->x2(), cubic->y2()); 104 targetPoint = FloatPoint(cubic->x(), cubic->y());
|
/external/chromium_org/third_party/skia/src/pdf/ |
SkPDFUtils.cpp | 154 SkPoint cubic[4]; local 155 SkConvertQuadToCubic(args, cubic); 156 AppendCubic(cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[2].fY, 157 cubic[3].fX, cubic[3].fY, ¤tSegment);
|
/external/skia/src/pdf/ |
SkPDFUtils.cpp | 154 SkPoint cubic[4]; local 155 SkConvertQuadToCubic(args, cubic); 156 AppendCubic(cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[2].fY, 157 cubic[3].fX, cubic[3].fY, ¤tSegment);
|
/external/chromium_org/third_party/skia/src/utils/win/ |
SkDWriteGeometrySink.cpp | 88 } Cubic[4], Quadratic[3]; 90 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { 91 float dx10 = cubic[1].x - cubic[0].x; 92 float dx23 = cubic[2].x - cubic[3].x; 93 float midX = cubic[0].x + dx10 * 3 / 2; 94 //NOTE: !approximately_equal(midX - cubic[3].x, dx23 * 3 / 2) 96 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) 118 Cubic cubic = { { prevPt.x, prevPt.y }, local [all...] |
/external/skia/src/utils/win/ |
SkDWriteGeometrySink.cpp | 88 } Cubic[4], Quadratic[3]; 90 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { 91 float dx10 = cubic[1].x - cubic[0].x; 92 float dx23 = cubic[2].x - cubic[3].x; 93 float midX = cubic[0].x + dx10 * 3 / 2; 94 //NOTE: !approximately_equal(midX - cubic[3].x, dx23 * 3 / 2) 96 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) 118 Cubic cubic = { { prevPt.x, prevPt.y }, local [all...] |