Searched refs:iPt (Results 1 - 6 of 6) sorted by relevance
| /third_party/skia/docs/examples/ |
| H A D | Point_iset_2.cpp | 7 SkIPoint iPt = { SK_MinS32, SK_MaxS32 }; in REG_FIDDLE() local
9 fPt.iset(iPt); in REG_FIDDLE()
10 SkDebugf("iPt: %d, %d\n", iPt.fX, iPt.fY); in REG_FIDDLE()
|
| /third_party/skia/tests/ |
| H A D | PathOpsCubicIntersectionTest.cpp | 424 const SkDPoint& iPt = intersections.pt(pt3); in oneOff() local
427 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX, in oneOff()
428 iPt.fY, xy2.fX, xy2.fY, tt2); in oneOff()
430 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
431 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
|
| H A D | PathOpsConicIntersectionTest.cpp | 322 const SkDPoint& iPt = intersections.pt(pt3); in oneOff() local
323 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
324 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
|
| /third_party/skia/src/pathops/ |
| H A 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()
|
| H A D | SkIntersections.cpp | 18 const SkDPoint& iPt = fPt[index]; in closestTo() local
19 double dist = testPt.distanceSquared(iPt); in closestTo()
|
| H A D | SkPathOpsTSect.cpp | 1131 const SkDPoint& iPt = oppRayI.pt(closeIndex); in linesIntersect() local
1134 && oppIPt.approximatelyEqual(iPt)) { in linesIntersect()
1138 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect()
|
Completed in 7 milliseconds