/external/skia/src/pathops/ |
H A D | SkPathOpsCommon.cpp | 77 double endT = current->t(endIndex); local 78 double newMid = (testHit - baseT) / (endT - baseT); 88 baseT + mid * (endT - baseT), midXY.fX, midXY.fY, 89 baseT + newMid * (endT - baseT), newXY.fX, newXY.fY, 90 endT, current->xAtT(endIndex), current->yAtT(endIndex)); 119 double endT = current->t(endIndex); local 120 *bestHit = baseT + mid * (endT - baseT);
|
H A D | SkPathOpsQuad.cpp | 50 SkDPoint SkDQuad::top(double startT, double endT) const { 51 SkDQuad sub = subDivide(startT, endT); 59 extremeT = startT + (endT - startT) * extremeT;
|
H A D | SkOpSegment.cpp | 1241 void SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT, 1307 if (endPt == *testPt || precisely_equal(endT, testT)) { 1313 if (endPt != *testPt && !precisely_equal(endT, testT)) { 2594 int oEnd, int step, SkPoint* startPt, SkPoint* endPt, double* endT) const { 2641 *endT = endSpan.fT; 2660 double endT = span->fT; 2663 } while (SkDPoint::ApproximatelyEqual(span->fPt, lastPt) && (span->fT == endT || span->fTiny)); 3345 double endT; 3346 if (findCoincidentMatch(test, other, otherTIndex, next, step, &startPt, &endPt, &endT)) { 3351 match->addTCoincident(startPt, endPt, endT, othe [all...] |
H A D | SkOpSegment.h | 285 void addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT, 313 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
|
H A D | SkPathOpsCubic.cpp | 371 SkDPoint SkDCubic::top(double startT, double endT) const { 372 SkDCubic sub = subDivide(startT, endT); 381 double t = startT + (endT - startT) * extremeTs[index];
|
H A D | SkOpAngle.cpp | 1018 double endT = fSegment->t(fEnd); local 1019 double limitT = endT; 1027 testTs[testCount++] = endT; 1042 // OPTIMIZE: could avoid call for t == startT, endT
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsQuad.cpp | 50 SkDPoint SkDQuad::top(double startT, double endT) const { 51 SkDQuad sub = subDivide(startT, endT); 59 extremeT = startT + (endT - startT) * extremeT;
|
H A D | SkOpSegment.cpp | 1274 bool SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT, 1344 if (endPt == *testPt || precisely_equal(endT, testT)) { 1350 if (endPt != *testPt && !precisely_equal(endT, testT)) { 2671 int oEnd, int step, SkPoint* startPt, SkPoint* endPt, double* endT) const { 2718 *endT = endSpan.fT; 2737 double endT = span->fT; 2740 } while (SkDPoint::ApproximatelyEqual(span->fPt, lastPt) && (span->fT == endT || span->fTiny)); 3429 double endT; 3430 if (findCoincidentMatch(test, other, otherTIndex, next, step, &startPt, &endPt, &endT)) { 3435 SkAssertResult(match->addTCoincident(startPt, endPt, endT, othe [all...] |
H A D | SkOpSegment.h | 287 bool addTCoincident(const SkPoint& startPt, const SkPoint& endPt, double endT, 315 int step, SkPoint* startPt, SkPoint* endPt, double* endT) const;
|
H A D | SkPathOpsCubic.cpp | 371 SkDPoint SkDCubic::top(double startT, double endT) const { 372 SkDCubic sub = subDivide(startT, endT); 381 double t = startT + (endT - startT) * extremeTs[index];
|
H A D | SkOpAngle.cpp | 1022 double endT = fSegment->t(fEnd); 1023 double limitT = endT; 1031 testTs[testCount++] = endT; 1046 // OPTIMIZE: could avoid call for t == startT, endT
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicUtilities.cpp | 380 _Point top(const Cubic& cubic, double startT, double endT) { argument 382 sub_divide(cubic, startT, endT, sub); 392 double t = startT + (endT - startT) * extremeTs[index];
|
H A D | EdgeWalker.cpp | 170 static void LineSubDivide(const SkPoint a[2], double startT, double endT, argument 174 sub_divide(aLine, startT, endT, dst); 181 static void QuadSubDivide(const SkPoint a[3], double startT, double endT, argument 186 sub_divide(aQuad, startT, endT, dst); 195 static void CubicSubDivide(const SkPoint a[4], double startT, double endT, argument 200 sub_divide(aCubic, startT, endT, dst); 211 static void QuadSubBounds(const SkPoint a[3], double startT, double endT, argument 214 QuadSubDivide(a, startT, endT, dst); 222 static void CubicSubBounds(const SkPoint a[4], double startT, double endT, argument 225 CubicSubDivide(a, startT, endT, ds [all...] |
/external/skia/experimental/Intersection/ |
H A D | CubicUtilities.cpp | 380 _Point top(const Cubic& cubic, double startT, double endT) { argument 382 sub_divide(cubic, startT, endT, sub); 392 double t = startT + (endT - startT) * extremeTs[index];
|
H A D | EdgeWalker.cpp | 170 static void LineSubDivide(const SkPoint a[2], double startT, double endT, argument 174 sub_divide(aLine, startT, endT, dst); 181 static void QuadSubDivide(const SkPoint a[3], double startT, double endT, argument 186 sub_divide(aQuad, startT, endT, dst); 195 static void CubicSubDivide(const SkPoint a[4], double startT, double endT, argument 200 sub_divide(aCubic, startT, endT, dst); 211 static void QuadSubBounds(const SkPoint a[3], double startT, double endT, argument 214 QuadSubDivide(a, startT, endT, dst); 222 static void CubicSubBounds(const SkPoint a[4], double startT, double endT, argument 225 CubicSubDivide(a, startT, endT, ds [all...] |
/external/chromium_org/third_party/WebKit/Source/web/tests/ |
H A D | ScrollAnimatorNoneTest.cpp | 229 double attackArea(ScrollAnimatorNone::Curve, double startT, double endT); 230 double releaseArea(ScrollAnimatorNone::Curve, double startT, double endT); 328 double ScrollAnimatorNoneTest::attackArea(ScrollAnimatorNone::Curve curve, double startT, double endT) argument 330 return ScrollAnimatorNone::PerAxisData::attackArea(curve, startT, endT); 333 double ScrollAnimatorNoneTest::releaseArea(ScrollAnimatorNone::Curve curve, double startT, double endT) argument 335 return ScrollAnimatorNone::PerAxisData::releaseArea(curve, startT, endT);
|