| /external/chromium_org/third_party/skia/tests/ |
| PathOpsCubicLineIntersectionIdeas.cpp | 219 double newT = binary_search(cubic, step, pt, t, &iters);
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/tests/ |
| PathOpsCubicLineIntersectionIdeas.cpp | 219 double newT = binary_search(cubic, step, pt, t, &iters);
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/chromium_org/third_party/skia/src/pathops/ |
| SkDCubicToQuads.cpp | 107 double newT = start + (index / parts) * (end - start);
108 if (newT > 0 && newT < 1) {
109 ts->push_back(newT);
|
| SkIntersectionHelper.h | 45 int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) {
46 return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT);
49 int addSelfT(const SkPoint& pt, double newT) {
50 return fContour->addSelfT(fIndex, pt, newT);
|
| SkOpContour.h | 80 int addT(int segIndex, SkOpContour* other, int otherIndex, const SkPoint& pt, double newT) {
82 return fSegments[segIndex].addT(&other->fSegments[otherIndex], pt, newT);
85 int addSelfT(int segIndex, const SkPoint& pt, double newT) {
87 return fSegments[segIndex].addSelfT(pt, newT);
|
| SkOpSegment.h | 281 int addSelfT(const SkPoint& pt, double newT);
283 int addT(SkOpSegment* other, const SkPoint& pt, double newT);
404 void alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other, double otherT,
415 bool checkForSmall(const SkOpSpan* span, const SkPoint& pt, double newT,
|
| SkOpSegment.cpp | 548 int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) {
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 == 1))
[all...] |
| SkPathOpsCubic.cpp | 158 double newT = binarySearch(min, max, axisIntercept, xAxis);
159 if (newT >= 0) {
160 validRoots[validCount++] = newT;
|
| /external/skia/src/pathops/ |
| SkDCubicToQuads.cpp | 107 double newT = start + (index / parts) * (end - start);
108 if (newT > 0 && newT < 1) {
109 ts->push_back(newT);
|
| SkIntersectionHelper.h | 45 int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) {
46 return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT);
49 int addSelfT(const SkPoint& pt, double newT) {
50 return fContour->addSelfT(fIndex, pt, newT);
|
| SkOpContour.h | 80 int addT(int segIndex, SkOpContour* other, int otherIndex, const SkPoint& pt, double newT) {
82 return fSegments[segIndex].addT(&other->fSegments[otherIndex], pt, newT);
85 int addSelfT(int segIndex, const SkPoint& pt, double newT) {
87 return fSegments[segIndex].addSelfT(pt, newT);
|
| SkOpSegment.h | 281 int addSelfT(const SkPoint& pt, double newT);
283 int addT(SkOpSegment* other, const SkPoint& pt, double newT);
404 void alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other, double otherT,
415 bool checkForSmall(const SkOpSpan* span, const SkPoint& pt, double newT,
|
| SkOpSegment.cpp | 548 int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) {
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 == 1))
[all...] |
| SkPathOpsCubic.cpp | 158 double newT = binarySearch(min, max, axisIntercept, xAxis);
159 if (newT >= 0) {
160 validRoots[validCount++] = newT;
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| CubicToQuadratics.cpp | 133 double newT = start + (index / parts) * (end - start);
134 if (newT > 0 && newT < 1) {
135 *ts.append() = newT;
|
| Simplify.cpp | [all...] |
| /external/skia/experimental/Intersection/ |
| CubicToQuadratics.cpp | 133 double newT = start + (index / parts) * (end - start);
134 if (newT > 0 && newT < 1) {
135 *ts.append() = newT;
|
| Simplify.cpp | [all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| 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));
191 SkNEW_PLACEMENT_ARGS(newT, T, (t));
192 return *newT;
|
| /external/skia/include/core/ |
| 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));
191 SkNEW_PLACEMENT_ARGS(newT, T, (t));
192 return *newT;
|
