HomeSort by relevance Sort by last modified time
    Searched refs:ptAtT (Results 1 - 25 of 56) sorted by null

1 2 3

  /external/chromium_org/third_party/skia/tests/
PathOpsQuadIntersectionTest.cpp 40 SkDPoint xy1 = quad1.ptAtT(tt1);
42 SkDPoint xy2 = quad2.ptAtT(tt2);
273 SkDPoint xy1 = quad1.ptAtT(tt1);
275 SkDPoint xy2 = quad2.ptAtT(tt2);
326 SkDPoint pt1 = quad1.ptAtT(tt1);
327 SkDPoint pt2 = quad2.ptAtT(tt2);
368 SkDPoint onQuad = q1.ptAtT(t);
418 t1[0] = quad1.ptAtT(t1Seed - t1Step);
419 t1[1] = quad1.ptAtT(t1Seed);
420 t1[2] = quad1.ptAtT(t1Seed + t1Step)
    [all...]
PathOpsCubicIntersectionTest.cpp 53 SkDPoint xy1 = cubic1.ptAtT(tt1);
55 SkDPoint xy2 = cubic2.ptAtT(tt2);
350 xy1 = cubic1.ptAtT(tt1);
352 xy2 = cubic2.ptAtT(tt2);
437 SkDPoint xy1 = cubic1.ptAtT(tt1);
439 SkDPoint xy2 = cubic2.ptAtT(tt2);
453 t1[0] = cubic1.ptAtT(t1Seed - t1Step);
454 t1[1] = cubic1.ptAtT(t1Seed);
455 t1[2] = cubic1.ptAtT(t1Seed + t1Step);
456 t2[0] = cubic2.ptAtT(t2Seed - t2Step)
    [all...]
PathOpsQuadLineIntersectionTest.cpp 90 SkDPoint quadXY = quad.ptAtT(quadT);
92 SkDPoint lineXY = line.ptAtT(lineT);
134 SkDPoint t1 = quad.ptAtT(tt1);
137 SkDPoint t2 = line.ptAtT(tt2);
PathOpsCubicLineIntersectionTest.cpp 141 SkDPoint xy1 = cubic.ptAtT(tt1);
143 SkDPoint xy2 = line.ptAtT(tt2);
152 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1);
153 SkDPoint sect = cubic.ptAtT(cubicT);
158 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007);
160 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007);
PathOpsQuadLineIntersectionThreadedTest.cpp 58 SkDPoint quadXY = quad.ptAtT(quadT);
60 SkDPoint lineXY = line.ptAtT(lineT);
91 SkDPoint xy = quad.ptAtT(tIndex / 4.0);
PathOpsCubicLineIntersectionIdeas.cpp 59 SkDPoint cubicAtT = cubic.ptAtT(t);
76 SkDPoint lessPt = cubic.ptAtT(t - lastStep);
85 SkDPoint morePt = cubic.ptAtT(t + lastStep);
155 SkDPoint pt = cubic.ptAtT(t);
171 SkDPoint calcPt = cubic.ptAtT(t);
262 SkDPoint calcPt = cubic.ptAtT(t);
PathOpsDLineTest.cpp 50 SkDPoint mid = line.ptAtT(.5);
  /external/skia/tests/
PathOpsQuadIntersectionTest.cpp 40 SkDPoint xy1 = quad1.ptAtT(tt1);
42 SkDPoint xy2 = quad2.ptAtT(tt2);
273 SkDPoint xy1 = quad1.ptAtT(tt1);
275 SkDPoint xy2 = quad2.ptAtT(tt2);
326 SkDPoint pt1 = quad1.ptAtT(tt1);
327 SkDPoint pt2 = quad2.ptAtT(tt2);
368 SkDPoint onQuad = q1.ptAtT(t);
418 t1[0] = quad1.ptAtT(t1Seed - t1Step);
419 t1[1] = quad1.ptAtT(t1Seed);
420 t1[2] = quad1.ptAtT(t1Seed + t1Step)
    [all...]
PathOpsCubicIntersectionTest.cpp 53 SkDPoint xy1 = cubic1.ptAtT(tt1);
55 SkDPoint xy2 = cubic2.ptAtT(tt2);
350 xy1 = cubic1.ptAtT(tt1);
352 xy2 = cubic2.ptAtT(tt2);
437 SkDPoint xy1 = cubic1.ptAtT(tt1);
439 SkDPoint xy2 = cubic2.ptAtT(tt2);
453 t1[0] = cubic1.ptAtT(t1Seed - t1Step);
454 t1[1] = cubic1.ptAtT(t1Seed);
455 t1[2] = cubic1.ptAtT(t1Seed + t1Step);
456 t2[0] = cubic2.ptAtT(t2Seed - t2Step)
    [all...]
