break ambiguous angle sorting loop

src/pathops/SkOpAngle.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #ifndef SkOpAngle_DEFINED
 #define SkOpAngle_DEFINED
 
 #include "SkLineParameters.h"
@@ skipping 46 matching lines @@
     void dumpCurves() const;
     void dumpLoop() const;
     void dumpOne(bool functionHeader) const;
     void dumpTo(const SkOpSegment* fromSeg, const SkOpAngle* ) const;
     void dumpTest() const;
 
     SkOpSpanBase* end() const {
         return fEnd;
     }
 
-    void insert(SkOpAngle* );
+    bool insert(SkOpAngle* );
     SkOpSpanBase* lastMarked() const;
     bool loopContains(const SkOpAngle* ) const;
     int loopCount() const;
 
     SkOpAngle* next() const {
         return fNext;
     }
 
     SkOpAngle* previous() const;
     SkOpSegment* segment() const;
     void set(SkOpSpanBase* start, SkOpSpanBase* end);
 
     void setLastMarked(SkOpSpanBase* marked) {
         fLastMarked = marked;
     }
 
     SkOpSpanBase* start() const {
         return fStart;
     }
 
     SkOpSpan* starter();
 
+    bool tangentsAmbiguous() const {
+        return fTangentsAmbiguous;
+    }
+
     bool unorderable() const {
         return fUnorderable;
     }
 
 private:
     bool after(SkOpAngle* test);
     int allOnOneSide(const SkOpAngle* test);
     bool checkCrossesZero() const;
     bool checkParallel(SkOpAngle* );
     bool computeSector();
-    int convexHullOverlaps(const SkOpAngle* ) const;
+    int convexHullOverlaps(const SkOpAngle* );
     bool endToSide(const SkOpAngle* rh, bool* inside) const;
     bool endsIntersect(SkOpAngle* );
     int findSector(SkPath::Verb verb, double x, double y) const;
     SkOpGlobalState* globalState() const;
     bool merge(SkOpAngle* );
     double midT() const;
     bool midToSide(const SkOpAngle* rh, bool* inside) const;
     bool oppositePlanes(const SkOpAngle* rh) const;
     bool orderable(SkOpAngle* rh);  // false == this < rh ; true == this > rh
     void setSector();
     void setSpans();
-    bool tangentsDiverge(const SkOpAngle* rh, double s0xt0) const;
+    bool tangentsDiverge(const SkOpAngle* rh, double s0xt0);
 
     SkDCurve fOriginalCurvePart;  // the curve from start to end
     SkDCurveSweep fPart;  // the curve from start to end offset as needed
     double fSide;
     SkLineParameters fTangentHalf;  // used only to sort a pair of lines or line-like sections
     SkOpAngle* fNext;
     SkOpSpanBase* fLastMarked;
     SkOpSpanBase* fStart;
     SkOpSpanBase* fEnd;
     SkOpSpanBase* fComputedEnd;
     int fSectorMask;
     int8_t fSectorStart;  // in 32nds of a circle
     int8_t fSectorEnd;
     bool fUnorderable;
     bool fComputeSector;
     bool fComputedSector;
     bool fCheckCoincidence;
+    bool fTangentsAmbiguous;
     SkDEBUGCODE(int fID);
 
     friend class PathOpsAngleTester;
 };
 
 
 
 #endif