/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | LineIntersection.cpp | 169 double y, bool flipped, Intersections& intersections) { 170 int result = horizontalIntersect(line, y, intersections.fT[0]); 175 double xIntercept = line[0].x + intersections.fT[0][0] 180 intersections.fT[1][0] = (xIntercept - left) / (right - left); 198 intersections.fT[0][0] = (overlapL - line[0].x) / (line[1].x - line[0].x); 199 intersections.fT[1][0] = (overlapL - left) / (right - left); 201 intersections.fT[0][1] = (overlapR - line[0].x) / (line[1].x - line[0].x); 202 intersections.fT[1][1] = (overlapR - left) / (right - left); 215 intersections.fT[0][0] = SkTMax(SkTMin(at0, 1.0), 0.0); 216 intersections 168 horizontalIntersect(const _Line& line, double left, double right, double y, bool flipped, Intersections& intersections) argument 257 verticalIntersect(const _Line& line, double top, double bottom, double x, bool flipped, Intersections& intersections) argument [all...] |
H A D | LineCubicIntersection.cpp | 86 , intersections(i) { 89 // see parallel routine in line quadratic intersections 112 intersections.insert(cubicT, lineT, pt); 115 return intersections.fUsed; 135 intersections.insert(cubicT, lineT, pt); 141 return intersections.fUsed; 161 intersections.insert(cubicT, lineT, pt); 167 return intersections.fUsed; 177 intersections.insert(cIndex >> 1, lIndex, line[lIndex]); 190 intersections 256 Intersections& intersections; member in class:LineCubicIntersections 276 horizontalIntersect(const Cubic& cubic, double left, double right, double y, bool flipped, Intersections& intersections) argument 282 verticalIntersect(const Cubic& cubic, double top, double bottom, double x, bool flipped, Intersections& intersections) argument [all...] |
H A D | LineQuadraticIntersection.cpp | 97 , intersections(i) { 140 intersections.insert(quadT, lineT, pt); 143 return intersections.fUsed; 166 intersections.insert(quadT, lineT, pt); 172 return intersections.fUsed; 195 intersections.insert(quadT, lineT, pt); 201 return intersections.fUsed; 212 intersections.insert(qIndex >> 1, lIndex, line[lIndex]); 225 intersections.insert(qIndex >> 1, 0, quad[qIndex]); 228 intersections 291 Intersections& intersections; member in class:LineQuadraticIntersections 349 horizontalIntersect(const Quadratic& quad, double left, double right, double y, bool flipped, Intersections& intersections) argument 355 verticalIntersect(const Quadratic& quad, double top, double bottom, double x, bool flipped, Intersections& intersections) argument [all...] |
H A D | CubicConvexHull.cpp | 14 static const double tClipLimit = 0.8; // http://cagd.cs.byu.edu/~tom/papers/bezclip.pdf see Multiple intersections 22 , intersections(i) 37 intersections.swap(); 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); 69 if (intersections.swapped()) { 78 intersections.insert(lineTs.fT[0][0], lineTs.fT[1][0], pt); 85 if (intersections.swapped()) { 94 intersections.insert(minT1, minT2, pt); 101 if (intersections 157 Intersections& intersections; member in class:CubicIntersections [all...] |
H A D | LineQuadraticIntersection_Test.cpp | 32 static int doIntersect(Intersections& intersections, const Quadratic& quad, const _Line& line, bool& flipped) { argument 42 result = verticalIntersect(quad, top, bottom, line[0].x, flipped, intersections); 50 result = horizontalIntersect(quad, left, right, line[0].y, flipped, intersections); 52 intersect(quad, line, intersections); 53 result = intersections.fUsed; 70 Intersections intersections; local 75 int result = doIntersect(intersections, quad, line, flipped); 77 double quadT = intersections.fT[0][inner]; 80 double lineT = intersections.fT[1][inner]; 108 Intersections intersections; local 153 Intersections intersections; local [all...] |
H A D | QuadraticIntersection.cpp | 16 static const double tClipLimit = 0.8; // http://cagd.cs.byu.edu/~tom/papers/bezclip.pdf see Multiple intersections 24 , intersections(i) 42 intersections.swap(); 64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); 65 sub_divide(quad2, minT2, maxT2, intersections.swapped() ? smaller : larger); 71 if (intersections.swapped()) { 94 intersections.add(smallT, largeT); 100 if (intersections.swapped()) { 129 if (intersections.swapped()) { 167 intersections 250 Intersections& intersections; member in class:QuadraticIntersections [all...] |
H A D | QuadraticIntersection_Test.cpp | 32 Intersections intersections; local 33 intersect2(reduce1, reduce2, intersections); 34 if (intersections.intersected()) { 35 for (int pt = 0; pt < intersections.used(); ++pt) { 36 double tt1 = intersections.fT[0][pt]; 39 double tt2 = intersections.fT[1][pt];
|
/external/skia/experimental/Intersection/ |
H A D | LineIntersection.cpp | 169 double y, bool flipped, Intersections& intersections) { 170 int result = horizontalIntersect(line, y, intersections.fT[0]); 175 double xIntercept = line[0].x + intersections.fT[0][0] 180 intersections.fT[1][0] = (xIntercept - left) / (right - left); 198 intersections.fT[0][0] = (overlapL - line[0].x) / (line[1].x - line[0].x); 199 intersections.fT[1][0] = (overlapL - left) / (right - left); 201 intersections.fT[0][1] = (overlapR - line[0].x) / (line[1].x - line[0].x); 202 intersections.fT[1][1] = (overlapR - left) / (right - left); 215 intersections.fT[0][0] = SkTMax(SkTMin(at0, 1.0), 0.0); 216 intersections 168 horizontalIntersect(const _Line& line, double left, double right, double y, bool flipped, Intersections& intersections) argument 257 verticalIntersect(const _Line& line, double top, double bottom, double x, bool flipped, Intersections& intersections) argument [all...] |
H A D | LineCubicIntersection.cpp | 86 , intersections(i) { 89 // see parallel routine in line quadratic intersections 112 intersections.insert(cubicT, lineT, pt); 115 return intersections.fUsed; 135 intersections.insert(cubicT, lineT, pt); 141 return intersections.fUsed; 161 intersections.insert(cubicT, lineT, pt); 167 return intersections.fUsed; 177 intersections.insert(cIndex >> 1, lIndex, line[lIndex]); 190 intersections 256 Intersections& intersections; member in class:LineCubicIntersections 276 horizontalIntersect(const Cubic& cubic, double left, double right, double y, bool flipped, Intersections& intersections) argument 282 verticalIntersect(const Cubic& cubic, double top, double bottom, double x, bool flipped, Intersections& intersections) argument [all...] |
H A D | LineQuadraticIntersection.cpp | 97 , intersections(i) { 140 intersections.insert(quadT, lineT, pt); 143 return intersections.fUsed; 166 intersections.insert(quadT, lineT, pt); 172 return intersections.fUsed; 195 intersections.insert(quadT, lineT, pt); 201 return intersections.fUsed; 212 intersections.insert(qIndex >> 1, lIndex, line[lIndex]); 225 intersections.insert(qIndex >> 1, 0, quad[qIndex]); 228 intersections 291 Intersections& intersections; member in class:LineQuadraticIntersections 349 horizontalIntersect(const Quadratic& quad, double left, double right, double y, bool flipped, Intersections& intersections) argument 355 verticalIntersect(const Quadratic& quad, double top, double bottom, double x, bool flipped, Intersections& intersections) argument [all...] |
H A D | CubicConvexHull.cpp | 14 static const double tClipLimit = 0.8; // http://cagd.cs.byu.edu/~tom/papers/bezclip.pdf see Multiple intersections 22 , intersections(i) 37 intersections.swap(); 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); 69 if (intersections.swapped()) { 78 intersections.insert(lineTs.fT[0][0], lineTs.fT[1][0], pt); 85 if (intersections.swapped()) { 94 intersections.insert(minT1, minT2, pt); 101 if (intersections 157 Intersections& intersections; member in class:CubicIntersections [all...] |
H A D | LineQuadraticIntersection_Test.cpp | 32 static int doIntersect(Intersections& intersections, const Quadratic& quad, const _Line& line, bool& flipped) { argument 42 result = verticalIntersect(quad, top, bottom, line[0].x, flipped, intersections); 50 result = horizontalIntersect(quad, left, right, line[0].y, flipped, intersections); 52 intersect(quad, line, intersections); 53 result = intersections.fUsed; 70 Intersections intersections; local 75 int result = doIntersect(intersections, quad, line, flipped); 77 double quadT = intersections.fT[0][inner]; 80 double lineT = intersections.fT[1][inner]; 108 Intersections intersections; local 153 Intersections intersections; local [all...] |
H A D | QuadraticIntersection.cpp | 16 static const double tClipLimit = 0.8; // http://cagd.cs.byu.edu/~tom/papers/bezclip.pdf see Multiple intersections 24 , intersections(i) 42 intersections.swap(); 64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); 65 sub_divide(quad2, minT2, maxT2, intersections.swapped() ? smaller : larger); 71 if (intersections.swapped()) { 94 intersections.add(smallT, largeT); 100 if (intersections.swapped()) { 129 if (intersections.swapped()) { 167 intersections 250 Intersections& intersections; member in class:QuadraticIntersections [all...] |
H A D | QuadraticIntersection_Test.cpp | 32 Intersections intersections; local 33 intersect2(reduce1, reduce2, intersections); 34 if (intersections.intersected()) { 35 for (int pt = 0; pt < intersections.used(); ++pt) { 36 double tt1 = intersections.fT[0][pt]; 39 double tt2 = intersections.fT[1][pt];
|
/external/chromium_org/third_party/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(); 86 SkIntersections intersections; local 87 int result = doIntersect(intersections, quad, line, flipped); 89 double quadT = intersections[0][inner]; 91 double lineT = intersections[1][inner]; 124 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 | PathOpsCubicLineIntersectionTest.cpp | 93 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { argument 103 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); 111 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped); 113 intersections.intersect(cubic, line); 114 result = intersections.used();
|
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];
|
H A D | PathOpsCubicIntersectionTest.cpp | 343 SkIntersections intersections; local 344 intersections.intersect(cubic1, cubic2); 345 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2); 348 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) { 349 tt1 = intersections[0][pt3]; 351 tt2 = intersections[1][pt3]; 353 const SkDPoint& iPt = intersections.pt(pt3);
|
/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(); 86 SkIntersections intersections; local 87 int result = doIntersect(intersections, quad, line, flipped); 89 double quadT = intersections[0][inner]; 91 double lineT = intersections[1][inner]; 124 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 | PathOpsCubicLineIntersectionTest.cpp | 93 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { argument 103 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); 111 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped); 113 intersections.intersect(cubic, line); 114 result = intersections.used();
|
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/tools/sheriffing/ |
H A D | failureinfo.js | 20 * Finds the intersections between the blamelists. 32 var intersections = []; 35 intersections.push([range, [botName]]); 40 for (var j = 0; j < intersections.length; ++j) { 41 var intersect = rangeIntersection(intersections[j][0], range); 43 intersections[j][0] = intersect; 44 intersections[j][1].push(botName); 50 intersections.push([range, [botName]]); 54 return intersections; 93 var intersections [all...] |
/external/chromium_org/cc/quads/ |
H A D | draw_polygon.cc | 246 gfx::Point3F intersections[2]; local 251 // which resulted in the line/plane intersection giving us intersections[0]. 264 &intersections[current_intersection], 286 out_points[0].push_back(intersections[0]); 291 out_points[0].push_back(intersections[1]); 294 out_points[1].push_back(intersections[1]); 300 out_points[1].push_back(intersections[0]);
|