| 14 | #include "main.h" |
| 15 | |
| 16 | template<typename MatrixType> void linearStructure(const MatrixType& m) |
| 17 | { |
| 18 | using std::abs; |
| 19 | /* this test covers the following files: |
| 20 | CwiseUnaryOp.h, CwiseBinaryOp.h, SelfCwiseBinaryOp.h |
| 21 | */ |
| 22 | typedef typename MatrixType::Scalar Scalar; |
| 23 | typedef typename MatrixType::RealScalar RealScalar; |
| 24 | |
| 25 | Index rows = m.rows(); |
| 26 | Index cols = m.cols(); |
| 27 | |
| 28 | // this test relies a lot on Random.h, and there's not much more that we can do |
| 29 | // to test it, hence I consider that we will have tested Random.h |
| 30 | MatrixType m1 = MatrixType::Random(rows, cols), |
| 31 | m2 = MatrixType::Random(rows, cols), |
| 32 | m3(rows, cols); |
| 33 | |
| 34 | Scalar s1 = internal::random<Scalar>(); |
| 35 | while (abs(s1)<RealScalar(1e-3)) s1 = internal::random<Scalar>(); |
| 36 | |
| 37 | Index r = internal::random<Index>(0, rows-1), |
| 38 | c = internal::random<Index>(0, cols-1); |
| 39 | |
| 40 | VERIFY_IS_APPROX(-(-m1), m1); |
| 41 | VERIFY_IS_APPROX(m1+m1, 2*m1); |
| 42 | VERIFY_IS_APPROX(m1+m2-m1, m2); |
| 43 | VERIFY_IS_APPROX(-m2+m1+m2, m1); |
| 44 | VERIFY_IS_APPROX(m1*s1, s1*m1); |
| 45 | VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); |
| 46 | VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); |
| 47 | m3 = m2; m3 += m1; |
| 48 | VERIFY_IS_APPROX(m3, m1+m2); |
| 49 | m3 = m2; m3 -= m1; |
| 50 | VERIFY_IS_APPROX(m3, m2-m1); |
| 51 | m3 = m2; m3 *= s1; |
| 52 | VERIFY_IS_APPROX(m3, s1*m2); |
| 53 | if(!NumTraits<Scalar>::IsInteger) |
| 54 | { |
| 55 | m3 = m2; m3 /= s1; |
| 56 | VERIFY_IS_APPROX(m3, m2/s1); |
| 57 | } |
| 58 | |
| 59 | // again, test operator() to check const-qualification |
| 60 | VERIFY_IS_APPROX((-m1)(r,c), -(m1(r,c))); |
| 61 | VERIFY_IS_APPROX((m1-m2)(r,c), (m1(r,c))-(m2(r,c))); |
| 62 | VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c))); |
| 63 | VERIFY_IS_APPROX((s1*m1)(r,c), s1*(m1(r,c))); |
| 64 | VERIFY_IS_APPROX((m1*s1)(r,c), (m1(r,c))*s1); |
| 65 | if(!NumTraits<Scalar>::IsInteger) |
| 66 | VERIFY_IS_APPROX((m1/s1)(r,c), (m1(r,c))/s1); |
| 67 | |
| 68 | // use .block to disable vectorization and compare to the vectorized version |
| 69 | VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1); |
| 70 | VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), m1.cwiseProduct(m1)); |
| 71 | VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1); |
| 72 | VERIFY_IS_APPROX(m1.block(0,0,rows,cols) * s1, m1 * s1); |
| 73 | } |
no test coverage detected