GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-04-20 08:39:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

Check sparse matrices with short indices

Browse Source
This commit is contained in:
Gael Guennebaud 2013-06-10 10:34:03 +02:00
parent e8c963568c
commit 47e89026d0
1 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
test/sparse_basic.cpp
View File

@ -179,16 +179,16 @@ template<typename SparseMatrixType> void sparse_basic(const SparseMatrixType& re
m3.insertByOuterInner(j,k) = k+1; m3.insertByOuterInner(j,k) = k+1;
for(int j=0; j<rows; ++j) for(int j=0; j<rows; ++j)
{ {
VERIFY(j==internal::real(m3.innerVector(j).nonZeros())); VERIFY(j==math::real(m3.innerVector(j).nonZeros()));
if(j>0) if(j>0)
VERIFY(j==internal::real(m3.innerVector(j).lastCoeff())); VERIFY(j==math::real(m3.innerVector(j).lastCoeff()));
} }
m3.makeCompressed(); m3.makeCompressed();
for(int j=0; j<rows; ++j) for(int j=0; j<rows; ++j)
{ {
VERIFY(j==internal::real(m3.innerVector(j).nonZeros())); VERIFY(j==math::real(m3.innerVector(j).nonZeros()));
if(j>0) if(j>0)
VERIFY(j==internal::real(m3.innerVector(j).lastCoeff())); VERIFY(j==math::real(m3.innerVector(j).lastCoeff()));
} }
//m2.innerVector(j0) = 2*m2.innerVector(j1); //m2.innerVector(j0) = 2*m2.innerVector(j1);
@ -467,5 +467,8 @@ void test_sparse_basic()
CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double>(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,ColMajor,long int>(s, s)) ));
CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double,RowMajor,long int>(s, s)) )); CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double,RowMajor,long int>(s, s)) ));
CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double,ColMajor,short int>(s, s)) ));
CALL_SUBTEST_1(( sparse_basic(SparseMatrix<double,RowMajor,short int>(s, s)) ));
} }
} }