| /external/skia/tests/ |
| D | PathOpsQuadLineIntersectionTest.cpp | 95 if (!quadXY.approximatelyEqual(lineXY)) { in testOneOffs()
96 quadXY.approximatelyEqual(lineXY); in testOneOffs()
99 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY)); in testOneOffs()
142 if (!t1.approximatelyEqual(t2)) { in DEF_TEST()
147 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0]) in DEF_TEST()
149 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) { in DEF_TEST()
|
| D | PathOpsCubicIntersectionTest.cpp | 62 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in standardTestCases()
430 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
431 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
432 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
520 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in CubicIntersection_RandTest()
574 } while (!t1[1].approximatelyEqual(t2[1])); in intersectionFinder()
583 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
589 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
594 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step; in intersectionFinder()
[all …]
|
| D | PathOpsConicLineIntersectionTest.cpp | 85 if (!conicXY.approximatelyEqual(lineXY)) { in testOneOffs()
86 conicXY.approximatelyEqual(lineXY); in testOneOffs()
89 REPORTER_ASSERT(reporter, conicXY.approximatelyEqual(lineXY)); in testOneOffs()
137 if (!t1.approximatelyEqual(t2)) { in DEF_TEST()
142 if (!t1.approximatelyEqual(lineConicTests[index].expected[0]) in DEF_TEST()
144 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) { in DEF_TEST()
|
| D | PathOpsQuadIntersectionTest.cpp | 47 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
351 if (!xy1.approximatelyEqual(xy2)) { in oneOffTest1()
405 REPORTER_ASSERT(reporter, pt1.approximatelyEqual(pt2)); in coincidentTestOne()
466 } while (!t1[1].approximatelyEqual(t2[1])); in intersectionFinder()
475 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
481 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
486 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step; in intersectionFinder()
492 t22 -= t2[1].approximatelyEqual(test) ? -t2Step : t2Step; in intersectionFinder()
|
| D | PathOpsDPointTest.cpp | 35 REPORTER_ASSERT(reporter, p.approximatelyEqual(pt)); in DEF_TEST()
39 REPORTER_ASSERT(reporter, p.approximatelyEqual(sPt)); in DEF_TEST()
|
| D | PathOpsConicQuadIntersectionTest.cpp | 55 if (!xy1.approximatelyEqual(xy2)) { in conicQuadIntersection()
59 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in conicQuadIntersection()
|
| D | PathOpsCubicConicIntersectionTest.cpp | 59 if (!xy1.approximatelyEqual(xy2)) { in cubicConicIntersection()
63 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicConicIntersection()
|
| D | PathOpsCubicQuadIntersectionTest.cpp | 83 if (!xy1.approximatelyEqual(xy2)) { in cubicQuadIntersection()
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicQuadIntersection()
|
| D | PathOpsLineIntersectionTest.cpp | 95 if (!result1.approximatelyEqual(result2) && !ts.nearlySame(i)) { in check_results()
98 if (!result1.approximatelyEqual(result2)) { in check_results()
101 REPORTER_ASSERT(reporter, result1.approximatelyEqual(result2)); in check_results()
102 REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint())); in check_results()
|
| D | PathOpsCubicLineIntersectionIdeas.cpp | 60 if (cubicAtT.approximatelyEqual(pt)) { in binary_search()
174 if (calcPt.approximatelyEqual(pt)) { in DEF_TEST()
267 SkASSERT_RELEASE(!calcPt.approximatelyEqual(pt)); in testOneFailure()
|
| D | PathOpsConicIntersectionTest.cpp | 54 SkASSERT(dChopped[cIndex].fPts[pIndex].approximatelyEqual(up)); in chopCompare()
328 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
329 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
330 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
|
| D | PathOpsCubicLineIntersectionTest.cpp | 154 if (!xy1.approximatelyEqual(xy2)) { in testOne()
158 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in testOne()
|
| D | PathOpsQuadLineIntersectionThreadedTest.cpp | 61 if (quadXY.approximatelyEqual(lineXY)) { in testLineIntersect()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsCubic.h | 27 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]) in collapsed()
28 && fPts[0].approximatelyEqual(fPts[3]); in collapsed()
|
| D | SkPathOpsQuad.h | 29 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]); in collapsed()
|
| D | SkPathOpsTSect.h | 381 cPt.approximatelyEqual(fPerpPt) ? "==" : "!=", fPerpT, fPerpPt.fX, fPerpPt.fY); in setPerp()
383 fMatch = cPt.approximatelyEqual(fPerpPt); in setPerp()
932 if (last.approximatelyEqual(work.fPart[0])) { in binarySearchCoin()
957 if (last.approximatelyEqual(fCurve[0])) { in binarySearchCoin()
959 } else if (last.approximatelyEqual(fCurve[TCurve::kPointLast])) { in binarySearchCoin()
962 if (oppPt.approximatelyEqual(opp[0])) { in binarySearchCoin()
964 } else if (oppPt.approximatelyEqual(opp[OppCurve::kPointLast])) { in binarySearchCoin()
1400 finds += perpRayI.pt(pIndex).approximatelyEqual(thisPerp.fPts[1]); in is_parallel()
1407 finds += perpRayI.pt(pIndex).approximatelyEqual(thisPerp.fPts[0]); in is_parallel()
1436 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
[all …]
|
| D | SkPathOpsPoint.h | 167 bool approximatelyEqual(const SkDPoint& a) const { in approximatelyEqual() function
181 bool approximatelyEqual(const SkPoint& a) const { in approximatelyEqual() function
184 return approximatelyEqual(dA); in approximatelyEqual()
|
| D | SkReduceOrder.cpp | 23 return 1 + !reduction[0].approximatelyEqual(reduction[1]); in reductionLineCount()
109 return 1 + !reduction[0].approximatelyEqual(reduction[1]); in reductionLineCount()
|
| D | SkDQuadLineIntersection.cpp | 232 if (quadMidPt.approximatelyEqual(pt)) { in uniqueAnswer()
|
| D | SkDCubicLineIntersection.cpp | 218 if (cubicMidPt.approximatelyEqual(pt)) { in uniqueAnswer()
|
| D | SkDConicLineIntersection.cpp | 328 if (conicMidPt.approximatelyEqual(pt)) { in uniqueAnswer()
|
| D | SkOpCoincidence.cpp | 311 if (!oppPt.approximatelyEqual(pt)) { in addEndMovedSpans()
|
| D | SkPathOpsDebug.cpp | 1514 if (!oppPt.approximatelyEqual(pt)) { in debugAddEndMovedSpans()
|
| /external/skia/src/core/ |
| D | SkEdgeBuilder.cpp | 62 static inline bool approximatelyEqual(SkFixed a, SkFixed b) { in approximatelyEqual() function
78 if (approximatelyEqual(edge->fUpperY, last->fLowerY)) { in CombineVertical()
84 if (approximatelyEqual(edge->fUpperY, last->fUpperY)) { in CombineVertical()
85 if (approximatelyEqual(edge->fLowerY, last->fLowerY)) { in CombineVertical()
99 if (approximatelyEqual(edge->fLowerY, last->fLowerY)) { in CombineVertical()
|