| /external/skqp/src/pathops/ |
| D | SkReduceOrder.cpp | 268 if (SkDPoint::ApproximatelyEqual(a[0], a[1]) && SkDPoint::ApproximatelyEqual(a[0], a[2]) in Cubic()
269 && SkDPoint::ApproximatelyEqual(a[0], a[3])) { in Cubic()
|
| D | SkOpEdgeBuilder.cpp | 36 return SkPath::kLine_Verb != verb || !SkDPoint::ApproximatelyEqual(curve[0], curve[1]); in can_add_curve()
62 if (!SkDPoint::ApproximatelyEqual(curveEnd, curveStart)) { in closeContour()
105 if (SkDPoint::ApproximatelyEqual(curve[0], pts[1])) { in preFetch()
|
| D | SkPathOpsWinding.cpp | 150 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) { in rayCheck()
308 if (last && SkDPoint::ApproximatelyEqual(*last, hit->fPt)) { in sortableTop()
313 if (SkDPoint::ApproximatelyEqual(next, hit->fPt)) { in sortableTop()
|
| D | SkDQuadLineIntersection.cpp | 396 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs()
399 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs()
|
| D | SkDConicLineIntersection.cpp | 296 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs()
299 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs()
|
| D | SkPathOpsPoint.h | 189 static bool ApproximatelyEqual(const SkPoint& a, const SkPoint& b) { in ApproximatelyEqual() function
|
| D | SkOpSegment.cpp | 1058 if (!SkDPoint::ApproximatelyEqual(testPt, base->fPt)) { in match()
1376 SkOPASSERT(!SkDPoint::ApproximatelyEqual(dBugRef->fPt, dBugCheck->fPt)); in spansNearby()
1672 if (!SkDPoint::ApproximatelyEqual(priorPtT->fPt, midPt) in testForCoincidence()
1673 && !SkDPoint::ApproximatelyEqual(ptT->fPt, midPt)) { in testForCoincidence()
|
| /external/skia/src/pathops/ |
| D | SkReduceOrder.cpp | 268 if (SkDPoint::ApproximatelyEqual(a[0], a[1]) && SkDPoint::ApproximatelyEqual(a[0], a[2]) in Cubic()
269 && SkDPoint::ApproximatelyEqual(a[0], a[3])) { in Cubic()
|
| D | SkOpEdgeBuilder.cpp | 40 return SkPath::kLine_Verb != verb || !SkDPoint::ApproximatelyEqual(curve[0], curve[1]); in can_add_curve()
66 if (!SkDPoint::ApproximatelyEqual(curveEnd, curveStart)) { in closeContour()
106 if (SkDPoint::ApproximatelyEqual(curve[0], curve[1])) { in preFetch()
|
| D | SkPathOpsWinding.cpp | 151 if (SkDPoint::ApproximatelyEqual(pt, base.fPt)) { in rayCheck()
309 if (last && SkDPoint::ApproximatelyEqual(*last, hit->fPt)) { in sortableTop()
314 if (SkDPoint::ApproximatelyEqual(next, hit->fPt)) { in sortableTop()
|
| D | SkDQuadLineIntersection.cpp | 396 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs()
399 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs()
|
| D | SkDConicLineIntersection.cpp | 296 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) { in pinTs()
299 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) { in pinTs()
|
| D | SkPathOpsPoint.h | 195 static bool ApproximatelyEqual(const SkPoint& a, const SkPoint& b) { in ApproximatelyEqual() function
|
| D | SkOpSegment.cpp | 1058 if (!SkDPoint::ApproximatelyEqual(testPt, base->fPt)) { in match()
1376 SkOPASSERT(!SkDPoint::ApproximatelyEqual(dBugRef->fPt, dBugCheck->fPt)); in spansNearby()
1672 if (!SkDPoint::ApproximatelyEqual(priorPtT->fPt, midPt) in testForCoincidence()
1673 && !SkDPoint::ApproximatelyEqual(ptT->fPt, midPt)) { in testForCoincidence()
|
| /external/libchrome/ui/gfx/geometry/ |
| D | rect.cc | 300 bool Rect::ApproximatelyEqual(const Rect& rect, int tolerance) const { in ApproximatelyEqual() function in gfx::Rect
|
| D | rect.h | 211 bool ApproximatelyEqual(const Rect& rect, int tolerance) const;
|
| /external/skqp/tests/ |
| D | PathOpsOpTest.cpp | 26 if (SkDPoint::ApproximatelyEqual(path->getPoint(index), from)) { in path_edit()
|
| /external/skia/tests/ |
| D | PathOpsOpTest.cpp | 26 if (SkDPoint::ApproximatelyEqual(path->getPoint(index), from)) { in path_edit()
|