| 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 SkOpSegment_DEFINE | 7 #ifndef SkOpSegment_DEFINE |
| 8 #define SkOpSegment_DEFINE | 8 #define SkOpSegment_DEFINE |
| 9 | 9 |
| 10 #include "SkOpAngle.h" | 10 #include "SkOpAngle.h" |
| (...skipping 213 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 224 bool isVertical(SkOpSpanBase* start, SkOpSpanBase* end) const { | 224 bool isVertical(SkOpSpanBase* start, SkOpSpanBase* end) const { |
| 225 return (*CurveIsVertical[fVerb])(fPts, fWeight, start->t(), end->t()); | 225 return (*CurveIsVertical[fVerb])(fPts, fWeight, start->t(), end->t()); |
| 226 } | 226 } |
| 227 | 227 |
| 228 bool isXor() const; | 228 bool isXor() const; |
| 229 | 229 |
| 230 const SkPoint& lastPt() const { | 230 const SkPoint& lastPt() const { |
| 231 return fPts[SkPathOpsVerbToPoints(fVerb)]; | 231 return fPts[SkPathOpsVerbToPoints(fVerb)]; |
| 232 } | 232 } |
| 233 | 233 |
| 234 void markAllDone(); |
| 234 SkOpSpanBase* markAndChaseDone(SkOpSpanBase* start, SkOpSpanBase* end); | 235 SkOpSpanBase* markAndChaseDone(SkOpSpanBase* start, SkOpSpanBase* end); |
| 235 bool markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding
, | 236 bool markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding
, |
| 236 SkOpSpanBase** lastPtr); | 237 SkOpSpanBase** lastPtr); |
| 237 bool markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding
, | 238 bool markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding
, |
| 238 int oppWinding, SkOpSpanBase** lastPtr); | 239 int oppWinding, SkOpSpanBase** lastPtr); |
| 239 SkOpSpanBase* markAngle(int maxWinding, int sumWinding, const SkOpAngle* ang
le); | 240 SkOpSpanBase* markAngle(int maxWinding, int sumWinding, const SkOpAngle* ang
le); |
| 240 SkOpSpanBase* markAngle(int maxWinding, int sumWinding, int oppMaxWinding, i
nt oppSumWinding, | 241 SkOpSpanBase* markAngle(int maxWinding, int sumWinding, int oppMaxWinding, i
nt oppSumWinding, |
| 241 const SkOpAngle* angle); | 242 const SkOpAngle* angle); |
| 242 void markDone(SkOpSpan* ); | 243 void markDone(SkOpSpan* ); |
| 243 bool markWinding(SkOpSpan* , int winding); | 244 bool markWinding(SkOpSpan* , int winding); |
| (...skipping 147 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 391 int fCount; // number of spans (one for a non-intersecting segment) | 392 int fCount; // number of spans (one for a non-intersecting segment) |
| 392 int fDoneCount; // number of processed spans (zero initially) | 393 int fDoneCount; // number of processed spans (zero initially) |
| 393 SkPath::Verb fVerb; | 394 SkPath::Verb fVerb; |
| 394 SkDCubic::CubicType fCubicType; | 395 SkDCubic::CubicType fCubicType; |
| 395 bool fTopsFound; | 396 bool fTopsFound; |
| 396 bool fVisited; // used by missing coincidence check | 397 bool fVisited; // used by missing coincidence check |
| 397 SkDEBUGCODE(int fID); | 398 SkDEBUGCODE(int fID); |
| 398 }; | 399 }; |
| 399 | 400 |
| 400 #endif | 401 #endif |
| OLD | NEW |