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