| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 6 */ | 6 */ |
| 7 #ifndef SkOpSpan_DEFINED | 7 #ifndef SkOpSpan_DEFINED |
| 8 #define SkOpSpan_DEFINED | 8 #define SkOpSpan_DEFINED |
| 9 | 9 |
| 10 #include "SkPathOpsDebug.h" | 10 #include "SkPathOpsDebug.h" |
| (...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 64 | 64 |
| 65 bool debugAddOpp(const SkOpPtT* opp) const; | 65 bool debugAddOpp(const SkOpPtT* opp) const; |
| 66 const SkOpAngle* debugAngle(int id) const; | 66 const SkOpAngle* debugAngle(int id) const; |
| 67 const SkOpCoincidence* debugCoincidence() const; | 67 const SkOpCoincidence* debugCoincidence() const; |
| 68 bool debugContains(const SkOpPtT* ) const; | 68 bool debugContains(const SkOpPtT* ) const; |
| 69 const SkOpPtT* debugContains(const SkOpSegment* check) const; | 69 const SkOpPtT* debugContains(const SkOpSegment* check) const; |
| 70 SkOpContour* debugContour(int id); | 70 SkOpContour* debugContour(int id); |
| 71 int debugLoopLimit(bool report) const; | 71 int debugLoopLimit(bool report) const; |
| 72 bool debugMatchID(int id) const; | 72 bool debugMatchID(int id) const; |
| 73 const SkOpPtT* debugPtT(int id) const; | 73 const SkOpPtT* debugPtT(int id) const; |
| 74 void debugResetCoinT() const; |
| 74 const SkOpSegment* debugSegment(int id) const; | 75 const SkOpSegment* debugSegment(int id) const; |
| 76 void debugSetCoinT(int ) const; |
| 75 const SkOpSpanBase* debugSpan(int id) const; | 77 const SkOpSpanBase* debugSpan(int id) const; |
| 76 void debugValidate() const; | 78 void debugValidate() const; |
| 77 | 79 |
| 78 bool deleted() const { | 80 bool deleted() const { |
| 79 return fDeleted; | 81 return fDeleted; |
| 80 } | 82 } |
| 81 | 83 |
| 82 bool duplicate() const { | 84 bool duplicate() const { |
| 83 return fDuplicatePt; | 85 return fDuplicatePt; |
| 84 } | 86 } |
| (...skipping 143 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 228 #ifdef SK_DEBUG | 230 #ifdef SK_DEBUG |
| 229 bool debugDeleted() const { return fDeleted; } | 231 bool debugDeleted() const { return fDeleted; } |
| 230 #endif | 232 #endif |
| 231 #if DEBUG_COINCIDENCE_VERBOSE | 233 #if DEBUG_COINCIDENCE_VERBOSE |
| 232 void debugInsertCoinEnd(const char* id, SkPathOpsDebug::GlitchLog* , | 234 void debugInsertCoinEnd(const char* id, SkPathOpsDebug::GlitchLog* , |
| 233 const SkOpSpanBase* ) const; | 235 const SkOpSpanBase* ) const; |
| 234 void debugMergeContained(const char* id, SkPathOpsDebug::GlitchLog* , | 236 void debugMergeContained(const char* id, SkPathOpsDebug::GlitchLog* , |
| 235 const SkPathOpsBounds& bounds, bool* deleted) const
; | 237 const SkPathOpsBounds& bounds, bool* deleted) const
; |
| 236 #endif | 238 #endif |
| 237 const SkOpPtT* debugPtT(int id) const; | 239 const SkOpPtT* debugPtT(int id) const; |
| 240 void debugResetCoinT() const; |
| 238 const SkOpSegment* debugSegment(int id) const; | 241 const SkOpSegment* debugSegment(int id) const; |
| 242 void debugSetCoinT(int ) const; |
| 239 const SkOpSpanBase* debugSpan(int id) const; | 243 const SkOpSpanBase* debugSpan(int id) const; |
| 240 const SkOpSpan* debugStarter(SkOpSpanBase const** endPtr) const; | 244 const SkOpSpan* debugStarter(SkOpSpanBase const** endPtr) const; |
| 241 SkOpGlobalState* globalState() const; | 245 SkOpGlobalState* globalState() const; |
| 242 void debugValidate() const; | 246 void debugValidate() const; |
| 243 | 247 |
| 244 bool deleted() const { | 248 bool deleted() const { |
| 245 return fPtT.deleted(); | 249 return fPtT.deleted(); |
| 246 } | 250 } |
| 247 | 251 |
| 248 void dump() const; // available to testing only | 252 void dump() const; // available to testing only |
| (...skipping 299 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 548 int fWindSum; // accumulated from contours surrounding this one. | 552 int fWindSum; // accumulated from contours surrounding this one. |
| 549 int fOppSum; // for binary operators: the opposite winding sum | 553 int fOppSum; // for binary operators: the opposite winding sum |
| 550 int fWindValue; // 0 == canceled; 1 == normal; >1 == coincident | 554 int fWindValue; // 0 == canceled; 1 == normal; >1 == coincident |
| 551 int fOppValue; // normally 0 -- when binary coincident edges combine, opp v
alue goes here | 555 int fOppValue; // normally 0 -- when binary coincident edges combine, opp v
alue goes here |
| 552 int fTopTTry; // specifies direction and t value to try next | 556 int fTopTTry; // specifies direction and t value to try next |
| 553 bool fDone; // if set, this span to next higher T has been processed | 557 bool fDone; // if set, this span to next higher T has been processed |
| 554 mutable bool fAlreadyAdded; | 558 mutable bool fAlreadyAdded; |
| 555 }; | 559 }; |
| 556 | 560 |
| 557 #endif | 561 #endif |
| OLD | NEW |