| /external/skia/src/pathops/ |
| SkPathOpsRect.cpp | 16 double tValues[2];
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues);
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]);
25 double t = startT + (endT - startT) * tValues[index];
33 double tValues[2];
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues);
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]);
42 double t = startT + (endT - startT) * tValues[index];
50 double tValues[4];
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues);
[all...] |
| SkPathOpsCubic.h | 65 int findInflections(double tValues[2]) const;
67 static int FindInflections(const SkPoint a[kPointCount], double tValues[2]) {
69 return cubic.set(a).findInflections(tValues);
72 int findMaxCurvature(double tValues[]) const;
|
| SkPathOpsConic.cpp | 35 double tValues[2];
36 int roots = SkDQuad::RootsValidT(coeff[0], coeff[1], coeff[2], tValues);
43 t[0] = tValues[0];
|
| SkPathOpsCubic.cpp | 518 int SkDCubic::findInflections(double tValues[]) const {
525 return SkDQuad::RootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues);
544 int SkDCubic::FindExtrema(const double src[], double tValues[2]) {
554 return SkDQuad::RootsValidT(A, B, C, tValues);
569 int SkDCubic::findMaxCurvature(double tValues[]) const {
577 return RootsValidT(coeffX[0], coeffX[1], coeffX[2], coeffX[3], tValues);
|
| /external/skqp/src/pathops/ |
| SkPathOpsRect.cpp | 16 double tValues[2];
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues);
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]);
25 double t = startT + (endT - startT) * tValues[index];
33 double tValues[2];
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues);
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]);
42 double t = startT + (endT - startT) * tValues[index];
50 double tValues[4];
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues);
[all...] |
| SkPathOpsCubic.h | 65 int findInflections(double tValues[2]) const;
67 static int FindInflections(const SkPoint a[kPointCount], double tValues[2]) {
69 return cubic.set(a).findInflections(tValues);
72 int findMaxCurvature(double tValues[]) const;
|
| SkPathOpsConic.cpp | 35 double tValues[2];
36 int roots = SkDQuad::RootsValidT(coeff[0], coeff[1], coeff[2], tValues);
43 t[0] = tValues[0];
|
| SkPathOpsCubic.cpp | 518 int SkDCubic::findInflections(double tValues[]) const {
525 return SkDQuad::RootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues);
544 int SkDCubic::FindExtrema(const double src[], double tValues[2]) {
554 return SkDQuad::RootsValidT(A, B, C, tValues);
569 int SkDCubic::findMaxCurvature(double tValues[]) const {
577 return RootsValidT(coeffX[0], coeffX[1], coeffX[2], coeffX[3], tValues);
|
| /external/skia/src/core/ |
| SkGeometry.cpp | 349 SkScalar tValues[2]) {
355 return SkFindUnitQuadRoots(A, B, C, tValues);
386 valid_unit_divide in SkChopCubicAt(... tValues[], int roots). The reason is
407 const SkScalar tValues[], int roots) {
412 SkASSERT(is_unit_interval(tValues[i]));
413 SkASSERT(is_unit_interval(tValues[i+1]));
414 SkASSERT(tValues[i] < tValues[i+1]);
423 SkScalar t = tValues[0];
438 if (!valid_unit_divide(tValues[i+1] - tValues[i]
[all...] |
| SkGeometry.h | 58 Returned count tValues[]
60 1 0 < tValues[0] < 1
62 int SkFindQuadExtrema(SkScalar a, SkScalar b, SkScalar c, SkScalar tValues[1]);
124 Returned count tValues[]
126 1 0 < tValues[0] < 1
127 2 0 < tValues[0] < tValues[1] < 1
130 SkScalar tValues[2]);
146 int SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[2]);
154 int SkFindCubicMaxCurvature(const SkPoint src[4], SkScalar tValues[3])
[all...] |
| SkStroke.cpp | 608 SkScalar tValues[3];
609 int count = SkFindCubicMaxCurvature(cubic, tValues);
616 SkScalar t = tValues[index];
[all...] |
| SkScan_Hairline.cpp | 397 SkScalar tValues[3];
399 int count = SkChopCubicAtMaxCurvature(pts, tmp, tValues);
|
| /external/skqp/src/core/ |
| SkGeometry.cpp | 349 SkScalar tValues[2]) {
355 return SkFindUnitQuadRoots(A, B, C, tValues);
386 valid_unit_divide in SkChopCubicAt(... tValues[], int roots). The reason is
407 const SkScalar tValues[], int roots) {
412 SkASSERT(is_unit_interval(tValues[i]));
413 SkASSERT(is_unit_interval(tValues[i+1]));
414 SkASSERT(tValues[i] < tValues[i+1]);
423 SkScalar t = tValues[0];
438 if (!valid_unit_divide(tValues[i+1] - tValues[i]
[all...] |
| SkGeometry.h | 58 Returned count tValues[]
60 1 0 < tValues[0] < 1
62 int SkFindQuadExtrema(SkScalar a, SkScalar b, SkScalar c, SkScalar tValues[1]);
124 Returned count tValues[]
126 1 0 < tValues[0] < 1
127 2 0 < tValues[0] < tValues[1] < 1
130 SkScalar tValues[2]);
146 int SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[2]);
154 int SkFindCubicMaxCurvature(const SkPoint src[4], SkScalar tValues[3])
[all...] |
| SkStroke.cpp | 607 SkScalar tValues[3];
608 int count = SkFindCubicMaxCurvature(cubic, tValues);
615 SkScalar t = tValues[index];
[all...] |
| SkScan_Hairline.cpp | 397 SkScalar tValues[3];
399 int count = SkChopCubicAtMaxCurvature(pts, tmp, tValues);
|
| /external/skia/tests/ |
| GeometryTest.cpp | 21 Inspired by this test, which used to assert that the tValues had dups
32 SkScalar tValues[3];
34 int count = SkChopCubicAtMaxCurvature(src, dst, tValues);
|
| /external/skqp/tests/ |
| GeometryTest.cpp | 21 Inspired by this test, which used to assert that the tValues had dups
32 SkScalar tValues[3];
34 int count = SkChopCubicAtMaxCurvature(src, dst, tValues);
|
