Home
last modified time | relevance | path

Searched refs:newT (Results 1 – 21 of 21) sorted by relevance

/external/skia/tests/
DPathOpsCubicLineIntersectionIdeas.cpp219 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST() local
220 if (newT >= 0) { in DEF_TEST()
221 diff = fabs(t - newT); in DEF_TEST()
265 double newT = binary_search(cubic, 0.1, pt, t, &iters); in testOneFailure() local
266 return newT; in testOneFailure()
273 double newT = testOneFailure(failure); in DEF_TEST() local
274 SK_ALWAYSBREAK(newT >= 0); in DEF_TEST()
281 double newT = testOneFailure(failure); in DEF_TEST() local
282 SK_ALWAYSBREAK(newT >= 0); in DEF_TEST()
/external/chromium_org/third_party/skia/tests/
DPathOpsCubicLineIntersectionIdeas.cpp219 double newT = binary_search(cubic, step, pt, t, &iters); in DEF_TEST() local
220 if (newT >= 0) { in DEF_TEST()
221 diff = fabs(t - newT); in DEF_TEST()
265 double newT = binary_search(cubic, 0.1, pt, t, &iters); in testOneFailure() local
266 return newT; in testOneFailure()
273 double newT = testOneFailure(failure); in DEF_TEST() local
274 SK_ALWAYSBREAK(newT >= 0); in DEF_TEST()
281 double newT = testOneFailure(failure); in DEF_TEST() local
282 SK_ALWAYSBREAK(newT >= 0); in DEF_TEST()
/external/chromium_org/third_party/skia/src/pathops/
DSkIntersectionHelper.h45 int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) { in addT() argument
46 return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT); in addT()
49 int addSelfT(const SkPoint& pt, double newT) { in addSelfT() argument
50 return fContour->addSelfT(fIndex, pt, newT); in addSelfT()
DSkDCubicToQuads.cpp107 double newT = start + (index / parts) * (end - start); in addTs() local
108 if (newT > 0 && newT < 1) { in addTs()
109 ts->push_back(newT); in addTs()
DSkOpContour.h80 int addT(int segIndex, SkOpContour* other, int otherIndex, const SkPoint& pt, double newT) { in addT() argument
82 return fSegments[segIndex].addT(&other->fSegments[otherIndex], pt, newT); in addT()
85 int addSelfT(int segIndex, const SkPoint& pt, double newT) { in addSelfT() argument
87 return fSegments[segIndex].addSelfT(pt, newT); in addSelfT()
DSkOpSegment.h283 int addSelfT(const SkPoint& pt, double newT);
285 int addT(SkOpSegment* other, const SkPoint& pt, double newT);
406 void alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other, double otherT,
417 bool checkForSmall(const SkOpSpan* span, const SkPoint& pt, double newT,
DSkOpSegment.cpp552 int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) { in addT() argument
555 SkASSERT(SkDPoint::RoughlyEqual(ptAtT(newT), pt)); in addT()
559 SkASSERT(newT == 0 || !precisely_zero(newT)); in addT()
560 SkASSERT(newT == 1 || !precisely_equal(newT, 1)); in addT()
573 if (newT < span.fT) { in addT()
577 if (newT == span.fT) { in addT()
582 if ((pt == firstPt && newT == 0) || (span.fPt == lastPt && newT == 1)) { in addT()
595 span->fT = newT; in addT()
601 SkASSERT(approximately_equal(xyAtT(newT).fX, pt.fX) in addT()
602 && approximately_equal(xyAtT(newT).fY, pt.fY)); in addT()
[all …]
DSkPathOpsCubic.cpp158 double newT = binarySearch(min, max, axisIntercept, xAxis); in searchRoots() local
159 if (newT >= 0) { in searchRoots()
160 validRoots[validCount++] = newT; in searchRoots()
/external/skia/src/pathops/
DSkIntersectionHelper.h45 int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) { in addT() argument
46 return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT); in addT()
49 int addSelfT(const SkPoint& pt, double newT) { in addSelfT() argument
50 return fContour->addSelfT(fIndex, pt, newT); in addSelfT()
DSkDCubicToQuads.cpp107 double newT = start + (index / parts) * (end - start); in addTs() local
108 if (newT > 0 && newT < 1) { in addTs()
109 ts->push_back(newT); in addTs()
DSkOpContour.h80 int addT(int segIndex, SkOpContour* other, int otherIndex, const SkPoint& pt, double newT) { in addT() argument
82 return fSegments[segIndex].addT(&other->fSegments[otherIndex], pt, newT); in addT()
85 int addSelfT(int segIndex, const SkPoint& pt, double newT) { in addSelfT() argument
87 return fSegments[segIndex].addSelfT(pt, newT); in addSelfT()
DSkOpSegment.h281 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,
DSkOpSegment.cpp548 int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) { in addT() argument
551 SkASSERT(SkDPoint::RoughlyEqual(ptAtT(newT), pt)); in addT()
555 SkASSERT(newT == 0 || !precisely_zero(newT)); in addT()
556 SkASSERT(newT == 1 || !precisely_equal(newT, 1)); in addT()
569 if (newT < span.fT) { in addT()
573 if (newT == span.fT) { in addT()
578 if ((pt == firstPt && newT == 0) || (span.fPt == lastPt && newT == 1)) { in addT()
591 span->fT = newT; in addT()
597 SkASSERT(approximately_equal(xyAtT(newT).fX, pt.fX) in addT()
598 && approximately_equal(xyAtT(newT).fY, pt.fY)); in addT()
[all …]
DSkPathOpsCubic.cpp158 double newT = binarySearch(min, max, axisIntercept, xAxis); in searchRoots() local
159 if (newT >= 0) { in searchRoots()
160 validRoots[validCount++] = newT; in searchRoots()
/external/chromium_org/third_party/skia/experimental/Intersection/
DCubicToQuadratics.cpp133 double newT = start + (index / parts) * (end - start); in addTs() local
134 if (newT > 0 && newT < 1) { in addTs()
135 *ts.append() = newT; in addTs()
DSimplify.cpp1673 int addT(Segment* other, const SkPoint& pt, double& newT) { in addT() argument
1680 if (precisely_less_than_zero(newT)) { in addT()
1681 newT = 0; in addT()
1682 } else if (precisely_greater_than_one(newT)) { in addT()
1683 newT = 1; in addT()
1693 if (newT < fTs[index].fT) { in addT()
1705 span->fT = newT; in addT()
1714 if ((span->fDone = newT == 1)) { in addT()
1725 double tInterval = newT - span[less].fT; in addT()
1730 double tMid = newT - tInterval / 2; in addT()
[all …]
/external/skia/experimental/Intersection/
DCubicToQuadratics.cpp133 double newT = start + (index / parts) * (end - start); in addTs() local
134 if (newT > 0 && newT < 1) { in addTs()
135 *ts.append() = newT; in addTs()
DSimplify.cpp1673 int addT(Segment* other, const SkPoint& pt, double& newT) { in addT() argument
1680 if (precisely_less_than_zero(newT)) { in addT()
1681 newT = 0; in addT()
1682 } else if (precisely_greater_than_one(newT)) { in addT()
1683 newT = 1; in addT()
1693 if (newT < fTs[index].fT) { in addT()
1705 span->fT = newT; in addT()
1714 if ((span->fDone = newT == 1)) { in addT()
1725 double tInterval = newT - span[less].fT; in addT()
1730 double tMid = newT - tInterval / 2; in addT()
[all …]
/external/chromium_org/third_party/skia/include/core/
DSkTArray.h181 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
182 SkNEW_PLACEMENT(newT, T); in push_back()
183 return *newT; in push_back()
190 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
191 SkNEW_PLACEMENT_ARGS(newT, T, (t)); in push_back()
192 return *newT; in push_back()
/external/skia/include/core/
DSkTArray.h181 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
182 SkNEW_PLACEMENT(newT, T); in push_back()
183 return *newT; in push_back()
190 T* newT = reinterpret_cast<T*>(this->push_back_raw(1)); in push_back() local
191 SkNEW_PLACEMENT_ARGS(newT, T, (t)); in push_back()
192 return *newT; in push_back()
/external/clang/test/SemaObjC/
Dunused-backing-ivar-warning.m48 - (void) setT:(id)newT { // expected-warning {{ivar 'tIvar' which backs the property is not referen…
49 okIvar = newT;