HomeSort by relevance Sort by last modified time
    Searched defs:roots (Results 1 - 25 of 162) sorted by null

1 2 3 4 5 6 7

  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsRect.cpp 21 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; ++x)
    [all...]
SkQuarticRoot.cpp 5 * 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);
114 int roots = SkDCubic::RootsReal(1, -p \/ 2, -r, r * p \/ 2 - q * q \/ 8, cubicRoots); local
    [all...]
  /external/skia/src/pathops/
SkPathOpsRect.cpp 21 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; ++x)
    [all...]
SkQuarticRoot.cpp 5 * 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);
114 int roots = SkDCubic::RootsReal(1, -p \/ 2, -r, r * p \/ 2 - q * q \/ 8, cubicRoots); local
    [all...]
  /external/eigen/unsupported/doc/examples/
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();
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] ) );
    [all...]
  /external/chromium_org/third_party/skia/experimental/Intersection/
QuadraticBounds.cpp 28 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) {
CubicBounds.cpp 47 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) {
LineCubicIntersection_Test.cpp 43 int roots = intersect(reduce1, reduce2, i); local
44 for (int pt = 0; pt < roots; ++pt) {
QuarticRoot.cpp 5 * 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); // note that -C==A+B+D+
141 int roots = cubicRootsReal(1, -p \/ 2, -r, r * p \/ 2 - q * q \/ 8, cubicRoots); local
    [all...]
  /external/skia/experimental/Intersection/
QuadraticBounds.cpp 28 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) {
CubicBounds.cpp 47 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) {
LineCubicIntersection_Test.cpp 43 int roots = intersect(reduce1, reduce2, i); local
44 for (int pt = 0; pt < roots; ++pt) {
QuarticRoot.cpp 5 * 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); // note that -C==A+B+D+
141 int roots = cubicRootsReal(1, -p \/ 2, -r, r * p \/ 2 - q * q \/ 8, cubicRoots); local
    [all...]
  /external/chromium_org/chrome/browser/
memory_details_android.cc 72 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);
  /external/chromium_org/third_party/skia/src/core/
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];
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/skia/src/core/
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];
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/chromium_org/chrome/browser/resources/sync_internals/
sync_node_browser.js 144 var roots = tree.allNodes.filter(isTypeRootNode); variable
145 roots.sort(nodeComparator);
147 roots.forEach(function(typeRoot) {
  /external/chromium_org/third_party/WebKit/Source/platform/fonts/
GlyphPageTreeNode.h 47 // GlyphPageTreeNode for each glyph page number. The roots do not have a
113 static HashMap<int, GlyphPageTreeNode*>* roots; member in class:blink::GlyphPageTreeNode
  /external/eigen/unsupported/test/
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
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/
UiModelTreeContentProvider.java 92 ArrayList<UiElementNode> roots = new ArrayList<UiElementNode>(); local
96 roots.add(ui_node);
100 roots.add(ui_node);
107 return roots.toArray();
  /external/ceres-solver/internal/ceres/
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, true, true, kEpsilon)
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/jarjar/src/main/com/tonicsystems/jarjar/
KeepProcessor.java 31 private final List<String> roots = new ArrayList<String>(); field in class:KeepProcessor
44 closureHelper(closure, roots);
68 roots.add(name);

Completed in 1124 milliseconds

1 2 3 4 5 6 7