| 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 236 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 247 int addSelfT(SkOpSegment* other, const SkPoint& pt, double newT); | 247 int addSelfT(SkOpSegment* other, const SkPoint& pt, double newT); |
| 248 int addT(SkOpSegment* other, const SkPoint& pt, double newT); | 248 int addT(SkOpSegment* other, const SkPoint& pt, double newT); |
| 249 void addTCancel(double startT, double endT, SkOpSegment* other, double oStar
tT, double oEndT); | 249 void addTCancel(double startT, double endT, SkOpSegment* other, double oStar
tT, double oEndT); |
| 250 void addTCoincident(double startT, double endT, SkOpSegment* other, double o
StartT, | 250 void addTCoincident(double startT, double endT, SkOpSegment* other, double o
StartT, |
| 251 double oEndT); | 251 double oEndT); |
| 252 void addTPair(double t, SkOpSegment* other, double otherT, bool borrowWind,
const SkPoint& pt); | 252 void addTPair(double t, SkOpSegment* other, double otherT, bool borrowWind,
const SkPoint& pt); |
| 253 void addTPair(double t, SkOpSegment* other, double otherT, bool borrowWind,
const SkPoint& pt, | 253 void addTPair(double t, SkOpSegment* other, double otherT, bool borrowWind,
const SkPoint& pt, |
| 254 const SkPoint& oPt); | 254 const SkPoint& oPt); |
| 255 int addUnsortableT(SkOpSegment* other, bool start, const SkPoint& pt, double
newT); | 255 int addUnsortableT(SkOpSegment* other, bool start, const SkPoint& pt, double
newT); |
| 256 bool betweenTs(int lesser, double testT, int greater) const; | 256 bool betweenTs(int lesser, double testT, int greater) const; |
| 257 void checkEnds(); |
| 257 int computeSum(int startIndex, int endIndex, bool binary); | 258 int computeSum(int startIndex, int endIndex, bool binary); |
| 258 int crossedSpanY(const SkPoint& basePt, SkScalar* bestY, double* hitT, bool*
hitSomething, | 259 int crossedSpanY(const SkPoint& basePt, SkScalar* bestY, double* hitT, bool*
hitSomething, |
| 259 double mid, bool opp, bool current) const; | 260 double mid, bool opp, bool current) const; |
| 260 SkOpSegment* findNextOp(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* ne
xtEnd, | 261 SkOpSegment* findNextOp(SkTDArray<SkOpSpan*>* chase, int* nextStart, int* ne
xtEnd, |
| 261 bool* unsortable, SkPathOp op, const int xorMiMask, | 262 bool* unsortable, SkPathOp op, const int xorMiMask, |
| 262 const int xorSuMask); | 263 const int xorSuMask); |
| 263 SkOpSegment* findNextWinding(SkTDArray<SkOpSpan*>* chase, int* nextStart, in
t* nextEnd, | 264 SkOpSegment* findNextWinding(SkTDArray<SkOpSpan*>* chase, int* nextStart, in
t* nextEnd, |
| 264 bool* unsortable); | 265 bool* unsortable); |
| 265 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable); | 266 SkOpSegment* findNextXor(int* nextStart, int* nextEnd, bool* unsortable); |
| 266 void findTooCloseToCall(); | 267 void findTooCloseToCall(); |
| (...skipping 137 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 404 SkPath::Verb fVerb; | 405 SkPath::Verb fVerb; |
| 405 bool fOperand; | 406 bool fOperand; |
| 406 bool fXor; // set if original contour had even-odd fill | 407 bool fXor; // set if original contour had even-odd fill |
| 407 bool fOppXor; // set if opposite operand had even-odd fill | 408 bool fOppXor; // set if opposite operand had even-odd fill |
| 408 #if DEBUG_DUMP | 409 #if DEBUG_DUMP |
| 409 int fID; | 410 int fID; |
| 410 #endif | 411 #endif |
| 411 }; | 412 }; |
| 412 | 413 |
| 413 #endif | 414 #endif |
| OLD | NEW |