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

123456

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DQuarticRoot_Test.cpp32 double roots[2]; local
33 const int rootCount = limit ? quadraticRootsValidT(A, b, c, roots)
34 : quadraticRootsReal(A, b, c, roots);
46 SkASSERT(approximately_equal(roots[0], -B)
47 || approximately_equal(roots[0], -C));
49 SkASSERT(!approximately_equal(roots[0], roots[1]));
50 SkASSERT(approximately_equal(roots[1], -B)
51 || approximately_equal(roots[1], -C));
71 double roots[ local
130 double roots[4]; local
[all...]
H A DExtrema.cpp32 static int findUnitQuadRoots(double A, double B, double C, double roots[2]) argument
35 return validUnitDivide(-C, B, roots);
37 double* r = roots;
40 if (R < 0) { // complex roots
48 if (r - roots == 2 && AlmostEqualUlps(roots[0], roots[1])) { // nearly-equal?
51 return (int)(r - roots);
H A DQuadraticBounds.cpp28 int roots = 0; local
30 roots = findExtrema(quad[0].x, quad[1].x, quad[2].x, tValues);
33 roots += findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValues[roots]);
35 for (int x = 0; x < roots; ++x) {
H A DCubicBounds.cpp47 int roots = 0; local
49 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues);
52 roots += findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, &tValues[roots]);
54 for (int x = 0; x < roots; ++x) {
H A DLineCubicIntersection.cpp90 int intersectRay(double roots[3]) { argument
99 return cubicRootsValidT(A, B, C, D, roots);
105 int roots = intersectRay(rootVals); local
106 for (int index = 0; index < roots; ++index) {
118 int horizontalIntersect(double axisIntercept, double roots[3]) { argument
122 return cubicRootsValidT(A, B, C, D, roots);
128 int roots = horizontalIntersect(axisIntercept, rootVals); local
129 for (int index = 0; index < roots; ++index) {
144 int verticalIntersect(double axisIntercept, double roots[3]) { argument
148 return cubicRootsValidT(A, B, C, D, roots);
154 int roots = verticalIntersect(axisIntercept, rootVals); local
226 int roots = intersections.fUsed; local
[all...]
H A DLineQuadraticIntersection.cpp100 int intersectRay(double roots[2]) { argument
102 solve by rotating line+quad so line is horizontal, then finding the roots
127 return quadraticRootsValidT(A, 2 * B, C, roots);
133 int roots = intersectRay(rootVals); local
134 for (int index = 0; index < roots; ++index) {
146 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
153 return quadraticRootsValidT(D, 2 * E, F, roots);
159 int roots = horizontalIntersect(axisIntercept, rootVals); local
160 for (int index = 0; index < roots; ++index) {
175 int verticalIntersect(double axisIntercept, double roots[ argument
188 int roots = verticalIntersect(axisIntercept, rootVals); local
261 int roots = intersections.fUsed; local
298 int roots = q.horizontalIntersect(pt.y, rootVals); local
313 int roots = q.verticalIntersect(pt.x, rootVals); local
[all...]
H A DQuarticRoot.cpp5 * Utility functions to find cubic and quartic roots,
10 * The functions return the number of non-complex roots and
24 * correct but multiple roots might be reported more
34 const double t0, const bool oneHint, double roots[4]) {
85 return quadraticRootsReal(t2, t1, t0, roots);
88 return cubicRootsReal(t3, t2, t1, t0, roots);
95 int num = cubicRootsReal(t4, t3, t2, t1, roots);
97 if (approximately_zero(roots[i])) {
101 roots[num++] = 0;
106 int num = cubicRootsReal(t4, t4 + t3, -(t1 + t0), -t0, roots); // not
33 reducedQuarticRoots(const double t4, const double t3, const double t2, const double t1, const double t0, const bool oneHint, double roots[4]) argument
141 int roots = cubicRootsReal(1, -p / 2, -r, r * p / 2 - q * q / 8, cubicRoots); local
[all...]
/external/skia/experimental/Intersection/
H A DQuarticRoot_Test.cpp32 double roots[2]; local
33 const int rootCount = limit ? quadraticRootsValidT(A, b, c, roots)
34 : quadraticRootsReal(A, b, c, roots);
46 SkASSERT(approximately_equal(roots[0], -B)
47 || approximately_equal(roots[0], -C));
49 SkASSERT(!approximately_equal(roots[0], roots[1]));
50 SkASSERT(approximately_equal(roots[1], -B)
51 || approximately_equal(roots[1], -C));
71 double roots[ local
130 double roots[4]; local
[all...]
H A DExtrema.cpp32 static int findUnitQuadRoots(double A, double B, double C, double roots[2]) argument
35 return validUnitDivide(-C, B, roots);
37 double* r = roots;
40 if (R < 0) { // complex roots
48 if (r - roots == 2 && AlmostEqualUlps(roots[0], roots[1])) { // nearly-equal?
51 return (int)(r - roots);
H A DQuadraticBounds.cpp28 int roots = 0; local
30 roots = findExtrema(quad[0].x, quad[1].x, quad[2].x, tValues);
33 roots += findExtrema(quad[0].y, quad[1].y, quad[2].y, &tValues[roots]);
35 for (int x = 0; x < roots; ++x) {
H A DCubicBounds.cpp47 int roots = 0; local
49 roots = findExtrema(cubic[0].x, cubic[1].x, cubic[2].x, cubic[3].x, tValues);
52 roots += findExtrema(cubic[0].y, cubic[1].y, cubic[2].y, cubic[3].y, &tValues[roots]);
54 for (int x = 0; x < roots; ++x) {
H A DLineCubicIntersection.cpp90 int intersectRay(double roots[3]) { argument
99 return cubicRootsValidT(A, B, C, D, roots);
105 int roots = intersectRay(rootVals); local
106 for (int index = 0; index < roots; ++index) {
118 int horizontalIntersect(double axisIntercept, double roots[3]) { argument
122 return cubicRootsValidT(A, B, C, D, roots);
128 int roots = horizontalIntersect(axisIntercept, rootVals); local
129 for (int index = 0; index < roots; ++index) {
144 int verticalIntersect(double axisIntercept, double roots[3]) { argument
148 return cubicRootsValidT(A, B, C, D, roots);
154 int roots = verticalIntersect(axisIntercept, rootVals); local
226 int roots = intersections.fUsed; local
[all...]
H A DLineQuadraticIntersection.cpp100 int intersectRay(double roots[2]) { argument
102 solve by rotating line+quad so line is horizontal, then finding the roots
127 return quadraticRootsValidT(A, 2 * B, C, roots);
133 int roots = intersectRay(rootVals); local
134 for (int index = 0; index < roots; ++index) {
146 int horizontalIntersect(double axisIntercept, double roots[2]) { argument
153 return quadraticRootsValidT(D, 2 * E, F, roots);
159 int roots = horizontalIntersect(axisIntercept, rootVals); local
160 for (int index = 0; index < roots; ++index) {
175 int verticalIntersect(double axisIntercept, double roots[ argument
188 int roots = verticalIntersect(axisIntercept, rootVals); local
261 int roots = intersections.fUsed; local
298 int roots = q.horizontalIntersect(pt.y, rootVals); local
313 int roots = q.verticalIntersect(pt.x, rootVals); local
[all...]
H A DQuarticRoot.cpp5 * Utility functions to find cubic and quartic roots,
10 * The functions return the number of non-complex roots and
24 * correct but multiple roots might be reported more
34 const double t0, const bool oneHint, double roots[4]) {
85 return quadraticRootsReal(t2, t1, t0, roots);
88 return cubicRootsReal(t3, t2, t1, t0, roots);
95 int num = cubicRootsReal(t4, t3, t2, t1, roots);
97 if (approximately_zero(roots[i])) {
101 roots[num++] = 0;
106 int num = cubicRootsReal(t4, t4 + t3, -(t1 + t0), -t0, roots); // not
33 reducedQuarticRoots(const double t4, const double t3, const double t2, const double t1, const double t0, const bool oneHint, double roots[4]) argument
141 int roots = cubicRootsReal(1, -p / 2, -r, r * p / 2 - q * q / 8, cubicRoots); local
[all...]
/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/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsRect.cpp21 int roots = 0; local
23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues);
26 roots += SkDQuad::FindExtrema(quad[0].fY, quad[1].fY, quad[2].fY, &tValues[roots]);
28 for (int x = 0; x < roots; ++x) {
48 int roots = 0; local
50 roots = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, tValues);
53 roots += SkDCubic::FindExtrema(c[0].fY, c[1].fY, c[2].fY, c[3].fY, &tValues[roots]);
55 for (int x = 0; x < roots;
[all...]
H A DSkQuarticRoot.cpp5 * Utility functions to find cubic and quartic roots,
10 * The functions return the number of non-complex roots and
24 * correct but multiple roots might be reported more
33 const double t0, const bool oneHint, double roots[4]) {
54 return SkDQuad::RootsReal(t2, t1, t0, roots);
57 return SkDCubic::RootsReal(t3, t2, t1, t0, roots);
64 int num = SkDCubic::RootsReal(t4, t3, t2, t1, roots);
66 if (approximately_zero(roots[i])) {
70 roots[num++] = 0;
78 int num = SkDCubic::RootsReal(t4, t4 + t3, -(t1 + t0), -t0, roots);
32 SkReducedQuarticRoots(const double t4, const double t3, const double t2, const double t1, const double t0, const bool oneHint, double roots[4]) argument
114 int roots = SkDCubic::RootsReal(1, -p / 2, -r, r * p / 2 - q * q / 8, cubicRoots); local
[all...]
/external/skia/src/pathops/
H A DSkPathOpsRect.cpp21 int roots = 0; local
23 roots = SkDQuad::FindExtrema(quad[0].fX, quad[1].fX, quad[2].fX, tValues);
26 roots += SkDQuad::FindExtrema(quad[0].fY, quad[1].fY, quad[2].fY, &tValues[roots]);
28 for (int x = 0; x < roots; ++x) {
48 int roots = 0; local
50 roots = SkDCubic::FindExtrema(c[0].fX, c[1].fX, c[2].fX, c[3].fX, tValues);
53 roots += SkDCubic::FindExtrema(c[0].fY, c[1].fY, c[2].fY, c[3].fY, &tValues[roots]);
55 for (int x = 0; x < roots;
[all...]
H A DSkQuarticRoot.cpp5 * Utility functions to find cubic and quartic roots,
10 * The functions return the number of non-complex roots and
24 * correct but multiple roots might be reported more
33 const double t0, const bool oneHint, double roots[4]) {
54 return SkDQuad::RootsReal(t2, t1, t0, roots);
57 return SkDCubic::RootsReal(t3, t2, t1, t0, roots);
64 int num = SkDCubic::RootsReal(t4, t3, t2, t1, roots);
66 if (approximately_zero(roots[i])) {
70 roots[num++] = 0;
78 int num = SkDCubic::RootsReal(t4, t4 + t3, -(t1 + t0), -t0, roots);
32 SkReducedQuarticRoots(const double t4, const double t3, const double t2, const double t1, const double t0, const bool oneHint, double roots[4]) argument
114 int roots = SkDCubic::RootsReal(1, -p / 2, -r, r * p / 2 - q * q / 8, cubicRoots); local
[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;
/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(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/ceres-solver/internal/ceres/
H A Dpolynomial_test.cc78 // 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/chromium_org/chrome/browser/
H A Dmemory_details_android.cc72 const std::set<ProcessId>& roots,
74 *out = roots;
77 for (std::set<ProcessId>::const_iterator i = roots.begin(); i != roots.end();
121 std::set<ProcessId> roots; local
122 roots.insert(base::GetCurrentProcId());
125 roots.insert(i->pid);
129 GetAllChildren(processes, roots, &current_browser_processes);
71 GetAllChildren(const std::vector<ProcessEntry>& processes, const std::set<ProcessId>& roots, std::set<ProcessId>* out) argument

Completed in 4498 milliseconds

123456