Searched defs:realRoots (Results 1 - 7 of 7) sorted by relevance

/external/eigen/unsupported/doc/examples/
H A DPolynomialSolver1.cpp20 std::vector<double> realRoots; local
21 psolve.realRoots( realRoots );
22 Map<Vector5d> mapRR( &realRoots[0] );
/external/eigen/unsupported/Eigen/src/Polynomials/
H A DPolynomialSolver.h69 inline void realRoots( Stl_back_insertion_sequence& bi_seq, function in class:Eigen::PolynomialSolverBase
/external/eigen/unsupported/test/
H A Dpolynomialsolver.cpp113 //Test realRoots
115 psolve.realRoots( calc_realRoots );
185 EvalRootsType realRoots = EvalRootsType::Random(deg); local
186 roots_to_monicPolynomial( realRoots, pols );
189 realRoots.template cast <
194 realRoots );
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsQuad.cpp69 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 DSkPathOpsCubic.cpp118 int realRoots = RootsReal(A, B, C, D, s); local
119 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t);
/external/skia/src/pathops/
H A DSkPathOpsQuad.cpp69 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 DSkPathOpsCubic.cpp118 int realRoots = RootsReal(A, B, C, D, s); local
119 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t);

Completed in 124 milliseconds