Searched defs:roots (Results 1 - 25 of 77) sorted by relevance

1234

/external/eigen/unsupported/doc/examples/
H A DPolynomialUtils1.cpp9 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 DPolynomialSolver1.cpp12 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 DSkPathOpsRect.cpp17 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 DSkPathOpsConic.cpp36 int roots = SkDQuad::RootsValidT(coeff[0], coeff[1], coeff[2], tValues); local
37 // In extreme cases, the number of roots returned can be 2. Pathops
40 // SkASSERT(0 == roots || 1 == roots);
42 if (1 == roots) {
H A DSkDConicLineIntersection.cpp67 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
69 return this->validT(conicVals, axisIntercept, roots);
77 double roots[2]; local
78 int count = this->horizontalIntersect(axisIntercept, roots);
80 double conicT = roots[index];
103 int roots = this->intersectRay(rootVals); local
104 for (int index = 0; index < roots; ++index) {
125 int intersectRay(double roots[2]) { argument
132 return this->validT(r, 0, roots);
135 int validT(double r[3], double axisIntercept, double roots[ argument
145 verticalIntersect(double axisIntercept, double roots[2]) argument
155 double roots[2]; local
376 HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) argument
381 VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) argument
[all...]
H A DSkDCubicLineIntersection.cpp121 int intersectRay(double roots[3]) { argument
131 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
133 SkDPoint calcPt = c.ptAtT(roots[index]);
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);
154 int roots = intersectRay(rootVals); local
155 for (int index = 0; index < roots; ++index) {
167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { argument
171 int count = SkDCubic::RootsValidT(A, B, C, D, roots);
173 SkDPoint calcPt = c.ptAtT(roots[index]);
177 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);
189 double roots[3]; local
230 VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) argument
252 double roots[3]; local
[all...]
H A DSkDQuadLineIntersection.cpp139 int intersectRay(double roots[2]) { argument
141 solve by rotating line+quad so line is horizontal, then finding the roots
166 return SkDQuad::RootsValidT(A, 2 * B, C, roots);
175 int roots = intersectRay(rootVals); local
176 for (int index = 0; index < roots; ++index) {
188 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
195 return SkDQuad::RootsValidT(D, 2 * E, F, roots);
204 int roots = horizontalIntersect(axisIntercept, rootVals); local
205 for (int index = 0; index < roots; ++index) {
244 int verticalIntersect(double axisIntercept, double roots[ argument
260 int roots = verticalIntersect(axisIntercept, rootVals); local
452 HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots) argument
457 VerticalIntercept(const SkDQuad& quad, SkScalar x, double* roots) argument
[all...]
/external/eigen/unsupported/test/
H A Dpolynomialutils.cpp36 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 Dpolynomialsolver.cpp45 const RootsType& roots( psolve.roots() );
47 for( int i=0; i<roots.size(); ++i ){
48 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); }
55 cerr << "Roots found: " << roots.transpose() << endl;
56 cerr << "Abs value of the polynomial at the roots: " << evr.transpose() << endl;
60 std::vector<Scalar> rootModuli( roots.size() );
61 Map< EvalRootsType > aux( &rootModuli[0], roots.size() );
62 aux = roots.array().abs();
96 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, cons argument
[all...]
/external/jarjar/src/main/com/tonicsystems/jarjar/
H A DKeepProcessor.java31 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 DSkQuadClipper.cpp32 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 DSkEdgeClipper.cpp75 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
76 int count = SkFindUnitQuadRoots(A, B, C, roots);
78 *t = roots[0];
/external/skia/tests/
H A DPathOpsConicQuadIntersectionTest.cpp49 int roots = i.intersect(conic, quad); local
50 for (int pt = 0; pt < roots; ++pt) {
H A DPathOpsCubicConicIntersectionTest.cpp53 int roots = i.intersect(cubic, conic); local
54 for (int pt = 0; pt < roots; ++pt) {
H A DPathOpsCubicQuadIntersectionTest.cpp77 int roots = i.intersect(cubic, quad); local
78 for (int pt = 0; pt < roots; ++pt) {
H A DPathOpsCubicLineIntersectionTest.cpp48 int roots = i.intersect(cubic, line); local
49 REPORTER_ASSERT(reporter, roots == 0);
148 int roots = doIntersect(i, cubic, line); local
149 for (int pt = 0; pt < roots; ++pt) {
/external/eigen/bench/
H A Deig33.cpp49 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(2) = c2_over_3 + Scalar(2)*rho*cos_theta;
81 roots(0) = c2_over_3 - rho*(cos_theta + s_sqrt3*sin_theta);
82 roots(1) = c2_over_3 - rho*(cos_theta - s_sqrt3*sin_theta);
/external/eigen/unsupported/Eigen/src/Polynomials/
H A DPolynomialSolver.h20 * - 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 DFastFourierTransformer.java53 /** 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 Ddevs.c45 static void __destroy_heads(struct rb_root *roots) argument
50 __destroy(roots[i].rb_node);
52 free(roots);
/external/v8/tools/clang/blink_gc_plugin/
H A Dprocess-graph.py18 help='Detect cycles containing GC roots')
51 roots = [] variable
228 roots.append(edge)
256 for root_edge in roots:
318 global roots
322 roots = dump[1]
326 dump = (graph, roots)
454 log("Detecting cycles containg GC roots")
/external/boringssl/src/crypto/x509/
H A Dx509_test.cc453 static int Verify(X509 *leaf, const std::vector<X509 *> &roots, argument
458 bssl::UniquePtr<STACK_OF(X509)> roots_stack(CertsToStack(roots));
509 static int Verify(X509 *leaf, const std::vector<X509 *> &roots, argument
513 const int r1 = Verify(leaf, roots, intermediates, crls, flags, false);
514 const int r2 = Verify(leaf, roots, intermediates, crls, flags, true);
554 fprintf(stderr, "Leaf verified with no roots!\n");
560 fprintf(stderr, "Leaf verified with no roots!\n");
613 * of roots and intermediates. This is a regression test for CVE-2015-1793. */
/external/speex/libspeex/
H A Dlsp.c68 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 Dsb_celp.c307 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 Dorg.eclipse.equinox.p2.director.app_1.0.201.R36x_v20100823.jar ... .eclipse.equinox.p2.query.IQueryResult roots boolean install org.eclipse.equinox.internal.

Completed in 546 milliseconds

1234