HomeSort by relevance Sort by last modified time
    Searched refs:realRoots (Results 1 - 8 of 8) 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/skia/tests/
PathOpsCubicLineIntersectionIdeas.cpp 162 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots);
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 SkASSERT_RELEASE(realRoots != 1)
    [all...]
  /external/eigen/unsupported/test/
polynomialsolver.cpp 109 //Test realRoots
111 psolve.realRoots( calc_realRoots );
181 EvalRootsType realRoots = EvalRootsType::Random(deg);
182 roots_to_monicPolynomial( realRoots, pols );
185 realRoots.template cast <
190 realRoots );
  /external/skia/src/pathops/
SkPathOpsConic.h 50 static int AddValidTs(double s[], int realRoots, double* t) {
51 return SkDQuad::AddValidTs(s, realRoots, t);
SkPathOpsQuad.cpp 76 int SkDQuad::AddValidTs(double s[], int realRoots, double* t) {
78 for (int index = 0; index < realRoots; ++index) {
106 int realRoots = RootsReal(A, B, C, s);
107 int foundRoots = AddValidTs(s, realRoots, t);
SkPathOpsQuad.h 60 static int AddValidTs(double s[], int realRoots, double* t);
SkPathOpsCubic.cpp 336 int realRoots = RootsReal(A, B, C, D, s);
337 int foundRoots = SkDQuad::AddValidTs(s, realRoots, t);
338 for (int index = 0; index < realRoots; ++index) {
  /external/eigen/unsupported/Eigen/src/Polynomials/
PolynomialSolver.h 69 inline void realRoots( Stl_back_insertion_sequence& bi_seq,

Completed in 181 milliseconds