| /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...] |
| 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...] |
| /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);
|
| 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...] |
| 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...] |
| /external/skia/samplecode/ |
| SampleAAGeometry.cpp | 221 SkConic conic; local
222 conic.set(pts, iter.conicWeight());
223 if (!conic.chopAt(0.5f, chop)) {
964 SET_BUTTON(Conic);
[all...] |
| /external/skia/gm/ |
| beziereffects.cpp | 350 // where to chop the conic. If the max curvature is not
352 // dst[0] is the original conic. If it returns 2 the dst[0]
363 SkConic conic; local
364 conic.set(src, weight);
365 if (!conic.chopAt(t, dst)) {
374 // Calls split_conic on the entire conic and then once more on each subsection.
375 // Most cases will result in either 1 conic (chop point is not within t range)
|
| /external/skia/src/core/ |
| SkGeometry.h | 229 * return the power-of-2 number of quads needed to approximate this conic
235 * Chop this conic into N quads, stored continguously in pts[], where
248 /** Find the parameter value where the conic takes on its maximum curvature.
305 SkConicCoeff(const SkConic& conic) {
306 Sk2s p0 = from_point(conic.fPts[0]);
307 Sk2s p1 = from_point(conic.fPts[1]);
308 Sk2s p2 = from_point(conic.fPts[2]);
309 Sk2s ww(conic.fW);
365 * Help class to allocate storage for approximating a conic with N quads.
372 * Given a conic and a tolerance, return the array of points for th
393 SkConic conic; local
[all...] |
| /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...] |
| /external/skia/tools/debugger/ |
| SkDrawCommand.cpp | 120 #define SKDEBUGCANVAS_VERB_CONIC "conic"
567 Json::Value conic(Json::objectValue);
572 conic[SKDEBUGCANVAS_VERB_CONIC] = coords;
573 verbs.append(conic);
1625 Json::Value conic = verb[SKDEBUGCANVAS_VERB_CONIC]; local
[all...] |
