| /external/eigen/test/ |
| D | rand.cpp | 60 signed char char_offset = (std::min)(g_repeat,64); in test_rand()
61 signed char short_offset = (std::min)(g_repeat,16000); in test_rand()
63 for(int i = 0; i < g_repeat*10000; i++) { in test_rand()
99 CALL_SUBTEST(check_all_in_range<int>(11,11+g_repeat)); in test_rand()
101 CALL_SUBTEST(check_all_in_range<int>(-11-g_repeat,-11)); in test_rand()
102 CALL_SUBTEST(check_all_in_range<int>(-673456,-673456+g_repeat)); in test_rand()
103 CALL_SUBTEST(check_all_in_range<int>(673456,673456+g_repeat)); in test_rand()
106 CALL_SUBTEST(check_all_in_range<long>(11,11+g_repeat)); in test_rand()
108 CALL_SUBTEST(check_all_in_range<long>(-11-g_repeat,-11)); in test_rand()
109 CALL_SUBTEST(check_all_in_range<long>(-long_ref,-long_ref+g_repeat)); in test_rand()
[all …]
|
| D | prec_inverse_4x4.cpp | 74 CALL_SUBTEST_1(( inverse_general_4x4<Matrix4f>(200000 * g_repeat) )); in test_prec_inverse_4x4()
75 CALL_SUBTEST_1(( inverse_general_4x4<Matrix<float,4,4,RowMajor> >(200000 * g_repeat) )); in test_prec_inverse_4x4()
78 CALL_SUBTEST_2(( inverse_general_4x4<Matrix<double,4,4,ColMajor> >(200000 * g_repeat) )); in test_prec_inverse_4x4()
79 CALL_SUBTEST_2(( inverse_general_4x4<Matrix<double,4,4,RowMajor> >(200000 * g_repeat) )); in test_prec_inverse_4x4()
82 CALL_SUBTEST_3((inverse_general_4x4<Matrix4cf>(50000 * g_repeat))); in test_prec_inverse_4x4()
|
| D | dynalloc.cpp | 130 for (int i=0; i<g_repeat*100; ++i) in test_dynalloc()
140 for (int i=0; i<g_repeat*100; ++i) in test_dynalloc()
156 for (int i=0; i<g_repeat*100; ++i) in test_dynalloc()
166 for (int i=0; i<g_repeat*100; ++i) in test_dynalloc()
|
| D | array_for_matrix.cpp | 265 for(int i = 0; i < g_repeat; i++) { in test_array_for_matrix()
273 for(int i = 0; i < g_repeat; i++) { in test_array_for_matrix()
280 for(int i = 0; i < g_repeat; i++) { in test_array_for_matrix()
287 for(int i = 0; i < g_repeat; i++) { in test_array_for_matrix()
297 for(int i = 0; i < g_repeat; i++) { in test_array_for_matrix()
|
| D | sparse_solver.h | 282 for (int i = 0; i < g_repeat; i++) {
365 for (int i = 0; i < g_repeat; i++) { in check_sparse_spd_determinant()
412 for (int i = 0; i < g_repeat; i++) {
483 for (int i = 0; i < g_repeat; i++) { in check_sparse_square_determinant()
506 for (int i = 0; i < g_repeat; i++) { in check_sparse_square_abs_determinant()
544 for (int i = 0; i < g_repeat; i++) { in check_sparse_leastsquare_solving()
|
| D | qr.cpp | 107 for(int i = 0; i < g_repeat; i++) { in test_qr()
116 for(int i = 0; i < g_repeat; i++) { in test_qr()
|
| D | product_large.cpp | 35 for(int i = 0; i < g_repeat; i++) { in test_product_large()
103 for(int i = 0; i < g_repeat; i++) { in test_product_large()
|
| D | visitor.cpp | 120 for(int i = 0; i < g_repeat; i++) { in test_visitor()
128 for(int i = 0; i < g_repeat; i++) { in test_visitor()
|
| D | main.h | 131 static int g_repeat; variable
656 g_repeat = int(strtoul(str, 0, 10));
657 if(errno || g_repeat <= 0)
728 if(!g_has_set_repeat) g_repeat = DEFAULT_REPEAT;
735 std::cout << "Repeating each test " << g_repeat << " times" << std::endl;
|
| D | upperbidiagonalization.cpp | 34 for(int i = 0; i < g_repeat; i++) { in test_upperbidiagonalization()
|
| D | numext.cpp | 21 for(int k=0; k<g_repeat*100; ++k) in check_abs()
|
| D | miscmatrices.cpp | 40 for(int i = 0; i < g_repeat; i++) { in test_miscmatrices()
|
| D | constructor.cpp | 42 for(int i = 0; i < g_repeat; i++) { in test_constructor()
|
| D | special_numbers.cpp | 54 for(int i = 0; i < 10*g_repeat; i++) { in test_special_numbers()
|
| D | hessenberg.cpp | 19 for(int counter = 0; counter < g_repeat; ++counter) { in hessenberg()
|
| D | ctorleak.cpp | 41 for(int i = 0; i < g_repeat; i++) { in test_ctorleak()
|
| D | qr_colpivoting.cpp | 305 for(int i = 0; i < g_repeat; i++) { in test_qr_colpivoting()
314 for(int i = 0; i < g_repeat; i++) { in test_qr_colpivoting()
323 for(int i = 0; i < g_repeat; i++) { in test_qr_colpivoting()
|
| D | smallvectors.cpp | 62 for(int i = 0; i < g_repeat; i++) { in test_smallvectors()
|
| D | selfadjoint.cpp | 58 for(int i = 0; i < g_repeat ; i++) in test_selfadjoint()
|
| D | array.cpp | 456 for(int i = 0; i < g_repeat; i++) { in test_array()
464 for(int i = 0; i < g_repeat; i++) { in test_array()
471 for(int i = 0; i < g_repeat; i++) { in test_array()
478 for(int i = 0; i < g_repeat; i++) { in test_array()
484 for(int i = 0; i < g_repeat; i++) { in test_array()
|
| D | eigen2support.cpp | 58 for(int i = 0; i < g_repeat; i++) { in test_eigen2support()
|
| D | determinant.cpp | 56 for(int i = 0; i < g_repeat; i++) { in test_determinant()
|
| D | real_qz.cpp | 82 for(int i = 0; i < g_repeat; i++) { in test_real_qz()
|
| /external/eigen/unsupported/test/ |
| D | matrix_power.cpp | 76 for (int i=0; i < g_repeat; ++i) { in testGeneral()
111 for (int i=0; i < g_repeat; ++i) { in testSingular()
142 for (int i=0; i < g_repeat; ++i) { in testLogThenExp()
|
| D | matrix_square_root.cpp | 23 for (int i = 0; i < g_repeat; i++) { in test_matrix_square_root()
|