OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:fT
(Results
1 - 10
of
10
) sorted by null
/external/chromium_org/third_party/skia/experimental/Intersection/
Intersections.h
21
bzero(
fT
, sizeof(
fT
));
50
double val =
fT
[fSwap][index];
53
fT
[fSwap][index] = val;
98
SkTSwap(
fT
[0][index],
fT
[1][index]);
129
double
fT
[2][9];
Simplify.cpp
658
double
fT
;
659
double fOtherT; // value at fOther[fOtherIndex].
fT
794
(*SegmentXYAtT2[fVerb])(fPts, i.
fT
[0][index], &loc);
803
(*SegmentXYAtT2[rh.fVerb])(rh.fPts, ri.
fT
[0][index], &loc);
869
double startT = (*fSpans)[fStart].
fT
;
870
double endT = (*fSpans)[fEnd].
fT
;
917
if (thisSpan.fTiny || precisely_equal(thisSpan.
fT
, nextSpan.
fT
)) {
924
(*SegmentXYAtT[fVerb])(fPts, thisSpan.
fT
, &iPt);
925
(*SegmentXYAtT[fVerb])(fPts, nextSpan.
fT
, &ePt)
[
all
...]
/external/chromium_org/third_party/skia/src/pathops/
SkOpSpan.h
17
double
fT
;
18
double fOtherT; // value at fOther[fOtherIndex].
fT
SkIntersections.h
25
sk_bzero(
fT
, sizeof(
fT
));
40
TArray operator[](int n) const { return TArray(
fT
[n]); }
97
return fUsed > 0 && (t == 0 ?
fT
[0][0] == 0 :
fT
[0][fUsed - 1] == 1);
188
fT
[(int) swap][tIndex] = t;
278
double
fT
[2][9];
SkOpSegment.h
38
double
fT
;
57
return count > 1 && fTs[0].
fT
== 0 && fTs[--count].
fT
== 1;
82
return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].
fT
);
222
return fTs[tIndex].
fT
;
226
return fTs[start].
fT
* (1 - mid) + fTs[end].
fT
* mid;
386
double
fT
;
468
bool multipleEnds() const { return fTs[count() - 2].
fT
== 1; }
469
bool multipleStarts() const { return fTs[1].
fT
== 0;
[
all
...]
/external/skia/experimental/Intersection/
Intersections.h
21
bzero(
fT
, sizeof(
fT
));
50
double val =
fT
[fSwap][index];
53
fT
[fSwap][index] = val;
98
SkTSwap(
fT
[0][index],
fT
[1][index]);
129
double
fT
[2][9];
Simplify.cpp
658
double
fT
;
659
double fOtherT; // value at fOther[fOtherIndex].
fT
794
(*SegmentXYAtT2[fVerb])(fPts, i.
fT
[0][index], &loc);
803
(*SegmentXYAtT2[rh.fVerb])(rh.fPts, ri.
fT
[0][index], &loc);
869
double startT = (*fSpans)[fStart].
fT
;
870
double endT = (*fSpans)[fEnd].
fT
;
917
if (thisSpan.fTiny || precisely_equal(thisSpan.
fT
, nextSpan.
fT
)) {
924
(*SegmentXYAtT[fVerb])(fPts, thisSpan.
fT
, &iPt);
925
(*SegmentXYAtT[fVerb])(fPts, nextSpan.
fT
, &ePt)
[
all
...]
/external/skia/src/pathops/
SkOpSpan.h
17
double
fT
;
18
double fOtherT; // value at fOther[fOtherIndex].
fT
SkIntersections.h
25
sk_bzero(
fT
, sizeof(
fT
));
40
TArray operator[](int n) const { return TArray(
fT
[n]); }
97
return fUsed > 0 && (t == 0 ?
fT
[0][0] == 0 :
fT
[0][fUsed - 1] == 1);
188
fT
[(int) swap][tIndex] = t;
278
double
fT
[2][9];
SkOpSegment.h
38
double
fT
;
57
return count > 1 && fTs[0].
fT
== 0 && fTs[--count].
fT
== 1;
82
return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].
fT
);
220
return fTs[tIndex].
fT
;
224
return fTs[start].
fT
* (1 - mid) + fTs[end].
fT
* mid;
384
double
fT
;
466
bool multipleEnds() const { return fTs[count() - 2].
fT
== 1; }
467
bool multipleStarts() const { return fTs[1].
fT
== 0;
[
all
...]
Completed in 459 milliseconds