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 SkIntersections_DEFINE | 7 #ifndef SkIntersections_DEFINE |
8 #define SkIntersections_DEFINE | 8 #define SkIntersections_DEFINE |
9 | 9 |
10 #include "SkPathOpsCubic.h" | 10 #include "SkPathOpsCubic.h" |
(...skipping 190 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
201 int horizontal(const SkDLine&, double left, double right, double y, bool fli
pped); | 201 int horizontal(const SkDLine&, double left, double right, double y, bool fli
pped); |
202 int horizontal(const SkDQuad&, double left, double right, double y, bool fli
pped); | 202 int horizontal(const SkDQuad&, double left, double right, double y, bool fli
pped); |
203 int horizontal(const SkDQuad&, double left, double right, double y, double t
Range[2]); | 203 int horizontal(const SkDQuad&, double left, double right, double y, double t
Range[2]); |
204 int horizontal(const SkDCubic&, double y, double tRange[3]); | 204 int horizontal(const SkDCubic&, double y, double tRange[3]); |
205 int horizontal(const SkDCubic&, double left, double right, double y, bool fl
ipped); | 205 int horizontal(const SkDCubic&, double left, double right, double y, bool fl
ipped); |
206 int horizontal(const SkDCubic&, double left, double right, double y, double
tRange[3]); | 206 int horizontal(const SkDCubic&, double left, double right, double y, double
tRange[3]); |
207 // FIXME : does not respect swap | 207 // FIXME : does not respect swap |
208 int insert(double one, double two, const SkDPoint& pt); | 208 int insert(double one, double two, const SkDPoint& pt); |
209 // start if index == 0 : end if index == 1 | 209 // start if index == 0 : end if index == 1 |
210 void insertCoincident(double one, double two, const SkDPoint& pt); | 210 void insertCoincident(double one, double two, const SkDPoint& pt); |
211 void insertCoincidentPair(double s1, double e1, double s2, double e2, | |
212 const SkDPoint& startPt, const SkDPoint& endPt); | |
213 int intersect(const SkDLine&, const SkDLine&); | 211 int intersect(const SkDLine&, const SkDLine&); |
214 int intersect(const SkDQuad&, const SkDLine&); | 212 int intersect(const SkDQuad&, const SkDLine&); |
215 int intersect(const SkDQuad&, const SkDQuad&); | 213 int intersect(const SkDQuad&, const SkDQuad&); |
216 int intersect(const SkDCubic&); // return true if cubic self-intersects | 214 int intersect(const SkDCubic&); // return true if cubic self-intersects |
217 int intersect(const SkDCubic&, const SkDLine&); | 215 int intersect(const SkDCubic&, const SkDLine&); |
218 int intersect(const SkDCubic&, const SkDQuad&); | 216 int intersect(const SkDCubic&, const SkDQuad&); |
219 int intersect(const SkDCubic&, const SkDCubic&); | 217 int intersect(const SkDCubic&, const SkDCubic&); |
220 int intersectRay(const SkDLine&, const SkDLine&); | 218 int intersectRay(const SkDLine&, const SkDLine&); |
221 int intersectRay(const SkDQuad&, const SkDLine&); | 219 int intersectRay(const SkDQuad&, const SkDLine&); |
222 int intersectRay(const SkDCubic&, const SkDLine&); | 220 int intersectRay(const SkDCubic&, const SkDLine&); |
(...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
254 #ifdef SK_DEBUG | 252 #ifdef SK_DEBUG |
255 int fDepth; | 253 int fDepth; |
256 #endif | 254 #endif |
257 }; | 255 }; |
258 | 256 |
259 extern int (SkIntersections::*CurveRay[])(const SkPoint[], const SkDLine& ); | 257 extern int (SkIntersections::*CurveRay[])(const SkPoint[], const SkDLine& ); |
260 extern int (SkIntersections::*CurveVertical[])(const SkPoint[], SkScalar top, Sk
Scalar bottom, | 258 extern int (SkIntersections::*CurveVertical[])(const SkPoint[], SkScalar top, Sk
Scalar bottom, |
261 SkScalar x, bool flipped); | 259 SkScalar x, bool flipped); |
262 | 260 |
263 #endif | 261 #endif |
OLD | NEW |