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 253 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
264 bool markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding
, | 264 bool markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding
, |
265 int oppWinding, SkOpSpanBase** lastPtr); | 265 int oppWinding, SkOpSpanBase** lastPtr); |
266 SkOpSpanBase* markAngle(int maxWinding, int sumWinding, const SkOpAngle* ang
le); | 266 SkOpSpanBase* markAngle(int maxWinding, int sumWinding, const SkOpAngle* ang
le); |
267 SkOpSpanBase* markAngle(int maxWinding, int sumWinding, int oppMaxWinding, i
nt oppSumWinding, | 267 SkOpSpanBase* markAngle(int maxWinding, int sumWinding, int oppMaxWinding, i
nt oppSumWinding, |
268 const SkOpAngle* angle); | 268 const SkOpAngle* angle); |
269 void markDone(SkOpSpan* ); | 269 void markDone(SkOpSpan* ); |
270 bool markWinding(SkOpSpan* , int winding); | 270 bool markWinding(SkOpSpan* , int winding); |
271 bool markWinding(SkOpSpan* , int winding, int oppWinding); | 271 bool markWinding(SkOpSpan* , int winding, int oppWinding); |
272 bool match(const SkOpPtT* span, const SkOpSegment* parent, double t, const S
kPoint& pt) const; | 272 bool match(const SkOpPtT* span, const SkOpSegment* parent, double t, const S
kPoint& pt) const; |
273 bool missingCoincidence(SkOpCoincidence* coincidences, SkChunkAlloc* allocat
or); | 273 bool missingCoincidence(SkOpCoincidence* coincidences, SkChunkAlloc* allocat
or); |
274 void moveMultiples(); | 274 bool moveMultiples(); |
275 void moveNearby(); | 275 void moveNearby(); |
276 | 276 |
277 SkOpSegment* next() const { | 277 SkOpSegment* next() const { |
278 return fNext; | 278 return fNext; |
279 } | 279 } |
280 | 280 |
281 SkOpSegment* nextChase(SkOpSpanBase** , int* step, SkOpSpan** , SkOpSpanBase
** last) const; | 281 SkOpSegment* nextChase(SkOpSpanBase** , int* step, SkOpSpan** , SkOpSpanBase
** last) const; |
282 bool operand() const; | 282 bool operand() const; |
283 | 283 |
284 static int OppSign(const SkOpSpanBase* start, const SkOpSpanBase* end) { | 284 static int OppSign(const SkOpSpanBase* start, const SkOpSpanBase* end) { |
(...skipping 131 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
416 SkPathOpsBounds fBounds; // tight bounds | 416 SkPathOpsBounds fBounds; // tight bounds |
417 SkScalar fWeight; | 417 SkScalar fWeight; |
418 int fCount; // number of spans (one for a non-intersecting segment) | 418 int fCount; // number of spans (one for a non-intersecting segment) |
419 int fDoneCount; // number of processed spans (zero initially) | 419 int fDoneCount; // number of processed spans (zero initially) |
420 SkPath::Verb fVerb; | 420 SkPath::Verb fVerb; |
421 bool fVisited; // used by missing coincidence check | 421 bool fVisited; // used by missing coincidence check |
422 SkDEBUGCODE(int fID); | 422 SkDEBUGCODE(int fID); |
423 }; | 423 }; |
424 | 424 |
425 #endif | 425 #endif |
OLD | NEW |