/external/ImageMagick/Magick++/tests/ |
D | attributes.cpp | 40 cout << "Line: " << __LINE__ << ", textAntiAlias default not true" << endl; in main() 48 cout << "Line: " << __LINE__ << ", textAntiAlias not false" << endl; in main() 56 cout << "Line: " << __LINE__ << ", textAntiAlias not true" << endl; in main() 68 << ", adjoin default not 'true' as expected" << endl; in main() 76 cout << "Line: " << __LINE__ << ", adjoin failed set to 'false'" << endl; in main() 84 cout << "Line: " << __LINE__ << ", adjoin failed set to 'true'" << endl; in main() 97 << ") not 0 as expected" << endl; in main() 106 << ", failed to set animationDelay to 0" << endl; in main() 115 << ", failed to set animationDelay to 100" << endl; in main() 130 << ") not 0 as expected" << endl; in main() [all …]
|
/external/eigen/doc/examples/ |
D | TutorialInplaceLU.cpp | 3 init() { std::cout << "[" << "init" << "]" << std::endl; } in init() 17 cout << "Here is the input matrix A before decomposition:\n" << A << endl; in main() 18 cout << "[init]" << endl; in main() 20 cout << "[declaration]" << endl; in main() 22 cout << "Here is the input matrix A after decomposition:\n" << A << endl; in main() 23 cout << "[declaration]" << endl; in main() 25 cout << "[matrixLU]" << endl; in main() 26 cout << "Here is the matrix storing the L and U factors:\n" << lu.matrixLU() << endl; in main() 27 cout << "[matrixLU]" << endl; in main() 29 cout << "[solve]" << endl; in main() [all …]
|
D | Tutorial_ArrayClass_interop_matrix.cpp | 19 cout << "-- Matrix m*n: --" << endl << result << endl << endl; in main() 21 cout << "-- Array m*n: --" << endl << result << endl << endl; in main() 23 cout << "-- With cwiseProduct: --" << endl << result << endl << endl; in main() 25 cout << "-- Array m + 4: --" << endl << result << endl << endl; in main()
|
/external/ImageMagick/Magick++/demo/ |
D | demo.cpp | 49 cout << "Read images ..." << endl; in main() 63 cout << "Creating thumbnails..." << endl; in main() 79 cout << " add noise ..." << endl; in main() 84 cout << " add noise (blue) ..." << endl; in main() 90 cout << " annotate ..." << endl; in main() 102 cout << " blur ..." << endl; in main() 108 cout << " blur red channel ..." << endl; in main() 114 cout << " border ..." << endl; in main() 121 cout << " channel ..." << endl; in main() 127 cout << " charcoal ..." << endl; in main() [all …]
|
/external/eigen/doc/snippets/ |
D | ComplexEigenSolver_compute.cpp | 2 cout << "Here is a random 4x4 matrix, A:" << endl << A << endl << endl; 6 cout << "The eigenvalues of A are:" << endl << ces.eigenvalues() << endl; 7 cout << "The matrix of eigenvectors, V, is:" << endl << ces.eigenvectors() << endl << endl; 10 cout << "Consider the first eigenvalue, lambda = " << lambda << endl; 12 cout << "If v is the corresponding eigenvector, then lambda * v = " << endl << lambda * v << endl; 13 cout << "... and A * v = " << endl << A * v << endl << endl; 15 cout << "Finally, V * D * V^(-1) = " << endl 16 << ces.eigenvectors() * ces.eigenvalues().asDiagonal() * ces.eigenvectors().inverse() << endl;
|
D | SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType2.cpp | 3 cout << "Here is a random symmetric matrix, A:" << endl << A << endl; 6 cout << "and a random postive-definite matrix, B:" << endl << B << endl << endl; 9 cout << "The eigenvalues of the pencil (A,B) are:" << endl << es.eigenvalues() << endl; 10 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl; 13 cout << "Consider the first eigenvalue, lambda = " << lambda << endl; 15 cout << "If v is the corresponding eigenvector, then A * v = " << endl << A * v << endl; 16 cout << "... and lambda * B * v = " << endl << lambda * B * v << endl << endl;
|
D | EigenSolver_EigenSolver_MatrixType.cpp | 2 cout << "Here is a random 6x6 matrix, A:" << endl << A << endl << endl; 5 cout << "The eigenvalues of A are:" << endl << es.eigenvalues() << endl; 6 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl; 9 cout << "Consider the first eigenvalue, lambda = " << lambda << endl; 11 cout << "If v is the corresponding eigenvector, then lambda * v = " << endl << lambda * v << endl; 12 cout << "... and A * v = " << endl << A.cast<complex<double> >() * v << endl << endl; 16 cout << "Finally, V * D * V^(-1) = " << endl << V * D * V.inverse() << endl;
|
D | SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp | 3 cout << "Here is a random symmetric 5x5 matrix, A:" << endl << A << endl << endl; 6 cout << "The eigenvalues of A are:" << endl << es.eigenvalues() << endl; 7 cout << "The matrix of eigenvectors, V, is:" << endl << es.eigenvectors() << endl << endl; 10 cout << "Consider the first eigenvalue, lambda = " << lambda << endl; 12 cout << "If v is the corresponding eigenvector, then lambda * v = " << endl << lambda * v << endl; 13 cout << "... and A * v = " << endl << A * v << endl << endl; 17 cout << "Finally, V * D * V^(-1) = " << endl << V * D * V.inverse() << endl;
|
D | HouseholderSequence_HouseholderSequence.cpp | 2 cout << "The matrix v is:" << endl; 3 cout << v << endl; 6 cout << "The first Householder vector is: v_0 = " << v0.transpose() << endl; 8 cout << "The second Householder vector is: v_1 = " << v1.transpose() << endl; 10 cout << "The third Householder vector is: v_2 = " << v2.transpose() << endl; 13 cout << "The Householder coefficients are: h = " << h.transpose() << endl; 16 cout << "The first Householder reflection is represented by H_0 = " << endl; 17 cout << H0 << endl; 19 cout << "The second Householder reflection is represented by H_1 = " << endl; 20 cout << H1 << endl; [all …]
|
D | DirectionWise_hnormalized.cpp | 4 cout << "The matrix M is:" << endl << M << endl << endl; 5 cout << "M.colwise().hnormalized():" << endl << M.colwise().hnormalized() << endl << endl; 6 cout << "P*M:" << endl << P*M << endl << endl; 7 cout << "(P*M).colwise().hnormalized():" << endl << (P*M).colwise().hnormalized() << endl << endl;
|
D | VectorwiseOp_homogeneous.cpp | 4 cout << "The matrix M is:" << endl << M << endl << endl; 5 cout << "M.colwise().homogeneous():" << endl << M.colwise().homogeneous() << endl << endl; 6 cout << "P * M.colwise().homogeneous():" << endl << P * M.colwise().homogeneous() << endl << endl; 7 …().homogeneous().hnormalized(): " << endl << (P * M.colwise().homogeneous()).colwise().hnormalized…
|
D | JacobiSVD_basic.cpp | 2 cout << "Here is the matrix m:" << endl << m << endl; 4 cout << "Its singular values are:" << endl << svd.singularValues() << endl; 5 …"Its left singular vectors are the columns of the thin U matrix:" << endl << svd.matrixU() << endl; 6 …Its right singular vectors are the columns of the thin V matrix:" << endl << svd.matrixV() << endl; 8 cout << "Now consider this rhs vector:" << endl << rhs << endl; 9 cout << "A least-squares solution of m*x = rhs is:" << endl << svd.solve(rhs) << endl;
|
D | Vectorwise_reverse.cpp | 2 cout << "Here is the matrix m:" << endl << m << endl; 3 cout << "Here is the rowwise reverse of m:" << endl << m.rowwise().reverse() << endl; 4 cout << "Here is the colwise reverse of m:" << endl << m.colwise().reverse() << endl; 6 cout << "Here is the coefficient (1,0) in the rowise reverse of m:" << endl 7 << m.rowwise().reverse()(1,0) << endl; 8 cout << "Let us overwrite this coefficient with the value 4." << endl; 10 cout << "Now the matrix m is:" << endl << m << endl;
|
D | Tridiagonalization_diagonal.cpp | 3 cout << "Here is a random self-adjoint 4x4 matrix:" << endl << A << endl << endl; 7 cout << "The tridiagonal matrix T is:" << endl << T << endl << endl; 9 cout << "We can also extract the diagonals of T directly ..." << endl; 11 cout << "The diagonal is:" << endl << diag << endl; 13 cout << "The subdiagonal is:" << endl << subdiag << endl;
|
D | 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;
|
D | TopicAliasing_cwise.cpp | 3 cout << "Here is the matrix mat:\n" << mat << endl << endl; 6 cout << "After 'mat = 2 * mat', mat = \n" << mat << endl << endl; 10 cout << "After the subtraction, it becomes\n" << mat << endl << endl; 15 cout << "After squaring, it becomes\n" << arr << endl << endl; 20 cout << "Doing everything at once yields\n" << mat << endl << endl;
|
/external/gemmlowp/meta/ |
D | streams.h | 127 << leftovers << std::endl; in Pack() 131 std::cerr << "FATAL: RowMajorWithSum::Pack not implemented." << std::endl; in Pack() 158 std::cout << "RowMajor(" << typeid(InType).name() << ")" << std::endl; in Debug() 160 << leftovers << std::endl; in Debug() 161 std::cout << " scratch: " << Scratch(params) << std::endl; in Debug() 162 std::cout << " unpacked advance: " << UnpackedAdvance(params) << std::endl; in Debug() 163 std::cout << " packed advance: " << PackedAdvance(params) << std::endl; in Debug() 164 std::cout << " unpacked stride: " << UnpackedStride(params) << std::endl; in Debug() 165 std::cout << " packed stride: " << PackedStride(params) << std::endl; in Debug() 166 std::cout << " params:" << std::endl; in Debug() [all …]
|
D | quantized_mul_kernels.h | 47 << "x" << k << std::endl; in Multiply() 52 << "implemented." << std::endl; in Multiply() 63 << std::endl; in Debug() 64 std::cout << " params:" << std::endl; in Debug() 66 << params.kernel.multiplicative_offset << std::endl; in Debug() 68 << std::endl; in Debug() 69 std::cout << " kernel.shift: " << params.kernel.shift << std::endl; in Debug() 70 std::cout << " kernel.count: " << params.kernel.count << std::endl; in Debug() 72 << std::endl; in Debug() 96 << "x" << k << std::endl; in Multiply() [all …]
|
/external/eigen/bench/btl/data/ |
D | mean.cxx | 109 cout << "<TABLE BORDER CELLPADDING=2>" << endl ; in main() 110 cout << " <TR>" << endl ; in main() 111 cout << " <TH ALIGN=CENTER> " << argv[1] << " </TH>" << endl ; in main() 112 …TH ALIGN=CENTER> <a href=""#mean_marker""> in cache <BR> mean perf <BR> Mflops </a></TH>" << endl ; in main() 113 cout << " <TH ALIGN=CENTER> in cache <BR> % best </TH>" << endl ; in main() 114 …LIGN=CENTER> <a href=""#mean_marker""> out of cache <BR> mean perf <BR> Mflops </a></TH>" << endl ; in main() 115 cout << " <TH ALIGN=CENTER> out of cache <BR> % best </TH>" << endl ; in main() 116 cout << " <TH ALIGN=CENTER> details </TH>" << endl ; in main() 117 cout << " <TH ALIGN=CENTER> comments </TH>" << endl ; in main() 118 cout << " </TR>" << endl ; in main() [all …]
|
/external/eigen/unsupported/doc/examples/ |
D | PolynomialSolver1.cpp | 13 cout << "Roots: " << roots.transpose() << endl; in main() 18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main() 23 cout << "Real roots: " << mapRR.transpose() << endl; in main() 25 cout << endl; in main() 26 cout << "Illustration of the convergence problem with the QR algorithm: " << endl; in main() 27 cout << "---------------------------------------------------------------" << endl; in main() 31 cout << "Hard case polynomial defined by floats: " << hardCase_polynomial.transpose() << endl; in main() 33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main() 36 …< "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl << endl; in main() 38 cout << "Using double's almost always solves the problem for small degrees: " << endl; in main() [all …]
|
/external/libcxxabi/test/ |
D | test_fallback_malloc.pass.cpp | 73 std::cout << "Constant exhaustion tests" << std::endl; in exhaustion_test1() 77 std::cout << "Allocated " << ptrs.size () << " 32 byte chunks" << std::endl; in exhaustion_test1() 82 std::cout << "----" << std::endl; in exhaustion_test1() 86 std::cout << "Allocated " << ptrs.size () << " 32 byte chunks" << std::endl; in exhaustion_test1() 90 std::cout << "----" << std::endl; in exhaustion_test1() 94 std::cout << "Allocated " << ptrs.size () << " 32 byte chunks" << std::endl; in exhaustion_test1() 104 std::cout << "Growing exhaustion tests" << std::endl; in exhaustion_test2() 108 …:cout << "Allocated " << ptrs.size () << " { 32, 48, 72, 108, 162 ... } byte chunks" << std::endl; in exhaustion_test2() 113 std::cout << "----" << std::endl; in exhaustion_test2() 118 …:cout << "Allocated " << ptrs.size () << " { 32, 48, 72, 108, 162 ... } byte chunks" << std::endl; in exhaustion_test2() [all …]
|
/external/eigen/unsupported/bench/ |
D | bench_svd.cpp | 42 cout << " Only compute Singular Values" <<endl; in bench_svd() 61 cout << " || " << " BDC : " << timerBDC.value() << "s " <<endl <<endl; in bench_svd() 64 …< "KO : BDC is " << timerJacobi.value() / timerBDC.value() << " times faster than Jacobi" <<endl; in bench_svd() 66 …< "OK : BDC is " << timerJacobi.value() / timerBDC.value() << " times faster than Jacobi" <<endl; in bench_svd() 69 cout << " =================" <<endl; in bench_svd() 70 std::cout<< std::endl; in bench_svd() 73 cout << " Computes rotaion matrix" <<endl; in bench_svd() 92 cout << " || " << " BDC : " << timerBDC.value() << "s " <<endl <<endl; in bench_svd() 95 …< "KO : BDC is " << timerJacobi.value() / timerBDC.value() << " times faster than Jacobi" <<endl; in bench_svd() 97 …< "OK : BDC is " << timerJacobi.value() / timerBDC.value() << " times faster than Jacobi" <<endl; in bench_svd() [all …]
|
/external/tensorflow/tensorflow/compiler/xla/tools/ |
D | interactive_graphviz.cc | 181 << std::endl; in DoHelpCommand() 192 << std::endl; in DoBackendConfigCommand() 196 << std::endl; in DoBackendConfigCommand() 208 << std::endl; in DoShowFusionSubcomputationsCommand() 212 << std::endl; in DoShowFusionSubcomputationsCommand() 223 std::cout << "Entry computation:" << std::endl; in DoListComputationsCommand() 224 std::cout << " " << module.entry_computation()->name() << std::endl in DoListComputationsCommand() 225 << std::endl; in DoListComputationsCommand() 227 std::cout << "Subcomputations:" << std::endl; in DoListComputationsCommand() 233 std::cout << " " << computation->name() << std::endl; in DoListComputationsCommand() [all …]
|
/external/bcc/examples/usdt_sample/usdt_sample_app1/ |
D | main.cpp | 21 std::cout << "Usage:" << std::endl; in print_usage() 24 << std::endl; in print_usage() 25 …d::cout << "InputPrefix: Prefix of the input string to the operation. Default: dummy" << std::endl; in print_usage() 26 …Minimum number to make the input string to the operation somewhat unique. Default: 1" << std::endl; in print_usage() 27 …aximum number to make the input string to the operation somewhat unique. Default: 50" << std::endl; in print_usage() 28 std::cout << "CallsPerSec: Rate of calls to the operation. Default: 10" << std::endl; in print_usage() 29 …d::cout << "MinimumLatencyMs: Minimum latency to apply to the operation. Default: 20" << std::endl; in print_usage() 30 …d::cout << "MaximumLatencyMs: Maximum latency to apply to the operation. Default: 40" << std::endl; in print_usage() 68 std::cout << "Exception while reading arguments: " << exc.what() << std::endl; in main() 73 std::cout << "Unknown exception while reading arguments." << std::endl; in main() [all …]
|
/external/eigen/bench/ |
D | benchmark-blocking-sizes.cpp | 234 cout << "contents of /proc/cpuinfo:" << endl; in print_cpuinfo() 239 cout << line << endl; in print_cpuinfo() 243 cout << endl; in print_cpuinfo() 245 cout << "output of sysctl hw:" << endl; in print_cpuinfo() 247 cout << endl; in print_cpuinfo() 279 cerr << "usage: " << argv[0] << " <action> [options...]" << endl << endl; in show_usage_and_exit() 280 cerr << "available actions:" << endl << endl; in show_usage_and_exit() 282 cerr << " " << (*it)->invokation_name() << endl; in show_usage_and_exit() 284 cerr << endl; in show_usage_and_exit() 285 cerr << "options:" << endl << endl; in show_usage_and_exit() [all …]
|