/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | Extrema.h | 7 int findExtrema(double a, double b, double c, double d, double tValues[2]);
|
H A D | QuadraticBounds.cpp | 27 double tValues[2]; local 30 roots = findExtrema(quad[0].x, quad[1].x, quad[2].x, tValues); 33 roots += findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValues[roots]); 37 xy_at_t(quad, tValues[x], result.x, result.y);
|
H A D | CubicBounds.cpp | 46 double tValues[4]; local 49 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 52 roots += findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, &tValues[roots]); 56 xy_at_t(cubic, tValues[x], result.x, result.y);
|
H A D | CubicReduceOrder.cpp | 28 double tValues[2]; local 36 int roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); 38 double yExtrema = interp_cubic_coords(&cubic[0].y, tValues[index]); 51 double tValues[2]; local 59 int roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 61 double xExtrema = interp_cubic_coords(&cubic[0].x, tValues[index]); 127 double tValues[2]; local 130 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 132 roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); 136 extrema.x = interp_cubic_coords(&cubic[0].x, tValues[inde [all...] |
H A D | CubicUtilities.h | 33 int find_cubic_inflections(const Cubic& src, double tValues[]); 34 int find_cubic_max_curvature(const Cubic& src, double tValues[]);
|
H A D | Extrema.cpp | 60 int findExtrema(double a, double b, double c, double d, double tValues[2]) argument 67 return findUnitQuadRoots(A, B, C, tValues);
|
H A D | CubicUtilities.cpp | 306 int find_cubic_inflections(const Cubic& src, double tValues[]) argument 314 return quadraticRootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues); 340 int find_cubic_max_curvature(const Cubic& src, double tValues[]) argument 349 return cubicRootsValidT(coeffX[0], coeffX[1], coeffX[2], coeffX[3], tValues);
|
/external/skia/experimental/Intersection/ |
H A D | Extrema.h | 7 int findExtrema(double a, double b, double c, double d, double tValues[2]);
|
H A D | QuadraticBounds.cpp | 27 double tValues[2]; local 30 roots = findExtrema(quad[0].x, quad[1].x, quad[2].x, tValues); 33 roots += findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValues[roots]); 37 xy_at_t(quad, tValues[x], result.x, result.y);
|
H A D | CubicBounds.cpp | 46 double tValues[4]; local 49 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 52 roots += findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, &tValues[roots]); 56 xy_at_t(cubic, tValues[x], result.x, result.y);
|
H A D | CubicReduceOrder.cpp | 28 double tValues[2]; local 36 int roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); 38 double yExtrema = interp_cubic_coords(&cubic[0].y, tValues[index]); 51 double tValues[2]; local 59 int roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 61 double xExtrema = interp_cubic_coords(&cubic[0].x, tValues[index]); 127 double tValues[2]; local 130 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues); 132 roots = findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, tValues); 136 extrema.x = interp_cubic_coords(&cubic[0].x, tValues[inde [all...] |
H A D | CubicUtilities.h | 33 int find_cubic_inflections(const Cubic& src, double tValues[]); 34 int find_cubic_max_curvature(const Cubic& src, double tValues[]);
|
H A D | Extrema.cpp | 60 int findExtrema(double a, double b, double c, double d, double tValues[2]) argument 67 return findUnitQuadRoots(A, B, C, tValues);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsRect.cpp | 20 double tValues[2]; local 23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues); 26 roots += SkDQuad::FindExtrema(quad[0].fY, quad[1].fY, quad[2].fY, &tValues[roots]); 29 add(quad.ptAtT(tValues[x])); 47 double tValues[4]; local 50 roots = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, tValues); 53 roots += SkDCubic::FindExtrema(c[0].fY, c[1].fY, c[2].fY, c[3].fY, &tValues[roots]); 56 add(c.ptAtT(tValues[x]));
|
H A D | SkPathOpsCubic.h | 40 int findInflections(double tValues[2]) const; 42 static int FindInflections(const SkPoint a[4], double tValues[2]) { argument 45 return cubic.findInflections(tValues); 48 int findMaxCurvature(double tValues[]) const;
|
H A D | SkPathOpsCubic.cpp | 168 double tValues[2]; 170 return findInflections(tValues) > 1; 313 int SkDCubic::findInflections(double tValues[]) const { 320 return SkDQuad::RootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues); 339 int SkDCubic::FindExtrema(double a, double b, double c, double d, double tValues[2]) { argument 345 return SkDQuad::RootsValidT(A, B, C, tValues); 360 int SkDCubic::findMaxCurvature(double tValues[]) const { 368 return RootsValidT(coeffX[0], coeffX[1], coeffX[2], coeffX[3], tValues);
|
/external/skia/src/pathops/ |
H A D | SkPathOpsRect.cpp | 20 double tValues[2]; local 23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues); 26 roots += SkDQuad::FindExtrema(quad[0].fY, quad[1].fY, quad[2].fY, &tValues[roots]); 29 add(quad.ptAtT(tValues[x])); 47 double tValues[4]; local 50 roots = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, tValues); 53 roots += SkDCubic::FindExtrema(c[0].fY, c[1].fY, c[2].fY, c[3].fY, &tValues[roots]); 56 add(c.ptAtT(tValues[x]));
|
H A D | SkPathOpsCubic.h | 40 int findInflections(double tValues[2]) const; 42 static int FindInflections(const SkPoint a[4], double tValues[2]) { argument 45 return cubic.findInflections(tValues); 48 int findMaxCurvature(double tValues[]) const;
|
H A D | SkPathOpsCubic.cpp | 168 double tValues[2]; 170 return findInflections(tValues) > 1; 313 int SkDCubic::findInflections(double tValues[]) const { 320 return SkDQuad::RootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues); 339 int SkDCubic::FindExtrema(double a, double b, double c, double d, double tValues[2]) { argument 345 return SkDQuad::RootsValidT(A, B, C, tValues); 360 int SkDCubic::findMaxCurvature(double tValues[]) const { 368 return RootsValidT(coeffX[0], coeffX[1], coeffX[2], coeffX[3], tValues);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | GeometryTest.cpp | 17 Inspired by this test, which used to assert that the tValues had dups 28 SkScalar tValues[3]; local 30 int count = SkChopCubicAtMaxCurvature(src, dst, tValues);
|
/external/skia/tests/ |
H A D | GeometryTest.cpp | 17 Inspired by this test, which used to assert that the tValues had dups 28 SkScalar tValues[3]; local 30 int count = SkChopCubicAtMaxCurvature(src, dst, tValues);
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkGeometry.h | 60 Returned count tValues[] 62 1 0 < tValues[0] < 1 64 int SkFindQuadExtrema(SkScalar a, SkScalar b, SkScalar c, SkScalar tValues[1]); 130 Returned count tValues[] 132 1 0 < tValues[0] < 1 133 2 0 < tValues[0] < tValues[1] < 1 136 SkScalar tValues[2]); 152 int SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[2]); 160 int SkFindCubicMaxCurvature(const SkPoint src[4], SkScalar tValues[ [all...] |
H A D | SkGeometry.cpp | 452 SkScalar tValues[2]) { 458 return SkFindUnitQuadRoots(A, B, C, tValues); 489 valid_unit_divide in SkChopCubicAt(... tValues[], int roots). The reason is 510 const SkScalar tValues[], int roots) { 515 SkASSERT(is_unit_interval(tValues[i])); 516 SkASSERT(is_unit_interval(tValues[i+1])); 517 SkASSERT(tValues[i] < tValues[i+1]); 526 SkScalar t = tValues[0]; 541 if (!valid_unit_divide(tValues[ 451 SkFindCubicExtrema(SkScalar a, SkScalar b, SkScalar c, SkScalar d, SkScalar tValues[2]) argument 509 SkChopCubicAt(const SkPoint src[4], SkPoint dst[], const SkScalar tValues[], int roots) argument 629 SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[]) argument 644 SkScalar tValues[2]; local [all...] |
/external/skia/src/core/ |
H A D | SkGeometry.h | 60 Returned count tValues[] 62 1 0 < tValues[0] < 1 64 int SkFindQuadExtrema(SkScalar a, SkScalar b, SkScalar c, SkScalar tValues[1]); 130 Returned count tValues[] 132 1 0 < tValues[0] < 1 133 2 0 < tValues[0] < tValues[1] < 1 136 SkScalar tValues[2]); 152 int SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[2]); 160 int SkFindCubicMaxCurvature(const SkPoint src[4], SkScalar tValues[ [all...] |
H A D | SkGeometry.cpp | 452 SkScalar tValues[2]) { 458 return SkFindUnitQuadRoots(A, B, C, tValues); 489 valid_unit_divide in SkChopCubicAt(... tValues[], int roots). The reason is 510 const SkScalar tValues[], int roots) { 515 SkASSERT(is_unit_interval(tValues[i])); 516 SkASSERT(is_unit_interval(tValues[i+1])); 517 SkASSERT(tValues[i] < tValues[i+1]); 526 SkScalar t = tValues[0]; 541 if (!valid_unit_divide(tValues[ 451 SkFindCubicExtrema(SkScalar a, SkScalar b, SkScalar c, SkScalar d, SkScalar tValues[2]) argument 509 SkChopCubicAt(const SkPoint src[4], SkPoint dst[], const SkScalar tValues[], int roots) argument 629 SkFindCubicInflections(const SkPoint src[4], SkScalar tValues[]) argument 644 SkScalar tValues[2]; local [all...] |