diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2015-10-09 15:28:09 +0200 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2015-10-09 15:28:09 +0200 |
| commit | 6536b4bad71de912f240c6fffa6fd29e5b7b4bbc (patch) | |
| tree | 45a897b1c521b7882f415782a8389db9ddc76d53 /test/nesting_ops.cpp | |
| parent | a4cc4c1e5e0ca1ee46818cda81793e4b5e586221 (diff) | |
Implement temporary-free path for "D.nolias() ?= C + A*B". (I thought it was already implemented)
Diffstat (limited to 'test/nesting_ops.cpp')
| -rw-r--r-- | test/nesting_ops.cpp | 21 |
1 files changed, 2 insertions, 19 deletions
diff --git a/test/nesting_ops.cpp b/test/nesting_ops.cpp index 1e96075f8..76a63400c 100644 --- a/test/nesting_ops.cpp +++ b/test/nesting_ops.cpp @@ -54,25 +54,8 @@ template <typename MatrixType> void run_nesting_ops_2(const MatrixType& _m) if((MatrixType::SizeAtCompileTime==Dynamic)) { - - VERIFY_EVALUATION_COUNT( use_n_times<10>(m1), 0 ); - if(!NumTraits<Scalar>::IsComplex) - { - VERIFY_EVALUATION_COUNT( use_n_times<3>(2*m1), 0 ); - VERIFY_EVALUATION_COUNT( use_n_times<4>(2*m1), 1 ); - } - else - { - VERIFY_EVALUATION_COUNT( use_n_times<1>(2*m1), 0 ); - VERIFY_EVALUATION_COUNT( use_n_times<2>(2*m1), 1 ); - } - VERIFY_EVALUATION_COUNT( use_n_times<2>(m1+m1), 0 ); - VERIFY_EVALUATION_COUNT( use_n_times<3>(m1+m1), 1 ); - VERIFY_EVALUATION_COUNT( use_n_times<1>(m1*m1.transpose()), 1 ); - VERIFY_EVALUATION_COUNT( use_n_times<2>(m1*m1.transpose()), 1 ); - - VERIFY_EVALUATION_COUNT( use_n_times<1>(m1 + m1*m1), 2 ); // FIXME should already be 1 thanks the already existing rule - VERIFY_EVALUATION_COUNT( use_n_times<10>(m1 + m1*m1), 2 ); + VERIFY_EVALUATION_COUNT( use_n_times<1>(m1 + m1*m1), 1 ); + VERIFY_EVALUATION_COUNT( use_n_times<10>(m1 + m1*m1), 1 ); VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 ); VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 ); |