pathops work in progress

src/pathops/SkOpAngle.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkIntersections.h"
 #include "SkOpAngle.h"
 #include "SkOpSegment.h"
 #include "SkPathOpsCurve.h"
@@ skipping 189 matching lines @@
         rroots = (ri.*CurveRay[SkPathOpsVerbToPoints(rVerb)])(rh.fSegment->pts(), ray);
     } while ((roots == 0 || rroots == 0) && (flip ^= true));
     if (roots == 0 || rroots == 0) {
         // FIXME: we don't have a solution in this case. The interim solution
         // is to mark the edges as unsortable, exclude them from this and
         // future computations, and allow the returned path to be fragmented
         fUnsortable = true;
         return COMPARE_RESULT("roots == 0 || rroots == 0", this < &rh);
     }
     SkASSERT(fSide != 0 && rh.fSide != 0);
-    SkASSERT(fSide * rh.fSide > 0); // both are the same sign
+    if (fSide * rh.fSide < 0) {
+        fUnsortable = true;
+        return COMPARE_RESULT("14 fSide * rh.fSide < 0", this < &rh);
+    }
     SkDPoint lLoc;
     double best = SK_ScalarInfinity;
 #if DEBUG_SORT
     SkDebugf("lh=%d rh=%d use-lh=%d ray={{%1.9g,%1.9g}, {%1.9g,%1.9g}} %c\n",
             fSegment->debugID(), rh.fSegment->debugID(), useThis, ray[0].fX, ray[0].fY,
             ray[1].fX, ray[1].fY, "-+"[fSide > 0]);
 #endif
     for (int index = 0; index < roots; ++index) {
         SkDPoint loc = i.pt(index);
         SkDVector dxy = loc - ray[0];
@@ skipping 18 matching lines @@
                 best, dist, "><"[fSide < 0], rLoc.fX, rLoc.fY, dxy.fX, dxy.fY);
 #endif
         if (best > dist) {
             flip = true;
             break;
         }
     }
     if (flip) {
         leftLessThanRight = !leftLessThanRight;
     }
-    return COMPARE_RESULT("14 leftLessThanRight", leftLessThanRight);
+    return COMPARE_RESULT("15 leftLessThanRight", leftLessThanRight);
 }
 
 bool SkOpAngle::isHorizontal() const {
     return dy() == 0 && fSegment->verb() == SkPath::kLine_Verb;
 }
 
 // lengthen cannot cross opposite angle
 bool SkOpAngle::lengthen(const SkOpAngle& opp) {
     if (fSegment->other(fEnd) == opp.fSegment) {
         return false;
@@ skipping 161 matching lines @@
     const SkOpSpan& spanMin = fStart < fEnd ? spanStart : spanEnd;
     SkDebugf("id=%d (%1.9g,%1.9g) start=%d (%1.9g) end=%d (%1.9g) sumWind=",
             fSegment->debugID(), fSegment->xAtT(fStart), fSegment->yAtT(fStart),
             fStart, spanStart.fT, fEnd, spanEnd.fT);
     SkPathOpsDebug::WindingPrintf(spanMin.fWindSum);
     SkDebugf(" oppWind=");
     SkPathOpsDebug::WindingPrintf(spanMin.fOppSum),
     SkDebugf(" done=%d\n", spanMin.fDone);
 }
 #endif