| Index: src/pathops/SkPathOpsCubic.h
|
| diff --git a/src/pathops/SkPathOpsCubic.h b/src/pathops/SkPathOpsCubic.h
|
| index 500319607dc0c29b3a78acf63a5b80fbd1baa382..ade56b83fe0eddee842850fc9f7d23b865232ade 100644
|
| --- a/src/pathops/SkPathOpsCubic.h
|
| +++ b/src/pathops/SkPathOpsCubic.h
|
| @@ -33,7 +33,9 @@ struct SkDCubic {
|
| const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
|
| SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
|
|
|
| + static int AddValidTs(double allRoots[3], int realRoots, double validRoots[3]);
|
| void align(int endIndex, int ctrlIndex, SkDPoint* dstPt) const;
|
| + double binarySearch(double step, double t, double axisIntercept, bool yAxis) const;
|
| double calcPrecision() const;
|
| SkDCubicPair chopAt(double t) const;
|
| bool clockwise() const;
|
| @@ -56,6 +58,10 @@ struct SkDCubic {
|
| SkDPoint ptAtT(double t) const;
|
| static int RootsReal(double A, double B, double C, double D, double t[3]);
|
| static int RootsValidT(const double A, const double B, const double C, double D, double s[3]);
|
| + static int RootsValidT(const double A, const double B, const double C, double D, double s[3],
|
| + int* sCount, double t[3]);
|
| + void searchRoots(double allRoots[3], int realRoots, double* t, double axisIntercept,
|
| + bool yAxis) const;
|
| bool serpentine() const;
|
| SkDCubic subDivide(double t1, double t2) const;
|
|
|
|
|