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

1 2 3

  /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/webkit/Source/JavaScriptCore/heap/
ConservativeRoots.h 49 JSCell** roots();
94 inline JSCell** ConservativeRoots::roots() function in class:JSC::ConservativeRoots
MarkStack.cpp 51 JSCell** roots = conservativeRoots.roots(); local
54 internalAppend(roots[i]);
  /external/ceres-solver/internal/ceres/
polynomial_solver_test.cc 77 // Needed because the roots are not returned in sorted order.
84 // Run a test with the polynomial defined by the N real roots in roots_real.
140 const double roots[1] = { 42.42 }; local
141 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
145 const double roots[1] = { -42.42 }; local
146 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
150 const double roots[2] = { 1.0, 42.42 }; local
151 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
155 const double roots[2] = { -42.42, 1.0 }; local
156 RunPolynomialTestRealRoots(roots, true, true, kEpsilon)
160 const double roots[2] = { -42.42, -1.0 }; local
165 const double roots[2] = { 42.42, 42.43 }; local
188 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local
193 const double roots[4] = { 1.23e-1, 2.46e-1, 1.23e+5, 2.46e+5 }; local
198 const double roots[4] = { -42.42, 0.0, 0.0, 42.42 }; local
203 const double roots[4] = { 0.0, 0.0, 0.0, 0.0 }; local
208 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local
213 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local
218 const double roots[4] = { 1.23e-4, 1.23e-1, 1.23e+2, 1.23e+5 }; local
    [all...]
  /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...]
  /external/skia/legacy/src/core/
SkQuadClipper.cpp 44 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
45 int count = SkFindUnitQuadRoots(A, B, C, roots);
47 *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 46 SkScalar roots[2]; // we only expect one, but make room for 2 for safety local
47 int count = SkFindUnitQuadRoots(A, B, C, roots);
49 *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];
  /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/eigen/unsupported/Eigen/src/Polynomials/
PolynomialSolver.h 20 * - 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
304 * Computes the complex roots of a real polynomial
    [all...]
  /external/smali/util/src/test/java/org/jf/util/
PathUtilTest.java 39 File[] roots = File.listRoots(); local
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(); local
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(); local
70 File basePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar);
71 File relativePath = new File(roots[0] + "some" + File.separatorChar + "dir" + File.separatorChar)
80 File[] roots = File.listRoots(); local
92 File[] roots = File.listRoots(); local
104 File[] roots = File.listRoots(); local
116 File[] roots = File.listRoots(); local
128 File[] roots = File.listRoots(); local
140 File[] roots = File.listRoots(); local
152 File[] roots = File.listRoots(); local
164 File[] roots = File.listRoots(); local
176 File[] roots = File.listRoots(); local
188 File[] roots = File.listRoots(); local
200 File[] roots = File.listRoots(); local
212 File[] roots = File.listRoots(); local
224 File[] roots = File.listRoots(); local
236 File[] roots = File.listRoots(); local
248 File[] roots = File.listRoots(); local
260 File[] roots = File.listRoots(); local
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newxmlfile/
NewXmlFileCreationPage.java 596 Object[] roots = (Object[]) mRootTableViewer.getInput(); local
597 return roots[index].toString();
800 ArrayList<String> roots = type.getRoots(); local
1022 ArrayList<String> roots = type.getRoots(); local
    [all...]
  /external/blktrace/btt/
inlines.h 287 struct rb_root *roots = dip->heads; local
288 return &roots[type];
  /external/chromium/chrome/browser/bookmarks/
bookmark_codec.cc 19 const char* BookmarkCodec::kRootsKey = "roots";
53 DictionaryValue* roots = new DictionaryValue(); local
54 roots->Set(kRootFolderNameKey, EncodeNode(bookmark_bar_node));
55 roots->Set(kOtherBookmarkFolderNameKey, EncodeNode(other_folder_node));
64 main->Set(kRootsKey, roots);
137 Value* roots; local
138 if (!d_value.Get(kRootsKey, &roots))
139 return false; // No roots.
141 if (roots->GetType() != Value::TYPE_DICTIONARY)
142 return false; // Invalid type for roots
    [all...]
bookmark_codec_unittest.cc 67 Value* roots; local
68 ASSERT_TRUE(d_value->Get(BookmarkCodec::kRootsKey, &roots));
69 ASSERT_EQ(Value::TYPE_DICTIONARY, roots->GetType());
71 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
bookmark_html_writer.cc 104 Value* roots; local
108 BookmarkCodec::kRootsKey, &roots) ||
109 roots->GetType() != Value::TYPE_DICTIONARY) {
114 DictionaryValue* roots_d_value = static_cast<DictionaryValue*>(roots);
  /external/chromium/chrome/browser/history/
starred_url_database.cc 134 std::set<StarredNode*> roots; local
139 if (!BuildStarNodes(&roots, &folders_with_duplicate_ids, &unparented_urls,
144 bool valid = EnsureStarredIntegrityImpl(&roots, folders_with_duplicate_ids,
147 STLDeleteElements(&roots);
319 std::set<StarredURLDatabase::StarredNode*>* roots,
374 roots->insert(folder_id_to_node_map[star_entries[i].folder_id]);
383 // The node has a cycle. Add it to the list of roots so the cycle is
385 roots->insert(node);
424 std::set<StarredURLDatabase::StarredNode*>* roots,
430 GetNodeByType(*roots, StarredEntry::BOOKMARK_BAR)
    [all...]
  /external/speex/libspeex/
lsp.c 68 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);
sb_celp.c 307 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) {
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newproject/
SampleSelectionPage.java 179 Object[] roots = (Object[]) mTableViewer.getInput(); local
180 selectSample(((Pair<String, File>) roots[index]).getSecond());
  /frameworks/base/core/java/android/animation/
AnimatorSet.java 807 * - All nodes without dependencies become 'roots'
808 * - while roots list is not null
812 * - any nodes with no dependencies are added to the roots list
817 ArrayList<Node> roots = new ArrayList<Node>(); local
    [all...]
  /packages/apps/Camera/jni/feature_stab/db_vlvm/
db_image_homography.cpp 119 double roots[3]; local
162 db_SolveCubic(roots,&nr_roots,p9[4],p9[3],p9[2],p9[1]);
166 if(roots[i]>0)
168 if((!signed_disambiguation) || (db_PolyEval1(p1,roots[i])*db_PolyEval1(p4,roots[i])>0))
170 fsol[j++]=db_SafeSqrtReciprocal(roots[i]);
  /packages/apps/Gallery2/jni_mosaic/feature_stab/db_vlvm/
db_image_homography.cpp 119 double roots[3]; local
162 db_SolveCubic(roots,&nr_roots,p9[4],p9[3],p9[2],p9[1]);
166 if(roots[i]>0)
168 if((!signed_disambiguation) || (db_PolyEval1(p1,roots[i])*db_PolyEval1(p4,roots[i])>0))
170 fsol[j++]=db_SafeSqrtReciprocal(roots[i]);

Completed in 1207 milliseconds

1 2 3