commit 67ae94f3a258644cba45c3426bf7f48f91dcc2e1
author Gael Guennebaud <g.gael@free.fr> Fri Dec 23 09:41:14 2011 +0100
committer Gael Guennebaud <g.gael@free.fr> Fri Dec 23 09:41:14 2011 +0100
tree d35e3c772f10fe33e6fe1c63b7ecd87350730540
parent e3e39ea26d78ef4443b37a13dd8e8a020617a1c0

fix compilation of sparse_basic unit test for complexes

test/sparse_basic.cpp

diff --git a/test/sparse_basic.cpp b/test/sparse_basic.cpp
index f36fcb3..6a3e191 100644
--- a/test/sparse_basic.cpp
+++ b/test/sparse_basic.cpp
@@ -245,16 +245,16 @@
         m3.insertByOuterInner(j,k) = k+1;
     for(int j=0; j<rows; ++j)
     {
-      VERIFY(j==m3.innerVector(j).nonZeros());
+      VERIFY(j==internal::real(m3.innerVector(j).nonZeros()));
       if(j>0)
-        VERIFY(j==m3.innerVector(j).lastCoeff());
+        VERIFY(j==internal::real(m3.innerVector(j).lastCoeff()));
     }
     m3.makeCompressed();
     for(int j=0; j<rows; ++j)
     {
-      VERIFY(j==m3.innerVector(j).nonZeros());
+      VERIFY(j==internal::real(m3.innerVector(j).nonZeros()));
       if(j>0)
-        VERIFY(j==m3.innerVector(j).lastCoeff());
+        VERIFY(j==internal::real(m3.innerVector(j).lastCoeff()));
     }
 
     //m2.innerVector(j0) = 2*m2.innerVector(j1);