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 204 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
215 return result; | 215 return result; |
216 } | 216 } |
217 | 217 |
218 bool isClose(double t, const SkOpSegment* opp) const; | 218 bool isClose(double t, const SkOpSegment* opp) const; |
219 | 219 |
220 bool isHorizontal() const { | 220 bool isHorizontal() const { |
221 return fBounds.fTop == fBounds.fBottom; | 221 return fBounds.fTop == fBounds.fBottom; |
222 } | 222 } |
223 | 223 |
224 SkOpSegment* isSimple(SkOpSpanBase** end, int* step) { | 224 SkOpSegment* isSimple(SkOpSpanBase** end, int* step) { |
225 return nextChase(end, step, NULL, NULL); | 225 return nextChase(end, step, nullptr, nullptr); |
226 } | 226 } |
227 | 227 |
228 bool isVertical() const { | 228 bool isVertical() const { |
229 return fBounds.fLeft == fBounds.fRight; | 229 return fBounds.fLeft == fBounds.fRight; |
230 } | 230 } |
231 | 231 |
232 bool isVertical(SkOpSpanBase* start, SkOpSpanBase* end) const { | 232 bool isVertical(SkOpSpanBase* start, SkOpSpanBase* end) const { |
233 return (*CurveIsVertical[fVerb])(fPts, fWeight, start->t(), end->t()); | 233 return (*CurveIsVertical[fVerb])(fPts, fWeight, start->t(), end->t()); |
234 } | 234 } |
235 | 235 |
(...skipping 168 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
404 int fCount; // number of spans (one for a non-intersecting segment) | 404 int fCount; // number of spans (one for a non-intersecting segment) |
405 int fDoneCount; // number of processed spans (zero initially) | 405 int fDoneCount; // number of processed spans (zero initially) |
406 SkPath::Verb fVerb; | 406 SkPath::Verb fVerb; |
407 SkDCubic::CubicType fCubicType; | 407 SkDCubic::CubicType fCubicType; |
408 bool fTopsFound; | 408 bool fTopsFound; |
409 bool fVisited; // used by missing coincidence check | 409 bool fVisited; // used by missing coincidence check |
410 SkDEBUGCODE(int fID); | 410 SkDEBUGCODE(int fID); |
411 }; | 411 }; |
412 | 412 |
413 #endif | 413 #endif |
OLD | NEW |