OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2013 Google Inc. | 2 * Copyright 2013 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 SkOpContour_DEFINED | 7 #ifndef SkOpContour_DEFINED |
8 #define SkOpContour_DEFINED | 8 #define SkOpContour_DEFINED |
9 | 9 |
10 #include "SkOpSegment.h" | 10 #include "SkOpSegment.h" |
(...skipping 22 matching lines...) Expand all Loading... |
33 } | 33 } |
34 | 34 |
35 void addConic(SkPoint pts[3], SkScalar weight, SkChunkAlloc* allocator) { | 35 void addConic(SkPoint pts[3], SkScalar weight, SkChunkAlloc* allocator) { |
36 appendSegment(allocator).addConic(pts, weight, this); | 36 appendSegment(allocator).addConic(pts, weight, this); |
37 } | 37 } |
38 | 38 |
39 void addCubic(SkPoint pts[4], SkChunkAlloc* allocator) { | 39 void addCubic(SkPoint pts[4], SkChunkAlloc* allocator) { |
40 appendSegment(allocator).addCubic(pts, this); | 40 appendSegment(allocator).addCubic(pts, this); |
41 } | 41 } |
42 | 42 |
43 void addCurve(SkPath::Verb verb, const SkPoint pts[4], SkChunkAlloc* allocat
or); | 43 SkOpSegment* addCurve(SkPath::Verb verb, const SkPoint pts[4], SkChunkAlloc*
allocator); |
44 | 44 |
45 void addLine(SkPoint pts[2], SkChunkAlloc* allocator) { | 45 void addLine(SkPoint pts[2], SkChunkAlloc* allocator) { |
46 appendSegment(allocator).addLine(pts, this); | 46 appendSegment(allocator).addLine(pts, this); |
47 } | 47 } |
48 | 48 |
49 void addQuad(SkPoint pts[3], SkChunkAlloc* allocator) { | 49 void addQuad(SkPoint pts[3], SkChunkAlloc* allocator) { |
50 appendSegment(allocator).addQuad(pts, this); | 50 appendSegment(allocator).addQuad(pts, this); |
51 } | 51 } |
52 | 52 |
53 void align() { | 53 void align() { |
(...skipping 298 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
352 int fFirstSorted; | 352 int fFirstSorted; |
353 bool fDone; // set by find top segment | 353 bool fDone; // set by find top segment |
354 bool fOperand; // true for the second argument to a binary operator | 354 bool fOperand; // true for the second argument to a binary operator |
355 bool fXor; // set if original path had even-odd fill | 355 bool fXor; // set if original path had even-odd fill |
356 bool fOppXor; // set if opposite path had even-odd fill | 356 bool fOppXor; // set if opposite path had even-odd fill |
357 SkDEBUGCODE(int fID); | 357 SkDEBUGCODE(int fID); |
358 SkDEBUGCODE(int fIndent); | 358 SkDEBUGCODE(int fIndent); |
359 }; | 359 }; |
360 | 360 |
361 #endif | 361 #endif |
OLD | NEW |