OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:cout
(Results
201 - 225
of
777
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/eigen/doc/snippets/
MatrixBase_array.cpp
4
cout
<< v << endl;
MatrixBase_col.cpp
3
cout
<< m << endl;
MatrixBase_row.cpp
3
cout
<< m << endl;
MatrixBase_setIdentity.cpp
3
cout
<< m << endl;
MatrixBase_setOnes.cpp
3
cout
<< m << endl;
MatrixBase_setRandom.cpp
3
cout
<< m << endl;
MatrixBase_setZero.cpp
3
cout
<< m << endl;
PartialPivLU_solve.cpp
3
cout
<< "Here is the invertible matrix A:" << endl << A << endl;
4
cout
<< "Here is the matrix B:" << endl << B << endl;
6
cout
<< "Here is the (unique) solution X to the equation AX=B:" << endl << X << endl;
7
cout
<< "Relative error: " << (A*X-B).norm() / B.norm() << endl;
RealSchur_RealSchur_MatrixType.cpp
2
cout
<< "Here is a random 6x6 matrix, A:" << endl << A << endl << endl;
5
cout
<< "The orthogonal matrix U is:" << endl << schur.matrixU() << endl;
6
cout
<< "The quasi-triangular matrix T is:" << endl << schur.matrixT() << endl << endl;
10
cout
<< "U * T * U^T = " << endl << U * T * U.transpose() << endl;
SelfAdjointView_operatorNorm.cpp
2
cout
<< "The operator norm of the 3x3 matrix of ones is "
TopicAliasing_mult3.cpp
4
cout
<< matA;
Tridiagonalization_decomposeInPlace.cpp
3
cout
<< "Here is a random symmetric 5x5 matrix:" << endl << A << endl << endl;
8
cout
<< "The orthogonal matrix Q is:" << endl << A << endl;
9
cout
<< "The diagonal of the tridiagonal matrix T is:" << endl << diag << endl;
10
cout
<< "The subdiagonal of the tridiagonal matrix T is:" << endl << subdiag << endl;
tut_arithmetic_redux_minmax.cpp
4
cout
<< "Here is the matrix m:\n" << m << endl;
5
cout
<< "Its minimum coefficient (" << minOfM
10
cout
<< "Here is the vector v: " << v << endl;
11
cout
<< "Its maximum coefficient (" << maxOfV
/external/eigen/unsupported/doc/examples/
MatrixSine.cpp
9
std::
cout
<< "A = \n" << A << "\n\n";
12
std::
cout
<< "sin(A) = \n" << sinA << "\n\n";
15
std::
cout
<< "cos(A) = \n" << cosA << "\n\n";
19
std::
cout
<< "sin^2(A) + cos^2(A) = \n" << sinA*sinA + cosA*cosA << "\n\n";
MatrixSinh.cpp
9
std::
cout
<< "A = \n" << A << "\n\n";
12
std::
cout
<< "sinh(A) = \n" << sinhA << "\n\n";
15
std::
cout
<< "cosh(A) = \n" << coshA << "\n\n";
19
std::
cout
<< "cosh^2(A) - sinh^2(A) = \n" << coshA*coshA - sinhA*sinhA << "\n\n";
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;
26
cout
<< "Illustration of the convergence problem with the QR algorithm: " << endl;
27
cout
<< "---------------------------------------------------------------" << endl;
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;
38
cout
<< "Using double's almost always solves the problem for small degrees: " << endl
[
all
...]
/frameworks/base/tools/aapt/tests/
FileFinder_test.cpp
18
using std::
cout
;
26
cout
<< "\n\n STARTING FILE FINDER TESTS" << endl;
51
cout
<< "Checking DirectoryWalker...";
53
cout
<< "PASSED" << endl;
56
cout
<< "Running findFiles()...";
59
cout
<< "PASSED" << endl;
63
cout
<< "Running size comparison: Size is " << testStorage.size() << ", ";
64
cout
<< "Expected " << SIZE_EXPECTED << "...";
66
cout
<< "PASSED" << endl;
68
cout
<< "FAILED" << endl
[
all
...]
/external/eigen/doc/examples/
TutorialLinAlgExSolveColPivHouseholderQR.cpp
13
cout
<< "Here is the matrix A:\n" << A << endl;
14
cout
<< "Here is the vector b:\n" << b << endl;
16
cout
<< "The solution is:\n" << x << endl;
TutorialLinAlgExSolveLDLT.cpp
12
cout
<< "Here is the matrix A:\n" << A << endl;
13
cout
<< "Here is the right hand side b:\n" << b << endl;
15
cout
<< "The solution is:\n" << x << endl;
TutorialLinAlgSVDSolve.cpp
10
cout
<< "Here is the matrix A:\n" << A << endl;
12
cout
<< "Here is the right hand side b:\n" << b << endl;
13
cout
<< "The least-squares solution is:\n"
TutorialLinAlgSelfAdjointEigenSolver.cpp
11
cout
<< "Here is the matrix A:\n" << A << endl;
14
cout
<< "The eigenvalues of A are:\n" << eigensolver.eigenvalues() << endl;
15
cout
<< "Here's a matrix whose columns are eigenvectors of A \n"
Tutorial_BlockOperations_corner.cpp
13
cout
<< "m.leftCols(2) =" << endl << m.leftCols(2) << endl << endl;
14
cout
<< "m.bottomRows<2>() =" << endl << m.bottomRows<2>() << endl << endl;
16
cout
<< "After assignment, m = " << endl << m << endl;
Tutorial_BlockOperations_vector.cpp
10
cout
<< "v.head(3) =" << endl << v.head(3) << endl << endl;
11
cout
<< "v.tail<3>() = " << endl << v.tail<3>() << endl << endl;
13
cout
<< "after 'v.segment(1,4) *= 2', v =" << endl << v << endl;
Tutorial_PartialLU_solve.cpp
14
cout
<< "Here is the matrix A:" << endl << A << endl;
15
cout
<< "Here is the vector b:" << endl << b << endl;
17
cout
<< "The solution is:" << endl << x << endl;
tut_arithmetic_dot_cross.cpp
11
cout
<< "Dot product: " << v.dot(w) << endl;
13
cout
<< "Dot product via a matrix product: " << dp << endl;
14
cout
<< "Cross product:\n" << v.cross(w) << endl;
Completed in 80 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>