| /external/skia/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 164 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in DEF_TEST() local
165 int valid = SkDQuad::AddValidTs(allRoots, realRoots, validRoots); in DEF_TEST()
169 if (realRoots == 1) { in DEF_TEST()
185 if (realRoots == 3) { in DEF_TEST()
192 realRoots, allRoots[0], allRoots[1], allRoots[2], valid, validRoots[0], in DEF_TEST()
196 if (realRoots == 3) { in DEF_TEST()
261 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in testOneFailure() local
262 int valid = SkDQuad::AddValidTs(allRoots, realRoots, validRoots); in testOneFailure()
264 SkASSERT_RELEASE(realRoots != 1); in testOneFailure()
|
| /external/skqp/tests/ |
| D | PathOpsCubicLineIntersectionIdeas.cpp | 164 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in DEF_TEST() local
165 int valid = SkDQuad::AddValidTs(allRoots, realRoots, validRoots); in DEF_TEST()
169 if (realRoots == 1) { in DEF_TEST()
185 if (realRoots == 3) { in DEF_TEST()
192 realRoots, allRoots[0], allRoots[1], allRoots[2], valid, validRoots[0], in DEF_TEST()
196 if (realRoots == 3) { in DEF_TEST()
261 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in testOneFailure() local
262 int valid = SkDQuad::AddValidTs(allRoots, realRoots, validRoots); in testOneFailure()
264 SkASSERT_RELEASE(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 | 115 psolve.realRoots( calc_realRoots ); in evalSolverSugarFunction()
185 EvalRootsType realRoots = EvalRootsType::Random(deg); in polynomialsolver() local
186 roots_to_monicPolynomial( realRoots, pols ); in polynomialsolver()
189 realRoots.template cast < in polynomialsolver()
194 realRoots ); in polynomialsolver()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsQuad.cpp | 110 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) { in AddValidTs() argument
112 for (int index = 0; index < realRoots; ++index) { in AddValidTs()
140 int realRoots = RootsReal(A, B, C, s); in RootsValidT() local
141 int foundRoots = AddValidTs(s, realRoots, t); in RootsValidT()
|
| D | SkPathOpsConic.h | 58 static int AddValidTs(double s[], int realRoots, double* t) { in AddValidTs()
59 return SkDQuad::AddValidTs(s, realRoots, t); in AddValidTs()
|
| D | SkPathOpsCubic.cpp | 372 int realRoots = RootsReal(A, B, C, D, s); in RootsValidT() local
373 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t); in RootsValidT()
374 for (int index = 0; index < realRoots; ++index) { in RootsValidT()
|
| D | SkPathOpsQuad.h | 65 static int AddValidTs(double s[], int realRoots, double* t);
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsQuad.cpp | 110 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) { in AddValidTs() argument
112 for (int index = 0; index < realRoots; ++index) { in AddValidTs()
140 int realRoots = RootsReal(A, B, C, s); in RootsValidT() local
141 int foundRoots = AddValidTs(s, realRoots, t); in RootsValidT()
|
| D | SkPathOpsConic.h | 58 static int AddValidTs(double s[], int realRoots, double* t) { in AddValidTs()
59 return SkDQuad::AddValidTs(s, realRoots, t); in AddValidTs()
|
| D | SkPathOpsCubic.cpp | 372 int realRoots = RootsReal(A, B, C, D, s); in RootsValidT() local
373 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t); in RootsValidT()
374 for (int index = 0; index < realRoots; ++index) { in RootsValidT()
|
| D | SkPathOpsQuad.h | 65 static int AddValidTs(double s[], int realRoots, double* t);
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| D | PolynomialSolver.h | 69 inline void realRoots( Stl_back_insertion_sequence& bi_seq,
|