/external/skia/experimental/Intersection/ |
H A D | CubicBounds.cpp | 29 xy_at_t(cubic, leftTs[0], pt[0].x, pt[0].y); 30 xy_at_t(cubic, leftTs[1], pt[1].x, pt[1].y); 38 xy_at_t(cubic, startT, pt[0].x, pt[0].y); 39 xy_at_t(cubic, endT, pt[1].x, pt[1].y); 56 xy_at_t(cubic, tValues[x], result.x, result.y);
|
H A D | CubicConvexHull.cpp | 77 xy_at_t(cubic1, lineTs.fT[0][0], pt.x, pt.y); 93 xy_at_t(cubic1, minT1, pt.x, pt.y);
|
H A D | CubicIntersection.cpp | 131 _Point p1 = xy_at_t(cubic1, to1); 132 _Point p2 = xy_at_t(cubic2, to2); 395 pt = xy_at_t(cubic, (i.fT[cubicIndex][0] + i.fT[cubicIndex][1]) / 2); 404 pt = xy_at_t(cubic, (i.fT[cubicIndex][last] + i.fT[cubicIndex][last - 1]) / 2);
|
H A D | CubicIntersection_Test.cpp | 48 xy_at_t(cubic1, tt1, tx1, ty1); 51 xy_at_t(cubic2, tt2, tx2, ty2); 238 xy_at_t(cubic1, tt1, xy1.x, xy1.y); 241 xy_at_t(cubic2, tt2, xy2.x, xy2.y); 273 xy_at_t(cubic1, tt1, xy1.x, xy1.y); 276 xy_at_t(cubic2, tt2, xy2.x, xy2.y); 329 xy_at_t(cubic1, tt1, xy1.x, xy1.y); 332 xy_at_t(cubic2, tt2, xy2.x, xy2.y); 431 xy_at_t(cubic1, t1, x1, y1); 432 xy_at_t(cubic [all...] |
H A D | CubicUtilities.cpp | 393 xy_at_t(cubic, t, mid.x, mid.y); 403 void xy_at_t(const Cubic& cubic, double t, double& x, double& y) { function 404 _Point xy = xy_at_t(cubic, t); 413 _Point xy_at_t(const Cubic& cubic, double t) { function
|
H A D | CubicUtilities.h | 41 void xy_at_t(const Cubic& , double t, double& x, double& y); 42 _Point xy_at_t(const Cubic& , double t);
|
H A D | EdgeWalker.cpp | 126 xy_at_t(line, t, x, y); 134 xy_at_t(quad, t, x, y); 143 xy_at_t(cubic, t, x, y); 151 xy_at_t(aLine, t, *(double*) 0, y); 158 xy_at_t(quad, t, *(double*) 0, y); 166 xy_at_t(cubic, t, *(double*) 0, y);
|
H A D | LineCubicIntersection.cpp | 111 xy_at_t(line, lineT, pt.x, pt.y); 132 xy_at_t(cubic, cubicT, pt.x, pt.y); 158 xy_at_t(cubic, cubicT, pt.x, pt.y); 215 xy_at_t(cubic, t, x, y); 267 xy_at_t(cubic, rootVals[index], x, y);
|
H A D | LineCubicIntersection_Test.cpp | 47 xy_at_t(cubic, tt1, tx1, ty1); 50 xy_at_t(line, tt2, tx2, ty2);
|
H A D | LineIntersection.cpp | 30 i.fPt[0] = xy_at_t(a, i.fT[0][0]); 32 i.fPt[1] = xy_at_t(a, i.fT[0][1]); 71 i.fPt[0] = xy_at_t(a, numerA);
|
H A D | LineIntersection_Test.cpp | 49 xy_at_t(line1, ts.fT[0][i], result1.x, result1.y); 50 xy_at_t(line2, ts.fT[1][i], result2.x, result2.y); 55 xy_at_t(line2, ts.fT[1][i ^ 1], result2.x, result2.y);
|
H A D | LineQuadraticIntersection.cpp | 139 xy_at_t(line, lineT, pt.x, pt.y); 163 xy_at_t(quad, quadT, pt.x, pt.y); 192 xy_at_t(quad, quadT, pt.x, pt.y); 250 xy_at_t(quad, t, x, y); 302 xy_at_t(quad, t, x, *(double*) 0); 317 xy_at_t(quad, t, *(double*) 0, y); 340 xy_at_t(quad, rootVals[index], x, y);
|
H A D | LineQuadraticIntersection_Test.cpp | 79 xy_at_t(quad, quadT, quadX, quadY); 82 xy_at_t(line, lineT, lineX, lineY); 119 xy_at_t(quad, tt1, t1.x, t1.y); 122 xy_at_t(line, tt2, t2.x, t2.y); 160 xy_at_t(quad, quadT, quadX, quadY); 163 xy_at_t(line, lineT, lineX, lineY); 198 xy_at_t(quad, tIndex / 4.0, x, y);
|
H A D | LineUtilities.cpp | 119 void xy_at_t(const _Line& line, double t, double& x, double& y) { function 129 _Point xy_at_t(const _Line& line, double t) { function
|
H A D | LineUtilities.h | 14 void xy_at_t(const _Line& , double t, double& x, double& y); 15 _Point xy_at_t(const _Line& , double t);
|
H A D | QuadraticBounds.cpp | 18 xy_at_t(quad, startT, startPt.x, startPt.y); 20 xy_at_t(quad, endT, endPt.x, endPt.y); 37 xy_at_t(quad, tValues[x], result.x, result.y);
|
H A D | QuadraticImplicit.cpp | 130 xy_at_t(q2, tMid, mid.x, mid.y); 148 xy_at_t(q1, rootTs.fT[0][0], pt2.x, pt2.y); 171 xy_at_t(q2, t, qPt.x, qPt.y); 172 xy_at_t(*testLines[index], rootTs.fT[1][idx2], lPt.x, lPt.y); 194 xy_at_t(q2, t2s, end.x, end.y); 199 xy_at_t(q2, t2e, end.x, end.y); 342 if (calcMask & (1 << 1)) t1[1] = xy_at_t(quad1, t1Seed); 343 if (calcMask & (1 << 4)) t2[1] = xy_at_t(quad2, t2Seed); 352 if (calcMask & (1 << 0)) t1[0] = xy_at_t(quad1, t1Seed - tStep); 353 if (calcMask & (1 << 2)) t1[2] = xy_at_t(quad [all...] |
H A D | QuadraticIntersection.cpp | 73 xy_at_t(quad2, largeT, q2pt.x, q2pt.y); 74 xy_at_t(quad1, minT1, q1pt.x, q1pt.y); 78 xy_at_t(quad1, maxT1, q1pt.x, q1pt.y); // FIXME: debug code 84 xy_at_t(quad1, smallT, q1pt.x, q1pt.y); 85 xy_at_t(quad2, minT2, q2pt.x, q2pt.y); 89 xy_at_t(quad2, maxT2, q2pt.x, q2pt.y); // FIXME: debug code 150 xy_at_t(quad1, minT1, line1[0].x, line1[0].y); 151 xy_at_t(quad1, maxT1, line1[1].x, line1[1].y); 154 xy_at_t(quad2, minT2, line2[0].x, line2[0].y); 155 xy_at_t(quad [all...] |
H A D | QuadraticIntersection_Test.cpp | 38 xy_at_t(quad1, tt1, tx1, ty1); 41 xy_at_t(quad2, tt2, tx2, ty2); 214 xy_at_t(quad1, tt1, tx1, ty1); 218 xy_at_t(quad2, tt2, tx2, ty2); 301 xy_at_t(q1, t, onQuad.x, onQuad.y); 351 xy_at_t(quad1, t1Seed - t1Step, t1[0].x, t1[0].y); 352 xy_at_t(quad1, t1Seed, t1[1].x, t1[1].y); 353 xy_at_t(quad1, t1Seed + t1Step, t1[2].x, t1[2].y); 354 xy_at_t(quad2, t2Seed - t2Step, t2[0].x, t2[0].y); 355 xy_at_t(quad [all...] |
H A D | QuadraticUtilities.cpp | 32 xy_at_t(quad, ts[index], onQuad.x, onQuad.y); 61 xy_at_t(quad, extremeT, test.x, test.y); 234 void xy_at_t(const Quadratic& quad, double t, double& x, double& y) { function 247 _Point xy_at_t(const Quadratic& quad, double t) { function
|
H A D | QuadraticUtilities.h | 44 void xy_at_t(const Quadratic& , double t, double& x, double& y); 45 _Point xy_at_t(const Quadratic& , double t);
|
H A D | Simplify.cpp | 252 xy_at_t(line, t, x, y); 259 xy_at_t(line, t, out->x, out->y); 265 xy_at_t(quad, t, x, y); 272 xy_at_t(quad, t, out->x, out->y); 278 xy_at_t(cubic, t, x, y); 285 xy_at_t(cubic, t, out->x, out->y); 305 xy_at_t(aLine, t, x, *(double*) 0); 312 xy_at_t(quad, t, x, *(double*) 0); 319 xy_at_t(cubic, t, x, *(double*) 0); 333 xy_at_t(aLin [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicBounds.cpp | 29 xy_at_t(cubic, leftTs[0], pt[0].x, pt[0].y); 30 xy_at_t(cubic, leftTs[1], pt[1].x, pt[1].y); 38 xy_at_t(cubic, startT, pt[0].x, pt[0].y); 39 xy_at_t(cubic, endT, pt[1].x, pt[1].y); 56 xy_at_t(cubic, tValues[x], result.x, result.y);
|
H A D | CubicConvexHull.cpp | 77 xy_at_t(cubic1, lineTs.fT[0][0], pt.x, pt.y); 93 xy_at_t(cubic1, minT1, pt.x, pt.y);
|
H A D | CubicIntersection.cpp | 131 _Point p1 = xy_at_t(cubic1, to1); 132 _Point p2 = xy_at_t(cubic2, to2); 395 pt = xy_at_t(cubic, (i.fT[cubicIndex][0] + i.fT[cubicIndex][1]) / 2); 404 pt = xy_at_t(cubic, (i.fT[cubicIndex][last] + i.fT[cubicIndex][last - 1]) / 2);
|