Home
last modified time | relevance | path

Searched refs:minT (Results 1 – 22 of 22) sorted by relevance

/external/chromium_org/third_party/skia/experimental/Intersection/
DCubicBezierClip.cpp13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { in bezier_clip() argument
14 minT = 1; in bezier_clip()
62 minT = 0; 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()
DQuadraticBezierClip_Test.cpp31 double minT = 0; in oneAtEndTest() local
33 bezier_clip(quad1, quad2, minT, maxT); in oneAtEndTest()
40 double minT = 0; in oneOffTest() local
42 bezier_clip(quad1, quad2, minT, maxT); in oneOffTest()
59 double minT = 0; in standardTestCases() local
61 bezier_clip(reduce1, reduce2, minT, maxT); in standardTestCases()
DQuadraticBezierClip.cpp15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { in bezier_clip() argument
16 minT = 1; in bezier_clip()
49 minT = 0; 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()
DCubicConvexHull.cpp82 double minT, maxT; in intersect() local
83 if (!bezier_clip(smaller, larger, minT, maxT)) { in intersect()
84 if (minT == maxT) { in intersect()
87 minT2 = interp(minT2, maxT2, minT); in intersect()
89 minT1 = interp(minT1, maxT1, minT); in intersect()
102 double newMinT1 = interp(minT1, maxT1, minT); in intersect()
114 double newMinT2 = interp(minT2, maxT2, minT); in intersect()
DCubicBezierClip_Test.cpp27 double minT = 0; in CubicBezierClip_Test() local
29 bezier_clip(reduce1, reduce2, minT, maxT); in CubicBezierClip_Test()
DQuadraticIntersection.cpp66 double minT, maxT; in intersect() local
67 if (!bezier_clip(smaller, larger, minT, maxT)) { in intersect()
68 if (approximately_equal(minT, maxT)) { in intersect()
72 largeT = interp(minT2, maxT2, minT); in intersect()
83 smallT = interp(minT1, maxT1, minT); in intersect()
101 double newMinT1 = interp(minT1, maxT1, minT); in intersect()
112 double newMinT2 = interp(minT2, maxT2, minT); in intersect()
DCurveIntersection.h16 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);
DthingsToDo.txt346 int minT = SkMin32(nextAngle->start(), nextAngle->end());
349 nextSegment->markDone(minT, winding);
/external/skia/experimental/Intersection/
DCubicBezierClip.cpp13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { in bezier_clip() argument
14 minT = 1; in bezier_clip()
62 minT = 0; 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()
DQuadraticBezierClip_Test.cpp31 double minT = 0; in oneAtEndTest() local
33 bezier_clip(quad1, quad2, minT, maxT); in oneAtEndTest()
40 double minT = 0; in oneOffTest() local
42 bezier_clip(quad1, quad2, minT, maxT); in oneOffTest()
59 double minT = 0; in standardTestCases() local
61 bezier_clip(reduce1, reduce2, minT, maxT); in standardTestCases()
DQuadraticBezierClip.cpp15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { in bezier_clip() argument
16 minT = 1; in bezier_clip()
49 minT = 0; 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()
DCubicConvexHull.cpp82 double minT, maxT; in intersect() local
83 if (!bezier_clip(smaller, larger, minT, maxT)) { in intersect()
84 if (minT == maxT) { in intersect()
87 minT2 = interp(minT2, maxT2, minT); in intersect()
89 minT1 = interp(minT1, maxT1, minT); in intersect()
102 double newMinT1 = interp(minT1, maxT1, minT); in intersect()
114 double newMinT2 = interp(minT2, maxT2, minT); in intersect()
DCubicBezierClip_Test.cpp27 double minT = 0; in CubicBezierClip_Test() local
29 bezier_clip(reduce1, reduce2, minT, maxT); in CubicBezierClip_Test()
DQuadraticIntersection.cpp66 double minT, maxT; in intersect() local
67 if (!bezier_clip(smaller, larger, minT, maxT)) { in intersect()
68 if (approximately_equal(minT, maxT)) { in intersect()
72 largeT = interp(minT2, maxT2, minT); in intersect()
83 smallT = interp(minT1, maxT1, minT); in intersect()
101 double newMinT1 = interp(minT1, maxT1, minT); in intersect()
112 double newMinT2 = interp(minT2, maxT2, minT); in intersect()
DCurveIntersection.h16 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);
DthingsToDo.txt346 int minT = SkMin32(nextAngle->start(), nextAngle->end());
349 nextSegment->markDone(minT, winding);
/external/skia/src/utils/
DSkCubicInterval.cpp17 SkScalar minT = 0; in find_cubic_t() local
22 t = SkScalarAve(minT, maxT); in find_cubic_t()
29 minT = t; in find_cubic_t()
/external/chromium_org/third_party/skia/src/utils/
DSkCubicInterval.cpp17 SkScalar minT = 0; in find_cubic_t() local
22 t = SkScalarAve(minT, maxT); in find_cubic_t()
29 minT = t; in find_cubic_t()
/external/skia/src/core/
DSkEdgeClipper.cpp245 SkScalar minT = 0; in chopMonoCubicAt() local
251 mid = SkScalarAve(minT, maxT); in chopMonoCubicAt()
254 minT = mid; in chopMonoCubicAt()
DSkPath.cpp2672 SkScalar minT = 0; in chopMonoCubicAt() local
2677 mid = SkScalarAve(minT, maxT); in chopMonoCubicAt()
2680 minT = mid; in chopMonoCubicAt()
/external/chromium_org/third_party/skia/src/core/
DSkEdgeClipper.cpp245 SkScalar minT = 0; in chopMonoCubicAt() local
251 mid = SkScalarAve(minT, maxT); in chopMonoCubicAt()
254 minT = mid; in chopMonoCubicAt()
DSkPath.cpp2633 SkScalar minT = 0; in chopMonoCubicAt() local
2638 mid = SkScalarAve(minT, maxT); in chopMonoCubicAt()
2641 minT = mid; in chopMonoCubicAt()