| /external/stlport/test/eh/ |
| D | locale.cpp | 17 cout.imbue(sys); in main()
19 cout<<"Locale name is: "<<sys.name().c_str()<<'\n'; in main()
21 cout<<"Enter real number:"; in main()
24 cout<<value<<'\n'; in main()
31 const numpunct<char>& num_punct=use_facet<numpunct<char> >(cout.getloc()); in main()
32 cout << num_punct.decimal_point() << '\n'; in main()
34 use_facet<time_put<char, ostreambuf_iterator<char, char_traits<char> > > >(cout.getloc()); in main()
35 time_fac.put(cout, cout, NULL, cur_time, 'x'); cout<<'\n'; in main()
36 time_fac.put(cout, cout, NULL, cur_time, 'x', '#'); cout<<'\n'; in main()
37 time_fac.put(cout, cout, NULL, cur_time, 'X'); cout<<'\n'; in main()
[all …]
|
| /external/astl/tests/ |
| D | test_iostream.cpp | 43 mPassed = std::cout.precision() == 6; in A()
56 EXPECT_TRUE(std::cout.precision() == 6); in testOstream()
59 std::cout.precision(20); in testOstream()
62 EXPECT_TRUE(std::cout.precision() == 20); in testOstream()
65 std::cout.precision(6); in testOstream()
71 std::cout << "Hi from stdout\n"; in testCoutCerr()
77 std::cout << "line 1" << std::endl in testManip()
84 using std::cout; in testOutputFormat()
86 cout << endl << "Int: " << numeric_limits<int>::max() << endl; in testOutputFormat()
87 cout << "Negative int: " << numeric_limits<int>::min() << endl; in testOutputFormat()
[all …]
|
| /external/eigen/doc/snippets/ |
| 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 | TopicStorageOrders_example.cpp | 5 cout << "The matrix A:" << endl;
6 cout << Acolmajor << endl << endl;
8 cout << "In memory (column-major):" << endl;
10 cout << *(Acolmajor.data() + i) << " ";
11 cout << endl << endl;
14 cout << "In memory (row-major):" << endl;
16 cout << *(Arowmajor.data() + i) << " ";
17 cout << endl;
|
| D | class_FullPivLU.cpp | 4 cout << "Here is the matrix m:" << endl << m << endl;
6 cout << "Here is, up to permutations, its LU decomposition matrix:"
8 cout << "Here is the L part:" << endl;
11 cout << l << endl;
12 cout << "Here is the U part:" << endl;
14 cout << u << endl;
15 cout << "Let us now reconstruct the original matrix m:" << endl;
16 cout << lu.permutationP().inverse() * l * u * lu.permutationQ().inverse() << endl;
|
| /external/eigen/bench/ |
| D | check_cache_queries.cpp | 13 std::cout << "The code " << CODE << " gives " \
20 cout << "Eigen's L1 = " << internal::queryL1CacheSize() << endl; in main()
21 cout << "Eigen's L2/L3 = " << internal::queryTopLevelCacheSize() << endl; in main()
24 cout << "Eigen's L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl; in main()
38 cout << endl; in main()
39 cout << "vendor id = " << string_char << endl; in main()
40 cout << endl; in main()
44 cout << "Eigen's intel codes L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl; in main()
48 cout << "Eigen's intel direct L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl; in main()
51 cout << "Eigen's amd L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl; in main()
[all …]
|
| D | spmv.cpp | 76 …std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeat… in main()
80 …std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. … in main()
89 std::cout << "nnz: " << nnzPerCol << "\n"; in main()
100 std::cout << "Dense " << t.value()/repeats << "\t"; in main()
103 std::cout << t.value()/repeats << endl; in main()
110 std::cout << "Eigen " << t.value()/repeats << "\t"; in main()
113 std::cout << t.value()/repeats << endl; in main()
119 std::cout << "CSparse \n"; in main()
143 std::cout << "OSKI " << t.value()/repeats << "\t"; in main()
146 std::cout << t.value()/repeats << "\n"; in main()
[all …]
|
| D | product_threshold.cpp | 30 if(mode==InnerProduct) std::cout << "i"; in print_mode()
31 if(mode==OuterProduct) std::cout << "o"; in print_mode()
32 if(mode==CoeffBasedProductMode) std::cout << "c"; in print_mode()
33 if(mode==LazyCoeffBasedProductMode) std::cout << "l"; in print_mode()
34 if(mode==GemvProduct) std::cout << "v"; in print_mode()
35 if(mode==GemmProduct) std::cout << "m"; in print_mode()
66 std::cout << int(1e-6*n*rep/t.best()) << "\t"; in bench_prod()
78 std::cout << "K=" << K << "\t"; in run()
80 std::cout << "\n"; in run()
83 std::cout << "\n\n"; in run()
[all …]
|
| D | benchBlasGemm.cpp | 81 std::cout << "Usage: " << argv[0] << " size \n"; in main()
82 std::cout << "Usage: " << argv[0] << " auto size\n"; in main()
83 std::cout << "Usage: " << argv[0] << " size nbloops nbtries\n"; in main()
84 std::cout << "Usage: " << argv[0] << " M N K nbloops nbtries\n"; in main()
85 std::cout << "Usage: " << argv[0] << " check\n"; in main()
86 std::cout << "Options:\n"; in main()
87 std::cout << " size unique size of the 2 matrices (integer)\n"; in main()
88 std::cout << " auto automatically set the number of repetitions and tries\n"; in main()
89 std::cout << " nbloops number of times the GEMM routines is executed\n"; in main()
90 std::cout << " nbtries number of times the loop is benched (return the best try)\n"; in main()
[all …]
|
| D | sparse_trisolver.cpp | 80 std::cout << "Eigen Dense\t" << density*100 << "%\n"; in main()
87 std::cout << " colmajor^-1 * b:\t" << timer.value() << endl; in main()
91 std::cout << " rowmajor^-1 * b:\t" << timer.value() << endl; in main()
98 std::cout << "Eigen sparse\t" << density*100 << "%\n"; in main()
102 std::cout << " colmajor^-1 * b:\t" << timer.value() << endl; in main()
106 std::cout << " rowmajor^-1 * b:\t" << timer.value() << endl; in main()
125 std::cout << "CSparse \t" << density*100 << "%\n"; in main()
130 std::cout << " colmajor^-1 * b:\t" << timer.value() << endl; in main()
137 std::cout << "GMM++ sparse\t" << density*100 << "%\n"; in main()
148 std::cout << " colmajor^-1 * b:\t" << timer.value() << endl; in main()
[all …]
|
| D | sparse_product.cpp | 118 std::cout << "Eigen Dense\t" << nnzPerCol << "%\n"; in main()
128 std::cout << " a * b:\t" << timer.value() << endl; in main()
135 std::cout << " a' * b:\t" << timer.value() << endl; in main()
142 std::cout << " a' * b':\t" << timer.value() << endl; in main()
149 std::cout << " a * b':\t" << timer.value() << endl; in main()
155 …std::cout << "Eigen sparse\t" << sm1.nonZeros()/(float(sm1.rows())*float(sm1.cols()))*100 << "% * " in main()
159 std::cout << " a * b:\t" << timer.value() << endl; in main()
227 std::cout << "CSparse \t" << nnzPerCol << "%\n"; in main()
244 std::cout << " a * b:\t" << timer.value() << endl; in main()
253 std::cout << "ublas\t" << nnzPerCol << "%\n"; in main()
[all …]
|
| D | sparse_dense_product.cpp | 71 std::cout << "Eigen Dense\t" << density*100 << "%\n"; in main()
80 …std::cout << " a * v:\t" << timer.best() << " " << double(REPEAT)/timer.best() << " * / sec " <… in main()
87 std::cout << " a' * v:\t" << timer.best() << endl; in main()
93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n"; in main()
96 …std::cout << " a * v:\t" << timer.best()/REPEAT << " " << double(REPEAT)/timer.best(REAL_TIMER)… in main()
101 std::cout << " a' * v:\t" << timer.best()/REPEAT << endl; in main()
118 std::cout << "GMM++ sparse\t" << density*100 << "%\n"; in main()
128 std::cout << " a * v:\t" << timer.value() << endl; in main()
131 std::cout << " a' * v:\t" << timer.value() << endl; in main()
137 std::cout << "ublas sparse\t" << density*100 << "%\n"; in main()
[all …]
|
| /external/eigen/bench/spbench/ |
| D | spbenchsolver.cpp | 5 cout<< " \nbenchsolver : performs a benchmark of all the solvers available in Eigen \n\n"; in bench_printhelp()
6 cout<< " MATRIX FOLDER : \n"; in bench_printhelp()
7 …cout<< " The matrices for the benchmark should be collected in a folder specified with an environm… in bench_printhelp()
8 cout<< " This folder should contain the subfolders real/ and complex/ : \n"; in bench_printhelp()
9 cout<< " The matrices are stored using the matrix market coordinate format \n"; in bench_printhelp()
10 cout<< " The matrix and associated right-hand side (rhs) files are named respectively \n"; in bench_printhelp()
11 …cout<< " as MatrixName.mtx and MatrixName_b.mtx. If the rhs does not exist, a random one is genera… in bench_printhelp()
12 cout<< " If a matrix is SPD, the matrix should be named as MatrixName_SPD.mtx \n"; in bench_printhelp()
13 cout<< " If a true solution exists, it should be named as MatrixName_x.mtx; \n" ; in bench_printhelp()
14 … cout<< " it will be used to compute the norm of the error relative to the computed solutions\n\n"; in bench_printhelp()
[all …]
|
| /external/protobuf/gtest/test/ |
| D | gtest_env_var_test_.cc | 43 using ::std::cout;
55 cout << GTEST_FLAG(break_on_failure); in PrintFlag()
60 cout << GTEST_FLAG(catch_exceptions); in PrintFlag()
65 cout << GTEST_FLAG(color); in PrintFlag()
70 cout << GTEST_FLAG(death_test_style); in PrintFlag()
75 cout << GTEST_FLAG(death_test_use_fork); in PrintFlag()
80 cout << GTEST_FLAG(filter); in PrintFlag()
85 cout << GTEST_FLAG(output); in PrintFlag()
90 cout << GTEST_FLAG(print_time); in PrintFlag()
95 cout << GTEST_FLAG(repeat); in PrintFlag()
[all …]
|
| /external/chromium/testing/gtest/test/ |
| D | gtest_env_var_test_.cc | 43 using ::std::cout;
55 cout << GTEST_FLAG(break_on_failure); in PrintFlag()
60 cout << GTEST_FLAG(catch_exceptions); in PrintFlag()
65 cout << GTEST_FLAG(color); in PrintFlag()
70 cout << GTEST_FLAG(death_test_style); in PrintFlag()
75 cout << GTEST_FLAG(death_test_use_fork); in PrintFlag()
80 cout << GTEST_FLAG(filter); in PrintFlag()
85 cout << GTEST_FLAG(output); in PrintFlag()
90 cout << GTEST_FLAG(print_time); in PrintFlag()
95 cout << GTEST_FLAG(repeat); in PrintFlag()
[all …]
|
| /external/gtest/test/ |
| D | gtest_env_var_test_.cc | 43 using ::std::cout;
55 cout << GTEST_FLAG(break_on_failure); in PrintFlag()
60 cout << GTEST_FLAG(catch_exceptions); in PrintFlag()
65 cout << GTEST_FLAG(color); in PrintFlag()
70 cout << GTEST_FLAG(death_test_style); in PrintFlag()
75 cout << GTEST_FLAG(death_test_use_fork); in PrintFlag()
80 cout << GTEST_FLAG(filter); in PrintFlag()
85 cout << GTEST_FLAG(output); in PrintFlag()
90 cout << GTEST_FLAG(print_time); in PrintFlag()
95 cout << GTEST_FLAG(repeat); in PrintFlag()
[all …]
|
| /external/srec/tools/grxmlcompile/ |
| D | testhashmap.cpp | 49 std::cout << "Index 1 has value= " << value <<std::endl; in test1()
51 std::cout << "value " << value << " has index " << i <<std::endl; in test1()
54 std::cout << "index " << i << " has numeric index " << j <<std::endl; in test1()
56 std::cout << "value " << value << " has numeric index " << j <<std::endl; in test1()
76 std::cout << "Index 1 has value= " << value <<std::endl; in test2()
78 std::cout << "value " << value << " has index " << i <<std::endl; in test2()
81 std::cout << "index " << i << " has numeric index " << j <<std::endl; in test2()
83 std::cout << "value " << value << " has numeric index " << j <<std::endl; in test2()
87 std::cout << "First iterator values are " << i <<", " << value <<std::endl; in test2()
89 std::cout << "Iterator values are " << i <<", " << value <<std::endl; in test2()
[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 …cout << " <TH ALIGN=CENTER> <a href=""#mean_marker""> in cache <BR> mean perf <BR> Mflops </a><… in main()
113 cout << " <TH ALIGN=CENTER> in cache <BR> % best </TH>" << endl ; in main()
114 …cout << " <TH ALIGN=CENTER> <a href=""#mean_marker""> out of cache <BR> mean perf <BR> Mflops <… 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 …cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl <… in main()
38 cout << "Using double's almost always solves the problem for small degrees: " << endl; in main()
[all …]
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| D | info.h | 145 ios_base::fmtflags old = cout.setf(ios::left); in PrintPdtInfo()
146 cout.width(50); in PrintPdtInfo()
147 cout << "fst type" << pdtinfo.FstType().c_str() << endl; in PrintPdtInfo()
148 cout.width(50); in PrintPdtInfo()
149 cout << "arc type" << pdtinfo.ArcType().c_str() << endl; in PrintPdtInfo()
150 cout.width(50); in PrintPdtInfo()
151 cout << "# of states" << pdtinfo.NumStates() << endl; in PrintPdtInfo()
152 cout.width(50); in PrintPdtInfo()
153 cout << "# of arcs" << pdtinfo.NumArcs() << endl; in PrintPdtInfo()
154 cout.width(50); in PrintPdtInfo()
[all …]
|
| /external/eigen/doc/ |
| D | tutorial.cpp | 5 std::cout.precision(2); in main()
11 std::cout << "*** Step 1 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
17 std::cout << "*** Step 2 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
23 std::cout << "*** Step 3 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
29 std::cout << "*** Step 4 ***\nm4:\n" << m4 << std::endl; in main()
34 std::cout << "*** Step 5 ***\nm4.diagonal():\n" << m4.diagonal() << std::endl; in main()
35 std::cout << "m4.diagonal().start(3)\n" << m4.diagonal().start(3) << std::endl; in main()
40 std::cout << "*** Step 6 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
43 std::cout << "*** Step 7 ***\n m4.sum(): " << m4.sum() << std::endl; in main()
44 std::cout << "m4.col(2).sum(): " << m4.col(2).sum() << std::endl; in main()
[all …]
|
| /external/eigen/doc/examples/ |
| D | Tutorial_ReductionsVisitorsBroadcasting_reductions_norm.cpp | 18 cout << "v.squaredNorm() = " << v.squaredNorm() << endl; in main()
19 cout << "v.norm() = " << v.norm() << endl; in main()
20 cout << "v.lpNorm<1>() = " << v.lpNorm<1>() << endl; in main()
21 cout << "v.lpNorm<Infinity>() = " << v.lpNorm<Infinity>() << endl; in main()
23 cout << endl; in main()
24 cout << "m.squaredNorm() = " << m.squaredNorm() << endl; in main()
25 cout << "m.norm() = " << m.norm() << endl; in main()
26 cout << "m.lpNorm<1>() = " << m.lpNorm<1>() << endl; in main()
27 cout << "m.lpNorm<Infinity>() = " << m.lpNorm<Infinity>() << endl; in main()
|
| D | Tutorial_ReductionsVisitorsBroadcasting_reductions_bool.cpp | 14 cout << "(a > 0).all() = " << (a > 0).all() << endl; in main()
15 cout << "(a > 0).any() = " << (a > 0).any() << endl; in main()
16 cout << "(a > 0).count() = " << (a > 0).count() << endl; in main()
17 cout << endl; in main()
18 cout << "(a > 2).all() = " << (a > 2).all() << endl; in main()
19 cout << "(a > 2).any() = " << (a > 2).any() << endl; in main()
20 cout << "(a > 2).count() = " << (a > 2).count() << endl; in main()
|
| /external/eigen/bench/btl/generic_bench/utils/ |
| D | utilities.h | 21 # define HEREWEARE cout<<flush ; cerr << __FILE__ << " [" << __LINE__ << "] : " << flush ;
23 # define PYSCRIPT(chain) {cout<<flush ; cerr << "---PYSCRIPT--- " << chain << endl ;}
44 cout << __FILE__ ;\
45 cout << " [" << __LINE__ << "] : " ;\
46 cout << "COMPILED with " << COMPILER ;\
47 cout << ", " << __DATE__ ; \
48 cout << " at " << __TIME__ << endl ;\
49 cout << "\n\n" ;\
50 cout << flush ;\
57 # define HERE cout<<flush ; cerr << "- Trace " << __FILE__ << " [" << __LINE__ << "] : " << flush ;
[all …]
|
| /external/chromium/net/tools/flip_server/ |
| D | flip_in_mem_edsm_server.cc | 28 using std::cout;
175 cout << argv[0] << " <options>\n"; in main()
176 cout << " Proxy options:\n"; in main()
177 cout << "\t--proxy<1..n>=\"<listen ip>,<listen port>," in main()
183 cout << "\t * The https server ip and port may be left empty if they are" in main()
186 cout << "\t * spdy only prevents non-spdy https connections from being" in main()
189 cout << "\t--forward-ip-header=<header name>\n"; in main()
190 cout << "\n Server options:\n"; in main()
191 cout << "\t--spdy-server=\"<listen ip>,<listen port>,[ssl cert filename]," in main()
193 cout << "\t--http-server=\"<listen ip>,<listen port>,[ssl cert filename]," in main()
[all …]
|