| /external/skia/tests/ |
| D | PathOpsCubicIntersectionTest.cpp | 425 const SkDPoint& iPt = intersections.pt(pt3); in oneOff() local
428 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX, in oneOff()
429 iPt.fY, xy2.fX, xy2.fY, tt2); in oneOff()
431 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
|
| D | PathOpsConicIntersectionTest.cpp | 327 const SkDPoint& iPt = intersections.pt(pt3); in oneOff() local
328 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
329 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
|
| /external/skqp/tests/ |
| D | PathOpsCubicIntersectionTest.cpp | 425 const SkDPoint& iPt = intersections.pt(pt3); in oneOff() local
428 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX, in oneOff()
429 iPt.fY, xy2.fX, xy2.fY, tt2); in oneOff()
431 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
|
| D | PathOpsConicIntersectionTest.cpp | 327 const SkDPoint& iPt = intersections.pt(pt3); in oneOff() local
328 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
329 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
|
| /external/skqp/src/pathops/ |
| D | SkAddIntersections.cpp | 518 SkPoint iPt = ts.pt(pt).asSkPoint(); in AddIntersectTs() local
519 bool iPtIsIntegral = iPt.fX == floor(iPt.fX) && iPt.fY == floor(iPt.fY); in AddIntersectTs()
520 SkOpPtT* testTAt = iPtIsIntegral ? wt.segment()->addT(ts[swap][pt], iPt) in AddIntersectTs()
523 SkOpPtT* nextTAt = iPtIsIntegral ? wn.segment()->addT(ts[!swap][pt], iPt) in AddIntersectTs()
|
| D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() local
19 double dist = testPt.distanceSquared(iPt); in closestTo()
|
| D | SkPathOpsTSect.cpp | 1130 const SkDPoint& iPt = oppRayI.pt(closeIndex); in linesIntersect() local
1133 && oppIPt.approximatelyEqual(iPt)) { in linesIntersect()
1137 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect()
|
| /external/skia/src/pathops/ |
| D | SkAddIntersections.cpp | 518 SkPoint iPt = ts.pt(pt).asSkPoint(); in AddIntersectTs() local
519 bool iPtIsIntegral = iPt.fX == floor(iPt.fX) && iPt.fY == floor(iPt.fY); in AddIntersectTs()
520 SkOpPtT* testTAt = iPtIsIntegral ? wt.segment()->addT(ts[swap][pt], iPt) in AddIntersectTs()
523 SkOpPtT* nextTAt = iPtIsIntegral ? wn.segment()->addT(ts[!swap][pt], iPt) in AddIntersectTs()
|
| D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() local
19 double dist = testPt.distanceSquared(iPt); in closestTo()
|
| D | SkPathOpsTSect.cpp | 1130 const SkDPoint& iPt = oppRayI.pt(closeIndex); in linesIntersect() local
1133 && oppIPt.approximatelyEqual(iPt)) { in linesIntersect()
1137 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect()
|
| /external/skqp/docs/ |
| D | SkPoint_Reference.bmh | 158 SkIPoint iPt = { SK_MinS32, SK_MaxS32 };
160 fPt.iset(iPt);
161 SkDebugf("iPt: %d, %d\n", iPt.fX, iPt.fY);
164 iPt: -2147483647, 2147483647
|
| /external/skia/docs/ |
| D | SkPoint_Reference.bmh | 158 SkIPoint iPt = { SK_MinS32, SK_MaxS32 };
160 fPt.iset(iPt);
161 SkDebugf("iPt: %d, %d\n", iPt.fX, iPt.fY);
164 iPt: -2147483647, 2147483647
|
| /external/skia/site/user/api/ |
| D | SkPoint_Reference.md | 311 iPt: -2147483647, 2147483647
|
| /external/skqp/site/user/api/ |
| D | SkPoint_Reference.md | 311 iPt: -2147483647, 2147483647
|