| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { in bezier_clip() argument
15 maxT = 0; in bezier_clip()
70 maxT = 1; in bezier_clip()
76 x_at(distance2y[0], distance2y[to_0[0]], top, bottom, flags, minT, maxT); in bezier_clip()
78 x_at(distance2y[0], distance2y[to_0[1]], top, bottom, flags, minT, maxT); in bezier_clip()
80 x_at(distance2y[to_3[0]], distance2y[3], top, bottom, flags, minT, maxT); in bezier_clip()
82 x_at(distance2y[to_3[1]], distance2y[3], top, bottom, flags, minT, maxT); in bezier_clip()
85 x_at(distance2y[1], distance2y[2], top, bottom, flags, minT, maxT); in bezier_clip()
88 return minT < maxT; // returns false if distance shows no intersection in bezier_clip()
|
| D | QuadraticBezierClip_Test.cpp | 32 double maxT = 1; in oneAtEndTest() local
33 bezier_clip(quad1, quad2, minT, maxT); in oneAtEndTest()
41 double maxT = 1; in oneOffTest() local
42 bezier_clip(quad1, quad2, minT, maxT); in oneOffTest()
60 double maxT = 1; in standardTestCases() local
61 bezier_clip(reduce1, reduce2, minT, maxT); in standardTestCases()
|
| D | QuadraticBezierClip.cpp | 15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { in bezier_clip() argument
17 maxT = 0; in bezier_clip()
57 maxT = 1; in bezier_clip()
66 x_at(distance2y[idx], distance2y[next], top, bottom, flags, minT, maxT); in bezier_clip()
78 q2[0].x, q2[0].y, q2[1].x, q2[1].y, q2[2].x, q2[2].y, minT, maxT); in bezier_clip()
81 return minT < maxT; // returns false if distance shows no intersection in bezier_clip()
|
| D | CubicConvexHull.cpp | 82 double minT, maxT; in intersect() local
83 if (!bezier_clip(smaller, larger, minT, maxT)) { in intersect()
84 if (minT == maxT) { in intersect()
103 double newMaxT1 = interp(minT1, maxT1, maxT); in intersect()
115 double newMaxT2 = interp(minT2, maxT2, maxT); in intersect()
|
| D | CubicBezierClip_Test.cpp | 28 double maxT = 1; in CubicBezierClip_Test() local
29 bezier_clip(reduce1, reduce2, minT, maxT); in CubicBezierClip_Test()
|
| D | CurveIntersection.h | 16 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT);
17 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT);
|
| D | QuadraticIntersection.cpp | 66 double minT, maxT; in intersect() local
67 if (!bezier_clip(smaller, larger, minT, maxT)) { in intersect()
68 if (approximately_equal(minT, maxT)) { in intersect()
102 double newMaxT1 = interp(minT1, maxT1, maxT); in intersect()
113 double newMaxT2 = interp(minT2, maxT2, maxT); in intersect()
|
| D | thingsToDo.txt | 458 double maxT = fTs[end].fT - FLT_EPSILON;
513 } while (fTs[start].fT <= maxT);
|
| /external/skia/experimental/Intersection/ |
| D | CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { in bezier_clip() argument
15 maxT = 0; in bezier_clip()
70 maxT = 1; in bezier_clip()
76 x_at(distance2y[0], distance2y[to_0[0]], top, bottom, flags, minT, maxT); in bezier_clip()
78 x_at(distance2y[0], distance2y[to_0[1]], top, bottom, flags, minT, maxT); in bezier_clip()
80 x_at(distance2y[to_3[0]], distance2y[3], top, bottom, flags, minT, maxT); in bezier_clip()
82 x_at(distance2y[to_3[1]], distance2y[3], top, bottom, flags, minT, maxT); in bezier_clip()
85 x_at(distance2y[1], distance2y[2], top, bottom, flags, minT, maxT); in bezier_clip()
88 return minT < maxT; // returns false if distance shows no intersection in bezier_clip()
|
| D | QuadraticBezierClip_Test.cpp | 32 double maxT = 1; in oneAtEndTest() local
33 bezier_clip(quad1, quad2, minT, maxT); in oneAtEndTest()
41 double maxT = 1; in oneOffTest() local
42 bezier_clip(quad1, quad2, minT, maxT); in oneOffTest()
60 double maxT = 1; in standardTestCases() local
61 bezier_clip(reduce1, reduce2, minT, maxT); in standardTestCases()
|
| D | QuadraticBezierClip.cpp | 15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { in bezier_clip() argument
17 maxT = 0; in bezier_clip()
57 maxT = 1; in bezier_clip()
66 x_at(distance2y[idx], distance2y[next], top, bottom, flags, minT, maxT); in bezier_clip()
78 q2[0].x, q2[0].y, q2[1].x, q2[1].y, q2[2].x, q2[2].y, minT, maxT); in bezier_clip()
81 return minT < maxT; // returns false if distance shows no intersection in bezier_clip()
|
| D | CubicConvexHull.cpp | 82 double minT, maxT; in intersect() local
83 if (!bezier_clip(smaller, larger, minT, maxT)) { in intersect()
84 if (minT == maxT) { in intersect()
103 double newMaxT1 = interp(minT1, maxT1, maxT); in intersect()
115 double newMaxT2 = interp(minT2, maxT2, maxT); in intersect()
|
| D | CubicBezierClip_Test.cpp | 28 double maxT = 1; in CubicBezierClip_Test() local
29 bezier_clip(reduce1, reduce2, minT, maxT); in CubicBezierClip_Test()
|
| D | CurveIntersection.h | 16 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT);
17 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT);
|
| D | QuadraticIntersection.cpp | 66 double minT, maxT; in intersect() local
67 if (!bezier_clip(smaller, larger, minT, maxT)) { in intersect()
68 if (approximately_equal(minT, maxT)) { in intersect()
102 double newMaxT1 = interp(minT1, maxT1, maxT); in intersect()
113 double newMaxT2 = interp(minT2, maxT2, maxT); in intersect()
|
| D | thingsToDo.txt | 458 double maxT = fTs[end].fT - FLT_EPSILON;
513 } while (fTs[start].fT <= maxT);
|
| /external/skia/src/utils/ |
| D | SkCubicInterval.cpp | 18 SkScalar maxT = SK_Scalar1; in find_cubic_t() local
22 t = SkScalarAve(minT, maxT); in find_cubic_t()
31 maxT = t; in find_cubic_t()
|
| /external/chromium_org/third_party/skia/src/utils/ |
| D | SkCubicInterval.cpp | 18 SkScalar maxT = SK_Scalar1; in find_cubic_t() local
22 t = SkScalarAve(minT, maxT); in find_cubic_t()
31 maxT = t; in find_cubic_t()
|
| /external/skia/src/core/ |
| D | SkEdgeClipper.cpp | 246 SkScalar maxT = SK_Scalar1; in chopMonoCubicAt() local
251 mid = SkScalarAve(minT, maxT); in chopMonoCubicAt()
257 maxT = mid; in chopMonoCubicAt()
|
| D | SkRegion.cpp | 215 int maxT; in count_runtype_values() local
218 maxT = 2; in count_runtype_values()
221 maxT = fRunHead->getIntervalCount() * 2; in count_runtype_values()
225 return maxT; in count_runtype_values()
|
| D | SkPath.cpp | 2673 SkScalar maxT = SK_Scalar1; in chopMonoCubicAt() local
2677 mid = SkScalarAve(minT, maxT); in chopMonoCubicAt()
2683 maxT = mid; in chopMonoCubicAt()
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkEdgeClipper.cpp | 246 SkScalar maxT = SK_Scalar1; in chopMonoCubicAt() local
251 mid = SkScalarAve(minT, maxT); in chopMonoCubicAt()
257 maxT = mid; in chopMonoCubicAt()
|
| D | SkRegion.cpp | 215 int maxT; in count_runtype_values() local
218 maxT = 2; in count_runtype_values()
221 maxT = fRunHead->getIntervalCount() * 2; in count_runtype_values()
225 return maxT; in count_runtype_values()
|
| D | SkPath.cpp | 2634 SkScalar maxT = SK_Scalar1; in chopMonoCubicAt() local
2638 mid = SkScalarAve(minT, maxT); in chopMonoCubicAt()
2644 maxT = mid; in chopMonoCubicAt()
|