HomeSort by relevance Sort by last modified time
    Searched refs:nextT (Results 1 - 14 of 14) sorted by null

  /external/skia/src/effects/gradients/
SkTwoPointConicalGradient.cpp 20 SkFixed nextT();
107 SkFixed TwoPtRadialContext::nextT() {
142 SkFixed t = rec->nextT();
159 SkFixed t = rec->nextT();
176 SkFixed t = rec->nextT();
  /external/chromium_org/third_party/skia/experimental/Intersection/
SimplifyFindTop_Test.cpp 64 double nextT = topSegment->t(index);
65 if (nextT == firstT) {
EdgeWalker.cpp     [all...]
Simplify.cpp     [all...]
  /external/chromium_org/third_party/skia/src/utils/
SkInterpolator.cpp 118 SkMSec nextT = nextTime[0].fTime;
123 *T = ComputeRelativeT(time, prevT, nextT, nextTime[-1].fBlend);
  /external/skia/experimental/Intersection/
SimplifyFindTop_Test.cpp 64 double nextT = topSegment->t(index);
65 if (nextT == firstT) {
EdgeWalker.cpp     [all...]
Simplify.cpp     [all...]
  /external/chromium_org/third_party/skia/src/effects/gradients/
SkTwoPointConicalGradient.cpp 20 SkFixed nextT();
107 SkFixed TwoPtRadialContext::nextT() {
142 SkFixed t = rec->nextT();
159 SkFixed t = rec->nextT();
176 SkFixed t = rec->nextT();
  /external/skia/src/utils/
SkInterpolator.cpp 118 SkMSec nextT = nextTime[0].fTime;
123 *T = ComputeRelativeT(time, prevT, nextT, nextTime[-1].fBlend);
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsCubic.cpp 43 double nextT = t + lastStep;
44 SkASSERT(nextT <= max);
45 SkDPoint morePt = ptAtT(nextT);
54 t = nextT;
SkOpSegment.cpp 231 double nextT = fTs[tIndex].fT;
241 // if nextT == 1, no following span
257 if (nextT < 1 && fTs[tIndex].fWindValue) {
    [all...]
  /external/skia/src/pathops/
SkPathOpsCubic.cpp 43 double nextT = t + lastStep;
44 SkASSERT(nextT <= max);
45 SkDPoint morePt = ptAtT(nextT);
54 t = nextT;
SkOpSegment.cpp 231 double nextT = fTs[tIndex].fT;
241 // if nextT == 1, no following span
257 if (nextT < 1 && fTs[tIndex].fWindValue) {
    [all...]

Completed in 391 milliseconds