| Index: src/pathops/SkPathOpsCommon.h
|
| diff --git a/src/pathops/SkPathOpsCommon.h b/src/pathops/SkPathOpsCommon.h
|
| index 4ba4af230044e362960f94f7e71bdd4db068ff7e..e1ae998b1037a641b3d2c0ed89a9335d9abfb3cc 100644
|
| --- a/src/pathops/SkPathOpsCommon.h
|
| +++ b/src/pathops/SkPathOpsCommon.h
|
| @@ -7,6 +7,7 @@
|
| #ifndef SkPathOpsCommon_DEFINED
|
| #define SkPathOpsCommon_DEFINED
|
|
|
| +#include "SkOpAngle.h"
|
| #include "SkOpContour.h"
|
| #include "SkTDArray.h"
|
|
|
| @@ -14,11 +15,12 @@ class SkPathWriter;
|
|
|
| void Assemble(const SkPathWriter& path, SkPathWriter* simple);
|
| void CheckEnds(SkTArray<SkOpContour*, true>* contourList);
|
| +void CheckTiny(SkTArray<SkOpContour*, true>* contourList);
|
| // FIXME: find chase uses insert, so it can't be converted to SkTArray yet
|
| SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex);
|
| -SkOpSegment* FindSortableTop(const SkTArray<SkOpContour*, true>& contourList, bool* firstContour,
|
| - int* index, int* endIndex, SkPoint* topLeft, bool* unsortable,
|
| - bool* done, bool binary);
|
| +SkOpSegment* FindSortableTop(const SkTArray<SkOpContour*, true>& , SkOpAngle::IncludeType ,
|
| + bool* firstContour, int* index, int* endIndex, SkPoint* topLeft,
|
| + bool* unsortable, bool* done);
|
| SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end);
|
| void FixOtherTIndex(SkTArray<SkOpContour*, true>* contourList);
|
| void MakeContourList(SkTArray<SkOpContour>& contours, SkTArray<SkOpContour*, true>& list,
|
|
|