/external/chromium_org/third_party/skia/experimental/Intersection/ |
QuadraticBezierClip_Test.cpp | 32 double maxT = 1; 33 bezier_clip(quad1, quad2, minT, maxT); 41 double maxT = 1; 42 bezier_clip(quad1, quad2, minT, maxT); 60 double maxT = 1; 61 bezier_clip(reduce1, reduce2, minT, maxT);
|
CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { 15 maxT = 0; 70 maxT = 1; 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
|
QuadraticBezierClip.cpp | 15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { 17 maxT = 0; 57 maxT = 1; 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
|
CubicBezierClip_Test.cpp | 28 double maxT = 1; 29 bezier_clip(reduce1, reduce2, minT, maxT);
|
CubicConvexHull.cpp | 82 double minT, maxT; 83 if (!bezier_clip(smaller, larger, minT, maxT)) { 84 if (minT == maxT) { 103 double newMaxT1 = interp(minT1, maxT1, maxT); 115 double newMaxT2 = interp(minT2, maxT2, maxT);
|
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);
|
QuadraticIntersection.cpp | 66 double minT, maxT; 67 if (!bezier_clip(smaller, larger, minT, maxT)) { 68 if (approximately_equal(minT, maxT)) { 102 double newMaxT1 = interp(minT1, maxT1, maxT); 113 double newMaxT2 = interp(minT2, maxT2, maxT);
|
thingsToDo.txt | 458 double maxT = fTs[end].fT - FLT_EPSILON; 513 } while (fTs[start].fT <= maxT);
|
/external/skia/experimental/Intersection/ |
QuadraticBezierClip_Test.cpp | 32 double maxT = 1; 33 bezier_clip(quad1, quad2, minT, maxT); 41 double maxT = 1; 42 bezier_clip(quad1, quad2, minT, maxT); 60 double maxT = 1; 61 bezier_clip(reduce1, reduce2, minT, maxT);
|
CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { 15 maxT = 0; 70 maxT = 1; 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
|
QuadraticBezierClip.cpp | 15 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT) { 17 maxT = 0; 57 maxT = 1; 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
|
CubicBezierClip_Test.cpp | 28 double maxT = 1; 29 bezier_clip(reduce1, reduce2, minT, maxT);
|
CubicConvexHull.cpp | 82 double minT, maxT; 83 if (!bezier_clip(smaller, larger, minT, maxT)) { 84 if (minT == maxT) { 103 double newMaxT1 = interp(minT1, maxT1, maxT); 115 double newMaxT2 = interp(minT2, maxT2, maxT);
|
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);
|
QuadraticIntersection.cpp | 66 double minT, maxT; 67 if (!bezier_clip(smaller, larger, minT, maxT)) { 68 if (approximately_equal(minT, maxT)) { 102 double newMaxT1 = interp(minT1, maxT1, maxT); 113 double newMaxT2 = interp(minT2, maxT2, maxT);
|
thingsToDo.txt | 458 double maxT = fTs[end].fT - FLT_EPSILON; 513 } while (fTs[start].fT <= maxT);
|
/external/chromium_org/third_party/skia/src/utils/ |
SkCubicInterval.cpp | 18 SkScalar maxT = SK_Scalar1; 22 t = SkScalarAve(minT, maxT); 31 maxT = t;
|
/external/skia/src/utils/ |
SkCubicInterval.cpp | 18 SkScalar maxT = SK_Scalar1; 22 t = SkScalarAve(minT, maxT); 31 maxT = t;
|
/external/chromium_org/third_party/skia/src/core/ |
SkEdgeClipper.cpp | 246 SkScalar maxT = SK_Scalar1; 251 mid = SkScalarAve(minT, maxT); 257 maxT = mid;
|
SkRegion.cpp | 215 int maxT; 218 maxT = 2; 221 maxT = fRunHead->getIntervalCount() * 2; 225 return maxT; [all...] |
SkPath.cpp | [all...] |
/external/skia/src/core/ |
SkEdgeClipper.cpp | 246 SkScalar maxT = SK_Scalar1; 251 mid = SkScalarAve(minT, maxT); 257 maxT = mid;
|
SkRegion.cpp | 215 int maxT; 218 maxT = 2; 221 maxT = fRunHead->getIntervalCount() * 2; 225 return maxT; [all...] |
SkPath.cpp | [all...] |