自学教程：C++ CALL_SUBTEST_1函数代码示例

void test_special_numbers(){  for(int i = 0; i < 10*g_repeat; i++) {    CALL_SUBTEST_1( special_numbers<float>() );    CALL_SUBTEST_1( special_numbers<double>() );  }}

void test_eigensolver_generic(){  int s = 0;  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( eigensolver(Matrix4f()) );    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);    CALL_SUBTEST_2( eigensolver(MatrixXd(s,s)) );    // some trivial but implementation-wise tricky cases    CALL_SUBTEST_2( eigensolver(MatrixXd(1,1)) );    CALL_SUBTEST_2( eigensolver(MatrixXd(2,2)) );    CALL_SUBTEST_3( eigensolver(Matrix<double,1,1>()) );    CALL_SUBTEST_4( eigensolver(Matrix2d()) );  }  CALL_SUBTEST_1( eigensolver_verify_assert(Matrix4f()) );  s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);  CALL_SUBTEST_2( eigensolver_verify_assert(MatrixXd(s,s)) );  CALL_SUBTEST_3( eigensolver_verify_assert(Matrix<double,1,1>()) );  CALL_SUBTEST_4( eigensolver_verify_assert(Matrix2d()) );  // Test problem size constructors  CALL_SUBTEST_5(EigenSolver<MatrixXf> tmp(s));  // regression test for bug 410  CALL_SUBTEST_2(  {     MatrixXd A(1,1);     A(0,0) = std::sqrt(-1.);     Eigen::EigenSolver<MatrixXd> solver(A);     MatrixXd V(1, 1);     V(0,0) = solver.eigenvectors()(0,0).real();  }  );

