/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsDCubicTest.cpp | 21 const SkDCubic& cubic = tests[index]; local 22 SkASSERT(ValidCubic(cubic)); 23 bool result = cubic.clockwise();
|
H A D | GeometryTest.cpp | 50 const SkPoint cubic[] = { local 57 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
|
H A D | 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[ [all...] |
H A D | 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);
|
/external/skia/tests/ |
H A D | PathOpsDCubicTest.cpp | 21 const SkDCubic& cubic = tests[index]; local 22 SkASSERT(ValidCubic(cubic)); 23 bool result = cubic.clockwise();
|
H A D | GeometryTest.cpp | 50 const SkPoint cubic[] = { local 57 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
|
H A D | 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[ [all...] |
H A D | 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);
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicUtilities_Test.cpp | 21 const Cubic& cubic = tests[index]; local 22 bool result = clockwise(cubic);
|
H A D | CubicLineSegments.cpp | 12 void hodograph(const Cubic& cubic, Quadratic& hodo) { argument 13 hodo[0].x = 3 * (cubic[1].x - cubic[0].x); 14 hodo[0].y = 3 * (cubic[1].y - cubic[0].y); 15 hodo[1].x = 3 * (cubic[2].x - cubic[1].x); 16 hodo[1].y = 3 * (cubic[2].y - cubic[1].y); 17 hodo[2].x = 3 * (cubic[ 22 secondHodograph(const Cubic& cubic, _Line& hodo2) argument 30 subDivisions(const Cubic& cubic) argument [all...] |
H A D | LineParameteters_Test.cpp | 45 const Cubic& cubic = tests[index]; local 46 lineParameters.cubicEndPoints(cubic); 48 denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 49 denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2); 68 normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 69 normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
|
H A D | TestUtilities.cpp | 12 void quad_to_cubic(const Quadratic& quad, Cubic& cubic) { argument 13 cubic[0] = quad[0]; 14 cubic[1].x = quad[0].x / 3 + quad[1].x * 2 / 3; 15 cubic[1].y = quad[0].y / 3 + quad[1].y * 2 / 3; 16 cubic[2].x = quad[2].x / 3 + quad[1].x * 2 / 3; 17 cubic[2].y = quad[2].y / 3 + quad[1].y * 2 / 3; 18 cubic[3] = quad[2]; 21 static bool tiny(const Cubic& cubic) { argument 25 if (cubic[minX].x > cubic[inde 42 find_tight_bounds(const Cubic& cubic, _Rect& bounds) argument 59 controls_inside(const Cubic& cubic) argument [all...] |
H A D | CubicBounds.cpp | 16 double leftMostT(const Cubic& cubic, double startT, double endT) { argument 19 int results = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, leftTs); 29 xy_at_t(cubic, leftTs[0], pt[0].x, pt[0].y); 30 xy_at_t(cubic, leftTs[1], pt[1].x, pt[1].y); 38 xy_at_t(cubic, startT, pt[0].x, pt[0].y); 39 xy_at_t(cubic, endT, pt[1].x, pt[1].y); 43 void _Rect::setBounds(const Cubic& cubic) { argument 61 setRawBounds(const Cubic& cubic) argument [all...] |
H A D | ConvexHull.cpp | 11 /* Given a cubic, find the convex hull described by the end and control points. 22 int convex_hull(const Cubic& cubic, char order[4]) { argument 27 if (cubic[yMin].y > cubic[index].y || (cubic[yMin].y == cubic[index].y 28 && cubic[yMin].x > cubic[index].x)) { 47 if (!rotate(cubic, yMin, index, rotPath)) { // ! if cbc[yMin]==cbc[idx] 83 if (!rotate(cubic, leas 106 convex_x_hull(const Cubic& cubic, char connectTo0[2], char connectTo3[2]) argument [all...] |
H A D | CubicParameterization_TestUtility.cpp | 6 static void parameter_coeffs(const Cubic& cubic, double coeffs[coeff_count]) { argument 10 alt_set_abcd(&cubic[0].x, ax, bx, cx, dx); 12 set_abcd(&cubic[0].x, ax, bx, cx, dx); 15 alt_set_abcd(&cubic[0].y, ay, by, cy, dy); 17 set_abcd(&cubic[0].y, ay, by, cy, dy); 22 double ax = cubic[0].x; 23 double bx = cubic[1].x; 24 double cx = cubic[2].x; 25 double dx = cubic[3].x; 26 double ay = cubic[ 38 point_on_parameterized_curve(const Cubic& cubic, const _Point& point) argument [all...] |
H A D | CubicToQuadratics.cpp | 2 http://stackoverflow.com/questions/2009160/how-do-i-convert-the-2-control-points-of-a-cubic-curve-to-the-single-control-poi 6 Let's call the control points of the cubic Q0..Q3 and the control points of the quadratic P0..P2. 18 If this is a degree-elevated cubic, then both equations will give the same answer for P1. Since 26 mid-point approx of cubic: a quad that shares the same anchors with the cubic and has the 32 Compute the Tdiv as the root of (cubic) equation 34 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a 37 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point 39 Tdiv>=1 - the entire cubic can be approximated by the mid-point approximation 57 static double calcTDiv(const Cubic& cubic, doubl argument 80 demote_cubic_to_quad(const Cubic& cubic, Quadratic& quad) argument 93 cubic_to_quadratics(const Cubic& cubic, double precision, SkTDArray<Quadratic>& quadratics) argument [all...] |
/external/skia/experimental/Intersection/ |
H A D | CubicUtilities_Test.cpp | 21 const Cubic& cubic = tests[index]; local 22 bool result = clockwise(cubic);
|
H A D | CubicLineSegments.cpp | 12 void hodograph(const Cubic& cubic, Quadratic& hodo) { argument 13 hodo[0].x = 3 * (cubic[1].x - cubic[0].x); 14 hodo[0].y = 3 * (cubic[1].y - cubic[0].y); 15 hodo[1].x = 3 * (cubic[2].x - cubic[1].x); 16 hodo[1].y = 3 * (cubic[2].y - cubic[1].y); 17 hodo[2].x = 3 * (cubic[ 22 secondHodograph(const Cubic& cubic, _Line& hodo2) argument 30 subDivisions(const Cubic& cubic) argument [all...] |
H A D | LineParameteters_Test.cpp | 45 const Cubic& cubic = tests[index]; local 46 lineParameters.cubicEndPoints(cubic); 48 denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 49 denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2); 68 normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 69 normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
|
H A D | TestUtilities.cpp | 12 void quad_to_cubic(const Quadratic& quad, Cubic& cubic) { argument 13 cubic[0] = quad[0]; 14 cubic[1].x = quad[0].x / 3 + quad[1].x * 2 / 3; 15 cubic[1].y = quad[0].y / 3 + quad[1].y * 2 / 3; 16 cubic[2].x = quad[2].x / 3 + quad[1].x * 2 / 3; 17 cubic[2].y = quad[2].y / 3 + quad[1].y * 2 / 3; 18 cubic[3] = quad[2]; 21 static bool tiny(const Cubic& cubic) { argument 25 if (cubic[minX].x > cubic[inde 42 find_tight_bounds(const Cubic& cubic, _Rect& bounds) argument 59 controls_inside(const Cubic& cubic) argument [all...] |
H A D | CubicBounds.cpp | 16 double leftMostT(const Cubic& cubic, double startT, double endT) { argument 19 int results = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, leftTs); 29 xy_at_t(cubic, leftTs[0], pt[0].x, pt[0].y); 30 xy_at_t(cubic, leftTs[1], pt[1].x, pt[1].y); 38 xy_at_t(cubic, startT, pt[0].x, pt[0].y); 39 xy_at_t(cubic, endT, pt[1].x, pt[1].y); 43 void _Rect::setBounds(const Cubic& cubic) { argument 61 setRawBounds(const Cubic& cubic) argument [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsBounds.cpp | 13 SkDCubic cubic; local 14 cubic.set(a); 16 dRect.setBounds(cubic);
|
H A D | SkPathOpsRect.cpp | 60 void SkDRect::setRawBounds(const SkDCubic& cubic) { argument 61 set(cubic[0]); 63 add(cubic[x]);
|
/external/skia/src/pathops/ |
H A D | SkPathOpsBounds.cpp | 13 SkDCubic cubic; local 14 cubic.set(a); 16 dRect.setBounds(cubic);
|
H A D | SkPathOpsRect.cpp | 60 void SkDRect::setRawBounds(const SkDCubic& cubic) { argument 61 set(cubic[0]); 63 add(cubic[x]);
|