Searched defs:intersections (Results 1 - 6 of 6) sorted by relevance
/external/skia/tests/ |
H A D | PathOpsQuadLineIntersectionTest.cpp | 31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, argument 42 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); 50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); 52 intersections.intersect(quad, line); 53 result = intersections.used(); 79 SkIntersections intersections; local 80 int result = doIntersect(intersections, quad, line, flipped); 82 double quadT = intersections[0][inner]; 84 double lineT = intersections[1][inner]; 113 SkIntersections intersections; local [all...] |
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 14 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, argument 25 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); 33 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); 35 intersections.intersect(quad, line); 36 result = intersections.used(); 52 SkIntersections intersections; local 54 int result = doIntersect(intersections, quad, line, flipped); 57 double quadT = intersections[0][index]; 59 double lineT = intersections[1][index];
|
H A D | PathOpsCubicIntersectionTest.cpp | 315 SkIntersections intersections; local 316 intersections.intersect(cubic1, cubic2); 319 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { 320 tt1 = intersections[0][pt3]; 322 tt2 = intersections[1][pt3]; 324 const SkDPoint& iPt = intersections.pt(pt3);
|
H A D | PathOpsQuadIntersectionTest.cpp | 35 SkIntersections intersections; local 36 intersections.intersect(quad1, quad2); 37 if (intersections.used() > 0) { 38 for (int pt = 0; pt < intersections.used(); ++pt) { 39 double tt1 = intersections[0][pt]; 41 double tt2 = intersections[1][pt];
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkOpSegment.cpp | 420 // after normal intersections have been computed 985 SkIntersections intersections; local 988 int pts = (intersections.*CurveVertical[SkPathOpsVerbToPoints(fVerb)]) 996 double closest = fabs(intersections[0][0] - mid); 998 double test = fabs(intersections[0][idx] - mid); 1004 intersections.quickRemoveOne(closestIdx, --pts); 1008 double foundT = intersections[0][index]; 1696 // iterate through T intersections and return topmost 1787 // when the intersections are performed, the other index is into an
|
/external/skia/src/pathops/ |
H A D | SkOpSegment.cpp | 420 // after normal intersections have been computed 985 SkIntersections intersections; local 988 int pts = (intersections.*CurveVertical[SkPathOpsVerbToPoints(fVerb)]) 996 double closest = fabs(intersections[0][0] - mid); 998 double test = fabs(intersections[0][idx] - mid); 1004 intersections.quickRemoveOne(closestIdx, --pts); 1008 double foundT = intersections[0][index]; 1696 // iterate through T intersections and return topmost 1787 // when the intersections are performed, the other index is into an
|
Completed in 332 milliseconds