diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2013-11-10 15:26:07 +0100 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2013-11-10 15:26:07 +0100 |
| commit | 5c2d1b4710b5f1ae280bb687b3dd47dfeb62b698 (patch) | |
| tree | b0b7a32e09ec3d8be563d0f26215e288459a28a1 /test/sparse_basic.cpp | |
| parent | b93520b1a52818c4659cafbb4d80aae001ece932 (diff) | |
Add missing nonZeros() overload in Block<SparseMatrixBase<>>
Diffstat (limited to 'test/sparse_basic.cpp')
| -rw-r--r-- | test/sparse_basic.cpp | 5 |
1 files changed, 4 insertions, 1 deletions
diff --git a/test/sparse_basic.cpp b/test/sparse_basic.cpp index 498ecfe29..d5ff9f80b 100644 --- a/test/sparse_basic.cpp +++ b/test/sparse_basic.cpp @@ -198,6 +198,8 @@ template<typename SparseMatrixType> void sparse_basic(const SparseMatrixType& re if(j>0) VERIFY(j==numext::real(m3.innerVector(j).lastCoeff())); } + + VERIFY(m3.innerVector(j0).nonZeros() == m3.transpose().innerVector(j0).nonZeros()); //m2.innerVector(j0) = 2*m2.innerVector(j1); //refMat2.col(j0) = 2*refMat2.col(j1); @@ -227,6 +229,8 @@ template<typename SparseMatrixType> void sparse_basic(const SparseMatrixType& re VERIFY_IS_APPROX(m2, refMat2); + VERIFY(m2.innerVectors(j0,n0).nonZeros() == m2.transpose().innerVectors(j0,n0).nonZeros()); + m2.innerVectors(j0,n0) = m2.innerVectors(j0,n0) + m2.innerVectors(j1,n0); if(SparseMatrixType::IsRowMajor) refMat2.middleRows(j0,n0) = (refMat2.middleRows(j0,n0) + refMat2.middleRows(j1,n0)).eval(); @@ -234,7 +238,6 @@ template<typename SparseMatrixType> void sparse_basic(const SparseMatrixType& re refMat2.middleCols(j0,n0) = (refMat2.middleCols(j0,n0) + refMat2.middleCols(j1,n0)).eval(); VERIFY_IS_APPROX(m2, refMat2); - } // test basic computations |