OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:cout
(Results
226 - 250
of
770
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/eigen/doc/examples/
QuickStart_example2_dynamic.cpp
11
cout
<< "m =" << endl << m << endl;
14
cout
<< "m * v =" << endl << m * v << endl;
QuickStart_example2_fixed.cpp
11
cout
<< "m =" << endl << m << endl;
14
cout
<< "m * v =" << endl << m * v << endl;
tut_arithmetic_add_sub.cpp
14
std::
cout
<< "a + b =\n" << a + b << std::endl;
15
std::
cout
<< "a - b =\n" << a - b << std::endl;
16
std::
cout
<< "Doing a += b;" << std::endl;
18
std::
cout
<< "Now a =\n" << a << std::endl;
21
std::
cout
<< "-v + w - v =\n" << -v + w - v << std::endl;
Tutorial_BlockOperations_block_assignment.cpp
13
cout
<< "Here is the array a:" << endl << a << endl << endl;
15
cout
<< "Here is now a with m copied into its central 2x2 block:" << endl << a << endl << endl;
17
cout
<< "Here is now a with bottom-right 2x3 block copied into top-left 2x2 block:" << endl << a << endl << endl;
/external/eigen/doc/snippets/
ComplexSchur_compute.cpp
4
cout
<< "The matrix T in the decomposition of A is:" << endl << schur.matrixT() << endl;
6
cout
<< "The matrix T in the decomposition of A^(-1) is:" << endl << schur.matrixT() << endl;
ComplexSchur_matrixT.cpp
2
cout
<< "Here is a random 4x4 matrix, A:" << endl << A << endl << endl;
4
cout
<< "The triangular matrix T is:" << endl << schurOfA.matrixT() << endl;
Jacobi_makeGivens.cpp
4
cout
<< "Here is the vector v:" << endl << v << endl;
6
cout
<< "Here is the vector J' * v:" << endl << v << endl
Jacobi_makeJacobi.cpp
5
cout
<< "Here is the matrix m:" << endl << m << endl;
8
cout
<< "Here is the matrix J' * m * J:" << endl << m << endl
Map_placement_new.cpp
3
cout
<< "The mapped vector v is: " << v << "\n";
5
cout
<< "Now v is: " << v << "\n"
MatrixBase_diagonal_int.cpp
2
cout
<< "Here is the matrix m:" << endl << m << endl;
3
cout
<< "Here are the coefficients on the 1st super-diagonal and 2nd sub-diagonal of m:" << endl
MatrixBase_diagonal_template_int.cpp
2
cout
<< "Here is the matrix m:" << endl << m << endl;
3
cout
<< "Here are the coefficients on the 1st super-diagonal and 2nd sub-diagonal of m:" << 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;
PartialRedux_count.cpp
2
cout
<< "Here is the matrix m:" << endl << m << endl;
3
cout
<< "Here is the count of elements larger or equal than 0.5 of each row:" << endl << (m.array() >= 0.5).rowwise().count() << endl;
RealSchur_compute.cpp
4
cout
<< "The matrix T in the decomposition of A is:" << endl << schur.matrixT() << endl;
6
cout
<< "The matrix T in the decomposition of A^(-1) is:" << endl << schur.matrixT() << endl;
TopicAliasing_block.cpp
3
cout
<< "Here is the matrix mat:\n" << mat << endl;
7
cout
<< "After the assignment, mat = \n" << mat << endl;
TopicAliasing_block_correct.cpp
3
cout
<< "Here is the matrix mat:\n" << mat << endl;
7
cout
<< "After the assignment, mat = \n" << mat << endl;
Tridiagonalization_householderCoefficients.cpp
3
cout
<< "Here is a random symmetric 4x4 matrix:" << endl << A << endl;
6
cout
<< "The vector of Householder coefficients is:" << endl << hc << endl;
Tutorial_AdvancedInitialization_CommaTemporary.cpp
2
std::
cout
<< mat << std::endl << std::endl;
4
std::
cout
<< mat << std::endl;
tut_matrix_assignment_resizing.cpp
2
std::
cout
<< "a is of size " << a.rows() << "x" << a.cols() << std::endl;
5
std::
cout
<< "a is now of size " << a.rows() << "x" << a.cols() << std::endl;
IOFormat.cpp
10
std::
cout
<< m1 << sep;
11
std::
cout
<< m1.format(CommaInitFmt) << sep;
12
std::
cout
<< m1.format(CleanFmt) << sep;
13
std::
cout
<< m1.format(OctaveFmt) << sep;
14
std::
cout
<< m1.format(HeavyFmt) << sep;
MatrixBase_marked.cpp
7
cout
<< "Here is the matrix m:" << endl << m << endl;
10
cout
<< "Here is the matrix n:" << endl << n << endl;
11
cout
<< "And now here is m.inverse()*n, taking advantage of the fact that"
/external/eigen/bench/
check_cache_queries.cpp
13
std::
cout
<< "The code " << CODE << " gives " \
20
cout
<< "Eigen's L1 = " << internal::queryL1CacheSize() << endl;
21
cout
<< "Eigen's L2/L3 = " << internal::queryTopLevelCacheSize() << endl;
24
cout
<< "Eigen's L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
38
cout
<< endl;
39
cout
<< "vendor id = " << string_char << endl;
40
cout
<< endl;
44
cout
<< "Eigen's intel codes L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
48
cout
<< "Eigen's intel direct L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
51
cout
<< "Eigen's amd L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl
[
all
...]
/ndk/tests/device/issue39680-chrono-resolution/jni/
issue39680-chrono-resolution.cpp
21
cout
<< "- precision: ";
27
cout
<< fixed << double(TT::num)/TT::den
33
cout
<< fixed << double(P::num)/P::den << " seconds" << endl;
36
cout
<< "- is_steady: " << boolalpha << C::is_steady << endl;
43
std::
cout
<< "system_clock: " << std::endl;
45
std::
cout
<< "\nhigh_resolution_clock: " << std::endl;
47
std::
cout
<< "\nsteady_clock: " << std::endl;
/external/eigen/unsupported/doc/examples/
MatrixSquareRoot.cpp
13
std::
cout
<< "The matrix A is:\n" << A << "\n\n";
14
std::
cout
<< "The matrix square root of A is:\n" << A.sqrt() << "\n\n";
15
std::
cout
<< "The square of the last matrix is:\n" << A.sqrt() * A.sqrt() << "\n";
/external/eigen/bench/spbench/
spbenchsolver.cpp
5
cout
<< " \nbenchsolver : performs a benchmark of all the solvers available in Eigen \n\n";
6
cout
<< " MATRIX FOLDER : \n";
7
cout
<< " The matrices for the benchmark should be collected in a folder specified with an environment variable EIGEN_MATRIXDIR \n";
8
cout
<< " This folder should contain the subfolders real/ and complex/ : \n";
9
cout
<< " The matrices are stored using the matrix market coordinate format \n";
10
cout
<< " The matrix and associated right-hand side (rhs) files are named respectively \n";
11
cout
<< " as MatrixName.mtx and MatrixName_b.mtx. If the rhs does not exist, a random one is generated. \n";
12
cout
<< " If a matrix is SPD, the matrix should be named as MatrixName_SPD.mtx \n";
13
cout
<< " If a true solution exists, it should be named as MatrixName_x.mtx; \n" ;
14
cout
<< " it will be used to compute the norm of the error relative to the computed solutions\n\n"
[
all
...]
Completed in 68 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>