compute initial winding from projected rays

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 24 matching lines @@
     bool computeSector();
     int convexHullOverlaps(const SkOpAngle* ) const;
 
     const SkOpAngle* debugAngle(int id) const;
     SkOpContour* debugContour(int id);
 
     int debugID() const {
         return SkDEBUGRELEASE(fID, -1);
     }
 
-#if DEBUG_SORT || DEBUG_SWAP_TOP
+#if DEBUG_SORT
     void debugLoop() const;
 #endif
 
 #if DEBUG_ANGLE
     SkString debugPart() const;
 #endif
     const SkOpPtT* debugPtT(int id) const;
     const SkOpSegment* debugSegment(int id) const;
+    int debugSign() const;
     const SkOpSpanBase* debugSpan(int id) const;
     void debugValidate() const; 
     void debugValidateNext() const;  // in debug builds, verify that angle loop is uncorrupted
     double distEndRatio(double dist) const;
     // available to testing only
     void dump() const;
     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;
     }
 
     bool endsIntersect(SkOpAngle* );
     bool endToSide(const SkOpAngle* rh, bool* inside) const;
-    SkOpAngle* findFirst();
     int findSector(SkPath::Verb verb, double x, double y) const;
     SkOpGlobalState* globalState() const;
     void insert(SkOpAngle* );
     SkOpSpanBase* lastMarked() const;
     bool loopContains(const SkOpAngle* ) const;
     int loopCount() const;
-    bool markStops();
     bool merge(SkOpAngle* );
     double midT() const;
     bool midToSide(const SkOpAngle* rh, bool* inside) const;
 
     SkOpAngle* next() const {
         return fNext;
     }
 
     bool oppositePlanes(const SkOpAngle* rh) const;
     bool orderable(SkOpAngle* rh);  // false == this < rh ; true == this > rh
@@ skipping 15 matching lines @@
     void setID(int id) {
         SkDEBUGCODE(fID = id);
     }
 
     void setLastMarked(SkOpSpanBase* marked) {
         fLastMarked = marked;
     }
 
     void setSector();
     void setSpans();
-    int sign() const;
 
     SkOpSpanBase* start() const {
         return fStart;
     }
 
     SkOpSpan* starter();
     bool tangentsDiverge(const SkOpAngle* rh, double s0xt0) const;
 
     bool unorderable() const {
         return fUnorderable;
     }
 
     SkDCurve fCurvePart;  // the curve from start to end
     double fSide;
     SkLineParameters fTangentHalf;  // used only to sort a pair of lines or line-like sections
     SkOpAngle* fNext;
     SkOpSpanBase* fLastMarked;
     SkDVector fSweep[2];
     SkOpSpanBase* fStart;
     SkOpSpanBase* fEnd;
     SkOpSpanBase* fComputedEnd;
     int fSectorMask;
     int8_t fSectorStart;  // in 32nds of a circle
     int8_t fSectorEnd;
     bool fIsCurve;
-    bool fStop;  // set if ordered angle is greater than the previous
     bool fUnorderable;
     bool fUnorderedSweep;  // set when a cubic's first control point between the sweep vectors
     bool fComputeSector;
     bool fComputedSector;
     bool fCheckCoincidence;
     SkDEBUGCODE(int fID);
 
 };
 
 
 
 #endif