commit 4ca89f32ed7bbbc4938825a416642782583988e0
author Gael Guennebaud <g.gael@free.fr> Fri Dec 02 19:00:16 2011 +0100
committer Gael Guennebaud <g.gael@free.fr> Fri Dec 02 19:00:16 2011 +0100
tree 9a04f8881226f3d721e56e857b93d6bbafc3b84a
parent f10bae74e81ecf1fed70c012090efcb1a05be842

Sparse matrix insertion:
 - automatically turn a SparseMatrix to uncompressed mode when calling insert(i,j).
 - now coeffRef insert a new element when it does not already exist

test/sparse_basic.cpp

diff --git a/test/sparse_basic.cpp b/test/sparse_basic.cpp
index 487e3c1..c566bd9 100644
--- a/test/sparse_basic.cpp
+++ b/test/sparse_basic.cpp
@@ -110,7 +110,8 @@
       DenseMatrix m1(rows,cols);
       m1.setZero();
       SparseMatrixType m2(rows,cols);
-      m2.reserve(10);
+      if(internal::random<int>()%2)
+        m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
       for (int j=0; j<cols; ++j)
       {
         for (int k=0; k<rows/2; ++k)
@@ -129,15 +130,21 @@
       DenseMatrix m1(rows,cols);
       m1.setZero();
       SparseMatrixType m2(rows,cols);
-      m2.reserve(10);
+      if(internal::random<int>()%2)
+        m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
       for (int k=0; k<rows*cols; ++k)
       {
         int i = internal::random<int>(0,rows-1);
         int j = internal::random<int>(0,cols-1);
-        if (m1.coeff(i,j)==Scalar(0))
+        if ((m1.coeff(i,j)==Scalar(0)) && (internal::random<int>()%2))
           m2.insert(i,j) = m1(i,j) = internal::random<Scalar>();
+        else
+        {
+          Scalar v = internal::random<Scalar>();
+          m2.coeffRef(i,j) += v;
+          m1(i,j) += v;
+        }
       }
-      m2.finalize();
       VERIFY_IS_APPROX(m2,m1);
     }
     
@@ -158,8 +165,8 @@
         if(mode==3)
           m2.reserve(r);
       }
-      m2.finalize();
-      m2.makeCompressed();
+      if(internal::random<int>()%2)
+        m2.makeCompressed();
       VERIFY_IS_APPROX(m2,m1);
     }