/external/skia/tests/ |
H A D | PathOpsConicQuadIntersectionTest.cpp | 15 ConicPts conic; member in struct:conicQuad 28 const ConicPts& c = conicQuadTests[index].conic; 29 SkDConic conic; local 30 conic.debugSet(c.fPts.fPts, c.fWeight); 31 SkASSERT(ValidConic(conic)); 38 int order1 = reduce2.reduce(conic.fPts); 41 SkDebugf("[%d] conic order=%d\n", index, order1); 49 int roots = i.intersect(conic, quad); 52 SkDPoint xy1 = conic.ptAtT(tt1);
|
H A D | PathOpsCubicConicIntersectionTest.cpp | 16 ConicPts conic; member in struct:cubicConic 36 const ConicPts& co = cubicConicTests[index].conic; 37 SkDConic conic; local 38 conic.debugSet(co.fPts.fPts, co.fWeight); 39 SkASSERT(ValidConic(conic)); 43 int order2 = reduce2.reduce(conic.fPts); 49 SkDebugf("[%d] conic order=%d\n", index, order2); 53 int roots = i.intersect(cubic, conic); 58 SkDPoint xy2 = conic.ptAtT(tt2);
|
H A D | PathOpsConicLineIntersectionTest.cpp | 17 ConicPts conic; member in struct:lineConic 32 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line, argument 43 result = intersections.vertical(conic, top, bottom, line[0].fX, flipped); 51 result = intersections.horizontal(conic, left, right, line[0].fY, flipped); 53 intersections.intersect(conic, line); 60 ConicPts conic; member in struct:oneLineConic 72 const ConicPts& c = oneOffs[index].conic; 73 SkDConic conic; local 74 conic.debugSet(c.fPts.fPts, c.fWeight); 75 SkASSERT(ValidConic(conic)); 102 SkDConic conic; local [all...] |
H A D | GeometryTest.cpp | 75 static void test_conic_eval_pos(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) { argument 77 conic.evalAt(t, &p0, nullptr); 78 p1 = conic.evalAt(t); 79 check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY); 82 static void test_conic_eval_tan(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) { argument 84 conic.evalAt(t, nullptr, &v0); 85 v1 = conic.evalTangentAt(t); 86 check_pairs(reporter, 0, t, "conic-tan", v0.fX, v0.fY, v1.fX, v1.fY); 98 SkConic conic(pts, w); 103 test_conic_eval_pos(reporter, conic, [all...] |
H A D | PathOpsConicIntersectionTest.cpp | 13 manually compute the intersection of a pair of circles and see if the conic intersection matches 75 SkConic conic, chopped[2]; local 77 conic.fPts[index].fX = c.fPts[index].fX * scale; 78 conic.fPts[index].fY = c.fPts[index].fY * scale; 84 conic.fW = c.fW; 89 conic.computeTightBounds(&bounds); 100 path.moveTo(conic.fPts[0]); 101 path.conicTo(conic.fPts[1], conic.fPts[2], conic 161 SkConic conic; local [all...] |
H A D | PathOpsDebug.cpp | 415 SkDConic conic; local 420 SkTSect<SkDConic, SkDQuad> k1q2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); 421 SkTSect<SkDConic, SkDConic> k1k2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); 422 SkTSect<SkDConic, SkDCubic> k1c2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); 445 SkDConic conic; local 450 SkTSect<SkDConic, SkDQuad> k1q2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); 451 SkTSect<SkDConic, SkDConic> k1k2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); 452 SkTSect<SkDConic, SkDCubic> k1c2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); 475 SkDConic conic; local 480 SkTSect<SkDConic, SkDQuad> k1q2(conic SkDEBUGPARAM 505 SkDConic conic; local 535 SkDConic conic; local 565 SkDConic conic; local 595 SkDConic conic; local 625 SkDConic conic; local 655 SkDConic conic; local [all...] |
/external/skqp/tests/ |
H A D | PathOpsConicQuadIntersectionTest.cpp | 15 ConicPts conic; member in struct:conicQuad 28 const ConicPts& c = conicQuadTests[index].conic; 29 SkDConic conic; local 30 conic.debugSet(c.fPts.fPts, c.fWeight); 31 SkASSERT(ValidConic(conic)); 38 int order1 = reduce2.reduce(conic.fPts); 41 SkDebugf("[%d] conic order=%d\n", index, order1); 49 int roots = i.intersect(conic, quad); 52 SkDPoint xy1 = conic.ptAtT(tt1);
|
H A D | PathOpsCubicConicIntersectionTest.cpp | 16 ConicPts conic; member in struct:cubicConic 36 const ConicPts& co = cubicConicTests[index].conic; 37 SkDConic conic; local 38 conic.debugSet(co.fPts.fPts, co.fWeight); 39 SkASSERT(ValidConic(conic)); 43 int order2 = reduce2.reduce(conic.fPts); 49 SkDebugf("[%d] conic order=%d\n", index, order2); 53 int roots = i.intersect(cubic, conic); 58 SkDPoint xy2 = conic.ptAtT(tt2);
|
H A D | PathOpsConicLineIntersectionTest.cpp | 17 ConicPts conic; member in struct:lineConic 32 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line, argument 43 result = intersections.vertical(conic, top, bottom, line[0].fX, flipped); 51 result = intersections.horizontal(conic, left, right, line[0].fY, flipped); 53 intersections.intersect(conic, line); 60 ConicPts conic; member in struct:oneLineConic 72 const ConicPts& c = oneOffs[index].conic; 73 SkDConic conic; local 74 conic.debugSet(c.fPts.fPts, c.fWeight); 75 SkASSERT(ValidConic(conic)); 102 SkDConic conic; local [all...] |
H A D | GeometryTest.cpp | 75 static void test_conic_eval_pos(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) { argument 77 conic.evalAt(t, &p0, nullptr); 78 p1 = conic.evalAt(t); 79 check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY); 82 static void test_conic_eval_tan(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) { argument 84 conic.evalAt(t, nullptr, &v0); 85 v1 = conic.evalTangentAt(t); 86 check_pairs(reporter, 0, t, "conic-tan", v0.fX, v0.fY, v1.fX, v1.fY); 98 SkConic conic(pts, w); 103 test_conic_eval_pos(reporter, conic, [all...] |
H A D | PathOpsConicIntersectionTest.cpp | 13 manually compute the intersection of a pair of circles and see if the conic intersection matches 75 SkConic conic, chopped[2]; local 77 conic.fPts[index].fX = c.fPts[index].fX * scale; 78 conic.fPts[index].fY = c.fPts[index].fY * scale; 84 conic.fW = c.fW; 89 conic.computeTightBounds(&bounds); 100 path.moveTo(conic.fPts[0]); 101 path.conicTo(conic.fPts[1], conic.fPts[2], conic 161 SkConic conic; local [all...] |
/external/skia/src/pathops/ |
H A D | SkPathOpsConic.h | 73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { argument 74 return fPts.hullIntersects(conic.fPts, isLinear); 108 SkDConic conic; local 109 conic.set(a, weight); 110 return conic.subDivide(t1, t2); 119 SkDConic conic; local 120 conic.set(pts, weight); 121 return conic.subDivide(a, c, t1, t2, newWeight);
|
H A D | SkPathOpsTSect.cpp | 19 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) { argument 20 SkTSect<SkDConic, SkDQuad> sect1(conic 46 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) { argument 49 SkTSect<SkDConic, SkDCubic> sect2(conic
|
H A D | SkReduceOrder.h | 26 static SkPath::Verb Conic(const SkConic& conic, SkPoint* reducePts);
|
H A D | SkDConicLineIntersection.cpp | 176 // OPTIMIZE: Functions of the form add .. points are indentical to the conic routines. 325 // check if midway on conic is also same point. If so, discard this 347 int SkIntersections::horizontal(const SkDConic& conic, double left, double right, double y, argument 350 LineConicIntersections c(conic, line, this); 354 int SkIntersections::vertical(const SkDConic& conic, double top, double bottom, double x, argument 357 LineConicIntersections c(conic, line, this); 361 int SkIntersections::intersect(const SkDConic& conic, const SkDLine& line) { argument 362 LineConicIntersections c(conic, line, this); 367 int SkIntersections::intersectRay(const SkDConic& conic, const SkDLine& line) { argument 368 LineConicIntersections c(conic, lin 376 HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) argument 381 VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) argument [all...] |
H A D | SkPathOpsCurve.h | 115 SkDConic conic; local 116 conic.set(a, weight); 117 return conic.ptAtT(t); 195 SkDConic conic; local 196 conic.set(a, weight); 197 return conic.dxdyAtT(t); 277 SkDConic conic; local 278 conic.set(a, weight); 279 SkDConic dst = conic.subDivide(startT, endT); 315 SkDConic conic; local 383 SkDConic conic; local 388 SkDConic conic; local [all...] |
H A D | SkIntersections.h | 59 SkDConic conic; local 60 conic.set(a, weight); 62 return horizontal(conic, left, right, y, flipped); 67 SkDConic conic; local 68 conic.set(a, weight); 70 return vertical(conic, top, bottom, x, flipped); 74 SkDConic conic; local 75 conic.set(a, weight); 79 return intersect(conic, line); 252 static int HorizontalIntercept(const SkDConic& conic, SkScala [all...] |
/external/skqp/src/pathops/ |
H A D | SkPathOpsConic.h | 73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { argument 74 return fPts.hullIntersects(conic.fPts, isLinear); 108 SkDConic conic; local 109 conic.set(a, weight); 110 return conic.subDivide(t1, t2); 119 SkDConic conic; local 120 conic.set(pts, weight); 121 return conic.subDivide(a, c, t1, t2, newWeight);
|
H A D | SkPathOpsTSect.cpp | 19 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) { argument 20 SkTSect<SkDConic, SkDQuad> sect1(conic 46 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) { argument 49 SkTSect<SkDConic, SkDCubic> sect2(conic
|
H A D | SkReduceOrder.h | 26 static SkPath::Verb Conic(const SkConic& conic, SkPoint* reducePts);
|
H A D | SkDConicLineIntersection.cpp | 176 // OPTIMIZE: Functions of the form add .. points are indentical to the conic routines. 325 // check if midway on conic is also same point. If so, discard this 347 int SkIntersections::horizontal(const SkDConic& conic, double left, double right, double y, argument 350 LineConicIntersections c(conic, line, this); 354 int SkIntersections::vertical(const SkDConic& conic, double top, double bottom, double x, argument 357 LineConicIntersections c(conic, line, this); 361 int SkIntersections::intersect(const SkDConic& conic, const SkDLine& line) { argument 362 LineConicIntersections c(conic, line, this); 367 int SkIntersections::intersectRay(const SkDConic& conic, const SkDLine& line) { argument 368 LineConicIntersections c(conic, lin 376 HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) argument 381 VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) argument [all...] |
H A D | SkPathOpsCurve.h | 115 SkDConic conic; local 116 conic.set(a, weight); 117 return conic.ptAtT(t); 195 SkDConic conic; local 196 conic.set(a, weight); 197 return conic.dxdyAtT(t); 277 SkDConic conic; local 278 conic.set(a, weight); 279 SkDConic dst = conic.subDivide(startT, endT); 315 SkDConic conic; local 383 SkDConic conic; local 388 SkDConic conic; local [all...] |
H A D | SkIntersections.h | 59 SkDConic conic; local 60 conic.set(a, weight); 62 return horizontal(conic, left, right, y, flipped); 67 SkDConic conic; local 68 conic.set(a, weight); 70 return vertical(conic, top, bottom, x, flipped); 74 SkDConic conic; local 75 conic.set(a, weight); 79 return intersect(conic, line); 252 static int HorizontalIntercept(const SkDConic& conic, SkScala [all...] |
/external/skia/src/core/ |
H A D | SkGeometry.h | 272 * return the power-of-2 number of quads needed to approximate this conic 278 * Chop this conic into N quads, stored continguously in pts[], where 291 /** Find the parameter value where the conic takes on its maximum curvature. 348 SkConicCoeff(const SkConic& conic) { argument 349 Sk2s p0 = from_point(conic.fPts[0]); 350 Sk2s p1 = from_point(conic.fPts[1]); 351 Sk2s p2 = from_point(conic.fPts[2]); 352 Sk2s ww(conic.fW); 408 * Help class to allocate storage for approximating a conic with N quads. 415 * Given a conic an 426 computeQuads(const SkConic& conic, SkScalar tol) argument 436 SkConic conic; local [all...] |
/external/skqp/src/core/ |
H A D | SkGeometry.h | 272 * return the power-of-2 number of quads needed to approximate this conic 278 * Chop this conic into N quads, stored continguously in pts[], where 291 /** Find the parameter value where the conic takes on its maximum curvature. 348 SkConicCoeff(const SkConic& conic) { argument 349 Sk2s p0 = from_point(conic.fPts[0]); 350 Sk2s p1 = from_point(conic.fPts[1]); 351 Sk2s p2 = from_point(conic.fPts[2]); 352 Sk2s ww(conic.fW); 408 * Help class to allocate storage for approximating a conic with N quads. 415 * Given a conic an 426 computeQuads(const SkConic& conic, SkScalar tol) argument 436 SkConic conic; local [all...] |