| /external/skia/tests/ |
| PathOpsDCubicTest.cpp | 20 SkDCubic cubic; local
21 cubic.debugSet(c.fPts);
23 cubic.convexHull(order);
|
| PathOpsDRectTest.cpp | 37 static void setRawBounds(const SkDCubic& cubic, SkDRect* rect) {
38 rect->set(cubic[0]);
39 rect->add(cubic[1]);
40 rect->add(cubic[2]);
41 rect->add(cubic[3]);
63 SkDCubic cubic; local
64 cubic.debugSet(c.fPts);
65 SkASSERT(ValidCubic(cubic));
66 setRawBounds(cubic, &rect);
67 rect2.setBounds(cubic);
[all...] |
| PathOpsLineParametetersTest.cpp | 44 SkDCubic cubic; local
45 cubic.debugSet(c.fPts);
46 SkASSERT(ValidCubic(cubic));
47 lineParameters.cubicEndPoints(cubic, 0, 3);
49 denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1);
50 denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
69 normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1);
70 normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
|
| PathOpsCubicConicIntersectionTest.cpp | 15 CubicPts cubic; member in struct:cubicConic
32 const CubicPts& cu = cubicConicTests[index].cubic;
33 SkDCubic cubic; local
34 cubic.debugSet(cu.fPts);
35 SkASSERT(ValidCubic(cubic));
42 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
45 SkDebugf("[%d] cubic order=%d\n", index, order1);
53 int roots = i.intersect(cubic, conic);
56 SkDPoint xy1 = cubic.ptAtT(tt1);
|
| PathOpsCubicQuadIntersectionTest.cpp | 16 CubicPts cubic; member in struct:quadCubic
56 const CubicPts& c = quadCubicTests[index].cubic;
57 SkDCubic cubic; local
58 cubic.debugSet(c.fPts);
59 SkASSERT(ValidCubic(cubic));
66 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
69 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
77 int roots = i.intersect(cubic, quad);
80 SkDPoint xy1 = cubic.ptAtT(tt1);
|
| StrokerTest.cpp | 203 SkDebugf("\n%s tan=%d cubic=%d width=%1.9g\n", __FUNCTION__, gMaxRecursion[0],
219 SkDebugf("\n%s max tan=%d cubic=%d\n", __FUNCTION__, bestTan, bestCubic);
287 SkPoint cubic[4]; local
288 cubic[0].fX = r.nextRangeF(0, 500);
289 cubic[0].fY = r.nextRangeF(0, 500);
292 cubic[1].fX = r.nextRangeF(0, 500);
293 cubic[1].fY = r.nextRangeF(0, 500);
294 } while (cubic[0].distanceToSqd(cubic[1]) < halfSquared);
296 cubic[2].fX = r.nextRangeF(0, 500)
[all...] |
| GeometryTest.cpp | 222 const SkPoint cubic[] = { local
226 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
|
| PathOpsCubicLineIntersectionTest.cpp | 15 CubicPts cubic; member in struct:lineCubic
28 const CubicPts& cuPts = failLineCubicTests[iIndex].cubic;
29 SkDCubic cubic; local
30 cubic.debugSet(cuPts.fPts);
31 SkASSERT(ValidCubic(cubic));
36 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
39 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
48 int roots = i.intersect(cubic, line);
101 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) {
111 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped)
129 SkDCubic cubic; local
196 SkDCubic cubic; local
[all...] |
| PathOpsCubicReduceOrderTest.cpp | 16 static bool controls_inside(const SkDCubic& cubic) {
17 return between(cubic[0].fX, cubic[1].fX, cubic[3].fX)
18 && between(cubic[0].fX, cubic[2].fX, cubic[3].fX)
19 && between(cubic[0].fY, cubic[1].fY, cubic[3].fY
109 SkDCubic cubic; local
120 SkDCubic cubic; local
132 SkDCubic cubic; local
143 SkDCubic cubic; local
154 SkDCubic cubic; local
165 SkDCubic cubic; local
177 SkDCubic cubic; local
191 SkDCubic cubic = quad.debugToCubic(); local
203 SkDCubic cubic = quad.debugToCubic(); local
215 SkDCubic cubic = quad.debugToCubic(); local
[all...] |
| PathOpsCubicLineIntersectionIdeas.cpp | 54 static double binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t,
59 SkDPoint cubicAtT = cubic.ptAtT(t);
67 SkDebugf("binary search failed: step=%1.9g cubic=", firstStep);
68 cubic.dump();
76 SkDPoint lessPt = cubic.ptAtT(t - lastStep);
85 SkDPoint morePt = cubic.ptAtT(t + lastStep);
155 SkDCubic cubic; local
156 cubic.debugSet(cuPts.fPts);
157 SkDPoint pt = cubic.ptAtT(t);
159 // see if the line / cubic has a fun range of root
[all...] |
| PathOpsTestCommon.cpp | 16 static double calc_t_div(const SkDCubic& cubic, double precision, double start) {
21 cPtr = &cubic;
24 sub = cubic.subDivide(start, 1);
39 static bool add_simple_ts(const SkDCubic& cubic, double precision, SkTArray<double, true>* ts) {
40 double tDiv = calc_t_div(cubic, precision, 0);
51 static void addTs(const SkDCubic& cubic, double precision, double start, double end,
53 double tDiv = calc_t_div(cubic, precision, 0);
63 static void toQuadraticTs(const SkDCubic* cubic, double precision, SkTArray<double, true>* ts) {
65 int order = reducer.reduce(*cubic, SkReduceOrder::kAllow_Quadratics);
70 int inflections = cubic->findInflections(inflectT)
165 SkDCubic cubic; local
205 SkDCubic cubic; local
[all...] |
| PathOpsCubicIntersectionTest.cpp | 643 const CubicPts& cubic = selfSet[index]; local
646 c[i] = cubic.fPts[i].asSkPoint();
|
| PathOpsDebug.cpp | 416 SkDCubic cubic; local
423 SkTSect<SkDCubic, SkDQuad> c1q2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
424 SkTSect<SkDCubic, SkDConic> c1k2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
425 SkTSect<SkDCubic, SkDCubic> c1c2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
446 SkDCubic cubic; local
453 SkTSect<SkDCubic, SkDQuad> c1q2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
454 SkTSect<SkDCubic, SkDConic> c1k2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
455 SkTSect<SkDCubic, SkDCubic> c1c2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
476 SkDCubic cubic; local
483 SkTSect<SkDCubic, SkDQuad> c1q2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1))
506 SkDCubic cubic; local
536 SkDCubic cubic; local
566 SkDCubic cubic; local
596 SkDCubic cubic; local
626 SkDCubic cubic; local
656 SkDCubic cubic; local
[all...] |
| /external/skia/src/pathops/ |
| SkPathOpsCubic.h | 49 static void Coefficients(const double* cubic, double* A, double* B, double* C, double* D);
68 SkDCubic cubic; local
69 return cubic.set(a).findInflections(tValues);
95 * Return the number of valid roots (0 < root < 1) for this cubic intersecting the
100 * Return the number of valid roots (0 < root < 1) for this cubic intersecting the
119 SkDCubic cubic; local
120 return cubic.set(a).subDivide(t1, t2);
127 SkDCubic cubic; local
128 cubic.set(pts).subDivide(a, d, t1, t2, p);
|
| SkReduceOrder.cpp | 52 // note that three points in a line doesn't simplify a cubic
103 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) {
104 reduction[0] = reduction[1] = cubic[0];
112 static int vertical_line(const SkDCubic& cubic, SkDCubic& reduction) {
113 reduction[0] = cubic[0];
114 reduction[1] = cubic[3];
118 static int horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) {
119 reduction[0] = cubic[0];
120 reduction[1] = cubic[3];
125 static int check_quadratic(const SkDCubic& cubic, SkDCubic& reduction)
273 SkDCubic cubic; local
[all...] |
| SkIntersections.h | 84 SkDCubic cubic; local
85 cubic.set(a);
87 return horizontal(cubic, left, right, y, flipped);
91 SkDCubic cubic; local
92 cubic.set(a);
94 return vertical(cubic, top, bottom, x, flipped);
98 SkDCubic cubic; local
99 cubic.set(a);
103 return intersect(cubic, line);
|
| SkPathOpsCubic.cpp | 78 // get the rough scale of the cubic; used to determine if curvature is extreme
143 // a pair of one cubic's points. If the 2nd cubic's points
144 // are on the line or on the opposite side from the 1st cubic's 'odd man', the
146 /* if returning true, check contains true if cubic's hull collapsed, making the cubic linear
147 if returning false, check contains true if the the cubic pair have only the end point in common
246 SkDCubic cubic; local
247 cubic.set(pointsPtr);
248 if (cubic.monotonicInX() && cubic.monotonicInY())
[all...] |
| SkPathOpsCurve.h | 38 void set(const SkDCubic& cubic) {
40 fPts[index] = cubic[index].asSkPoint();
95 bool fOrdered; // cleared when a cubic's control point isn't between the sweep vectors
121 SkDCubic cubic; local
122 cubic.set(a);
123 return cubic.ptAtT(t);
201 SkDCubic cubic; local
202 cubic.set(a);
203 return cubic.dxdyAtT(t);
284 SkDCubic cubic; local
322 SkDCubic cubic; local
393 SkDCubic cubic; local
398 SkDCubic cubic; local
[all...] |
| SkPathOpsDebug.cpp | 50 const char* SkPathOpsDebug::kLVerbStr[] = {"", "line", "quad", "cubic"};
629 const char* verbs[] = { "", "line", "quad", "conic", "cubic" };
712 SkDCubic cubic; local
713 cubic[0] = fPts[0];
714 cubic[2] = fPts[1];
715 cubic[3] = fPts[2];
716 cubic[1].fX = (cubic[0].fX + cubic[2].fX * 2) / 3;
717 cubic[1].fY = (cubic[0].fY + cubic[2].fY * 2) / 3
[all...] |
| /external/skia/src/utils/win/ |
| SkDWriteGeometrySink.cpp | 89 } Cubic[4], Quadratic[3];
91 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) {
92 float dx10 = cubic[1].x - cubic[0].x;
93 float dx23 = cubic[2].x - cubic[3].x;
94 float midX = cubic[0].x + dx10 * 3 / 2;
95 //NOTE: !approximately_equal(midX - cubic[3].x, dx23 * 3 / 2)
97 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x))
119 Cubic cubic = { { prevPt.x, prevPt.y }, local
[all...] |
| /external/skia/src/pdf/ |
| SkPDFUtils.cpp | 97 SkPoint cubic[4]; local
98 SkConvertQuadToCubic(quad, cubic);
99 SkPDFUtils::AppendCubic(cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[2].fY,
100 cubic[3].fX, cubic[3].fY, content);
|
| /external/skia/src/core/ |
| SkGlyphCache.cpp | 287 SkDCubic cubic; local
288 cubic.set(pts);
290 int count = yAxis ? cubic.verticalIntersect(axis, roots)
291 : cubic.horizontalIntersect(axis, roots);
293 SkPoint pt = cubic.ptAtT(roots[count]).asSkPoint();
|
| SkGeometry.cpp | 340 /** Cubic'(t) = At^2 + Bt + C, where
388 up with 1.0, hence the need to check and just return the last cubic as
431 // have src point to the remaining cubic (after the chop)
438 // if we can't, just create a degenerate cubic
455 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that
458 0 dst[0..3] is the original cubic
500 After some canceling of the cubic term, we get
837 SkDCubic cubic; local
839 int count = (cubic.set(src).*method)(intercept, roots);
841 SkDCubicPair pair = cubic.chopAt(roots[0])
[all...] |
| /external/skia/src/gpu/ |
| GrPathUtils.cpp | 357 // a is the first control point of the cubic.
362 // this assumes that the cubic doesn't inflect and is simple
426 // likely to hit the max subdivision count. However, in this case the cubic is approaching a
427 // line and the accuracy of the quad point isn't so important. We check if the two middle cubic
555 SkPoint* cubic = chopped + 3*i; local
557 convert_noninflect_cubic_to_quads(cubic, tolSqd, false,
572 SkPoint* cubic = chopped + 3*i; local
573 convert_noninflect_cubic_to_quads(cubic, tolSqd, true, dir, quads);
580 * Computes an SkMatrix that can find the cubic KLM functionals as follows:
586 * 'kcoeffs' are the power basis coefficients to a scalar valued cubic function that returns th
[all...] |
| /external/skia/tools/debugger/ |
| SkDrawCommand.cpp | 119 #define SKDEBUGCANVAS_VERB_CUBIC "cubic"
557 Json::Value cubic(Json::objectValue);
562 cubic[SKDEBUGCANVAS_VERB_CUBIC] = coords;
563 verbs.append(cubic);
1619 Json::Value cubic = verb[SKDEBUGCANVAS_VERB_CUBIC]; local
[all...] |
