| /external/skia/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 44 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
46 SkDPoint xy2 = quad2.ptAtT(tt2); in standardTestCases()
348 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1()
350 SkDPoint xy2 = quad2.ptAtT(tt2); in oneOffTest1()
403 SkDPoint pt1 = quad1.ptAtT(tt1); in coincidentTestOne()
404 SkDPoint pt2 = quad2.ptAtT(tt2); in coincidentTestOne()
428 t1[0] = quad1.ptAtT(t1Seed - t1Step); in intersectionFinder()
429 t1[1] = quad1.ptAtT(t1Seed); in intersectionFinder()
430 t1[2] = quad1.ptAtT(t1Seed + t1Step); in intersectionFinder()
431 t2[0] = quad2.ptAtT(t2Seed - t2Step); in intersectionFinder()
[all …]
|
| D | PathOpsCubicIntersectionTest.cpp | 59 SkDPoint xy1 = c1.ptAtT(tt1); in standardTestCases()
61 SkDPoint xy2 = c2.ptAtT(tt2); in standardTestCases()
422 xy1 = c1.ptAtT(tt1); in oneOff()
424 xy2 = c2.ptAtT(tt2); in oneOff()
518 SkDPoint xy1 = c1.ptAtT(tt1); in CubicIntersection_RandTest()
520 SkDPoint xy2 = c2.ptAtT(tt2); in CubicIntersection_RandTest()
537 t1[0] = c1.ptAtT(t1Seed - t1Step); in intersectionFinder()
538 t1[1] = c1.ptAtT(t1Seed); in intersectionFinder()
539 t1[2] = c1.ptAtT(t1Seed + t1Step); in intersectionFinder()
540 t2[0] = c2.ptAtT(t2Seed - t2Step); in intersectionFinder()
[all …]
|
| D | PathOpsCubicLineIntersectionTest.cpp | 155 SkDPoint xy1 = cubic.ptAtT(tt1); in testOne()
157 SkDPoint xy2 = line.ptAtT(tt2); in testOne()
166 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); in testOne()
167 SkDPoint sect = cubic.ptAtT(cubicT); in testOne()
170 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007); in testOne()
172 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()
157 SkDPoint pt = cubic.ptAtT(t); in DEF_TEST()
173 SkDPoint calcPt = cubic.ptAtT(t); in DEF_TEST()
266 SkDPoint calcPt = cubic.ptAtT(t); in testOneFailure()
|
| D | PathOpsQuadLineIntersectionTest.cpp | 96 SkDPoint quadXY = quad.ptAtT(quadT); in testOneOffs()
98 SkDPoint lineXY = line.ptAtT(lineT); in testOneOffs()
142 SkDPoint t1 = quad.ptAtT(tt1); in DEF_TEST()
145 SkDPoint t2 = line.ptAtT(tt2); in DEF_TEST()
|
| D | PathOpsConicLineIntersectionTest.cpp | 86 SkDPoint conicXY = conic.ptAtT(conicT); in testOneOffs()
88 SkDPoint lineXY = line.ptAtT(lineT); in testOneOffs()
137 SkDPoint t1 = conic.ptAtT(tt1); in DEF_TEST()
140 SkDPoint t2 = line.ptAtT(tt2); in DEF_TEST()
|
| D | PathOpsAngleIdeas.cpp | 107 const SkDVector& pt = quad.ptAtT(t) - quad[0]; in quadAngle()
153 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in checkParallel()
154 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0]; in checkParallel()
197 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in quadHullsOverlap()
198 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0]; in quadHullsOverlap()
302 SkDPoint pt1 = quad1.ptAtT(tRange.t1); in bruteMinT()
307 SkDPoint pt2 = quad2.ptAtT(tRange.t2); in bruteMinT()
361 SkDPoint pt1 = quad1.ptAtT(tRange.t1); in bruteMinT()
362 SkDPoint pt2 = quad2.ptAtT(tRange.t2); in bruteMinT()
489 midSpokes[index] = q.ptAtT(0.5) - origin; in testQuadAngles()
[all …]
|
| D | PathOpsQuadLineIntersectionThreadedTest.cpp | 62 SkDPoint quadXY = quad.ptAtT(quadT); in testLineIntersect()
64 SkDPoint lineXY = line.ptAtT(lineT); in testLineIntersect()
97 SkDPoint xy = quad.ptAtT(tIndex / 4.0); in testQuadLineIntersectMain()
|
| /external/skqp/tests/ |
| D | PathOpsQuadIntersectionTest.cpp | 44 SkDPoint xy1 = quad1.ptAtT(tt1); in standardTestCases()
46 SkDPoint xy2 = quad2.ptAtT(tt2); in standardTestCases()
348 SkDPoint xy1 = quad1.ptAtT(tt1); in oneOffTest1()
350 SkDPoint xy2 = quad2.ptAtT(tt2); in oneOffTest1()
403 SkDPoint pt1 = quad1.ptAtT(tt1); in coincidentTestOne()
404 SkDPoint pt2 = quad2.ptAtT(tt2); in coincidentTestOne()
428 t1[0] = quad1.ptAtT(t1Seed - t1Step); in intersectionFinder()
429 t1[1] = quad1.ptAtT(t1Seed); in intersectionFinder()
430 t1[2] = quad1.ptAtT(t1Seed + t1Step); in intersectionFinder()
431 t2[0] = quad2.ptAtT(t2Seed - t2Step); in intersectionFinder()
[all …]
|
| D | PathOpsCubicIntersectionTest.cpp | 59 SkDPoint xy1 = c1.ptAtT(tt1); in standardTestCases()
61 SkDPoint xy2 = c2.ptAtT(tt2); in standardTestCases()
422 xy1 = c1.ptAtT(tt1); in oneOff()
424 xy2 = c2.ptAtT(tt2); in oneOff()
518 SkDPoint xy1 = c1.ptAtT(tt1); in CubicIntersection_RandTest()
520 SkDPoint xy2 = c2.ptAtT(tt2); in CubicIntersection_RandTest()
537 t1[0] = c1.ptAtT(t1Seed - t1Step); in intersectionFinder()
538 t1[1] = c1.ptAtT(t1Seed); in intersectionFinder()
539 t1[2] = c1.ptAtT(t1Seed + t1Step); in intersectionFinder()
540 t2[0] = c2.ptAtT(t2Seed - t2Step); in intersectionFinder()
[all …]
|
| D | PathOpsCubicLineIntersectionTest.cpp | 155 SkDPoint xy1 = cubic.ptAtT(tt1); in testOne()
157 SkDPoint xy2 = line.ptAtT(tt2); in testOne()
166 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); in testOne()
167 SkDPoint sect = cubic.ptAtT(cubicT); in testOne()
170 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007); in testOne()
172 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()
157 SkDPoint pt = cubic.ptAtT(t); in DEF_TEST()
173 SkDPoint calcPt = cubic.ptAtT(t); in DEF_TEST()
266 SkDPoint calcPt = cubic.ptAtT(t); in testOneFailure()
|
| D | PathOpsQuadLineIntersectionTest.cpp | 96 SkDPoint quadXY = quad.ptAtT(quadT); in testOneOffs()
98 SkDPoint lineXY = line.ptAtT(lineT); in testOneOffs()
142 SkDPoint t1 = quad.ptAtT(tt1); in DEF_TEST()
145 SkDPoint t2 = line.ptAtT(tt2); in DEF_TEST()
|
| D | PathOpsConicLineIntersectionTest.cpp | 86 SkDPoint conicXY = conic.ptAtT(conicT); in testOneOffs()
88 SkDPoint lineXY = line.ptAtT(lineT); in testOneOffs()
137 SkDPoint t1 = conic.ptAtT(tt1); in DEF_TEST()
140 SkDPoint t2 = line.ptAtT(tt2); in DEF_TEST()
|
| D | PathOpsAngleIdeas.cpp | 107 const SkDVector& pt = quad.ptAtT(t) - quad[0]; in quadAngle()
153 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in checkParallel()
154 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0]; in checkParallel()
197 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in quadHullsOverlap()
198 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0]; in quadHullsOverlap()
302 SkDPoint pt1 = quad1.ptAtT(tRange.t1); in bruteMinT()
307 SkDPoint pt2 = quad2.ptAtT(tRange.t2); in bruteMinT()
361 SkDPoint pt1 = quad1.ptAtT(tRange.t1); in bruteMinT()
362 SkDPoint pt2 = quad2.ptAtT(tRange.t2); in bruteMinT()
489 midSpokes[index] = q.ptAtT(0.5) - origin; in testQuadAngles()
[all …]
|
| /external/skqp/src/pathops/ |
| D | SkDCubicLineIntersection.cpp | 101 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); in checkCoincident()
133 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
173 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
193 SkDPoint pt = { fCubic.ptAtT(cubicT).fX, axisIntercept }; in horizontalIntersect()
217 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); in uniqueAnswer()
223 SkDPoint cPt = fCubic.ptAtT(cubicT); in uniqueAnswer()
236 SkDPoint calcPt = c.ptAtT(roots[index]); in VerticalIntersect()
256 SkDPoint pt = { axisIntercept, fCubic.ptAtT(cubicT).fY }; in verticalIntersect()
367 SkDPoint xy = fCubic.ptAtT(t); in findLineT()
385 SkDPoint lPt = fLine.ptAtT(lT); in pinTs()
[all …]
|
| D | SkDConicLineIntersection.cpp | 42 SkDPoint conicMidPt = fConic.ptAtT(conicMidT); in checkCoincident()
81 SkDPoint pt = fConic.ptAtT(conicT); in horizontalIntersect()
110 SkDEBUGCODE(SkDPoint conicPt = fConic.ptAtT(conicT)); in intersect()
111 SkDEBUGCODE(SkDPoint linePt = fLine->ptAtT(lineT)); in intersect()
159 SkDPoint pt = fConic.ptAtT(conicT); in verticalIntersect()
272 SkDPoint xy = fConic.ptAtT(t); in findLineT()
291 *pt = (*fLine).ptAtT(lT); in pinTs()
293 *pt = fConic.ptAtT(qT); in pinTs()
327 SkDPoint conicMidPt = fConic.ptAtT(conicMidT); in uniqueAnswer()
333 SkDPoint qPt = fConic.ptAtT(conicT); in uniqueAnswer()
[all …]
|
| D | SkDQuadLineIntersection.cpp | 120 SkDPoint quadMidPt = fQuad.ptAtT(quadMidT); in checkCoincident()
207 SkDPoint pt = fQuad.ptAtT(quadT); in horizontalIntersect()
231 SkDPoint quadMidPt = fQuad.ptAtT(quadMidT); in uniqueAnswer()
237 SkDPoint qPt = fQuad.ptAtT(quadT); in uniqueAnswer()
263 SkDPoint pt = fQuad.ptAtT(quadT); in verticalIntersect()
372 SkDPoint xy = fQuad.ptAtT(t); in findLineT()
391 *pt = (*fLine).ptAtT(lT); in pinTs()
393 *pt = fQuad.ptAtT(qT); in pinTs()
447 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkPathOpsCurve.h | 105 return line.ptAtT(t); in dline_xy_at_t()
111 return quad.ptAtT(t); in dquad_xy_at_t()
117 return conic.ptAtT(t); in dconic_xy_at_t()
123 return cubic.ptAtT(t); in dcubic_xy_at_t()
135 return c.fLine.ptAtT(t); in ddline_xy_at_t()
139 return c.fQuad.ptAtT(t); in ddquad_xy_at_t()
143 return c.fConic.ptAtT(t); in ddconic_xy_at_t()
147 return c.fCubic.ptAtT(t); in ddcubic_xy_at_t()
265 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) }; in line_is_vertical()
|
| D | SkPathOpsRect.cpp | 26 add(curve.ptAtT(t)); in setBounds()
43 add(curve.ptAtT(t)); in setBounds()
60 add(curve.ptAtT(t)); in setBounds()
|
| /external/skia/src/pathops/ |
| D | SkDCubicLineIntersection.cpp | 101 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); in checkCoincident()
133 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
173 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
193 SkDPoint pt = { fCubic.ptAtT(cubicT).fX, axisIntercept }; in horizontalIntersect()
217 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT); in uniqueAnswer()
223 SkDPoint cPt = fCubic.ptAtT(cubicT); in uniqueAnswer()
236 SkDPoint calcPt = c.ptAtT(roots[index]); in VerticalIntersect()
256 SkDPoint pt = { axisIntercept, fCubic.ptAtT(cubicT).fY }; in verticalIntersect()
367 SkDPoint xy = fCubic.ptAtT(t); in findLineT()
385 SkDPoint lPt = fLine.ptAtT(lT); in pinTs()
[all …]
|
| D | SkDConicLineIntersection.cpp | 42 SkDPoint conicMidPt = fConic.ptAtT(conicMidT); in checkCoincident()
81 SkDPoint pt = fConic.ptAtT(conicT); in horizontalIntersect()
110 SkDEBUGCODE(SkDPoint conicPt = fConic.ptAtT(conicT)); in intersect()
111 SkDEBUGCODE(SkDPoint linePt = fLine->ptAtT(lineT)); in intersect()
159 SkDPoint pt = fConic.ptAtT(conicT); in verticalIntersect()
272 SkDPoint xy = fConic.ptAtT(t); in findLineT()
291 *pt = (*fLine).ptAtT(lT); in pinTs()
293 *pt = fConic.ptAtT(qT); in pinTs()
327 SkDPoint conicMidPt = fConic.ptAtT(conicMidT); in uniqueAnswer()
333 SkDPoint qPt = fConic.ptAtT(conicT); in uniqueAnswer()
[all …]
|
| D | SkDQuadLineIntersection.cpp | 120 SkDPoint quadMidPt = fQuad.ptAtT(quadMidT); in checkCoincident()
207 SkDPoint pt = fQuad.ptAtT(quadT); in horizontalIntersect()
231 SkDPoint quadMidPt = fQuad.ptAtT(quadMidT); in uniqueAnswer()
237 SkDPoint qPt = fQuad.ptAtT(quadT); in uniqueAnswer()
263 SkDPoint pt = fQuad.ptAtT(quadT); in verticalIntersect()
372 SkDPoint xy = fQuad.ptAtT(t); in findLineT()
391 *pt = (*fLine).ptAtT(lT); in pinTs()
393 *pt = fQuad.ptAtT(qT); in pinTs()
447 fPt[index] = quad.ptAtT(fT[0][index]); in intersectRay()
|
| D | SkPathOpsCurve.h | 105 return line.ptAtT(t); in dline_xy_at_t()
111 return quad.ptAtT(t); in dquad_xy_at_t()
117 return conic.ptAtT(t); in dconic_xy_at_t()
123 return cubic.ptAtT(t); in dcubic_xy_at_t()
135 return c.fLine.ptAtT(t); in ddline_xy_at_t()
139 return c.fQuad.ptAtT(t); in ddquad_xy_at_t()
143 return c.fConic.ptAtT(t); in ddconic_xy_at_t()
147 return c.fCubic.ptAtT(t); in ddcubic_xy_at_t()
265 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) }; in line_is_vertical()
|
| D | SkPathOpsRect.cpp | 26 add(curve.ptAtT(t)); in setBounds()
43 add(curve.ptAtT(t)); in setBounds()
60 add(curve.ptAtT(t)); in setBounds()
|