void test_stddeque(){  // some non vectorizable fixed sizes  CALL_SUBTEST_1(check_stddeque_matrix(Vector2f()));  CALL_SUBTEST_1(check_stddeque_matrix(Matrix3f()));  CALL_SUBTEST_2(check_stddeque_matrix(Matrix3d()));  // some vectorizable fixed sizes  CALL_SUBTEST_1(check_stddeque_matrix(Matrix2f()));  CALL_SUBTEST_1(check_stddeque_matrix(Vector4f()));  CALL_SUBTEST_1(check_stddeque_matrix(Matrix4f()));  CALL_SUBTEST_2(check_stddeque_matrix(Matrix4d()));  // some dynamic sizes  CALL_SUBTEST_3(check_stddeque_matrix(MatrixXd(1,1)));  CALL_SUBTEST_3(check_stddeque_matrix(VectorXd(20)));  CALL_SUBTEST_3(check_stddeque_matrix(RowVectorXf(20)));  CALL_SUBTEST_3(check_stddeque_matrix(MatrixXcf(10,10)));  // some Transform  CALL_SUBTEST_4(check_stddeque_transform(Affine2f()));  CALL_SUBTEST_4(check_stddeque_transform(Affine3f()));  CALL_SUBTEST_4(check_stddeque_transform(Affine3d()));  // some Quaternion  CALL_SUBTEST_5(check_stddeque_quaternion(Quaternionf()));  CALL_SUBTEST_5(check_stddeque_quaternion(Quaterniond()));}

void test_redux(){  // the max size cannot be too large, otherwise reduxion operations obviously generate large errors.  int maxsize = (std::min)(100,EIGEN_TEST_MAX_SIZE);  EIGEN_UNUSED_VARIABLE(maxsize);  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( matrixRedux(Matrix<float, 1, 1>()) );    CALL_SUBTEST_1( matrixRedux(Array<float, 1, 1>()) );    CALL_SUBTEST_2( matrixRedux(Matrix2f()) );    CALL_SUBTEST_2( matrixRedux(Array2f()) );    CALL_SUBTEST_3( matrixRedux(Matrix4d()) );    CALL_SUBTEST_3( matrixRedux(Array4d()) );    CALL_SUBTEST_4( matrixRedux(MatrixXcf(internal::random<int>(1,maxsize), internal::random<int>(1,maxsize))) );    CALL_SUBTEST_4( matrixRedux(ArrayXXcf(internal::random<int>(1,maxsize), internal::random<int>(1,maxsize))) );    CALL_SUBTEST_5( matrixRedux(MatrixXd (internal::random<int>(1,maxsize), internal::random<int>(1,maxsize))) );    CALL_SUBTEST_5( matrixRedux(ArrayXXd (internal::random<int>(1,maxsize), internal::random<int>(1,maxsize))) );    CALL_SUBTEST_6( matrixRedux(MatrixXi (internal::random<int>(1,maxsize), internal::random<int>(1,maxsize))) );    CALL_SUBTEST_6( matrixRedux(ArrayXXi (internal::random<int>(1,maxsize), internal::random<int>(1,maxsize))) );  }  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_7( vectorRedux(Vector4f()) );    CALL_SUBTEST_7( vectorRedux(Array4f()) );    CALL_SUBTEST_5( vectorRedux(VectorXd(internal::random<int>(1,maxsize))) );    CALL_SUBTEST_5( vectorRedux(ArrayXd(internal::random<int>(1,maxsize))) );    CALL_SUBTEST_8( vectorRedux(VectorXf(internal::random<int>(1,maxsize))) );    CALL_SUBTEST_8( vectorRedux(ArrayXf(internal::random<int>(1,maxsize))) );  }}

void test_mapped_matrix(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( map_class_vector(Matrix<float, 1, 1>()) );    CALL_SUBTEST_1( check_const_correctness(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( map_class_vector(Vector4d()) );    CALL_SUBTEST_2( map_class_vector(VectorXd(13)) );    CALL_SUBTEST_2( check_const_correctness(Matrix4d()) );    CALL_SUBTEST_3( map_class_vector(RowVector4f()) );    CALL_SUBTEST_4( map_class_vector(VectorXcf(8)) );    CALL_SUBTEST_5( map_class_vector(VectorXi(12)) );    CALL_SUBTEST_5( check_const_correctness(VectorXi(12)) );    CALL_SUBTEST_1( map_class_matrix(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( map_class_matrix(Matrix4d()) );    CALL_SUBTEST_11( map_class_matrix(Matrix<float,3,5>()) );    CALL_SUBTEST_4( map_class_matrix(MatrixXcf(internal::random<int>(1,10),internal::random<int>(1,10))) );    CALL_SUBTEST_5( map_class_matrix(MatrixXi(internal::random<int>(1,10),internal::random<int>(1,10))) );    CALL_SUBTEST_6( map_static_methods(Matrix<double, 1, 1>()) );    CALL_SUBTEST_7( map_static_methods(Vector3f()) );    CALL_SUBTEST_8( map_static_methods(RowVector3d()) );    CALL_SUBTEST_9( map_static_methods(VectorXcd(8)) );    CALL_SUBTEST_10( map_static_methods(VectorXf(12)) );  }}

void test_stdlist_overload(){  // some non vectorizable fixed sizes  CALL_SUBTEST_1(check_stdlist_matrix(Vector2f()));  CALL_SUBTEST_1(check_stdlist_matrix(Matrix3f()));  CALL_SUBTEST_2(check_stdlist_matrix(Matrix3d()));  // some vectorizable fixed sizes  CALL_SUBTEST_1(check_stdlist_matrix(Matrix2f()));  CALL_SUBTEST_1(check_stdlist_matrix(Vector4f()));  CALL_SUBTEST_1(check_stdlist_matrix(Matrix4f()));  CALL_SUBTEST_2(check_stdlist_matrix(Matrix4d()));  // some dynamic sizes  CALL_SUBTEST_3(check_stdlist_matrix(MatrixXd(1,1)));  CALL_SUBTEST_3(check_stdlist_matrix(VectorXd(20)));  CALL_SUBTEST_3(check_stdlist_matrix(RowVectorXf(20)));  CALL_SUBTEST_3(check_stdlist_matrix(MatrixXcf(10,10)));  // some Transform  CALL_SUBTEST_4(check_stdlist_transform(Affine2f())); // does not need the specialization (2+1)^2 = 9  CALL_SUBTEST_4(check_stdlist_transform(Affine3f()));  CALL_SUBTEST_4(check_stdlist_transform(Affine3d()));  // some Quaternion  CALL_SUBTEST_5(check_stdlist_quaternion(Quaternionf()));  CALL_SUBTEST_5(check_stdlist_quaternion(Quaterniond()));}

void test_integer_types(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( integer_type_tests(Matrix<unsigned int, 1, 1>()) );    CALL_SUBTEST_1( integer_type_tests(Matrix<unsigned long, 3, 4>()) );    CALL_SUBTEST_2( integer_type_tests(Matrix<long, 2, 2>()) );    CALL_SUBTEST_2( signed_integer_type_tests(Matrix<long, 2, 2>()) );    CALL_SUBTEST_3( integer_type_tests(Matrix<char, 2, Dynamic>(2, 10)) );    CALL_SUBTEST_3( signed_integer_type_tests(Matrix<signed char, 2, Dynamic>(2, 10)) );    CALL_SUBTEST_4( integer_type_tests(Matrix<unsigned char, 3, 3>()) );    CALL_SUBTEST_4( integer_type_tests(Matrix<unsigned char, Dynamic, Dynamic>(20, 20)) );    CALL_SUBTEST_5( integer_type_tests(Matrix<short, Dynamic, 4>(7, 4)) );    CALL_SUBTEST_5( signed_integer_type_tests(Matrix<short, Dynamic, 4>(7, 4)) );    CALL_SUBTEST_6( integer_type_tests(Matrix<unsigned short, 4, 4>()) );    CALL_SUBTEST_7( integer_type_tests(Matrix<long long, 11, 13>()) );    CALL_SUBTEST_7( signed_integer_type_tests(Matrix<long long, 11, 13>()) );    CALL_SUBTEST_8( integer_type_tests(Matrix<unsigned long long, Dynamic, 5>(1, 5)) );  }}

void test_eigen2_qtvector(){  // some non vectorizable fixed sizes  CALL_SUBTEST_1(check_qtvector_matrix(Vector2f()));  CALL_SUBTEST_1(check_qtvector_matrix(Matrix3f()));  CALL_SUBTEST_1(check_qtvector_matrix(Matrix3d()));  // some vectorizable fixed sizes  CALL_SUBTEST_2(check_qtvector_matrix(Matrix2f()));  CALL_SUBTEST_2(check_qtvector_matrix(Vector4f()));  CALL_SUBTEST_2(check_qtvector_matrix(Matrix4f()));  CALL_SUBTEST_2(check_qtvector_matrix(Matrix4d()));  // some dynamic sizes  CALL_SUBTEST_3(check_qtvector_matrix(MatrixXd(1,1)));  CALL_SUBTEST_3(check_qtvector_matrix(VectorXd(20)));  CALL_SUBTEST_3(check_qtvector_matrix(RowVectorXf(20)));  CALL_SUBTEST_3(check_qtvector_matrix(MatrixXcf(10,10)));  // some Transform  CALL_SUBTEST_4(check_qtvector_transform(Transform2f()));  CALL_SUBTEST_4(check_qtvector_transform(Transform3f()));  CALL_SUBTEST_4(check_qtvector_transform(Transform3d()));  //CALL_SUBTEST_4(check_qtvector_transform(Transform4d()));  // some Quaternion  CALL_SUBTEST_5(check_qtvector_quaternion(Quaternionf()));  CALL_SUBTEST_5(check_qtvector_quaternion(Quaternionf()));}

void test_mapstaticmethods(){  ptr = internal::aligned_new<float>(1000);  for(int i = 0; i < 1000; i++) ptr[i] = float(i);  const_ptr = ptr;  CALL_SUBTEST_1(( mapstaticmethods(Matrix<float, 1, 1>()) ));  CALL_SUBTEST_1(( mapstaticmethods(Vector2f()) ));  CALL_SUBTEST_2(( mapstaticmethods(Vector3f()) ));  CALL_SUBTEST_2(( mapstaticmethods(Matrix2f()) ));  CALL_SUBTEST_3(( mapstaticmethods(Matrix4f()) ));  CALL_SUBTEST_3(( mapstaticmethods(Array4f()) ));  CALL_SUBTEST_4(( mapstaticmethods(Array3f()) ));  CALL_SUBTEST_4(( mapstaticmethods(Array33f()) ));  CALL_SUBTEST_5(( mapstaticmethods(Array44f()) ));  CALL_SUBTEST_5(( mapstaticmethods(VectorXf(1)) ));  CALL_SUBTEST_5(( mapstaticmethods(VectorXf(8)) ));  CALL_SUBTEST_6(( mapstaticmethods(MatrixXf(1,1)) ));  CALL_SUBTEST_6(( mapstaticmethods(MatrixXf(5,7)) ));  CALL_SUBTEST_7(( mapstaticmethods(ArrayXf(1)) ));  CALL_SUBTEST_7(( mapstaticmethods(ArrayXf(5)) ));  CALL_SUBTEST_8(( mapstaticmethods(ArrayXXf(1,1)) ));  CALL_SUBTEST_8(( mapstaticmethods(ArrayXXf(8,6)) ));  internal::aligned_delete(ptr, 1000);}

void test_eigensolver_selfadjoint(){  int s = 0;  for(int i = 0; i < g_repeat; i++) {    // very important to test 3x3 and 2x2 matrices since we provide special paths for them    CALL_SUBTEST_1( selfadjointeigensolver(Matrix2f()) );    CALL_SUBTEST_1( selfadjointeigensolver(Matrix2d()) );    CALL_SUBTEST_1( selfadjointeigensolver(Matrix3f()) );    CALL_SUBTEST_1( selfadjointeigensolver(Matrix3d()) );    CALL_SUBTEST_2( selfadjointeigensolver(Matrix4d()) );    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);    CALL_SUBTEST_3( selfadjointeigensolver(MatrixXf(s,s)) );    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(s,s)) );    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);    CALL_SUBTEST_5( selfadjointeigensolver(MatrixXcd(s,s)) );    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);    CALL_SUBTEST_9( selfadjointeigensolver(Matrix<std::complex<double>,Dynamic,Dynamic,RowMajor>(s,s)) );    // some trivial but implementation-wise tricky cases    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(1,1)) );    CALL_SUBTEST_4( selfadjointeigensolver(MatrixXd(2,2)) );    CALL_SUBTEST_6( selfadjointeigensolver(Matrix<double,1,1>()) );    CALL_SUBTEST_7( selfadjointeigensolver(Matrix<double,2,2>()) );  }  // Test problem size constructors  s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);  CALL_SUBTEST_8(SelfAdjointEigenSolver<MatrixXf> tmp1(s));  CALL_SUBTEST_8(Tridiagonalization<MatrixXf> tmp2(s));  TEST_SET_BUT_UNUSED_VARIABLE(s)}

void test_mapstride(){  for(int i = 0; i < g_repeat; i++) {    EIGEN_UNUSED int maxn = 30;    CALL_SUBTEST_1( map_class_vector<Aligned>(Matrix<float, 1, 1>()) );    CALL_SUBTEST_1( map_class_vector<Unaligned>(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( map_class_vector<Aligned>(Vector4d()) );    CALL_SUBTEST_2( map_class_vector<Unaligned>(Vector4d()) );    CALL_SUBTEST_3( map_class_vector<Aligned>(RowVector4f()) );    CALL_SUBTEST_3( map_class_vector<Unaligned>(RowVector4f()) );    CALL_SUBTEST_4( map_class_vector<Aligned>(VectorXcf(internal::random<int>(1,maxn))) );    CALL_SUBTEST_4( map_class_vector<Unaligned>(VectorXcf(internal::random<int>(1,maxn))) );    CALL_SUBTEST_5( map_class_vector<Aligned>(VectorXi(internal::random<int>(1,maxn))) );    CALL_SUBTEST_5( map_class_vector<Unaligned>(VectorXi(internal::random<int>(1,maxn))) );    CALL_SUBTEST_1( map_class_matrix<Aligned>(Matrix<float, 1, 1>()) );    CALL_SUBTEST_1( map_class_matrix<Unaligned>(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( map_class_matrix<Aligned>(Matrix4d()) );    CALL_SUBTEST_2( map_class_matrix<Unaligned>(Matrix4d()) );    CALL_SUBTEST_3( map_class_matrix<Aligned>(Matrix<float,3,5>()) );    CALL_SUBTEST_3( map_class_matrix<Unaligned>(Matrix<float,3,5>()) );    CALL_SUBTEST_3( map_class_matrix<Aligned>(Matrix<float,4,8>()) );    CALL_SUBTEST_3( map_class_matrix<Unaligned>(Matrix<float,4,8>()) );    CALL_SUBTEST_4( map_class_matrix<Aligned>(MatrixXcf(internal::random<int>(1,maxn),internal::random<int>(1,maxn))) );    CALL_SUBTEST_4( map_class_matrix<Unaligned>(MatrixXcf(internal::random<int>(1,maxn),internal::random<int>(1,maxn))) );    CALL_SUBTEST_5( map_class_matrix<Aligned>(MatrixXi(internal::random<int>(1,maxn),internal::random<int>(1,maxn))) );    CALL_SUBTEST_5( map_class_matrix<Unaligned>(MatrixXi(internal::random<int>(1,maxn),internal::random<int>(1,maxn))) );    CALL_SUBTEST_6( map_class_matrix<Aligned>(MatrixXcd(internal::random<int>(1,maxn),internal::random<int>(1,maxn))) );    CALL_SUBTEST_6( map_class_matrix<Unaligned>(MatrixXcd(internal::random<int>(1,maxn),internal::random<int>(1,maxn))) );  }}

void test_eigensolver_generic(){  int s = 0;  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( eigensolver(Matrix4f()) );    s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);    CALL_SUBTEST_2( eigensolver(MatrixXd(s,s)) );    TEST_SET_BUT_UNUSED_VARIABLE(s)    // some trivial but implementation-wise tricky cases    CALL_SUBTEST_2( eigensolver(MatrixXd(1,1)) );    CALL_SUBTEST_2( eigensolver(MatrixXd(2,2)) );    CALL_SUBTEST_3( eigensolver(Matrix<double,1,1>()) );    CALL_SUBTEST_4( eigensolver(Matrix2d()) );  }  CALL_SUBTEST_1( eigensolver_verify_assert(Matrix4f()) );  s = internal::random<int>(1,EIGEN_TEST_MAX_SIZE/4);  CALL_SUBTEST_2( eigensolver_verify_assert(MatrixXd(s,s)) );  CALL_SUBTEST_3( eigensolver_verify_assert(Matrix<double,1,1>()) );  CALL_SUBTEST_4( eigensolver_verify_assert(Matrix2d()) );  // Test problem size constructors  CALL_SUBTEST_5(EigenSolver<MatrixXf> tmp(s));  // regression test for bug 410  CALL_SUBTEST_2(  {     MatrixXd A(1,1);     A(0,0) = std::sqrt(-1.); // is Not-a-Number     Eigen::EigenSolver<MatrixXd> solver(A);     VERIFY_IS_EQUAL(solver.info(), NumericalIssue);  }  );

void test_eigen2_array(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( array(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( array(Matrix2f()) );    CALL_SUBTEST_3( array(Matrix4d()) );    CALL_SUBTEST_4( array(MatrixXcf(3, 3)) );    CALL_SUBTEST_5( array(MatrixXf(8, 12)) );    CALL_SUBTEST_6( array(MatrixXi(8, 12)) );  }  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( comparisons(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( comparisons(Matrix2f()) );    CALL_SUBTEST_3( comparisons(Matrix4d()) );    CALL_SUBTEST_5( comparisons(MatrixXf(8, 12)) );    CALL_SUBTEST_6( comparisons(MatrixXi(8, 12)) );  }  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( lpNorm(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( lpNorm(Vector2f()) );    CALL_SUBTEST_3( lpNorm(Vector3d()) );    CALL_SUBTEST_4( lpNorm(Vector4f()) );    CALL_SUBTEST_5( lpNorm(VectorXf(16)) );    CALL_SUBTEST_7( lpNorm(VectorXcd(10)) );  }}

void test_sparse_basic(){  for(int i = 0; i < g_repeat; i++) {    int r = Eigen::internal::random<int>(1,200), c = Eigen::internal::random<int>(1,200);    if(Eigen::internal::random<int>(0,4) == 0) {      r = c; // check square matrices in 25% of tries    }    EIGEN_UNUSED_VARIABLE(r+c);    CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(1, 1)) ));    CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(8, 8)) ));    CALL_SUBTEST_2(( sparse_basic(SparseMatrix<std::complex<double>, ColMajor>(r, c)) ));    CALL_SUBTEST_2(( sparse_basic(SparseMatrix<std::complex<double>, RowMajor>(r, c)) ));    CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(r, c)) ));    CALL_SUBTEST_5(( sparse_basic(SparseMatrix<double,ColMajor,long int>(r, c)) ));    CALL_SUBTEST_5(( sparse_basic(SparseMatrix<double,RowMajor,long int>(r, c)) ));        r = Eigen::internal::random<int>(1,100);    c = Eigen::internal::random<int>(1,100);    if(Eigen::internal::random<int>(0,4) == 0) {      r = c; // check square matrices in 25% of tries    }        CALL_SUBTEST_6(( sparse_basic(SparseMatrix<double,ColMajor,short int>(short(r), short(c))) ));    CALL_SUBTEST_6(( sparse_basic(SparseMatrix<double,RowMajor,short int>(short(r), short(c))) ));  }  // Regression test for bug 900: (manually insert higher values here, if you have enough RAM):  CALL_SUBTEST_3((big_sparse_triplet<SparseMatrix<float, RowMajor, int> >(10000, 10000, 0.125)));  CALL_SUBTEST_4((big_sparse_triplet<SparseMatrix<double, ColMajor, long int> >(10000, 10000, 0.125)));}

void test_eigen2_sparse_vector(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( sparse_vector<double>(8, 8) );    CALL_SUBTEST_2( sparse_vector<std::complex<double> >(16, 16) );    CALL_SUBTEST_1( sparse_vector<double>(299, 535) );  }}

void test_eigen2_sparse_solvers(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( sparse_solvers<double>(8, 8) );    CALL_SUBTEST_2( sparse_solvers<std::complex<double> >(16, 16) );    CALL_SUBTEST_1( sparse_solvers<double>(101, 101) );  }}

void test_superlu_support(){  SuperLU<SparseMatrix<double> > superlu_double_colmajor;  SuperLU<SparseMatrix<std::complex<double> > > superlu_cplxdouble_colmajor;  CALL_SUBTEST_1( check_sparse_square_solving(superlu_double_colmajor)      );  CALL_SUBTEST_2( check_sparse_square_solving(superlu_cplxdouble_colmajor)  );  CALL_SUBTEST_1( check_sparse_square_determinant(superlu_double_colmajor)      );  CALL_SUBTEST_2( check_sparse_square_determinant(superlu_cplxdouble_colmajor)  );}

void test_sparse_llt(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1(sparse_llt<double>(8, 8) );    int s = ei_random<int>(1,300);    CALL_SUBTEST_2(sparse_llt<std::complex<double> >(s,s) );    CALL_SUBTEST_1(sparse_llt<double>(s,s) );  }}

void test_sparse_solvers(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1(sparse_solvers<double>(8, 8) );    int s = internal::random<int>(1,300);    CALL_SUBTEST_2(sparse_solvers<std::complex<double> >(s,s) );    CALL_SUBTEST_1(sparse_solvers<double>(s,s) );  }}

void test_eigen2_sparse_basic(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( sparse_basic(SparseMatrix<double>(8, 8)) );    CALL_SUBTEST_2( sparse_basic(SparseMatrix<std::complex<double> >(16, 16)) );    CALL_SUBTEST_1( sparse_basic(SparseMatrix<double>(33, 33)) );    CALL_SUBTEST_3( sparse_basic(DynamicSparseMatrix<double>(8, 8)) );  }}

void test_sparse_product(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( (sparse_product<SparseMatrix<double,ColMajor> >()) );    CALL_SUBTEST_1( (sparse_product<SparseMatrix<double,RowMajor> >()) );    CALL_SUBTEST_2( (sparse_product<SparseMatrix<std::complex<double>, ColMajor > >()) );    CALL_SUBTEST_2( (sparse_product<SparseMatrix<std::complex<double>, RowMajor > >()) );    CALL_SUBTEST_4( (sparse_product_regression_test<SparseMatrix<double,RowMajor>, Matrix<double, Dynamic, Dynamic, RowMajor> >()) );  }}

void test_eigen2_prec_inverse_4x4(){  CALL_SUBTEST_1((inverse_permutation_4x4<Matrix4f>()));  CALL_SUBTEST_1(( inverse_general_4x4<Matrix4f>(200000 * g_repeat) ));  CALL_SUBTEST_2((inverse_permutation_4x4<Matrix<double,4,4,RowMajor> >()));  CALL_SUBTEST_2(( inverse_general_4x4<Matrix<double,4,4,RowMajor> >(200000 * g_repeat) ));  CALL_SUBTEST_3((inverse_permutation_4x4<Matrix4cf>()));  CALL_SUBTEST_3((inverse_general_4x4<Matrix4cf>(50000 * g_repeat)));}

void test_packetmath(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( packetmath<float>() );    CALL_SUBTEST_2( packetmath<double>() );    CALL_SUBTEST_3( packetmath<int>() );    CALL_SUBTEST_1( packetmath<std::complex<float> >() );    CALL_SUBTEST_1( packetmath_real<float>() );    CALL_SUBTEST_2( packetmath_real<double>() );  }}

void test_sparse_basic(){  for(int i = 0; i < g_repeat; i++) {    int s = Eigen::internal::random<int>(1,50);    CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(8, 8)) ));    CALL_SUBTEST_2(( sparse_basic(SparseMatrix<std::complex<double>, ColMajor>(s, s)) ));    CALL_SUBTEST_2(( sparse_basic(SparseMatrix<std::complex<double>, RowMajor>(s, s)) ));    CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(s, s)) ));    CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double,ColMajor,long int>(s, s)) ));    CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double,RowMajor,long int>(s, s)) ));  }}

