HomeSort by relevance Sort by last modified time
    Searched refs:iPt (Results 1 - 10 of 10) sorted by null

  /external/skia/src/pathops/
SkIntersections.cpp 18 const SkDPoint& iPt = fPt[index];
19 double dist = testPt.distanceSquared(iPt);
SkAddIntersections.cpp 516 SkPoint iPt = ts.pt(pt).asSkPoint();
517 bool iPtIsIntegral = iPt.fX == floor(iPt.fX) && iPt.fY == floor(iPt.fY);
518 SkOpPtT* testTAt = iPtIsIntegral ? wt.segment()->addT(ts[swap][pt], iPt)
521 SkOpPtT* nextTAt = iPtIsIntegral ? wn.segment()->addT(ts[!swap][pt], iPt)
SkPathOpsTSect.h     [all...]
  /external/skqp/src/pathops/
SkIntersections.cpp 18 const SkDPoint& iPt = fPt[index];
19 double dist = testPt.distanceSquared(iPt);
SkAddIntersections.cpp 516 SkPoint iPt = ts.pt(pt).asSkPoint();
517 bool iPtIsIntegral = iPt.fX == floor(iPt.fX) && iPt.fY == floor(iPt.fY);
518 SkOpPtT* testTAt = iPtIsIntegral ? wt.segment()->addT(ts[swap][pt], iPt)
521 SkOpPtT* nextTAt = iPtIsIntegral ? wn.segment()->addT(ts[!swap][pt], iPt)
SkPathOpsTSect.h     [all...]
  /external/skia/tests/
PathOpsCubicIntersectionTest.cpp 425 const SkDPoint& iPt = intersections.pt(pt3);
428 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX,
429 iPt.fY, xy2.fX, xy2.fY, tt2);
431 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt));
432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt));
PathOpsConicIntersectionTest.cpp 327 const SkDPoint& iPt = intersections.pt(pt3);
328 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt));
329 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt));
  /external/skqp/tests/
PathOpsCubicIntersectionTest.cpp 424 const SkDPoint& iPt = intersections.pt(pt3);
427 __FUNCTION__, tt1, xy1.fX, xy1.fY, iPt.fX,
428 iPt.fY, xy2.fX, xy2.fY, tt2);
430 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt));
431 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt));
PathOpsConicIntersectionTest.cpp 327 const SkDPoint& iPt = intersections.pt(pt3);
328 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt));
329 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt));

Completed in 120 milliseconds