These tests stress pathops by describing the union of circle-like paths that have tiny line segments embedded and double back to create near-coincident conditions.
The fixes include - detect when finding the active top loops between two possible answers - preflight chasing winding to ensure answer is consistent - binary search more often when quadratic intersection fails - add more failure paths when an intersect is missed While this fixes the chrome bug, reenabling path ops in svg should be deferred until additional fixes are landed. TBR= BUG=421132 Committed: https://skia.googlesource.com/skia/+/6f726addf3178b01949bb389ef83cf14a1d7b6b2 Review URL: https://codereview.chromium.org/633393002
This commit is contained in:
caryclark
Commit bot
parent
b1cff03325
commit
65f553182a
@ -33,6 +33,7 @@
|
||||
'../tests/PathOpsDTriangleTest.cpp',
|
||||
'../tests/PathOpsDVectorTest.cpp',
|
||||
'../tests/PathOpsExtendedTest.cpp',
|
||||
'../tests/PathOpsFuzz763Test.cpp',
|
||||
'../tests/PathOpsInverseTest.cpp',
|
||||
'../tests/PathOpsLineIntersectionTest.cpp',
|
||||
'../tests/PathOpsLineParametetersTest.cpp',
|
||||
|
||||
@ -307,6 +307,7 @@ bool AddIntersectTs(SkOpContour* test, SkOpContour* next) {
|
||||
}
|
||||
case SkIntersectionHelper::kQuad_Segment: {
|
||||
pts = ts.quadQuad(wt.pts(), wn.pts());
|
||||
ts.alignQuadPts(wt.pts(), wn.pts());
|
||||
debugShowQuadIntersection(pts, wt, wn, ts);
|
||||
break;
|
||||
}
|
||||
@ -366,8 +367,7 @@ bool AddIntersectTs(SkOpContour* test, SkOpContour* next) {
|
||||
if (wt.addCoincident(wn, ts, swap)) {
|
||||
continue;
|
||||
}
|
||||
ts.cleanUpCoincidence(); // prefer (t == 0 or t == 1)
|
||||
pts = 1;
|
||||
pts = ts.cleanUpCoincidence(); // prefer (t == 0 or t == 1)
|
||||
} else if (wn.segmentType() >= SkIntersectionHelper::kQuad_Segment
|
||||
&& wt.segmentType() >= SkIntersectionHelper::kQuad_Segment
|
||||
&& ts.isCoincident(0)) {
|
||||
@ -375,8 +375,7 @@ bool AddIntersectTs(SkOpContour* test, SkOpContour* next) {
|
||||
if (wt.addCoincident(wn, ts, swap)) {
|
||||
continue;
|
||||
}
|
||||
ts.cleanUpCoincidence(); // prefer (t == 0 or t == 1)
|
||||
pts = 1;
|
||||
pts = ts.cleanUpCoincidence(); // prefer (t == 0 or t == 1)
|
||||
}
|
||||
}
|
||||
if (pts >= 2) {
|
||||
@ -387,8 +386,7 @@ bool AddIntersectTs(SkOpContour* test, SkOpContour* next) {
|
||||
&& wn.isPartial(ts[!swap][pt], ts[!swap][pt + 1], point, next)) {
|
||||
if (!wt.addPartialCoincident(wn, ts, pt, swap)) {
|
||||
// remove extra point if two map to same float values
|
||||
ts.cleanUpCoincidence(); // prefer (t == 0 or t == 1)
|
||||
pts = 1;
|
||||
pts = ts.cleanUpCoincidence(); // prefer (t == 0 or t == 1)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@ -109,12 +109,14 @@ static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDC
|
||||
__FUNCTION__, t1Start, t1, t2Start, t2);
|
||||
SkIntersections xlocals;
|
||||
xlocals.allowNear(false);
|
||||
xlocals.allowFlatMeasure(true);
|
||||
intersectWithOrder(s1.fQuad, o1, s2.fQuad, o2, xlocals);
|
||||
SkDebugf(" xlocals.fUsed=%d\n", xlocals.used());
|
||||
}
|
||||
#endif
|
||||
SkIntersections locals;
|
||||
locals.allowNear(false);
|
||||
locals.allowFlatMeasure(true);
|
||||
intersectWithOrder(s1.fQuad, o1, s2.fQuad, o2, locals);
|
||||
int tCount = locals.used();
|
||||
for (int tIdx = 0; tIdx < tCount; ++tIdx) {
|
||||
@ -296,6 +298,7 @@ bool SkIntersections::cubicExactEnd(const SkDCubic& cubic1, bool start, const Sk
|
||||
tmpLine[1].fY -= cubic2[2 - start].fX - cubic2[t1Index].fX;
|
||||
SkIntersections impTs;
|
||||
impTs.allowNear(false);
|
||||
impTs.allowFlatMeasure(true);
|
||||
impTs.intersectRay(cubic1, tmpLine);
|
||||
for (int index = 0; index < impTs.used(); ++index) {
|
||||
SkDPoint realPt = impTs.pt(index);
|
||||
@ -556,6 +559,7 @@ int SkIntersections::intersect(const SkDCubic& c1, const SkDCubic& c2) {
|
||||
}
|
||||
SkIntersections i;
|
||||
i.fAllowNear = false;
|
||||
i.fFlatMeasure = true;
|
||||
i.fMax = 9;
|
||||
::intersect(c1, 0, 1, c2, 0, 1, 1, i);
|
||||
int compCount = i.used();
|
||||
@ -662,7 +666,7 @@ int SkIntersections::intersect(const SkDCubic& c1, const SkDCubic& c2) {
|
||||
// OPTIMIZATION If this is a common use case, optimize by duplicating
|
||||
// the intersect 3 loop to avoid the promotion / demotion code
|
||||
int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) {
|
||||
fMax = 6;
|
||||
fMax = 7;
|
||||
SkDCubic up = quad.toCubic();
|
||||
(void) intersect(cubic, up);
|
||||
return used();
|
||||
@ -684,7 +688,9 @@ int SkIntersections::intersect(const SkDCubic& c) {
|
||||
// OPTIMIZATION: could quick reject if neither end point tangent ray intersected the line
|
||||
// segment formed by the opposite end point to the control point
|
||||
(void) intersect(c, c);
|
||||
if (used() > 0) {
|
||||
if (used() > 1) {
|
||||
fUsed = 0;
|
||||
} else if (used() > 0) {
|
||||
if (approximately_equal_double(fT[0][0], fT[1][0])) {
|
||||
fUsed = 0;
|
||||
} else {
|
||||
|
||||
@ -26,19 +26,24 @@ SkDPoint SkIntersections::Line(const SkDLine& a, const SkDLine& b) {
|
||||
return p;
|
||||
}
|
||||
|
||||
void SkIntersections::cleanUpCoincidence() {
|
||||
SkASSERT(fUsed == 2);
|
||||
// both t values are good
|
||||
bool startMatch = fT[0][0] == 0 && (fT[1][0] == 0 || fT[1][0] == 1);
|
||||
bool endMatch = fT[0][1] == 1 && (fT[1][1] == 0 || fT[1][1] == 1);
|
||||
if (startMatch || endMatch) {
|
||||
removeOne(startMatch);
|
||||
return;
|
||||
}
|
||||
// either t value is good
|
||||
bool pStartMatch = fT[0][0] == 0 || fT[1][0] == 0 || fT[1][0] == 1;
|
||||
bool pEndMatch = fT[0][1] == 1 || fT[1][1] == 0 || fT[1][1] == 1;
|
||||
removeOne(pStartMatch || !pEndMatch);
|
||||
int SkIntersections::cleanUpCoincidence() {
|
||||
do {
|
||||
int last = fUsed - 1;
|
||||
for (int index = 0; index < last; ++index) {
|
||||
if (fT[0][index] == fT[0][index + 1]) {
|
||||
removeOne(index + (int) (fT[1][index] == 0 || fT[1][index] == 1));
|
||||
goto tryAgain;
|
||||
}
|
||||
}
|
||||
for (int index = 0; index < last; ++index) {
|
||||
if (fT[1][index] == fT[1][index + 1]) {
|
||||
removeOne(index + (int) (fT[0][index] == 0 || fT[0][index] == 1));
|
||||
goto tryAgain;
|
||||
}
|
||||
}
|
||||
return fUsed;
|
||||
tryAgain: ;
|
||||
} while (true);
|
||||
}
|
||||
|
||||
void SkIntersections::cleanUpParallelLines(bool parallel) {
|
||||
|
||||
@ -73,6 +73,7 @@ static int addValidRoots(const double roots[4], const int count, double valid[4]
|
||||
} else if (approximately_greater_than_one(t)) {
|
||||
t = 1;
|
||||
}
|
||||
SkASSERT(t >= 0 && t <= 1);
|
||||
valid[result++] = t;
|
||||
}
|
||||
return result;
|
||||
@ -242,10 +243,18 @@ static double flat_measure(const SkDQuad& q) {
|
||||
|
||||
// FIXME ? should this measure both and then use the quad that is the flattest as the line?
|
||||
static bool is_linear(const SkDQuad& q1, const SkDQuad& q2, SkIntersections* i) {
|
||||
double measure = flat_measure(q1);
|
||||
// OPTIMIZE: (get rid of sqrt) use approximately_zero
|
||||
if (!approximately_zero_sqrt(measure)) {
|
||||
return false;
|
||||
if (i->flatMeasure()) {
|
||||
// for backward compatibility, use the old method when called from cubics
|
||||
// FIXME: figure out how to fix cubics when it calls the new path
|
||||
double measure = flat_measure(q1);
|
||||
// OPTIMIZE: (get rid of sqrt) use approximately_zero
|
||||
if (!approximately_zero_sqrt(measure)) { // approximately_zero_sqrt
|
||||
return false;
|
||||
}
|
||||
} else {
|
||||
if (!q1.isLinear(0, 2)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return is_linear_inner(q1, 0, 1, q2, 0, 1, i, NULL);
|
||||
}
|
||||
@ -305,6 +314,16 @@ static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1
|
||||
SkDebugf("%s t1=%1.9g t2=%1.9g (%1.9g,%1.9g) == (%1.9g,%1.9g)\n", __FUNCTION__,
|
||||
t1Seed, t2Seed, t1[1].fX, t1[1].fY, t2[1].fX, t2[1].fY);
|
||||
#endif
|
||||
if (*t1Seed < 0) {
|
||||
*t1Seed = 0;
|
||||
} else if (*t1Seed > 1) {
|
||||
*t1Seed = 1;
|
||||
}
|
||||
if (*t2Seed < 0) {
|
||||
*t2Seed = 0;
|
||||
} else if (*t2Seed > 1) {
|
||||
*t2Seed = 1;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep));
|
||||
@ -398,11 +417,13 @@ static void lookNearEnd(const SkDQuad& q1, const SkDQuad& q2, int testT,
|
||||
|
||||
int SkIntersections::intersect(const SkDQuad& q1, const SkDQuad& q2) {
|
||||
fMax = 4;
|
||||
bool exactMatch = false;
|
||||
// if the quads share an end point, check to see if they overlap
|
||||
for (int i1 = 0; i1 < 3; i1 += 2) {
|
||||
for (int i2 = 0; i2 < 3; i2 += 2) {
|
||||
if (q1[i1].asSkPoint() == q2[i2].asSkPoint()) {
|
||||
insert(i1 >> 1, i2 >> 1, q1[i1]);
|
||||
exactMatch = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -469,6 +490,7 @@ int SkIntersections::intersect(const SkDQuad& q1, const SkDQuad& q2) {
|
||||
int rootCount = findRoots(i2, q1, roots1, useCubic, flip1, 0);
|
||||
// OPTIMIZATION: could short circuit here if all roots are < 0 or > 1
|
||||
double roots1Copy[4];
|
||||
SkDEBUGCODE(sk_bzero(roots1Copy, sizeof(roots1Copy)));
|
||||
int r1Count = addValidRoots(roots1, rootCount, roots1Copy);
|
||||
SkDPoint pts1[4];
|
||||
for (index = 0; index < r1Count; ++index) {
|
||||
@ -482,12 +504,14 @@ int SkIntersections::intersect(const SkDQuad& q1, const SkDQuad& q2) {
|
||||
for (index = 0; index < r2Count; ++index) {
|
||||
pts2[index] = q2.ptAtT(roots2Copy[index]);
|
||||
}
|
||||
bool triedBinary = false;
|
||||
if (r1Count == r2Count && r1Count <= 1) {
|
||||
if (r1Count == 1 && used() == 0) {
|
||||
if (pts1[0].approximatelyEqual(pts2[0])) {
|
||||
insert(roots1Copy[0], roots2Copy[0], pts1[0]);
|
||||
} else {
|
||||
// find intersection by chasing t
|
||||
triedBinary = true;
|
||||
if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
|
||||
insert(roots1Copy[0], roots2Copy[0], pts1[0]);
|
||||
}
|
||||
@ -528,7 +552,18 @@ int SkIntersections::intersect(const SkDQuad& q1, const SkDQuad& q2) {
|
||||
}
|
||||
}
|
||||
if (r1Count && r2Count && !foundSomething) {
|
||||
if (exactMatch) {
|
||||
SkASSERT(fUsed > 0);
|
||||
return fUsed;
|
||||
}
|
||||
relaxed_is_linear(&q1, 0, 1, &q2, 0, 1, this);
|
||||
if (fUsed) {
|
||||
return fUsed;
|
||||
}
|
||||
// maybe the curves are nearly coincident
|
||||
if (!triedBinary && binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
|
||||
insert(roots1Copy[0], roots2Copy[0], pts1[0]);
|
||||
}
|
||||
return fUsed;
|
||||
}
|
||||
int used = 0;
|
||||
@ -553,3 +588,30 @@ int SkIntersections::intersect(const SkDQuad& q1, const SkDQuad& q2) {
|
||||
} while (++used < r1Count);
|
||||
return fUsed;
|
||||
}
|
||||
|
||||
void SkIntersections::alignQuadPts(const SkPoint q1[3], const SkPoint q2[3]) {
|
||||
for (int index = 0; index < used(); ++index) {
|
||||
const SkPoint result = pt(index).asSkPoint();
|
||||
if (q1[0] == result || q1[2] == result || q2[0] == result || q2[2] == result) {
|
||||
continue;
|
||||
}
|
||||
if (SkDPoint::ApproximatelyEqual(q1[0], result)) {
|
||||
fPt[index].set(q1[0]);
|
||||
// SkASSERT(way_roughly_zero(fT[0][index])); // this value can be bigger than way rough
|
||||
fT[0][index] = 0;
|
||||
} else if (SkDPoint::ApproximatelyEqual(q1[2], result)) {
|
||||
fPt[index].set(q1[2]);
|
||||
// SkASSERT(way_roughly_equal(fT[0][index], 1));
|
||||
fT[0][index] = 1;
|
||||
}
|
||||
if (SkDPoint::ApproximatelyEqual(q2[0], result)) {
|
||||
fPt[index].set(q2[0]);
|
||||
// SkASSERT(way_roughly_zero(fT[1][index]));
|
||||
fT[1][index] = 0;
|
||||
} else if (SkDPoint::ApproximatelyEqual(q2[2], result)) {
|
||||
fPt[index].set(q2[2]);
|
||||
// SkASSERT(way_roughly_equal(fT[1][index], 1));
|
||||
fT[1][index] = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@ -79,6 +79,8 @@ int SkIntersections::insert(double one, double two, const SkDPoint& pt) {
|
||||
|| (precisely_equal(one, 1) && !precisely_equal(oldOne, 1))
|
||||
|| (precisely_zero(two) && !precisely_zero(oldTwo))
|
||||
|| (precisely_equal(two, 1) && !precisely_equal(oldTwo, 1))) {
|
||||
SkASSERT(one >= 0 && one <= 1);
|
||||
SkASSERT(two >= 0 && two <= 1);
|
||||
fT[0][index] = one;
|
||||
fT[1][index] = two;
|
||||
fPt[index] = pt;
|
||||
@ -111,6 +113,8 @@ int SkIntersections::insert(double one, double two, const SkDPoint& pt) {
|
||||
fIsCoincident[1] += fIsCoincident[1] & clearMask;
|
||||
}
|
||||
fPt[index] = pt;
|
||||
SkASSERT(one >= 0 && one <= 1);
|
||||
SkASSERT(two >= 0 && two <= 1);
|
||||
fT[0][index] = one;
|
||||
fT[1][index] = two;
|
||||
++fUsed;
|
||||
@ -171,7 +175,7 @@ void SkIntersections::removeOne(int index) {
|
||||
memmove(&fPt2[index], &fPt2[index + 1], sizeof(fPt2[0]) * remaining);
|
||||
memmove(&fT[0][index], &fT[0][index + 1], sizeof(fT[0][0]) * remaining);
|
||||
memmove(&fT[1][index], &fT[1][index + 1], sizeof(fT[1][0]) * remaining);
|
||||
SkASSERT(fIsCoincident[0] == 0);
|
||||
// SkASSERT(fIsCoincident[0] == 0);
|
||||
int coBit = fIsCoincident[0] & (1 << index);
|
||||
fIsCoincident[0] -= ((fIsCoincident[0] >> 1) & ~((1 << index) - 1)) + coBit;
|
||||
SkASSERT(!(coBit ^ (fIsCoincident[1] & (1 << index))));
|
||||
|
||||
@ -16,6 +16,7 @@ class SkIntersections {
|
||||
public:
|
||||
SkIntersections()
|
||||
: fSwap(0)
|
||||
, fFlatMeasure(false)
|
||||
#ifdef SK_DEBUG
|
||||
, fDepth(0)
|
||||
#endif
|
||||
@ -39,6 +40,10 @@ public:
|
||||
};
|
||||
TArray operator[](int n) const { return TArray(fT[n]); }
|
||||
|
||||
void allowFlatMeasure(bool flatAllowed) {
|
||||
fFlatMeasure = flatAllowed;
|
||||
}
|
||||
|
||||
void allowNear(bool nearAllowed) {
|
||||
fAllowNear = nearAllowed;
|
||||
}
|
||||
@ -88,10 +93,14 @@ public:
|
||||
cubic.set(a);
|
||||
SkDQuad quad;
|
||||
quad.set(b);
|
||||
fMax = 6;
|
||||
fMax = 7;
|
||||
return intersect(cubic, quad);
|
||||
}
|
||||
|
||||
bool flatMeasure() const {
|
||||
return fFlatMeasure;
|
||||
}
|
||||
|
||||
bool hasT(double t) const {
|
||||
SkASSERT(t == 0 || t == 1);
|
||||
return fUsed > 0 && (t == 0 ? fT[0][0] == 0 : fT[0][fUsed - 1] == 1);
|
||||
@ -201,7 +210,7 @@ public:
|
||||
bool swapped() const {
|
||||
return fSwap;
|
||||
}
|
||||
|
||||
|
||||
int used() const {
|
||||
return fUsed;
|
||||
}
|
||||
@ -214,8 +223,9 @@ public:
|
||||
SkASSERT(++fDepth < 16);
|
||||
}
|
||||
|
||||
void alignQuadPts(const SkPoint a[3], const SkPoint b[3]);
|
||||
void append(const SkIntersections& );
|
||||
void cleanUpCoincidence();
|
||||
int cleanUpCoincidence();
|
||||
int coincidentUsed() const;
|
||||
void cubicInsert(double one, double two, const SkDPoint& pt, const SkDCubic& c1,
|
||||
const SkDCubic& c2);
|
||||
@ -282,6 +292,7 @@ private:
|
||||
unsigned char fMax;
|
||||
bool fAllowNear;
|
||||
bool fSwap;
|
||||
bool fFlatMeasure; // backwards-compatibility when cubics uses quad intersection
|
||||
#ifdef SK_DEBUG
|
||||
int fDepth;
|
||||
#endif
|
||||
|
||||
@ -409,7 +409,12 @@ bool SkOpAngle::endsIntersect(const SkOpAngle& rh) const {
|
||||
for (int index = 0; index < 2; ++index) {
|
||||
const SkOpSegment& segment = index ? *rh.fSegment : *fSegment;
|
||||
SkIntersections i;
|
||||
(*CurveIntersectRay[index ? rPts : lPts])(segment.pts(), rays[index], &i);
|
||||
int cPts = index ? rPts : lPts;
|
||||
(*CurveIntersectRay[cPts])(segment.pts(), rays[index], &i);
|
||||
// if the curve is a line, then the line and the ray intersect only at their crossing
|
||||
if (cPts == 1) { // line
|
||||
continue;
|
||||
}
|
||||
// SkASSERT(i.used() >= 1);
|
||||
// if (i.used() <= 1) {
|
||||
// continue;
|
||||
@ -657,7 +662,7 @@ void SkOpAngle::insert(SkOpAngle* angle) {
|
||||
}
|
||||
SkOpAngle* next = fNext;
|
||||
if (next->fNext == this) {
|
||||
if (angle->overlap(*this)) {
|
||||
if (angle->overlap(*this)) { // angles are essentially coincident
|
||||
return;
|
||||
}
|
||||
if (singleton || angle->after(this)) {
|
||||
@ -777,7 +782,7 @@ bool SkOpAngle::merge(SkOpAngle* angle) {
|
||||
working = next;
|
||||
} while (working != angle);
|
||||
// it's likely that a pair of the angles are unorderable
|
||||
#if DEBUG_ANGLE
|
||||
#if 0 && DEBUG_ANGLE
|
||||
SkOpAngle* last = angle;
|
||||
working = angle->fNext;
|
||||
do {
|
||||
|
||||
@ -50,6 +50,14 @@ public:
|
||||
|
||||
SkOpAngle* previous() const;
|
||||
|
||||
int sectorEnd() const {
|
||||
return fSectorEnd;
|
||||
}
|
||||
|
||||
int sectorStart() const {
|
||||
return fSectorStart;
|
||||
}
|
||||
|
||||
void set(const SkOpSegment* segment, int start, int end);
|
||||
|
||||
void setLastMarked(SkOpSpan* marked) {
|
||||
|
||||
@ -13,7 +13,7 @@ bool SkOpContour::addCoincident(int index, SkOpContour* other, int otherIndex,
|
||||
const SkIntersections& ts, bool swap) {
|
||||
SkPoint pt0 = ts.pt(0).asSkPoint();
|
||||
SkPoint pt1 = ts.pt(1).asSkPoint();
|
||||
if (pt0 == pt1) {
|
||||
if (pt0 == pt1 || ts[0][0] == ts[0][1] || ts[1][0] == ts[1][1]) {
|
||||
// FIXME: one could imagine a case where it would be incorrect to ignore this
|
||||
// suppose two self-intersecting cubics overlap to be coincident --
|
||||
// this needs to check that by some measure the t values are far enough apart
|
||||
|
||||
@ -127,9 +127,9 @@ public:
|
||||
}
|
||||
}
|
||||
|
||||
void checkEnds() {
|
||||
bool checkEnds() {
|
||||
if (!fContainsCurves) {
|
||||
return;
|
||||
return true;
|
||||
}
|
||||
int segmentCount = fSegments.count();
|
||||
for (int sIndex = 0; sIndex < segmentCount; ++sIndex) {
|
||||
@ -140,8 +140,11 @@ public:
|
||||
if (segment->done()) {
|
||||
continue; // likely coincident, nothing to do
|
||||
}
|
||||
segment->checkEnds();
|
||||
if (!segment->checkEnds()) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
void checkMultiples() {
|
||||
|
||||
@ -160,6 +160,10 @@ next:
|
||||
bool SkOpSegment::activeOp(int index, int endIndex, int xorMiMask, int xorSuMask, SkPathOp op) {
|
||||
int sumMiWinding = updateWinding(endIndex, index);
|
||||
int sumSuWinding = updateOppWinding(endIndex, index);
|
||||
#if DEBUG_LIMIT_WIND_SUM
|
||||
SkASSERT(abs(sumMiWinding) <= DEBUG_LIMIT_WIND_SUM);
|
||||
SkASSERT(abs(sumSuWinding) <= DEBUG_LIMIT_WIND_SUM);
|
||||
#endif
|
||||
if (fOperand) {
|
||||
SkTSwap<int>(sumMiWinding, sumSuWinding);
|
||||
}
|
||||
@ -617,6 +621,11 @@ int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) {
|
||||
if ((span->fDone = newT == 1)) {
|
||||
++fDoneSpans;
|
||||
}
|
||||
setSpanFlags(pt, newT, span);
|
||||
return insertedAt;
|
||||
}
|
||||
|
||||
void SkOpSegment::setSpanFlags(const SkPoint& pt, double newT, SkOpSpan* span) {
|
||||
int less = -1;
|
||||
// FIXME: note that this relies on spans being a continguous array
|
||||
// find range of spans with nearly the same point as this one
|
||||
@ -652,10 +661,10 @@ int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) {
|
||||
--more;
|
||||
}
|
||||
if (less == more) {
|
||||
return insertedAt;
|
||||
return;
|
||||
}
|
||||
if (precisely_negative(span[more].fT - span[less].fT)) {
|
||||
return insertedAt;
|
||||
return;
|
||||
}
|
||||
// if the total range of t values is big enough, mark all tiny
|
||||
bool tiny = span[less].fPt == span[more].fPt;
|
||||
@ -668,7 +677,80 @@ int SkOpSegment::addT(SkOpSegment* other, const SkPoint& pt, double newT) {
|
||||
++fDoneSpans;
|
||||
}
|
||||
} while (++index < more);
|
||||
return insertedAt;
|
||||
return;
|
||||
}
|
||||
|
||||
void SkOpSegment::resetSpanFlags() {
|
||||
fSmall = fTiny = false;
|
||||
fDoneSpans = 0;
|
||||
int start = 0;
|
||||
int last = this->count() - 1;
|
||||
do {
|
||||
SkOpSpan* startSpan = &this->fTs[start];
|
||||
double startT = startSpan->fT;
|
||||
startSpan->fSmall = startSpan->fTiny = false; // sets range initial
|
||||
bool terminus = startT == 1;
|
||||
if ((startSpan->fDone = !startSpan->fWindValue | terminus)) {
|
||||
++fDoneSpans;
|
||||
}
|
||||
++start; // range initial + 1
|
||||
if (terminus) {
|
||||
continue;
|
||||
}
|
||||
const SkPoint& pt = startSpan->fPt;
|
||||
int end = start; // range initial + 1
|
||||
while (end <= last) {
|
||||
const SkOpSpan& endSpan = this->span(end);
|
||||
if (!AlmostEqualUlps(endSpan.fPt, pt)) {
|
||||
break;
|
||||
}
|
||||
if (fVerb == SkPath::kCubic_Verb) {
|
||||
double tMid = (startSpan->fT + endSpan.fT) / 2;
|
||||
SkDPoint midEndPt = dcubic_xy_at_t(fPts, tMid);
|
||||
if (!midEndPt.approximatelyEqual(xyAtT(startSpan))) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
++end;
|
||||
}
|
||||
if (start == end) { // end == range final + 1
|
||||
continue;
|
||||
}
|
||||
while (--end >= start) { // end == range final
|
||||
const SkOpSpan& endSpan = this->span(end);
|
||||
const SkOpSpan& priorSpan = this->span(end - 1);
|
||||
if (endSpan.fPt != priorSpan.fPt || endSpan.fT != priorSpan.fT) {
|
||||
break; // end == range final + 1
|
||||
}
|
||||
}
|
||||
if (end < start) { // end == range final + 1
|
||||
continue;
|
||||
}
|
||||
int index = start - 1; // index == range initial
|
||||
start = end; // start = range final + 1
|
||||
const SkOpSpan& nextSpan = this->span(end);
|
||||
if (precisely_negative(nextSpan.fT - startSpan->fT)) {
|
||||
while (++index < end) {
|
||||
startSpan = &this->fTs[index];
|
||||
startSpan->fSmall = startSpan->fTiny = false; // sets range initial + 1
|
||||
if ((startSpan->fDone = !startSpan->fWindValue)) {
|
||||
++fDoneSpans;
|
||||
}
|
||||
}
|
||||
continue;
|
||||
}
|
||||
if (!startSpan->fWindValue) {
|
||||
--fDoneSpans; // added back below
|
||||
}
|
||||
bool tiny = nextSpan.fPt == startSpan->fPt;
|
||||
do {
|
||||
fSmall = startSpan->fSmall = true; // sets range initial
|
||||
fTiny |= startSpan->fTiny = tiny;
|
||||
startSpan->fDone = true;
|
||||
++fDoneSpans;
|
||||
startSpan = &this->fTs[++index];
|
||||
} while (index < end); // loop through tiny small range end (last)
|
||||
} while (start <= last);
|
||||
}
|
||||
|
||||
// set spans from start to end to decrement by one
|
||||
@ -776,6 +858,7 @@ void SkOpSegment::addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpS
|
||||
break;
|
||||
}
|
||||
}
|
||||
oFoundEnd = endPt == oTest->fPt;
|
||||
do {
|
||||
SkASSERT(originalWindValue == oTest->fWindValue);
|
||||
if (decrement) {
|
||||
@ -970,6 +1053,151 @@ void SkOpSegment::alignMultiples(SkTDArray<AlignedSpan>* alignedArray) {
|
||||
debugValidate();
|
||||
}
|
||||
|
||||
void SkOpSegment::alignRange(int lower, int upper,
|
||||
const SkOpSegment* other, int oLower, int oUpper) {
|
||||
for (int oIndex = oLower; oIndex <= oUpper; ++oIndex) {
|
||||
const SkOpSpan& oSpan = other->span(oIndex);
|
||||
const SkOpSegment* oOther = oSpan.fOther;
|
||||
if (oOther == this) {
|
||||
continue;
|
||||
}
|
||||
SkOpSpan* matchSpan;
|
||||
int matchIndex;
|
||||
const SkOpSpan* refSpan;
|
||||
for (int iIndex = lower; iIndex <= upper; ++iIndex) {
|
||||
const SkOpSpan& iSpan = this->span(iIndex);
|
||||
const SkOpSegment* iOther = iSpan.fOther;
|
||||
if (iOther == other) {
|
||||
continue;
|
||||
}
|
||||
if (iOther == oOther) {
|
||||
goto nextI;
|
||||
}
|
||||
}
|
||||
{
|
||||
// oSpan does not have a match in this
|
||||
int iCount = this->count();
|
||||
const SkOpSpan* iMatch = NULL;
|
||||
double iMatchTDiff;
|
||||
matchIndex = -1;
|
||||
for (int iIndex = 0; iIndex < iCount; ++iIndex) {
|
||||
const SkOpSpan& iSpan = this->span(iIndex);
|
||||
const SkOpSegment* iOther = iSpan.fOther;
|
||||
if (iOther != oOther) {
|
||||
continue;
|
||||
}
|
||||
double testTDiff = fabs(iSpan.fOtherT - oSpan.fOtherT);
|
||||
if (!iMatch || testTDiff < iMatchTDiff) {
|
||||
matchIndex = iIndex;
|
||||
iMatch = &iSpan;
|
||||
iMatchTDiff = testTDiff;
|
||||
}
|
||||
}
|
||||
if (matchIndex < 0) {
|
||||
continue; // the entry is missing, & will be picked up later (FIXME: fix it here?)
|
||||
}
|
||||
matchSpan = &this->fTs[matchIndex];
|
||||
refSpan = &this->span(lower);
|
||||
if (!SkDPoint::ApproximatelyEqual(matchSpan->fPt, refSpan->fPt)) {
|
||||
goto nextI;
|
||||
}
|
||||
if (matchIndex != lower - 1 && matchIndex != upper + 1) {
|
||||
// the consecutive spans need to be rearranged to get the missing one close
|
||||
continue; // FIXME: more work to do
|
||||
}
|
||||
}
|
||||
{
|
||||
this->fixOtherTIndex();
|
||||
SkScalar newT;
|
||||
if (matchSpan->fT != 0 && matchSpan->fT != 1) {
|
||||
newT = matchSpan->fT = refSpan->fT;
|
||||
matchSpan->fOther->fTs[matchSpan->fOtherIndex].fOtherT = refSpan->fT;
|
||||
} else { // leave span at the start or end there and adjust the neighbors
|
||||
newT = matchSpan->fT;
|
||||
for (int iIndex = lower; iIndex <= upper; ++iIndex) {
|
||||
matchSpan = &this->fTs[iIndex];
|
||||
matchSpan->fT = newT;
|
||||
matchSpan->fOther->fTs[matchSpan->fOtherIndex].fOtherT = newT;
|
||||
}
|
||||
}
|
||||
this->resetSpanFlags(); // fix up small / tiny / done
|
||||
// align ts of other ranges with adjacent spans that match the aligned points
|
||||
lower = SkTMin(lower, matchIndex);
|
||||
while (lower > 0) {
|
||||
const SkOpSpan& span = this->span(lower - 1);
|
||||
if (span.fT != newT) {
|
||||
break;
|
||||
}
|
||||
--lower;
|
||||
}
|
||||
upper = SkTMax(upper, matchIndex);
|
||||
int last = this->count() - 1;
|
||||
while (upper < last) {
|
||||
const SkOpSpan& span = this->span(upper + 1);
|
||||
if (span.fT != newT) {
|
||||
break;
|
||||
}
|
||||
++upper;
|
||||
}
|
||||
for (int iIndex = lower; iIndex <= upper; ++iIndex) {
|
||||
const SkOpSpan& span = this->span(iIndex);
|
||||
SkOpSegment* aOther = span.fOther;
|
||||
int aLower = span.fOtherIndex;
|
||||
SkScalar aT = span.fOtherT;
|
||||
bool aResetFlags = false;
|
||||
while (aLower > 0) {
|
||||
SkOpSpan* aSpan = &aOther->fTs[aLower - 1];
|
||||
for (int iIndex = lower; iIndex <= upper; ++iIndex) {
|
||||
if (aSpan->fPt == this->fTs[iIndex].fPt) {
|
||||
goto matchFound;
|
||||
}
|
||||
}
|
||||
break;
|
||||
matchFound:
|
||||
--aLower;
|
||||
}
|
||||
int aUpper = span.fOtherIndex;
|
||||
int aLast = aOther->count() - 1;
|
||||
while (aUpper < aLast) {
|
||||
SkOpSpan* aSpan = &aOther->fTs[aUpper + 1];
|
||||
for (int iIndex = lower; iIndex <= upper; ++iIndex) {
|
||||
if (aSpan->fPt == this->fTs[iIndex].fPt) {
|
||||
goto matchFound2;
|
||||
}
|
||||
}
|
||||
break;
|
||||
matchFound2:
|
||||
++aUpper;
|
||||
}
|
||||
if (aOther->fTs[aLower].fT == 0) {
|
||||
aT = 0;
|
||||
} else if (aOther->fTs[aUpper].fT == 1) {
|
||||
aT = 1;
|
||||
}
|
||||
bool aFixed = false;
|
||||
for (int aIndex = aLower; aIndex <= aUpper; ++aIndex) {
|
||||
SkOpSpan* aSpan = &aOther->fTs[aIndex];
|
||||
if (aSpan->fT == aT) {
|
||||
continue;
|
||||
}
|
||||
SkASSERT(way_roughly_equal(aSpan->fT, aT));
|
||||
if (!aFixed) {
|
||||
aOther->fixOtherTIndex();
|
||||
aFixed = true;
|
||||
}
|
||||
aSpan->fT = aT;
|
||||
aSpan->fOther->fTs[aSpan->fOtherIndex].fOtherT = aT;
|
||||
aResetFlags = true;
|
||||
}
|
||||
if (aResetFlags) {
|
||||
aOther->resetSpanFlags();
|
||||
}
|
||||
}
|
||||
}
|
||||
nextI: ;
|
||||
}
|
||||
}
|
||||
|
||||
void SkOpSegment::alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other,
|
||||
double otherT, const SkOpSegment* other2, SkOpSpan* oSpan,
|
||||
SkTDArray<AlignedSpan>* alignedArray) {
|
||||
@ -1245,8 +1473,8 @@ void SkOpSegment::bumpCoincidentOBlind(int index, int endIndex) {
|
||||
// may not have the same intermediate points. Compute the corresponding
|
||||
// intermediate T values (using this as the master, other as the follower)
|
||||
// and walk other conditionally -- hoping that it catches up in the end
|
||||
void SkOpSegment::bumpCoincidentOther(const SkOpSpan& test, int* oIndexPtr,
|
||||
SkTArray<SkPoint, true>* oOutsidePts) {
|
||||
bool SkOpSegment::bumpCoincidentOther(const SkOpSpan& test, int* oIndexPtr,
|
||||
SkTArray<SkPoint, true>* oOutsidePts, const SkPoint& oEndPt) {
|
||||
int oIndex = *oIndexPtr;
|
||||
SkOpSpan* const oTest = &fTs[oIndex];
|
||||
SkOpSpan* oEnd = oTest;
|
||||
@ -1259,11 +1487,14 @@ void SkOpSegment::bumpCoincidentOther(const SkOpSpan& test, int* oIndexPtr,
|
||||
TrackOutside(oOutsidePts, startPt);
|
||||
}
|
||||
#endif
|
||||
bool foundEnd = false;
|
||||
while (oStartPt == oEnd->fPt || precisely_equal(oStartT, oEnd->fT)) {
|
||||
foundEnd |= oEndPt == oEnd->fPt;
|
||||
zeroSpan(oEnd);
|
||||
oEnd = &fTs[++oIndex];
|
||||
}
|
||||
*oIndexPtr = oIndex;
|
||||
return foundEnd;
|
||||
}
|
||||
|
||||
// FIXME: need to test this case:
|
||||
@ -1313,6 +1544,7 @@ bool SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, d
|
||||
}
|
||||
|
||||
// consolidate the winding count even if done
|
||||
bool foundEnd = false;
|
||||
if ((test->fWindValue == 0 && test->fOppValue == 0)
|
||||
|| (oTest->fWindValue == 0 && oTest->fOppValue == 0)) {
|
||||
SkDEBUGCODE(int firstWind = test->fWindValue);
|
||||
@ -1336,12 +1568,12 @@ bool SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, d
|
||||
if (!bumpCoincidentThis(*oTest, binary, &index, &outsidePts)) {
|
||||
return false;
|
||||
}
|
||||
other->bumpCoincidentOther(*test, &oIndex, &oOutsidePts);
|
||||
foundEnd = other->bumpCoincidentOther(*test, &oIndex, &oOutsidePts, endPt);
|
||||
} else {
|
||||
if (!other->bumpCoincidentThis(*test, binary, &oIndex, &oOutsidePts)) {
|
||||
return false;
|
||||
}
|
||||
bumpCoincidentOther(*oTest, &index, &outsidePts);
|
||||
foundEnd = bumpCoincidentOther(*oTest, &index, &outsidePts, endPt);
|
||||
}
|
||||
}
|
||||
test = &fTs[index];
|
||||
@ -1352,6 +1584,9 @@ bool SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, d
|
||||
if (endPt == *testPt || precisely_equal(endT, testT)) {
|
||||
break;
|
||||
}
|
||||
if (0 && foundEnd) { // FIXME: this is likely needed but wait until a test case triggers it
|
||||
break;
|
||||
}
|
||||
// SkASSERT(AlmostEqualUlps(*testPt, *oTestPt));
|
||||
} while (endPt != *oTestPt);
|
||||
// in rare cases, one may have ended before the other
|
||||
@ -1364,6 +1599,7 @@ bool SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, d
|
||||
test->fWindValue = lastWind;
|
||||
test->fOppValue = lastOpp;
|
||||
if (zero) {
|
||||
SkASSERT(!test->fDone);
|
||||
test->fDone = true;
|
||||
++fDoneSpans;
|
||||
}
|
||||
@ -1402,7 +1638,9 @@ bool SkOpSegment::addTCoincident(const SkPoint& startPt, const SkPoint& endPt, d
|
||||
if (success) {
|
||||
do {
|
||||
if (!binary || test->fWindValue + oTest->fOppValue >= 0) {
|
||||
other->bumpCoincidentOther(*test, &oIndex, &oOutsidePts);
|
||||
if (other->bumpCoincidentOther(*test, &oIndex, &oOutsidePts, endPt)) {
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
if (!other->bumpCoincidentThis(*test, binary, &oIndex, &oOutsidePts)) {
|
||||
return false;
|
||||
@ -1476,9 +1714,9 @@ const SkOpSpan* SkOpSegment::addTPair(double t, SkOpSegment* other, double other
|
||||
SkASSERT(other != this);
|
||||
int insertedAt = addT(other, pt, t);
|
||||
int otherInsertedAt = other->addT(this, pt2, otherT);
|
||||
addOtherT(insertedAt, otherT, otherInsertedAt);
|
||||
this->addOtherT(insertedAt, otherT, otherInsertedAt);
|
||||
other->addOtherT(otherInsertedAt, t, insertedAt);
|
||||
matchWindingValue(insertedAt, t, borrowWind);
|
||||
this->matchWindingValue(insertedAt, t, borrowWind);
|
||||
other->matchWindingValue(otherInsertedAt, otherT, borrowWind);
|
||||
SkOpSpan& span = this->fTs[insertedAt];
|
||||
if (pt != pt2) {
|
||||
@ -1486,6 +1724,27 @@ const SkOpSpan* SkOpSegment::addTPair(double t, SkOpSegment* other, double other
|
||||
SkOpSpan& oSpan = other->fTs[otherInsertedAt];
|
||||
oSpan.fNear = true;
|
||||
}
|
||||
// if the newly inserted spans match a neighbor on one but not the other, make them agree
|
||||
int lower = this->nextExactSpan(insertedAt, -1) + 1;
|
||||
int upper = this->nextExactSpan(insertedAt, 1) - 1;
|
||||
if (upper < 0) {
|
||||
upper = this->count() - 1;
|
||||
}
|
||||
int oLower = other->nextExactSpan(otherInsertedAt, -1) + 1;
|
||||
int oUpper = other->nextExactSpan(otherInsertedAt, 1) - 1;
|
||||
if (oUpper < 0) {
|
||||
oUpper = other->count() - 1;
|
||||
}
|
||||
if (lower == upper && oLower == oUpper) {
|
||||
return &span;
|
||||
}
|
||||
#if DEBUG_CONCIDENT
|
||||
SkDebugf("%s id=%d lower=%d upper=%d other=%d oLower=%d oUpper=%d\n", __FUNCTION__,
|
||||
debugID(), lower, upper, other->debugID(), oLower, oUpper);
|
||||
#endif
|
||||
// find the nearby spans in one range missing in the other
|
||||
this->alignRange(lower, upper, other, oLower, oUpper);
|
||||
other->alignRange(oLower, oUpper, this, lower, upper);
|
||||
return &span;
|
||||
}
|
||||
|
||||
@ -1893,8 +2152,10 @@ bool SkOpSegment::bumpSpan(SkOpSpan* span, int windDelta, int oppDelta) {
|
||||
span->fOppValue &= 1;
|
||||
}
|
||||
if (!span->fWindValue && !span->fOppValue) {
|
||||
span->fDone = true;
|
||||
++fDoneSpans;
|
||||
if (!span->fDone) {
|
||||
span->fDone = true;
|
||||
++fDoneSpans;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
@ -2118,7 +2379,7 @@ void SkOpSegment::checkDuplicates() {
|
||||
}
|
||||
|
||||
// look to see if the curve end intersects an intermediary that intersects the other
|
||||
void SkOpSegment::checkEnds() {
|
||||
bool SkOpSegment::checkEnds() {
|
||||
debugValidate();
|
||||
SkSTArray<kMissingSpanCount, MissingSpan, true> missingSpans;
|
||||
int count = fTs.count();
|
||||
@ -2193,11 +2454,14 @@ void SkOpSegment::checkEnds() {
|
||||
if (lastMissing.fT == t
|
||||
&& lastMissing.fOther == match
|
||||
&& lastMissing.fOtherT == matchT) {
|
||||
SkASSERT(lastMissing.fPt == peekSpan.fPt);
|
||||
SkASSERT(SkDPoint::ApproximatelyEqual(lastMissing.fPt, peekSpan.fPt));
|
||||
continue;
|
||||
}
|
||||
}
|
||||
#if DEBUG_CHECK_ENDS
|
||||
if (this == match) {
|
||||
return false; // extremely large paths can trigger this
|
||||
}
|
||||
#if DEBUG_CHECK_ALIGN
|
||||
SkDebugf("%s id=%d missing t=%1.9g other=%d otherT=%1.9g pt=(%1.9g,%1.9g)\n",
|
||||
__FUNCTION__, fID, t, match->fID, matchT, peekSpan.fPt.fX, peekSpan.fPt.fY);
|
||||
#endif
|
||||
@ -2219,7 +2483,7 @@ nextPeekIndex:
|
||||
}
|
||||
if (missingSpans.count() == 0) {
|
||||
debugValidate();
|
||||
return;
|
||||
return true;
|
||||
}
|
||||
debugValidate();
|
||||
int missingCount = missingSpans.count();
|
||||
@ -2236,6 +2500,7 @@ nextPeekIndex:
|
||||
missingSpans[index].fOther->fixOtherTIndex();
|
||||
}
|
||||
debugValidate();
|
||||
return true;
|
||||
}
|
||||
|
||||
void SkOpSegment::checkLinks(const SkOpSpan* base,
|
||||
@ -2257,7 +2522,7 @@ void SkOpSegment::checkLinks(const SkOpSpan* base,
|
||||
}
|
||||
test = base;
|
||||
while (test < last && (++test)->fPt == base->fPt) {
|
||||
SkASSERT(this != test->fOther);
|
||||
SkASSERT(this != test->fOther || test->fLoop);
|
||||
CheckOneLink(test, oSpan, oFirst, oLast, &missing, missingSpans);
|
||||
}
|
||||
}
|
||||
@ -2433,9 +2698,15 @@ nextSmallCheck:
|
||||
const SkOpSpan& otherSpan = missingOther->span(otherTIndex);
|
||||
if (otherSpan.fSmall) {
|
||||
const SkOpSpan* nextSpan = &otherSpan;
|
||||
if (nextSpan->fPt == missing.fPt) {
|
||||
continue;
|
||||
}
|
||||
do {
|
||||
++nextSpan;
|
||||
} while (nextSpan->fSmall);
|
||||
if (nextSpan->fT == 1) {
|
||||
continue;
|
||||
}
|
||||
SkAssertResult(missing.fSegment->addTCoincident(missing.fPt, nextSpan->fPt,
|
||||
nextSpan->fT, missingOther));
|
||||
} else if (otherSpan.fT > 0) {
|
||||
@ -3111,6 +3382,8 @@ int SkOpSegment::findExactT(double t, const SkOpSegment* match) const {
|
||||
return -1;
|
||||
}
|
||||
|
||||
|
||||
|
||||
int SkOpSegment::findOtherT(double t, const SkOpSegment* match) const {
|
||||
int count = this->count();
|
||||
for (int index = 0; index < count; ++index) {
|
||||
@ -3197,14 +3470,19 @@ SkOpSegment* SkOpSegment::findTop(int* tIndexPtr, int* endIndexPtr, bool* unsort
|
||||
SkOpSegment* next = angle->segment();
|
||||
SkPathOpsBounds bounds;
|
||||
next->subDivideBounds(angle->end(), angle->start(), &bounds);
|
||||
if (approximately_greater(top, bounds.fTop)) {
|
||||
bool nearSame = AlmostEqualUlps(top, bounds.top());
|
||||
bool lowerSector = !firstAngle || angle->sectorEnd() < firstAngle->sectorStart();
|
||||
bool lesserSector = top > bounds.fTop;
|
||||
if (lesserSector && (!nearSame || lowerSector)) {
|
||||
top = bounds.fTop;
|
||||
firstAngle = angle;
|
||||
}
|
||||
}
|
||||
angle = angle->next();
|
||||
} while (angle != baseAngle);
|
||||
SkASSERT(firstAngle);
|
||||
if (!firstAngle) {
|
||||
return NULL; // if all are unorderable, give up
|
||||
}
|
||||
#if DEBUG_SORT
|
||||
SkDebugf("%s\n", __FUNCTION__);
|
||||
firstAngle->debugLoop();
|
||||
@ -3301,6 +3579,72 @@ bool SkOpSegment::inCoincidentSpan(double t, const SkOpSegment* other) const {
|
||||
return foundEnds == 0x3 || foundEnds == 0x5 || foundEnds == 0x6; // two bits set
|
||||
}
|
||||
|
||||
bool SkOpSegment::inconsistentAngle(int maxWinding, int sumWinding, int oppMaxWinding,
|
||||
int oppSumWinding, const SkOpAngle* angle) const {
|
||||
SkASSERT(angle->segment() == this);
|
||||
if (UseInnerWinding(maxWinding, sumWinding)) {
|
||||
maxWinding = sumWinding;
|
||||
}
|
||||
if (oppMaxWinding != oppSumWinding && UseInnerWinding(oppMaxWinding, oppSumWinding)) {
|
||||
oppMaxWinding = oppSumWinding;
|
||||
}
|
||||
return inconsistentWinding(angle, maxWinding, oppMaxWinding);
|
||||
}
|
||||
|
||||
bool SkOpSegment::inconsistentWinding(const SkOpAngle* angle, int winding,
|
||||
int oppWinding) const {
|
||||
int index = angle->start();
|
||||
int endIndex = angle->end();
|
||||
int min = SkMin32(index, endIndex);
|
||||
int step = SkSign32(endIndex - index);
|
||||
if (inconsistentWinding(min, winding, oppWinding)) {
|
||||
return true;
|
||||
}
|
||||
const SkOpSegment* other = this;
|
||||
while ((other = other->nextChase(&index, &step, &min, NULL))) {
|
||||
if (other->fTs[min].fWindSum != SK_MinS32) {
|
||||
break;
|
||||
}
|
||||
if (fOperand == other->fOperand) {
|
||||
if (other->inconsistentWinding(min, winding, oppWinding)) {
|
||||
return true;
|
||||
}
|
||||
} else {
|
||||
if (other->inconsistentWinding(min, oppWinding, winding)) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
bool SkOpSegment::inconsistentWinding(int index, int winding, int oppWinding) const {
|
||||
SkASSERT(winding || oppWinding);
|
||||
double referenceT = this->span(index).fT;
|
||||
int lesser = index;
|
||||
while (--lesser >= 0 && precisely_negative(referenceT - fTs[lesser].fT)) {
|
||||
if (inconsistentWinding(__FUNCTION__, lesser, winding, oppWinding)) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
do {
|
||||
if (inconsistentWinding(__FUNCTION__, index, winding, oppWinding)) {
|
||||
return true;
|
||||
}
|
||||
} while (++index < fTs.count() && precisely_negative(fTs[index].fT - referenceT));
|
||||
return false;
|
||||
}
|
||||
|
||||
bool SkOpSegment::inconsistentWinding(const char* funName, int tIndex, int winding,
|
||||
int oppWinding) const {
|
||||
const SkOpSpan& span = this->span(tIndex);
|
||||
if (span.fDone && !span.fSmall) {
|
||||
return false;
|
||||
}
|
||||
return (span.fWindSum != SK_MinS32 && span.fWindSum != winding)
|
||||
|| (span.fOppSum != SK_MinS32 && span.fOppSum != oppWinding);
|
||||
}
|
||||
|
||||
void SkOpSegment::init(const SkPoint pts[], SkPath::Verb verb, bool operand, bool evenOdd) {
|
||||
fDoneSpans = 0;
|
||||
fOperand = operand;
|
||||
@ -3312,16 +3656,18 @@ void SkOpSegment::init(const SkPoint pts[], SkPath::Verb verb, bool operand, boo
|
||||
|
||||
void SkOpSegment::initWinding(int start, int end, SkOpAngle::IncludeType angleIncludeType) {
|
||||
int local = spanSign(start, end);
|
||||
SkDEBUGCODE(bool success);
|
||||
if (angleIncludeType == SkOpAngle::kBinarySingle) {
|
||||
int oppLocal = oppSign(start, end);
|
||||
(void) markAndChaseWinding(start, end, local, oppLocal);
|
||||
SkDEBUGCODE(success =) markAndChaseWinding(start, end, local, oppLocal, NULL);
|
||||
// OPTIMIZATION: the reverse mark and chase could skip the first marking
|
||||
(void) markAndChaseWinding(end, start, local, oppLocal);
|
||||
SkDEBUGCODE(success |=) markAndChaseWinding(end, start, local, oppLocal, NULL);
|
||||
} else {
|
||||
(void) markAndChaseWinding(start, end, local);
|
||||
SkDEBUGCODE(success =) markAndChaseWinding(start, end, local, NULL);
|
||||
// OPTIMIZATION: the reverse mark and chase could skip the first marking
|
||||
(void) markAndChaseWinding(end, start, local);
|
||||
SkDEBUGCODE(success |=) markAndChaseWinding(end, start, local, NULL);
|
||||
}
|
||||
SkASSERT(success);
|
||||
}
|
||||
|
||||
/*
|
||||
@ -3333,7 +3679,7 @@ If there was a winding, then it may or may not need adjusting. If the span the w
|
||||
from has the same x direction as this span, the winding should change. If the dx is opposite, then
|
||||
the same winding is shared by both.
|
||||
*/
|
||||
void SkOpSegment::initWinding(int start, int end, double tHit, int winding, SkScalar hitDx,
|
||||
bool SkOpSegment::initWinding(int start, int end, double tHit, int winding, SkScalar hitDx,
|
||||
int oppWind, SkScalar hitOppDx) {
|
||||
SkASSERT(hitDx || !winding);
|
||||
SkScalar dx = (*CurveSlopeAtT[SkPathOpsVerbToPoints(fVerb)])(fPts, tHit).fX;
|
||||
@ -3361,9 +3707,11 @@ void SkOpSegment::initWinding(int start, int end, double tHit, int winding, SkSc
|
||||
#if DEBUG_WINDING_AT_T
|
||||
SkDebugf(" winding=%d oppWind=%d\n", winding, oppWind);
|
||||
#endif
|
||||
(void) markAndChaseWinding(start, end, winding, oppWind);
|
||||
// if this fails to mark (because the edges are too small) inform caller to try again
|
||||
bool success = markAndChaseWinding(start, end, winding, oppWind, NULL);
|
||||
// OPTIMIZATION: the reverse mark and chase could skip the first marking
|
||||
(void) markAndChaseWinding(end, start, winding, oppWind);
|
||||
success |= markAndChaseWinding(end, start, winding, oppWind, NULL);
|
||||
return success;
|
||||
}
|
||||
|
||||
bool SkOpSegment::inLoop(const SkOpAngle* baseAngle, int spanCount, int* indexPtr) const {
|
||||
@ -3427,7 +3775,9 @@ bool SkOpSegment::joinCoincidence(SkOpSegment* other, double otherT, const SkPoi
|
||||
if (otherWind == 0) {
|
||||
return false;
|
||||
}
|
||||
SkASSERT(next >= 0);
|
||||
if (next < 0) {
|
||||
return false; // can happen if t values were adjusted but coincident ts were not
|
||||
}
|
||||
int tIndex = 0;
|
||||
do {
|
||||
SkOpSpan* test = &fTs[tIndex];
|
||||
@ -3442,7 +3792,9 @@ bool SkOpSegment::joinCoincidence(SkOpSegment* other, double otherT, const SkPoi
|
||||
if (cancel) {
|
||||
match->addTCancel(startPt, endPt, other);
|
||||
} else {
|
||||
SkAssertResult(match->addTCoincident(startPt, endPt, endT, other));
|
||||
if (!match->addTCoincident(startPt, endPt, endT, other)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
@ -3486,29 +3838,16 @@ SkOpSpan* SkOpSegment::markAndChaseDoneUnary(int index, int endIndex) {
|
||||
return last;
|
||||
}
|
||||
|
||||
SkOpSpan* SkOpSegment::markAndChaseWinding(const SkOpAngle* angle, int winding) {
|
||||
bool SkOpSegment::markAndChaseWinding(const SkOpAngle* angle, int winding, SkOpSpan** lastPtr) {
|
||||
int index = angle->start();
|
||||
int endIndex = angle->end();
|
||||
int step = SkSign32(endIndex - index);
|
||||
int min = SkMin32(index, endIndex);
|
||||
markWinding(min, winding);
|
||||
SkOpSpan* last = NULL;
|
||||
SkOpSegment* other = this;
|
||||
while ((other = other->nextChase(&index, &step, &min, &last))) {
|
||||
if (other->fTs[min].fWindSum != SK_MinS32) {
|
||||
// SkASSERT(other->fTs[min].fWindSum == winding);
|
||||
SkASSERT(!last);
|
||||
break;
|
||||
}
|
||||
other->markWinding(min, winding);
|
||||
}
|
||||
return last;
|
||||
return markAndChaseWinding(index, endIndex, winding, lastPtr);
|
||||
}
|
||||
|
||||
SkOpSpan* SkOpSegment::markAndChaseWinding(int index, int endIndex, int winding) {
|
||||
bool SkOpSegment::markAndChaseWinding(int index, int endIndex, int winding, SkOpSpan** lastPtr) {
|
||||
int min = SkMin32(index, endIndex);
|
||||
int step = SkSign32(endIndex - index);
|
||||
markWinding(min, winding);
|
||||
bool success = markWinding(min, winding);
|
||||
SkOpSpan* last = NULL;
|
||||
SkOpSegment* other = this;
|
||||
while ((other = other->nextChase(&index, &step, &min, &last))) {
|
||||
@ -3517,15 +3856,19 @@ SkOpSpan* SkOpSegment::markAndChaseWinding(int index, int endIndex, int winding)
|
||||
SkASSERT(!last);
|
||||
break;
|
||||
}
|
||||
other->markWinding(min, winding);
|
||||
(void) other->markWinding(min, winding);
|
||||
}
|
||||
return last;
|
||||
if (lastPtr) {
|
||||
*lastPtr = last;
|
||||
}
|
||||
return success;
|
||||
}
|
||||
|
||||
SkOpSpan* SkOpSegment::markAndChaseWinding(int index, int endIndex, int winding, int oppWinding) {
|
||||
bool SkOpSegment::markAndChaseWinding(int index, int endIndex, int winding, int oppWinding,
|
||||
SkOpSpan** lastPtr) {
|
||||
int min = SkMin32(index, endIndex);
|
||||
int step = SkSign32(endIndex - index);
|
||||
markWinding(min, winding, oppWinding);
|
||||
bool success = markWinding(min, winding, oppWinding);
|
||||
SkOpSpan* last = NULL;
|
||||
SkOpSegment* other = this;
|
||||
while ((other = other->nextChase(&index, &step, &min, &last))) {
|
||||
@ -3549,18 +3892,22 @@ SkOpSpan* SkOpSegment::markAndChaseWinding(int index, int endIndex, int winding,
|
||||
break;
|
||||
}
|
||||
if (fOperand == other->fOperand) {
|
||||
other->markWinding(min, winding, oppWinding);
|
||||
(void) other->markWinding(min, winding, oppWinding);
|
||||
} else {
|
||||
other->markWinding(min, oppWinding, winding);
|
||||
(void) other->markWinding(min, oppWinding, winding);
|
||||
}
|
||||
}
|
||||
return last;
|
||||
if (lastPtr) {
|
||||
*lastPtr = last;
|
||||
}
|
||||
return success;
|
||||
}
|
||||
|
||||
SkOpSpan* SkOpSegment::markAndChaseWinding(const SkOpAngle* angle, int winding, int oppWinding) {
|
||||
bool SkOpSegment::markAndChaseWinding(const SkOpAngle* angle, int winding, int oppWinding,
|
||||
SkOpSpan** lastPtr) {
|
||||
int start = angle->start();
|
||||
int end = angle->end();
|
||||
return markAndChaseWinding(start, end, winding, oppWinding);
|
||||
return markAndChaseWinding(start, end, winding, oppWinding, lastPtr);
|
||||
}
|
||||
|
||||
SkOpSpan* SkOpSegment::markAngle(int maxWinding, int sumWinding, const SkOpAngle* angle) {
|
||||
@ -3568,7 +3915,8 @@ SkOpSpan* SkOpSegment::markAngle(int maxWinding, int sumWinding, const SkOpAngle
|
||||
if (UseInnerWinding(maxWinding, sumWinding)) {
|
||||
maxWinding = sumWinding;
|
||||
}
|
||||
SkOpSpan* last = markAndChaseWinding(angle, maxWinding);
|
||||
SkOpSpan* last;
|
||||
SkAssertResult(markAndChaseWinding(angle, maxWinding, &last));
|
||||
#if DEBUG_WINDING
|
||||
if (last) {
|
||||
SkDebugf("%s last id=%d windSum=", __FUNCTION__,
|
||||
@ -3589,7 +3937,9 @@ SkOpSpan* SkOpSegment::markAngle(int maxWinding, int sumWinding, int oppMaxWindi
|
||||
if (oppMaxWinding != oppSumWinding && UseInnerWinding(oppMaxWinding, oppSumWinding)) {
|
||||
oppMaxWinding = oppSumWinding;
|
||||
}
|
||||
SkOpSpan* last = markAndChaseWinding(angle, maxWinding, oppMaxWinding);
|
||||
SkOpSpan* last;
|
||||
// caller doesn't require that this marks anything
|
||||
(void) markAndChaseWinding(angle, maxWinding, oppMaxWinding, &last);
|
||||
#if DEBUG_WINDING
|
||||
if (last) {
|
||||
SkDebugf("%s last id=%d windSum=", __FUNCTION__,
|
||||
@ -3632,6 +3982,18 @@ void SkOpSegment::markDoneBinary(int index) {
|
||||
debugValidate();
|
||||
}
|
||||
|
||||
void SkOpSegment::markDoneFinal(int index) {
|
||||
double referenceT = fTs[index].fT;
|
||||
int lesser = index;
|
||||
while (--lesser >= 0 && precisely_negative(referenceT - fTs[lesser].fT)) {
|
||||
markOneDoneFinal(__FUNCTION__, lesser);
|
||||
}
|
||||
do {
|
||||
markOneDoneFinal(__FUNCTION__, index);
|
||||
} while (++index < fTs.count() && precisely_negative(fTs[index].fT - referenceT));
|
||||
debugValidate();
|
||||
}
|
||||
|
||||
void SkOpSegment::markDoneUnary(int index) {
|
||||
double referenceT = fTs[index].fT;
|
||||
int lesser = index;
|
||||
@ -3645,12 +4007,22 @@ void SkOpSegment::markDoneUnary(int index) {
|
||||
}
|
||||
|
||||
void SkOpSegment::markOneDone(const char* funName, int tIndex, int winding) {
|
||||
SkOpSpan* span = markOneWinding(funName, tIndex, winding);
|
||||
if (!span || span->fDone) {
|
||||
SkOpSpan* span;
|
||||
(void) markOneWinding(funName, tIndex, winding, &span); // allowed to do nothing
|
||||
if (span->fDone) {
|
||||
return;
|
||||
}
|
||||
span->fDone = true;
|
||||
fDoneSpans++;
|
||||
++fDoneSpans;
|
||||
}
|
||||
|
||||
void SkOpSegment::markOneDoneFinal(const char* funName, int tIndex) {
|
||||
SkOpSpan* span = &fTs[tIndex];
|
||||
if (span->fDone) {
|
||||
return;
|
||||
}
|
||||
span->fDone = true;
|
||||
++fDoneSpans;
|
||||
}
|
||||
|
||||
void SkOpSegment::markOneDoneBinary(const char* funName, int tIndex) {
|
||||
@ -3660,7 +4032,7 @@ void SkOpSegment::markOneDoneBinary(const char* funName, int tIndex) {
|
||||
}
|
||||
SkASSERT(!span->fDone);
|
||||
span->fDone = true;
|
||||
fDoneSpans++;
|
||||
++fDoneSpans;
|
||||
}
|
||||
|
||||
void SkOpSegment::markOneDoneUnary(const char* funName, int tIndex) {
|
||||
@ -3673,46 +4045,52 @@ void SkOpSegment::markOneDoneUnary(const char* funName, int tIndex) {
|
||||
}
|
||||
SkASSERT(!span->fDone);
|
||||
span->fDone = true;
|
||||
fDoneSpans++;
|
||||
++fDoneSpans;
|
||||
}
|
||||
|
||||
SkOpSpan* SkOpSegment::markOneWinding(const char* funName, int tIndex, int winding) {
|
||||
SkOpSpan& span = fTs[tIndex];
|
||||
if (span.fDone && !span.fSmall) {
|
||||
return NULL;
|
||||
bool SkOpSegment::markOneWinding(const char* funName, int tIndex, int winding, SkOpSpan** lastPtr) {
|
||||
SkOpSpan* span = &fTs[tIndex];
|
||||
if (lastPtr) {
|
||||
*lastPtr = span;
|
||||
}
|
||||
if (span->fDone && !span->fSmall) {
|
||||
return false;
|
||||
}
|
||||
#if DEBUG_MARK_DONE
|
||||
debugShowNewWinding(funName, span, winding);
|
||||
debugShowNewWinding(funName, *span, winding);
|
||||
#endif
|
||||
SkASSERT(span.fWindSum == SK_MinS32 || span.fWindSum == winding);
|
||||
SkASSERT(span->fWindSum == SK_MinS32 || span->fWindSum == winding);
|
||||
#if DEBUG_LIMIT_WIND_SUM
|
||||
SkASSERT(abs(winding) <= DEBUG_LIMIT_WIND_SUM);
|
||||
#endif
|
||||
span.fWindSum = winding;
|
||||
return &span;
|
||||
span->fWindSum = winding;
|
||||
return true;
|
||||
}
|
||||
|
||||
SkOpSpan* SkOpSegment::markOneWinding(const char* funName, int tIndex, int winding,
|
||||
int oppWinding) {
|
||||
SkOpSpan& span = fTs[tIndex];
|
||||
if (span.fDone && !span.fSmall) {
|
||||
return NULL;
|
||||
bool SkOpSegment::markOneWinding(const char* funName, int tIndex, int winding,
|
||||
int oppWinding, SkOpSpan** lastPtr) {
|
||||
SkOpSpan* span = &fTs[tIndex];
|
||||
if (span->fDone && !span->fSmall) {
|
||||
return false;
|
||||
}
|
||||
#if DEBUG_MARK_DONE
|
||||
debugShowNewWinding(funName, span, winding, oppWinding);
|
||||
debugShowNewWinding(funName, *span, winding, oppWinding);
|
||||
#endif
|
||||
SkASSERT(span.fWindSum == SK_MinS32 || span.fWindSum == winding);
|
||||
SkASSERT(span->fWindSum == SK_MinS32 || span->fWindSum == winding);
|
||||
#if DEBUG_LIMIT_WIND_SUM
|
||||
SkASSERT(abs(winding) <= DEBUG_LIMIT_WIND_SUM);
|
||||
#endif
|
||||
span.fWindSum = winding;
|
||||
SkASSERT(span.fOppSum == SK_MinS32 || span.fOppSum == oppWinding);
|
||||
span->fWindSum = winding;
|
||||
SkASSERT(span->fOppSum == SK_MinS32 || span->fOppSum == oppWinding);
|
||||
#if DEBUG_LIMIT_WIND_SUM
|
||||
SkASSERT(abs(oppWinding) <= DEBUG_LIMIT_WIND_SUM);
|
||||
#endif
|
||||
span.fOppSum = oppWinding;
|
||||
span->fOppSum = oppWinding;
|
||||
debugValidate();
|
||||
return &span;
|
||||
if (lastPtr) {
|
||||
*lastPtr = span;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
// from http://stackoverflow.com/questions/1165647/how-to-determine-if-a-list-of-polygon-points-are-in-clockwise-order
|
||||
@ -3836,32 +4214,36 @@ SkOpSpan* SkOpSegment::verifyOneWindingU(const char* funName, int tIndex) {
|
||||
return &span;
|
||||
}
|
||||
|
||||
void SkOpSegment::markWinding(int index, int winding) {
|
||||
bool SkOpSegment::markWinding(int index, int winding) {
|
||||
// SkASSERT(!done());
|
||||
SkASSERT(winding);
|
||||
double referenceT = fTs[index].fT;
|
||||
int lesser = index;
|
||||
bool success = false;
|
||||
while (--lesser >= 0 && precisely_negative(referenceT - fTs[lesser].fT)) {
|
||||
markOneWinding(__FUNCTION__, lesser, winding);
|
||||
success |= markOneWinding(__FUNCTION__, lesser, winding, NULL);
|
||||
}
|
||||
do {
|
||||
markOneWinding(__FUNCTION__, index, winding);
|
||||
success |= markOneWinding(__FUNCTION__, index, winding, NULL);
|
||||
} while (++index < fTs.count() && precisely_negative(fTs[index].fT - referenceT));
|
||||
debugValidate();
|
||||
return success;
|
||||
}
|
||||
|
||||
void SkOpSegment::markWinding(int index, int winding, int oppWinding) {
|
||||
bool SkOpSegment::markWinding(int index, int winding, int oppWinding) {
|
||||
// SkASSERT(!done());
|
||||
SkASSERT(winding || oppWinding);
|
||||
double referenceT = fTs[index].fT;
|
||||
int lesser = index;
|
||||
bool success = false;
|
||||
while (--lesser >= 0 && precisely_negative(referenceT - fTs[lesser].fT)) {
|
||||
markOneWinding(__FUNCTION__, lesser, winding, oppWinding);
|
||||
success |= markOneWinding(__FUNCTION__, lesser, winding, oppWinding, NULL);
|
||||
}
|
||||
do {
|
||||
markOneWinding(__FUNCTION__, index, winding, oppWinding);
|
||||
success |= markOneWinding(__FUNCTION__, index, winding, oppWinding, NULL);
|
||||
} while (++index < fTs.count() && precisely_negative(fTs[index].fT - referenceT));
|
||||
debugValidate();
|
||||
return success;
|
||||
}
|
||||
|
||||
void SkOpSegment::matchWindingValue(int tIndex, double t, bool borrowWind) {
|
||||
@ -3924,19 +4306,20 @@ bool SkOpSegment::nextCandidate(int* start, int* end) const {
|
||||
return true;
|
||||
}
|
||||
|
||||
static SkOpSegment* set_last(SkOpSpan** last, SkOpSpan* endSpan) {
|
||||
static SkOpSegment* set_last(SkOpSpan** last, const SkOpSpan* endSpan) {
|
||||
if (last && !endSpan->fSmall) {
|
||||
*last = endSpan;
|
||||
*last = const_cast<SkOpSpan*>(endSpan); // FIXME: get rid of cast
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
|
||||
SkOpSegment* SkOpSegment::nextChase(int* indexPtr, int* stepPtr, int* minPtr, SkOpSpan** last) {
|
||||
SkOpSegment* SkOpSegment::nextChase(int* indexPtr, int* stepPtr, int* minPtr,
|
||||
SkOpSpan** last) const {
|
||||
int origIndex = *indexPtr;
|
||||
int step = *stepPtr;
|
||||
int end = nextExactSpan(origIndex, step);
|
||||
SkASSERT(end >= 0);
|
||||
SkOpSpan& endSpan = fTs[end];
|
||||
const SkOpSpan& endSpan = this->span(end);
|
||||
SkOpAngle* angle = step > 0 ? endSpan.fFromAngle : endSpan.fToAngle;
|
||||
int foundIndex;
|
||||
int otherEnd;
|
||||
|
||||
@ -302,7 +302,7 @@ public:
|
||||
double calcMissingTStart(const SkOpSegment* ref, double loEnd, double min, double max,
|
||||
double hiEnd, const SkOpSegment* other, int thisEnd);
|
||||
void checkDuplicates();
|
||||
void checkEnds();
|
||||
bool checkEnds();
|
||||
void checkMultiples();
|
||||
void checkSmall();
|
||||
bool checkSmall(int index) const;
|
||||
@ -323,8 +323,10 @@ public:
|
||||
int findT(double t, const SkPoint& , const SkOpSegment* ) const;
|
||||
SkOpSegment* findTop(int* tIndex, int* endIndex, bool* unsortable, bool firstPass);
|
||||
void fixOtherTIndex();
|
||||
bool inconsistentAngle(int maxWinding, int sumWinding, int oppMaxWinding, int oppSumWinding,
|
||||
const SkOpAngle* angle) const;
|
||||
void initWinding(int start, int end, SkOpAngle::IncludeType angleIncludeType);
|
||||
void initWinding(int start, int end, double tHit, int winding, SkScalar hitDx, int oppWind,
|
||||
bool initWinding(int start, int end, double tHit, int winding, SkScalar hitDx, int oppWind,
|
||||
SkScalar hitOppDx);
|
||||
bool isMissing(double startT, const SkPoint& pt) const;
|
||||
bool isTiny(const SkOpAngle* angle) const;
|
||||
@ -332,11 +334,13 @@ public:
|
||||
bool cancel);
|
||||
SkOpSpan* markAndChaseDoneBinary(int index, int endIndex);
|
||||
SkOpSpan* markAndChaseDoneUnary(int index, int endIndex);
|
||||
SkOpSpan* markAndChaseWinding(const SkOpAngle* angle, int winding, int oppWinding);
|
||||
bool markAndChaseWinding(const SkOpAngle* angle, int winding, int oppWinding,
|
||||
SkOpSpan** lastPtr);
|
||||
SkOpSpan* markAngle(int maxWinding, int sumWinding, int oppMaxWinding, int oppSumWinding,
|
||||
const SkOpAngle* angle);
|
||||
void markDone(int index, int winding);
|
||||
void markDoneBinary(int index);
|
||||
void markDoneFinal(int index);
|
||||
void markDoneUnary(int index);
|
||||
bool nextCandidate(int* start, int* end) const;
|
||||
int nextSpan(int from, int step) const;
|
||||
@ -403,15 +407,16 @@ private:
|
||||
SkOpAngle* addSingletonAngleDown(SkOpSegment** otherPtr, SkOpAngle** );
|
||||
SkOpAngle* addSingletonAngleUp(SkOpSegment** otherPtr, SkOpAngle** );
|
||||
SkOpAngle* addSingletonAngles(int step);
|
||||
void alignRange(int lower, int upper, const SkOpSegment* other, int oLower, int oUpper);
|
||||
void alignSpan(const SkPoint& newPt, double newT, const SkOpSegment* other, double otherT,
|
||||
const SkOpSegment* other2, SkOpSpan* oSpan, SkTDArray<AlignedSpan>* );
|
||||
bool betweenPoints(double midT, const SkPoint& pt1, const SkPoint& pt2) const;
|
||||
void bumpCoincidentBlind(bool binary, int index, int last);
|
||||
bool bumpCoincidentThis(const SkOpSpan& oTest, bool binary, int* index,
|
||||
SkTArray<SkPoint, true>* outsideTs);
|
||||
SkTArray<SkPoint, true>* outsideTs);
|
||||
void bumpCoincidentOBlind(int index, int last);
|
||||
void bumpCoincidentOther(const SkOpSpan& oTest, int* index,
|
||||
SkTArray<SkPoint, true>* outsideTs);
|
||||
bool bumpCoincidentOther(const SkOpSpan& oTest, int* index,
|
||||
SkTArray<SkPoint, true>* outsideTs, const SkPoint& endPt);
|
||||
bool bumpSpan(SkOpSpan* span, int windDelta, int oppDelta);
|
||||
bool calcLoopSpanCount(const SkOpSpan& thisSpan, int* smallCounts);
|
||||
bool checkForSmall(const SkOpSpan* span, const SkPoint& pt, double newT,
|
||||
@ -438,6 +443,9 @@ private:
|
||||
const SkOpSpan& firstSpan(const SkOpSpan& thisSpan) const;
|
||||
void init(const SkPoint pts[], SkPath::Verb verb, bool operand, bool evenOdd);
|
||||
bool inCoincidentSpan(double t, const SkOpSegment* other) const;
|
||||
bool inconsistentWinding(const SkOpAngle* , int maxWinding, int oppMaxWinding) const;
|
||||
bool inconsistentWinding(int min, int maxWinding, int oppMaxWinding) const;
|
||||
bool inconsistentWinding(const char* funName, int tIndex, int winding, int oppWinding) const;
|
||||
bool inLoop(const SkOpAngle* baseAngle, int spanCount, int* indexPtr) const;
|
||||
#if OLD_CHASE
|
||||
bool isSimple(int end) const;
|
||||
@ -449,30 +457,35 @@ private:
|
||||
void matchWindingValue(int tIndex, double t, bool borrowWind);
|
||||
SkOpSpan* markAndChaseDone(int index, int endIndex, int winding);
|
||||
SkOpSpan* markAndChaseDoneBinary(const SkOpAngle* angle, int winding, int oppWinding);
|
||||
SkOpSpan* markAndChaseWinding(const SkOpAngle* angle, int winding);
|
||||
SkOpSpan* markAndChaseWinding(int index, int endIndex, int winding);
|
||||
SkOpSpan* markAndChaseWinding(int index, int endIndex, int winding, int oppWinding);
|
||||
bool markAndChaseWinding(const SkOpAngle* angle, int winding, SkOpSpan** lastPtr);
|
||||
bool markAndChaseWinding(int index, int endIndex, int winding, SkOpSpan** lastPtr);
|
||||
bool markAndChaseWinding(int index, int endIndex, int winding, int oppWinding,
|
||||
SkOpSpan** lastPtr);
|
||||
SkOpSpan* markAngle(int maxWinding, int sumWinding, const SkOpAngle* angle);
|
||||
void markDoneBinary(int index, int winding, int oppWinding);
|
||||
SkOpSpan* markAndChaseDoneUnary(const SkOpAngle* angle, int winding);
|
||||
void markOneDone(const char* funName, int tIndex, int winding);
|
||||
void markOneDoneBinary(const char* funName, int tIndex);
|
||||
void markOneDoneBinary(const char* funName, int tIndex, int winding, int oppWinding);
|
||||
void markOneDoneFinal(const char* funName, int tIndex);
|
||||
void markOneDoneUnary(const char* funName, int tIndex);
|
||||
SkOpSpan* markOneWinding(const char* funName, int tIndex, int winding);
|
||||
SkOpSpan* markOneWinding(const char* funName, int tIndex, int winding, int oppWinding);
|
||||
void markWinding(int index, int winding);
|
||||
void markWinding(int index, int winding, int oppWinding);
|
||||
bool markOneWinding(const char* funName, int tIndex, int winding, SkOpSpan** lastPtr);
|
||||
bool markOneWinding(const char* funName, int tIndex, int winding, int oppWinding,
|
||||
SkOpSpan** lastPtr);
|
||||
bool markWinding(int index, int winding);
|
||||
bool markWinding(int index, int winding, int oppWinding);
|
||||
bool monotonicInY(int tStart, int tEnd) const;
|
||||
|
||||
bool multipleEnds() const { return fTs[count() - 2].fT == 1; }
|
||||
bool multipleStarts() const { return fTs[1].fT == 0; }
|
||||
|
||||
SkOpSegment* nextChase(int* index, int* step, int* min, SkOpSpan** last);
|
||||
SkOpSegment* nextChase(int* index, int* step, int* min, SkOpSpan** last) const;
|
||||
int nextExactSpan(int from, int step) const;
|
||||
void resetSpanFlags();
|
||||
bool serpentine(int tStart, int tEnd) const;
|
||||
void setCoincidentRange(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
|
||||
void setFromAngle(int endIndex, SkOpAngle* );
|
||||
void setSpanFlags(const SkPoint& pt, double newT, SkOpSpan* span);
|
||||
void setToAngle(int endIndex, SkOpAngle* );
|
||||
void setUpWindings(int index, int endIndex, int* sumMiWinding,
|
||||
int* maxWinding, int* sumWinding);
|
||||
@ -527,6 +540,7 @@ private:
|
||||
void debugConstructQuad(SkPoint shortQuad[3]);
|
||||
void debugReset();
|
||||
void dumpDPts() const;
|
||||
void dumpHexPts() const;
|
||||
void dumpSpan(int index) const;
|
||||
|
||||
const SkPoint* fPts;
|
||||
|
||||
@ -161,7 +161,7 @@ SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex)
|
||||
if (!sortable) {
|
||||
continue;
|
||||
}
|
||||
// find first angle, initialize winding to computed fWindSum
|
||||
// find first angle, initialize winding to computed wind sum
|
||||
const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
|
||||
const SkOpAngle* firstAngle;
|
||||
SkDEBUGCODE(firstAngle = angle);
|
||||
@ -208,7 +208,8 @@ SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex)
|
||||
if (SkOpSegment::UseInnerWinding(maxWinding, winding)) {
|
||||
maxWinding = winding;
|
||||
}
|
||||
(void) segment->markAndChaseWinding(angle, maxWinding, 0);
|
||||
// allowed to do nothing
|
||||
(void) segment->markAndChaseWinding(angle, maxWinding, 0, NULL);
|
||||
break;
|
||||
}
|
||||
}
|
||||
@ -315,6 +316,12 @@ static void skipVertical(const SkTArray<SkOpContour*, true>& contourList,
|
||||
return;
|
||||
}
|
||||
|
||||
struct SortableTop { // error if local in pre-C++11
|
||||
SkOpSegment* fSegment;
|
||||
int fIndex;
|
||||
int fEndIndex;
|
||||
};
|
||||
|
||||
SkOpSegment* FindSortableTop(const SkTArray<SkOpContour*, true>& contourList,
|
||||
SkOpAngle::IncludeType angleIncludeType, bool* firstContour, int* indexPtr,
|
||||
int* endIndexPtr, SkPoint* topLeft, bool* unsortable, bool* done, bool* onlyVertical,
|
||||
@ -356,6 +363,8 @@ SkOpSegment* FindSortableTop(const SkTArray<SkOpContour*, true>& contourList,
|
||||
double tHit;
|
||||
SkScalar hitDx = 0;
|
||||
SkScalar hitOppDx = 0;
|
||||
// keep track of subsequent returns to detect infinite loops
|
||||
SkTDArray<SortableTop> sortableTops;
|
||||
do {
|
||||
// if current is vertical, find another candidate which is not
|
||||
// if only remaining candidates are vertical, then they can be marked done
|
||||
@ -366,6 +375,35 @@ SkOpSegment* FindSortableTop(const SkTArray<SkOpContour*, true>& contourList,
|
||||
tryAgain = false;
|
||||
contourWinding = rightAngleWinding(contourList, ¤t, indexPtr, endIndexPtr, &tHit,
|
||||
&hitDx, &tryAgain, onlyVertical, false);
|
||||
if (tryAgain) {
|
||||
bool giveUp = false;
|
||||
int count = sortableTops.count();
|
||||
for (int index = 0; index < count; ++index) {
|
||||
const SortableTop& prev = sortableTops[index];
|
||||
if (giveUp) {
|
||||
prev.fSegment->markDoneFinal(prev.fIndex);
|
||||
} else if (prev.fSegment == current
|
||||
&& (prev.fIndex == *indexPtr || prev.fEndIndex == *endIndexPtr)) {
|
||||
// remaining edges are non-vertical and cannot have their winding computed
|
||||
// mark them as done and return, and hope that assembly can fill the holes
|
||||
giveUp = true;
|
||||
index = -1;
|
||||
}
|
||||
}
|
||||
if (giveUp) {
|
||||
*done = true;
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
SortableTop* sortableTop = sortableTops.append();
|
||||
sortableTop->fSegment = current;
|
||||
sortableTop->fIndex = *indexPtr;
|
||||
sortableTop->fEndIndex = *endIndexPtr;
|
||||
#if DEBUG_SORT
|
||||
SkDebugf("%s current=%d index=%d endIndex=%d tHit=%1.9g hitDx=%1.9g try=%d vert=%d\n",
|
||||
__FUNCTION__, current->debugID(), *indexPtr, *endIndexPtr, tHit, hitDx, tryAgain,
|
||||
*onlyVertical);
|
||||
#endif
|
||||
if (*onlyVertical) {
|
||||
return current;
|
||||
}
|
||||
@ -378,10 +416,16 @@ SkOpSegment* FindSortableTop(const SkTArray<SkOpContour*, true>& contourList,
|
||||
oppContourWinding = rightAngleWinding(contourList, ¤t, indexPtr, endIndexPtr, &tHit,
|
||||
&hitOppDx, &tryAgain, NULL, true);
|
||||
} while (tryAgain);
|
||||
current->initWinding(*indexPtr, *endIndexPtr, tHit, contourWinding, hitDx, oppContourWinding,
|
||||
hitOppDx);
|
||||
bool success = current->initWinding(*indexPtr, *endIndexPtr, tHit, contourWinding, hitDx,
|
||||
oppContourWinding, hitOppDx);
|
||||
if (current->done()) {
|
||||
return NULL;
|
||||
} else if (!success) { // check if the span has a valid winding
|
||||
int min = SkTMin(*indexPtr, *endIndexPtr);
|
||||
const SkOpSpan& span = current->span(min);
|
||||
if (span.fWindSum == SK_MinS32) {
|
||||
return NULL;
|
||||
}
|
||||
}
|
||||
return current;
|
||||
}
|
||||
@ -405,14 +449,17 @@ static void checkDuplicates(SkTArray<SkOpContour*, true>* contourList) {
|
||||
}
|
||||
}
|
||||
|
||||
static void checkEnds(SkTArray<SkOpContour*, true>* contourList) {
|
||||
static bool checkEnds(SkTArray<SkOpContour*, true>* contourList) {
|
||||
// it's hard to determine if the end of a cubic or conic nearly intersects another curve.
|
||||
// instead, look to see if the connecting curve intersected at that same end.
|
||||
int contourCount = (*contourList).count();
|
||||
for (int cTest = 0; cTest < contourCount; ++cTest) {
|
||||
SkOpContour* contour = (*contourList)[cTest];
|
||||
contour->checkEnds();
|
||||
if (!contour->checkEnds()) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
static bool checkMultiples(SkTArray<SkOpContour*, true>* contourList) {
|
||||
@ -706,7 +753,9 @@ bool HandleCoincidence(SkTArray<SkOpContour*, true>* contourList, int total) {
|
||||
SkOpContour::debugShowWindingValues(contourList);
|
||||
#endif
|
||||
fixOtherTIndex(contourList);
|
||||
checkEnds(contourList); // check if connecting curve intersected at the same end
|
||||
if (!checkEnds(contourList)) { // check if connecting curve intersected at the same end
|
||||
return false;
|
||||
}
|
||||
bool hasM = checkMultiples(contourList); // check if intersections agree on t and point values
|
||||
SkTDArray<SkOpSegment::AlignedSpan> aligned;
|
||||
if (hasM) {
|
||||
|
||||
@ -46,7 +46,7 @@
|
||||
#define DEBUG_ANGLE 0
|
||||
#define DEBUG_AS_C_CODE 1
|
||||
#define DEBUG_ASSEMBLE 0
|
||||
#define DEBUG_CHECK_ENDS 0
|
||||
#define DEBUG_CHECK_ALIGN 0
|
||||
#define DEBUG_CHECK_TINY 0
|
||||
#define DEBUG_CONCIDENT 0
|
||||
#define DEBUG_CROSS 0
|
||||
@ -82,7 +82,7 @@
|
||||
#define DEBUG_ANGLE 1
|
||||
#define DEBUG_AS_C_CODE 1
|
||||
#define DEBUG_ASSEMBLE 1
|
||||
#define DEBUG_CHECK_ENDS 1
|
||||
#define DEBUG_CHECK_ALIGN 1
|
||||
#define DEBUG_CHECK_TINY 1
|
||||
#define DEBUG_CONCIDENT 1
|
||||
#define DEBUG_CROSS 01
|
||||
|
||||
@ -45,22 +45,28 @@ static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* e
|
||||
continue;
|
||||
}
|
||||
const SkOpAngle* firstAngle = angle;
|
||||
SkDEBUGCODE(bool loop = false);
|
||||
int winding;
|
||||
bool loop = false;
|
||||
int winding = SK_MinS32;
|
||||
do {
|
||||
angle = angle->next();
|
||||
SkASSERT(angle != firstAngle || !loop);
|
||||
SkDEBUGCODE(loop |= angle == firstAngle);
|
||||
if (angle == firstAngle && loop) {
|
||||
break; // if we get here, there's no winding, loop is unorderable
|
||||
}
|
||||
loop |= angle == firstAngle;
|
||||
segment = angle->segment();
|
||||
winding = segment->windSum(angle);
|
||||
} while (winding == SK_MinS32);
|
||||
if (winding == SK_MinS32) {
|
||||
continue;
|
||||
}
|
||||
int sumMiWinding = segment->updateWindingReverse(angle);
|
||||
int sumSuWinding = segment->updateOppWindingReverse(angle);
|
||||
if (segment->operand()) {
|
||||
SkTSwap<int>(sumMiWinding, sumSuWinding);
|
||||
}
|
||||
SkOpSegment* first = NULL;
|
||||
while ((angle = angle->next()) != firstAngle) {
|
||||
bool badData = false;
|
||||
while ((angle = angle->next()) != firstAngle && !badData) {
|
||||
segment = angle->segment();
|
||||
int start = angle->start();
|
||||
int end = angle->end();
|
||||
@ -73,11 +79,19 @@ static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* e
|
||||
*tIndex = start;
|
||||
*endIndex = end;
|
||||
}
|
||||
if (segment->inconsistentAngle(maxWinding, sumWinding, oppMaxWinding,
|
||||
oppSumWinding, angle)) {
|
||||
badData = true;
|
||||
break;
|
||||
}
|
||||
// OPTIMIZATION: should this also add to the chase?
|
||||
(void) segment->markAngle(maxWinding, sumWinding, oppMaxWinding,
|
||||
oppSumWinding, angle);
|
||||
}
|
||||
}
|
||||
if (badData) {
|
||||
continue;
|
||||
}
|
||||
if (first) {
|
||||
#if TRY_ROTATE
|
||||
*chase.insert(0) = span;
|
||||
@ -245,7 +259,47 @@ static const bool gOutInverse[kReverseDifference_PathOp + 1][2][2] = {
|
||||
{{ false, true }, { false, false }}, // rev diff
|
||||
};
|
||||
|
||||
#define DEBUGGING_PATHOPS_FROM_HOST 0 // enable to debug svg in chrome -- note path hardcoded below
|
||||
#if DEBUGGING_PATHOPS_FROM_HOST
|
||||
#include "SkData.h"
|
||||
#include "SkStream.h"
|
||||
|
||||
static void dump_path(FILE* file, const SkPath& path, bool force, bool dumpAsHex) {
|
||||
SkDynamicMemoryWStream wStream;
|
||||
path.dump(&wStream, force, dumpAsHex);
|
||||
SkAutoDataUnref data(wStream.copyToData());
|
||||
fprintf(file, "%.*s\n", (int) data->size(), data->data());
|
||||
}
|
||||
|
||||
static int dumpID = 0;
|
||||
|
||||
static void dump_op(const SkPath& one, const SkPath& two, SkPathOp op) {
|
||||
#if SK_BUILD_FOR_MAC
|
||||
FILE* file = fopen("/Users/caryclark/Documents/svgop.txt", "w");
|
||||
#else
|
||||
FILE* file = fopen("/usr/local/google/home/caryclark/Documents/svgop.txt", "w");
|
||||
#endif
|
||||
fprintf(file,
|
||||
"\nstatic void fuzz763_%d(skiatest::Reporter* reporter, const char* filename) {\n",
|
||||
++dumpID);
|
||||
fprintf(file, " SkPath path;\n");
|
||||
fprintf(file, " path.setFillType((SkPath::FillType) %d);\n", one.getFillType());
|
||||
dump_path(file, one, false, true);
|
||||
fprintf(file, " SkPath path1(path);\n");
|
||||
fprintf(file, " path.reset();\n");
|
||||
fprintf(file, " path.setFillType((SkPath::FillType) %d);\n", two.getFillType());
|
||||
dump_path(file, two, false, true);
|
||||
fprintf(file, " SkPath path2(path);\n");
|
||||
fprintf(file, " testPathOp(reporter, path1, path2, (SkPathOp) %d, filename);\n", op);
|
||||
fprintf(file, "}\n");
|
||||
fclose(file);
|
||||
}
|
||||
#endif
|
||||
|
||||
bool Op(const SkPath& one, const SkPath& two, SkPathOp op, SkPath* result) {
|
||||
#if DEBUGGING_PATHOPS_FROM_HOST
|
||||
dump_op(one, two, op);
|
||||
#endif
|
||||
#if DEBUG_SHOW_TEST_NAME
|
||||
char* debugName = DEBUG_FILENAME_STRING;
|
||||
if (debugName && debugName[0]) {
|
||||
|
||||
@ -227,6 +227,7 @@ struct SkDPoint {
|
||||
// utilities callable by the user from the debugger when the implementation code is linked in
|
||||
void dump() const;
|
||||
static void Dump(const SkPoint& pt);
|
||||
static void DumpHex(const SkPoint& pt);
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
@ -141,6 +141,12 @@ inline bool roughly_zero(double x) {
|
||||
return fabs(x) < ROUGH_EPSILON;
|
||||
}
|
||||
|
||||
#if 0 // unused for now
|
||||
inline bool way_roughly_zero(double x) {
|
||||
return fabs(x) < WAY_ROUGH_EPSILON;
|
||||
}
|
||||
#endif
|
||||
|
||||
inline bool approximately_zero_inverse(double x) {
|
||||
return fabs(x) > FLT_EPSILON_INVERSE;
|
||||
}
|
||||
|
||||
@ -88,12 +88,12 @@ int SkReduceOrder::reduce(const SkDQuad& quad) {
|
||||
}
|
||||
}
|
||||
if (minXSet == 0x7) { // test for vertical line
|
||||
if (minYSet == 0x7) { // return 1 if all four are coincident
|
||||
if (minYSet == 0x7) { // return 1 if all three are coincident
|
||||
return coincident_line(quad, fQuad);
|
||||
}
|
||||
return vertical_line(quad, fQuad);
|
||||
}
|
||||
if (minYSet == 0xF) { // test for horizontal line
|
||||
if (minYSet == 0x7) { // test for horizontal line
|
||||
return horizontal_line(quad, fQuad);
|
||||
}
|
||||
int result = check_linear(quad, minX, maxX, minY, maxY, fQuad);
|
||||
|
||||
@ -1273,9 +1273,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp46(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x3697ff52), SkBits2Float(0xc26fffff));
|
||||
@ -1299,7 +1296,7 @@ path.lineTo(SkBits2Float(0x4285e672), SkBits2Float(0xc2443b5f));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -1490,9 +1487,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp54(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0xc2700000));
|
||||
@ -1518,7 +1512,7 @@ path.lineTo(SkBits2Float(0x42a3a81d), SkBits2Float(0xc15e595e));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -1632,9 +1626,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp59(skiatest::Reporter* reporter, const char* filename) { // hung
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 0);
|
||||
path.moveTo(SkBits2Float(0x27b71bcd), SkBits2Float(0xc2a60000));
|
||||
@ -1736,9 +1727,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp63(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0xc2700000));
|
||||
@ -1766,7 +1754,7 @@ path.lineTo(SkBits2Float(0x4039d102), SkBits2Float(0xc2a5e5fe));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -1896,7 +1884,11 @@ path.lineTo(SkBits2Float(0x3ee8b040), SkBits2Float(0xc2a5ff5d));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
if (FLAGS_runFail) {
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
} else {
|
||||
testPathFailOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
}
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -2314,9 +2306,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp85(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0xc2700000));
|
||||
@ -3973,9 +3962,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp148(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 0);
|
||||
path.moveTo(SkBits2Float(0x27b71bcd), SkBits2Float(0xc2a60000));
|
||||
@ -3996,7 +3982,7 @@ path.lineTo(SkBits2Float(0x42a38b52), SkBits2Float(0xc1639578));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -4084,9 +4070,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp152(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 0);
|
||||
path.moveTo(SkBits2Float(0x27b71bcd), SkBits2Float(0xc2a60000));
|
||||
@ -4109,7 +4092,7 @@ path.lineTo(SkBits2Float(0x42a5fe22), SkBits2Float(0x3f4744a1));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -4229,9 +4212,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp157(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0xc2700000));
|
||||
@ -4260,7 +4240,7 @@ path.lineTo(SkBits2Float(0x429c4e4c), SkBits2Float(0x41df969b));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -4408,9 +4388,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp163(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x3697ff52), SkBits2Float(0xc2700000));
|
||||
@ -4437,7 +4414,7 @@ path.lineTo(SkBits2Float(0x428cfdb5), SkBits2Float(0x422f3e36));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -4951,9 +4928,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp181(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0xb7060057), SkBits2Float(0xc2700000));
|
||||
@ -4982,7 +4956,7 @@ path.lineTo(SkBits2Float(0x424f88ba), SkBits2Float(0x428191f0));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -5014,9 +4988,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp183(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x36d3ff52), SkBits2Float(0xc2700000));
|
||||
@ -5045,7 +5016,7 @@ path.lineTo(SkBits2Float(0x424b624a), SkBits2Float(0x42833479));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -5376,9 +5347,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp195(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 0);
|
||||
path.moveTo(SkBits2Float(0x27b71bcd), SkBits2Float(0xc2a60000));
|
||||
@ -5399,7 +5367,7 @@ path.lineTo(SkBits2Float(0x3fc9081a), SkBits2Float(0xc2a5f864));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -5451,9 +5419,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp198(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x369bbf59), SkBits2Float(0xc2700000));
|
||||
@ -5478,7 +5443,7 @@ path.lineTo(SkBits2Float(0x40848cae), SkBits2Float(0xc2a5cb0c));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -6308,9 +6273,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp230(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0x00000000), SkBits2Float(0xc2700000));
|
||||
@ -6335,7 +6297,7 @@ path.lineTo(SkBits2Float(0x429ff91f), SkBits2Float(0xc1b14b8a));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -6505,9 +6467,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp237(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 0);
|
||||
path.moveTo(SkBits2Float(0x27b71bcd), SkBits2Float(0xc2a60000));
|
||||
@ -7066,9 +7025,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp256(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 1);
|
||||
path.moveTo(SkBits2Float(0xb69400ae), SkBits2Float(0xc2700000));
|
||||
@ -7098,7 +7054,7 @@ path.lineTo(SkBits2Float(0x4273ad4f), SkBits2Float(0x42617d52));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -7465,9 +7421,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp269(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 0);
|
||||
path.moveTo(SkBits2Float(0x27b71bcd), SkBits2Float(0xc2a60000));
|
||||
@ -7490,7 +7443,7 @@ path.lineTo(SkBits2Float(0x427e3109), SkBits2Float(0x42559108));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -7585,9 +7538,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp273(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 0);
|
||||
path.moveTo(SkBits2Float(0x27b71bcd), SkBits2Float(0xc2a60000));
|
||||
@ -7610,7 +7560,7 @@ path.lineTo(SkBits2Float(0x4279eebd), SkBits2Float(0x425a890e));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -7891,9 +7841,6 @@ path.close();
|
||||
// op end success 1
|
||||
|
||||
static void battleOp283(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return; // draws wrong
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType((SkPath::FillType) 0);
|
||||
path.moveTo(SkBits2Float(0x27b71bcd), SkBits2Float(0xc2a60000));
|
||||
@ -7916,7 +7863,7 @@ path.lineTo(SkBits2Float(0x42759f2b), SkBits2Float(0x425f5e9b));
|
||||
path.close();
|
||||
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
testPathOpCheck(reporter, path1, path2, (SkPathOp) 2, filename, FLAGS_runFail);
|
||||
}
|
||||
// op end success 1
|
||||
|
||||
@ -10739,7 +10686,7 @@ path.close();
|
||||
testPathOp(reporter, path1, path2, (SkPathOp) 2, filename);
|
||||
}
|
||||
|
||||
static void (*firstTest)(skiatest::Reporter* , const char* filename) = battleOp6001;
|
||||
static void (*firstTest)(skiatest::Reporter* , const char* filename) = battleOp68;
|
||||
static void (*stopTest)(skiatest::Reporter* , const char* filename) = 0;
|
||||
|
||||
static struct TestDesc tests[] = {
|
||||
@ -10792,8 +10739,6 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp43),
|
||||
TEST(battleOp44),
|
||||
TEST(battleOp45),
|
||||
TEST(battleOp46), // draws wrong : dropped an outer cubic incorrectly
|
||||
// if assembly rewrite was done, the error would be hidden
|
||||
TEST(battleOp47),
|
||||
TEST(battleOp48),
|
||||
TEST(battleOp49),
|
||||
@ -10802,17 +10747,15 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp51),
|
||||
TEST(battleOp52),
|
||||
TEST(battleOp53),
|
||||
TEST(battleOp54), // draws wrong
|
||||
TEST(battleOp55),
|
||||
TEST(battleOp56),
|
||||
TEST(battleOp57),
|
||||
TEST(battleOp58),
|
||||
TEST(battleOp59), // draws wrong
|
||||
TEST(battleOp59),
|
||||
TEST(battleOp60),
|
||||
|
||||
TEST(battleOp61),
|
||||
TEST(battleOp62),
|
||||
TEST(battleOp63), // draws wrong
|
||||
TEST(battleOp64),
|
||||
TEST(battleOp65),
|
||||
TEST(battleOp66),
|
||||
@ -10836,7 +10779,7 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp82),
|
||||
TEST(battleOp83),
|
||||
TEST(battleOp84),
|
||||
TEST(battleOp85), // draws wrong
|
||||
TEST(battleOp85),
|
||||
TEST(battleOp86),
|
||||
TEST(battleOp87),
|
||||
TEST(battleOp88),
|
||||
@ -10905,24 +10848,20 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp145),
|
||||
TEST(battleOp146),
|
||||
TEST(battleOp147),
|
||||
TEST(battleOp148), // draws wrong
|
||||
TEST(battleOp149),
|
||||
TEST(battleOp150),
|
||||
|
||||
TEST(battleOp151),
|
||||
TEST(battleOp152),
|
||||
TEST(battleOp153),
|
||||
TEST(battleOp154),
|
||||
TEST(battleOp155),
|
||||
TEST(battleOp156),
|
||||
TEST(battleOp157),
|
||||
TEST(battleOp158),
|
||||
TEST(battleOp159),
|
||||
TEST(battleOp160),
|
||||
|
||||
TEST(battleOp161),
|
||||
TEST(battleOp162),
|
||||
TEST(battleOp163),
|
||||
TEST(battleOp164),
|
||||
TEST(battleOp165),
|
||||
TEST(battleOp166),
|
||||
@ -10942,9 +10881,7 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp179),
|
||||
TEST(battleOp180),
|
||||
|
||||
TEST(battleOp181),
|
||||
TEST(battleOp182),
|
||||
TEST(battleOp183),
|
||||
TEST(battleOp184),
|
||||
TEST(battleOp185),
|
||||
TEST(battleOp186),
|
||||
@ -10957,10 +10894,8 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp192),
|
||||
TEST(battleOp193),
|
||||
TEST(battleOp194),
|
||||
TEST(battleOp195),
|
||||
TEST(battleOp196),
|
||||
TEST(battleOp197),
|
||||
TEST(battleOp198),
|
||||
TEST(battleOp199),
|
||||
TEST(battleOp200),
|
||||
|
||||
@ -10995,7 +10930,6 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp227),
|
||||
TEST(battleOp228),
|
||||
TEST(battleOp229),
|
||||
TEST(battleOp230),
|
||||
|
||||
TEST(battleOp231),
|
||||
TEST(battleOp232),
|
||||
@ -11024,7 +10958,6 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp253),
|
||||
TEST(battleOp254),
|
||||
TEST(battleOp255),
|
||||
TEST(battleOp256),
|
||||
TEST(battleOp257),
|
||||
TEST(battleOp258),
|
||||
TEST(battleOp259),
|
||||
@ -11038,12 +10971,10 @@ static struct TestDesc tests[] = {
|
||||
TEST(battleOp266),
|
||||
TEST(battleOp267),
|
||||
TEST(battleOp268),
|
||||
TEST(battleOp269),
|
||||
TEST(battleOp270),
|
||||
|
||||
TEST(battleOp271),
|
||||
TEST(battleOp272),
|
||||
TEST(battleOp273),
|
||||
TEST(battleOp274),
|
||||
TEST(battleOp275),
|
||||
TEST(battleOp276),
|
||||
@ -11054,7 +10985,6 @@ static struct TestDesc tests[] = {
|
||||
|
||||
TEST(battleOp281),
|
||||
TEST(battleOp282),
|
||||
TEST(battleOp283),
|
||||
TEST(battleOp284),
|
||||
TEST(battleOp285),
|
||||
TEST(battleOp286),
|
||||
@ -11168,6 +11098,25 @@ static struct TestDesc tests[] = {
|
||||
TEST(issue414409c),
|
||||
TEST(issue414409b),
|
||||
TEST(issue414409),
|
||||
|
||||
// these draw wrong
|
||||
TEST(battleOp46), // dropped an outer cubic incorrectly
|
||||
// if assembly rewrite was done, the error would be hidden
|
||||
TEST(battleOp54),
|
||||
TEST(battleOp63),
|
||||
TEST(battleOp152),
|
||||
TEST(battleOp157),
|
||||
TEST(battleOp163),
|
||||
TEST(battleOp181),
|
||||
TEST(battleOp183),
|
||||
TEST(battleOp195),
|
||||
TEST(battleOp198),
|
||||
TEST(battleOp230),
|
||||
TEST(battleOp256),
|
||||
TEST(battleOp269),
|
||||
TEST(battleOp273),
|
||||
TEST(battleOp148),
|
||||
TEST(battleOp283),
|
||||
};
|
||||
|
||||
|
||||
|
||||
@ -19,6 +19,9 @@ inline void DebugDumpFloat(float x) {
|
||||
}
|
||||
}
|
||||
|
||||
inline void DebugDumpHexFloat(float x) {
|
||||
SkDebugf("SkBits2Float(0x%08x)", SkFloat2Bits(x));
|
||||
}
|
||||
|
||||
#if DEBUG_SHOW_TEST_NAME
|
||||
|
||||
@ -413,6 +416,17 @@ void SkDPoint::Dump(const SkPoint& pt) {
|
||||
SkDebugf("}");
|
||||
}
|
||||
|
||||
void SkDPoint::DumpHex(const SkPoint& pt) {
|
||||
SkDebugf("{");
|
||||
DebugDumpHexFloat(pt.fX);
|
||||
SkDebugf(", ");
|
||||
DebugDumpHexFloat(pt.fY);
|
||||
SkDebugf("}");
|
||||
}
|
||||
|
||||
void SkDQuad::dump() const {
|
||||
dumpComma("");
|
||||
}
|
||||
|
||||
void SkDQuad::dumpComma(const char* comma) const {
|
||||
SkDebugf("{{");
|
||||
@ -425,10 +439,6 @@ void SkDQuad::dumpComma(const char* comma) const {
|
||||
SkDebugf("}}%s\n", comma ? comma : "");
|
||||
}
|
||||
|
||||
void SkDQuad::dump() const {
|
||||
dumpComma("");
|
||||
}
|
||||
|
||||
void SkIntersectionHelper::dump() const {
|
||||
SkDPoint::Dump(pts()[0]);
|
||||
SkDPoint::Dump(pts()[1]);
|
||||
@ -492,6 +502,18 @@ void SkOpSegment::dumpPts() const {
|
||||
SkDebugf("}}\n");
|
||||
}
|
||||
|
||||
void SkOpSegment::dumpHexPts() const {
|
||||
int last = SkPathOpsVerbToPoints(fVerb);
|
||||
SkDebugf("((SkOpSegment*) 0x%p) [%d] {{", this, debugID());
|
||||
int index = 0;
|
||||
do {
|
||||
SkDPoint::DumpHex(fPts[index]);
|
||||
SkDebugf(", ");
|
||||
} while (++index < last);
|
||||
SkDPoint::DumpHex(fPts[index]);
|
||||
SkDebugf("}}\n");
|
||||
}
|
||||
|
||||
void SkOpSegment::dumpDPts() const {
|
||||
int count = SkPathOpsVerbToPoints(fVerb);
|
||||
SkDebugf("((SkOpSegment*) 0x%p) [%d] {{", this, debugID());
|
||||
|
||||
@ -322,16 +322,23 @@ SK_DECLARE_STATIC_MUTEX(compareDebugOut3);
|
||||
SK_DECLARE_STATIC_MUTEX(compareDebugOut4);
|
||||
static int comparePaths(skiatest::Reporter* reporter, const char* testName, const SkPath& one,
|
||||
const SkPath& scaledOne, const SkPath& two, const SkPath& scaledTwo, SkBitmap& bitmap,
|
||||
const SkPath& a, const SkPath& b, const SkPathOp shapeOp, const SkMatrix& scale) {
|
||||
const SkPath& a, const SkPath& b, const SkPathOp shapeOp, const SkMatrix& scale,
|
||||
bool expectSuccess) {
|
||||
int errors2x2;
|
||||
const int MAX_ERRORS = 8;
|
||||
(void) pathsDrawTheSame(bitmap, scaledOne, scaledTwo, errors2x2);
|
||||
if (!expectSuccess) {
|
||||
if (errors2x2 <= MAX_ERRORS) {
|
||||
REPORTER_ASSERT(reporter, 0);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
if (errors2x2 == 0) {
|
||||
if (gShowPath) {
|
||||
showPathOpPath(testName, one, two, a, b, scaledOne, scaledTwo, shapeOp, scale);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
const int MAX_ERRORS = 8;
|
||||
if (errors2x2 > MAX_ERRORS && gComparePathsAssert) {
|
||||
SkAutoMutexAcquire autoM(compareDebugOut3);
|
||||
SkDebugf("\n*** this test fails ***\n");
|
||||
@ -472,7 +479,7 @@ static void showName(const SkPath& a, const SkPath& b, const SkPathOp shapeOp) {
|
||||
#endif
|
||||
|
||||
static bool innerPathOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
const SkPathOp shapeOp, const char* testName, bool threaded) {
|
||||
const SkPathOp shapeOp, const char* testName, bool threaded, bool expectSuccess) {
|
||||
#if DEBUG_SHOW_TEST_NAME
|
||||
showName(a, b, shapeOp);
|
||||
#endif
|
||||
@ -510,7 +517,7 @@ static bool innerPathOp(skiatest::Reporter* reporter, const SkPath& a, const SkP
|
||||
scaledOut.addPath(out, scale);
|
||||
scaledOut.setFillType(out.getFillType());
|
||||
int result = comparePaths(reporter, testName, pathOut, scaledPathOut, out, scaledOut, bitmap,
|
||||
a, b, shapeOp, scale);
|
||||
a, b, shapeOp, scale, expectSuccess);
|
||||
if (result && gPathStrAssert) {
|
||||
REPORTER_ASSERT(reporter, 0);
|
||||
}
|
||||
@ -519,8 +526,13 @@ static bool innerPathOp(skiatest::Reporter* reporter, const SkPath& a, const SkP
|
||||
}
|
||||
|
||||
bool testPathOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
const SkPathOp shapeOp, const char* testName) {
|
||||
return innerPathOp(reporter, a, b, shapeOp, testName, false);
|
||||
const SkPathOp shapeOp, const char* testName) {
|
||||
return innerPathOp(reporter, a, b, shapeOp, testName, false, true);
|
||||
}
|
||||
|
||||
bool testPathOpCheck(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
const SkPathOp shapeOp, const char* testName, bool checkFail) {
|
||||
return innerPathOp(reporter, a, b, shapeOp, testName, false, checkFail);
|
||||
}
|
||||
|
||||
bool testPathFailOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
@ -539,7 +551,7 @@ bool testPathFailOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath&
|
||||
|
||||
bool testThreadedPathOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
const SkPathOp shapeOp, const char* testName) {
|
||||
return innerPathOp(reporter, a, b, shapeOp, testName, true);
|
||||
return innerPathOp(reporter, a, b, shapeOp, testName, true, true);
|
||||
}
|
||||
|
||||
SK_DECLARE_STATIC_MUTEX(gMutex);
|
||||
|
||||
@ -30,11 +30,13 @@ extern int comparePaths(const SkPath& one, const SkPath& two, SkBitmap& bitmap);
|
||||
extern bool drawAsciiPaths(const SkPath& one, const SkPath& two, bool drawPaths);
|
||||
extern void showOp(const SkPathOp op);
|
||||
extern bool testPathOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
const SkPathOp , const char* testName);
|
||||
const SkPathOp , const char* testName);
|
||||
extern bool testPathOpCheck(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
const SkPathOp , const char* testName, bool checkFail);
|
||||
extern bool testPathFailOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
const SkPathOp , const char* testName);
|
||||
const SkPathOp , const char* testName);
|
||||
extern bool testThreadedPathOp(skiatest::Reporter* reporter, const SkPath& a, const SkPath& b,
|
||||
const SkPathOp , const char* testName);
|
||||
const SkPathOp , const char* testName);
|
||||
extern bool testSimplify(SkPath& path, bool useXor, SkPath& out, PathOpsThreadState& state,
|
||||
const char* pathStr);
|
||||
extern bool testSimplify(skiatest::Reporter* reporter, const SkPath& path, const char* filename);
|
||||
|
||||
2434
tests/PathOpsFuzz763Test.cpp
Executable file
2434
tests/PathOpsFuzz763Test.cpp
Executable file
File diff suppressed because it is too large
Load Diff
@ -1719,17 +1719,10 @@ static void skphealth_com76(skiatest::Reporter* reporter, const char* filename)
|
||||
SkPath pathB;
|
||||
pathB.setFillType(SkPath::kWinding_FillType);
|
||||
pathB.moveTo(704.000000f, 3.00000000f);
|
||||
#if 0
|
||||
pathB.lineTo(719.500000f, 3.00000000f);
|
||||
pathB.lineTo(705.000000f, 33.0000000f);
|
||||
pathB.lineTo(704.000000f, 33.0000000f);
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
#else
|
||||
pathB.lineTo(704.000000f, 33.0000000f);
|
||||
pathB.lineTo(705.000000f, 33.0000000f);
|
||||
pathB.lineTo(719.500000f, 3.00000000f);
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
#endif
|
||||
}
|
||||
|
||||
static void skpahrefs_com88(skiatest::Reporter* reporter, const char* filename) {
|
||||
@ -2733,9 +2726,6 @@ static void skpcarpetplanet_ru22(skiatest::Reporter* reporter, const char* filen
|
||||
|
||||
// this fails because cubic/quad misses an intersection (failure is isolated in c/q int test)
|
||||
static void skpcarrot_is24(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType(SkPath::kEvenOdd_FillType);
|
||||
path.moveTo(945, 597);
|
||||
@ -2758,7 +2748,7 @@ static void skpcarrot_is24(skiatest::Reporter* reporter, const char* filename) {
|
||||
pathB.cubicTo(1019.77502f, 679.955017f, 1020.08099f, 676.094971f, 1020.08099f, 672.161987f);
|
||||
pathB.cubicTo(1020.08002f, 630.73999f, 986.502014f, 597.161987f, 945.080994f, 597.161987f);
|
||||
pathB.close();
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
testPathOpCheck(reporter, path, pathB, kIntersect_PathOp, filename, FLAGS_runFail);
|
||||
}
|
||||
|
||||
static void skpbangalorenest_com4(skiatest::Reporter* reporter, const char* filename) {
|
||||
@ -3283,9 +3273,6 @@ static void cubicOp113(skiatest::Reporter* reporter, const char* filename) {
|
||||
}
|
||||
|
||||
static void cubicOp114(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path, pathB;
|
||||
path.setFillType(SkPath::kWinding_FillType);
|
||||
path.moveTo(0, 1);
|
||||
@ -3295,7 +3282,7 @@ static void cubicOp114(skiatest::Reporter* reporter, const char* filename) {
|
||||
pathB.moveTo(1, 3);
|
||||
pathB.cubicTo(-1, 2, 3.5f, 1.33333337f, 0, 1);
|
||||
pathB.close();
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
testPathOpCheck(reporter, path, pathB, kIntersect_PathOp, filename, FLAGS_runFail);
|
||||
}
|
||||
|
||||
static void cubicOp114asQuad(skiatest::Reporter* reporter, const char* filename) {
|
||||
@ -3461,9 +3448,6 @@ static void rects4(skiatest::Reporter* reporter, const char* filename) {
|
||||
}
|
||||
|
||||
static void issue2753(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (!FLAGS_runFail) {
|
||||
return;
|
||||
}
|
||||
SkPath path1;
|
||||
path1.moveTo(142.701f, 110.568f);
|
||||
path1.lineTo(142.957f, 100);
|
||||
@ -3480,7 +3464,7 @@ static void issue2753(skiatest::Reporter* reporter, const char* filename) {
|
||||
path2.cubicTo(188.201f, 117.601f, 174.801f, 93, 39, 124.001f);
|
||||
path2.close();
|
||||
|
||||
testPathOp(reporter, path1, path2, kUnion_PathOp, filename);
|
||||
testPathOpCheck(reporter, path1, path2, kUnion_PathOp, filename, FLAGS_runFail);
|
||||
}
|
||||
|
||||
static void issue2808(skiatest::Reporter* reporter, const char* filename) {
|
||||
@ -3511,10 +3495,25 @@ static void issue2808(skiatest::Reporter* reporter, const char* filename) {
|
||||
testPathOp(reporter, path1, path2, kUnion_PathOp, filename);
|
||||
}
|
||||
|
||||
static void cubicOp115(skiatest::Reporter* reporter, const char* filename) {
|
||||
SkPath path, pathB;
|
||||
path.setFillType(SkPath::kWinding_FillType);
|
||||
path.moveTo(0,1);
|
||||
path.cubicTo(3,4, 2,1, 5,3);
|
||||
path.close();
|
||||
pathB.setFillType(SkPath::kWinding_FillType);
|
||||
pathB.moveTo(1,2);
|
||||
pathB.cubicTo(3,5, 1,0, 4,3);
|
||||
pathB.close();
|
||||
SkPath path2(path);
|
||||
testPathOp(reporter, path, pathB, kDifference_PathOp, filename);
|
||||
}
|
||||
|
||||
static void (*firstTest)(skiatest::Reporter* , const char* filename) = 0;
|
||||
static void (*stopTest)(skiatest::Reporter* , const char* filename) = 0;
|
||||
|
||||
static struct TestDesc tests[] = {
|
||||
TEST(cubicOp115),
|
||||
TEST(issue2753), // FIXME: pair of cubics miss intersection
|
||||
TEST(cubicOp114), // FIXME: curve with inflection is ordered the wrong way
|
||||
TEST(issue2808),
|
||||
|
||||
@ -53,6 +53,28 @@ static void standardTestCases(skiatest::Reporter* reporter) {
|
||||
}
|
||||
|
||||
static const SkDQuad testSet[] = {
|
||||
{{{-37.3484879,10.0192947}, {-36.4966316,13.2140198}, {-38.1506348,16.0788383}}},
|
||||
{{{-38.1462746,16.08918}, {-36.4904327,13.2193804}, {-37.3484879,10.0192947}}},
|
||||
|
||||
{{{-37.3513985,10.0082998}, {-36.4938011,13.2090998}, {-38.1506004,16.0788002}}},
|
||||
{{{-37.3508987,10.0102997}, {-36.4930992,13.2110004}, {-38.1497993,16.0809002}}},
|
||||
|
||||
{{{-37.3508987,10.0102997}, {-37.3510017,10.0098}, {-37.3512001,10.0093002}}},
|
||||
{{{-49.0778008,19.0097008}, {-38.2086983,6.80954981}, {-37.3508987,10.0102997}}},
|
||||
|
||||
{{{SkBits2Float(0xc22423b2), SkBits2Float(0x40afae2c)},
|
||||
{SkBits2Float(0xc2189b24), SkBits2Float(0x40e3f058)},
|
||||
{SkBits2Float(0xc21511d9), SkBits2Float(0x41251125)}}},
|
||||
{{{SkBits2Float(0xc2153d2f), SkBits2Float(0x412299db)},
|
||||
{SkBits2Float(0xc2153265), SkBits2Float(0x41233845)},
|
||||
{SkBits2Float(0xc21527fc), SkBits2Float(0x4123d684)}}},
|
||||
|
||||
{{{-37.3097496, 10.1625624}, {-37.2992134, 10.2012377}, {-37.2890472, 10.239872}}},
|
||||
{{{-41.0348587, 5.49001122}, {-38.1515045, 7.12308884}, {-37.2674294, 10.3166857}}},
|
||||
|
||||
{{{-52.8062439,14.1493912}, {-53.6638947,10.948595}, {-52.0070419,8.07883835}}},
|
||||
{{{-52.8054848,14.1522331}, {-53.6633072,10.9514809}, {-52.0066071,8.08163643}}},
|
||||
|
||||
{{{441.853149, 308.209106}, {434.672272, 315.389984}, {424.516998, 315.389984}}},
|
||||
{{{385.207275, 334.241272}, {406.481598, 312.96698}, {436.567993, 312.96698}}},
|
||||
|
||||
@ -289,10 +311,6 @@ static void oneOffTest1(skiatest::Reporter* reporter, size_t outer, size_t inner
|
||||
}
|
||||
}
|
||||
|
||||
DEF_TEST(PathOpsQuadIntersectionOneOff, reporter) {
|
||||
oneOffTest1(reporter, 0, 1);
|
||||
}
|
||||
|
||||
static void oneOffTests(skiatest::Reporter* reporter) {
|
||||
for (size_t outer = 0; outer < testSetCount - 1; ++outer) {
|
||||
for (size_t inner = outer + 1; inner < testSetCount; ++inner) {
|
||||
@ -338,10 +356,6 @@ static void coincidentTest(skiatest::Reporter* reporter) {
|
||||
}
|
||||
}
|
||||
|
||||
DEF_TEST(PathOpsQuadIntersectionCoincidenceOneOff, reporter) {
|
||||
coincidentTestOne(reporter, 0, 1);
|
||||
}
|
||||
|
||||
static int floatSign(double x) {
|
||||
return x < 0 ? -1 : x > 0 ? 1 : 0;
|
||||
}
|
||||
@ -512,3 +526,11 @@ DEF_TEST(PathOpsQuadIntersection, reporter) {
|
||||
if (false) QuadraticIntersection_IntersectionFinder();
|
||||
if (false) QuadraticIntersection_PointFinder();
|
||||
}
|
||||
|
||||
DEF_TEST(PathOpsQuadIntersectionCoincidenceOneOff, reporter) {
|
||||
coincidentTestOne(reporter, 0, 1);
|
||||
}
|
||||
|
||||
DEF_TEST(PathOpsQuadIntersectionOneOff, reporter) {
|
||||
oneOffTest1(reporter, 0, 1);
|
||||
}
|
||||
|
||||
@ -56,7 +56,7 @@ static void standardTestCases(skiatest::Reporter* reporter) {
|
||||
for (index = firstQuadraticModLineTest; index < quadraticModEpsilonLines_count; ++index) {
|
||||
const SkDQuad& quad = quadraticModEpsilonLines[index];
|
||||
order = reducer.reduce(quad);
|
||||
if (order != 3) {
|
||||
if (order != 2 && order != 3) { // FIXME: data probably is not good
|
||||
SkDebugf("[%d] line mod quad order=%d\n", (int) index, order);
|
||||
}
|
||||
}
|
||||
|
||||
@ -8,8 +8,6 @@
|
||||
|
||||
#define TEST(name) { name, #name }
|
||||
|
||||
#define TEST_NEW_FAILURES 0
|
||||
|
||||
static void skpcheeseandburger_com225(skiatest::Reporter* reporter, const char* filename) {
|
||||
SkPath path;
|
||||
path.setFillType(SkPath::kEvenOdd_FillType);
|
||||
@ -3590,7 +3588,6 @@ static void skpwww_googleventures_com_32(skiatest::Reporter* reporter, const cha
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
}
|
||||
|
||||
#if TEST_NEW_FAILURES
|
||||
static void skpwww_devbridge_com_22(skiatest::Reporter* reporter, const char* filename) {
|
||||
SkPath path;
|
||||
path.setFillType(SkPath::kEvenOdd_FillType);
|
||||
@ -3616,10 +3613,14 @@ static void skpwww_devbridge_com_22(skiatest::Reporter* reporter, const char* fi
|
||||
pathB.quadTo(4942.75146f, 1523, 4962.375f, 1542.6239f);
|
||||
pathB.quadTo(4981.99902f, 1562.24768f, 4981.99902f, 1590);
|
||||
pathB.close();
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
if (FLAGS_runFail) {
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
} else {
|
||||
// INVESTIGATE : why this normal test takes fail case (test has never worked)
|
||||
testPathFailOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
}
|
||||
}
|
||||
|
||||
// cubic/quad intersection
|
||||
static void skpwww_alamdi_com_3(skiatest::Reporter* reporter, const char* filename) {
|
||||
SkPath path;
|
||||
path.setFillType(SkPath::kEvenOdd_FillType);
|
||||
@ -3652,7 +3653,6 @@ static void skpwww_alamdi_com_3(skiatest::Reporter* reporter, const char* filena
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
}
|
||||
|
||||
// bumpSpan failed assertion "span->fOppValue >= 0"
|
||||
static void skpwww_familysurvivalprotocol_wordpress_com_61(skiatest::Reporter* reporter, const char* filename) {
|
||||
SkPath path;
|
||||
path.setFillType(SkPath::kEvenOdd_FillType);
|
||||
@ -3670,7 +3670,6 @@ static void skpwww_familysurvivalprotocol_wordpress_com_61(skiatest::Reporter* r
|
||||
pathB.lineTo(165, 14557);
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
}
|
||||
#endif
|
||||
|
||||
static void skpwww_firstunitedbank_com_19(skiatest::Reporter* reporter, const char* filename) {
|
||||
SkPath path;
|
||||
@ -3761,8 +3760,6 @@ static void skpwww_lptemp_com_3(skiatest::Reporter* reporter, const char* filena
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
}
|
||||
|
||||
#if TEST_NEW_FAILURES
|
||||
// SkOpSegment.cpp:3915: failed assertion "otherEnd >= 0"
|
||||
static void skpwww_shinydemos_com_15(skiatest::Reporter* reporter, const char* filename) {
|
||||
SkPath path;
|
||||
path.setFillType(SkPath::kEvenOdd_FillType);
|
||||
@ -3786,6 +3783,9 @@ static void skpwww_shinydemos_com_15(skiatest::Reporter* reporter, const char* f
|
||||
|
||||
// SkOpSegment.cpp:4398: failed assertion "!span->fDone"
|
||||
static void skpwww_lptemp_com_5(skiatest::Reporter* reporter, const char* filename) {
|
||||
if (/* 0 && */ !FLAGS_runFail) { // has never worked MUST BE FIXED BEFORE NEXT CHECKIN
|
||||
return;
|
||||
}
|
||||
SkPath path;
|
||||
path.setFillType(SkPath::kEvenOdd_FillType);
|
||||
path.moveTo(78.6429825f, 3150.97632f);
|
||||
@ -3814,22 +3814,19 @@ static void skpwww_lptemp_com_5(skiatest::Reporter* reporter, const char* filena
|
||||
pathB.lineTo(77.6666718f, 3153.3335f);
|
||||
pathB.cubicTo(77.6666718f, 3151.49268f, 79.15905f, 3150, 81, 3150);
|
||||
pathB.close();
|
||||
testPathOp(reporter, path, pathB, kIntersect_PathOp, filename);
|
||||
testPathOpCheck(reporter, path, pathB, kIntersect_PathOp, filename, FLAGS_runFail);
|
||||
}
|
||||
#endif
|
||||
|
||||
static void (*firstTest)(skiatest::Reporter* , const char* filename) = 0;
|
||||
|
||||
static struct TestDesc tests[] = {
|
||||
TEST(skpwww_lptemp_com_3),
|
||||
TEST(skpwww_shinydemos_com_5),
|
||||
#if TEST_NEW_FAILURES
|
||||
TEST(skpwww_lptemp_com_5),
|
||||
TEST(skpwww_shinydemos_com_15),
|
||||
TEST(skpwww_familysurvivalprotocol_wordpress_com_61),
|
||||
TEST(skpwww_alamdi_com_3),
|
||||
TEST(skpwww_devbridge_com_22),
|
||||
#endif
|
||||
TEST(skpwww_firstunitedbank_com_19),
|
||||
TEST(skpwww_googleventures_com_32),
|
||||
TEST(skpwww_9to5mac_com_64),
|
||||
|
||||
@ -976,11 +976,38 @@ computed quadratics set
|
||||
{{{0.0451734141f, -59.9999847f}, {0.0438041016f, -59.9999886f}, {0.0424379632f, -59.9999886f}, {0.0410718247f, -59.9999886f}}}
|
||||
</div>
|
||||
|
||||
<div id="fuzz763_3084">
|
||||
{{{38.6568527f, 27.3431454f}, {41, 29.6862907f}, {41, 33}}}
|
||||
{{{39.131218f, 27.8554096f}, {41, 30.0406685f}, {41, 33}}}
|
||||
{{{44.6041069f, 27.9369583f}, {41.8078537f, 28.9057903f}, {39.131218f, 27.8554096f}}}
|
||||
</div>
|
||||
|
||||
<div id="fuzz763_378">
|
||||
{{{-52.8062439,14.1493912}, {-53.6638947,10.948595}, {-52.0070419,8.07883835}}
|
||||
{{-52.8054848,14.1522331}, {-53.6633072,10.9514809}, {-52.0066071,8.08163643}}
|
||||
</div>
|
||||
|
||||
<div id="fuzz763_378d">
|
||||
{{{-37.351398500000002, 10.0082998}, {-36.493801099999999, 13.209099800000001}, {-38.150600400000002, 16.0788002}}
|
||||
{{-37.350898700000002, 10.010299699999999}, {-36.493099200000003, 13.2110004}, {-38.149799299999998, 16.080900199999999}}}
|
||||
{{-37.320497331221297, 10.126736679362402}, {-37.320543141534543 fY=10.126556206903867 }}
|
||||
{{-37.514829818825397, 14.722977321623326}, {=-37.514249241879924 fY=14.725464892492159 }}
|
||||
</div>
|
||||
|
||||
<div id="fuzz763_6411089">
|
||||
{{38.5810318, 38.7318115}, {38.5877266, 38.7252655}, {38.5931816, 38.7199173}}
|
||||
{{38.5931816, 38.7199173}, {38.5880508, 38.7249527}, {38.5810318, 38.7318115}}
|
||||
</div>
|
||||
|
||||
</div>
|
||||
|
||||
<script type="text/javascript">
|
||||
|
||||
var testDivs = [
|
||||
fuzz763_6411089,
|
||||
fuzz763_378d,
|
||||
fuzz763_378,
|
||||
fuzz763_3084,
|
||||
battle6001,
|
||||
issue2753,
|
||||
skpwww_9to5mac_com_64,
|
||||
|
||||
@ -1,180 +1,471 @@
|
||||
<html>
|
||||
<head>
|
||||
<div height="0" hidden="true">
|
||||
<div id="fuzz487a">
|
||||
RunTestSet [fuzz487a]
|
||||
<div id="fuzz763_1026368">
|
||||
RunTestSet [fuzz763_1026368]
|
||||
|
||||
{{172.5,96}, {137.600006,96}},
|
||||
{{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}},
|
||||
{{107.500008,56.7999992}, {116.500008,23.0999985}},
|
||||
{{116.500008,23.0999985}, {110.200005,21.3999977}, {103.600006,20.4999981}, {97.0000076,20.4999981}},
|
||||
{{97.0000076,20.4999981}, {97.0000076,55.4000015}},
|
||||
{{97.0000076,55.4000015}, {97.0000076,55.4000015}},
|
||||
{{97.0000076,55.4000015}, {78.2000122,55.4000015}, {62.4000092,68.2000046}, {57.8000069,85.5}},
|
||||
{{57.8000069,85.5}, {24.1000061,76.5}},
|
||||
{{24.1000061,76.5}, {22.4000053,82.8000031}, {21.5000057,89.4000015}, {21.5000057,96}},
|
||||
{{21.5000057,96}, {56.4000092,96}},
|
||||
{{56.4000092,96}, {56.4000092,96}},
|
||||
{{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}},
|
||||
{{228.900009,192}, {172.5,96}},
|
||||
{{27.3431454,27.3431454}, {29.6862907,25}, {33,25}},
|
||||
{{33,25}, {36.3137093,25}, {38.6568527,27.3431454}},
|
||||
{{38.6568527,27.3431454}, {41,29.6862907}, {41,33}},
|
||||
{{41,33}, {41,36.3137093}, {38.6568527,38.6568527}},
|
||||
{{38.6568527,38.6568527}, {38.6510239,38.6626816}, {38.6447449,38.6689377}},
|
||||
{{38.6447449,38.6689377}, {38.6394348,38.6742554}, {38.6341171,38.6795731}},
|
||||
{{38.6341171,38.6795731}, {38.6284409,38.6852493}, {38.6227531,38.6909218}},
|
||||
{{38.6227531,38.6909218}, {36.2775421,41.0320053}, {32.9638329,41.0290833}},
|
||||
{{32.9638329,41.0290833}, {29.6501274,41.0261612}, {27.3090477,38.6809464}},
|
||||
{{27.3090477,38.6809464}, {24.9679718,36.3357391}, {24.9708939,33.0220299}},
|
||||
{{24.9708939,33.0220299}, {24.973814,29.7083225}, {27.319025,27.3672428}},
|
||||
{{27.319025,27.3672428}, {27.3209743,27.3652973}, {27.3229256,27.3633518}},
|
||||
{{27.3229256,27.3633518}, {27.324995,27.3612823}, {27.3270645,27.3592148}},
|
||||
{{27.3270645,27.3592148}, {27.3312511,27.355032}, {27.3354416,27.3508568}},
|
||||
{{27.3354416,27.3508568}, {27.3332844,27.3530178}, {27.331131,27.3551788}},
|
||||
{{27.331131,27.3551788}, {27.3369579,27.3493824}, {27.3431988,27.3431988}},
|
||||
{{27.3431988,27.3431988}, {27.3431454,27.3431454}},
|
||||
{{38.6398277,38.6738319}, {38.6447258,38.6689186}},
|
||||
{{38.6447258,38.6689186}, {38.6447449,38.6689377}},
|
||||
{{38.6447449,38.6689377}, {38.6422882,38.6713867}, {38.6398277,38.6738319}},
|
||||
op union
|
||||
{{172.5,96}, {137.600006,96}},
|
||||
{{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}},
|
||||
{{117.300003,60.9000015}, {134.800003,30.7000008}},
|
||||
{{134.800003,30.7000008}, {123.700005,24.3000011}, {110.800003,20.6000004}, {97.1000061,20.6000004}},
|
||||
{{97.1000061,20.6000004}, {97.1000061,55.5}},
|
||||
{{97.1000061,55.5}, {82.1000061,55.5}, {69.0000076,63.7000008}, {62.0000076,75.8000031}},
|
||||
{{62.0000076,75.8000031}, {31.6000004,58.2999992}},
|
||||
{{31.6000004,58.2999992}, {25.2000008,69.4000015}, {21.5,82.3000031}, {21.5,96}},
|
||||
{{21.5,96}, {56.4000015,96}},
|
||||
{{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}},
|
||||
{{76.6999969,131.100006}, {60.6999969,131.100006}, {47.2999954,141.900009}, {43.3999977,156.700012}},
|
||||
{{43.3999977,156.700012}, {3.33333338e+029,119.400002}},
|
||||
{{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}},
|
||||
{{29.3999996,-10.8000002}, {33.2999992,-25.6000004}},
|
||||
{{33.2999992,-25.6000004}, {62,-17.9000015}},
|
||||
{{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}},
|
||||
{{161.199997,136}, {172.5,96}},
|
||||
debugShowCubicIntersection no self intersect {{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}}
|
||||
debugShowCubicIntersection no self intersect {{134.800003,30.7000008}, {123.700005,24.3000011}, {110.800003,20.6000004}, {97.1000061,20.6000004}}
|
||||
debugShowCubicIntersection no self intersect {{97.1000061,55.5}, {82.1000061,55.5}, {69.0000076,63.7000008}, {62.0000076,75.8000031}}
|
||||
debugShowCubicIntersection no self intersect {{31.6000004,58.2999992}, {25.2000008,69.4000015}, {21.5,82.3000031}, {21.5,96}}
|
||||
debugShowCubicIntersection no self intersect {{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}}
|
||||
debugShowCubicIntersection no self intersect {{76.6999969,131.100006}, {60.6999969,131.100006}, {47.2999954,141.900009}, {43.3999977,156.700012}}
|
||||
debugShowCubicIntersection no self intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}} {{137.600006,96}} wnTs[0]=1 {{172.5,96}, {137.600006,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{137.600006,96}} wnTs[0]=1 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicLineIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{172.5,96}, {137.600006,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{161.199997,136}, {172.5,96}} {{172.5,96}} wnTs[0]=0 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}} {{117.300003,60.9000015}} wnTs[0]=0 {{117.300003,60.9000015}, {134.800003,30.7000008}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}} {{137.600006,96}} wtTs[1]=1 {{117.300003,60.9000015}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} wnTs[1]=1
|
||||
debugShowCubicIntersection no intersect {{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}} {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{134.800003,30.7000008}, {123.700005,24.3000011}, {110.800003,20.6000004}, {97.1000061,20.6000004}} {{134.800003,30.7000008}} wnTs[0]=1 {{117.300003,60.9000015}, {134.800003,30.7000008}}
|
||||
debugShowLineIntersection wtTs[0]=0 {{117.300003,60.9000015}, {134.800003,30.7000008}} {{117.300003,60.9000015}} wtTs[1]=1 {{134.800003,30.7000008}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} wnTs[1]=1
|
||||
debugShowCubicLineIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{117.300003,60.9000015}, {134.800003,30.7000008}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{134.800003,30.7000008}, {123.700005,24.3000011}, {110.800003,20.6000004}, {97.1000061,20.6000004}} {{97.1000061,20.6000004}} wnTs[0]=0 {{97.1000061,20.6000004}, {97.1000061,55.5}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{134.800003,30.7000008}, {123.700005,24.3000011}, {110.800003,20.6000004}, {97.1000061,20.6000004}} {{134.800003,30.7000008}} wtTs[1]=1 {{97.1000061,20.6000004}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} wnTs[1]=1
|
||||
debugShowCubicIntersection no intersect {{134.800003,30.7000008}, {123.700005,24.3000011}, {110.800003,20.6000004}, {97.1000061,20.6000004}} {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{97.1000061,55.5}, {82.1000061,55.5}, {69.0000076,63.7000008}, {62.0000076,75.8000031}} {{97.1000061,55.5}} wnTs[0]=1 {{97.1000061,20.6000004}, {97.1000061,55.5}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{97.1000061,20.6000004}} wnTs[0]=0 {{97.1000061,20.6000004}, {97.1000061,55.5}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0.13656589 {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{97.1000061,40.6604424}} wnTs[0]=0.574798 {{97.1000061,20.6000004}, {97.1000061,55.5}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{97.1000061,55.5}, {82.1000061,55.5}, {69.0000076,63.7000008}, {62.0000076,75.8000031}} {{62.0000076,75.8000031}} wnTs[0]=0 {{62.0000076,75.8000031}, {31.6000004,58.2999992}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{97.1000061,55.5}, {82.1000061,55.5}, {69.0000076,63.7000008}, {62.0000076,75.8000031}} {{97.1000061,55.5}} wtTs[1]=1 {{62.0000076,75.8000031}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} wnTs[1]=1
|
||||
debugShowCubicIntersection no intersect {{97.1000061,55.5}, {82.1000061,55.5}, {69.0000076,63.7000008}, {62.0000076,75.8000031}} {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{31.6000004,58.2999992}, {25.2000008,69.4000015}, {21.5,82.3000031}, {21.5,96}} {{31.6000004,58.2999992}} wnTs[0]=1 {{62.0000076,75.8000031}, {31.6000004,58.2999992}}
|
||||
debugShowLineIntersection wtTs[0]=0 {{62.0000076,75.8000031}, {31.6000004,58.2999992}} {{62.0000076,75.8000031}} wtTs[1]=1 {{31.6000004,58.2999992}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} wnTs[1]=1
|
||||
debugShowCubicLineIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{62.0000076,75.8000031}, {31.6000004,58.2999992}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{31.6000004,58.2999992}, {25.2000008,69.4000015}, {21.5,82.3000031}, {21.5,96}} {{21.5,96}} wnTs[0]=0 {{21.5,96}, {56.4000015,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{31.6000004,58.2999992}, {25.2000008,69.4000015}, {21.5,82.3000031}, {21.5,96}} {{31.6000004,58.2999992}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}} {{56.4000015,96}} wnTs[0]=1 {{21.5,96}, {56.4000015,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{56.4000015,96}} wnTs[0]=1 {{21.5,96}, {56.4000015,96}}
|
||||
debugShowCubicIntersection wtTs[0]=1 {{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}} {{76.6999969,131.100006}} wnTs[0]=0 {{76.6999969,131.100006}, {60.6999969,131.100006}, {47.2999954,141.900009}, {43.3999977,156.700012}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}} {{76.6999969,131.100006}} wnTs[0]=0 {{43.3999977,156.700012}, {3.33333338e+029,119.400002}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}} {{56.4000015,96}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}}
|
||||
debugShowCubicIntersection no intersect {{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}} {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{76.6999969,131.100006}, {60.6999969,131.100006}, {47.2999954,141.900009}, {43.3999977,156.700012}} {{76.6999969,131.100006}} wtTs[1]=1 {{43.3999977,156.700012}} wnTs[0]=0 {{43.3999977,156.700012}, {3.33333338e+029,119.400002}} wnTs[1]=0
|
||||
debugShowCubicIntersection no intersect {{76.6999969,131.100006}, {60.6999969,131.100006}, {47.2999954,141.900009}, {43.3999977,156.700012}} {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{43.3999977,156.700012}, {3.33333338e+029,119.400002}} {{3.33333338e+029,119.400002}} wnTs[0]=0 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{161.199997,136}} wnTs[0]=0 {{43.3999977,156.700012}, {3.33333338e+029,119.400002}}
|
||||
debugShowLineIntersection wtTs[0]=0 {{43.3999977,156.700012}, {3.33333338e+029,119.400002}} {{161.199997,136}} wnTs[0]=0 {{161.199997,136}, {172.5,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{29.3999996,-10.8000002}} wnTs[0]=0 {{29.3999996,-10.8000002}, {33.2999992,-25.6000004}}
|
||||
debugShowCubicLineIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{172.5,96}} wnTs[0]=1 {{161.199997,136}, {172.5,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{29.3999996,-10.8000002}, {33.2999992,-25.6000004}} {{33.2999992,-25.6000004}} wnTs[0]=0 {{33.2999992,-25.6000004}, {62,-17.9000015}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{62,-17.9000015}} wnTs[0]=1 {{33.2999992,-25.6000004}, {62,-17.9000015}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{161.199997,136}} wnTs[0]=0 {{161.199997,136}, {172.5,96}}
|
||||
debugShowLineIntersection wtTs[0]=0 {{172.5,96}, {137.600006,96}} {{172.5,96}} wtTs[1]=1 {{137.600006,96}} wnTs[0]=0 {{172.5,96}, {137.600006,96}} wnTs[1]=1
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}} {{137.600006,96}} wnTs[0]=1 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicLineIntersection no intersect {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}} {{172.5,96}, {137.600006,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{228.900009,192}, {172.5,96}} {{172.5,96}} wnTs[0]=0 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}} {{137.600006,96}} wnTs[0]=1 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicIntersection wtTs[0]=0 {{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}} {{137.600006,96}} wnTs[0]=0 {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}}
|
||||
debugShowCubicIntersection no intersect {{137.600006,96}, {137.600006,81}, {129.400009,67.9000015}, {117.300003,60.9000015}} {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0.798977321 {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}} {{117.320122,60.8652802}} wnTs[0]=0.00114967 {{117.300003,60.9000015}, {134.800003,30.7000008}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0.511418257 {{134.800003,30.7000008}, {123.700005,24.3000011}, {110.800003,20.6000004}, {97.1000061,20.6000004}} {{116.491173,23.1330757}} wnTs[0]=0.999019 {{107.500008,56.7999992}, {116.500008,23.0999985}}
|
||||
debugShowCubicIntersection no intersect {{134.800003,30.7000008}, {123.700005,24.3000011}, {110.800003,20.6000004}, {97.1000061,20.6000004}} {{116.500008,23.0999985}, {110.200005,21.3999977}, {103.600006,20.4999981}, {97.0000076,20.4999981}}
|
||||
debugShowCubicLineIntersection no intersect {{116.500008,23.0999985}, {110.200005,21.3999977}, {103.600006,20.4999981}, {97.0000076,20.4999981}} {{97.1000061,20.6000004}, {97.1000061,55.5}}
|
||||
debugShowCubicIntersection no intersect {{97.1000061,55.5}, {82.1000061,55.5}, {69.0000076,63.7000008}, {62.0000076,75.8000031}} {{97.0000076,55.4000015}, {78.2000122,55.4000015}, {62.4000092,68.2000046}, {57.8000069,85.5}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0.799679553 {{97.0000076,55.4000015}, {78.2000122,55.4000015}, {62.4000092,68.2000046}, {57.8000069,85.5}} {{61.8468246,75.7118225}} wnTs[0]=0.00503891 {{62.0000076,75.8000031}, {31.6000004,58.2999992}}
|
||||
debugShowCubicLineIntersection no intersect {{31.6000004,58.2999992}, {25.2000008,69.4000015}, {21.5,82.3000031}, {21.5,96}} {{57.8000069,85.5}, {24.1000061,76.5}}
|
||||
debugShowCubicIntersection wtTs[0]=1 {{31.6000004,58.2999992}, {25.2000008,69.4000015}, {21.5,82.3000031}, {21.5,96}} {{21.5,96}} wnTs[0]=1 {{24.1000061,76.5}, {22.4000053,82.8000031}, {21.5000057,89.4000015}, {21.5000057,96}}
|
||||
debugShowCubicLineIntersection no intersect {{31.6000004,58.2999992}, {25.2000008,69.4000015}, {21.5,82.3000031}, {21.5,96}} {{21.5000057,96}, {56.4000092,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{24.1000061,76.5}, {22.4000053,82.8000031}, {21.5000057,89.4000015}, {21.5000057,96}} {{21.5000057,96}} wnTs[0]=1.63955e-007 {{21.5,96}, {56.4000015,96}}
|
||||
debugShowLineIntersection wtTs[0]=0 {{21.5000057,96}, {56.4000092,96}} {{21.5000057,96}} wtTs[1]=0.999999781 {{56.4000015,96}} wnTs[0]=1.63955e-007 {{21.5,96}, {56.4000015,96}} wnTs[1]=1
|
||||
debugShowCubicLineIntersection no intersect {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}} {{21.5,96}, {56.4000015,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}} {{56.4000015,96}} wnTs[0]=1 {{21.5000057,96}, {56.4000092,96}}
|
||||
debugShowCubicIntersection wtTs[0]=0 {{56.4000015,96}, {56.4000015,111}, {64.5999985,124.099998}, {76.6999969,131.100006}} {{56.4000015,96}} wnTs[0]=0 {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}}
|
||||
debugShowCubicIntersection wtTs[0]=0.267722282 {{76.6999969,131.100006}, {60.6999969,131.100006}, {47.2999954,141.900009}, {43.3999977,156.700012}} {{64.540802,133.291794}} wnTs[0]=0.131302 {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}}
|
||||
debugShowCubicLineIntersection no intersect {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}} {{43.3999977,156.700012}, {3.33333338e+029,119.400002}}
|
||||
debugShowLineIntersection wtTs[0]=4.94283788e-028 {{43.3999977,156.700012}, {3.33333338e+029,119.400002}} {{208.16127,156.700012}} wnTs[0]=0.367708 {{228.900009,192}, {172.5,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{137.600006,96}} wnTs[0]=1 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}} {{137.600006,96}} wtTs[1]=1 {{107.500008,56.7999992}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} wnTs[1]=1
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{107.500008,56.7999992}} wnTs[0]=0 {{107.500008,56.7999992}, {116.500008,23.0999985}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{116.500008,23.0999985}, {110.200005,21.3999977}, {103.600006,20.4999981}, {97.0000076,20.4999981}} {{116.500008,23.0999985}} wtTs[1]=1 {{97.0000076,20.4999981}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} wnTs[1]=1
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{97.0000076,20.4999981}} wnTs[0]=0 {{97.0000076,20.4999981}, {97.0000076,55.4000015}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{97.0000076,55.4000015}, {78.2000122,55.4000015}, {62.4000092,68.2000046}, {57.8000069,85.5}} {{97.0000076,55.4000015}} wtTs[1]=1 {{57.8000069,85.5}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} wnTs[1]=1
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{57.8000069,85.5}} wnTs[0]=0 {{57.8000069,85.5}, {24.1000061,76.5}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{56.4000092,96}} wnTs[0]=1 {{21.5000057,96}, {56.4000092,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}} {{56.4000092,96}} wnTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{3.33333338e+029,119.400002}, {29.3999996,-10.8000002}} {{172.5,96}} wnTs[0]=1 {{228.900009,192}, {172.5,96}}
|
||||
debugShowCubicLineIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}}
|
||||
debugShowCubicLineIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{107.500008,56.7999992}, {116.500008,23.0999985}}
|
||||
debugShowCubicIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{116.500008,23.0999985}, {110.200005,21.3999977}, {103.600006,20.4999981}, {97.0000076,20.4999981}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0.136112912 {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{97.0000076,40.4949226}} wnTs[0]=0.57292 {{97.0000076,20.4999981}, {97.0000076,55.4000015}}
|
||||
debugShowCubicIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{97.0000076,55.4000015}, {78.2000122,55.4000015}, {62.4000092,68.2000046}, {57.8000069,85.5}}
|
||||
debugShowCubicIntersection no intersect {{62,-17.9000015}, {160.399994,147.300003}, {161.199997,141.699997}, {161.199997,136}} {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{161.199997,136}, {172.5,96}} {{172.5,96}} wnTs[0]=0 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicLineIntersection no intersect {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}} {{161.199997,136}, {172.5,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{161.199997,136}, {172.5,96}} {{172.5,96}} wnTs[0]=1 {{228.900009,192}, {172.5,96}}
|
||||
debugShowCubicIntersection no self intersect {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}}
|
||||
debugShowCubicIntersection no self intersect {{116.500008,23.0999985}, {110.200005,21.3999977}, {103.600006,20.4999981}, {97.0000076,20.4999981}}
|
||||
debugShowCubicIntersection no self intersect {{97.0000076,55.4000015}, {78.2000122,55.4000015}, {62.4000092,68.2000046}, {57.8000069,85.5}}
|
||||
debugShowCubicIntersection no self intersect {{24.1000061,76.5}, {22.4000053,82.8000031}, {21.5000057,89.4000015}, {21.5000057,96}}
|
||||
debugShowCubicIntersection no self intersect {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}} {{137.600006,96}} wnTs[0]=1 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicLineIntersection no intersect {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}} {{172.5,96}, {137.600006,96}}
|
||||
debugShowLineIntersection wtTs[0]=1 {{228.900009,192}, {172.5,96}} {{172.5,96}} wnTs[0]=0 {{172.5,96}, {137.600006,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}} {{107.500008,56.7999992}} wnTs[0]=0 {{107.500008,56.7999992}, {116.500008,23.0999985}}
|
||||
debugShowCubicIntersection no intersect {{137.600006,96}, {137.600006,77.1999969}, {124.800003,61.4000015}, {107.500008,56.7999992}} {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{116.500008,23.0999985}, {110.200005,21.3999977}, {103.600006,20.4999981}, {97.0000076,20.4999981}} {{116.500008,23.0999985}} wnTs[0]=1 {{107.500008,56.7999992}, {116.500008,23.0999985}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{116.500008,23.0999985}, {110.200005,21.3999977}, {103.600006,20.4999981}, {97.0000076,20.4999981}} {{97.0000076,20.4999981}} wnTs[0]=0 {{97.0000076,20.4999981}, {97.0000076,55.4000015}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{97.0000076,55.4000015}, {78.2000122,55.4000015}, {62.4000092,68.2000046}, {57.8000069,85.5}} {{97.0000076,55.4000015}} wnTs[0]=1 {{97.0000076,20.4999981}, {97.0000076,55.4000015}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{97.0000076,55.4000015}, {78.2000122,55.4000015}, {62.4000092,68.2000046}, {57.8000069,85.5}} {{57.8000069,85.5}} wnTs[0]=0 {{57.8000069,85.5}, {24.1000061,76.5}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{24.1000061,76.5}, {22.4000053,82.8000031}, {21.5000057,89.4000015}, {21.5000057,96}} {{24.1000061,76.5}} wnTs[0]=1 {{57.8000069,85.5}, {24.1000061,76.5}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{24.1000061,76.5}, {22.4000053,82.8000031}, {21.5000057,89.4000015}, {21.5000057,96}} {{21.5000057,96}} wnTs[0]=0 {{21.5000057,96}, {56.4000092,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=0 {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}} {{56.4000092,96}} wnTs[0]=1 {{21.5000057,96}, {56.4000092,96}}
|
||||
debugShowCubicLineIntersection wtTs[0]=1 {{56.4000092,96}, {56.4000092,205.199997}, {228.900009,198.699997}, {228.900009,192}} {{228.900009,192}} wnTs[0]=0 {{228.900009,192}, {172.5,96}}
|
||||
SkOpSegment::debugShowTs - id=13 [o=12 t=0 117.300003,60.9000015 w=1 o=0] [o=1 t=0.00115 117.320122,60.8652802 w=1 o=0] [o=14 t=1 134.800003,30.7000008 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=23 [o=22 t=0 3.33333338e+029,119.400002 w=1 o=0] [o=1,0,12,11,12,14,15,14,16,16,18,20,19,10,27,2,1,3,4,3,5,6,5,9,8,24 t=1 29.3999996,-10.8000002 w=1 o=0] operand
|
||||
SkOpSegment::addTPair addTPair this=13 0 other=23 0.999999881
|
||||
SkOpSegment::debugShowTs + id=13 [o=23,12 t=0 117.300003,60.9000015 w=1 o=0] [o=1 t=0.00115 117.320122,60.8652802 w=1 o=0] [o=14 t=1 134.800003,30.7000008 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=23 [o=22 t=0 3.33333338e+029,119.400002 w=1 o=0] [o=13 t=1 117.300003,60.9000015 w=1 o=0] [o=1,0,12,11,12,14,15,14,16,16,18,20,19,10,27,2,1,3,4,3,5,6,5,9,8,24 t=1 29.3999996,-10.8000002 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs - id=17 [o=16 t=0 62.0000076,75.8000031 w=1 o=0] [o=5 t=0.00504 61.8468246,75.7118225 w=1 o=0] [o=18 t=1 31.6000004,58.2999992 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=23 [o=22 t=0 3.33333338e+029,119.400002 w=1 o=0] [o=13 t=1 117.300003,60.9000015 w=1 o=0] [o=1,0,12,11,12,14,15,14,16,16,18,20,19,10,27,2,1,3,4,3,5,6,5,9,8,24 t=1 29.3999996,-10.8000002 w=1 o=0] operand
|
||||
SkOpSegment::addTPair addTPair this=17 0 other=23 0.999999881
|
||||
SkOpSegment::debugShowTs + id=17 [o=23,16 t=0 62.0000076,75.8000031 w=1 o=0] [o=5 t=0.00504 61.8468246,75.7118225 w=1 o=0] [o=18 t=1 31.6000004,58.2999992 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=23 [o=22 t=0 3.33333338e+029,119.400002 w=1 o=0] [o=13,17 t=1 62.0000076,75.8000031 w=1 o=0] [o=1,0,12,11,12,14,15,14,16,16,18,20,19,10,27,2,1,3,4,3,5,6,5,9,8,24 t=1 29.3999996,-10.8000002 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs - id=11 [o=10,27 t=0 172.5,96 w=1 o=0] [o=1,23,12 t=1 137.600006,96 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=0 [o=10,27 t=0 172.5,96 w=1 o=0] [o=1,23,12 t=1 137.600006,96 w=1 o=0]
|
||||
SkOpSegment::debugShowTs + id=11 [o=10,27 t=0 172.5,96 w=1 o=0] [o=1,23,12 t=1 137.600006,96 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=0 [o=10,27 t=0 172.5,96 w=1 o=0] [o=1,23,12 t=1 137.600006,96 w=1 o=0]
|
||||
SkOpSegment::debugShowTs - id=19 [o=18 t=0 21.5,96 w=1 o=0] [o=7 t=1.64e-007 21.5000057,96 w=1 o=0] [o=23,20 t=1 56.4000015,96 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=8 [o=7 t=0 21.5000057,96 w=1 o=0] [o=20 t=1 56.4000015,96 w=1 o=0] [o=9,23 t=1 56.4000092,96 w=1 o=0]
|
||||
SkOpSegment::addTPair addTPair this=19 1.63955463e-007 other=8 0
|
||||
SkOpSegment::addTPair addTPair this=8 0.999999781 other=19 1
|
||||
SkOpSegment::debugShowTs + id=19 [o=18 t=0 21.5,96 w=1 o=0] [o=8,7 t=1.64e-007 21.5000057,96 w=1 o=0] [o=8,23,20 t=1 56.4000015,96 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=8 [o=19,7 t=0 21.5000057,96 w=1 o=0] [o=19,20 t=1 56.4000015,96 w=1 o=0] [o=9,23 t=1 56.4000092,96 w=1 o=0]
|
||||
SkOpContour::calcCoincidentWinding count=4
|
||||
|
||||
{{41,33}, {41,36.3137093}, {38.6568527,38.6568527}},
|
||||
{{38.6568527,38.6568527}, {36.3137093,41}, {33,41}},
|
||||
{{33,41}, {29.6862907,41}, {27.3431454,38.6568527}},
|
||||
{{27.3431454,38.6568527}, {25,36.3137093}, {25,33}},
|
||||
{{25,33}, {25,29.6862907}, {27.3431454,27.3431454}},
|
||||
{{27.3431454,27.3431454}, {29.6862907,25}, {33,25}},
|
||||
{{33,25}, {36.3137093,25}, {38.6568527,27.3431454}},
|
||||
{{38.6568527,27.3431454}, {41,29.6862907}, {41,33}},
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}} {{33,25}} wnTs[0]=0 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}}
|
||||
debugShowQuadLineIntersection wtTs[0]=0 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}} {{27.3431454,27.3431454}} wnTs[0]=1 {{27.3431988,27.3431988}, {27.3431454,27.3431454}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}} {{38.6568527,27.3431454}} wnTs[0]=0 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}} {{41,33}} wnTs[0]=0 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}} {{38.6568527,38.6568527}} wnTs[0]=0 {{38.6568527,38.6568527}, {38.6510239,38.6626816}, {38.6447449,38.6689377}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{38.6568527,38.6568527}, {38.6510239,38.6626816}, {38.6447449,38.6689377}} {{38.6447449,38.6689377}} wnTs[0]=0 {{38.6447449,38.6689377}, {38.6394348,38.6742554}, {38.6341171,38.6795731}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{38.6447449,38.6689377}, {38.6394348,38.6742554}, {38.6341171,38.6795731}} {{38.6341171,38.6795731}} wnTs[0]=0 {{38.6341171,38.6795731}, {38.6284409,38.6852493}, {38.6227531,38.6909218}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{38.6341171,38.6795731}, {38.6284409,38.6852493}, {38.6227531,38.6909218}} {{38.6227531,38.6909218}} wnTs[0]=0 {{38.6227531,38.6909218}, {36.2775421,41.0320053}, {32.9638329,41.0290833}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{38.6227531,38.6909218}, {36.2775421,41.0320053}, {32.9638329,41.0290833}} {{32.9638329,41.0290833}} wnTs[0]=0 {{32.9638329,41.0290833}, {29.6501274,41.0261612}, {27.3090477,38.6809464}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{32.9638329,41.0290833}, {29.6501274,41.0261612}, {27.3090477,38.6809464}} {{27.3090477,38.6809464}} wnTs[0]=0 {{27.3090477,38.6809464}, {24.9679718,36.3357391}, {24.9708939,33.0220299}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.3090477,38.6809464}, {24.9679718,36.3357391}, {24.9708939,33.0220299}} {{24.9708939,33.0220299}} wnTs[0]=0 {{24.9708939,33.0220299}, {24.973814,29.7083225}, {27.319025,27.3672428}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{24.9708939,33.0220299}, {24.973814,29.7083225}, {27.319025,27.3672428}} {{27.319025,27.3672428}} wnTs[0]=0 {{27.319025,27.3672428}, {27.3209743,27.3652973}, {27.3229256,27.3633518}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.319025,27.3672428}, {27.3209743,27.3652973}, {27.3229256,27.3633518}} {{27.3229256,27.3633518}} wnTs[0]=0 {{27.3229256,27.3633518}, {27.324995,27.3612823}, {27.3270645,27.3592148}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.3229256,27.3633518}, {27.324995,27.3612823}, {27.3270645,27.3592148}} {{27.3270645,27.3592148}} wnTs[0]=0 {{27.3270645,27.3592148}, {27.3312511,27.355032}, {27.3354416,27.3508568}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.3270645,27.3592148}, {27.3312511,27.355032}, {27.3354416,27.3508568}} {{27.3354416,27.3508568}} wnTs[0]=0 {{27.3354416,27.3508568}, {27.3332844,27.3530178}, {27.331131,27.3551788}}
|
||||
debugShowQuadIntersection no intersect {{27.3270645,27.3592148}, {27.3312511,27.355032}, {27.3354416,27.3508568}} {{27.331131,27.3551788}, {27.3369579,27.3493824}, {27.3431988,27.3431988}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.3354416,27.3508568}, {27.3332844,27.3530178}, {27.331131,27.3551788}} {{27.331131,27.3551788}} wnTs[0]=0 {{27.331131,27.3551788}, {27.3369579,27.3493824}, {27.3431988,27.3431988}}
|
||||
debugShowQuadLineIntersection wtTs[0]=1 {{27.331131,27.3551788}, {27.3369579,27.3493824}, {27.3431988,27.3431988}} {{27.3431988,27.3431988}} wnTs[0]=0 {{27.3431988,27.3431988}, {27.3431454,27.3431454}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}} {{27.3431454,27.3431454}} wnTs[0]=1 {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}} {{27.3431454,27.3431454}} wtTs[1]=1 {{33,25}} wnTs[0]=0 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}} wnTs[1]=1
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}} {{33,25}} wnTs[0]=0 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}} {{33,25}} wnTs[0]=1 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}} {{33,25}} wtTs[1]=1 {{38.6568527,27.3431454}} wnTs[0]=0 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}} wnTs[1]=1
|
||||
debugShowQuadIntersection wtTs[0]=1 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}} {{38.6568527,27.3431454}} wnTs[0]=0 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}} {{41,33}} wnTs[0]=0 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}} {{38.6568527,27.3431454}} wnTs[0]=1 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}} {{38.6568527,27.3431454}} wtTs[1]=1 {{41,33}} wnTs[0]=0 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}} wnTs[1]=1
|
||||
debugShowQuadIntersection wtTs[0]=0 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}} {{41,33}} wtTs[1]=1 {{38.6568527,38.6568527}} wnTs[0]=0 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}} wnTs[1]=1
|
||||
debugShowQuadIntersection wtTs[0]=1 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}} {{38.6568527,38.6568527}} wnTs[0]=0 {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}} {{41,33}} wnTs[0]=1 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{38.6568527,38.6568527}, {38.6510239,38.6626816}, {38.6447449,38.6689377}} {{38.6568527,38.6568527}} wnTs[0]=1 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{38.6568527,38.6568527}, {38.6510239,38.6626816}, {38.6447449,38.6689377}} {{38.6568527,38.6568527}} wnTs[0]=0 {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}}
|
||||
debugShowQuadIntersection wtTs[0]=0.0149880862 {{38.6447449,38.6689377}, {38.6394348,38.6742554}, {38.6341171,38.6795731}} {{38.6445847,38.6690979}} wnTs[0]=0.00261623 {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}}
|
||||
debugShowQuadIntersection no intersect {{38.6341171,38.6795731}, {38.6284409,38.6852493}, {38.6227531,38.6909218}} {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}}
|
||||
debugShowQuadIntersection no intersect {{38.6227531,38.6909218}, {36.2775421,41.0320053}, {32.9638329,41.0290833}} {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}}
|
||||
debugShowQuadIntersection no intersect {{38.6227531,38.6909218}, {36.2775421,41.0320053}, {32.9638329,41.0290833}} {{33,41}, {29.6862907,41}, {27.3431454,38.6568527}}
|
||||
debugShowQuadIntersection no intersect {{32.9638329,41.0290833}, {29.6501274,41.0261612}, {27.3090477,38.6809464}} {{33,41}, {29.6862907,41}, {27.3431454,38.6568527}}
|
||||
debugShowQuadIntersection no intersect {{27.3090477,38.6809464}, {24.9679718,36.3357391}, {24.9708939,33.0220299}} {{27.3431454,38.6568527}, {25,36.3137093}, {25,33}}
|
||||
debugShowQuadIntersection no intersect {{24.9708939,33.0220299}, {24.973814,29.7083225}, {27.319025,27.3672428}} {{27.3431454,38.6568527}, {25,36.3137093}, {25,33}}
|
||||
debugShowQuadIntersection no intersect {{24.9708939,33.0220299}, {24.973814,29.7083225}, {27.319025,27.3672428}} {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}}
|
||||
debugShowQuadIntersection no intersect {{27.319025,27.3672428}, {27.3209743,27.3652973}, {27.3229256,27.3633518}} {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}}
|
||||
debugShowQuadIntersection no intersect {{27.3229256,27.3633518}, {27.324995,27.3612823}, {27.3270645,27.3592148}} {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}}
|
||||
debugShowQuadIntersection no intersect {{27.3270645,27.3592148}, {27.3312511,27.355032}, {27.3354416,27.3508568}} {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{27.3354416,27.3508568}, {27.3332844,27.3530178}, {27.331131,27.3551788}} {{27.3354416,27.3508568}} wtTs[1]=1 {{27.331131,27.3551788}} wnTs[0]=0.998355 {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}} wnTs[1]=0.99743327
|
||||
debugShowQuadIntersection wtTs[0]=0.0266527086 {{27.331131,27.3551788}, {27.3369579,27.3493824}, {27.3431988,27.3431988}} {{27.3314419,27.3548698}} wnTs[0]=0.997499 {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}}
|
||||
debugShowQuadLineIntersection wtTs[0]=1 {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}} {{27.3431454,27.3431454}} wnTs[0]=1 {{27.3431988,27.3431988}, {27.3431454,27.3431454}}
|
||||
debugShowQuadLineIntersection wtTs[0]=0 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}} {{27.3431454,27.3431454}} wnTs[0]=1 {{27.3431988,27.3431988}, {27.3431454,27.3431454}}
|
||||
debugShowQuadLineIntersection no intersect {{38.6568527,38.6568527}, {38.6510239,38.6626816}, {38.6447449,38.6689377}} {{38.6398277,38.6738319}, {38.6447258,38.6689186}}
|
||||
debugShowQuadLineIntersection wtTs[0]=1 {{38.6568527,38.6568527}, {38.6510239,38.6626816}, {38.6447449,38.6689377}} {{38.6447449,38.6689377}} wnTs[0]=1 {{38.6447258,38.6689186}, {38.6447449,38.6689377}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{38.6568527,38.6568527}, {38.6510239,38.6626816}, {38.6447449,38.6689377}} {{38.6447449,38.6689377}} wnTs[0]=0 {{38.6447449,38.6689377}, {38.6422882,38.6713867}, {38.6398277,38.6738319}}
|
||||
debugShowQuadLineIntersection no intersect {{38.6447449,38.6689377}, {38.6394348,38.6742554}, {38.6341171,38.6795731}} {{38.6398277,38.6738319}, {38.6447258,38.6689186}}
|
||||
debugShowQuadLineIntersection wtTs[0]=0 {{38.6447449,38.6689377}, {38.6394348,38.6742554}, {38.6341171,38.6795731}} {{38.6447449,38.6689377}} wnTs[0]=1 {{38.6447258,38.6689186}, {38.6447449,38.6689377}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{38.6447449,38.6689377}, {38.6394348,38.6742554}, {38.6341171,38.6795731}} {{38.6447449,38.6689377}} wnTs[0]=0 {{38.6447449,38.6689377}, {38.6422882,38.6713867}, {38.6398277,38.6738319}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}} {{38.6568527,38.6568527}} wnTs[0]=0 {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}}
|
||||
debugShowQuadIntersection wtTs[0]=0 {{41,33}, {41,36.3137093}, {38.6568527,38.6568527}} {{41,33}} wnTs[0]=1 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}} {{33,41}} wnTs[0]=0 {{33,41}, {29.6862907,41}, {27.3431454,38.6568527}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{33,41}, {29.6862907,41}, {27.3431454,38.6568527}} {{27.3431454,38.6568527}} wnTs[0]=0 {{27.3431454,38.6568527}, {25,36.3137093}, {25,33}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.3431454,38.6568527}, {25,36.3137093}, {25,33}} {{25,33}} wnTs[0]=0 {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{25,33}, {25,29.6862907}, {27.3431454,27.3431454}} {{27.3431454,27.3431454}} wnTs[0]=0 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{27.3431454,27.3431454}, {29.6862907,25}, {33,25}} {{33,25}} wnTs[0]=0 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}}
|
||||
debugShowQuadIntersection wtTs[0]=1 {{33,25}, {36.3137093,25}, {38.6568527,27.3431454}} {{38.6568527,27.3431454}} wnTs[0]=0 {{38.6568527,27.3431454}, {41,29.6862907}, {41,33}}
|
||||
debugShowQuadLineIntersection no intersect {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}} {{38.6398277,38.6738319}, {38.6447258,38.6689186}}
|
||||
debugShowQuadLineIntersection no intersect {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}} {{38.6447258,38.6689186}, {38.6447449,38.6689377}}
|
||||
debugShowQuadIntersection wtTs[0]=0.00258220891 {{38.6568527,38.6568527}, {36.3137093,41}, {33,41}} {{38.6447449,38.6689377}} wtTs[1]=0.00362998223 {{38.6398277,38.6738319}} wnTs[0]=0 {{38.6447449,38.6689377}, {38.6422882,38.6713867}, {38.6398277,38.6738319}} wnTs[1]=1
|
||||
debugShowLineIntersection wtTs[0]=1 {{38.6398277,38.6738319}, {38.6447258,38.6689186}} {{38.6447258,38.6689186}} wnTs[0]=0 {{38.6447258,38.6689186}, {38.6447449,38.6689377}}
|
||||
debugShowQuadLineIntersection wtTs[0]=1 {{38.6447449,38.6689377}, {38.6422882,38.6713867}, {38.6398277,38.6738319}} {{38.6398277,38.6738319}} wnTs[0]=0 {{38.6398277,38.6738319}, {38.6447258,38.6689186}}
|
||||
debugShowQuadLineIntersection wtTs[0]=0 {{38.6447449,38.6689377}, {38.6422882,38.6713867}, {38.6398277,38.6738319}} {{38.6447449,38.6689377}} wnTs[0]=1 {{38.6447258,38.6689186}, {38.6447449,38.6689377}}
|
||||
SkOpSegment::debugShowTs - id=0 [o=24,16 t=0 27.3431454,27.3431454 w=1 o=0] [o=26,1 t=1 33,25 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=25 [o=24,16 t=0 27.3431454,27.3431454 w=1 o=0] [o=26,1 t=1 33,25 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs + id=0 [o=24,16 t=0 27.3431454,27.3431454 w=1 o=0] [o=26,1 t=1 33,25 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=25 [o=24,16 t=0 27.3431454,27.3431454 w=1 o=0] [o=26,1 t=1 33,25 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs - id=1 [o=25,0 t=0 33,25 w=1 o=0] [o=27,2 t=1 38.6568527,27.3431454 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=26 [o=25,0 t=0 33,25 w=1 o=0] [o=27,2 t=1 38.6568527,27.3431454 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs + id=1 [o=25,0 t=0 33,25 w=1 o=0] [o=27,2 t=1 38.6568527,27.3431454 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=26 [o=25,0 t=0 33,25 w=1 o=0] [o=27,2 t=1 38.6568527,27.3431454 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs - id=2 [o=26,1 t=0 38.6568527,27.3431454 w=1 o=0] [o=20,3 t=1 41,33 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=27 [o=26,1 t=0 38.6568527,27.3431454 w=1 o=0] [o=20,3 t=1 41,33 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs + id=2 [o=26,1 t=0 38.6568527,27.3431454 w=1 o=0] [o=20,3 t=1 41,33 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=27 [o=26,1 t=0 38.6568527,27.3431454 w=1 o=0] [o=20,3 t=1 41,33 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs - id=3 [o=27,2 t=0 41,33 w=1 o=0] [o=21,4 t=1 38.6568527,38.6568527 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=20 [o=27,2 t=0 41,33 w=1 o=0] [o=21,4 t=1 38.6568527,38.6568527 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs + id=3 [o=27,2 t=0 41,33 w=1 o=0] [o=21,4 t=1 38.6568527,38.6568527 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=20 [o=27,2 t=0 41,33 w=1 o=0] [o=21,4 t=1 38.6568527,38.6568527 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs - id=14 [o=13 t=0 27.3354416,27.3508568 w=1 o=0] [o=15 t=1 27.331131,27.3551788 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=24 [o=23 t=0 25,33 w=1 o=0] [o=15 t=0.997 27.3314419,27.3548698 w=1 o=0] [o=25,16,0 t=1 27.3431454,27.3431454 w=1 o=0] operand
|
||||
SkOpSegment::addTPair addTPair this=14 0 other=24 0.998354892
|
||||
SkOpSegment::addTPair id=14 lower=0 upper=1 other=24 oLower=2 oUpper=2
|
||||
SkOpSegment::addTPair addTPair this=24 0.99743327 other=14 1
|
||||
SkOpSegment::addTPair id=24 lower=1 upper=1 other=14 oLower=2 oUpper=3
|
||||
SkOpSegment::debugShowTs + id=14 [o=24,13 t=0 27.3354416,27.3508568 w=1 o=0] [o=24,15 t=1 27.331131,27.3551788 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=24 [o=23 t=0 25,33 w=1 o=0] [o=14 t=0.997 27.331131,27.3551788 w=1 o=0] [o=15 t=0.997 27.3314419,27.3548698 w=1 o=0] [o=14 t=0.998 27.3354416,27.3508568 w=1 o=0] [o=25,16,0 t=1 27.3431454,27.3431454 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs - id=21 [o=20,4,3 t=0 38.6568527,38.6568527 w=1 o=0] [o=5 t=0.00262 38.6445847,38.6690979 w=1 o=0] [o=22 t=1 33,41 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=19 [o=18,5,4 t=0 38.6447449,38.6689377 w=1 o=0] [o=17 t=1 38.6398277,38.6738319 w=1 o=0]
|
||||
SkOpSegment::addTPair addTPair this=21 0.00258220891 other=19 0
|
||||
SkOpSegment::addTPair id=21 lower=3 upper=3 other=19 oLower=0 oUpper=3
|
||||
SkOpSegment::addTPair addTPair this=19 1 other=21 0.00362998223
|
||||
SkOpSegment::addTPair id=19 lower=4 upper=5 other=21 oLower=5 oUpper=5
|
||||
SkOpSegment::debugShowTs + id=21 [o=20,4,3 t=0 38.6568527,38.6568527 w=1 o=0] [o=19 t=0.00258 38.6447449,38.6689377 w=1 o=0] [o=5 t=0.00262 38.6445847,38.6690979 w=1 o=0] [o=19 t=0.00363 38.6398277,38.6738319 w=1 o=0] [o=22 t=1 33,41 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=19 [o=21,18,5,4 t=0 38.6447449,38.6689377 w=1 o=0] [o=21,17 t=1 38.6398277,38.6738319 w=1 o=0]
|
||||
SkOpContour::calcCoincidentWinding count=5
|
||||
SkOpSegment::debugShowTs p id=0 [o=24,16 t=0 27.3431454,27.3431454 w=1 o=1] [o=26,1 t=1 33,25 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=25 [o=24,16 t=0 27.3431454,27.3431454 w=0 o=0] [o=26,1 t=1 33,25 w=1 o=0] operand done
|
||||
SkOpSegment::debugShowTs p id=1 [o=25,0 t=0 33,25 w=1 o=1] [o=27,2 t=1 38.6568527,27.3431454 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=26 [o=25,0 t=0 33,25 w=0 o=0] [o=27,2 t=1 38.6568527,27.3431454 w=1 o=0] operand done
|
||||
SkOpSegment::debugShowTs p id=2 [o=26,1 t=0 38.6568527,27.3431454 w=1 o=1] [o=20,3 t=1 41,33 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=27 [o=26,1 t=0 38.6568527,27.3431454 w=0 o=0] [o=20,3 t=1 41,33 w=1 o=0] operand done
|
||||
SkOpSegment::debugShowTs p id=3 [o=27,2 t=0 41,33 w=1 o=1] [o=21,4 t=1 38.6568527,38.6568527 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=20 [o=27,2 t=0 41,33 w=0 o=0] [o=21,4 t=1 38.6568527,38.6568527 w=1 o=0] operand done
|
||||
SkOpSegment::debugShowTs p id=14 [o=24,13 t=0 27.3354416,27.3508568 w=1 o=-1] [o=24,15 t=1 27.331131,27.3551788 w=1 o=0]
|
||||
SkOpSegment::debugShowTs o id=24 [o=23 t=0 25,33 w=0 o=0] [o=14 t=0.997 27.331131,27.3551788 w=0 o=0] [o=15 t=0.997 27.3314419,27.3548698 w=0 o=0] [o=14 t=0.998 27.3354416,27.3508568 w=1 o=0] [o=25,16,0 t=1 27.3431454,27.3431454 w=1 o=0] operand
|
||||
SkOpContour::calcCoincidentWinding count=1
|
||||
SkOpSegment::debugShowTs p id=21 [o=20,4,3 t=0 38.6568527,38.6568527 w=1 o=0] [o=19 t=0.00258 38.6447449,38.6689377 w=1 o=1] [o=5 t=0.00262 38.6445847,38.6690979 w=1 o=1] [o=19 t=0.00363 38.6398277,38.6738319 w=1 o=0] [o=22 t=1 33,41 w=1 o=0] operand
|
||||
SkOpSegment::debugShowTs o id=19 [o=21,18,5,4 t=0 38.6447449,38.6689377 w=0 o=0] [o=21,17 t=1 38.6398277,38.6738319 w=1 o=0] done
|
||||
SkOpSegment::checkEnds id=4 missing t=1 other=21 otherT=0.00258220891 pt=(38.6447449,38.6689377)
|
||||
SkOpSegment::addTPair addTPair this=4 1 other=21 0.00258220891
|
||||
SkOpSegment::addTPair id=4 lower=3 upper=6 other=21 oLower=3 oUpper=4
|
||||
SkOpSegment::checkEnds id=5 missing t=0 other=21 otherT=0.00258220891 pt=(38.6447449,38.6689377)
|
||||
SkOpSegment::addTPair addTPair this=5 0 other=21 0.00258220891
|
||||
SkOpSegment::addTPair id=5 lower=0 upper=3 other=21 oLower=3 oUpper=5
|
||||
SkOpSegment::checkEnds id=13 missing t=1 other=24 otherT=0.998354892 pt=(27.3354416,27.3508568)
|
||||
SkOpSegment::addTPair addTPair this=13 1 other=24 0.998354892
|
||||
SkOpSegment::addTPair id=13 lower=1 upper=2 other=24 oLower=3 oUpper=4
|
||||
SkOpSegment::checkEnds id=15 missing t=0 other=24 otherT=0.99743327 pt=(27.331131,27.3551788)
|
||||
SkOpSegment::addTPair addTPair this=15 0 other=24 0.99743327
|
||||
SkOpSegment::addTPair id=15 lower=0 upper=1 other=24 oLower=1 oUpper=2
|
||||
SkOpSegment::checkEnds id=21 missing t=0.00362998223 other=17 otherT=0 pt=(38.6398277,38.6738319)
|
||||
SkOpSegment::addTPair addTPair this=21 0.00362998223 other=17 0
|
||||
SkOpSegment::addTPair id=21 lower=7 upper=8 other=17 oLower=0 oUpper=1
|
||||
SkOpSegment::addTPair addTPair this=0 0 other=25 0
|
||||
SkOpSegment::addTPair id=0 lower=0 upper=2 other=25 oLower=0 oUpper=2
|
||||
SkOpSegment::addTPair addTPair duplicate this=0 0 other=25 0
|
||||
SkOpSegment::addTPair addTPair this=3 1 other=20 1
|
||||
SkOpSegment::addTPair id=3 lower=2 upper=4 other=20 oLower=2 oUpper=4
|
||||
SkOpSegment::addTPair addTPair duplicate this=3 1 other=20 1
|
||||
SkOpSegment::addTPair addTPair this=21 0.00258220891 other=18 1
|
||||
SkOpSegment::addTPair id=21 lower=3 upper=6 other=18 oLower=1 oUpper=4
|
||||
SkOpSegment::addTPair addTPair duplicate this=18 1 other=21 0.00258220891
|
||||
SkOpContour::joinCoincidence count=5
|
||||
SkOpContour::joinCoincidence count=1
|
||||
SkOpSegment::sortAngles [0] tStart=0 [1]
|
||||
SkOpAngle::after [0/1] 2/1 tStart=0 tEnd=1 < [16/1] 27/27 tStart=1 tEnd=0 < [24/2] 17/21 tStart=1 tEnd=0.998354892 F 4
|
||||
SkOpSegment::sortAngles [0] tStart=1 [4]
|
||||
SkOpSegment::sortAngles [1] tStart=1 [3]
|
||||
SkOpSegment::sortAngles [2] tStart=1 [3]
|
||||
SkOpSegment::sortAngles [3] tStart=1 [3]
|
||||
SkOpAngle::after [3/2] 1/5 tStart=1 tEnd=0 < [4/1] 18/17 tStart=0 tEnd=1 < [21/1] 21/17 tStart=0 tEnd=0.00258220891 T 11
|
||||
SkOpSegment::sortAngles [4] tStart=1 [3]
|
||||
SkOpAngle::after [4/2] 1/1 tStart=1 tEnd=0 < [21/3] 21/21 tStart=0.00258220891 tEnd=0.0026162254 < [21/2] 1/1 tStart=0.00258220891 tEnd=0 T 5
|
||||
SkOpAngle::after [4/2] 1/1 tStart=1 tEnd=0 < [18/1] 11/11 tStart=1 tEnd=0 < [21/3] 21/21 tStart=0.00258220891 tEnd=0.0026162254 T 4
|
||||
SkOpAngle::after [4/2] 1/1 tStart=1 tEnd=0 < [5/1] 21/21 tStart=0 tEnd=0.0149880862 < [18/1] 11/11 tStart=1 tEnd=0 F 4
|
||||
SkOpAngle::after [18/1] 11/11 tStart=1 tEnd=0 < [5/1] 21/21 tStart=0 tEnd=0.0149880862 < [21/3] 21/21 tStart=0.00258220891 tEnd=0.0026162254 T 7
|
||||
SkOpSegment::sortAngles [5] tStart=0.0149880862 [4]
|
||||
SkOpAngle::after [5/2] 1/1 tStart=0.0149880862 tEnd=0 < [21/4] 1/1 tStart=0.0026162254 tEnd=0.00258220891 < [5/3] 21/21 tStart=0.0149880862 tEnd=1 T 12
|
||||
SkOpAngle::after [5/2] 1/1 tStart=0.0149880862 tEnd=0 < [21/5] 17/17 tStart=0.0026162254 tEnd=0.00362998223 < [21/4] 1/1 tStart=0.0026162254 tEnd=0.00258220891 F 5
|
||||
SkOpAngle::after [21/4] 1/1 tStart=0.0026162254 tEnd=0.00258220891 < [21/5] 17/17 tStart=0.0026162254 tEnd=0.00362998223 < [5/3] 21/21 tStart=0.0149880862 tEnd=1 T 4
|
||||
SkOpSegment::sortAngles [13] tStart=1 [1]
|
||||
SkOpAngle::after [13/1] 17/17 tStart=1 tEnd=0 < [14/1] 21/21 tStart=0 tEnd=1 < [24/1] 5/5 tStart=0.998354892 tEnd=1 T 4
|
||||
SkOpSegment::sortAngles [14] tStart=1 [3]
|
||||
SkOpSegment::sortAngles [15] tStart=0.0266527086 [2]
|
||||
SkOpSegment::sortAngles [21] tStart=0.00362998223 [8]
|
||||
SkOpAngle::after [21/6] 1/1 tStart=0.00362998223 tEnd=0.0026162254 < [17/1] 5/5 tStart=0 tEnd=1 < [21/7] 17/17 tStart=0.00362998223 tEnd=1 T 4
|
||||
SkOpSegment::debugShowActiveSpans id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 (27.3431454,27.3431454) tEnd=1 other=25 otherT=0 otherIndex=0 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=1 (33,25 36.3137093,25 38.6568527,27.3431454) t=0 (33,25) tEnd=1 other=25 otherT=1 otherIndex=4 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=2 (38.6568527,27.3431454 41,29.6862907 41,33) t=0 (38.6568527,27.3431454) tEnd=1 other=26 otherT=1 otherIndex=3 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=3 (41,33 41,36.3137093 38.6568527,38.6568527) t=0 (41,33) tEnd=1 other=27 otherT=1 otherIndex=3 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=4 (38.6568527,38.6568527 38.6510239,38.6626816 38.6447449,38.6689377) t=0 (38.6568527,38.6568527) tEnd=1 other=21 otherT=0 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0 (38.6447449,38.6689377) tEnd=0.0149880862 other=21 otherT=0.00258220891 otherIndex=4 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0.0149880862 (38.6445847,38.6690979) tEnd=1 other=21 otherT=0.0026162254 otherIndex=7 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=6 (38.6341171,38.6795731 38.6284409,38.6852493 38.6227531,38.6909218) t=0 (38.6341171,38.6795731) tEnd=1 other=5 otherT=1 otherIndex=5 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=7 (38.6227531,38.6909218 36.2775421,41.0320053 32.9638329,41.0290833) t=0 (38.6227531,38.6909218) tEnd=1 other=6 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=8 (32.9638329,41.0290833 29.6501274,41.0261612 27.3090477,38.6809464) t=0 (32.9638329,41.0290833) tEnd=1 other=7 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=9 (27.3090477,38.6809464 24.9679718,36.3357391 24.9708939,33.0220299) t=0 (27.3090477,38.6809464) tEnd=1 other=8 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=10 (24.9708939,33.0220299 24.973814,29.7083225 27.319025,27.3672428) t=0 (24.9708939,33.0220299) tEnd=1 other=9 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=11 (27.319025,27.3672428 27.3209743,27.3652973 27.3229256,27.3633518) t=0 (27.319025,27.3672428) tEnd=1 other=10 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=12 (27.3229256,27.3633518 27.324995,27.3612823 27.3270645,27.3592148) t=0 (27.3229256,27.3633518) tEnd=1 other=11 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=13 (27.3270645,27.3592148 27.3312511,27.355032 27.3354416,27.3508568) t=0 (27.3270645,27.3592148) tEnd=1 other=12 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=14 (27.3354416,27.3508568 27.3332844,27.3530178 27.331131,27.3551788) t=0 (27.3354416,27.3508568) tEnd=1 other=24 otherT=0.998354892 otherIndex=5 windSum=? windValue=1 oppValue=-1
|
||||
SkOpSegment::debugShowActiveSpans id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0 (27.331131,27.3551788) tEnd=0.0266527086 other=24 otherT=0.99743327 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0.0266527086 (27.3314419,27.3548698) tEnd=1 other=24 otherT=0.997499486 otherIndex=3 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=16 (27.3431988,27.3431988 27.3431454,27.3431454) t=0 (27.3431988,27.3431988) tEnd=1 other=15 otherT=1 otherIndex=3 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0 (38.6568527,38.6568527) tEnd=0.00258220891 other=20 otherT=1 otherIndex=3 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00258220891 (38.6447449,38.6689377) tEnd=0.0026162254 other=18 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.0026162254 (38.6445847,38.6690979) tEnd=0.00362998223 other=5 otherT=0.0149880862 otherIndex=4 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00362998223 (38.6398277,38.6738319) tEnd=1 other=17 otherT=0 otherIndex=0 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=22 (33,41 29.6862907,41 27.3431454,38.6568527) t=0 (33,41) tEnd=1 other=21 otherT=1 otherIndex=10 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=23 (27.3431454,38.6568527 25,36.3137093 25,33) t=0 (27.3431454,38.6568527) tEnd=1 other=22 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=24 (25,33 25,29.6862907 27.3431454,27.3431454) t=0.998354892 (27.3354416,27.3508568) tEnd=1 other=13 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=17 (38.6398277,38.6738319 38.6447258,38.6689186) t=0 (38.6398277,38.6738319) tEnd=1 other=21 otherT=0.00362998223 otherIndex=8 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::findTop
|
||||
SkOpAngle::dumpOne [0/2] next=1/1 sect=16/17 s=1 [4] e=0 [2] sgn=1 windVal=1 windSum=? oppVal=1 oppSum=?
|
||||
SkOpAngle::dumpOne [1/1] next=0/2 sect=30/29 s=0 [0] e=1 [2] sgn=-1 windVal=1 windSum=? oppVal=1 oppSum=? stop
|
||||
SkOpSegment::markWinding id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [1] (27.3431454,27.3431454) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markWinding id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [0] (27.3431454,27.3431454) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markWinding id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [2] (27.3431454,27.3431454) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::markWinding id=1 (33,25 36.3137093,25 38.6568527,27.3431454) t=0 [0] (33,25) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markWinding id=1 (33,25 36.3137093,25 38.6568527,27.3431454) t=0 [1] (33,25) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::markWinding id=2 (38.6568527,27.3431454 41,29.6862907 41,33) t=0 [0] (38.6568527,27.3431454) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markWinding id=2 (38.6568527,27.3431454 41,29.6862907 41,33) t=0 [1] (38.6568527,27.3431454) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::markWinding id=3 (41,33 41,36.3137093 38.6568527,38.6568527) t=0 [0] (41,33) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markWinding id=3 (41,33 41,36.3137093 38.6568527,38.6568527) t=0 [1] (41,33) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markWinding id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [1] (27.3431454,27.3431454) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::markWinding id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [0] (27.3431454,27.3431454) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::markWinding id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [2] (27.3431454,27.3431454) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::activeOp id=0 t=0 tEnd=1 op=union miFrom=1 miTo=0 suFrom=1 suTo=0 result=1
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [1] (27.3431454,27.3431454) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [0] (27.3431454,27.3431454) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=0 (27.3431454,27.3431454 29.6862907,25 33,25) t=0 [2] (27.3431454,27.3431454) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
bridgeOp current id=0 from=(27.3431454,27.3431454) to=(33,25)
|
||||
path.moveTo(27.3431454,27.3431454);
|
||||
path.quadTo(29.6862907,25, 33,25);
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=1 (33,25 36.3137093,25 38.6568527,27.3431454) t=0 [0] (33,25) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=1 (33,25 36.3137093,25 38.6568527,27.3431454) t=0 [1] (33,25) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
bridgeOp current id=1 from=(33,25) to=(38.6568527,27.3431454)
|
||||
path.quadTo(36.3137093,25, 38.6568527,27.3431454);
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=2 (38.6568527,27.3431454 41,29.6862907 41,33) t=0 [0] (38.6568527,27.3431454) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=2 (38.6568527,27.3431454 41,29.6862907 41,33) t=0 [1] (38.6568527,27.3431454) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
bridgeOp current id=2 from=(38.6568527,27.3431454) to=(41,33)
|
||||
path.quadTo(41,29.6862907, 41,33);
|
||||
SkOpSegment::markWinding id=4 (38.6568527,38.6568527 38.6510239,38.6626816 38.6447449,38.6689377) t=0 [0] (38.6568527,38.6568527) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=4 (38.6568527,38.6568527 38.6510239,38.6626816 38.6447449,38.6689377) t=0 [1] (38.6568527,38.6568527) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=4 (38.6568527,38.6568527 38.6510239,38.6626816 38.6447449,38.6689377) t=0 [2] (38.6568527,38.6568527) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markAngle last id=4 windSum=? small=0
|
||||
SkOpSegment::markWinding id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0 [0] (38.6568527,38.6568527) tEnd=0 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0 [1] (38.6568527,38.6568527) tEnd=0 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0 [2] (38.6568527,38.6568527) tEnd=0.00258220891 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markAngle last id=21 windSum=? small=0
|
||||
SkOpSegment::findNextOp
|
||||
SkOpAngle::dumpOne [3/2] next=4/1 sect=1/5 s=1 [4] e=0 [1] sgn=1 windVal=1 windSum=-1 oppVal=1 oppSum=-1
|
||||
SkOpAngle::dumpOne [4/1] next=21/1 sect=18/17 s=0 [0] e=1 [3] sgn=-1 windVal=1 windSum=-1 oppVal=0 oppSum=-1
|
||||
SkOpAngle::dumpOne [21/1] next=3/2 sect=21/17 s=0 [0] e=0.00258220891 [3] sgn=-1 windVal=1 windSum=-1 oppVal=0 oppSum=0 operand
|
||||
SkOpSegment::activeOp id=4 t=0 tEnd=1 op=union miFrom=1 miTo=0 suFrom=1 suTo=1 result=0
|
||||
SkOpSegment::markDoneBinary id=4 (38.6568527,38.6568527 38.6510239,38.6626816 38.6447449,38.6689377) t=0 [0] (38.6568527,38.6568527) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=4 (38.6568527,38.6568527 38.6510239,38.6626816 38.6447449,38.6689377) t=0 [1] (38.6568527,38.6568527) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=4 (38.6568527,38.6568527 38.6510239,38.6626816 38.6447449,38.6689377) t=0 [2] (38.6568527,38.6568527) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::findNextOp chase.append id=4 windSum=-2147483647 small=0
|
||||
SkOpSegment::activeOp id=21 t=0 tEnd=0.00258220891 op=union miFrom=0 miTo=0 suFrom=1 suTo=0 result=1
|
||||
SkOpSegment::findNextOp chase.append id=21 windSum=-2147483647 small=0
|
||||
SkOpSegment::markDoneBinary id=3 (41,33 41,36.3137093 38.6568527,38.6568527) t=0 [0] (41,33) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=3 (41,33 41,36.3137093 38.6568527,38.6568527) t=0 [1] (41,33) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=1
|
||||
SkOpSegment::findNextOp from:[3] to:[21] start=0 end=3
|
||||
bridgeOp current id=3 from=(41,33) to=(38.6568527,38.6568527)
|
||||
path.quadTo(41,36.3137093, 38.6568527,38.6568527);
|
||||
SkOpSegment::findNextOp
|
||||
SkOpAngle::dumpOne [21/2] next=4/2 sect=1/1 s=0.00258220891 [3] e=0 [0] sgn=1 windVal=1 windSum=-1 oppVal=0 oppSum=0 operand
|
||||
SkOpAngle::dumpOne [4/2] next=18/1 sect=1/1 s=1 [6] e=0 [2] sgn=1 windVal=1 windSum=-1 oppVal=0 oppSum=-1 done
|
||||
SkOpAngle::dumpOne [18/1] next=5/1 sect=11/11 s=1 [4] e=0 [0] sgn=1 windVal=1 windSum=? done
|
||||
SkOpAngle::dumpOne [5/1] next=21/3 sect=21/21 s=0 [0] e=0.0149880862 [4] sgn=-1 windVal=1 windSum=? unorderable
|
||||
SkOpAngle::dumpOne [21/3] next=21/2 sect=21/21 s=0.00258220891 [3] e=0.0026162254 [7] sgn=-1 windVal=1 windSum=? oppVal=1 oppSum=? unorderable operand
|
||||
SkOpSegment::activeOp id=4 t=1 tEnd=0 op=union miFrom=0 miTo=1 suFrom=1 suTo=1 result=0
|
||||
SkOpSegment::activeOp id=18 t=1 tEnd=0 op=union miFrom=1 miTo=0 suFrom=1 suTo=1 result=0
|
||||
SkOpSegment::activeOp id=5 t=0 tEnd=0.0149880862 op=union miFrom=0 miTo=1 suFrom=1 suTo=1 result=0
|
||||
SkOpSegment::markDoneBinary id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0 [0] (38.6447449,38.6689377) tEnd=0 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0 [1] (38.6447449,38.6689377) tEnd=0 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0 [2] (38.6447449,38.6689377) tEnd=0 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0 [3] (38.6447449,38.6689377) tEnd=0.0149880862 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::activeOp id=21 t=0.00258220891 tEnd=0.0026162254 op=union miFrom=1 miTo=0 suFrom=1 suTo=0 result=1
|
||||
SkOpSegment::markDoneBinary id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0 [0] (38.6568527,38.6568527) tEnd=0 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0 [1] (38.6568527,38.6568527) tEnd=0 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0 [2] (38.6568527,38.6568527) tEnd=0.00258220891 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::findNextOp from:[21] to:[21] start=3 end=7
|
||||
bridgeOp current id=21 from=(38.6568527,38.6568527) to=(38.6447449,38.6689377)
|
||||
path.quadTo(38.6510239,38.6626816, 38.6447449,38.6689377);
|
||||
SkOpSegment::markDoneBinary id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00258220891 [3] (38.6447449,38.6689377) tEnd=0.00258220891 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00258220891 [4] (38.6447449,38.6689377) tEnd=0.00258220891 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00258220891 [5] (38.6447449,38.6689377) tEnd=0.00258220891 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00258220891 [6] (38.6447449,38.6689377) tEnd=0.0026162254 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0.0149880862 (38.6445847,38.6690979) tEnd=1 other=21 otherT=0.0026162254 otherIndex=7 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=6 (38.6341171,38.6795731 38.6284409,38.6852493 38.6227531,38.6909218) t=0 (38.6341171,38.6795731) tEnd=1 other=5 otherT=1 otherIndex=5 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=7 (38.6227531,38.6909218 36.2775421,41.0320053 32.9638329,41.0290833) t=0 (38.6227531,38.6909218) tEnd=1 other=6 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=8 (32.9638329,41.0290833 29.6501274,41.0261612 27.3090477,38.6809464) t=0 (32.9638329,41.0290833) tEnd=1 other=7 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=9 (27.3090477,38.6809464 24.9679718,36.3357391 24.9708939,33.0220299) t=0 (27.3090477,38.6809464) tEnd=1 other=8 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=10 (24.9708939,33.0220299 24.973814,29.7083225 27.319025,27.3672428) t=0 (24.9708939,33.0220299) tEnd=1 other=9 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=11 (27.319025,27.3672428 27.3209743,27.3652973 27.3229256,27.3633518) t=0 (27.319025,27.3672428) tEnd=1 other=10 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=12 (27.3229256,27.3633518 27.324995,27.3612823 27.3270645,27.3592148) t=0 (27.3229256,27.3633518) tEnd=1 other=11 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=13 (27.3270645,27.3592148 27.3312511,27.355032 27.3354416,27.3508568) t=0 (27.3270645,27.3592148) tEnd=1 other=12 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=14 (27.3354416,27.3508568 27.3332844,27.3530178 27.331131,27.3551788) t=0 (27.3354416,27.3508568) tEnd=1 other=24 otherT=0.998354892 otherIndex=5 windSum=? windValue=1 oppValue=-1
|
||||
SkOpSegment::debugShowActiveSpans id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0 (27.331131,27.3551788) tEnd=0.0266527086 other=24 otherT=0.99743327 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0.0266527086 (27.3314419,27.3548698) tEnd=1 other=24 otherT=0.997499486 otherIndex=3 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=16 (27.3431988,27.3431988 27.3431454,27.3431454) t=0 (27.3431988,27.3431988) tEnd=1 other=15 otherT=1 otherIndex=3 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.0026162254 (38.6445847,38.6690979) tEnd=0.00362998223 other=5 otherT=0.0149880862 otherIndex=4 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00362998223 (38.6398277,38.6738319) tEnd=1 other=17 otherT=0 otherIndex=0 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=22 (33,41 29.6862907,41 27.3431454,38.6568527) t=0 (33,41) tEnd=1 other=21 otherT=1 otherIndex=10 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=23 (27.3431454,38.6568527 25,36.3137093 25,33) t=0 (27.3431454,38.6568527) tEnd=1 other=22 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=24 (25,33 25,29.6862907 27.3431454,27.3431454) t=0.998354892 (27.3354416,27.3508568) tEnd=1 other=13 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=17 (38.6398277,38.6738319 38.6447258,38.6689186) t=0 (38.6398277,38.6738319) tEnd=1 other=21 otherT=0.00362998223 otherIndex=8 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::findTop
|
||||
SkOpAngle::dumpOne [0/1] next=24/2 sect=2/1 s=0 [0] e=1 [3] sgn=-1 windVal=1 windSum=-1 oppVal=1 oppSum=-1 done
|
||||
SkOpAngle::dumpOne [24/2] next=16/1 sect=17/21 s=1 [8] e=0.998354892 [5] sgn=1 windVal=1 windSum=? operand stop
|
||||
SkOpAngle::dumpOne [16/1] next=0/1 sect=27/27 s=1 [3] e=0 [0] sgn=1 windVal=1 windSum=? stop
|
||||
SkOpSegment::markWinding id=16 (27.3431988,27.3431988 27.3431454,27.3431454) t=0 [0] (27.3431988,27.3431988) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0.0266527086 [2] (27.3314419,27.3548698) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::markWinding id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0 [0] (27.331131,27.3551788) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0 [1] (27.331131,27.3551788) tEnd=0.0266527086 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::markAngle last id=15 windSum=-1 small=0
|
||||
SkOpSegment::markWinding id=24 (25,33 25,29.6862907 27.3431454,27.3431454) t=0.998354892 [4] (27.3354416,27.3508568) tEnd=0.998354892 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=24 (25,33 25,29.6862907 27.3431454,27.3431454) t=0.998354892 [5] (27.3354416,27.3508568) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markAngle last id=24 windSum=-1 small=0
|
||||
SkOpSegment::activeOp id=24 t=0.998354892 tEnd=1 op=union miFrom=0 miTo=0 suFrom=1 suTo=0 result=1
|
||||
SkOpSegment::findNextOp
|
||||
SkOpAngle::dumpOne [24/2] next=16/1 sect=17/21 s=1 [8] e=0.998354892 [5] sgn=1 windVal=1 windSum=-1 oppVal=0 oppSum=0 operand stop
|
||||
SkOpAngle::dumpOne [16/1] next=0/1 sect=27/27 s=1 [3] e=0 [0] sgn=1 windVal=1 windSum=-1 oppVal=0 oppSum=-1 stop
|
||||
SkOpAngle::dumpOne [0/1] next=24/2 sect=2/1 s=0 [0] e=1 [3] sgn=-1 windVal=1 windSum=-1 oppVal=1 oppSum=-1 done
|
||||
SkOpSegment::activeOp id=16 t=1 tEnd=0 op=union miFrom=0 miTo=1 suFrom=1 suTo=1 result=0
|
||||
SkOpSegment::markDoneBinary id=16 (27.3431988,27.3431988 27.3431454,27.3431454) t=0 [0] (27.3431988,27.3431988) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0.0266527086 [2] (27.3314419,27.3548698) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::markDoneBinary id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0 [0] (27.331131,27.3551788) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=15 (27.331131,27.3551788 27.3369579,27.3493824 27.3431988,27.3431988) t=0 [1] (27.331131,27.3551788) tEnd=0.0266527086 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::nextChase mismatched signs
|
||||
SkOpSegment::findNextOp chase.append id=15 windSum=-1 small=0
|
||||
SkOpSegment::activeOp id=0 t=0 tEnd=1 op=union miFrom=1 miTo=0 suFrom=1 suTo=0 result=1
|
||||
SkOpSegment::markDoneBinary id=24 (25,33 25,29.6862907 27.3431454,27.3431454) t=0.998354892 [4] (27.3354416,27.3508568) tEnd=0.998354892 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::markDoneBinary id=24 (25,33 25,29.6862907 27.3431454,27.3431454) t=0.998354892 [5] (27.3354416,27.3508568) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::findNextOp from:[24] to:[0] start=0 end=3
|
||||
bridgeOp current id=24 from=(27.3354416,27.3508568) to=(27.3431454,27.3431454)
|
||||
path.moveTo(27.3354416,27.3508568);
|
||||
path.quadTo(27.3392906,27.3470001, 27.3431454,27.3431454);
|
||||
SkOpSegment::markWinding id=14 (27.3354416,27.3508568 27.3332844,27.3530178 27.331131,27.3551788) t=0 [0] (27.3354416,27.3508568) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=-1
|
||||
SkOpSegment::markWinding id=14 (27.3354416,27.3508568 27.3332844,27.3530178 27.331131,27.3551788) t=0 [1] (27.3354416,27.3508568) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=? windSum=? windValue=1 oppValue=-1
|
||||
SkOpSegment::markAngle last id=14 windSum=-1 small=0
|
||||
SkOpSegment::debugShowActiveSpans id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0.0149880862 (38.6445847,38.6690979) tEnd=1 other=21 otherT=0.0026162254 otherIndex=7 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=6 (38.6341171,38.6795731 38.6284409,38.6852493 38.6227531,38.6909218) t=0 (38.6341171,38.6795731) tEnd=1 other=5 otherT=1 otherIndex=5 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=7 (38.6227531,38.6909218 36.2775421,41.0320053 32.9638329,41.0290833) t=0 (38.6227531,38.6909218) tEnd=1 other=6 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=8 (32.9638329,41.0290833 29.6501274,41.0261612 27.3090477,38.6809464) t=0 (32.9638329,41.0290833) tEnd=1 other=7 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=9 (27.3090477,38.6809464 24.9679718,36.3357391 24.9708939,33.0220299) t=0 (27.3090477,38.6809464) tEnd=1 other=8 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=10 (24.9708939,33.0220299 24.973814,29.7083225 27.319025,27.3672428) t=0 (24.9708939,33.0220299) tEnd=1 other=9 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=11 (27.319025,27.3672428 27.3209743,27.3652973 27.3229256,27.3633518) t=0 (27.319025,27.3672428) tEnd=1 other=10 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=12 (27.3229256,27.3633518 27.324995,27.3612823 27.3270645,27.3592148) t=0 (27.3229256,27.3633518) tEnd=1 other=11 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=13 (27.3270645,27.3592148 27.3312511,27.355032 27.3354416,27.3508568) t=0 (27.3270645,27.3592148) tEnd=1 other=12 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=14 (27.3354416,27.3508568 27.3332844,27.3530178 27.331131,27.3551788) t=0 (27.3354416,27.3508568) tEnd=1 other=24 otherT=0.998354892 otherIndex=5 windSum=-1 windValue=1 oppValue=-1
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.0026162254 (38.6445847,38.6690979) tEnd=0.00362998223 other=5 otherT=0.0149880862 otherIndex=4 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00362998223 (38.6398277,38.6738319) tEnd=1 other=17 otherT=0 otherIndex=0 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=22 (33,41 29.6862907,41 27.3431454,38.6568527) t=0 (33,41) tEnd=1 other=21 otherT=1 otherIndex=10 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=23 (27.3431454,38.6568527 25,36.3137093 25,33) t=0 (27.3431454,38.6568527) tEnd=1 other=22 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=17 (38.6398277,38.6738319 38.6447258,38.6689186) t=0 (38.6398277,38.6738319) tEnd=1 other=21 otherT=0.00362998223 otherIndex=8 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::activeOp id=14 t=1 tEnd=0 op=union miFrom=0 miTo=1 suFrom=1 suTo=0 result=0
|
||||
SkOpSegment::markDoneBinary id=14 (27.3354416,27.3508568 27.3332844,27.3530178 27.331131,27.3551788) t=0 [0] (27.3354416,27.3508568) tEnd=0 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=-1
|
||||
SkOpSegment::markDoneBinary id=14 (27.3354416,27.3508568 27.3332844,27.3530178 27.331131,27.3551788) t=0 [1] (27.3354416,27.3508568) tEnd=1 newWindSum=-1 newOppSum=-1 oppSum=-1 windSum=-1 windValue=1 oppValue=-1
|
||||
bridgeOp chase.append id=14 windSum=-1 small=0
|
||||
SkOpSegment::markWinding id=13 (27.3270645,27.3592148 27.3312511,27.355032 27.3354416,27.3508568) t=0 [0] (27.3270645,27.3592148) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=12 (27.3229256,27.3633518 27.324995,27.3612823 27.3270645,27.3592148) t=0 [0] (27.3229256,27.3633518) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=11 (27.319025,27.3672428 27.3209743,27.3652973 27.3229256,27.3633518) t=0 [0] (27.319025,27.3672428) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=10 (24.9708939,33.0220299 24.973814,29.7083225 27.319025,27.3672428) t=0 [0] (24.9708939,33.0220299) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=9 (27.3090477,38.6809464 24.9679718,36.3357391 24.9708939,33.0220299) t=0 [0] (27.3090477,38.6809464) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=8 (32.9638329,41.0290833 29.6501274,41.0261612 27.3090477,38.6809464) t=0 [0] (32.9638329,41.0290833) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=7 (38.6227531,38.6909218 36.2775421,41.0320053 32.9638329,41.0290833) t=0 [0] (38.6227531,38.6909218) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=6 (38.6341171,38.6795731 38.6284409,38.6852493 38.6227531,38.6909218) t=0 [0] (38.6341171,38.6795731) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markWinding id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0.0149880862 [4] (38.6445847,38.6690979) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=? windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::markAngle last id=5 windSum=-1 small=0
|
||||
SkOpSegment::debugShowActiveSpans id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0.0149880862 (38.6445847,38.6690979) tEnd=1 other=21 otherT=0.0026162254 otherIndex=7 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=6 (38.6341171,38.6795731 38.6284409,38.6852493 38.6227531,38.6909218) t=0 (38.6341171,38.6795731) tEnd=1 other=5 otherT=1 otherIndex=5 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=7 (38.6227531,38.6909218 36.2775421,41.0320053 32.9638329,41.0290833) t=0 (38.6227531,38.6909218) tEnd=1 other=6 otherT=1 otherIndex=1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=8 (32.9638329,41.0290833 29.6501274,41.0261612 27.3090477,38.6809464) t=0 (32.9638329,41.0290833) tEnd=1 other=7 otherT=1 otherIndex=1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=9 (27.3090477,38.6809464 24.9679718,36.3357391 24.9708939,33.0220299) t=0 (27.3090477,38.6809464) tEnd=1 other=8 otherT=1 otherIndex=1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=10 (24.9708939,33.0220299 24.973814,29.7083225 27.319025,27.3672428) t=0 (24.9708939,33.0220299) tEnd=1 other=9 otherT=1 otherIndex=1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=11 (27.319025,27.3672428 27.3209743,27.3652973 27.3229256,27.3633518) t=0 (27.319025,27.3672428) tEnd=1 other=10 otherT=1 otherIndex=1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=12 (27.3229256,27.3633518 27.324995,27.3612823 27.3270645,27.3592148) t=0 (27.3229256,27.3633518) tEnd=1 other=11 otherT=1 otherIndex=1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=13 (27.3270645,27.3592148 27.3312511,27.355032 27.3354416,27.3508568) t=0 (27.3270645,27.3592148) tEnd=1 other=12 otherT=1 otherIndex=1 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.0026162254 (38.6445847,38.6690979) tEnd=0.00362998223 other=5 otherT=0.0149880862 otherIndex=4 windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00362998223 (38.6398277,38.6738319) tEnd=1 other=17 otherT=0 otherIndex=0 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=22 (33,41 29.6862907,41 27.3431454,38.6568527) t=0 (33,41) tEnd=1 other=21 otherT=1 otherIndex=10 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=23 (27.3431454,38.6568527 25,36.3137093 25,33) t=0 (27.3431454,38.6568527) tEnd=1 other=22 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=17 (38.6398277,38.6738319 38.6447258,38.6689186) t=0 (38.6398277,38.6738319) tEnd=1 other=21 otherT=0.00362998223 otherIndex=8 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::activeOp id=13 t=1 tEnd=0 op=union miFrom=0 miTo=1 suFrom=0 suTo=0 result=1
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=13 (27.3270645,27.3592148 27.3312511,27.355032 27.3354416,27.3508568) t=0 [0] (27.3270645,27.3592148) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
bridgeOp current id=13 from=(27.3354416,27.3508568) to=(27.3270645,27.3592148)
|
||||
path.moveTo(27.3354416,27.3508568);
|
||||
path.quadTo(27.3312511,27.355032, 27.3270645,27.3592148);
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=12 (27.3229256,27.3633518 27.324995,27.3612823 27.3270645,27.3592148) t=0 [0] (27.3229256,27.3633518) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
bridgeOp current id=12 from=(27.3270645,27.3592148) to=(27.3229256,27.3633518)
|
||||
path.quadTo(27.324995,27.3612823, 27.3229256,27.3633518);
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=11 (27.319025,27.3672428 27.3209743,27.3652973 27.3229256,27.3633518) t=0 [0] (27.319025,27.3672428) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
bridgeOp current id=11 from=(27.3229256,27.3633518) to=(27.319025,27.3672428)
|
||||
path.quadTo(27.3209743,27.3652973, 27.319025,27.3672428);
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=10 (24.9708939,33.0220299 24.973814,29.7083225 27.319025,27.3672428) t=0 [0] (24.9708939,33.0220299) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
bridgeOp current id=10 from=(27.319025,27.3672428) to=(24.9708939,33.0220299)
|
||||
path.quadTo(24.973814,29.7083225, 24.9708939,33.0220299);
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=9 (27.3090477,38.6809464 24.9679718,36.3357391 24.9708939,33.0220299) t=0 [0] (27.3090477,38.6809464) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
bridgeOp current id=9 from=(24.9708939,33.0220299) to=(27.3090477,38.6809464)
|
||||
path.quadTo(24.9679718,36.3357391, 27.3090477,38.6809464);
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=8 (32.9638329,41.0290833 29.6501274,41.0261612 27.3090477,38.6809464) t=0 [0] (32.9638329,41.0290833) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
bridgeOp current id=8 from=(27.3090477,38.6809464) to=(32.9638329,41.0290833)
|
||||
path.quadTo(29.6501274,41.0261612, 32.9638329,41.0290833);
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=7 (38.6227531,38.6909218 36.2775421,41.0320053 32.9638329,41.0290833) t=0 [0] (38.6227531,38.6909218) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
bridgeOp current id=7 from=(32.9638329,41.0290833) to=(38.6227531,38.6909218)
|
||||
path.quadTo(36.2775421,41.0320053, 38.6227531,38.6909218);
|
||||
SkOpSegment::findNextOp simple
|
||||
SkOpSegment::markDoneBinary id=6 (38.6341171,38.6795731 38.6284409,38.6852493 38.6227531,38.6909218) t=0 [0] (38.6341171,38.6795731) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
bridgeOp current id=6 from=(38.6227531,38.6909218) to=(38.6341171,38.6795731)
|
||||
path.quadTo(38.6284409,38.6852493, 38.6341171,38.6795731);
|
||||
SkOpSegment::findNextOp
|
||||
SkOpAngle::dumpOne [5/3] next=5/2 sect=21/21 s=0.0149880862 [4] e=1 [5] sgn=-1 windVal=1 windSum=-1 oppVal=0 oppSum=0
|
||||
SkOpAngle::dumpOne [5/2] next=21/4 sect=1/1 s=0.0149880862 [4] e=0 [0] sgn=1 windVal=1 windSum=? done unorderable
|
||||
SkOpAngle::dumpOne [21/4] next=21/5 sect=1/1 s=0.0026162254 [7] e=0.00258220891 [3] sgn=1 windVal=1 windSum=? oppVal=1 oppSum=? done unorderable operand
|
||||
SkOpAngle::dumpOne [21/5] next=5/3 sect=17/17 s=0.0026162254 [7] e=0.00362998223 [8] sgn=-1 windVal=1 windSum=? oppVal=1 oppSum=? operand
|
||||
SkOpSegment::activeOp id=5 t=0.0149880862 tEnd=0 op=union miFrom=0 miTo=1 suFrom=0 suTo=0 result=1
|
||||
SkOpSegment::activeOp id=21 t=0.0026162254 tEnd=0.00258220891 op=union miFrom=1 miTo=0 suFrom=0 suTo=1 result=0
|
||||
SkOpSegment::activeOp id=21 t=0.0026162254 tEnd=0.00362998223 op=union miFrom=0 miTo=1 suFrom=1 suTo=0 result=0
|
||||
SkOpSegment::markDoneBinary id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.0026162254 [7] (38.6445847,38.6690979) tEnd=0.00362998223 newWindSum=-2147483647 newOppSum=-2147483647 oppSum=? windSum=? windValue=1 oppValue=1
|
||||
SkOpSegment::markDoneBinary id=5 (38.6447449,38.6689377 38.6394348,38.6742554 38.6341171,38.6795731) t=0.0149880862 [4] (38.6445847,38.6690979) tEnd=1 newWindSum=-1 newOppSum=0 oppSum=0 windSum=-1 windValue=1 oppValue=0
|
||||
SkOpSegment::findNextOp from:[5] to:[5] start=4 end=0
|
||||
bridgeOp current id=5 from=(38.6341171,38.6795731) to=(38.6445847,38.6690979)
|
||||
path.quadTo(38.6393547,38.6743355, 38.6445847,38.6690979);
|
||||
SkOpSegment::debugShowActiveSpans id=21 (38.6568527,38.6568527 36.3137093,41 33,41) t=0.00362998223 (38.6398277,38.6738319) tEnd=1 other=17 otherT=0 otherIndex=0 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=22 (33,41 29.6862907,41 27.3431454,38.6568527) t=0 (33,41) tEnd=1 other=21 otherT=1 otherIndex=10 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=23 (27.3431454,38.6568527 25,36.3137093 25,33) t=0 (27.3431454,38.6568527) tEnd=1 other=22 otherT=1 otherIndex=1 windSum=? windValue=1 oppValue=0
|
||||
SkOpSegment::debugShowActiveSpans id=17 (38.6398277,38.6738319 38.6447258,38.6689186) t=0 (38.6398277,38.6738319) tEnd=1 other=21 otherT=0.00362998223 otherIndex=8 windSum=? windValue=1 oppValue=0
|
||||
d:\cygwin\puregit\src\pathops\skopsegment.cpp:472: failed assertion "span.fT > 0"
|
||||
</div>
|
||||
|
||||
</div>
|
||||
|
||||
<script type="text/javascript">
|
||||
|
||||
var testDivs = [
|
||||
fuzz487a,
|
||||
fuzz763_1026368,
|
||||
];
|
||||
|
||||
var decimal_places = 3; // make this 3 to show more precision
|
||||
|
||||
Loading…
Reference in New Issue
Block a user