Home
last modified time | relevance | path

Searched refs:approximatelyEqual (Results 1 – 25 of 46) sorted by relevance

12

/external/skqp/tests/
DPathOpsQuadLineIntersectionTest.cpp99 if (!quadXY.approximatelyEqual(lineXY)) { in testOneOffs()
100 quadXY.approximatelyEqual(lineXY); in testOneOffs()
103 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY)); in testOneOffs()
146 if (!t1.approximatelyEqual(t2)) { in DEF_TEST()
151 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0]) in DEF_TEST()
153 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) { in DEF_TEST()
DPathOpsCubicIntersectionTest.cpp62 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in standardTestCases()
431 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
433 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
521 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in CubicIntersection_RandTest()
575 } while (!t1[1].approximatelyEqual(t2[1])); in intersectionFinder()
584 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
590 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
595 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step; in intersectionFinder()
[all …]
DPathOpsConicLineIntersectionTest.cpp89 if (!conicXY.approximatelyEqual(lineXY)) { in testOneOffs()
90 conicXY.approximatelyEqual(lineXY); in testOneOffs()
93 REPORTER_ASSERT(reporter, conicXY.approximatelyEqual(lineXY)); in testOneOffs()
141 if (!t1.approximatelyEqual(t2)) { in DEF_TEST()
146 if (!t1.approximatelyEqual(lineConicTests[index].expected[0]) in DEF_TEST()
148 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) { in DEF_TEST()
DPathOpsQuadIntersectionTest.cpp47 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()
DPathOpsDPointTest.cpp35 REPORTER_ASSERT(reporter, p.approximatelyEqual(pt)); in DEF_TEST()
39 REPORTER_ASSERT(reporter, p.approximatelyEqual(sPt)); in DEF_TEST()
DPathOpsCubicConicIntersectionTest.cpp73 if (!xy1.approximatelyEqual(xy2)) { in cubicConicIntersection()
77 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicConicIntersection()
DPathOpsCubicQuadIntersectionTest.cpp83 if (!xy1.approximatelyEqual(xy2)) { in cubicQuadIntersection()
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicQuadIntersection()
DPathOpsConicQuadIntersectionTest.cpp62 if (!xy1.approximatelyEqual(xy2)) { in conicQuadIntersection()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in conicQuadIntersection()
DPathOpsLineIntersectionTest.cpp95 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()
DPathOpsCubicLineIntersectionIdeas.cpp60 if (cubicAtT.approximatelyEqual(pt)) { in binary_search()
174 if (calcPt.approximatelyEqual(pt)) { in DEF_TEST()
267 SkASSERT_RELEASE(!calcPt.approximatelyEqual(pt)); in testOneFailure()
DPathOpsConicIntersectionTest.cpp54 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()
/external/skia/tests/
DPathOpsQuadLineIntersectionTest.cpp99 if (!quadXY.approximatelyEqual(lineXY)) { in testOneOffs()
100 quadXY.approximatelyEqual(lineXY); in testOneOffs()
103 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY)); in testOneOffs()
146 if (!t1.approximatelyEqual(t2)) { in DEF_TEST()
151 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0]) in DEF_TEST()
153 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) { in DEF_TEST()
DPathOpsCubicIntersectionTest.cpp62 if (!xy1.approximatelyEqual(xy2)) { in standardTestCases()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in standardTestCases()
431 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt)); in oneOff()
432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt)); in oneOff()
433 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in oneOff()
521 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in CubicIntersection_RandTest()
575 } while (!t1[1].approximatelyEqual(t2[1])); in intersectionFinder()
584 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
590 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step; in intersectionFinder()
595 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step; in intersectionFinder()
[all …]
DPathOpsConicLineIntersectionTest.cpp89 if (!conicXY.approximatelyEqual(lineXY)) { in testOneOffs()
90 conicXY.approximatelyEqual(lineXY); in testOneOffs()
93 REPORTER_ASSERT(reporter, conicXY.approximatelyEqual(lineXY)); in testOneOffs()
141 if (!t1.approximatelyEqual(t2)) { in DEF_TEST()
146 if (!t1.approximatelyEqual(lineConicTests[index].expected[0]) in DEF_TEST()
148 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) { in DEF_TEST()
DPathOpsQuadIntersectionTest.cpp47 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()
DPathOpsDPointTest.cpp35 REPORTER_ASSERT(reporter, p.approximatelyEqual(pt)); in DEF_TEST()
39 REPORTER_ASSERT(reporter, p.approximatelyEqual(sPt)); in DEF_TEST()
DPathOpsCubicQuadIntersectionTest.cpp83 if (!xy1.approximatelyEqual(xy2)) { in cubicQuadIntersection()
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicQuadIntersection()
DPathOpsConicQuadIntersectionTest.cpp62 if (!xy1.approximatelyEqual(xy2)) { in conicQuadIntersection()
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in conicQuadIntersection()
DPathOpsCubicConicIntersectionTest.cpp73 if (!xy1.approximatelyEqual(xy2)) { in cubicConicIntersection()
77 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); in cubicConicIntersection()
DPathOpsLineIntersectionTest.cpp95 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()
DPathOpsCubicLineIntersectionIdeas.cpp60 if (cubicAtT.approximatelyEqual(pt)) { in binary_search()
174 if (calcPt.approximatelyEqual(pt)) { in DEF_TEST()
267 SkASSERT_RELEASE(!calcPt.approximatelyEqual(pt)); in testOneFailure()
/external/skia/src/pathops/
DSkPathOpsTSect.cpp38 cPt.approximatelyEqual(fPerpPt) ? "==" : "!=", fPerpT, fPerpPt.fX, fPerpPt.fY); in setPerp()
40 fMatch = cPt.approximatelyEqual(fPerpPt); in setPerp()
570 if (last.approximatelyEqual(work.pointFirst())) { in binarySearchCoin()
598 if (last.approximatelyEqual(fCurve[0])) { in binarySearchCoin()
600 } else if (last.approximatelyEqual(this->pointLast())) { in binarySearchCoin()
603 if (oppPt.approximatelyEqual(opp[0])) { in binarySearchCoin()
605 } else if (oppPt.approximatelyEqual(sect2->pointLast())) { in binarySearchCoin()
1052 finds += perpRayI.pt(pIndex).approximatelyEqual(thisPerp.fPts[1]); in is_parallel()
1059 finds += perpRayI.pt(pIndex).approximatelyEqual(thisPerp.fPts[0]); in is_parallel()
1088 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
[all …]
DSkPathOpsCubic.h28 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]) in collapsed()
29 && fPts[0].approximatelyEqual(fPts[3]); in collapsed()
/external/skqp/src/pathops/
DSkPathOpsTSect.cpp37 cPt.approximatelyEqual(fPerpPt) ? "==" : "!=", fPerpT, fPerpPt.fX, fPerpPt.fY); in setPerp()
39 fMatch = cPt.approximatelyEqual(fPerpPt); in setPerp()
569 if (last.approximatelyEqual(work.pointFirst())) { in binarySearchCoin()
597 if (last.approximatelyEqual(fCurve[0])) { in binarySearchCoin()
599 } else if (last.approximatelyEqual(this->pointLast())) { in binarySearchCoin()
602 if (oppPt.approximatelyEqual(opp[0])) { in binarySearchCoin()
604 } else if (oppPt.approximatelyEqual(sect2->pointLast())) { in binarySearchCoin()
1051 finds += perpRayI.pt(pIndex).approximatelyEqual(thisPerp.fPts[1]); in is_parallel()
1058 finds += perpRayI.pt(pIndex).approximatelyEqual(thisPerp.fPts[0]); in is_parallel()
1087 ptMatches += thisRayI.pt(tIndex).approximatelyEqual(thisLine.fPts[lIndex]); in linesIntersect()
[all …]
DSkPathOpsCubic.h28 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]) in collapsed()
29 && fPts[0].approximatelyEqual(fPts[3]); in collapsed()

12