Lines Matching refs:ts
78 const SkIntersections& ts) {
79 for (int i = 0; i < ts.used(); ++i) {
80 SkDPoint result1 = line1.ptAtT(ts[0][i]);
81 SkDPoint result2 = line2.ptAtT(ts[1][i]);
82 if (!result1.approximatelyEqual(result2) && !ts.nearlySame(i)) {
83 REPORTER_ASSERT(reporter, ts.used() != 1);
84 result2 = line2.ptAtT(ts[1][i ^ 1]);
89 REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint()));
108 SkIntersections ts;
109 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left);
110 check_results(reporter, line2, line1, ts);
115 SkIntersections ts;
116 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left);
117 check_results(reporter, line1, line2, ts);
122 SkIntersections ts;
123 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top);
124 check_results(reporter, line2, line1, ts);
129 SkIntersections ts;
130 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top);
131 check_results(reporter, line1, line2, ts);
140 SkIntersections ts;
141 int pts = ts.intersect(line1, line2);
143 REPORTER_ASSERT(reporter, pts == ts.used());
144 check_results(reporter, line1, line2, ts);
151 SkIntersections ts;
152 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left);
154 REPORTER_ASSERT(reporter, pts == ts.used());
155 check_results(reporter, line2, line1, ts);
160 SkIntersections ts;
161 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left);
163 REPORTER_ASSERT(reporter, pts == ts.used());
164 check_results(reporter, line1, line2, ts);
169 SkIntersections ts;
170 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top);
172 REPORTER_ASSERT(reporter, pts == ts.used());
173 check_results(reporter, line2, line1, ts);
178 SkIntersections ts;
179 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top);
181 REPORTER_ASSERT(reporter, pts == ts.used());
182 check_results(reporter, line1, line2, ts);
202 SkIntersections ts;
203 int pts = ts.intersect(line1, line2);
205 REPORTER_ASSERT(reporter, pts == ts.used());