Home
last modified time | relevance | path

Searched refs:iPt (Results 1 – 14 of 14) sorted by relevance

/external/skia/tests/
DPathOpsCubicIntersectionTest.cpp425 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()
DPathOpsConicIntersectionTest.cpp327 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/
DPathOpsCubicIntersectionTest.cpp424 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()
DPathOpsConicIntersectionTest.cpp327 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/skia/src/pathops/
DSkAddIntersections.cpp516 SkPoint iPt = ts.pt(pt).asSkPoint(); in AddIntersectTs() local
517 bool iPtIsIntegral = iPt.fX == floor(iPt.fX) && iPt.fY == floor(iPt.fY); in AddIntersectTs()
518 SkOpPtT* testTAt = iPtIsIntegral ? wt.segment()->addT(ts[swap][pt], iPt) in AddIntersectTs()
521 SkOpPtT* nextTAt = iPtIsIntegral ? wn.segment()->addT(ts[!swap][pt], iPt) in AddIntersectTs()
DSkIntersections.cpp18 const SkDPoint& iPt = fPt[index]; in closestTo() local
19 double dist = testPt.distanceSquared(iPt); in closestTo()
DSkPathOpsTSect.h1483 const SkDPoint& iPt = oppRayI.pt(closeIndex); in linesIntersect() local
1486 && oppIPt.approximatelyEqual(iPt)) { in linesIntersect()
1490 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect()
/external/skqp/src/pathops/
DSkAddIntersections.cpp516 SkPoint iPt = ts.pt(pt).asSkPoint(); in AddIntersectTs() local
517 bool iPtIsIntegral = iPt.fX == floor(iPt.fX) && iPt.fY == floor(iPt.fY); in AddIntersectTs()
518 SkOpPtT* testTAt = iPtIsIntegral ? wt.segment()->addT(ts[swap][pt], iPt) in AddIntersectTs()
521 SkOpPtT* nextTAt = iPtIsIntegral ? wn.segment()->addT(ts[!swap][pt], iPt) in AddIntersectTs()
DSkIntersections.cpp18 const SkDPoint& iPt = fPt[index]; in closestTo() local
19 double dist = testPt.distanceSquared(iPt); in closestTo()
DSkPathOpsTSect.h1483 const SkDPoint& iPt = oppRayI.pt(closeIndex); in linesIntersect() local
1486 && oppIPt.approximatelyEqual(iPt)) { in linesIntersect()
1490 double distSq = oppIPt.distanceSquared(iPt); in linesIntersect()
/external/skia/docs/
DSkPoint_Reference.bmh207 SkIPoint iPt = { SK_MinS32, SK_MaxS32 };
209 fPt.iset(iPt);
210 SkDebugf("iPt: %d, %d\n", iPt.fX, iPt.fY);
213 iPt: -2147483647, 2147483647
/external/skqp/docs/
DSkPoint_Reference.bmh195 SkIPoint iPt = { SK_MinS32, SK_MaxS32 };
197 fPt.iset(iPt);
198 SkDebugf("iPt: %d, %d\n", iPt.fX, iPt.fY);
201 iPt: -2147483647, 2147483647
/external/skqp/site/user/api/
DSkPoint_Reference.md314 iPt: -2147483647, 2147483647
/external/skia/site/user/api/
DSkPoint_Reference.md338 iPt: -2147483647, 2147483647