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 286 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
297 SkChunkAlloc* allocator); | 297 SkChunkAlloc* allocator); |
298 | 298 |
299 void resetVisited() { | 299 void resetVisited() { |
300 fVisited = false; | 300 fVisited = false; |
301 } | 301 } |
302 | 302 |
303 void setContour(SkOpContour* contour) { | 303 void setContour(SkOpContour* contour) { |
304 fContour = contour; | 304 fContour = contour; |
305 } | 305 } |
306 | 306 |
307 void setCubicType(SkDCubic::CubicType cubicType) { | |
308 fCubicType = cubicType; | |
309 } | |
310 | |
311 void setNext(SkOpSegment* next) { | 307 void setNext(SkOpSegment* next) { |
312 fNext = next; | 308 fNext = next; |
313 } | 309 } |
314 | 310 |
315 void setPrev(SkOpSegment* prev) { | 311 void setPrev(SkOpSegment* prev) { |
316 fPrev = prev; | 312 fPrev = prev; |
317 } | 313 } |
318 | 314 |
319 void setVisited() { | 315 void setVisited() { |
320 fVisited = true; | 316 fVisited = true; |
(...skipping 76 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
397 SkOpContour* fContour; | 393 SkOpContour* fContour; |
398 SkOpSegment* fNext; // forward-only linked list used by contour to walk the
segments | 394 SkOpSegment* fNext; // forward-only linked list used by contour to walk the
segments |
399 const SkOpSegment* fPrev; | 395 const SkOpSegment* fPrev; |
400 SkPoint fOriginal[2]; // if aligned, the original unaligned points are here | 396 SkPoint fOriginal[2]; // if aligned, the original unaligned points are here |
401 SkPoint* fPts; // pointer into array of points owned by edge builder that m
ay be tweaked | 397 SkPoint* fPts; // pointer into array of points owned by edge builder that m
ay be tweaked |
402 SkPathOpsBounds fBounds; // tight bounds | 398 SkPathOpsBounds fBounds; // tight bounds |
403 SkScalar fWeight; | 399 SkScalar fWeight; |
404 int fCount; // number of spans (one for a non-intersecting segment) | 400 int fCount; // number of spans (one for a non-intersecting segment) |
405 int fDoneCount; // number of processed spans (zero initially) | 401 int fDoneCount; // number of processed spans (zero initially) |
406 SkPath::Verb fVerb; | 402 SkPath::Verb fVerb; |
407 SkDCubic::CubicType fCubicType; | |
408 bool fTopsFound; | |
409 bool fVisited; // used by missing coincidence check | 403 bool fVisited; // used by missing coincidence check |
410 SkDEBUGCODE(int fID); | 404 SkDEBUGCODE(int fID); |
411 }; | 405 }; |
412 | 406 |
413 #endif | 407 #endif |
OLD | NEW |