Home
last modified time | relevance | path

Searched refs:roots (Results 1 – 25 of 142) sorted by relevance

123456

/external/smali/util/src/test/java/org/jf/util/
DPathUtilTest.java39 File[] roots = File.listRoots(); in pathUtilTest1() local
41 if (roots.length > 1) { in pathUtilTest1()
42 …File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "te… in pathUtilTest1()
43 …File relativePath = new File(roots[1] + "some" + File.separatorChar + "dir" + File.separatorChar +… in pathUtilTest1()
53 File[] roots = File.listRoots(); in pathUtilTest2() local
55 …File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar + "te… in pathUtilTest2()
56 …File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar +… in pathUtilTest2()
68 File[] roots = File.listRoots(); in pathUtilTest3() local
70 … File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar); in pathUtilTest3()
71 … File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar); in pathUtilTest3()
[all …]
/external/skia/src/pathops/
DSkPathOpsRect.cpp17 int roots = 0; in setBounds() local
19 roots = SkDQuad::FindExtrema(&sub[0].fX, tValues); in setBounds()
22 roots += SkDQuad::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
24 for (int index = 0; index < roots; ++index) { in setBounds()
34 int roots = 0; in setBounds() local
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues); in setBounds()
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]); in setBounds()
41 for (int index = 0; index < roots; ++index) { in setBounds()
51 int roots = 0; in setBounds() local
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
[all …]
DSkDCubicLineIntersection.cpp120 int intersectRay(double roots[3]) { in intersectRay()
129 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in intersectRay()
131 SkDPoint calcPt = c.ptAtT(roots[index]); in intersectRay()
139 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
152 int roots = intersectRay(rootVals); in intersect() local
153 for (int index = 0; index < roots; ++index) { in intersect()
165 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in HorizontalIntersect()
169 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in HorizontalIntersect()
171 SkDPoint calcPt = c.ptAtT(roots[index]); in HorizontalIntersect()
175 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots); in HorizontalIntersect()
[all …]
DSkDQuadLineIntersection.cpp138 int intersectRay(double roots[2]) { in intersectRay()
165 return SkDQuad::RootsValidT(A, 2 * B, C, roots); in intersectRay()
174 int roots = intersectRay(rootVals); in intersect() local
175 for (int index = 0; index < roots; ++index) { in intersect()
187 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
194 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in horizontalIntersect()
203 int roots = horizontalIntersect(axisIntercept, rootVals); in horizontalIntersect() local
204 for (int index = 0; index < roots; ++index) { in horizontalIntersect()
243 int verticalIntersect(double axisIntercept, double roots[2]) { in verticalIntersect()
250 return SkDQuad::RootsValidT(D, 2 * E, F, roots); in verticalIntersect()
[all …]
DSkDConicLineIntersection.cpp66 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
68 return this->validT(conicVals, axisIntercept, roots); in horizontalIntersect()
76 double roots[2]; in horizontalIntersect() local
77 int count = this->horizontalIntersect(axisIntercept, roots); in horizontalIntersect()
79 double conicT = roots[index]; in horizontalIntersect()
102 int roots = this->intersectRay(rootVals); in intersect() local
103 for (int index = 0; index < roots; ++index) { in intersect()
119 int intersectRay(double roots[2]) { in intersectRay()
126 return this->validT(r, 0, roots); in intersectRay()
129 int validT(double r[3], double axisIntercept, double roots[2]) { in validT()
[all …]
DSkPathOpsCurve.h272 static int line_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in line_intercept_h() argument
274 roots[0] = SkIntersections::HorizontalIntercept(line.set(a), y); in line_intercept_h()
275 return between(0, roots[0], 1); in line_intercept_h()
278 static int line_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in line_intercept_v() argument
280 roots[0] = SkIntersections::VerticalIntercept(line.set(a), x); in line_intercept_v()
281 return between(0, roots[0], 1); in line_intercept_v()
284 static int quad_intercept_h(const SkPoint a[2], SkScalar , SkScalar y, double* roots) { in quad_intercept_h() argument
286 return SkIntersections::HorizontalIntercept(quad.set(a), y, roots); in quad_intercept_h()
289 static int quad_intercept_v(const SkPoint a[2], SkScalar , SkScalar x, double* roots) { in quad_intercept_v() argument
291 return SkIntersections::VerticalIntercept(quad.set(a), x, roots); in quad_intercept_v()
[all …]
DSkPathOpsConic.cpp36 int roots = SkDQuad::RootsValidT(coeff[0], coeff[1], coeff[2], tValues); in FindExtrema() local
37 SkASSERT(0 == roots || 1 == roots); in FindExtrema()
39 if (1 == roots) { in FindExtrema()
DSkPathOpsCubic.cpp258 int roots = cubic.findMaxCurvature(maxCurvature); in ComplexBreak() local
269 for (int index = 0; index < roots; ++index) { in ComplexBreak()
277 for (int index = 0; index < roots; ++index) { in ComplexBreak()
420 double* roots = s; in RootsReal() local
426 *roots++ = r; in RootsReal()
430 *roots++ = r; in RootsReal()
433 if (!AlmostDequalUlps(s[0], r) && (roots - s == 1 || !AlmostDequalUlps(s[1], r))) { in RootsReal()
434 *roots++ = r; in RootsReal()
447 *roots++ = r; in RootsReal()
451 *roots++ = r; in RootsReal()
[all …]
/external/eigen/unsupported/doc/examples/
DPolynomialSolver1.cpp12 Vector5d roots = Vector5d::Random(); in main() local
13 cout << "Roots: " << roots.transpose() << endl; in main()
15 roots_to_monicPolynomial( roots, polynomial ); in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
35 …for( int i=0; i<6; ++i ){ evals[i] = std::abs( poly_eval( hardCase_polynomial, psolvef.roots()[i] … in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
44 std::complex<float> castedRoot( psolve6d.roots()[i].real(), psolve6d.roots()[i].imag() ); in main()
50 …cout << "The last root in float then in double: " << psolvef.roots()[5] << "\t" << psolve6d.roots(… in main()
51 std::complex<float> castedRoot( psolve6d.roots()[5].real(), psolve6d.roots()[5].imag() ); in main()
[all …]
DPolynomialUtils1.cpp9 Vector4d roots = Vector4d::Random(); in main() local
10 cout << "Roots: " << roots.transpose() << endl; in main()
12 roots_to_monicPolynomial( roots, polynomial ); in main()
18 evaluation[i] = poly_eval( polynomial, roots[i] ); } in main()
/external/eigen/bench/
Deig33.cpp49 inline void computeRoots(const Matrix& m, Roots& roots) in computeRoots() argument
80 roots(0) = c2_over_3 + Scalar(2)*rho*cos_theta; in computeRoots()
81 roots(1) = c2_over_3 - rho*(cos_theta + s_sqrt3*sin_theta); in computeRoots()
82 roots(2) = c2_over_3 - rho*(cos_theta - s_sqrt3*sin_theta); in computeRoots()
85 if (roots(0) >= roots(1)) in computeRoots()
86 std::swap(roots(0),roots(1)); in computeRoots()
87 if (roots(1) >= roots(2)) in computeRoots()
89 std::swap(roots(1),roots(2)); in computeRoots()
90 if (roots(0) >= roots(1)) in computeRoots()
91 std::swap(roots(0),roots(1)); in computeRoots()
/external/ceres-solver/internal/ceres/
Dpolynomial_test.cc141 const double roots[1] = { 42.42 }; in TEST() local
142 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
146 const double roots[1] = { -42.42 }; in TEST() local
147 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
151 const double roots[2] = { 1.0, 42.42 }; in TEST() local
152 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
156 const double roots[2] = { -42.42, 1.0 }; in TEST() local
157 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
161 const double roots[2] = { -42.42, -1.0 }; in TEST() local
162 RunPolynomialTestRealRoots(roots, true, true, kEpsilon); in TEST()
[all …]
/external/eigen/unsupported/test/
Dpolynomialutils.cpp36 EvalRootsType roots = EvalRootsType::Random(deg); in realRoots_to_monicPolynomial_test() local
37 roots_to_monicPolynomial( roots, pols ); in realRoots_to_monicPolynomial_test()
40 for( int i=0; i<roots.size(); ++i ){ in realRoots_to_monicPolynomial_test()
41 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); } in realRoots_to_monicPolynomial_test()
74 EvalRootsType roots = EvalRootsType::Random(deg); in CauchyBounds() local
75 roots_to_monicPolynomial( roots, pols ); in CauchyBounds()
78 _Scalar Max = roots.array().abs().maxCoeff(); in CauchyBounds()
79 _Scalar min = roots.array().abs().minCoeff(); in CauchyBounds()
83 cerr << "Roots: " << roots << endl; in CauchyBounds()
Dpolynomialsolver.cpp42 const RootsType& roots( psolve.roots() ); in aux_evalSolver() local
44 for( int i=0; i<roots.size(); ++i ){ in aux_evalSolver()
45 evr[i] = std::abs( poly_eval( pols, roots[i] ) ); } in aux_evalSolver()
52 cerr << "Roots found: " << roots.transpose() << endl; in aux_evalSolver()
57 std::vector<Scalar> rootModuli( roots.size() ); in aux_evalSolver()
58 Map< EvalRootsType > aux( &rootModuli[0], roots.size() ); in aux_evalSolver()
59 aux = roots.array().abs(); in aux_evalSolver()
93 void evalSolverSugarFunction( const POLYNOMIAL& pols, const ROOTS& roots, const REAL_ROOTS& real_ro… in evalSolverSugarFunction() argument
128 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(), in evalSolverSugarFunction()
132 VERIFY( internal::isApprox( roots.array().abs().minCoeff(), in evalSolverSugarFunction()
/external/tlsdate/
DMakefile.am71 cert_DATA = ca-roots/tlsdate-ca-roots.conf
124 …lla.org/mozilla/source/security/nss/lib/ckfw/builtins/certdata.txt\?raw\=1 -o ca-roots/certdata.txt
125 …xtract-nss-root-certs/convert_mozilla_certdata.go ca-roots/certdata.txt > ca-roots/tlsdate-ca-root…
126 rm ca-roots/certdata.txt
129 …./src/tlsdate-helper google.com 443 tlsv1 racket verbose ca-roots/tlsdate-ca-roots.conf dont-set-c…
/external/skia/src/core/
DSkGeometry.cpp71 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { in SkFindUnitQuadRoots()
72 SkASSERT(roots); in SkFindUnitQuadRoots()
75 return valid_unit_divide(-C, B, roots); in SkFindUnitQuadRoots()
78 SkScalar* r = roots; in SkFindUnitQuadRoots()
95 if (r - roots == 2) { in SkFindUnitQuadRoots()
96 if (roots[0] > roots[1]) in SkFindUnitQuadRoots()
97 SkTSwap<SkScalar>(roots[0], roots[1]); in SkFindUnitQuadRoots()
98 else if (roots[0] == roots[1]) // nearly-equal? in SkFindUnitQuadRoots()
101 return (int)(r - roots); in SkFindUnitQuadRoots()
442 const SkScalar tValues[], int roots) { in SkChopCubicAt() argument
[all …]
DSkQuadClipper.cpp32 SkScalar roots[2]; // we only expect one, but make room for 2 for safety in chopMonoQuadAt() local
33 int count = SkFindUnitQuadRoots(A, B, C, roots); in chopMonoQuadAt()
35 *t = roots[0]; in chopMonoQuadAt()
/external/dbus/test/
Dunused-code-gc.py11 roots = {} variable
185 if roots.has_key(name):
188 roots[name] = 1
190 print "%d symbols exported from this object" % len(roots)
214 if roots.has_key(vr):
216 roots[vr] = 1
218 for k in roots.keys():
/external/skia/src/effects/gradients/
DSkTwoPointConicalGradient.cpp34 static int find_quad_roots(float A, float B, float C, float roots[2], bool descendingOrder = false)… in find_quad_roots()
35 SkASSERT(roots); in find_quad_roots()
38 return valid_divide(-C, B, roots); in find_quad_roots()
60 roots[0] = 0; in find_quad_roots()
66 roots[0] = r0 < r1 ? r0 : r1; in find_quad_roots()
67 roots[1] = r0 > r1 ? r0 : r1; in find_quad_roots()
69 SkTSwap(roots[0], roots[1]); in find_quad_roots()
108 float roots[2]; in nextT() local
111 int countRoots = find_quad_roots(fRec.fA, fB, C, roots, fRec.fFlipped); in nextT()
123 float t = roots[countRoots - 1]; in nextT()
[all …]
/external/fonttools/Lib/fontTools/misc/
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] + [pt…
266 roots = []
269 roots = [-c/b]
275 roots = [(-b+rDD)/2.0/a, (-b-rDD)/2.0/a]
278 roots = []
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/
DFastFourierTransformer.java54 private RootsOfUnity roots = new RootsOfUnity(); field in FastFourierTransformer
112 roots.computeOmega(f.length); in transform()
170 roots.computeOmega(f.length); in transform2()
229 roots.computeOmega(-f.length); // pass negative argument in inversetransform()
288 roots.computeOmega(-f.length); // pass negative argument in inversetransform2()
318 roots.computeOmega(isInverse ? -N : N); in fft()
322 roots.computeOmega(isInverse ? -2*N : 2*N); in fft()
330 Complex D = new Complex(-roots.getOmegaImaginary(i), in fft()
331 roots.getOmegaReal(i)); in fft()
386 f[i+1] = roots.isForward() ? e2 : e1; in fft()
[all …]
/external/v8/test/unittests/compiler/
Dgraph-trimmer-unittest.cc22 Node* const roots[1] = {root}; in TrimGraph() local
24 trimmer.TrimGraph(&roots[0], &roots[arraysize(roots)]); in TrimGraph()
/external/eigen/unsupported/Eigen/
DPolynomials61 where \f$ p \f$ is known through its roots i.e. \f$ p(x) = (x-r_1)(x-r_2)...(x-r_n) \f$.
70 …omputes the coefficients in the monomial basis of the monic polynomial that has the provided roots;
99 …Computes the complex roots of a polynomial by computing the eigenvalues of the associated companio…
101 The roots of \f$ p(x) = a_0 + a_1 x + a_2 x^2 + a_{3} x^3 + x^4 \f$ are the eigenvalues of
114 …al solver is guaranteed to provide a correct result only when the complex roots \f$r_1,r_2,...,r_d…
127 …em with the QR algorithm is presented: a polynomial with almost conjugate roots is provided to the…
128 Those roots have almost same module therefore the QR algorithm failed to converge: the accuracy
/external/skia/tests/
DPathOpsCubicLineIntersectionTest.cpp46 int roots = i.intersect(cubic, line); in testFail() local
47 REPORTER_ASSERT(reporter, roots == 0); in testFail()
144 int roots = doIntersect(i, cubic, line); in testOne() local
145 for (int pt = 0; pt < roots; ++pt) { in testOne()
/external/llvm/test/CodeGen/ARM/
D2010-04-15-ScavengerDebugValue.ll19 …", directory: "/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/llvmgcc~obj/src/gc…
20 …", directory: "/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/llvmgcc~obj/src/gc…
25 …", directory: "/Users/bwilson/local/nightly/test-2010-04-14/build/llvmgcc.roots/llvmgcc~obj/src/gc…

123456