| /external/skia/tests/ |
| PathOpsConicLineIntersectionTest.cpp | 82 if (!conicXY.approximatelyEqual(lineXY)) {
83 conicXY.approximatelyEqual(lineXY);
86 REPORTER_ASSERT(reporter, conicXY.approximatelyEqual(lineXY));
130 if (!t1.approximatelyEqual(t2)) {
135 if (!t1.approximatelyEqual(lineConicTests[index].expected[0])
137 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) {
|
| PathOpsQuadLineIntersectionTest.cpp | 93 if (!quadXY.approximatelyEqual(lineXY)) {
94 quadXY.approximatelyEqual(lineXY);
97 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY));
138 if (!t1.approximatelyEqual(t2)) {
143 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0])
145 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) {
|
| PathOpsCubicConicIntersectionTest.cpp | 55 if (!xy1.approximatelyEqual(xy2)) {
59 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
| PathOpsDPointTest.cpp | 35 REPORTER_ASSERT(reporter, p.approximatelyEqual(pt));
39 REPORTER_ASSERT(reporter, p.approximatelyEqual(sPt));
|
| PathOpsCubicQuadIntersectionTest.cpp | 79 if (!xy1.approximatelyEqual(xy2)) {
83 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
| PathOpsQuadIntersectionTest.cpp | 43 if (!xy1.approximatelyEqual(xy2)) {
337 if (!xy1.approximatelyEqual(xy2)) {
387 REPORTER_ASSERT(reporter, pt1.approximatelyEqual(pt2));
446 } while (!t1[1].approximatelyEqual(t2[1]));
455 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
461 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
466 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
472 t22 -= t2[1].approximatelyEqual(test) ? -t2Step : t2Step;
|
| PathOpsCubicIntersectionTest.cpp | 59 if (!xy1.approximatelyEqual(xy2)) {
63 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
421 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt));
422 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt));
423 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
508 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
559 } while (!t1[1].approximatelyEqual(t2[1]));
568 t10 += t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
574 t12 -= t1[1].approximatelyEqual(test) ? -t1Step : t1Step;
579 t20 += t2[1].approximatelyEqual(test) ? -t2Step : t2Step
[all...] |
| PathOpsLineIntersectionTest.cpp | 95 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()));
|
| PathOpsCubicLineIntersectionIdeas.cpp | 60 if (cubicAtT.approximatelyEqual(pt)) {
172 if (calcPt.approximatelyEqual(pt)) {
263 SkASSERT_RELEASE(!calcPt.approximatelyEqual(pt));
|
| PathOpsConicIntersectionTest.cpp | 54 SkASSERT(dChopped[cIndex].fPts[pIndex].approximatelyEqual(up));
323 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(iPt));
324 REPORTER_ASSERT(reporter, xy2.approximatelyEqual(iPt));
325 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
| PathOpsCubicLineIntersectionTest.cpp | 150 if (!xy1.approximatelyEqual(xy2)) {
154 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
| PathOpsQuadLineIntersectionThreadedTest.cpp | 61 if (quadXY.approximatelyEqual(lineXY)) {
|
| /external/skia/src/pathops/ |
| SkPathOpsCubic.h | 31 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2])
32 && fPts[0].approximatelyEqual(fPts[3]);
|
| SkPathOpsQuad.h | 29 return fPts[0].approximatelyEqual(fPts[1]) && fPts[0].approximatelyEqual(fPts[2]);
|
| SkPathOpsPoint.h | 133 bool approximatelyEqual(const SkDPoint& a) const {
147 bool approximatelyEqual(const SkPoint& a) const {
150 return approximatelyEqual(dA);
153 static bool ApproximatelyEqual(const SkPoint& a, const SkPoint& b) {
|
| SkReduceOrder.cpp | 22 return 1 + !reduction[0].approximatelyEqual(reduction[1]);
106 return 1 + !reduction[0].approximatelyEqual(reduction[1]);
265 if (SkDPoint::ApproximatelyEqual(a[0], a[1]) && SkDPoint::ApproximatelyEqual(a[0], a[2])
266 && SkDPoint::ApproximatelyEqual(a[0], a[3])) {
|
| SkPathOpsTSect.h | 359 cPt.approximatelyEqual(fPerpPt) ? "==" : "!=", fPerpT, fPerpPt.fX, fPerpPt.fY);
361 fCoincident = cPt.approximatelyEqual(fPerpPt);
896 if (last.approximatelyEqual(work.fPart[0])) {
917 if (last.approximatelyEqual(fCurve[0])) {
919 } else if (last.approximatelyEqual(fCurve[TCurve::kPointLast])) {
922 if (oppPt.approximatelyEqual(opp[0])) {
924 } else if (oppPt.approximatelyEqual(opp[OppCurve::kPointLast])) {
[all...] |
| SkDConicLineIntersection.cpp | 108 SkASSERT(conicPt.approximatelyEqual(linePt));
275 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) {
278 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) {
307 if (conicMidPt.approximatelyEqual(pt)) {
|
| SkDCubicLineIntersection.cpp | 216 if (cubicMidPt.approximatelyEqual(pt)) {
|
| SkDQuadLineIntersection.cpp | 231 if (quadMidPt.approximatelyEqual(pt)) {
380 if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[0].asSkPoint())) {
383 } else if (SkDPoint::ApproximatelyEqual(gridPt, (*fLine)[1].asSkPoint())) {
|
| SkOpAngle.cpp | 247 if (!fCurvePart[SkPathOpsVerbToPoints(this->segment()->verb())].approximatelyEqual(
[all...] |
| SkOpSegment.cpp | [all...] |
