/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicConvexHull.cpp | 28 double minT1, minT2, maxT1, maxT2; local 29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) { 36 if (maxT1 - minT1 < maxT2 - minT2) { 40 split = maxT1 - minT1 > tClipLimit; 42 minT1 = 0; 46 return chop(minT1, maxT1, minT2, maxT2, split); 51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 71 lineTs.fT[1][0] = interp(minT1, maxT1, lineTs.fT[1][0]); 73 lineTs.fT[0][0] = interp(minT1, maxT 128 chop(double minT1, double maxT1, double minT2, double maxT2, int split) argument [all...] |
H A D | QuadraticIntersection.cpp | 31 double minT1, minT2, maxT1, maxT2; local 32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) { 41 if (maxT1 - minT1 < maxT2 - minT2) { 45 split = maxT1 - minT1 > tClipLimit; 47 minT1 = 0; 51 return chop(minT1, maxT1, minT2, maxT2, split); 56 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument 57 bool t1IsLine = maxT1 - minT1 <= quad1Divisions; 60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine); 64 sub_divide(quad1, minT1, maxT 125 intersectAsLine(double minT1, double maxT1, double minT2, double maxT2, bool treat1AsLine, bool treat2AsLine) argument 221 chop(double minT1, double maxT1, double minT2, double maxT2, int split) argument [all...] |
H A D | CubicIntersection_Test.cpp | 418 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument 421 sub_divide(cubic1, minT1, maxT1, sub1); 429 t1 = minT1 + i.fT[0][0] * (maxT1 - minT1); 436 double half1 = (minT1 + maxT1) / 2; 441 result = intersect(minT1, half1, minT2, maxT2) || intersect(half1, maxT1, minT2, maxT2) 442 || intersect(minT1, maxT1, minT2, half2) || intersect(minT1, maxT1, half2, maxT2); 444 result = intersect(minT1, maxT1, minT2, half2) || intersect(minT1, maxT [all...] |
/external/skia/experimental/Intersection/ |
H A D | CubicConvexHull.cpp | 28 double minT1, minT2, maxT1, maxT2; local 29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) { 36 if (maxT1 - minT1 < maxT2 - minT2) { 40 split = maxT1 - minT1 > tClipLimit; 42 minT1 = 0; 46 return chop(minT1, maxT1, minT2, maxT2, split); 51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 71 lineTs.fT[1][0] = interp(minT1, maxT1, lineTs.fT[1][0]); 73 lineTs.fT[0][0] = interp(minT1, maxT 128 chop(double minT1, double maxT1, double minT2, double maxT2, int split) argument [all...] |
H A D | QuadraticIntersection.cpp | 31 double minT1, minT2, maxT1, maxT2; local 32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) { 41 if (maxT1 - minT1 < maxT2 - minT2) { 45 split = maxT1 - minT1 > tClipLimit; 47 minT1 = 0; 51 return chop(minT1, maxT1, minT2, maxT2, split); 56 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument 57 bool t1IsLine = maxT1 - minT1 <= quad1Divisions; 60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine); 64 sub_divide(quad1, minT1, maxT 125 intersectAsLine(double minT1, double maxT1, double minT2, double maxT2, bool treat1AsLine, bool treat2AsLine) argument 221 chop(double minT1, double maxT1, double minT2, double maxT2, int split) argument [all...] |
H A D | CubicIntersection_Test.cpp | 418 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { argument 421 sub_divide(cubic1, minT1, maxT1, sub1); 429 t1 = minT1 + i.fT[0][0] * (maxT1 - minT1); 436 double half1 = (minT1 + maxT1) / 2; 441 result = intersect(minT1, half1, minT2, maxT2) || intersect(half1, maxT1, minT2, maxT2) 442 || intersect(minT1, maxT1, minT2, half2) || intersect(minT1, maxT1, half2, maxT2); 444 result = intersect(minT1, maxT1, minT2, half2) || intersect(minT1, maxT [all...] |