| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | 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,
58 int intersect(const Cubic& cubic, const Quadratic& quad, Intersections& );
61 bool intersect(const Quadratic& q1, const Quadratic& q2, Intersections& );
62 int intersect(const Quadratic& quad, const _Line& line, Intersections& );
[all …]
|
| D | 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);
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);
42 void toCubic(const Quadratic& , Cubic& );
43 _Point top(const Quadratic& , double startT, double endT);
[all …]
|
| D | QuadraticBezierClip_Test.cpp | 11 static const Quadratic testSet[] = {
29 const Quadratic& quad1 = testSet[2]; in oneAtEndTest()
30 const Quadratic& quad2 = testSet[3]; in oneAtEndTest()
38 const Quadratic& quad1 = testSet[0]; in oneOffTest()
39 const Quadratic& quad2 = testSet[1]; in oneOffTest()
47 const Quadratic& quad1 = quadraticTests[index][0]; in standardTestCases()
48 const Quadratic& quad2 = quadraticTests[index][1]; in standardTestCases()
49 Quadratic reduce1, reduce2; in standardTestCases()
|
| D | QuadraticReduceOrder_Test.cpp | 12 static const Quadratic testSet[] = {
23 const Quadratic& quad = testSet[index]; in oneOffTest()
24 Quadratic reduce; in oneOffTest()
32 Quadratic reduce; in standardTestCases()
49 const Quadratic& quad = quadraticLines[index]; in standardTestCases()
56 const Quadratic& quad = quadraticModEpsilonLines[index]; in standardTestCases()
|
| D | QuadraticReduceOrder.cpp | 19 static int coincident_line(const Quadratic& quad, Quadratic& reduction) { in coincident_line()
24 static int vertical_line(const Quadratic& quad, ReduceOrder_Styles reduceStyle, in vertical_line()
25 Quadratic& reduction) { in vertical_line()
45 static int horizontal_line(const Quadratic& quad, ReduceOrder_Styles reduceStyle, in horizontal_line()
46 Quadratic& reduction) { in horizontal_line()
66 static int check_linear(const Quadratic& quad, ReduceOrder_Styles reduceStyle, in check_linear()
67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { in check_linear()
127 bool isLinear(const Quadratic& quad, int startIndex, int endIndex) { in isLinear()
142 int reduceOrder(const Quadratic& quad, Quadratic& reduction, ReduceOrder_Styles reduceStyle) { in reduceOrder()
182 memcpy(reduction, quad, sizeof(Quadratic)); in reduceOrder()
|
| D | QuadraticIntersection_Test.cpp | 20 const Quadratic& quad1 = quadraticTests[index][0]; in standardTestCases()
21 const Quadratic& quad2 = quadraticTests[index][1]; in standardTestCases()
22 Quadratic reduce1, reduce2; in standardTestCases()
56 static const Quadratic testSet[] = {
203 const Quadratic& quad1 = testSet[outer]; in oneOffTest1()
204 const Quadratic& quad2 = testSet[inner]; in oneOffTest1()
249 static const Quadratic coincidentTestSet[] = {
260 const Quadratic& quad1 = coincidentTestSet[testIndex]; in coincidentTest()
261 const Quadratic& quad2 = coincidentTestSet[testIndex + 1]; in coincidentTest()
285 static const Quadratic pointFinderTestSet[] = {
[all …]
|
| D | QuadraticImplicit.cpp | 27 static int findRoots(const QuadImplicitForm& i, const Quadratic& q2, double roots[4], in findRoots()
80 static bool onlyEndPtsInCommon(const Quadratic& q1, const Quadratic& q2, Intersections& i) { in onlyEndPtsInCommon()
126 static bool addIntercept(const Quadratic& q1, const Quadratic& q2, double tMin, double tMax, in addIntercept()
156 static bool isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, in isLinearInner()
158 Quadratic hull; in isLinearInner()
243 static double flatMeasure(const Quadratic& q) { in flatMeasure()
251 static bool isLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) { in isLinear()
261 static void relaxedIsLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) { in relaxedIsLinear()
271 const Quadratic& rounder = m2 < m1 ? q1 : q2; in relaxedIsLinear()
272 const Quadratic& flatter = m2 < m1 ? q2 : q1; in relaxedIsLinear()
[all …]
|
| D | QuadraticParameterization_Test.cpp | 12 const Quadratic quadratics[] = {
24 const Quadratic& test = quadratics[index]; in QuadraticCoincidence_Test()
27 Quadratic midThird; in QuadraticCoincidence_Test()
29 const Quadratic* quads[] = { in QuadraticCoincidence_Test()
|
| D | QuadraticLineSegments.h | 10 void hodograph(const Quadratic& , _Line& hodo);
11 void secondHodograph(const Quadratic& , _Point& hodo2);
12 double subDivisions(const Quadratic& );
|
| D | QuadraticIntersection_TestData.h | 10 extern const Quadratic quadraticLines[];
11 extern const Quadratic quadraticModEpsilonLines[];
12 extern const Quadratic quadraticTests[][2];
|
| D | LineQuadraticIntersection.cpp | 94 LineQuadraticIntersections(const Quadratic& q, const _Line& l, Intersections& i) in LineQuadraticIntersections()
289 const Quadratic& quad;
295 static double horizontalIntersect(const Quadratic& quad, const _Point& pt) { in horizontalIntersect()
310 static double verticalIntersect(const Quadratic& quad, const _Point& pt) { in verticalIntersect()
325 double axialIntersect(const Quadratic& q1, const _Point& p, bool vertical) { in axialIntersect()
332 int horizontalIntersect(const Quadratic& quad, double left, double right, in horizontalIntersect()
349 int horizontalIntersect(const Quadratic& quad, double left, double right, double y, in horizontalIntersect()
355 int verticalIntersect(const Quadratic& quad, double top, double bottom, double x, in verticalIntersect()
361 int intersect(const Quadratic& quad, const _Line& line, Intersections& i) { in intersect()
366 int intersectRay(const Quadratic& quad, const _Line& line, Intersections& i) { in intersectRay()
|
| D | QuadraticUtilities.cpp | 13 double nearestT(const Quadratic& quad, const _Point& pt) { in nearestT()
45 bool point_in_hull(const Quadratic& quad, const _Point& pt) { in point_in_hull()
49 _Point top(const Quadratic& quad, double startT, double endT) { in top()
50 Quadratic sub; in top()
200 void toCubic(const Quadratic& quad, Cubic& cubic) { in toCubic()
217 double dx_at_t(const Quadratic& quad, double t) { in dx_at_t()
221 double dy_at_t(const Quadratic& quad, double t) { in dy_at_t()
225 _Vector dxdy_at_t(const Quadratic& quad, double t) { in dxdy_at_t()
234 void xy_at_t(const Quadratic& quad, double t, double& x, double& y) { in xy_at_t()
247 _Point xy_at_t(const Quadratic& quad, double t) { in xy_at_t()
|
| D | CubicToQuadratics_Test.cpp | 9 SkTDArray<Quadratic> quads; in test()
21 static void test(const Quadratic* quadTests, const char* name, int firstTest, size_t testCount) { in test()
22 SkTDArray<Quadratic> quads; in test()
24 const Quadratic& quad = quadTests[index]; in test()
37 SkTDArray<Quadratic> quads; in testC()
60 SkTDArray<Quadratic> quads; in testC()
166 SkTDArray<Quadratic> quads; in oneOff()
204 SkTDArray<Quadratic> quads; in CubicsToQuadratics_RandTest()
237 SkTDArray<Quadratic> quads; in CubicsToQuadratics_RandTest()
241 const Quadratic& quad = quads[z]; in CubicsToQuadratics_RandTest()
|
| /external/skia/experimental/Intersection/ |
| D | 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,
58 int intersect(const Cubic& cubic, const Quadratic& quad, Intersections& );
61 bool intersect(const Quadratic& q1, const Quadratic& q2, Intersections& );
62 int intersect(const Quadratic& quad, const _Line& line, Intersections& );
[all …]
|
| D | 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);
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);
42 void toCubic(const Quadratic& , Cubic& );
43 _Point top(const Quadratic& , double startT, double endT);
[all …]
|
| D | QuadraticBezierClip_Test.cpp | 11 static const Quadratic testSet[] = {
29 const Quadratic& quad1 = testSet[2]; in oneAtEndTest()
30 const Quadratic& quad2 = testSet[3]; in oneAtEndTest()
38 const Quadratic& quad1 = testSet[0]; in oneOffTest()
39 const Quadratic& quad2 = testSet[1]; in oneOffTest()
47 const Quadratic& quad1 = quadraticTests[index][0]; in standardTestCases()
48 const Quadratic& quad2 = quadraticTests[index][1]; in standardTestCases()
49 Quadratic reduce1, reduce2; in standardTestCases()
|
| D | QuadraticReduceOrder_Test.cpp | 12 static const Quadratic testSet[] = {
23 const Quadratic& quad = testSet[index]; in oneOffTest()
24 Quadratic reduce; in oneOffTest()
32 Quadratic reduce; in standardTestCases()
49 const Quadratic& quad = quadraticLines[index]; in standardTestCases()
56 const Quadratic& quad = quadraticModEpsilonLines[index]; in standardTestCases()
|
| D | QuadraticReduceOrder.cpp | 19 static int coincident_line(const Quadratic& quad, Quadratic& reduction) { in coincident_line()
24 static int vertical_line(const Quadratic& quad, ReduceOrder_Styles reduceStyle, in vertical_line()
25 Quadratic& reduction) { in vertical_line()
45 static int horizontal_line(const Quadratic& quad, ReduceOrder_Styles reduceStyle, in horizontal_line()
46 Quadratic& reduction) { in horizontal_line()
66 static int check_linear(const Quadratic& quad, ReduceOrder_Styles reduceStyle, in check_linear()
67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { in check_linear()
127 bool isLinear(const Quadratic& quad, int startIndex, int endIndex) { in isLinear()
142 int reduceOrder(const Quadratic& quad, Quadratic& reduction, ReduceOrder_Styles reduceStyle) { in reduceOrder()
182 memcpy(reduction, quad, sizeof(Quadratic)); in reduceOrder()
|
| D | QuadraticIntersection_Test.cpp | 20 const Quadratic& quad1 = quadraticTests[index][0]; in standardTestCases()
21 const Quadratic& quad2 = quadraticTests[index][1]; in standardTestCases()
22 Quadratic reduce1, reduce2; in standardTestCases()
56 static const Quadratic testSet[] = {
203 const Quadratic& quad1 = testSet[outer]; in oneOffTest1()
204 const Quadratic& quad2 = testSet[inner]; in oneOffTest1()
249 static const Quadratic coincidentTestSet[] = {
260 const Quadratic& quad1 = coincidentTestSet[testIndex]; in coincidentTest()
261 const Quadratic& quad2 = coincidentTestSet[testIndex + 1]; in coincidentTest()
285 static const Quadratic pointFinderTestSet[] = {
[all …]
|
| D | QuadraticImplicit.cpp | 27 static int findRoots(const QuadImplicitForm& i, const Quadratic& q2, double roots[4], in findRoots()
80 static bool onlyEndPtsInCommon(const Quadratic& q1, const Quadratic& q2, Intersections& i) { in onlyEndPtsInCommon()
126 static bool addIntercept(const Quadratic& q1, const Quadratic& q2, double tMin, double tMax, in addIntercept()
156 static bool isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, in isLinearInner()
158 Quadratic hull; in isLinearInner()
243 static double flatMeasure(const Quadratic& q) { in flatMeasure()
251 static bool isLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) { in isLinear()
261 static void relaxedIsLinear(const Quadratic& q1, const Quadratic& q2, Intersections& i) { in relaxedIsLinear()
271 const Quadratic& rounder = m2 < m1 ? q1 : q2; in relaxedIsLinear()
272 const Quadratic& flatter = m2 < m1 ? q2 : q1; in relaxedIsLinear()
[all …]
|
| D | QuadraticParameterization_Test.cpp | 12 const Quadratic quadratics[] = {
24 const Quadratic& test = quadratics[index]; in QuadraticCoincidence_Test()
27 Quadratic midThird; in QuadraticCoincidence_Test()
29 const Quadratic* quads[] = { in QuadraticCoincidence_Test()
|
| D | QuadraticLineSegments.h | 10 void hodograph(const Quadratic& , _Line& hodo);
11 void secondHodograph(const Quadratic& , _Point& hodo2);
12 double subDivisions(const Quadratic& );
|
| D | QuadraticIntersection_TestData.h | 10 extern const Quadratic quadraticLines[];
11 extern const Quadratic quadraticModEpsilonLines[];
12 extern const Quadratic quadraticTests[][2];
|
| D | LineQuadraticIntersection.cpp | 94 LineQuadraticIntersections(const Quadratic& q, const _Line& l, Intersections& i) in LineQuadraticIntersections()
289 const Quadratic& quad;
295 static double horizontalIntersect(const Quadratic& quad, const _Point& pt) { in horizontalIntersect()
310 static double verticalIntersect(const Quadratic& quad, const _Point& pt) { in verticalIntersect()
325 double axialIntersect(const Quadratic& q1, const _Point& p, bool vertical) { in axialIntersect()
332 int horizontalIntersect(const Quadratic& quad, double left, double right, in horizontalIntersect()
349 int horizontalIntersect(const Quadratic& quad, double left, double right, double y, in horizontalIntersect()
355 int verticalIntersect(const Quadratic& quad, double top, double bottom, double x, in verticalIntersect()
361 int intersect(const Quadratic& quad, const _Line& line, Intersections& i) { in intersect()
366 int intersectRay(const Quadratic& quad, const _Line& line, Intersections& i) { in intersectRay()
|
| D | QuadraticUtilities.cpp | 13 double nearestT(const Quadratic& quad, const _Point& pt) { in nearestT()
45 bool point_in_hull(const Quadratic& quad, const _Point& pt) { in point_in_hull()
49 _Point top(const Quadratic& quad, double startT, double endT) { in top()
50 Quadratic sub; in top()
200 void toCubic(const Quadratic& quad, Cubic& cubic) { in toCubic()
217 double dx_at_t(const Quadratic& quad, double t) { in dx_at_t()
221 double dy_at_t(const Quadratic& quad, double t) { in dy_at_t()
225 _Vector dxdy_at_t(const Quadratic& quad, double t) { in dxdy_at_t()
234 void xy_at_t(const Quadratic& quad, double t, double& x, double& y) { in xy_at_t()
247 _Point xy_at_t(const Quadratic& quad, double t) { in xy_at_t()
|