/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDCubicToQuads.cpp | 107 double newT = start + (index / parts) * (end - start); local 108 if (newT > 0 && newT < 1) { 109 ts->push_back(newT);
|
H A D | SkIntersectionHelper.h | 45 int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) { argument 46 return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT); 49 int addSelfT(const SkPoint& pt, double newT) { argument 50 return fContour->addSelfT(fIndex, pt, newT);
|
H A D | SkOpContour.h | 80 int addT(int segIndex, SkOpContour* other, int otherIndex, const SkPoint& pt, double newT) { argument 82 return fSegments[segIndex].addT(&other->fSegments[otherIndex], pt, newT); 85 int addSelfT(int segIndex, const SkPoint& pt, double newT) { argument 87 return fSegments[segIndex].addSelfT(pt, newT);
|
H A D | SkPathOpsCubic.cpp | 158 double newT = binarySearch(min, max, axisIntercept, xAxis); local 159 if (newT >= 0) { 160 validRoots[validCount++] = newT;
|
H A D | SkOpSegment.cpp | 552 int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) { argument 555 SkASSERT(SkDPoint::RoughlyEqual(ptAtT(newT), pt)); 559 SkASSERT(newT == 0 || !precisely_zero(newT)); 560 SkASSERT(newT == 1 || !precisely_equal(newT, 1)); 573 if (newT < span.fT) { 577 if (newT == span.fT) { 582 if ((pt == firstPt && newT == 0) || (span.fPt == lastPt && newT 812 addSelfT(const SkPoint& pt, double newT) argument 973 alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other, double otherT, const SkOpSegment* other2, SkOpSpan* oSpan, SkTDArray<AlignedSpan>* alignedArray) argument [all...] |
/external/skia/src/pathops/ |
H A D | SkDCubicToQuads.cpp | 107 double newT = start + (index / parts) * (end - start); local 108 if (newT > 0 && newT < 1) { 109 ts->push_back(newT);
|
H A D | SkIntersectionHelper.h | 45 int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) { argument 46 return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT); 49 int addSelfT(const SkPoint& pt, double newT) { argument 50 return fContour->addSelfT(fIndex, pt, newT);
|
H A D | SkOpContour.h | 80 int addT(int segIndex, SkOpContour* other, int otherIndex, const SkPoint& pt, double newT) { argument 82 return fSegments[segIndex].addT(&other->fSegments[otherIndex], pt, newT); 85 int addSelfT(int segIndex, const SkPoint& pt, double newT) { argument 87 return fSegments[segIndex].addSelfT(pt, newT);
|
H A D | SkOpSegment.cpp | 548 int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) { argument 551 SkASSERT(SkDPoint::RoughlyEqual(ptAtT(newT), pt)); 555 SkASSERT(newT == 0 || !precisely_zero(newT)); 556 SkASSERT(newT == 1 || !precisely_equal(newT, 1)); 569 if (newT < span.fT) { 573 if (newT == span.fT) { 578 if ((pt == firstPt && newT == 0) || (span.fPt == lastPt && newT 804 addSelfT(const SkPoint& pt, double newT) argument 940 alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other, double otherT, const SkOpSegment* other2, SkOpSpan* oSpan, SkTDArray<AlignedSpan>* alignedArray) argument [all...] |
H A D | SkPathOpsCubic.cpp | 158 double newT = binarySearch(min, max, axisIntercept, xAxis); local 159 if (newT >= 0) { 160 validRoots[validCount++] = newT;
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkTArray.h | 181 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); 182 SkNEW_PLACEMENT(newT, T); 183 return *newT; 190 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); local 191 SkNEW_PLACEMENT_ARGS(newT, T, (t)); 192 return *newT;
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicLineIntersectionIdeas.cpp | 219 double newT = binary_search(cubic, step, pt, t, &iters); local 220 if (newT >= 0) { 221 diff = fabs(t - newT); 265 double newT = binary_search(cubic, 0.1, pt, t, &iters); 266 return newT; 273 double newT = testOneFailure(failure); 274 SK_ALWAYSBREAK(newT >= 0); 281 double newT = testOneFailure(failure); 282 SK_ALWAYSBREAK(newT >= 0);
|
/external/skia/include/core/ |
H A D | SkTArray.h | 181 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); 182 SkNEW_PLACEMENT(newT, T); 183 return *newT; 190 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); local 191 SkNEW_PLACEMENT_ARGS(newT, T, (t)); 192 return *newT;
|
/external/skia/tests/ |
H A D | PathOpsCubicLineIntersectionIdeas.cpp | 219 double newT = binary_search(cubic, step, pt, t, &iters); local 220 if (newT >= 0) { 221 diff = fabs(t - newT); 265 double newT = binary_search(cubic, 0.1, pt, t, &iters); 266 return newT; 273 double newT = testOneFailure(failure); 274 SK_ALWAYSBREAK(newT >= 0); 281 double newT = testOneFailure(failure); 282 SK_ALWAYSBREAK(newT >= 0);
|