Lines Matching refs:pts
117 const SkPoint pts[] = {
125 path.moveTo(pts[0]);
126 path.cubicTo(pts[1], pts[2], pts[3]);
305 const SkPoint pts[] = {
313 path.moveTo(pts[0]);
314 path.cubicTo(pts[1], pts[2], pts[3]);
461 SkPoint pts[] = {
467 bool isFine = r.setBoundsCheck(pts, 3);
471 pts[1].set(inf, 0);
472 isFine = r.setBoundsCheck(pts, 3);
476 pts[1].set(nan, 0);
477 isFine = r.setBoundsCheck(pts, 3);
521 SkPoint pts[4];
526 switch (iter.next(pts)) {
529 REPORTER_ASSERT(reporter, pts[0] == srcPts[0]);
535 REPORTER_ASSERT(reporter, pts[1] == srcPts[0]);
562 SkPoint pts[32];
565 for (size_t i = 0; i < SK_ARRAY_COUNT(pts); ++i) {
566 pts[i].fX = rand.nextSScalar1();
567 pts[i].fY = rand.nextSScalar1();
571 for (size_t count = 1; count <= SK_ARRAY_COUNT(pts); ++count) {
573 path.addPoly(pts, count, SkToBool(doClose));
574 test_poly(reporter, path, pts, SkToBool(doClose));
721 static void stroke_cubic(const SkPoint pts[4]) {
723 path.moveTo(pts[0]);
724 path.cubicTo(pts[1], pts[2], pts[3]);
761 SkPoint pts[4];
766 while (SkPath::kDone_Verb != (v = iter.next(pts))) {
769 mv = pts[0];
773 REPORTER_ASSERT(reporter, mv == pts[0]);
1034 SkPoint pts[2];
1040 pts[0].set(value, value);
1041 pts[1].set(value, value);
1042 REPORTER_ASSERT(reporter, !path.isLine(pts));
1043 // check that pts was untouched
1044 REPORTER_ASSERT(reporter, pts[0].equals(value, value));
1045 REPORTER_ASSERT(reporter, pts[1].equals(value, value));
1053 REPORTER_ASSERT(reporter, !path.isLine(pts));
1054 // check that pts was untouched
1055 REPORTER_ASSERT(reporter, pts[0].equals(value, value));
1056 REPORTER_ASSERT(reporter, pts[1].equals(value, value));
1065 REPORTER_ASSERT(reporter, !pts[0].equals(moveX, moveY));
1066 REPORTER_ASSERT(reporter, !pts[1].equals(lineX, lineY));
1067 REPORTER_ASSERT(reporter, path.isLine(pts));
1068 REPORTER_ASSERT(reporter, pts[0].equals(moveX, moveY));
1069 REPORTER_ASSERT(reporter, pts[1].equals(lineX, lineY));
1073 REPORTER_ASSERT(reporter, !path.isLine(pts));
1074 REPORTER_ASSERT(reporter, pts[0].equals(moveX, moveY));
1075 REPORTER_ASSERT(reporter, pts[1].equals(lineX, lineY));
1644 static const SkPoint pts[] = {
1650 p.moveTo(pts[0]);
1651 p.lineTo(pts[1]);
1652 p.quadTo(pts[2], pts[3]);
1653 p.cubicTo(pts[4], pts[5], pts[6]);
1687 static const SkPoint pts[] = {
1693 p.moveTo(pts[0]);
1694 p.lineTo(pts[1]);
1695 p.quadTo(pts[2], pts[3]);
1696 p.cubicTo(pts[4], pts[5], pts[6]);
1709 SkPoint newPt = SkPoint::Make(pts[i].fX * 2, pts[i].fY * 3);
1819 SkPoint pts[4];
1823 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
1827 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
1831 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
1835 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
1839 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
1907 REPORTER_ASSERT(reporter, iter.next(pts, gIterTests[i].consumeDegenerates) == gIterTests[i].resultVerbs[j]);
1909 REPORTER_ASSERT(reporter, pts[k] == gIterTests[i].resultPts[l++]);
1920 SkPoint pts[4];
1924 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
1927 REPORTER_ASSERT(reporter, noPathIter.next(pts) == SkPath::kDone_Verb);
1931 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
1936 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
1937 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
1938 REPORTER_ASSERT(reporter, pts[0].fY == 0);
1939 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
1945 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
1946 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
1947 REPORTER_ASSERT(reporter, pts[0].fY == 0);
1948 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
1949 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*2);
1950 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1);
1951 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
1952 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*3);
1953 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*2);
1954 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
1960 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
1974 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
1975 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
1976 REPORTER_ASSERT(reporter, pts[0].fY == 0);
1977 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kClose_Verb);
1978 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1);
1979 REPORTER_ASSERT(reporter, pts[0].fY == 0);
1980 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
1981 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*2);
1982 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1);
1983 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kClose_Verb);
1984 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*2);
1985 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1);
1986 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
1987 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*3);
1988 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*2);
1989 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kMove_Verb);
1990 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*4);
1991 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*3);
1992 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kClose_Verb);
1993 REPORTER_ASSERT(reporter, pts[0].fX == SK_Scalar1*4);
1994 REPORTER_ASSERT(reporter, pts[0].fY == SK_Scalar1*3);
1995 REPORTER_ASSERT(reporter, iter.next(pts) == SkPath::kDone_Verb);
2101 while ((nextVerb = iter.next(pts)) != SkPath::kDone_Verb) {
2107 REPORTER_ASSERT(reporter, pts[0] == expectedPts[numIterPts]);
2108 lastPt = lastMoveTo = pts[0];
2113 REPORTER_ASSERT(reporter, pts[0] == lastPt);
2114 REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
2115 lastPt = pts[1];
2121 REPORTER_ASSERT(reporter, pts[0] == lastPt);
2122 REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
2123 REPORTER_ASSERT(reporter, pts[2] == expectedPts[numIterPts + 1]);
2124 lastPt = pts[2];
2129 REPORTER_ASSERT(reporter, pts[0] == lastPt);
2130 REPORTER_ASSERT(reporter, pts[1] == expectedPts[numIterPts]);
2131 REPORTER_ASSERT(reporter, pts[2] == expectedPts[numIterPts + 1]);
2132 REPORTER_ASSERT(reporter, pts[3] == expectedPts[numIterPts + 2]);
2133 lastPt = pts[3];
2137 REPORTER_ASSERT(reporter, pts[0] == lastMoveTo);
2463 SkPoint pts[4];
2464 int count = p.getPoints(pts, 4);
2475 bounds2.set(pts, 4);
