| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| QuadraticIntersection_Test.cpp | 205 Intersections intersections2; local
206 intersect2(quad1, quad2, intersections2);
207 if (intersections2.fUnsortable) {
211 for (int pt = 0; pt < intersections2.used(); ++pt) {
212 double tt1 = intersections2.fT[0][pt];
215 int pt2 = intersections2.fFlip ? intersections2.used() - pt - 1 : pt;
216 double tt2 = intersections2.fT[1][pt2];
262 Intersections intersections2; local
263 intersect2(quad1, quad2, intersections2);
[all...] |
| CubicIntersection_Test.cpp | 227 Intersections intersections2, intersections3;
228 intersect2(cubic1, cubic2, intersections2);
234 for (pt1 = 0; pt1 < intersections2.used(); ++pt1) {
235 tt1 = intersections2.fT[0][pt1];
239 pt2 = intersections2.fFlip ? intersections2.used() - pt1 - 1 : pt1;
240 tt2 = intersections2.fT[1][pt2];
244 __FUNCTION__, tt1, xy1.x, xy1.y, intersections2.fPt[pt1].x,
245 intersections2.fPt[pt1].y, xy2.x, xy2.y, tt2);
265 for (pt1 = 0; pt1 < intersections2.used(); ++pt1)
594 Intersections intersections2; local
[all...] |
| /external/skia/experimental/Intersection/ |
| QuadraticIntersection_Test.cpp | 205 Intersections intersections2; local
206 intersect2(quad1, quad2, intersections2);
207 if (intersections2.fUnsortable) {
211 for (int pt = 0; pt < intersections2.used(); ++pt) {
212 double tt1 = intersections2.fT[0][pt];
215 int pt2 = intersections2.fFlip ? intersections2.used() - pt - 1 : pt;
216 double tt2 = intersections2.fT[1][pt2];
262 Intersections intersections2; local
263 intersect2(quad1, quad2, intersections2);
[all...] |
| CubicIntersection_Test.cpp | 227 Intersections intersections2, intersections3;
228 intersect2(cubic1, cubic2, intersections2);
234 for (pt1 = 0; pt1 < intersections2.used(); ++pt1) {
235 tt1 = intersections2.fT[0][pt1];
239 pt2 = intersections2.fFlip ? intersections2.used() - pt1 - 1 : pt1;
240 tt2 = intersections2.fT[1][pt2];
244 __FUNCTION__, tt1, xy1.x, xy1.y, intersections2.fPt[pt1].x,
245 intersections2.fPt[pt1].y, xy2.x, xy2.y, tt2);
265 for (pt1 = 0; pt1 < intersections2.used(); ++pt1)
594 Intersections intersections2; local
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| PathOpsQuadIntersectionTest.cpp | 272 SkIntersections intersections2; local
273 intersections2.intersect(quad1, quad2);
274 for (int pt = 0; pt < intersections2.used(); ++pt) {
275 double tt1 = intersections2[0][pt];
277 double tt2 = intersections2[1][pt];
322 SkIntersections intersections2; local
323 intersections2.intersect(quad1, quad2);
324 REPORTER_ASSERT(reporter, intersections2.coincidentUsed() == 2);
325 REPORTER_ASSERT(reporter, intersections2.used() == 2);
326 for (int pt = 0; pt < intersections2.coincidentUsed(); ++pt)
[all...] |
| PathOpsCubicIntersectionTest.cpp | 425 SkIntersections intersections2; local
426 int newIntersects = intersections2.intersect(cubic1, cubic2);
435 for (int pt = 0; pt < intersections2.used(); ++pt) {
436 double tt1 = intersections2[0][pt];
438 double tt2 = intersections2[1][pt];
|
| /external/skia/tests/ |
| PathOpsQuadIntersectionTest.cpp | 269 SkIntersections intersections2; local
270 intersections2.intersect(quad1, quad2);
271 for (int pt = 0; pt < intersections2.used(); ++pt) {
272 double tt1 = intersections2[0][pt];
274 double tt2 = intersections2[1][pt];
319 SkIntersections intersections2; local
320 intersections2.intersect(quad1, quad2);
321 REPORTER_ASSERT(reporter, intersections2.coincidentUsed() == 2);
322 REPORTER_ASSERT(reporter, intersections2.used() == 2);
323 for (int pt = 0; pt < intersections2.coincidentUsed(); ++pt)
[all...] |
| PathOpsCubicIntersectionTest.cpp | 425 SkIntersections intersections2; local
426 int newIntersects = intersections2.intersect(cubic1, cubic2);
435 for (int pt = 0; pt < intersections2.used(); ++pt) {
436 double tt1 = intersections2[0][pt];
438 double tt2 = intersections2[1][pt];
|
