| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | SkReduceOrder.cpp | 137 if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx)
146 if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy)
|
| H A D | SkPathOpsCubic.cpp | 29 if (approximately_equal(lessPt.fX, cubicAtT.fX)
30 && approximately_equal(lessPt.fY, cubicAtT.fY)) {
46 if (approximately_equal(morePt.fX, cubicAtT.fX)
47 && approximately_equal(morePt.fY, cubicAtT.fY)) {
60 } while (!approximately_equal(calcPos, axisIntercept));
|
| H A D | SkDQuadLineIntersection.cpp | 334 if (fIntersections->used() > 0 && approximately_equal((*fIntersections)[1][0], *lineT)) {
|
| H A D | SkDLineIntersection.cpp | 51 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) {
|
| H A D | SkPathOpsQuad.cpp | 80 if (approximately_equal(t[idx2], tValue)) {
|
| H A D | SkOpSegment.cpp | 601 SkASSERT(approximately_equal(xyAtT(newT).fX, pt.fX)
602 && approximately_equal(xyAtT(newT).fY, pt.fY));
1430 bool tsMatch = approximately_equal(span.fT, t);
1431 bool otherTsMatch = approximately_equal(span.fOtherT, otherT);
1451 bool otherTsMatch = approximately_equal(oSpan.fT, otherT);
1452 bool tsMatch = approximately_equal(oSpan.fOtherT, t);
1943 SkASSERT(approximately_equal(testSpan->fT, firstLoopT) +
1944 approximately_equal(testSpan->fT, lastLoopT) == 1);
1945 smallCounts[approximately_equal(testSpan->fT, lastLoopT)]++;
|
| /external/chromium_org/third_party/skia/tests/ |
| H A D | PathOpsCubicReduceOrderTest.cpp | 40 return approximately_equal(cubic[maxX].fX, cubic[minX].fX)
41 && approximately_equal(cubic[maxY].fY, cubic[minY].fY);
|
| H A D | PathOpsAngleIdeas.cpp | 95 if (approximately_equal(t, matchT)) {
240 if (approximately_equal(a1, a2)) {
|
| /external/skia/src/pathops/ |
| H A D | SkPathOpsTypes.h | 155 inline bool approximately_equal(double x, double y) { function
180 return approximately_equal(x, y);
|
| H A D | SkReduceOrder.cpp | 137 if (approximately_zero(sideAx) ? !approximately_equal(sideAx, sideBx)
146 if (approximately_zero(sideAy) ? !approximately_equal(sideAy, sideBy)
|
| H A D | SkPathOpsCubic.cpp | 29 if (approximately_equal(lessPt.fX, cubicAtT.fX)
30 && approximately_equal(lessPt.fY, cubicAtT.fY)) {
46 if (approximately_equal(morePt.fX, cubicAtT.fX)
47 && approximately_equal(morePt.fY, cubicAtT.fY)) {
60 } while (!approximately_equal(calcPos, axisIntercept));
|
| H A D | SkDQuadLineIntersection.cpp | 334 if (fIntersections->used() > 0 && approximately_equal((*fIntersections)[1][0], *lineT)) {
|
| H A D | SkDLineIntersection.cpp | 51 if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) {
|
| H A D | SkPathOpsQuad.cpp | 80 if (approximately_equal(t[idx2], tValue)) {
|
| /external/skia/tests/ |
| H A D | PathOpsCubicReduceOrderTest.cpp | 40 return approximately_equal(cubic[maxX].fX, cubic[minX].fX)
41 && approximately_equal(cubic[maxY].fY, cubic[minY].fY);
|
| H A D | PathOpsAngleIdeas.cpp | 95 if (approximately_equal(t, matchT)) {
240 if (approximately_equal(a1, a2)) {
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | CubicIntersection_Test.cpp | 236 SkASSERT(!approximately_equal(last, tt1));
263 SkASSERT(!approximately_equal(last, tt3));
266 if (approximately_equal(tt3, intersections2.fT[0][pt1])) {
326 // SkASSERT(!approximately_equal(last, tt3));
767 SkASSERT(!approximately_equal(i.fT[0][0], i.fT[1][0]));
|
| H A D | CubicToQuadratics.cpp | 170 if (!approximately_equal(inflectT[start], inflectT[next])) {
|
| H A D | QuarticRoot.cpp | 108 if (approximately_equal(roots[i], 1)) {
|
| H A D | QuadraticUtilities.cpp | 88 if (approximately_equal(t[idx2], tValue)) {
|
| H A D | CubicIntersection.cpp | 144 } else if (cubic1 != cubic2 || !approximately_equal(to1, to2)) {
|
| /external/skia/experimental/Intersection/ |
| H A D | CubicIntersection_Test.cpp | 236 SkASSERT(!approximately_equal(last, tt1));
263 SkASSERT(!approximately_equal(last, tt3));
266 if (approximately_equal(tt3, intersections2.fT[0][pt1])) {
326 // SkASSERT(!approximately_equal(last, tt3));
767 SkASSERT(!approximately_equal(i.fT[0][0], i.fT[1][0]));
|
| H A D | CubicToQuadratics.cpp | 170 if (!approximately_equal(inflectT[start], inflectT[next])) {
|
| H A D | QuarticRoot.cpp | 108 if (approximately_equal(roots[i], 1)) {
|
| H A D | QuadraticUtilities.cpp | 88 if (approximately_equal(t[idx2], tValue)) {
|