| /external/skia/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 40 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
42 SkDPoint xy2 = quad2.ptAtT(tt2); in standardTestCases()
334 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1()
336 SkDPoint xy2 = quad2.ptAtT(tt2); in oneOffTest1()
385 SkDPoint pt1 = quad1.ptAtT(tt1); in coincidentTestOne()
386 SkDPoint pt2 = quad2.ptAtT(tt2); in coincidentTestOne()
408 t1[0] = quad1.ptAtT(t1Seed - t1Step); in intersectionFinder()
409 t1[1] = quad1.ptAtT(t1Seed); in intersectionFinder()
410 t1[2] = quad1.ptAtT(t1Seed + t1Step); in intersectionFinder()
411 t2[0] = quad2.ptAtT(t2Seed - t2Step); in intersectionFinder()
[all …]
|
| D | PathOpsCubicIntersectionTest.cpp | 54 SkDPoint xy1 = cubic1.ptAtT(tt1); in standardTestCases()
56 SkDPoint xy2 = cubic2.ptAtT(tt2); in standardTestCases()
410 xy1 = cubic1.ptAtT(tt1); in oneOff()
412 xy2 = cubic2.ptAtT(tt2); in oneOff()
497 SkDPoint xy1 = cubic1.ptAtT(tt1); in CubicIntersection_RandTest()
499 SkDPoint xy2 = cubic2.ptAtT(tt2); in CubicIntersection_RandTest()
513 t1[0] = cubic1.ptAtT(t1Seed - t1Step); in intersectionFinder()
514 t1[1] = cubic1.ptAtT(t1Seed); in intersectionFinder()
515 t1[2] = cubic1.ptAtT(t1Seed + t1Step); in intersectionFinder()
516 t2[0] = cubic2.ptAtT(t2Seed - t2Step); in intersectionFinder()
[all …]
|
| D | PathOpsCubicLineIntersectionTest.cpp | 147 SkDPoint xy1 = cubic.ptAtT(tt1); in testOne()
149 SkDPoint xy2 = line.ptAtT(tt2); in testOne()
158 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); in testOne()
159 SkDPoint sect = cubic.ptAtT(cubicT); in testOne()
164 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007); in testOne()
166 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007); in testOne()
|
| D | PathOpsCubicLineIntersectionIdeas.cpp | 59 SkDPoint cubicAtT = cubic.ptAtT(t); in binary_search()
76 SkDPoint lessPt = cubic.ptAtT(t - lastStep); in binary_search()
85 SkDPoint morePt = cubic.ptAtT(t + lastStep); in binary_search()
155 SkDPoint pt = cubic.ptAtT(t); in DEF_TEST()
171 SkDPoint calcPt = cubic.ptAtT(t); in DEF_TEST()
262 SkDPoint calcPt = cubic.ptAtT(t); in testOneFailure()
|
| D | PathOpsQuadLineIntersectionTest.cpp | 90 SkDPoint quadXY = quad.ptAtT(quadT); in testOneOffs()
92 SkDPoint lineXY = line.ptAtT(lineT); in testOneOffs()
134 SkDPoint t1 = quad.ptAtT(tt1); in DEF_TEST()
137 SkDPoint t2 = line.ptAtT(tt2); in DEF_TEST()
|
| D | PathOpsConicLineIntersectionTest.cpp | 79 SkDPoint conicXY = conic.ptAtT(conicT); in testOneOffs()
81 SkDPoint lineXY = line.ptAtT(lineT); in testOneOffs()
126 SkDPoint t1 = conic.ptAtT(tt1); in DEF_TEST()
129 SkDPoint t2 = line.ptAtT(tt2); in DEF_TEST()
|
| D | PathOpsAngleIdeas.cpp | 105 const SkDVector& pt = quad.ptAtT(t) - quad[0]; in quadAngle()
151 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in checkParallel()
152 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0]; in checkParallel()
195 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in quadHullsOverlap()
196 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0]; in quadHullsOverlap()
300 SkDPoint pt1 = quad1.ptAtT(tRange.t1); in bruteMinT()
305 SkDPoint pt2 = quad2.ptAtT(tRange.t2); in bruteMinT()
356 SkDPoint pt1 = quad1.ptAtT(tRange.t1); in bruteMinT()
357 SkDPoint pt2 = quad2.ptAtT(tRange.t2); in bruteMinT()
485 midSpokes[index] = q.ptAtT(0.5) - origin; in testQuadAngles()
[all …]
|
| D | PathOpsQuadLineIntersectionThreadedTest.cpp | 58 SkDPoint quadXY = quad.ptAtT(quadT); in testLineIntersect()
60 SkDPoint lineXY = line.ptAtT(lineT); in testLineIntersect()
91 SkDPoint xy = quad.ptAtT(tIndex / 4.0); in testQuadLineIntersectMain()
|
| D | PathOpsCubicQuadIntersectionTest.cpp | 76 SkDPoint xy1 = cubic.ptAtT(tt1); in cubicQuadIntersection()
78 SkDPoint xy2 = quad.ptAtT(tt2); in cubicQuadIntersection()
|
| D | PathOpsConicIntersectionTest.cpp | 43 xy1 = c1.ptAtT(tt1); in oneOff()
45 xy2 = c2.ptAtT(tt2); in oneOff()
|
| D | PathOpsLineIntersectionTest.cpp | 90 SkDPoint result1 = line1.ptAtT(ts[0][i]); in check_results()
91 SkDPoint result2 = line2.ptAtT(ts[1][i]); in check_results()
97 result2 = line2.ptAtT(ts[1][i ^ 1]); in check_results()
|
| D | PathOpsAngleTest.cpp | 43 SkDPoint dPt = line.ptAtT(t); in DEF_TEST()
77 SkDPoint dPt = line.ptAtT(t); in DEF_TEST()
79 SkDPoint qPt = line.ptAtT(t2); in DEF_TEST()
81 SkDPoint qPt2 = line.ptAtT(t3); in DEF_TEST()
|
| D | PathOpsDLineTest.cpp | 46 SkDPoint mid = line.ptAtT(.5); in DEF_TEST()
|
| /external/skia/src/pathops/ |
| D | SkDCubicLineIntersection.cpp | 100 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); in checkCoincident()
131 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
171 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
191 SkDPoint pt = { fCubic.ptAtT(cubicT).fX, axisIntercept }; in horizontalIntersect()
215 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); in uniqueAnswer()
221 SkDPoint cPt = fCubic.ptAtT(cubicT); in uniqueAnswer()
234 SkDPoint calcPt = c.ptAtT(roots[index]); in VerticalIntersect()
254 SkDPoint pt = { axisIntercept, fCubic.ptAtT(cubicT).fY }; in verticalIntersect()
349 SkDPoint xy = fCubic.ptAtT(t); in findLineT()
367 SkDPoint lPt = fLine.ptAtT(lT); in pinTs()
[all …]
|
| D | SkDConicLineIntersection.cpp | 41 SkDPoint conicMidPt = fConic.ptAtT(conicMidT); in checkCoincident()
80 SkDPoint pt = fConic.ptAtT(conicT); in horizontalIntersect()
106 SkDEBUGCODE(SkDPoint conicPt = fConic.ptAtT(conicT)); in intersect()
107 SkDEBUGCODE(SkDPoint linePt = fLine->ptAtT(lineT)); in intersect()
153 SkDPoint pt = fConic.ptAtT(conicT); in verticalIntersect()
251 SkDPoint xy = fConic.ptAtT(t); in findLineT()
270 *pt = (*fLine).ptAtT(lT); in pinTs()
272 *pt = fConic.ptAtT(qT); in pinTs()
306 SkDPoint conicMidPt = fConic.ptAtT(conicMidT); in uniqueAnswer()
312 SkDPoint qPt = fConic.ptAtT(conicT); in uniqueAnswer()
[all …]
|
| D | SkDQuadLineIntersection.cpp | 119 SkDPoint quadMidPt = fQuad.ptAtT(quadMidT); in checkCoincident()
206 SkDPoint pt = fQuad.ptAtT(quadT); in horizontalIntersect()
230 SkDPoint quadMidPt = fQuad.ptAtT(quadMidT); in uniqueAnswer()
236 SkDPoint qPt = fQuad.ptAtT(quadT); in uniqueAnswer()
262 SkDPoint pt = fQuad.ptAtT(quadT); in verticalIntersect()
356 SkDPoint xy = fQuad.ptAtT(t); in findLineT()
375 *pt = (*fLine).ptAtT(lT); in pinTs()
377 *pt = fQuad.ptAtT(qT); in pinTs()
431 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkPathOpsRect.cpp | 26 add(curve.ptAtT(t)); in setBounds()
43 add(curve.ptAtT(t)); in setBounds()
60 add(curve.ptAtT(t)); in setBounds()
|
| D | SkPathOpsCurve.h | 89 return line.ptAtT(t); in dline_xy_at_t()
95 return quad.ptAtT(t); in dquad_xy_at_t()
101 return conic.ptAtT(t); in dconic_xy_at_t()
107 return cubic.ptAtT(t); in dcubic_xy_at_t()
201 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) }; in line_is_vertical()
|
| D | SkPathOpsLine.cpp | 37 SkDPoint SkDLine::ptAtT(double t) const { in ptAtT() function in SkDLine
73 SkDPoint realPt = ptAtT(t); in nearPoint()
97 SkDPoint realPt = ptAtT(t); in nearRay()
|
| D | SkPathOpsCubic.cpp | 34 SkDPoint cubicAtT = ptAtT(t); in binarySearch()
40 SkDPoint lessPt = ptAtT(priorT); in binarySearch()
59 SkDPoint morePt = ptAtT(nextT); in binarySearch()
70 SkDPoint testAtT = ptAtT(t); in binarySearch()
265 SkDPoint pt = cubic.ptAtT(inflectionTs[index]); in ComplexBreak()
272 SkDPoint pt = cubic.ptAtT(maxCurvature[index]); in ComplexBreak()
543 SkDPoint SkDCubic::ptAtT(double t) const { in ptAtT() function in SkDCubic
681 SkDPoint mid = dCurve.ptAtT(t); in top()
|
| D | SkConicLineIntersection.cpp | 34 fPt[index] = conic.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkPathOpsLine.h | 35 SkDPoint ptAtT(double t) const;
|
| D | SkPathOpsQuad.h | 72 SkDPoint ptAtT(double t) const;
|
| D | SkPathOpsConic.h | 87 SkDPoint ptAtT(double t) const;
|
| D | SkDLineIntersection.cpp | 28 fPt[0] = line.ptAtT(fT[0][0]); in computePoints()
30 fPt[1] = line.ptAtT(fT[0][1]); in computePoints()
|