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 116 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
127 | 127 |
128 bool ptAlreadySeen(const SkOpPtT* head) const; | 128 bool ptAlreadySeen(const SkOpPtT* head) const; |
129 SkOpPtT* prev(); | 129 SkOpPtT* prev(); |
130 SkOpPtT* remove(const SkOpPtT* kept); | 130 SkOpPtT* remove(const SkOpPtT* kept); |
131 void removeNext(const SkOpPtT* kept); | 131 void removeNext(const SkOpPtT* kept); |
132 | 132 |
133 const SkOpSegment* segment() const; | 133 const SkOpSegment* segment() const; |
134 SkOpSegment* segment(); | 134 SkOpSegment* segment(); |
135 | 135 |
136 void setCoincident() const { | 136 void setCoincident() const { |
137 SkASSERT(!fDeleted); | 137 SkOPASSERT(!fDeleted); |
138 fCoincident = true; | 138 fCoincident = true; |
139 } | 139 } |
140 | 140 |
141 void setDeleted(); | 141 void setDeleted(); |
142 | 142 |
143 void setSpan(const SkOpSpanBase* span) { | 143 void setSpan(const SkOpSpanBase* span) { |
144 fSpan = const_cast<SkOpSpanBase*>(span); | 144 fSpan = const_cast<SkOpSpanBase*>(span); |
145 } | 145 } |
146 | 146 |
147 const SkOpSpanBase* span() const { | 147 const SkOpSpanBase* span() const { |
(...skipping 400 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
548 int fWindSum; // accumulated from contours surrounding this one. | 548 int fWindSum; // accumulated from contours surrounding this one. |
549 int fOppSum; // for binary operators: the opposite winding sum | 549 int fOppSum; // for binary operators: the opposite winding sum |
550 int fWindValue; // 0 == canceled; 1 == normal; >1 == coincident | 550 int fWindValue; // 0 == canceled; 1 == normal; >1 == coincident |
551 int fOppValue; // normally 0 -- when binary coincident edges combine, opp v
alue goes here | 551 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 | 552 int fTopTTry; // specifies direction and t value to try next |
553 bool fDone; // if set, this span to next higher T has been processed | 553 bool fDone; // if set, this span to next higher T has been processed |
554 mutable bool fAlreadyAdded; | 554 mutable bool fAlreadyAdded; |
555 }; | 555 }; |
556 | 556 |
557 #endif | 557 #endif |
OLD | NEW |