| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpContour.cpp | 74 double endT = coincidence.fTs[0][1];
76 if ((cancelers = startSwapped = startT > endT)) {
77 SkTSwap(startT, endT);
79 if (startT == endT) { // if one is very large the smaller may have collapsed to nothing
80 if (endT <= 1 - FLT_EPSILON) {
81 endT += FLT_EPSILON;
82 SkASSERT(endT <= 1);
88 SkASSERT(!approximately_negative(endT - startT));
97 // make sure startT and endT have t entries
104 if (oStartT > 0 || endT <
[all...] |
| SkPathOpsCurve.h | 102 static SkPoint quad_top(const SkPoint a[3], double startT, double endT) {
105 SkDPoint topPt = quad.top(startT, endT);
109 static SkPoint cubic_top(const SkPoint a[4], double startT, double endT) {
112 SkDPoint topPt = cubic.top(startT, endT);
123 static bool line_is_vertical(const SkPoint a[2], double startT, double endT) {
126 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) };
130 static bool quad_is_vertical(const SkPoint a[3], double startT, double endT) {
133 SkDQuad dst = quad.subDivide(startT, endT);
137 static bool cubic_is_vertical(const SkPoint a[4], double startT, double endT) {
140 SkDCubic dst = cubic.subDivide(startT, endT);
[all...] |
| SkPathOpsQuad.h | 63 SkDPoint top(double startT, double endT) const;
|
| SkPathOpsCubic.h | 77 SkDPoint top(double startT, double endT) const;
|
| SkPathOpsCommon.cpp | 54 double endT = current->t(endIndex);
55 double newMid = (testHit - baseT) / (endT - baseT);
65 baseT + mid * (endT - baseT), midXY.fX, midXY.fY,
66 baseT + newMid * (endT - baseT), newXY.fX, newXY.fY,
67 endT, current->xAtT(endIndex), current->yAtT(endIndex));
96 double endT = current->t(endIndex);
97 *bestHit = baseT + mid * (endT - baseT);
|
| SkPathOpsQuad.cpp | 50 SkDPoint SkDQuad::top(double startT, double endT) const {
51 SkDQuad sub = subDivide(startT, endT);
59 extremeT = startT + (endT - startT) * extremeT;
|
| SkOpAngle.cpp | 331 double endT = fSegment->t(fEnd);
332 double limitT = endT;
340 testTs[testCount++] = endT;
355 // OPTIMIZE: could avoid call for t == startT, endT
|
| SkPathOpsCubic.cpp | 296 SkDPoint SkDCubic::top(double startT, double endT) const {
297 SkDCubic sub = subDivide(startT, endT);
306 double t = startT + (endT - startT) * extremeTs[index];
|
| SkOpSegment.cpp | 705 void SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
771 if (endPt == *testPt || endT == testT) {
778 if (endPt != *testPt && endT != testT) { // in rare cases, one may have ended before the other
[all...] |
| SkOpSegment.h | 246 void addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
258 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
|
| /external/skia/src/pathops/ |
| SkOpContour.cpp | 74 double endT = coincidence.fTs[0][1];
76 if ((cancelers = startSwapped = startT > endT)) {
77 SkTSwap(startT, endT);
79 if (startT == endT) { // if one is very large the smaller may have collapsed to nothing
80 if (endT <= 1 - FLT_EPSILON) {
81 endT += FLT_EPSILON;
82 SkASSERT(endT <= 1);
88 SkASSERT(!approximately_negative(endT - startT));
97 // make sure startT and endT have t entries
104 if (oStartT > 0 || endT <
[all...] |
| SkPathOpsCurve.h | 102 static SkPoint quad_top(const SkPoint a[3], double startT, double endT) {
105 SkDPoint topPt = quad.top(startT, endT);
109 static SkPoint cubic_top(const SkPoint a[4], double startT, double endT) {
112 SkDPoint topPt = cubic.top(startT, endT);
123 static bool line_is_vertical(const SkPoint a[2], double startT, double endT) {
126 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) };
130 static bool quad_is_vertical(const SkPoint a[3], double startT, double endT) {
133 SkDQuad dst = quad.subDivide(startT, endT);
137 static bool cubic_is_vertical(const SkPoint a[4], double startT, double endT) {
140 SkDCubic dst = cubic.subDivide(startT, endT);
[all...] |
| SkPathOpsQuad.h | 63 SkDPoint top(double startT, double endT) const;
|
| SkPathOpsCubic.h | 77 SkDPoint top(double startT, double endT) const;
|
| SkPathOpsCommon.cpp | 54 double endT = current->t(endIndex);
55 double newMid = (testHit - baseT) / (endT - baseT);
65 baseT + mid * (endT - baseT), midXY.fX, midXY.fY,
66 baseT + newMid * (endT - baseT), newXY.fX, newXY.fY,
67 endT, current->xAtT(endIndex), current->yAtT(endIndex));
96 double endT = current->t(endIndex);
97 *bestHit = baseT + mid * (endT - baseT);
|
| SkPathOpsQuad.cpp | 50 SkDPoint SkDQuad::top(double startT, double endT) const {
51 SkDQuad sub = subDivide(startT, endT);
59 extremeT = startT + (endT - startT) * extremeT;
|
| SkOpAngle.cpp | 331 double endT = fSegment->t(fEnd);
332 double limitT = endT;
340 testTs[testCount++] = endT;
355 // OPTIMIZE: could avoid call for t == startT, endT
|
| SkPathOpsCubic.cpp | 296 SkDPoint SkDCubic::top(double startT, double endT) const {
297 SkDCubic sub = subDivide(startT, endT);
306 double t = startT + (endT - startT) * extremeTs[index];
|
| SkOpSegment.cpp | 705 void SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
771 if (endPt == *testPt || endT == testT) {
778 if (endPt != *testPt && endT != testT) { // in rare cases, one may have ended before the other
[all...] |
| SkOpSegment.h | 246 void addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT,
258 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
|
| /external/chromium_org/third_party/WebKit/Source/platform/scroll/ |
| ScrollAnimatorNone.h | 111 static double attackArea(Curve, double startT, double endT);
112 static double releaseArea(Curve, double startT, double endT);
|
| ScrollAnimatorNone.cpp | 181 double ScrollAnimatorNone::PerAxisData::attackArea(Curve curve, double startT, double endT)
184 double endValue = curveIntegralAt(curve, endT);
188 double ScrollAnimatorNone::PerAxisData::releaseArea(Curve curve, double startT, double endT)
190 double startValue = curveIntegralAt(curve, 1 - endT);
|
| /external/chromium_org/third_party/WebKit/Source/web/tests/ |
| ScrollAnimatorNoneTest.cpp | 227 double attackArea(ScrollAnimatorNone::Curve, double startT, double endT);
228 double releaseArea(ScrollAnimatorNone::Curve, double startT, double endT);
325 double ScrollAnimatorNoneTest::attackArea(ScrollAnimatorNone::Curve curve, double startT, double endT)
327 return ScrollAnimatorNone::PerAxisData::attackArea(curve, startT, endT);
330 double ScrollAnimatorNoneTest::releaseArea(ScrollAnimatorNone::Curve curve, double startT, double endT)
332 return ScrollAnimatorNone::PerAxisData::releaseArea(curve, startT, endT);
[all...] |
