| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathWriter.cpp | 40 if (fEmpty && AlmostEqualUlps(fDefer[0], pt1) && AlmostEqualUlps(pt1, pt2)
41 && AlmostEqualUlps(pt2, pt3)) {
115 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX)
116 || !AlmostEqualUlps(fDefer[1].fY, fFirstPt.fY)) {
124 if (fEmpty && AlmostEqualUlps(fDefer[0], pt1) && AlmostEqualUlps(pt1, pt2)) {
|
| SkPathOpsCurve.h | 127 return AlmostEqualUlps(dst[0].fX, dst[1].fX);
134 return AlmostEqualUlps(dst[0].fX, dst[1].fX) && AlmostEqualUlps(dst[1].fX, dst[2].fX);
141 return AlmostEqualUlps(dst[0].fX, dst[1].fX) && AlmostEqualUlps(dst[1].fX, dst[2].fX)
142 && AlmostEqualUlps(dst[2].fX, dst[3].fX);
|
| SkReduceOrder.cpp | 83 if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) {
86 if (AlmostEqualUlps(quad[index].fY, quad[minY].fY)) {
138 : !AlmostEqualUlps(sideAx, sideBx)) {
147 : !AlmostEqualUlps(sideAy, sideBy)) {
|
| SkPathOpsLine.cpp | 86 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
152 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
187 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
|
| SkPathOpsPoint.h | 13 inline bool AlmostEqualUlps(const SkPoint& pt1, const SkPoint& pt2) {
14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
|
| SkPathOpsTypes.h | 26 bool AlmostEqualUlps(float a, float b);
27 inline bool AlmostEqualUlps(double a, double b) {
28 return AlmostEqualUlps(SkDoubleToScalar(a), SkDoubleToScalar(b));
146 // AlmostEqualUlps instead.
|
| SkDLineIntersection.cpp | 92 if (!AlmostEqualUlps(aLen.fX * a[0].fY - aLen.fY * a[0].fX,
177 if (AlmostEqualUlps(min, max) && max - min < fabs(line[0].fX - line[1].fX)) {
265 if (AlmostEqualUlps(min, max)) {
|
| SkDQuadLineIntersection.cpp | 357 if (AlmostEqualUlps(qPt.fX, pt.fX)) {
372 if (AlmostEqualUlps(qPt.fY, pt.fY)) {
|
| SkPathOpsTypes.cpp | 105 bool AlmostEqualUlps(float a, float b) {
|
| SkOpSegment.cpp | 473 while (&span[less + 1] - fTs.begin() > 0 && AlmostEqualUlps(span[less].fPt, span->fPt)) {
511 while (fTs.end() - &span[more - 1] > 1 && AlmostEqualUlps(span[more].fPt, span->fPt)) {
733 SkASSERT(AlmostEqualUlps(*testPt, *oTestPt));
776 SkASSERT(AlmostEqualUlps(*testPt, *oTestPt));
[all...] |
| /external/skia/src/pathops/ |
| SkPathWriter.cpp | 40 if (fEmpty && AlmostEqualUlps(fDefer[0], pt1) && AlmostEqualUlps(pt1, pt2)
41 && AlmostEqualUlps(pt2, pt3)) {
115 if (fEmpty || !AlmostEqualUlps(fDefer[1].fX, fFirstPt.fX)
116 || !AlmostEqualUlps(fDefer[1].fY, fFirstPt.fY)) {
124 if (fEmpty && AlmostEqualUlps(fDefer[0], pt1) && AlmostEqualUlps(pt1, pt2)) {
|
| SkPathOpsCurve.h | 127 return AlmostEqualUlps(dst[0].fX, dst[1].fX);
134 return AlmostEqualUlps(dst[0].fX, dst[1].fX) && AlmostEqualUlps(dst[1].fX, dst[2].fX);
141 return AlmostEqualUlps(dst[0].fX, dst[1].fX) && AlmostEqualUlps(dst[1].fX, dst[2].fX)
142 && AlmostEqualUlps(dst[2].fX, dst[3].fX);
|
| SkReduceOrder.cpp | 83 if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) {
86 if (AlmostEqualUlps(quad[index].fY, quad[minY].fY)) {
138 : !AlmostEqualUlps(sideAx, sideBx)) {
147 : !AlmostEqualUlps(sideAy, sideBy)) {
|
| SkPathOpsLine.cpp | 86 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
152 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
187 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
|
| SkPathOpsPoint.h | 13 inline bool AlmostEqualUlps(const SkPoint& pt1, const SkPoint& pt2) {
14 return AlmostEqualUlps(pt1.fX, pt2.fX) && AlmostEqualUlps(pt1.fY, pt2.fY);
|
| SkPathOpsTypes.h | 26 bool AlmostEqualUlps(float a, float b);
27 inline bool AlmostEqualUlps(double a, double b) {
28 return AlmostEqualUlps(SkDoubleToScalar(a), SkDoubleToScalar(b));
146 // AlmostEqualUlps instead.
|
| SkDLineIntersection.cpp | 92 if (!AlmostEqualUlps(aLen.fX * a[0].fY - aLen.fY * a[0].fX,
177 if (AlmostEqualUlps(min, max) && max - min < fabs(line[0].fX - line[1].fX)) {
265 if (AlmostEqualUlps(min, max)) {
|
| SkDQuadLineIntersection.cpp | 357 if (AlmostEqualUlps(qPt.fX, pt.fX)) {
372 if (AlmostEqualUlps(qPt.fY, pt.fY)) {
|
| SkPathOpsTypes.cpp | 105 bool AlmostEqualUlps(float a, float b) {
|
| SkOpSegment.cpp | 473 while (&span[less + 1] - fTs.begin() > 0 && AlmostEqualUlps(span[less].fPt, span->fPt)) {
511 while (fTs.end() - &span[more - 1] > 1 && AlmostEqualUlps(span[more].fPt, span->fPt)) {
733 SkASSERT(AlmostEqualUlps(*testPt, *oTestPt));
776 SkASSERT(AlmostEqualUlps(*testPt, *oTestPt));
[all...] |
| /external/skia/tests/ |
| PathOpsCubicToQuadsTest.cpp | 58 if (!AlmostEqualUlps(cubic[0].fX, quads[0][0].fX)
59 || !AlmostEqualUlps(cubic[0].fY, quads[0][0].fY)) {
64 if (!AlmostEqualUlps(cubic[3].fX, quads[last][2].fX)
65 || !AlmostEqualUlps(cubic[3].fY, quads[last][2].fY)) {
81 if (!AlmostEqualUlps(cubic[0].fX, quads[0][0].fX)
82 || !AlmostEqualUlps(cubic[0].fY, quads[0][0].fY)) {
87 if (!AlmostEqualUlps(cubic[3].fX, quads[last][2].fX)
88 || !AlmostEqualUlps(cubic[3].fY, quads[last][2].fY)) {
|
| PathOpsLineParametetersTest.cpp | 56 if (AlmostEqualUlps(distSq, normalSquared * answersSq)) {
70 if (AlmostEqualUlps(fabs(normalizedDistance[inner]), answers[index][inner])) {
|
| PathOpsCubicReduceOrderTest.cpp | 228 if ( (!AlmostEqualUlps(reducer.fLine[0].fX, bounds.fLeft)
229 && !AlmostEqualUlps(reducer.fLine[0].fX, bounds.fRight))
230 || (!AlmostEqualUlps(reducer.fLine[0].fY, bounds.fTop)
231 && !AlmostEqualUlps(reducer.fLine[0].fY, bounds.fBottom))
232 || (!AlmostEqualUlps(reducer.fLine[1].fX, bounds.fLeft)
233 && !AlmostEqualUlps(reducer.fLine[1].fX, bounds.fRight))
234 || (!AlmostEqualUlps(reducer.fLine[1].fY, bounds.fTop)
235 && !AlmostEqualUlps(reducer.fLine[1].fY, bounds.fBottom))) {
|