void test_matrix_power(){  CALL_SUBTEST_2(test2dRotation<double>(1e-13));  CALL_SUBTEST_1(test2dRotation<float>(2e-5));  // was 1e-5, relaxed for clang 2.8 / linux / x86-64  CALL_SUBTEST_9(test2dRotation<long double>(1e-13));   CALL_SUBTEST_2(test2dHyperbolicRotation<double>(1e-14));  CALL_SUBTEST_1(test2dHyperbolicRotation<float>(1e-5));  CALL_SUBTEST_9(test2dHyperbolicRotation<long double>(1e-14));  CALL_SUBTEST_10(test3dRotation<double>(1e-13));  CALL_SUBTEST_11(test3dRotation<float>(1e-5));  CALL_SUBTEST_12(test3dRotation<long double>(1e-13));  CALL_SUBTEST_2(testGeneral(Matrix2d(),         1e-13));  CALL_SUBTEST_7(testGeneral(Matrix3dRowMajor(), 1e-13));  CALL_SUBTEST_3(testGeneral(Matrix4cd(),        1e-13));  CALL_SUBTEST_4(testGeneral(MatrixXd(8,8),      2e-12));  CALL_SUBTEST_1(testGeneral(Matrix2f(),         1e-4));  CALL_SUBTEST_5(testGeneral(Matrix3cf(),        1e-4));  CALL_SUBTEST_8(testGeneral(Matrix4f(),         1e-4));  CALL_SUBTEST_6(testGeneral(MatrixXf(2,2),      1e-3)); // see bug 614  CALL_SUBTEST_9(testGeneral(MatrixXe(7,7),      1e-13));  CALL_SUBTEST_10(testGeneral(Matrix3d(),        1e-13));  CALL_SUBTEST_11(testGeneral(Matrix3f(),        1e-4));  CALL_SUBTEST_12(testGeneral(Matrix3e(),        1e-13));  CALL_SUBTEST_2(testSingular(Matrix2d(),         1e-13));  CALL_SUBTEST_7(testSingular(Matrix3dRowMajor(), 1e-13));  CALL_SUBTEST_3(testSingular(Matrix4cd(),        1e-13));  CALL_SUBTEST_4(testSingular(MatrixXd(8,8),      2e-12));  CALL_SUBTEST_1(testSingular(Matrix2f(),         1e-4));  CALL_SUBTEST_5(testSingular(Matrix3cf(),        1e-4));  CALL_SUBTEST_8(testSingular(Matrix4f(),         1e-4));  CALL_SUBTEST_6(testSingular(MatrixXf(2,2),      1e-3));  CALL_SUBTEST_9(testSingular(MatrixXe(7,7),      1e-13));  CALL_SUBTEST_10(testSingular(Matrix3d(),        1e-13));  CALL_SUBTEST_11(testSingular(Matrix3f(),        1e-4));  CALL_SUBTEST_12(testSingular(Matrix3e(),        1e-13));  CALL_SUBTEST_2(testLogThenExp(Matrix2d(),         1e-13));  CALL_SUBTEST_7(testLogThenExp(Matrix3dRowMajor(), 1e-13));  CALL_SUBTEST_3(testLogThenExp(Matrix4cd(),        1e-13));  CALL_SUBTEST_4(testLogThenExp(MatrixXd(8,8),      2e-12));  CALL_SUBTEST_1(testLogThenExp(Matrix2f(),         1e-4));  CALL_SUBTEST_5(testLogThenExp(Matrix3cf(),        1e-4));  CALL_SUBTEST_8(testLogThenExp(Matrix4f(),         1e-4));  CALL_SUBTEST_6(testLogThenExp(MatrixXf(2,2),      1e-3));  CALL_SUBTEST_9(testLogThenExp(MatrixXe(7,7),      1e-13));  CALL_SUBTEST_10(testLogThenExp(Matrix3d(),        1e-13));  CALL_SUBTEST_11(testLogThenExp(Matrix3f(),        1e-4));  CALL_SUBTEST_12(testLogThenExp(Matrix3e(),        1e-13));}

void test_eigen2_lu(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( lu_non_invertible<MatrixXf>() );    CALL_SUBTEST_2( lu_non_invertible<MatrixXd>() );    CALL_SUBTEST_3( lu_non_invertible<MatrixXcf>() );    CALL_SUBTEST_4( lu_non_invertible<MatrixXcd>() );    CALL_SUBTEST_1( lu_invertible<MatrixXf>() );    CALL_SUBTEST_2( lu_invertible<MatrixXd>() );    CALL_SUBTEST_3( lu_invertible<MatrixXcf>() );    CALL_SUBTEST_4( lu_invertible<MatrixXcd>() );  }}

