| /external/skia/tests/ |
| 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);
|
| 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);
|
| PathOpsConicLineIntersectionTest.cpp | 17 ConicPts conic; member in struct:lineConic
32 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line,
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...] |
| GeometryTest.cpp | 73 static void test_conic_eval_pos(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) {
75 conic.evalAt(t, &p0, nullptr);
76 p1 = conic.evalAt(t);
77 check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY);
80 static void test_conic_eval_tan(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) {
82 conic.evalAt(t, nullptr, &v0);
83 v1 = conic.evalTangentAt(t);
84 check_pairs(reporter, 0, t, "conic-tan", v0.fX, v0.fY, v1.fX, v1.fY);
96 SkConic conic(pts, w);
101 test_conic_eval_pos(reporter, conic, t)
[all...] |
| 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.fW)
161 SkConic conic; local
[all...] |
| 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 SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1))
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...] |
| PathOpsTestCommon.cpp | 268 bool ValidConic(const SkDConic& conic) {
270 if (!ValidPoint(conic[index])) {
274 if (SkDoubleIsNaN(conic.fWeight)) {
|
| /external/skia/src/pathops/ |
| SkPathOpsConic.h | 73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const {
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);
|
| SkPathOpsTSect.cpp | 19 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) {
20 SkTSect<SkDConic, SkDQuad> sect1(conic
46 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) {
49 SkTSect<SkDConic, SkDCubic> sect2(conic
|
| SkReduceOrder.h | 26 static SkPath::Verb Conic(const SkConic& conic, SkPoint* reducePts);
|
| 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,
350 LineConicIntersections c(conic, line, this);
354 int SkIntersections::vertical(const SkDConic& conic, double top, double bottom, double x,
357 LineConicIntersections c(conic, line, this);
361 int SkIntersections::intersect(const SkDConic& conic, const SkDLine& line) {
362 LineConicIntersections c(conic, line, this);
367 int SkIntersections::intersectRay(const SkDConic& conic, const SkDLine& line) {
368 LineConicIntersections c(conic, line, this)
[all...] |
| 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...] |
| 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, SkScalar y, double* roots)
[all...] |
| SkOpEdgeBuilder.cpp | 241 SkConic conic(pointsPtr, weight);
243 if (!conic.chopAt(maxCurvature, pair)) {
249 SkPath::Verb v1 = SkReduceOrder::Conic(pair[0], cStorage[0]);
250 SkPath::Verb v2 = SkReduceOrder::Conic(pair[1], cStorage[1]);
|
| SkPathOpsQuad.cpp | 81 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const {
82 return conic.hullIntersects(*this, isLinear);
|
| /external/skia/src/core/ |
| SkGeometry.h | 242 * return the power-of-2 number of quads needed to approximate this conic
248 * Chop this conic into N quads, stored continguously in pts[], where
261 /** Find the parameter value where the conic takes on its maximum curvature.
318 SkConicCoeff(const SkConic& conic) {
319 Sk2s p0 = from_point(conic.fPts[0]);
320 Sk2s p1 = from_point(conic.fPts[1]);
321 Sk2s p2 = from_point(conic.fPts[2]);
322 Sk2s ww(conic.fW);
378 * Help class to allocate storage for approximating a conic with N quads.
385 * Given a conic and a tolerance, return the array of points for th
406 SkConic conic; local
[all...] |
| SkStroke.cpp | 447 void SkPathStroker::setConicEndNormal(const SkConic& conic, const SkVector& normalAB,
449 setQuadEndNormal(conic.fPts, normalAB, unitNormalAB, normalBC, unitNormalBC);
587 static bool conic_in_line(const SkConic& conic) {
588 return quad_in_line(conic.fPts);
630 SkPathStroker::ReductionType SkPathStroker::CheckConicLinear(const SkConic& conic,
632 bool degenerateAB = degenerate_vector(conic.fPts[1] - conic.fPts[0]);
633 bool degenerateBC = degenerate_vector(conic.fPts[2] - conic.fPts[1]);
640 if (!conic_in_line(conic)) {
[all...] |
| SkPathMeasure.cpp | 81 SkConic conic(pts[0], pts[2], pts[3], pts[1].fX);
85 dst->conicTo(conic.fPts[1], conic.fPts[2], conic.fW);
88 if (conic.chopAt(stopT, tmp)) {
95 if (conic.chopAt(startT, tmp1)) {
100 conic.chopAt(startT, stopT, &tmp);
255 SkScalar SkPathMeasure::compute_conic_segs(const SkConic& conic, SkScalar distance,
259 SkPoint halfPt = conic.evalAt(tValue2Scalar(halft));
261 distance = this->compute_conic_segs(conic, distance, mint, minPt, halft, halfPt, ptIndex)
[all...] |
| SkPath.cpp | [all...] |
| /external/skia/src/utils/ |
| SkCurveMeasure.cpp | 32 SkConic conic(pts, pts[3].x());
33 conic.evalAt(t, &pos);
58 SkConic conic(pts, pts[3].x());
59 conic.evalAt(t, nullptr, &tan);
|
| /external/skia/gm/ |
| beziereffects.cpp | 406 // where to chop the conic. If the max curvature is not
408 // dst[0] is the original conic. If it returns 2 the dst[0]
419 SkConic conic; local
420 conic.set(src, weight);
421 if (!conic.chopAt(t, dst)) {
430 // Calls split_conic on the entire conic and then once more on each subsection.
431 // Most cases will result in either 1 conic (chop point is not within t range)
|
| /external/skia/bench/ |
| PathBench.cpp | 901 ConicBench_Chop() : fName("conic-chop") {
929 fName.printf("conic-eval-pos%d", useV2);
954 fName.printf("conic-eval-tan%d", useV2);
977 static void rand_conic(SkConic* conic, SkRandom& rand) {
979 conic->fPts[i].set(rand.nextUScalar1() * 100, rand.nextUScalar1() * 100);
982 conic->fW = rand.nextUScalar1();
984 conic->fW = 1 + rand.nextUScalar1() * 4;
1017 return "conic-compute-error";
1039 return "conic-asQuadTol";
1060 return "conic-quadPow2"
[all...] |
| /external/skia/samplecode/ |
| SampleAAGeometry.cpp | 222 SkConic conic; local
223 conic.set(pts, iter.conicWeight());
224 if (!conic.chopAt(0.5f, chop)) {
965 SET_BUTTON(Conic);
[all...] |
| SampleQuadStroker.cpp | 148 fPts[4].set(350, 200); // conic
366 SkConic conic(pts, iter.conicWeight());
367 pos = conic.evalAt(t);
368 tan = conic.evalTangentAt(t);
|
| /external/skia/src/gpu/ops/ |
| GrAAHairLinePathRenderer.cpp | 131 // where to chop the conic. If the max curvature is not
133 // dst[0] is the original conic. If it returns 2 the dst[0]
144 SkConic conic; local
145 conic.set(src, weight);
146 if (!conic.chopAt(t, dst)) {
155 // Calls split_conic on the entire conic and then once more on each subsection.
156 // Most cases will result in either 1 conic (chop point is not within t range)
170 // returns 0 if quad/conic is degen or close to it
[all...] |
