eigen2support.cpp 2.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
  1. // This file is part of Eigen, a lightweight C++ template library
  2. // for linear algebra.
  3. //
  4. // Copyright (C) 2009 Gael Guennebaud <gael.guennebaud@inria.fr>
  5. //
  6. // This Source Code Form is subject to the terms of the Mozilla
  7. // Public License v. 2.0. If a copy of the MPL was not distributed
  8. // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
  9. #define EIGEN2_SUPPORT
  10. #include "main.h"
  11. template<typename MatrixType> void eigen2support(const MatrixType& m)
  12. {
  13. typedef typename MatrixType::Scalar Scalar;
  14. Index rows = m.rows();
  15. Index cols = m.cols();
  16. MatrixType m1 = MatrixType::Random(rows, cols),
  17. m3(rows, cols);
  18. Scalar s1 = internal::random<Scalar>(),
  19. s2 = internal::random<Scalar>();
  20. // scalar addition
  21. VERIFY_IS_APPROX(m1.cwise() + s1, s1 + m1.cwise());
  22. VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
  23. VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
  24. m3 = m1;
  25. m3.cwise() += s2;
  26. VERIFY_IS_APPROX(m3, m1.cwise() + s2);
  27. m3 = m1;
  28. m3.cwise() -= s1;
  29. VERIFY_IS_APPROX(m3, m1.cwise() - s1);
  30. VERIFY_IS_EQUAL((m1.corner(TopLeft,1,1)), (m1.block(0,0,1,1)));
  31. VERIFY_IS_EQUAL((m1.template corner<1,1>(TopLeft)), (m1.template block<1,1>(0,0)));
  32. VERIFY_IS_EQUAL((m1.col(0).start(1)), (m1.col(0).segment(0,1)));
  33. VERIFY_IS_EQUAL((m1.col(0).template start<1>()), (m1.col(0).segment(0,1)));
  34. VERIFY_IS_EQUAL((m1.col(0).end(1)), (m1.col(0).segment(rows-1,1)));
  35. VERIFY_IS_EQUAL((m1.col(0).template end<1>()), (m1.col(0).segment(rows-1,1)));
  36. using std::cos;
  37. using numext::real;
  38. using numext::abs2;
  39. VERIFY_IS_EQUAL(ei_cos(s1), cos(s1));
  40. VERIFY_IS_EQUAL(ei_real(s1), real(s1));
  41. VERIFY_IS_EQUAL(ei_abs2(s1), abs2(s1));
  42. m1.minor(0,0);
  43. }
  44. void test_eigen2support()
  45. {
  46. for(int i = 0; i < g_repeat; i++) {
  47. CALL_SUBTEST_1( eigen2support(Matrix<double,1,1>()) );
  48. CALL_SUBTEST_2( eigen2support(MatrixXd(1,1)) );
  49. CALL_SUBTEST_4( eigen2support(Matrix3f()) );
  50. CALL_SUBTEST_5( eigen2support(Matrix4d()) );
  51. CALL_SUBTEST_2( eigen2support(MatrixXf(200,200)) );
  52. CALL_SUBTEST_6( eigen2support(MatrixXcd(100,100)) );
  53. }
  54. }