| /external/skia/tests/ |
| PathOpsCubicReduceOrderTest.cpp | 15 static bool controls_inside(const SkDCubic& cubic) {
16 return between(cubic[0].fX, cubic[1].fX, cubic[3].fX)
17 && between(cubic[0].fX, cubic[2].fX, cubic[3].fX)
18 && between(cubic[0].fY, cubic[1].fY, cubic[3].fY
105 const SkDCubic& cubic = pointDegenerates[index]; local
114 const SkDCubic& cubic = notPointDegenerates[index]; local
123 const SkDCubic& cubic = lines[index]; local
132 const SkDCubic& cubic = notLines[index]; local
141 const SkDCubic& cubic = modEpsilonLines[index]; local
150 const SkDCubic& cubic = lessEpsilonLines[index]; local
159 const SkDCubic& cubic = negEpsilonLines[index]; local
170 SkDCubic cubic = quad.toCubic(); local
180 SkDCubic cubic = quad.toCubic(); local
190 SkDCubic cubic = quad.toCubic(); local
200 const SkDCubic& cubic = lines[index]; local
[all...] |
| PathOpsCubicToQuadsTest.cpp | 19 const SkDCubic& cubic = cubics[index]; local
20 SkASSERT(ValidCubic(cubic));
21 double precision = cubic.calcPrecision();
23 CubicToQuads(cubic, precision, quads);
25 SkDebugf("%s [%d] cubic to quadratics failed count=%d\n", name, static_cast<int>(index),
37 SkDCubic cubic = quad.toCubic(); local
38 double precision = cubic.calcPrecision();
40 CubicToQuads(cubic, precision, quads);
42 SkDebugf("%s [%d] cubic to quadratics failed count=%d\n", name, static_cast<int>(index),
53 const SkDCubic& cubic = cubics[index] local
76 const SkDCubic& cubic = cubics[index][idx2]; local
174 const SkDCubic& cubic = locals[x]; local
[all...] |
| PathOpsCubicIntersectionTest.cpp | 528 const SkDCubic& cubic = selfSet[index]; local
532 int ts = cubic.findMaxCurvature(max);
535 max[idx2], cubic.ptAtT(max[idx2]).fX, cubic.ptAtT(max[idx2]).fY);
539 cubic.toQuadraticTs(cubic.calcPrecision(), &ts1);
543 CubicToQuads(cubic, cubic.calcPrecision(), quads1);
552 int result = i.intersect(cubic);
556 SkDPoint pt1 = cubic.ptAtT(i[0][0])
[all...] |
| PathTest.cpp | 36 // This test checks that r{Line,Quad,Conic,Cubic}To following a close()
134 // because we would keep trying to subdivide a degenerate cubic segment.
224 // too-few interations in our cubic-line intersection code. That code now runs
285 // This path used to assert, because our cubic-chopping code incorrectly
301 // which triggered an assert, from a tricky cubic. This test replicates that
545 REPORTER_ASSERT(reporter, !"unexpected cubic verb");
813 SkPath cubic; local
816 check_close(reporter, cubic);
817 cubic.close();
818 check_close(reporter, cubic);
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrPathUtils.cpp | 280 // a is the first control point of the cubic.
285 // this assumes that the cubic doesn't inflect and is simple
349 // the max subdivision count. However, in this case the cubic is approaching a line and the
350 // accuracy of the quad point isn't so important. We check if the two middle cubic control
474 SkPoint* cubic = chopped + 3*i; local
475 convert_noninflect_cubic_to_quads(cubic, tolSqd, constrainWithinTangents, dir, quads);
|
| /external/skia/src/gpu/ |
| GrPathUtils.cpp | 280 // a is the first control point of the cubic.
285 // this assumes that the cubic doesn't inflect and is simple
349 // the max subdivision count. However, in this case the cubic is approaching a line and the
350 // accuracy of the quad point isn't so important. We check if the two middle cubic control
474 SkPoint* cubic = chopped + 3*i; local
475 convert_noninflect_cubic_to_quads(cubic, tolSqd, constrainWithinTangents, dir, quads);
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/recent/ |
| RecentsPanelView.java | 557 final TimeInterpolator cubic = new DecelerateInterpolator(1.5f); local
564 .setDuration(duration).setInterpolator(cubic);
[all...] |
