| /external/eigen/doc/examples/ |
| function_taking_ref.cpp | 15 cout << "matrix m:" << endl << m << endl << endl; local
16 cout << "inv_cond(m): " << inv_cond(m) << endl;
17 cout << "inv_cond(m(1:3,1:3)): " << inv_cond(m.topLeftCorner(3,3)) << endl;
18 cout << "inv_cond(m+I): " << inv_cond(m+Matrix4f::Identity()) << endl;
|
| DenseBase_middleCols_int.cpp | 12 cout << "A =\n" << A << '\n' << endl; local
13 cout << "A(1..3,:) =\n" << A.middleCols(1,3) << endl;
|
| DenseBase_middleRows_int.cpp | 12 cout << "A =\n" << A << '\n' << endl; local
13 cout << "A(2..3,:) =\n" << A.middleRows(2,2) << endl;
|
| DenseBase_template_int_middleCols.cpp | 12 cout << "A =\n" << A << '\n' << endl; local
13 cout << "A(:,1..3) =\n" << A.middleCols<3>(1) << endl;
|
| DenseBase_template_int_middleRows.cpp | 12 cout << "A =\n" << A << '\n' << endl; local
13 cout << "A(1..3,:) =\n" << A.middleRows<3>(1) << endl;
|
| Tutorial_ArrayClass_mult.cpp | 15 cout << "a * b = " << endl << a * b << endl; local
|
| Tutorial_ReductionsVisitorsBroadcasting_colwise.cpp | 11 std::cout << "Column's maximum: " << std::endl
12 << mat.colwise().maxCoeff() << std::endl; member in class:std
|
| Tutorial_ReductionsVisitorsBroadcasting_rowwise.cpp | 11 std::cout << "Row's maximum: " << std::endl
12 << mat.rowwise().maxCoeff() << std::endl; member in class:std
|
| /external/eigen/doc/snippets/ |
| Tutorial_Map_using.cpp | 13 cout << "m1: " << m1 << endl; variable
14 cout << "m2: " << m2 << endl; variable
15 cout << "Squared euclidean distance: " << (m1-m2).squaredNorm() << endl;
17 (m1-m2map).squaredNorm() << endl;
19 cout << "Updated m2: " << m2 << endl; variable
20 cout << "m2 coefficient 2, constant accessor: " << m2mapconst(2) << endl;
|
| Cwise_boolean_and.cpp | 2 cout << ((v<w) && (v<0)) << endl;
|
| Cwise_boolean_or.cpp | 2 cout << ((v<w) || (v<0)) << endl;
|
| Cwise_cos.cpp | 2 cout << v.cos() << endl;
|
| Cwise_max.cpp | 2 cout << v.max(w) << endl;
|
| Cwise_min.cpp | 2 cout << v.min(w) << endl;
|
| Cwise_sin.cpp | 2 cout << v.sin() << endl;
|
| Cwise_tan.cpp | 2 cout << v.tan() << endl;
|
| MatrixBase_cwiseMax.cpp | 2 cout << v.cwiseMax(w) << endl;
|
| MatrixBase_cwiseMin.cpp | 2 cout << v.cwiseMin(w) << endl;
|
| MatrixBase_cwiseQuotient.cpp | 2 cout << v.cwiseQuotient(w) << endl;
|
| Matrix_resize_int.cpp | 5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl;
6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
|
| TopicAliasing_mult2.cpp | 6 cout << matB << endl << endl; variable
|
| Tutorial_solve_matrix_inverse.cpp | 6 cout << "The solution is:" << endl << x << endl; variable
|
| Tutorial_solve_triangular_inplace.cpp | 6 cout << "The solution is:" << endl << b << endl; variable
|
| /external/eigen/unsupported/doc/examples/ |
| PolynomialSolver1.cpp | 13 cout << "Roots: " << roots.transpose() << endl;
18 cout << "Complex roots: " << psolve.roots().transpose() << endl;
23 cout << "Real roots: " << mapRR.transpose() << endl;
25 cout << endl; local
26 cout << "Illustration of the convergence problem with the QR algorithm: " << endl; local
27 cout << "---------------------------------------------------------------" << endl; local
31 cout << "Hard case polynomial defined by floats: " << hardCase_polynomial.transpose() << endl;
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl;
36 cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl << endl; local
38 cout << "Using double's almost always solves the problem for small degrees: " << endl; local
39 cout << "-------------------------------------------------------------------" << endl; local
47 cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl << endl; local
[all...] |
| /external/stlport/stlport/using/h/ |
| ostream.h | 2 using _STLP_OLD_IO_NAMESPACE::endl;
|
