| /external/chromium_org/third_party/skia/src/pathops/ |
| SkOpContour.cpp | 73 double startT = coincidence.fTs[0][0];
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
84 startT -= FLT_EPSILON;
85 SkASSERT(startT >= 0);
88 SkASSERT(!approximately_negative(endT - startT));
97 // make sure startT and endT have t entries
99 if (startT > 0 || oEndT < 1
100 || thisOne.isMissing(startT, startPt) || other.isMissing(oEndT, startPt))
[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;
|
| 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 | 325 double startT = fSegment->t(fStart);
335 if (!between(startT, testTs[index], limitT)) {
339 testTs[testCount++] = startT;
355 // OPTIMIZE: could avoid call for t == startT, endT
368 SkDCubicPair split = origCurve.chopAt(startT);
|
| 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 | 713 double startT = fTs[index].fT;
714 while (index > 0 && fTs[index - 1].fT == startT) {
[all...] |
| SkOpSegment.h | 271 bool isMissing(double startT, const SkPoint& pt) const;
|
| /external/skia/src/pathops/ |
| SkOpContour.cpp | 73 double startT = coincidence.fTs[0][0];
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
84 startT -= FLT_EPSILON;
85 SkASSERT(startT >= 0);
88 SkASSERT(!approximately_negative(endT - startT));
97 // make sure startT and endT have t entries
99 if (startT > 0 || oEndT < 1
100 || thisOne.isMissing(startT, startPt) || other.isMissing(oEndT, startPt))
[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;
|
| 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 | 325 double startT = fSegment->t(fStart);
335 if (!between(startT, testTs[index], limitT)) {
339 testTs[testCount++] = startT;
355 // OPTIMIZE: could avoid call for t == startT, endT
368 SkDCubicPair split = origCurve.chopAt(startT);
|
| 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 | 713 double startT = fTs[index].fT;
714 while (index > 0 && fTs[index - 1].fT == startT) {
[all...] |
| SkOpSegment.h | 271 bool isMissing(double startT, const SkPoint& pt) const;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkPathMeasure.cpp | 276 SkScalar startT, SkScalar stopT, SkPath* dst) {
277 SkASSERT(startT >= 0 && startT <= SK_Scalar1);
279 SkASSERT(startT <= stopT);
281 if (startT == stopT) {
297 if (0 == startT) {
305 SkChopQuadAt(pts, tmp0, startT);
309 SkChopQuadAt(&tmp0[2], tmp1, SkScalarDiv(stopT - startT,
310 SK_Scalar1 - startT));
316 if (0 == startT) {
[all...] |
| /external/skia/src/core/ |
| SkPathMeasure.cpp | 276 SkScalar startT, SkScalar stopT, SkPath* dst) {
277 SkASSERT(startT >= 0 && startT <= SK_Scalar1);
279 SkASSERT(startT <= stopT);
281 if (startT == stopT) {
297 if (0 == startT) {
305 SkChopQuadAt(pts, tmp0, startT);
309 SkChopQuadAt(&tmp0[2], tmp1, SkScalarDiv(stopT - startT,
310 SK_Scalar1 - startT));
316 if (0 == startT) {
[all...] |
| /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)
183 double startValue = curveIntegralAt(curve, startT);
188 double ScrollAnimatorNone::PerAxisData::releaseArea(Curve curve, double startT, double endT)
191 double endValue = curveIntegralAt(curve, 1 - startT);
|
| /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...] |
