diff options
| author |  caryclark <caryclark@google.com> | 2015-05-18 05:12:56 -0700 |
|---|---|---|
| committer |  Commit bot <commit-bot@chromium.org> | 2015-05-18 05:12:56 -0700 |
| commit | 5b5ddd73b4baf22752924bf20d097e96236c36f8 (patch) | |
| tree | e4ae4c9db97d4a19fe504b9aabf5f6d373aeeffa /src/pathops/SkPathOpsCommon.h | |
| parent | 2e0303f91bdada6dddb73105a82f17601265379d (diff) | |
The path ops builder code needs to determine the winding of each contour added, and reverse windings if the contours are nested in other contours.
Cheap (one contour) paths can be evaluated and reversed as needed with a minimum of checking, but multi-contour paths invoke the regular path ops machinery to determine who is contained by whom.
More tests need to be added to verify that all corner cases are considered, but this fixes the cases in the bug thus far.
R=fmalita@chromium.org
TBR=reed@google.com
BUG=skia:3838
Review URL: https://codereview.chromium.org/1129193006
Diffstat (limited to 'src/pathops/SkPathOpsCommon.h')
| -rw-r--r-- | src/pathops/SkPathOpsCommon.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/src/pathops/SkPathOpsCommon.h b/src/pathops/SkPathOpsCommon.h index b7fbf38b3d..f76d57c83b 100644 --- a/src/pathops/SkPathOpsCommon.h +++ b/src/pathops/SkPathOpsCommon.h @@ -22,6 +22,7 @@ SkOpSegment* FindChase(SkTDArray<SkOpSpanBase*>* chase, SkOpSpanBase** startPtr, SkOpSpan* FindSortableTop(SkOpContourHead* ); SkOpSegment* FindUndone(SkOpContourHead* , SkOpSpanBase** startPtr, SkOpSpanBase** endPtr); +void FixWinding(SkPath* path); bool SortContourList(SkOpContourHead** , bool evenOdd, bool oppEvenOdd); bool HandleCoincidence(SkOpContourHead* , SkOpCoincidence* , SkChunkAlloc* ); bool OpDebug(const SkPath& one, const SkPath& two, SkPathOp op, SkPath* result, bool expectSuccess); |