| /external/chromium_org/third_party/skia/src/pathops/ |
| SkIntersections.cpp | 53 fT[1][index] = 1 - fT[1][index];
58 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) {
62 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
65 double oldOne = fT[0][index];
66 double oldTwo = fT[1][index];
75 fT[0][index] = one;
76 fT[1][index] = two
[all...] |
| SkOpSpan.h | 17 double fT;
18 double fOtherT; // value at fOther[fOtherIndex].fT
|
| SkPathOpsSpan.h | 17 double fT;
18 double fOtherT; // value at fOther[fOtherIndex].fT
|
| SkDLineIntersection.cpp | 30 fPt[0] = line.ptAtT(fT[0][0]);
32 fPt[1] = line.ptAtT(fT[0][1]);
57 fT[0][0] = numerA;
58 fT[1][0] = numerB;
71 fT[0][0] = fT[1][0] = 0;
72 fT[1][0] = fT[1][1] = 1;
117 fT[0][0] = numerA / denom;
118 fT[1][0] = numerB / denom
[all...] |
| SkOpSegment.cpp | 126 if (approximately_negative(span.fT - lastT)) {
138 SkPoint curveTop = (*CurveTop[SkPathOpsVerbToPoints(fVerb)])(fPts, lastT, span.fT);
147 lastT = span.fT;
220 aSeg->fTs[aStart].fT);
223 aSeg->fTs[aStart].fT, newPt.fX, newPt.fY, angle0Pt.fX, angle0Pt.fY);
239 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount);
243 } while (!approximately_negative(oStart - other->fTs[oIndex].fT) && oIndex < oCount);
247 nextT = fTs[++tIndex].fT;
251 oNextT = other->fTs[++oIndex].fT;
266 fTs[tIndexStart].fT, xyAtT(tIndexStart).fX
[all...] |
| SkIntersections.h | 24 sk_bzero(fT, sizeof(fT));
37 TArray operator[](int n) const { return TArray(fT[n]); }
41 memcpy(fT, i.fT, sizeof(fT));
97 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
247 double fT[2][9];
|
| SkDCubicIntersection.cpp | 450 double tRange1 = fT[0][last] - fT[0][0];
451 double tRange2 = fT[1][last] - fT[1][0];
453 double testT1 = fT[0][0] + tRange1 * index / 5;
454 double testT2 = fT[1][0] + tRange2 * index / 5;
463 fT[0][1] = fT[0][last];
464 fT[1][1] = fT[1][last]
[all...] |
| SkOpSegment.h | 42 return count > 1 && fTs[0].fT == 0 && fTs[--count].fT == 1;
63 return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].fT);
183 return fTs[tIndex].fT;
187 return fTs[start].fT * (1 - mid) + fTs[end].fT * mid;
|
| SkDCubicLineIntersection.cpp | 322 fUsed = c.intersectRay(fT[0]);
324 fPt[index] = cubic.ptAtT(fT[0][index]);
|
| SkDQuadLineIntersection.cpp | 23 y = d(1 - t)^2 + e(1 - t)t + ft^2
30 y = d(1-t)^2 + 2e(1-t)t + ft^2
397 fUsed = q.intersectRay(fT[0]);
399 fPt[index] = quad.ptAtT(fT[0][index]);
|
| SkOpAngle.cpp | 401 if (thisSpan.fTiny || precisely_equal(thisSpan.fT, nextSpan.fT)) {
|
| /external/skia/src/pathops/ |
| SkIntersections.cpp | 53 fT[1][index] = 1 - fT[1][index];
58 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) {
62 SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);
65 double oldOne = fT[0][index];
66 double oldTwo = fT[1][index];
75 fT[0][index] = one;
76 fT[1][index] = two
[all...] |
| SkOpSpan.h | 17 double fT;
18 double fOtherT; // value at fOther[fOtherIndex].fT
|
| SkPathOpsSpan.h | 17 double fT;
18 double fOtherT; // value at fOther[fOtherIndex].fT
|
| SkDLineIntersection.cpp | 30 fPt[0] = line.ptAtT(fT[0][0]);
32 fPt[1] = line.ptAtT(fT[0][1]);
57 fT[0][0] = numerA;
58 fT[1][0] = numerB;
71 fT[0][0] = fT[1][0] = 0;
72 fT[1][0] = fT[1][1] = 1;
117 fT[0][0] = numerA / denom;
118 fT[1][0] = numerB / denom
[all...] |
| SkOpSegment.cpp | 126 if (approximately_negative(span.fT - lastT)) {
138 SkPoint curveTop = (*CurveTop[SkPathOpsVerbToPoints(fVerb)])(fPts, lastT, span.fT);
147 lastT = span.fT;
220 aSeg->fTs[aStart].fT);
223 aSeg->fTs[aStart].fT, newPt.fX, newPt.fY, angle0Pt.fX, angle0Pt.fY);
239 } while (!approximately_negative(tStart - fTs[tIndex].fT) && tIndex < tCount);
243 } while (!approximately_negative(oStart - other->fTs[oIndex].fT) && oIndex < oCount);
247 nextT = fTs[++tIndex].fT;
251 oNextT = other->fTs[++oIndex].fT;
266 fTs[tIndexStart].fT, xyAtT(tIndexStart).fX
[all...] |
| SkIntersections.h | 24 sk_bzero(fT, sizeof(fT));
37 TArray operator[](int n) const { return TArray(fT[n]); }
41 memcpy(fT, i.fT, sizeof(fT));
97 return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
247 double fT[2][9];
|
| SkDCubicIntersection.cpp | 450 double tRange1 = fT[0][last] - fT[0][0];
451 double tRange2 = fT[1][last] - fT[1][0];
453 double testT1 = fT[0][0] + tRange1 * index / 5;
454 double testT2 = fT[1][0] + tRange2 * index / 5;
463 fT[0][1] = fT[0][last];
464 fT[1][1] = fT[1][last]
[all...] |
| SkOpSegment.h | 42 return count > 1 && fTs[0].fT == 0 && fTs[--count].fT == 1;
63 return (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, fTs[index].fT);
183 return fTs[tIndex].fT;
187 return fTs[start].fT * (1 - mid) + fTs[end].fT * mid;
|
| SkDCubicLineIntersection.cpp | 322 fUsed = c.intersectRay(fT[0]);
324 fPt[index] = cubic.ptAtT(fT[0][index]);
|
| SkDQuadLineIntersection.cpp | 23 y = d(1 - t)^2 + e(1 - t)t + ft^2
30 y = d(1-t)^2 + 2e(1-t)t + ft^2
397 fUsed = q.intersectRay(fT[0]);
399 fPt[index] = quad.ptAtT(fT[0][index]);
|
| SkOpAngle.cpp | 401 if (thisSpan.fTiny || precisely_equal(thisSpan.fT, nextSpan.fT)) {
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| string-unpack-code.js | [all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| string-unpack-code.js | [all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
| string-unpack-code.js | [all...] |
