xref: /third_party/skia/tests/PathTest.cpp

421     const SkPoint pts[] = {
429     path.moveTo(pts[0]);
430     path.cubicTo(pts[1], pts[2], pts[3]);
749     const SkPoint pts[] = {
757     path.moveTo(pts[0]);
758     path.cubicTo(pts[1], pts[2], pts[3]);
899     SkPoint pts[] = {
905     bool isFine = r.setBoundsCheck(pts, 3);
909     pts[1].set(inf, 0);
910     isFine = r.setBoundsCheck(pts, 3);
914     pts[1].set(nan, 0);
915     isFine = r.setBoundsCheck(pts, 3);
977     for (auto [verb, pts, w] : SkPathPriv::Iterate(path)) {
981                 REPORTER_ASSERT(reporter, pts[0] == srcPts[0]);
987                 REPORTER_ASSERT(reporter, pts[1] == srcPts[0]);
1011     SkPoint pts[32];
1014     for (size_t i = 0; i < SK_ARRAY_COUNT(pts); ++i) {
1015         pts[i].fX = rand.nextSScalar1();
1016         pts[i].fY = rand.nextSScalar1();
1020         for (size_t count = 1; count <= SK_ARRAY_COUNT(pts); ++count) {
1022             path.addPoly(pts, SkToInt(count), SkToBool(doClose));
1023             test_poly(reporter, path, pts, SkToBool(doClose));
1179 static void stroke_cubic(const SkPoint pts[4]) {
1181     path.moveTo(pts[0]);
1182     path.cubicTo(pts[1], pts[2], pts[3]);
1219         SkPoint pts[4];
1224         while (SkPath::kDone_Verb != (v = iter.next(pts))) {
1227                     mv = pts[0];
1231                     REPORTER_ASSERT(reporter, mv == pts[0]);
1739     SkPoint pts[2];
1745     pts[0].set(value, value);
1746     pts[1].set(value, value);
1747     REPORTER_ASSERT(reporter, !path.isLine(pts));
1748     // check that pts was untouched
1749     REPORTER_ASSERT(reporter, pts[0].equals(value, value));
1750     REPORTER_ASSERT(reporter, pts[1].equals(value, value));
1758     REPORTER_ASSERT(reporter, !path.isLine(pts));
1759     // check that pts was untouched
1760     REPORTER_ASSERT(reporter, pts[0].equals(value, value));
1761     REPORTER_ASSERT(reporter, pts[1].equals(value, value));
1770     REPORTER_ASSERT(reporter, !pts[0].equals(moveX, moveY));
1771     REPORTER_ASSERT(reporter, !pts[1].equals(lineX, lineY));
1772     REPORTER_ASSERT(reporter, path.isLine(pts));
1773     REPORTER_ASSERT(reporter, pts[0].equals(moveX, moveY));
1774     REPORTER_ASSERT(reporter, pts[1].equals(lineX, lineY));
1778     REPORTER_ASSERT(reporter, !path.isLine(pts));
1779     REPORTER_ASSERT(reporter, pts[0].equals(moveX, moveY));
1780     REPORTER_ASSERT(reporter, pts[1].equals(lineX, lineY));
2624     static const SkPoint pts[] = {
2630     p.moveTo(pts[0]);
2631     p.lineTo(pts[1]);
2632     p.quadTo(pts[2], pts[3]);
2633     p.cubicTo(pts[4], pts[5], pts[6]);
2675     static const SkPoint pts[] = {
2684     const int kPtCount = SK_ARRAY_COUNT(pts);
2686     p.moveTo(pts[0]);
2687     p.lineTo(pts[1]);
2688     p.quadTo(pts[2], pts[3]);
2689     p.cubicTo(pts[4], pts[5], pts[6]);
2691     p.conicTo(pts[4], pts[5], 0.5f);
2715             SkPoint newPt = SkPoint::Make(pts[i].fX * 2, pts[i].fY * 3);
2897     SkPoint pts[4];
2901     REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
2905     REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
2909     REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
2913     REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
2917     REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
2961             REPORTER_ASSERT(reporter, iter.next(pts) == gIterTests[i].resultVerbs[j]);
2963                 REPORTER_ASSERT(reporter, pts[k] == gIterTests[i].resultPts[l++]);
2994         iter.next(pts);
2995         iter.next(pts);
2996         REPORTER_ASSERT(reporter, SkPath::kClose_Verb == iter.next(pts));
3002     iter.next(pts);
3003     REPORTER_ASSERT(reporter, SkPath::kQuad_Verb == iter.next(pts));
3008     iter.next(pts);
3009     REPORTER_ASSERT(reporter, SkPath::kConic_Verb == iter.next(pts));
3014     iter.next(pts);
3015     REPORTER_ASSERT(reporter, SkPath::kCubic_Verb == iter.next(pts));
3019     iter.next(pts);
3020     REPORTER_ASSERT(reporter, SkPath::kCubic_Verb == iter.next(pts));
3032     REPORTER_ASSERT(reporter, SkPath::kMove_Verb == iter.next(pts));
3033     REPORTER_ASSERT(reporter, SkPath::kLine_Verb == iter.next(pts));
3035     REPORTER_ASSERT(reporter, SkPath::kLine_Verb == iter.next(pts));
3036     REPORTER_ASSERT(reporter, SkPath::kConic_Verb == iter.next(pts));
3052         auto [verb, pts, w] = *iter++;
3054         REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
3055         REPORTER_ASSERT(reporter, pts[0].fY == 0);
3065         auto [verb, pts, w] = *iter++;
3067         REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
3068         REPORTER_ASSERT(reporter, pts[0].fY == 0);
3071         auto [verb, pts, w] = *iter++;
3073         REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*2);
3074         REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1);
3077         auto [verb, pts, w] = *iter++;
3079         REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*3);
3080         REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*2);
3104         auto [verb, pts, w] = *iter++;
3106         REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
3107         REPORTER_ASSERT(reporter, pts[0].fY == 0);
3110         auto [verb, pts, w] = *iter++;
3114         auto [verb, pts, w] = *iter++;
3116         REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*2);
3117         REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1);
3120         auto [verb, pts, w] = *iter++;
3124         auto [verb, pts, w] = *iter++;
3126         REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*3);
3127         REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*2);
3130         auto [verb, pts, w] = *iter++;
3132         REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*4);
3133         REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*3);
3136         auto [verb, pts, w] = *iter++;
3244         for (auto [verb, pts, w] : SkPathPriv::Iterate(path)) {
3250                     REPORTER_ASSERT(reporter, pts[0] == expectedPts[numIterPts]);
3251                     lastPt = lastMoveTo = pts[0];
3256                     REPORTER_ASSERT(reporter, pts[0] == lastPt);
3257                     REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
3258                     lastPt = pts[1];
3264                     REPORTER_ASSERT(reporter, pts[0] == lastPt);
3265                     REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
3266                     REPORTER_ASSERT(reporter, pts[2] == expectedPts[numIterPts + 1]);
3267                     lastPt = pts[2];
3272                     REPORTER_ASSERT(reporter, pts[0] == lastPt);
3273                     REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
3274                     REPORTER_ASSERT(reporter, pts[2] == expectedPts[numIterPts + 1]);
3275                     REPORTER_ASSERT(reporter, pts[3] == expectedPts[numIterPts + 2]);
3276                     lastPt = pts[3];
3784     auto [v, pts, w] = *(*iter)++;
3786     REPORTER_ASSERT(reporter, pts[0].fX == x0);
3787     REPORTER_ASSERT(reporter, pts[0].fY == y0);
3792     auto [v, pts, w] = *(*iter)++;
3794     REPORTER_ASSERT(reporter, pts[1].fX == x1);
3795     REPORTER_ASSERT(reporter, pts[1].fY == y1);
3800     auto [v, pts, w] = *(*iter)++;
3802     REPORTER_ASSERT(reporter, pts[1].fX == x1);
3803     REPORTER_ASSERT(reporter, pts[1].fY == y1);
3804     REPORTER_ASSERT(reporter, pts[2].fX == x2);
3805     REPORTER_ASSERT(reporter, pts[2].fY == y2);
3809     auto [v, pts, w] = *(*iter)++;
4202     SkPoint pts[] = {{5, 4}, {6, 5}, {7, 6}, {6, 6}, {4, 6}, {5, 7}, {5, 5}, {5, 4}, {6, 5}, {7, 6}};
4206         p.moveTo(pts[i].fX, pts[i].fY);
4207         p.cubicTo(pts[i + 1].fX, pts[i + 1].fY, pts[i + 2].fX, pts[i + 2].fY, pts[i + 3].fX, pts[i + 3].fY);
4208         p.cubicTo(pts[i + 4].fX, pts[i + 4].fY, pts[i + 5].fX, pts[i + 5].fY, pts[i + 6].fX, pts[i + 6].fY);
4213         SkEvalCubicAt(&pts[i], 0.5f, &halfway, nullptr, nullptr);
4215         SkEvalCubicAt(&pts[i + 3], 0.5f, &halfway, nullptr, nullptr);
4218         REPORTER_ASSERT(reporter, p.contains(pts[i].fX, pts[i].fY));
4219         REPORTER_ASSERT(reporter, p.contains(pts[i + 3].fX, pts[i + 3].fY));
4220         REPORTER_ASSERT(reporter, p.contains(pts[i + 6].fX, pts[i + 6].fY));
4878     SkPoint pts[4];
4879     int count = p.getPoints(pts, 4);
4890     bounds2.setBounds(pts, 4);
5368     // we append the src pts/verbs, but all the while we are iterating over the src. If src == dst
5389 static void draw_triangle(SkCanvas* canvas, const SkPoint pts[]) {
5394         path.addPoly(pts, 3, false);
5399     auto v = SkVertices::MakeCopy(SkVertices::kTriangles_VertexMode, 3, pts, nullptr, colors);
5406     const SkPoint pts[] = {
5411     draw_triangle(surface->getCanvas(), pts);
5422     const SkPoint pts[] = {
5427     draw_triangle(surface->getCanvas(), pts);
5676         SkPoint pts[4];
5677         switch (iter.next(pts)) {
5682                 REPORTER_ASSERT(reporter, pts[0] == expected[i]);
5686                 REPORTER_ASSERT(reporter, pts[1] == expected[i]);

Indexes created Thu Nov 07 10:32:03 CST 2024