/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticBezierClip_Test.cpp | 31 double minT = 0; local 33 bezier_clip(quad1, quad2, minT, maxT); 40 double minT = 0; local 42 bezier_clip(quad1, quad2, minT, maxT); 59 double minT = 0; local 61 bezier_clip(reduce1, reduce2, minT, maxT);
|
H A D | CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { argument 14 minT = 1; 62 minT = 0; 76 x_at(distance2y[0], distance2y[to_0[0]], top, bottom, flags, minT, maxT); 78 x_at(distance2y[0], distance2y[to_0[1]], top, bottom, flags, minT, maxT); 80 x_at(distance2y[to_3[0]], distance2y[3], top, bottom, flags, minT, maxT); 82 x_at(distance2y[to_3[1]], distance2y[3], top, bottom, flags, minT, maxT); 85 x_at(distance2y[1], distance2y[2], top, bottom, flags, minT, maxT); 88 return minT < maxT; // returns false if distance shows no intersection
|
H A D | QuadraticBezierClip.cpp | 15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { argument 16 minT = 1; 49 minT = 0; 66 x_at(distance2y[idx], distance2y[next], top, bottom, flags, minT, maxT); 76 " q2=(%1.9g,%1.9g %1.9g,%1.9g %1.9g,%1.9g) minT=%1.9g maxT=%1.9g\n", 78 q2[0].x, q2[0].y, q2[1].x, q2[1].y, q2[2].x, q2[2].y, minT, maxT); 81 return minT < maxT; // returns false if distance shows no intersection
|
H A D | CubicBezierClip_Test.cpp | 27 double minT = 0; local 29 bezier_clip(reduce1, reduce2, minT, maxT);
|
H A D | CubicConvexHull.cpp | 82 double minT, maxT; local 83 if (!bezier_clip(smaller, larger, minT, maxT)) { 84 if (minT == maxT) { 87 minT2 = interp(minT2, maxT2, minT); 89 minT1 = interp(minT1, maxT1, minT); 102 double newMinT1 = interp(minT1, maxT1, minT); 114 double newMinT2 = interp(minT2, maxT2, minT);
|
H A 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);
|
H A D | QuadraticIntersection.cpp | 66 double minT, maxT; local 67 if (!bezier_clip(smaller, larger, minT, maxT)) { 68 if (approximately_equal(minT, maxT)) { 72 largeT = interp(minT2, maxT2, minT); 83 smallT = interp(minT1, maxT1, minT); 101 double newMinT1 = interp(minT1, maxT1, minT); 112 double newMinT2 = interp(minT2, maxT2, minT);
|
H A D | thingsToDo.txt | 346 int minT = SkMin32(nextAngle->start(), nextAngle->end()); 349 nextSegment->markDone(minT, winding);
|
/external/skia/experimental/Intersection/ |
H A D | QuadraticBezierClip_Test.cpp | 31 double minT = 0; local 33 bezier_clip(quad1, quad2, minT, maxT); 40 double minT = 0; local 42 bezier_clip(quad1, quad2, minT, maxT); 59 double minT = 0; local 61 bezier_clip(reduce1, reduce2, minT, maxT);
|
H A D | CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { argument 14 minT = 1; 62 minT = 0; 76 x_at(distance2y[0], distance2y[to_0[0]], top, bottom, flags, minT, maxT); 78 x_at(distance2y[0], distance2y[to_0[1]], top, bottom, flags, minT, maxT); 80 x_at(distance2y[to_3[0]], distance2y[3], top, bottom, flags, minT, maxT); 82 x_at(distance2y[to_3[1]], distance2y[3], top, bottom, flags, minT, maxT); 85 x_at(distance2y[1], distance2y[2], top, bottom, flags, minT, maxT); 88 return minT < maxT; // returns false if distance shows no intersection
|
H A D | QuadraticBezierClip.cpp | 15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { argument 16 minT = 1; 49 minT = 0; 66 x_at(distance2y[idx], distance2y[next], top, bottom, flags, minT, maxT); 76 " q2=(%1.9g,%1.9g %1.9g,%1.9g %1.9g,%1.9g) minT=%1.9g maxT=%1.9g\n", 78 q2[0].x, q2[0].y, q2[1].x, q2[1].y, q2[2].x, q2[2].y, minT, maxT); 81 return minT < maxT; // returns false if distance shows no intersection
|
H A D | CubicBezierClip_Test.cpp | 27 double minT = 0; local 29 bezier_clip(reduce1, reduce2, minT, maxT);
|
H A D | CubicConvexHull.cpp | 82 double minT, maxT; local 83 if (!bezier_clip(smaller, larger, minT, maxT)) { 84 if (minT == maxT) { 87 minT2 = interp(minT2, maxT2, minT); 89 minT1 = interp(minT1, maxT1, minT); 102 double newMinT1 = interp(minT1, maxT1, minT); 114 double newMinT2 = interp(minT2, maxT2, minT);
|
H A 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);
|
H A D | QuadraticIntersection.cpp | 66 double minT, maxT; local 67 if (!bezier_clip(smaller, larger, minT, maxT)) { 68 if (approximately_equal(minT, maxT)) { 72 largeT = interp(minT2, maxT2, minT); 83 smallT = interp(minT1, maxT1, minT); 101 double newMinT1 = interp(minT1, maxT1, minT); 112 double newMinT2 = interp(minT2, maxT2, minT);
|
H A D | thingsToDo.txt | 346 int minT = SkMin32(nextAngle->start(), nextAngle->end()); 349 nextSegment->markDone(minT, winding);
|
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkCubicInterval.cpp | 17 SkScalar minT = 0; local 22 t = SkScalarAve(minT, maxT); 29 minT = t;
|
/external/skia/src/utils/ |
H A D | SkCubicInterval.cpp | 17 SkScalar minT = 0; local 22 t = SkScalarAve(minT, maxT); 29 minT = t;
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkEdgeClipper.cpp | 245 SkScalar minT = 0; 251 mid = SkScalarAve(minT, maxT); 254 minT = mid;
|
H A D | SkPath.cpp | 2633 SkScalar minT = 0; 2638 mid = SkScalarAve(minT, maxT); 2641 minT = mid;
|
/external/skia/src/core/ |
H A D | SkEdgeClipper.cpp | 245 SkScalar minT = 0; 251 mid = SkScalarAve(minT, maxT); 254 minT = mid;
|
H A D | SkPath.cpp | 2672 SkScalar minT = 0; 2677 mid = SkScalarAve(minT, maxT); 2680 minT = mid;
|