Home
last modified time | relevance | path

Searched refs:xy_at_t (Results 1 – 25 of 44) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
DQuadraticIntersection_Test.cpp38 xy_at_t(quad1, tt1, tx1, ty1); in standardTestCases()
41 xy_at_t(quad2, tt2, tx2, ty2); in standardTestCases()
214 xy_at_t(quad1, tt1, tx1, ty1); in oneOffTest1()
218 xy_at_t(quad2, tt2, tx2, ty2); in oneOffTest1()
301 xy_at_t(q1, t, onQuad.x, onQuad.y); in pointFinder()
351 xy_at_t(quad1, t1Seed - t1Step, t1[0].x, t1[0].y); in intersectionFinder()
352 xy_at_t(quad1, t1Seed, t1[1].x, t1[1].y); in intersectionFinder()
353 xy_at_t(quad1, t1Seed + t1Step, t1[2].x, t1[2].y); in intersectionFinder()
354 xy_at_t(quad2, t2Seed - t2Step, t2[0].x, t2[0].y); in intersectionFinder()
355 xy_at_t(quad2, t2Seed, t2[1].x, t2[1].y); in intersectionFinder()
[all …]
DQuadraticIntersection.cpp73 xy_at_t(quad2, largeT, q2pt.x, q2pt.y); in intersect()
74 xy_at_t(quad1, minT1, q1pt.x, q1pt.y); in intersect()
78 xy_at_t(quad1, maxT1, q1pt.x, q1pt.y); // FIXME: debug code in intersect()
84 xy_at_t(quad1, smallT, q1pt.x, q1pt.y); in intersect()
85 xy_at_t(quad2, minT2, q2pt.x, q2pt.y); in intersect()
89 xy_at_t(quad2, maxT2, q2pt.x, q2pt.y); // FIXME: debug code in intersect()
150 xy_at_t(quad1, minT1, line1[0].x, line1[0].y); in intersectAsLine()
151 xy_at_t(quad1, maxT1, line1[1].x, line1[1].y); in intersectAsLine()
154 xy_at_t(quad2, minT2, line2[0].x, line2[0].y); in intersectAsLine()
155 xy_at_t(quad2, maxT2, line2[1].x, line2[1].y); in intersectAsLine()
[all …]
DCubicIntersection_Test.cpp48 xy_at_t(cubic1, tt1, tx1, ty1); in standardTestCases()
51 xy_at_t(cubic2, tt2, tx2, ty2); in standardTestCases()
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); in oneOff3()
332 xy_at_t(cubic2, tt2, xy2.x, xy2.y); in oneOff3()
431 xy_at_t(cubic1, t1, x1, y1);
432 xy_at_t(cubic2, t2, x2, y2);
[all …]
DCubicBounds.cpp29 xy_at_t(cubic, leftTs[0], pt[0].x, pt[0].y); in leftMostT()
30 xy_at_t(cubic, leftTs[1], pt[1].x, pt[1].y); in leftMostT()
38 xy_at_t(cubic, startT, pt[0].x, pt[0].y); in leftMostT()
39 xy_at_t(cubic, endT, pt[1].x, pt[1].y); in leftMostT()
56 xy_at_t(cubic, tValues[x], result.x, result.y); in setBounds()
DLineQuadraticIntersection_Test.cpp79 xy_at_t(quad, quadT, quadX, quadY); in testOneOffs()
82 xy_at_t(line, lineT, lineX, lineY); in testOneOffs()
119 xy_at_t(quad, tt1, t1.x, t1.y); in LineQuadraticIntersection_Test()
122 xy_at_t(line, tt2, t2.x, t2.y); in LineQuadraticIntersection_Test()
160 xy_at_t(quad, quadT, quadX, quadY); in testLineIntersect()
163 xy_at_t(line, lineT, lineX, lineY); in testLineIntersect()
198 xy_at_t(quad, tIndex / 4.0, x, y); in testQuadLineIntersectMain()
DLineQuadraticIntersection.cpp139 xy_at_t(line, lineT, pt.x, pt.y); in intersect()
163 xy_at_t(quad, quadT, pt.x, pt.y); in horizontalIntersect()
192 xy_at_t(quad, quadT, pt.x, pt.y); in verticalIntersect()
250 xy_at_t(quad, t, x, y); in findLineT()
302 xy_at_t(quad, t, x, *(double*) 0); in horizontalIntersect()
317 xy_at_t(quad, t, *(double*) 0, y); in verticalIntersect()
340 xy_at_t(quad, rootVals[index], x, y); in horizontalIntersect()
DLineIntersection_Test.cpp49 xy_at_t(line1, ts.fT[0][i], result1.x, result1.y); in LineIntersection_Test()
50 xy_at_t(line2, ts.fT[1][i], result2.x, result2.y); in LineIntersection_Test()
55 xy_at_t(line2, ts.fT[1][i ^ 1], result2.x, result2.y); in LineIntersection_Test()
DQuadraticBounds.cpp18 xy_at_t(quad, startT, startPt.x, startPt.y); in leftMostT()
20 xy_at_t(quad, endT, endPt.x, endPt.y); in leftMostT()
37 xy_at_t(quad, tValues[x], result.x, result.y); in setBounds()
DQuadraticImplicit.cpp130 xy_at_t(q2, tMid, mid.x, mid.y); in addIntercept()
148 xy_at_t(q1, rootTs.fT[0][0], pt2.x, pt2.y); in addIntercept()
171 xy_at_t(q2, t, qPt.x, qPt.y); in isLinearInner()
172 xy_at_t(*testLines[index], rootTs.fT[1][idx2], lPt.x, lPt.y); in isLinearInner()
194 xy_at_t(q2, t2s, end.x, end.y); in isLinearInner()
199 xy_at_t(q2, t2e, end.x, end.y); in isLinearInner()
342 if (calcMask & (1 << 1)) t1[1] = xy_at_t(quad1, t1Seed); in binarySearch()
343 if (calcMask & (1 << 4)) t2[1] = xy_at_t(quad2, t2Seed); in binarySearch()
352 if (calcMask & (1 << 0)) t1[0] = xy_at_t(quad1, t1Seed - tStep); in binarySearch()
353 if (calcMask & (1 << 2)) t1[2] = xy_at_t(quad1, t1Seed + tStep); in binarySearch()
[all …]
DLineUtilities.h14 void xy_at_t(const _Line& , double t, double& x, double& y);
15 _Point xy_at_t(const _Line& , double t);
DLineCubicIntersection.cpp111 xy_at_t(line, lineT, pt.x, pt.y); in intersect()
132 xy_at_t(cubic, cubicT, pt.x, pt.y); in horizontalIntersect()
158 xy_at_t(cubic, cubicT, pt.x, pt.y); in verticalIntersect()
215 xy_at_t(cubic, t, x, y); in findLineT()
267 xy_at_t(cubic, rootVals[index], x, y); in horizontalIntersect()
DQuadraticUtilities.h44 void xy_at_t(const Quadratic& , double t, double& x, double& y);
45 _Point xy_at_t(const Quadratic& , double t);
/external/skia/experimental/Intersection/
DQuadraticIntersection_Test.cpp38 xy_at_t(quad1, tt1, tx1, ty1); in standardTestCases()
41 xy_at_t(quad2, tt2, tx2, ty2); in standardTestCases()
214 xy_at_t(quad1, tt1, tx1, ty1); in oneOffTest1()
218 xy_at_t(quad2, tt2, tx2, ty2); in oneOffTest1()
301 xy_at_t(q1, t, onQuad.x, onQuad.y); in pointFinder()
351 xy_at_t(quad1, t1Seed - t1Step, t1[0].x, t1[0].y); in intersectionFinder()
352 xy_at_t(quad1, t1Seed, t1[1].x, t1[1].y); in intersectionFinder()
353 xy_at_t(quad1, t1Seed + t1Step, t1[2].x, t1[2].y); in intersectionFinder()
354 xy_at_t(quad2, t2Seed - t2Step, t2[0].x, t2[0].y); in intersectionFinder()
355 xy_at_t(quad2, t2Seed, t2[1].x, t2[1].y); in intersectionFinder()
[all …]
DQuadraticIntersection.cpp73 xy_at_t(quad2, largeT, q2pt.x, q2pt.y); in intersect()
74 xy_at_t(quad1, minT1, q1pt.x, q1pt.y); in intersect()
78 xy_at_t(quad1, maxT1, q1pt.x, q1pt.y); // FIXME: debug code in intersect()
84 xy_at_t(quad1, smallT, q1pt.x, q1pt.y); in intersect()
85 xy_at_t(quad2, minT2, q2pt.x, q2pt.y); in intersect()
89 xy_at_t(quad2, maxT2, q2pt.x, q2pt.y); // FIXME: debug code in intersect()
150 xy_at_t(quad1, minT1, line1[0].x, line1[0].y); in intersectAsLine()
151 xy_at_t(quad1, maxT1, line1[1].x, line1[1].y); in intersectAsLine()
154 xy_at_t(quad2, minT2, line2[0].x, line2[0].y); in intersectAsLine()
155 xy_at_t(quad2, maxT2, line2[1].x, line2[1].y); in intersectAsLine()
[all …]
DCubicIntersection_Test.cpp48 xy_at_t(cubic1, tt1, tx1, ty1); in standardTestCases()
51 xy_at_t(cubic2, tt2, tx2, ty2); in standardTestCases()
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); in oneOff3()
332 xy_at_t(cubic2, tt2, xy2.x, xy2.y); in oneOff3()
431 xy_at_t(cubic1, t1, x1, y1);
432 xy_at_t(cubic2, t2, x2, y2);
[all …]
DCubicBounds.cpp29 xy_at_t(cubic, leftTs[0], pt[0].x, pt[0].y); in leftMostT()
30 xy_at_t(cubic, leftTs[1], pt[1].x, pt[1].y); in leftMostT()
38 xy_at_t(cubic, startT, pt[0].x, pt[0].y); in leftMostT()
39 xy_at_t(cubic, endT, pt[1].x, pt[1].y); in leftMostT()
56 xy_at_t(cubic, tValues[x], result.x, result.y); in setBounds()
DLineQuadraticIntersection.cpp139 xy_at_t(line, lineT, pt.x, pt.y); in intersect()
163 xy_at_t(quad, quadT, pt.x, pt.y); in horizontalIntersect()
192 xy_at_t(quad, quadT, pt.x, pt.y); in verticalIntersect()
250 xy_at_t(quad, t, x, y); in findLineT()
302 xy_at_t(quad, t, x, *(double*) 0); in horizontalIntersect()
317 xy_at_t(quad, t, *(double*) 0, y); in verticalIntersect()
340 xy_at_t(quad, rootVals[index], x, y); in horizontalIntersect()
DLineQuadraticIntersection_Test.cpp79 xy_at_t(quad, quadT, quadX, quadY); in testOneOffs()
82 xy_at_t(line, lineT, lineX, lineY); in testOneOffs()
119 xy_at_t(quad, tt1, t1.x, t1.y); in LineQuadraticIntersection_Test()
122 xy_at_t(line, tt2, t2.x, t2.y); in LineQuadraticIntersection_Test()
160 xy_at_t(quad, quadT, quadX, quadY); in testLineIntersect()
163 xy_at_t(line, lineT, lineX, lineY); in testLineIntersect()
198 xy_at_t(quad, tIndex / 4.0, x, y); in testQuadLineIntersectMain()
DQuadraticBounds.cpp18 xy_at_t(quad, startT, startPt.x, startPt.y); in leftMostT()
20 xy_at_t(quad, endT, endPt.x, endPt.y); in leftMostT()
37 xy_at_t(quad, tValues[x], result.x, result.y); in setBounds()
DLineIntersection_Test.cpp49 xy_at_t(line1, ts.fT[0][i], result1.x, result1.y); in LineIntersection_Test()
50 xy_at_t(line2, ts.fT[1][i], result2.x, result2.y); in LineIntersection_Test()
55 xy_at_t(line2, ts.fT[1][i ^ 1], result2.x, result2.y); in LineIntersection_Test()
DQuadraticImplicit.cpp130 xy_at_t(q2, tMid, mid.x, mid.y); in addIntercept()
148 xy_at_t(q1, rootTs.fT[0][0], pt2.x, pt2.y); in addIntercept()
171 xy_at_t(q2, t, qPt.x, qPt.y); in isLinearInner()
172 xy_at_t(*testLines[index], rootTs.fT[1][idx2], lPt.x, lPt.y); in isLinearInner()
194 xy_at_t(q2, t2s, end.x, end.y); in isLinearInner()
199 xy_at_t(q2, t2e, end.x, end.y); in isLinearInner()
342 if (calcMask & (1 << 1)) t1[1] = xy_at_t(quad1, t1Seed); in binarySearch()
343 if (calcMask & (1 << 4)) t2[1] = xy_at_t(quad2, t2Seed); in binarySearch()
352 if (calcMask & (1 << 0)) t1[0] = xy_at_t(quad1, t1Seed - tStep); in binarySearch()
353 if (calcMask & (1 << 2)) t1[2] = xy_at_t(quad1, t1Seed + tStep); in binarySearch()
[all …]
DLineUtilities.h14 void xy_at_t(const _Line& , double t, double& x, double& y);
15 _Point xy_at_t(const _Line& , double t);
DLineCubicIntersection.cpp111 xy_at_t(line, lineT, pt.x, pt.y); in intersect()
132 xy_at_t(cubic, cubicT, pt.x, pt.y); in horizontalIntersect()
158 xy_at_t(cubic, cubicT, pt.x, pt.y); in verticalIntersect()
215 xy_at_t(cubic, t, x, y); in findLineT()
267 xy_at_t(cubic, rootVals[index], x, y); in horizontalIntersect()
DQuadraticUtilities.h44 void xy_at_t(const Quadratic& , double t, double& x, double& y);
45 _Point xy_at_t(const Quadratic& , double t);
DLineCubicIntersection_Test.cpp47 xy_at_t(cubic, tt1, tx1, ty1); in LineCubicIntersection_Test()
50 xy_at_t(line, tt2, tx2, ty2); in LineCubicIntersection_Test()

12