Searched refs:approximatelyEqual (Results 1 - 25 of 48) sorted by relevance

12

/external/skia/tests/
H A DPathOpsQuadLineIntersectionTest.cpp95 if (!quadXY.approximatelyEqual(lineXY)) {
96 quadXY.approximatelyEqual(lineXY);
99 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY));
142 if (!t1.approximatelyEqual(t2)) {
147 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0])
149 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) {
H A DPathOpsDPointTest.cpp35 REPORTER_ASSERT(reporter, p.approximatelyEqual(pt));
39 REPORTER_ASSERT(reporter, p.approximatelyEqual(sPt));
H A DPathOpsConicQuadIntersectionTest.cpp55 if (!xy1.approximatelyEqual(xy2)) {
59 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
H A DPathOpsCubicConicIntersectionTest.cpp59 if (!xy1.approximatelyEqual(xy2)) {
63 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
H A DPathOpsCubicQuadIntersectionTest.cpp83 if (!xy1.approximatelyEqual(xy2)) {
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
H A DPathOpsConicLineIntersectionTest.cpp85 if (!conicXY.approximatelyEqual(lineXY)) {
86 conicXY.approximatelyEqual(lineXY);
89 REPORTER_ASSERT(reporter, conicXY.approximatelyEqual(lineXY));
137 if (!t1.approximatelyEqual(t2)) {
142 if (!t1.approximatelyEqual(lineConicTests[index].expected[0])
144 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) {
H A DPathOpsCubicIntersectionTest.cpp62 if (!xy1.approximatelyEqual(xy2)) {
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
431 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt));
432 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt));
433 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
521 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
575 } while (!t1[1].approximatelyEqual(t2[1]));
584 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
590 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
595 t20 += t2[1].approximatelyEqual(tes
[all...]
H A DPathOpsQuadIntersectionTest.cpp47 if (!xy1.approximatelyEqual(xy2)) {
351 if (!xy1.approximatelyEqual(xy2)) {
405 REPORTER_ASSERT(reporter, pt1.approximatelyEqual(pt2));
466 } while (!t1[1].approximatelyEqual(t2[1]));
475 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
481 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
486 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
492 t22 -= t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
H A DPathOpsLineIntersectionTest.cpp95 if (!result1.approximatelyEqual(result2) && !ts.nearlySame(i)) {
98 if (!result1.approximatelyEqual(result2)) {
101 REPORTER_ASSERT(reporter, result1.approximatelyEqual(result2));
102 REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint()));
/external/skqp/tests/
H A DPathOpsQuadLineIntersectionTest.cpp95 if (!quadXY.approximatelyEqual(lineXY)) {
96 quadXY.approximatelyEqual(lineXY);
99 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY));
142 if (!t1.approximatelyEqual(t2)) {
147 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0])
149 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) {
H A DPathOpsDPointTest.cpp35 REPORTER_ASSERT(reporter, p.approximatelyEqual(pt));
39 REPORTER_ASSERT(reporter, p.approximatelyEqual(sPt));
H A DPathOpsConicQuadIntersectionTest.cpp55 if (!xy1.approximatelyEqual(xy2)) {
59 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
H A DPathOpsCubicConicIntersectionTest.cpp59 if (!xy1.approximatelyEqual(xy2)) {
63 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
H A DPathOpsCubicQuadIntersectionTest.cpp83 if (!xy1.approximatelyEqual(xy2)) {
87 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
H A DPathOpsConicLineIntersectionTest.cpp85 if (!conicXY.approximatelyEqual(lineXY)) {
86 conicXY.approximatelyEqual(lineXY);
89 REPORTER_ASSERT(reporter, conicXY.approximatelyEqual(lineXY));
137 if (!t1.approximatelyEqual(t2)) {
142 if (!t1.approximatelyEqual(lineConicTests[index].expected[0])
144 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) {
H A DPathOpsCubicIntersectionTest.cpp62 if (!xy1.approximatelyEqual(xy2)) {
66 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
430 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt));
431 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt));
432 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
520 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
574 } while (!t1[1].approximatelyEqual(t2[1]));
583 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
589 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
594 t20 += t2[1].approximatelyEqual(tes
[all...]
H A DPathOpsQuadIntersectionTest.cpp47 if (!xy1.approximatelyEqual(xy2)) {
351 if (!xy1.approximatelyEqual(xy2)) {
405 REPORTER_ASSERT(reporter, pt1.approximatelyEqual(pt2));
466 } while (!t1[1].approximatelyEqual(t2[1]));
475 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
481 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
486 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
492 t22 -= t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
H A DPathOpsLineIntersectionTest.cpp95 if (!result1.approximatelyEqual(result2) && !ts.nearlySame(i)) {
98 if (!result1.approximatelyEqual(result2)) {
101 REPORTER_ASSERT(reporter, result1.approximatelyEqual(result2));
102 REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint()));
/external/skia/src/pathops/
H A DSkPathOpsCubic.h27 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2])
28 && fPts[0].approximatelyEqual(fPts[3]);
H A DSkPathOpsQuad.h29 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]);
H A DSkPathOpsPoint.h167 bool approximatelyEqual(const SkDPoint& a) const { function in struct:SkDPoint
181 bool approximatelyEqual(const SkPoint& a) const { function in struct:SkDPoint
184 return approximatelyEqual(dA);
/external/skqp/src/pathops/
H A DSkPathOpsCubic.h27 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2])
28 && fPts[0].approximatelyEqual(fPts[3]);
H A DSkPathOpsQuad.h29 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]);
/external/skia/src/core/
H A DSkEdgeBuilder.cpp62 static inline bool approximatelyEqual(SkFixed a, SkFixed b) { function
78 if (approximatelyEqual(edge->fUpperY, last->fLowerY)) {
84 if (approximatelyEqual(edge->fUpperY, last->fUpperY)) {
85 if (approximatelyEqual(edge->fLowerY, last->fLowerY)) {
99 if (approximatelyEqual(edge->fLowerY, last->fLowerY)) {
/external/skqp/src/core/
H A DSkEdgeBuilder.cpp62 static inline bool approximatelyEqual(SkFixed a, SkFixed b) { function
78 if (approximatelyEqual(edge->fUpperY, last->fLowerY)) {
84 if (approximatelyEqual(edge->fUpperY, last->fUpperY)) {
85 if (approximatelyEqual(edge->fLowerY, last->fLowerY)) {
99 if (approximatelyEqual(edge->fLowerY, last->fLowerY)) {

Completed in 739 milliseconds

12