| /external/skia/tests/ |
| D | PathOpsQuadLineIntersectionTest.cpp | 93 if (!quadXY.approximatelyEqual(lineXY)) { in testOneOffs()
94 quadXY.approximatelyEqual(lineXY); in testOneOffs()
97 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY)); in testOneOffs()
138 if (!t1.approximatelyEqual(t2)) { in DEF_TEST()
143 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0]) in DEF_TEST()
145 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) { in DEF_TEST()
|
| D | PathOpsCubicIntersectionTest.cpp | 57 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
61 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in standardTestCases()
419 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
420 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
421 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
500 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in CubicIntersection_RandTest()
551 } while (!t1[1].approximatelyEqual(t2[1])); in intersectionFinder()
560 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
566 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
571 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step; in intersectionFinder()
[all …]
|
| D | PathOpsConicLineIntersectionTest.cpp | 82 if (!conicXY.approximatelyEqual(lineXY)) { in testOneOffs()
83 conicXY.approximatelyEqual(lineXY); in testOneOffs()
86 REPORTER_ASSERT(reporter, conicXY.approximatelyEqual(lineXY)); in testOneOffs()
130 if (!t1.approximatelyEqual(t2)) { in DEF_TEST()
135 if (!t1.approximatelyEqual(lineConicTests[index].expected[0]) in DEF_TEST()
137 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) { in DEF_TEST()
|
| D | PathOpsQuadIntersectionTest.cpp | 43 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
337 if (!xy1.approximatelyEqual(xy2)) { in oneOffTest1()
387 REPORTER_ASSERT(reporter, pt1.approximatelyEqual(pt2)); in coincidentTestOne()
446 } while (!t1[1].approximatelyEqual(t2[1])); in intersectionFinder()
455 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
461 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
466 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step; in intersectionFinder()
472 t22 -= t2[1].approximatelyEqual(test) ? -t2Step : t2Step; in intersectionFinder()
|
| D | PathOpsConicIntersectionTest.cpp | 47 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
48 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
49 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
|
| D | PathOpsDPointTest.cpp | 35 REPORTER_ASSERT(reporter, p.approximatelyEqual(pt)); in DEF_TEST()
39 REPORTER_ASSERT(reporter, p.approximatelyEqual(sPt)); in DEF_TEST()
|
| D | PathOpsCubicQuadIntersectionTest.cpp | 79 if (!xy1.approximatelyEqual(xy2)) { in cubicQuadIntersection()
83 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()
172 if (calcPt.approximatelyEqual(pt)) { in DEF_TEST()
263 SK_ALWAYSBREAK(!calcPt.approximatelyEqual(pt)); in testOneFailure()
|
| D | PathOpsCubicLineIntersectionTest.cpp | 150 if (!xy1.approximatelyEqual(xy2)) { in testOne()
154 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 | 38 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]) in collapsed()
39 && fPts[0].approximatelyEqual(fPts[3]); in collapsed()
|
| D | SkReduceOrder.cpp | 22 return 1 + !reduction[0].approximatelyEqual(reduction[1]); in reductionLineCount()
41 while (quad[startIndex].approximatelyEqual(quad[endIndex])) { in check_linear()
115 return 1 + !reduction[0].approximatelyEqual(reduction[1]); in reductionLineCount()
161 while (cubic[startIndex].approximatelyEqual(cubic[endIndex])) { in check_linear()
|
| D | SkPathOpsQuad.h | 29 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]); in collapsed()
|
| D | SkPathOpsPoint.h | 133 bool approximatelyEqual(const SkDPoint& a) const { in approximatelyEqual() function
147 bool approximatelyEqual(const SkPoint& a) const { in approximatelyEqual() function
150 return approximatelyEqual(dA); in approximatelyEqual()
|
| D | SkPathOpsTSect.h | 340 cPt.approximatelyEqual(fPerpPt) ? "==" : "!=", fPerpT, fPerpPt.fX, fPerpPt.fY); in setPerp()
342 fCoincident = cPt.approximatelyEqual(fPerpPt); in setPerp()
869 if (last.approximatelyEqual(work.fPart[0])) { in binarySearchCoin()
890 if (last.approximatelyEqual(fCurve[0])) { in binarySearchCoin()
892 } else if (last.approximatelyEqual(fCurve[TCurve::kPointLast])) { in binarySearchCoin()
895 if (oppPt.approximatelyEqual(opp[0])) { in binarySearchCoin()
897 } else if (oppPt.approximatelyEqual(opp[OppCurve::kPointLast])) { in binarySearchCoin()
1288 && oppIPt.approximatelyEqual(iPt)) { in linesIntersect()
1363 } while (!workPt.approximatelyEqual(coinW.perpPt())); in linesIntersect()
1745 && sect1->fCurve[0].approximatelyEqual(sect2->fCurve[0])) { in EndsEqual()
[all …]
|
| D | SkDConicLineIntersection.cpp | 108 SkASSERT(conicPt.approximatelyEqual(linePt)); in intersect()
307 if (conicMidPt.approximatelyEqual(pt)) { in uniqueAnswer()
|
| D | SkDQuadLineIntersection.cpp | 231 if (quadMidPt.approximatelyEqual(pt)) { in uniqueAnswer()
|
| D | SkDCubicLineIntersection.cpp | 216 if (cubicMidPt.approximatelyEqual(pt)) { in uniqueAnswer()
|
| D | SkOpAngle.cpp | 295 if (!fCurvePart[SkPathOpsVerbToPoints(this->segment()->verb())].approximatelyEqual( in checkParallel()
|
| D | SkOpSegment.cpp | 1199 if (oppPt.approximatelyEqual(midPt)) { in missingCoincidence()
|