| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsDebug.cpp | 297 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT);
305 for (int i = 0; i < fTs.count(); ++i) {
306 if (fTs[i].fT == t && fTs[i].fOther == &other && fTs[i].fOtherT == otherT) {
316 const SkPoint& basePt = fTs[tStart].fPt;
318 const SkPoint& cmpPt = fTs[tStart].fPt;
329 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT)
[all...] |
| SkOpSegment.cpp | 46 double referenceT = fTs[index].fT;
49 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) {
58 if (++index == fTs.count()) {
61 if (fTs[index - 1].fTiny) {
62 referenceT = fTs[index].fT;
65 } while (precisely_negative(fTs[index].fT - referenceT));
73 const SkOpSpan& upSpan = fTs[index];
92 const SkOpSpan& downSpan = fTs[prev];
113 const SkOpSpan* span = &fTs[index]
[all...] |
| SkOpSegment.h | 56 int count = fTs.count();
57 return count > 1 && fTs[0].fT == 0 && fTs[--count].fT == 1;
61 return fTs.count();
65 SkASSERT(fDoneSpans <= fTs.count());
66 return fDoneSpans == fTs.count();
70 return fTs[min].fDone;
82 return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].fT);
102 return fTs.count() > 0;
106 return fTs[tIndex].fWindValue == 0 && fTs[tIndex].fOppValue == 0
[all...] |
| SkOpContour.cpp | 27 coincidence.fTs[swap][0] = ts[0][0];
28 coincidence.fTs[swap][1] = ts[0][1];
29 coincidence.fTs[!swap][0] = ts[1][0];
30 coincidence.fTs[!swap][1] = ts[1][1];
79 double startT = coincidence.fTs[0][0];
80 double endT = coincidence.fTs[0][1];
95 double oStartT = coincidence.fTs[1][0];
96 double oEndT = coincidence.fTs[1][1];
177 coincidence.fTs[swap][0] = ts[0][ptIndex];
178 coincidence.fTs[swap][1] = ts[0][ptIndex + 1]
[all...] |
| SkOpContour.h | 24 double fTs[2][2];
|
| /external/skia/src/pathops/ |
| SkPathOpsDebug.cpp | 297 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT);
305 for (int i = 0; i < fTs.count(); ++i) {
306 if (fTs[i].fT == t && fTs[i].fOther == &other && fTs[i].fOtherT == otherT) {
316 const SkPoint& basePt = fTs[tStart].fPt;
318 const SkPoint& cmpPt = fTs[tStart].fPt;
329 SkDCubic dst = SkDCubic::SubDivide(fPts, fTs[tStart].fT, fTs[tEnd].fT)
[all...] |
| SkOpSegment.cpp | 46 double referenceT = fTs[index].fT;
49 && (precisely_negative(referenceT - fTs[lesser].fT) || fTs[lesser].fTiny)) {
58 if (++index == fTs.count()) {
61 if (fTs[index - 1].fTiny) {
62 referenceT = fTs[index].fT;
65 } while (precisely_negative(fTs[index].fT - referenceT));
73 const SkOpSpan& upSpan = fTs[index];
92 const SkOpSpan& downSpan = fTs[prev];
113 const SkOpSpan* span = &fTs[index]
[all...] |
| SkOpSegment.h | 56 int count = fTs.count();
57 return count > 1 && fTs[0].fT == 0 && fTs[--count].fT == 1;
61 return fTs.count();
65 SkASSERT(fDoneSpans <= fTs.count());
66 return fDoneSpans == fTs.count();
70 return fTs[min].fDone;
82 return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].fT);
102 return fTs.count() > 0;
106 return fTs[tIndex].fWindValue == 0 && fTs[tIndex].fOppValue == 0
[all...] |
| SkOpContour.cpp | 27 coincidence.fTs[swap][0] = ts[0][0];
28 coincidence.fTs[swap][1] = ts[0][1];
29 coincidence.fTs[!swap][0] = ts[1][0];
30 coincidence.fTs[!swap][1] = ts[1][1];
79 double startT = coincidence.fTs[0][0];
80 double endT = coincidence.fTs[0][1];
95 double oStartT = coincidence.fTs[1][0];
96 double oEndT = coincidence.fTs[1][1];
177 coincidence.fTs[swap][0] = ts[0][ptIndex];
178 coincidence.fTs[swap][1] = ts[0][ptIndex + 1]
[all...] |
| SkOpContour.h | 24 double fTs[2][2];
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| Simplify.cpp | [all...] |
| thingsToDo.txt | 182 const Span& span = segment->fTs[min];
194 const Span& minSpan = segment->fTs[min];
199 int spanCount = segment->fTs.count();
201 const Span& span = segment->fTs[index];
212 const Span& span = segment->fTs[index];
231 if (current->segment()->fTs[curMin].fDone) {
235 if (next->segment()->fTs[nextMin].fDone) {
244 double fromT = fTs[from].fT;
245 int count = fTs.count();
248 const Span& span = fTs[to]
[all...] |
| EdgeWalker.cpp | 759 fTs = src.fTs;
770 if (tIndex > fTs.count()) {
773 return fTs[tIndex - 1];
780 for (int i = 0; i < fTs.count(); ++i) {
784 LineXYAtT(pts, fTs[i], &out);
787 QuadXYAtT(pts, fTs[i], &out);
790 CubicXYAtT(pts, fTs[i], &out);
795 SkDebugf("%*s.fTs[%d]=%1.9g (%1.9g,%1.9g)\n", tab + sizeof(className),
796 className, i, fTs[i], out.fX, out.fY)
[all...] |
| /external/skia/experimental/Intersection/ |
| Simplify.cpp | [all...] |
| thingsToDo.txt | 182 const Span& span = segment->fTs[min];
194 const Span& minSpan = segment->fTs[min];
199 int spanCount = segment->fTs.count();
201 const Span& span = segment->fTs[index];
212 const Span& span = segment->fTs[index];
231 if (current->segment()->fTs[curMin].fDone) {
235 if (next->segment()->fTs[nextMin].fDone) {
244 double fromT = fTs[from].fT;
245 int count = fTs.count();
248 const Span& span = fTs[to]
[all...] |
| EdgeWalker.cpp | 759 fTs = src.fTs;
770 if (tIndex > fTs.count()) {
773 return fTs[tIndex - 1];
780 for (int i = 0; i < fTs.count(); ++i) {
784 LineXYAtT(pts, fTs[i], &out);
787 QuadXYAtT(pts, fTs[i], &out);
790 CubicXYAtT(pts, fTs[i], &out);
795 SkDebugf("%*s.fTs[%d]=%1.9g (%1.9g,%1.9g)\n", tab + sizeof(className),
796 className, i, fTs[i], out.fX, out.fY)
[all...] |
| /external/chromium_org/third_party/skia/tests/ |
| PathOpsDebug.cpp | 166 SkDebugf(" seg1t=%1.9g seg2t=%1.9g\n", coin.fTs[0][index], coin.fTs[1][index]);
312 return fTs;
320 const SkOpAngle* fAngle = fTs[index].fFromAngle;
321 const SkOpAngle* tAngle = fTs[index].fToAngle;
|
| /external/skia/tests/ |
| PathOpsDebug.cpp | 166 SkDebugf(" seg1t=%1.9g seg2t=%1.9g\n", coin.fTs[0][index], coin.fTs[1][index]);
312 return fTs;
320 const SkOpAngle* fAngle = fTs[index].fFromAngle;
321 const SkOpAngle* tAngle = fTs[index].fToAngle;
|
