Searched refs:roots (Results 1 - 25 of 102) sorted by relevance

12345

/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 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 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 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...]
H A DSkPathOpsCurve.h360 static int line_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { argument
362 roots[0] = SkIntersections::HorizontalIntercept(line.set(a), y);
363 return between(0, roots[0], 1);
366 static int line_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { argument
368 roots[0] = SkIntersections::VerticalIntercept(line.set(a), x);
369 return between(0, roots[0], 1);
372 static int quad_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { argument
374 return SkIntersections::HorizontalIntercept(quad.set(a), y, roots);
377 static int quad_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { argument
379 return SkIntersections::VerticalIntercept(quad.set(a), x, roots);
382 conic_intercept_h(const SkPoint a[2], SkScalar w, SkScalar y, double* roots) argument
387 conic_intercept_v(const SkPoint a[2], SkScalar w, SkScalar x, double* roots) argument
392 cubic_intercept_h(const SkPoint a[3], SkScalar , SkScalar y, double* roots) argument
397 cubic_intercept_v(const SkPoint a[3], SkScalar , SkScalar x, double* roots) argument
[all...]
H A DSkPathOpsQuad.h75 * Return the number of valid roots (0 < root < 1) for this cubic intersecting the
78 int horizontalIntersect(double yIntercept, double roots[2]) const;
106 * Return the number of valid roots (0 < root < 1) for this cubic intersecting the
109 int verticalIntersect(double xIntercept, double roots[2]) const;
/external/smali/util/src/test/java/org/jf/util/
H A DPathUtilTest.java39 File[] roots = File.listRoots();
41 if (roots.length > 1) {
42 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
43 File relativePath = new File(roots[1] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
53 File[] roots = File.listRoots();
55 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
56 File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "test.txt");
68 File[] roots = File.listRoots();
70 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar);
71 File relativePath = new File(roots[
[all...]
/external/eigen/unsupported/doc/examples/
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...]
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();
/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/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 DSkGeometry.cpp65 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { argument
66 SkASSERT(roots);
69 return valid_unit_divide(-C, B, roots);
72 SkScalar* r = roots;
75 if (R < 0 || !SkScalarIsFinite(R)) { // complex roots
89 if (r - roots == 2) {
90 if (roots[0] > roots[1])
91 SkTSwap<SkScalar>(roots[0], roots[
838 double roots[3]; local
905 int roots = SkFindUnitQuadRoots(coeff[0], coeff[1], coeff[2], tValues); local
[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/effects/gradients/
H A DSkTwoPointConicalGradient.cpp31 // Return the number of distinct real roots, and write them into roots[] in
33 static int find_quad_roots(float A, float B, float C, float roots[2], bool descendingOrder = false) { argument
34 SkASSERT(roots);
37 return valid_divide(-C, B, roots);
59 roots[0] = 0;
65 roots[0] = r0 < r1 ? r0 : r1;
66 roots[1] = r0 > r1 ? r0 : r1;
68 SkTSwap(roots[0], roots[
107 float roots[2]; local
[all...]
/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/fonttools/Lib/fontTools/misc/
H A DbezierTools.py36 roots = []
38 roots.append(-bx/ax2)
40 roots.append(-by/ay2)
41 points = [(ax*t*t + bx*t + cx, ay*t*t + by*t + cy) for t in roots if 0 <= t < 1] + [pt1, pt3]
64 roots = xRoots + yRoots
66 points = [(ax*t*t*t + bx*t*t + cx * t + dx, ay*t*t*t + by*t*t + cy * t + dy) for t in roots] + [pt1, pt4]
260 This function returns a list of roots. Note that the returned list
266 roots = []
269 roots = [-c/b]
271 # We have a true quadratic equation. Apply the quadratic formula to find two roots
[all...]
/external/fonttools/Tools/fontTools/misc/
H A DbezierTools.py36 roots = []
38 roots.append(-bx/ax2)
40 roots.append(-by/ay2)
41 points = [(ax*t*t + bx*t + cx, ay*t*t + by*t + cy) for t in roots if 0 <= t < 1] + [pt1, pt3]
64 roots = xRoots + yRoots
66 points = [(ax*t*t*t + bx*t*t + cx * t + dx, ay*t*t*t + by*t*t + cy * t + dy) for t in roots] + [pt1, pt4]
260 This function returns a list of roots. Note that the returned list
266 roots = []
269 roots = [-c/b]
271 # We have a true quadratic equation. Apply the quadratic formula to find two roots
[all...]
/external/compiler-rt/test/BlocksRuntime/
H A Dmakefile55 ditto $(RootsDirectory)/libclosure.roots/libclosure~dst/usr/local/lib/system $(ALTUSRLOCALLIBSYSTEM)
67 LibsystemRootPath ?= $(RootsDirectory)/Libsystem-$(LibsystemVersion).roots/Libsystem-$(LibsystemVersion)~dst/usr/lib/
/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/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.
/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...]

Completed in 572 milliseconds

12345