void test_corners(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( corners(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( corners(Matrix4d()) );    CALL_SUBTEST_3( corners(Matrix<int,10,12>()) );    CALL_SUBTEST_4( corners(MatrixXcf(5, 7)) );    CALL_SUBTEST_5( corners(MatrixXf(21, 20)) );    CALL_SUBTEST_1(( corners_fixedsize<Matrix<float, 1, 1>, 1, 1, 0, 0>() ));    CALL_SUBTEST_2(( corners_fixedsize<Matrix4d,2,2,1,1>() ));    CALL_SUBTEST_3(( corners_fixedsize<Matrix<int,10,12>,4,7,5,2>() ));  }}

void test_diagonal(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1( diagonal(Matrix<float, 1, 1>()) );    CALL_SUBTEST_1( diagonal(Matrix<float, 4, 9>()) );    CALL_SUBTEST_1( diagonal(Matrix<float, 7, 3>()) );    CALL_SUBTEST_2( diagonal(Matrix4d()) );    CALL_SUBTEST_2( diagonal(MatrixXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );    CALL_SUBTEST_2( diagonal(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );    CALL_SUBTEST_2( diagonal(MatrixXcd(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );    CALL_SUBTEST_1( diagonal(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );    CALL_SUBTEST_1( diagonal(Matrix<float,Dynamic,4>(3, 4)) );  }}

void test_geo_quaternion(){  for(int i = 0; i < g_repeat; i++) {    CALL_SUBTEST_1(( quaternion<float,AutoAlign>() ));    CALL_SUBTEST_1( check_const_correctness(Quaternionf()) );    CALL_SUBTEST_2(( quaternion<double,AutoAlign>() ));    CALL_SUBTEST_2( check_const_correctness(Quaterniond()) );    CALL_SUBTEST_3(( quaternion<float,DontAlign>() ));    CALL_SUBTEST_4(( quaternion<double,DontAlign>() ));    CALL_SUBTEST_5(( quaternionAlignment<float>() ));    CALL_SUBTEST_6(( quaternionAlignment<double>() ));    CALL_SUBTEST_1( mapQuaternion<float>() );    CALL_SUBTEST_2( mapQuaternion<double>() );  }}

void test_selfadjoint(){  for(int i = 0; i < g_repeat ; i++)  {    int s = internal::random<int>(1,20); EIGEN_UNUSED_VARIABLE(s);    CALL_SUBTEST_1( selfadjoint(Matrix<float, 1, 1>()) );    CALL_SUBTEST_2( selfadjoint(Matrix<float, 2, 2>()) );    CALL_SUBTEST_3( selfadjoint(Matrix3cf()) );    CALL_SUBTEST_4( selfadjoint(MatrixXcd(s,s)) );    CALL_SUBTEST_5( selfadjoint(Matrix<float,Dynamic,Dynamic,RowMajor>(s, s)) );  }    CALL_SUBTEST_1( bug_159() );}