PathOpsQuadLineIntersectionTest.cpp 90 SkDPoint quadXY = quad.ptAtT(quadT);
92 SkDPoint lineXY = line.ptAtT(lineT);
134 SkDPoint t1 = quad.ptAtT(tt1);
137 SkDPoint t2 = line.ptAtT(tt2);
PathOpsCubicLineIntersectionTest.cpp 141 SkDPoint xy1 = cubic.ptAtT(tt1);
143 SkDPoint xy2 = line.ptAtT(tt2);
152 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1);
153 SkDPoint sect = cubic.ptAtT(cubicT);
158 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007);
160 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007);
PathOpsQuadLineIntersectionThreadedTest.cpp 58 SkDPoint quadXY = quad.ptAtT(quadT);
60 SkDPoint lineXY = line.ptAtT(lineT);
91 SkDPoint xy = quad.ptAtT(tIndex / 4.0);
PathOpsCubicLineIntersectionIdeas.cpp 59 SkDPoint cubicAtT = cubic.ptAtT(t);
76 SkDPoint lessPt = cubic.ptAtT(t - lastStep);
85 SkDPoint morePt = cubic.ptAtT(t + lastStep);
155 SkDPoint pt = cubic.ptAtT(t);
171 SkDPoint calcPt = cubic.ptAtT(t);
262 SkDPoint calcPt = cubic.ptAtT(t);
  /external/chromium_org/third_party/skia/src/pathops/
SkDQuadIntersection.cpp 122 SkDPoint mid = q2.ptAtT(tMid);
140 SkDPoint pt2 = q1.ptAtT(rootTs[0][0]);
165 SkDPoint qPt = q2.ptAtT(t);
166 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]);
188 SkDPoint end = q2.ptAtT(t2s);
193 end = q2.ptAtT(t2e);
300 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
301 if (calcMask & (1 << 4)) t2[1] = quad2.ptAtT(*t2Seed);
310 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep));
311 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(SkTMin(1., *t1Seed + tStep))
    [all...]
SkDCubicLineIntersection.cpp 108 SkDPoint calcPt = c.ptAtT(roots[index]);
136 SkDPoint cPt = fCubic.ptAtT(cubicT);
150 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT);
169 SkDPoint calcPt = c.ptAtT(roots[index]);
190 pt.fX = fCubic.ptAtT(cubicT).fX;
209 SkDPoint calcPt = c.ptAtT(roots[index]);
231 pt.fY = fCubic.ptAtT(cubicT).fY;
325 SkDPoint xy = fCubic.ptAtT(t);
343 SkDPoint lPt = fLine.ptAtT(lT);
344 SkDPoint cPt = fCubic.ptAtT(cT)
    [all...]
SkPathOpsRect.cpp 29 add(quad.ptAtT(tValues[x]));
56 add(c.ptAtT(tValues[x]));
SkPathOpsCurve.h 18 return line.ptAtT(t);
24 return quad.ptAtT(t);
30 return cubic.ptAtT(t);
127 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) };
SkDQuadLineIntersection.cpp 179 SkDPoint pt = fQuad.ptAtT(quadT);
210 SkDPoint pt = fQuad.ptAtT(quadT);
303 SkDPoint xy = fQuad.ptAtT(t);
322 *pt = fLine.ptAtT(lT);
324 *pt = fQuad.ptAtT(qT);
378 fPt[index] = quad.ptAtT(fT[0][index]);
SkPathOpsLine.h 38 SkDPoint ptAtT(double t) const;
  /external/skia/src/pathops/
SkDQuadIntersection.cpp 122 SkDPoint mid = q2.ptAtT(tMid);
140 SkDPoint pt2 = q1.ptAtT(rootTs[0][0]);
165 SkDPoint qPt = q2.ptAtT(t);
166 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]);
188 SkDPoint end = q2.ptAtT(t2s);
193 end = q2.ptAtT(t2e);
300 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
301 if (calcMask & (1 << 4)) t2[1] = quad2.ptAtT(*t2Seed);
310 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep));
311 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(SkTMin(1., *t1Seed + tStep))
    [all...]
SkDCubicLineIntersection.cpp 108 SkDPoint calcPt = c.ptAtT(roots[index]);
136 SkDPoint cPt = fCubic.ptAtT(cubicT);
150 SkDPoint cubicMidPt = fCubic.ptAtT(cubicMidT);
169 SkDPoint calcPt = c.ptAtT(roots[index]);
190 pt.fX = fCubic.ptAtT(cubicT).fX;
209 SkDPoint calcPt = c.ptAtT(roots[index]);
231 pt.fY = fCubic.ptAtT(cubicT).fY;
325 SkDPoint xy = fCubic.ptAtT(t);
343 SkDPoint lPt = fLine.ptAtT(lT);
344 SkDPoint cPt = fCubic.ptAtT(cT)
    [all...]
SkPathOpsRect.cpp 29 add(quad.ptAtT(tValues[x]));
56 add(c.ptAtT(tValues[x]));
SkPathOpsCurve.h 18 return line.ptAtT(t);
24 return quad.ptAtT(t);
30 return cubic.ptAtT(t);
127 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) };
SkDQuadLineIntersection.cpp 179 SkDPoint pt = fQuad.ptAtT(quadT);
210 SkDPoint pt = fQuad.ptAtT(quadT);
303 SkDPoint xy = fQuad.ptAtT(t);
322 *pt = fLine.ptAtT(lT);
324 *pt = fQuad.ptAtT(qT);
378 fPt[index] = quad.ptAtT(fT[0][index]);
SkPathOpsLine.h 38 SkDPoint ptAtT(double t) const;

Completed in 229 milliseconds

1 2 3