/external/chromium_org/third_party/skia/experimental/Intersection/ |
QuadraticIntersection_TestData.h | 10 extern const Quadratic quadraticLines[]; 11 extern const Quadratic quadraticModEpsilonLines[]; 12 extern const Quadratic quadraticTests[][2];
|
QuadraticLineSegments.h | 10 void hodograph(const Quadratic& , _Line& hodo); 11 void secondHodograph(const Quadratic& , _Point& hodo2); 12 double subDivisions(const Quadratic& );
|
QuadraticUtilities.h | 14 void chop_at(const Quadratic& src, QuadraticPair& dst, double t); 15 double dx_at_t(const Quadratic& , double t); 16 double dy_at_t(const Quadratic& , double t); 17 //void dxdy_at_t(const Quadratic& , double t, _Point& xy); 18 _Vector dxdy_at_t(const Quadratic& , double t); 20 double nearestT(const Quadratic& , const _Point& ); 21 bool point_in_hull(const Quadratic& , const _Point& ); 40 void sub_divide(const Quadratic& src, double t1, double t2, Quadratic& dst); 41 _Point sub_divide(const Quadratic& src, const _Point& a, const _Point& c, double t1, double t2) [all...] |
CurveIntersection.h | 15 double axialIntersect(const Quadratic& q1, const _Point& p, bool vert); 17 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT); 23 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2); 26 void tangent(const Quadratic& quad, double t, _Point& result); 40 int reduceOrder(const Quadratic& quad, Quadratic& reduction, ReduceOrder_Styles ); 48 int horizontalIntersect(const Quadratic& quad, double left, double right, 50 int horizontalIntersect(const Quadratic& quad, double left, double right [all...] |
QuadraticBezierClip_Test.cpp | 11 static const Quadratic testSet[] = { 29 const Quadratic& quad1 = testSet[2]; 30 const Quadratic& quad2 = testSet[3]; 38 const Quadratic& quad1 = testSet[0]; 39 const Quadratic& quad2 = testSet[1]; 47 const Quadratic& quad1 = quadraticTests[index][0]; 48 const Quadratic& quad2 = quadraticTests[index][1]; 49 Quadratic reduce1, reduce2;
|
QuadraticParameterization_Test.cpp | 12 const Quadratic quadratics[] = { 21 // split large quadratic 24 const Quadratic& test = quadratics[index]; 27 Quadratic midThird; 29 const Quadratic* quads[] = {
|
QuadraticReduceOrder_Test.cpp | 12 static const Quadratic testSet[] = { 23 const Quadratic& quad = testSet[index]; 24 Quadratic reduce; 32 Quadratic reduce; 49 const Quadratic& quad = quadraticLines[index]; 56 const Quadratic& quad = quadraticModEpsilonLines[index];
|
CubicLineSegments.h | 10 void hodograph(const Cubic& , Quadratic& hodo);
|
TestUtilities.h | 11 void quad_to_cubic(const Quadratic& , Cubic& );
|
QuadraticReduceOrder.cpp | 19 static int coincident_line(const Quadratic& quad, Quadratic& reduction) { 24 static int vertical_line(const Quadratic& quad, ReduceOrder_Styles reduceStyle, 25 Quadratic& reduction) { 45 static int horizontal_line(const Quadratic& quad, ReduceOrder_Styles reduceStyle, 46 Quadratic& reduction) { 66 static int check_linear(const Quadratic& quad, ReduceOrder_Styles reduceStyle, 67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { 127 bool isLinear(const Quadratic& quad, int startIndex, int endIndex) { 136 // reduce to a quadratic or smalle [all...] |
Parameterization_Test.h | 12 bool point_on_parameterized_curve(const Quadratic& quad, const _Point& point);
|
QuadraticParameterization.h | 5 QuadImplicitForm(const Quadratic& q);
|
/external/skia/experimental/Intersection/ |
QuadraticIntersection_TestData.h | 10 extern const Quadratic quadraticLines[]; 11 extern const Quadratic quadraticModEpsilonLines[]; 12 extern const Quadratic quadraticTests[][2];
|
QuadraticLineSegments.h | 10 void hodograph(const Quadratic& , _Line& hodo); 11 void secondHodograph(const Quadratic& , _Point& hodo2); 12 double subDivisions(const Quadratic& );
|
QuadraticUtilities.h | 14 void chop_at(const Quadratic& src, QuadraticPair& dst, double t); 15 double dx_at_t(const Quadratic& , double t); 16 double dy_at_t(const Quadratic& , double t); 17 //void dxdy_at_t(const Quadratic& , double t, _Point& xy); 18 _Vector dxdy_at_t(const Quadratic& , double t); 20 double nearestT(const Quadratic& , const _Point& ); 21 bool point_in_hull(const Quadratic& , const _Point& ); 40 void sub_divide(const Quadratic& src, double t1, double t2, Quadratic& dst); 41 _Point sub_divide(const Quadratic& src, const _Point& a, const _Point& c, double t1, double t2) [all...] |
CurveIntersection.h | 15 double axialIntersect(const Quadratic& q1, const _Point& p, bool vert); 17 bool bezier_clip(const Quadratic& q1, const Quadratic& q2, double& minT, double& maxT); 23 bool implicit_matches(const Quadratic& quad1, const Quadratic& quad2); 26 void tangent(const Quadratic& quad, double t, _Point& result); 40 int reduceOrder(const Quadratic& quad, Quadratic& reduction, ReduceOrder_Styles ); 48 int horizontalIntersect(const Quadratic& quad, double left, double right, 50 int horizontalIntersect(const Quadratic& quad, double left, double right [all...] |
QuadraticBezierClip_Test.cpp | 11 static const Quadratic testSet[] = { 29 const Quadratic& quad1 = testSet[2]; 30 const Quadratic& quad2 = testSet[3]; 38 const Quadratic& quad1 = testSet[0]; 39 const Quadratic& quad2 = testSet[1]; 47 const Quadratic& quad1 = quadraticTests[index][0]; 48 const Quadratic& quad2 = quadraticTests[index][1]; 49 Quadratic reduce1, reduce2;
|
QuadraticParameterization_Test.cpp | 12 const Quadratic quadratics[] = { 21 // split large quadratic 24 const Quadratic& test = quadratics[index]; 27 Quadratic midThird; 29 const Quadratic* quads[] = {
|
QuadraticReduceOrder_Test.cpp | 12 static const Quadratic testSet[] = { 23 const Quadratic& quad = testSet[index]; 24 Quadratic reduce; 32 Quadratic reduce; 49 const Quadratic& quad = quadraticLines[index]; 56 const Quadratic& quad = quadraticModEpsilonLines[index];
|
CubicLineSegments.h | 10 void hodograph(const Cubic& , Quadratic& hodo);
|
TestUtilities.h | 11 void quad_to_cubic(const Quadratic& , Cubic& );
|
QuadraticReduceOrder.cpp | 19 static int coincident_line(const Quadratic& quad, Quadratic& reduction) { 24 static int vertical_line(const Quadratic& quad, ReduceOrder_Styles reduceStyle, 25 Quadratic& reduction) { 45 static int horizontal_line(const Quadratic& quad, ReduceOrder_Styles reduceStyle, 46 Quadratic& reduction) { 66 static int check_linear(const Quadratic& quad, ReduceOrder_Styles reduceStyle, 67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { 127 bool isLinear(const Quadratic& quad, int startIndex, int endIndex) { 136 // reduce to a quadratic or smalle [all...] |
Parameterization_Test.h | 12 bool point_on_parameterized_curve(const Quadratic& quad, const _Point& point);
|
/external/chromium_org/third_party/skia/src/utils/win/ |
SkDWriteGeometrySink.cpp | 88 } Cubic[4], Quadratic[3]; 90 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { 122 Quadratic quadratic; local 123 if (check_quadratic(cubic, quadratic)) { 124 fPath->quadTo(quadratic[1].x, quadratic[1].y, 125 quadratic[2].x, quadratic[2].y);
|
/external/skia/src/utils/win/ |
SkDWriteGeometrySink.cpp | 88 } Cubic[4], Quadratic[3]; 90 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { 122 Quadratic quadratic; local 123 if (check_quadratic(cubic, quadratic)) { 124 fPath->quadTo(quadratic[1].x, quadratic[1].y, 125 quadratic[2].x, quadratic[2].y);
|