/external/eigen/unsupported/doc/examples/ |
H A D | PolynomialUtils1.cpp | 9 Vector4d roots = Vector4d::Random(); local 10 cout << "Roots: " << roots.transpose() << endl; 12 roots_to_monicPolynomial( roots, polynomial ); 18 evaluation[i] = poly_eval( polynomial, roots[i] ); } 19 cout << "Evaluation of the polynomial at the roots: " << evaluation.transpose();
|
H A D | PolynomialSolver1.cpp | 12 Vector5d roots = Vector5d::Random(); local 13 cout << "Roots: " << roots.transpose() << endl; 15 roots_to_monicPolynomial( roots, polynomial ); 18 cout << "Complex roots: " << psolve.roots().transpose() << endl; 23 cout << "Real roots: " << mapRR.transpose() << endl; 33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; 35 for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] ) ); } 36 cout << "Norms of the evaluations of the polynomial at the roots [all...] |
/external/skia/src/pathops/ |
H A D | SkConicLineIntersection.cpp | 25 int intersectRay(double roots[2]) { argument
|
H A D | SkPathOpsRect.cpp | 17 int roots = 0; local 19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); 22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); 24 for (int index = 0; index < roots; ++index) { 34 int roots = 0; local 36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues); 39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); 41 for (int index = 0; index < roots; 51 int roots = 0; local [all...] |
H A D | SkPathOpsConic.cpp | 36 int roots = SkDQuad::RootsValidT(coeff[0], coeff[1], coeff[2], tValues); local 37 SkASSERT(0 == roots || 1 == roots); 39 if (1 == roots) {
|
H A D | SkDConicLineIntersection.cpp | 66 int horizontalIntersect(double axisIntercept, double roots[2]) { argument 68 return this->validT(conicVals, axisIntercept, roots); 76 double roots[2]; local 77 int count = this->horizontalIntersect(axisIntercept, roots); 79 double conicT = roots[index]; 102 int roots = this->intersectRay(rootVals); local 103 for (int index = 0; index < roots; ++index) { 119 int intersectRay(double roots[2]) { argument 126 return this->validT(r, 0, roots); 129 int validT(double r[3], double axisIntercept, double roots[ argument 139 verticalIntersect(double axisIntercept, double roots[2]) argument 149 double roots[2]; local 355 HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) argument 360 VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) argument [all...] |
H A D | SkDCubicLineIntersection.cpp | 120 int intersectRay(double roots[3]) { argument 129 int count = SkDCubic::RootsValidT(A, B, C, D, roots); 131 SkDPoint calcPt = c.ptAtT(roots[index]); 139 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); 152 int roots = intersectRay(rootVals); local 153 for (int index = 0; index < roots; ++index) { 165 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { argument 169 int count = SkDCubic::RootsValidT(A, B, C, D, roots); 171 SkDPoint calcPt = c.ptAtT(roots[index]); 175 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); 187 double roots[3]; local 228 VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) argument 250 double roots[3]; local [all...] |
H A D | SkDQuadLineIntersection.cpp | 138 int intersectRay(double roots[2]) { argument 140 solve by rotating line+quad so line is horizontal, then finding the roots 165 return SkDQuad::RootsValidT(A, 2 * B, C, roots); 174 int roots = intersectRay(rootVals); local 175 for (int index = 0; index < roots; ++index) { 187 int horizontalIntersect(double axisIntercept, double roots[2]) { argument 194 return SkDQuad::RootsValidT(D, 2 * E, F, roots); 203 int roots = horizontalIntersect(axisIntercept, rootVals); local 204 for (int index = 0; index < roots; ++index) { 243 int verticalIntersect(double axisIntercept, double roots[ argument 259 int roots = verticalIntersect(axisIntercept, rootVals); local 436 HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots) argument 441 VerticalIntercept(const SkDQuad& quad, SkScalar x, double* roots) argument [all...] |
H A D | SkPathOpsCurve.h | 272 static int line_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { argument 274 roots[0] = SkIntersections::HorizontalIntercept(line.set(a), y); 275 return between(0, roots[0], 1); 278 static int line_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { argument 280 roots[0] = SkIntersections::VerticalIntercept(line.set(a), x); 281 return between(0, roots[0], 1); 284 static int quad_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { argument 286 return SkIntersections::HorizontalIntercept(quad.set(a), y, roots); 289 static int quad_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { argument 291 return SkIntersections::VerticalIntercept(quad.set(a), x, roots); 294 conic_intercept_h(const SkPoint a[2], SkScalar w, SkScalar y, double* roots) argument 299 conic_intercept_v(const SkPoint a[2], SkScalar w, SkScalar x, double* roots) argument 304 cubic_intercept_h(const SkPoint a[3], SkScalar , SkScalar y, double* roots) argument 309 cubic_intercept_v(const SkPoint a[3], SkScalar , SkScalar x, double* roots) argument [all...] |
/external/skia/tests/ |
H A D | PathOpsCubicQuadIntersectionTest.cpp | 73 int roots = i.intersect(cubic, quad); local 74 for (int pt = 0; pt < roots; ++pt) {
|
H A D | PathOpsCubicLineIntersectionTest.cpp | 46 int roots = i.intersect(cubic, line); local 47 REPORTER_ASSERT(reporter, roots == 0); 144 int roots = doIntersect(i, cubic, line); local 145 for (int pt = 0; pt < roots; ++pt) {
|
/external/eigen/unsupported/test/ |
H A D | polynomialutils.cpp | 36 EvalRootsType roots = EvalRootsType::Random(deg); local 37 roots_to_monicPolynomial( roots, pols ); 40 for( int i=0; i<roots.size(); ++i ){ 41 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); } 74 EvalRootsType roots = EvalRootsType::Random(deg); local 75 roots_to_monicPolynomial( roots, pols ); 78 _Scalar Max = roots.array().abs().maxCoeff(); 79 _Scalar min = roots.array().abs().minCoeff(); 83 cerr << "Roots: " << roots << endl;
|
H A D | polynomialsolver.cpp | 42 const RootsType& roots( psolve.roots() ); 44 for( int i=0; i<roots.size(); ++i ){ 45 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); } 52 cerr << "Roots found: " << roots.transpose() << endl; 53 cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl; 57 std::vector<Scalar> rootModuli( roots.size() ); 58 Map< EvalRootsType > aux( &rootModuli[0], roots.size() ); 59 aux = roots.array().abs(); 93 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, cons argument [all...] |
/external/jarjar/src/main/com/tonicsystems/jarjar/ |
H A D | KeepProcessor.java | 31 private final List<String> roots = new ArrayList<String>(); field in class:KeepProcessor 44 closureHelper(closure, roots); 68 roots.add(name);
|
/external/skia/src/core/ |
H A D | SkQuadClipper.cpp | 32 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local 33 int count = SkFindUnitQuadRoots(A, B, C, roots); 35 *t = roots[0];
|
H A D | SkEdgeClipper.cpp | 58 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local 59 int count = SkFindUnitQuadRoots(A, B, C, roots); 61 *t = roots[0];
|
/external/ceres-solver/internal/ceres/ |
H A D | polynomial_test.cc | 78 // Needed because the roots are not returned in sorted order. 85 // Run a test with the polynomial defined by the N real roots in roots_real. 141 const double roots[1] = { 42.42 }; local 142 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); 146 const double roots[1] = { -42.42 }; local 147 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); 151 const double roots[2] = { 1.0, 42.42 }; local 152 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); 156 const double roots[2] = { -42.42, 1.0 }; local 157 RunPolynomialTestRealRoots(roots, tru 161 const double roots[2] = { -42.42, -1.0 }; local 166 const double roots[2] = { 42.42, 42.43 }; local 189 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local 194 const double roots[4] = { 1.23e-1, 2.46e-1, 1.23e+5, 2.46e+5 }; local 199 const double roots[4] = { -42.42, 0.0, 0.0, 42.42 }; local 204 const double roots[4] = { 0.0, 0.0, 0.0, 0.0 }; local 209 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local 214 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local 219 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local [all...] |
/external/eigen/bench/ |
H A D | eig33.cpp | 49 inline void computeRoots(const Matrix& m, Roots& roots) argument 56 // eigenvalues are the roots to this equation, all guaranteed to be 62 // Construct the parameters used in classifying the roots of the equation 63 // and in solving the equation for the roots in closed form. 75 // Compute the eigenvalues by solving for the roots of the polynomial. 80 roots(0) = c2_over_3 + Scalar(2)*rho*cos_theta; 81 roots(1) = c2_over_3 - rho*(cos_theta + s_sqrt3*sin_theta); 82 roots(2) = c2_over_3 - rho*(cos_theta - s_sqrt3*sin_theta); 85 if (roots(0) >= roots( [all...] |
/external/eigen/unsupported/Eigen/src/Polynomials/ |
H A D | PolynomialSolver.h | 20 * - real roots, 21 * - greatest, smallest complex roots, 22 * - real roots with greatest, smallest absolute real value, 23 * - greatest, smallest real roots. 25 * It stores the set of roots as a vector of complexes. 54 /** \returns the complex roots of the polynomial */ 55 inline const RootsType& roots() const { return m_roots; } function in class:Eigen::PolynomialSolverBase 58 /** Clear and fills the back insertion sequence with the real roots of the polynomial 59 * i.e. the real part of the complex roots that have an imaginary part which 307 * Computes the complex roots o [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/ |
H A D | FastFourierTransformer.java | 53 /** roots of unity */ 54 private RootsOfUnity roots = new RootsOfUnity(); field in class:FastFourierTransformer 112 roots.computeOmega(f.length); 170 roots.computeOmega(f.length); 229 roots.computeOmega(-f.length); // pass negative argument 288 roots.computeOmega(-f.length); // pass negative argument 318 roots.computeOmega(isInverse ? -N : N); 322 roots.computeOmega(isInverse ? -2*N : 2*N); 329 //Complex D = roots.getOmega(i).multiply(Complex.I); 330 Complex D = new Complex(-roots [all...] |
/external/blktrace/btt/ |
H A D | devs.c | 45 static void __destroy_heads(struct rb_root *roots) argument 50 __destroy(roots[i].rb_node); 52 free(roots);
|
/external/jmonkeyengine/engine/src/core-plugins/com/jme3/material/plugins/ |
H A D | J3MLoader.java | 425 private void loadFromRoot(List<Statement> roots) throws IOException{ argument 426 if (roots.size() == 2){ 427 Statement exception = roots.get(0); 434 }else if (roots.size() != 1){ 435 throw new IOException("Too many roots in J3M/J3MD file"); 439 Statement materialStat = roots.get(0);
|
/external/speex/libspeex/ |
H A D | lsp.c | 68 The zeros (roots) of P(z) also happen to alternate, which is why we 69 swap coefficients as we find roots. So the process of finding the 70 LSP frequencies is basically finding the roots of 5th order 241 int roots=0; /* DR 8/2/94: number of roots found */ local 355 roots++; 387 return(roots);
|
H A D | sb_celp.c | 307 int i, roots, sub; local 411 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack); 412 if (roots!=st->lpcSize) 414 roots = lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA2, stack); 415 if (roots!=st->lpcSize) {
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.equinox.p2.director.app_1.0.201.R36x_v20100823.jar | ... .eclipse.equinox.p2.query.IQueryResult roots
boolean install
org.eclipse.equinox.internal. ... |