HomeSort by relevance Sort by last modified time
    Searched defs:fT (Results 1 - 6 of 6) sorted by null

  /external/chromium_org/third_party/skia/src/pathops/
SkOpSpan.h 17 double fT;
18 double fOtherT; // value at fOther[fOtherIndex].fT
SkIntersections.h 24 sk_bzero(fT, sizeof(fT));
38 TArray operator[](int n) const { return TArray(fT[n]); }
42 memcpy(fT, i.fT, sizeof(fT));
105 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
273 double fT[2][9];
SkOpSegment.h 42 return count > 1 && fTs[0].fT == 0 && fTs[--count].fT == 1;
68 return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].fT);
187 return fTs[tIndex].fT;
191 return fTs[start].fT * (1 - mid) + fTs[end].fT * mid;
327 double fT;
  /external/skia/src/pathops/
SkOpSpan.h 17 double fT;
18 double fOtherT; // value at fOther[fOtherIndex].fT
SkIntersections.h 24 sk_bzero(fT, sizeof(fT));
38 TArray operator[](int n) const { return TArray(fT[n]); }
42 memcpy(fT, i.fT, sizeof(fT));
105 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
273 double fT[2][9];
SkOpSegment.h 42 return count > 1 && fTs[0].fT == 0 && fTs[--count].fT == 1;
68 return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].fT);
187 return fTs[tIndex].fT;
191 return fTs[start].fT * (1 - mid) + fTs[end].fT * mid;
327 double fT;

Completed in 183 milliseconds