HomeSort by relevance Sort by last modified time
    Searched full:realroots (Results 1 - 9 of 9) sorted by null

  /external/eigen/unsupported/doc/examples/
PolynomialSolver1.cpp 20 std::vector<double> realRoots;
21 psolve.realRoots( realRoots );
22 Map<Vector5d> mapRR( &realRoots[0] );
  /external/eigen/unsupported/test/
polynomialsolver.cpp 113 //Test realRoots
115 psolve.realRoots( calc_realRoots );
185 EvalRootsType realRoots = EvalRootsType::Random(deg);
186 roots_to_monicPolynomial( realRoots, pols );
189 realRoots.template cast <
194 realRoots );
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsQuad.h 36 static int AddValidTs(double s[], int realRoots, double* t);
SkPathOpsQuad.cpp 69 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) {
71 for (int index = 0; index < realRoots; ++index) {
99 int realRoots = RootsReal(A, B, C, s);
100 int foundRoots = AddValidTs(s, realRoots, t);
SkPathOpsCubic.cpp 118 int realRoots = RootsReal(A, B, C, D, s);
119 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t);
  /external/skia/src/pathops/
SkPathOpsQuad.h 36 static int AddValidTs(double s[], int realRoots, double* t);
SkPathOpsQuad.cpp 69 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) {
71 for (int index = 0; index < realRoots; ++index) {
99 int realRoots = RootsReal(A, B, C, s);
100 int foundRoots = AddValidTs(s, realRoots, t);
SkPathOpsCubic.cpp 118 int realRoots = RootsReal(A, B, C, D, s);
119 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t);
  /external/eigen/unsupported/Eigen/src/Polynomials/
PolynomialSolver.h 69 inline void realRoots( Stl_back_insertion_sequence& bi_seq,

Completed in 57 milliseconds