| /external/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 162 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in DEF_TEST() local
163 int valid = SkDQuad::AddValidTs(allRoots, realRoots, validRoots); in DEF_TEST()
167 if (realRoots == 1) { in DEF_TEST()
183 if (realRoots == 3) { in DEF_TEST()
190 realRoots, allRoots[0], allRoots[1], allRoots[2], valid, validRoots[0], in DEF_TEST()
194 if (realRoots == 3) { in DEF_TEST()
257 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in testOneFailure() local
258 int valid = SkDQuad::AddValidTs(allRoots, realRoots, validRoots); in testOneFailure()
260 SK_ALWAYSBREAK(realRoots != 1); in testOneFailure()
|
| /external/chromium_org/third_party/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 162 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in DEF_TEST() local
163 int valid = SkDQuad::AddValidTs(allRoots, realRoots, validRoots); in DEF_TEST()
167 if (realRoots == 1) { in DEF_TEST()
183 if (realRoots == 3) { in DEF_TEST()
190 realRoots, allRoots[0], allRoots[1], allRoots[2], valid, validRoots[0], in DEF_TEST()
194 if (realRoots == 3) { in DEF_TEST()
257 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in testOneFailure() local
258 int valid = SkDQuad::AddValidTs(allRoots, realRoots, validRoots); in testOneFailure()
260 SK_ALWAYSBREAK(realRoots != 1); in testOneFailure()
|
| /external/eigen/unsupported/doc/examples/ |
| D | PolynomialSolver1.cpp | 20 std::vector<double> realRoots; in main() local
21 psolve.realRoots( realRoots ); in main()
22 Map<Vector5d> mapRR( &realRoots[0] ); in main()
|
| /external/eigen/unsupported/test/ |
| D | polynomialsolver.cpp | 113 psolve.realRoots( calc_realRoots ); in evalSolverSugarFunction()
183 EvalRootsType realRoots = EvalRootsType::Random(deg); in polynomialsolver() local
184 roots_to_monicPolynomial( realRoots, pols ); in polynomialsolver()
187 realRoots.template cast < in polynomialsolver()
192 realRoots ); in polynomialsolver()
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | QuadraticUtilities.cpp | 77 int add_valid_ts(double s[], int realRoots, double* t) { in add_valid_ts() argument
79 for (int index = 0; index < realRoots; ++index) { in add_valid_ts()
144 int realRoots = quadraticRootsReal(A, B, C, s); in quadraticRootsValidT() local
145 int foundRoots = add_valid_ts(s, realRoots, t); in quadraticRootsValidT()
|
| D | QuadraticUtilities.h | 13 int add_valid_ts(double s[], int realRoots, double* t);
|
| D | CubicUtilities.cpp | 162 int realRoots = cubicRootsReal(A, B, C, D, s); in cubicRootsValidT() local
163 int foundRoots = add_valid_ts(s, realRoots, t); in cubicRootsValidT()
|
| /external/skia/experimental/Intersection/ |
| D | QuadraticUtilities.cpp | 77 int add_valid_ts(double s[], int realRoots, double* t) { in add_valid_ts() argument
79 for (int index = 0; index < realRoots; ++index) { in add_valid_ts()
144 int realRoots = quadraticRootsReal(A, B, C, s); in quadraticRootsValidT() local
145 int foundRoots = add_valid_ts(s, realRoots, t); in quadraticRootsValidT()
|
| D | QuadraticUtilities.h | 13 int add_valid_ts(double s[], int realRoots, double* t);
|
| D | CubicUtilities.cpp | 162 int realRoots = cubicRootsReal(A, B, C, D, s); in cubicRootsValidT() local
163 int foundRoots = add_valid_ts(s, realRoots, t); in cubicRootsValidT()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsQuad.cpp | 69 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) { in AddValidTs() argument
71 for (int index = 0; index < realRoots; ++index) { in AddValidTs()
99 int realRoots = RootsReal(A, B, C, s); in RootsValidT() local
100 int foundRoots = AddValidTs(s, realRoots, t); in RootsValidT()
|
| D | SkPathOpsQuad.h | 36 static int AddValidTs(double s[], int realRoots, double* t);
|
| D | SkPathOpsCubic.cpp | 193 int realRoots = RootsReal(A, B, C, D, s); in RootsValidT() local
194 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t); in RootsValidT()
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkPathOpsQuad.cpp | 69 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) { in AddValidTs() argument
71 for (int index = 0; index < realRoots; ++index) { in AddValidTs()
99 int realRoots = RootsReal(A, B, C, s); in RootsValidT() local
100 int foundRoots = AddValidTs(s, realRoots, t); in RootsValidT()
|
| D | SkPathOpsQuad.h | 36 static int AddValidTs(double s[], int realRoots, double* t);
|
| D | SkPathOpsCubic.cpp | 193 int realRoots = RootsReal(A, B, C, D, s); in RootsValidT() local
194 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t); in RootsValidT()
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| D | PolynomialSolver.h | 69 inline void realRoots( Stl_back_insertion_sequence& bi_seq,
|