optimize A * v product for A sparse and row major

Eigen/src/Sparse/SparseProduct.h

diff --git a/Eigen/src/Sparse/SparseProduct.h b/Eigen/src/Sparse/SparseProduct.h
index 06ea703..ec4961d 100644
--- a/Eigen/src/Sparse/SparseProduct.h
+++ b/Eigen/src/Sparse/SparseProduct.h
@@ -313,6 +313,7 @@
 Derived& MatrixBase<Derived>::lazyAssign(const SparseProduct<Lhs,Rhs,SparseTimeDenseProduct>& product)
 {
   typedef typename ei_cleantype<Lhs>::type _Lhs;
+  typedef typename ei_cleantype<Rhs>::type _Rhs;
   typedef typename _Lhs::InnerIterator LhsInnerIterator;
   enum {
     LhsIsRowMajor = (_Lhs::Flags&RowMajorBit)==RowMajorBit,
@@ -332,6 +333,7 @@
       derived().row(j) += i.value() * product.rhs().row(j);
       ++i;
     }
+    Block<Derived,1,Derived::ColsAtCompileTime> foo = derived().row(j);
     for (; (ProcessFirstHalf ? i && i.index() < j : i) ; ++i)
     {
       if (LhsIsSelfAdjoint)
@@ -342,8 +344,10 @@
         derived().row(a) += (v) * product.rhs().row(b);
         derived().row(b) += ei_conj(v) * product.rhs().row(a);
       }
+      else if (LhsIsRowMajor)
+        foo += i.value() * product.rhs().row(i.index());
       else
-        derived().row(LhsIsRowMajor ? j : i.index()) += i.value() * product.rhs().row(LhsIsRowMajor ? i.index() : j);
+        derived().row(i.index()) += i.value() * product.rhs().row(j);
     }
     if (ProcessFirstHalf && i && (i.index()==j))
       derived().row(j) += i.value() * product.rhs().row(j);

Eigen/src/Sparse/SparseVector.h

diff --git a/Eigen/src/Sparse/SparseVector.h b/Eigen/src/Sparse/SparseVector.h
index 39c1e66..ff9d27a 100644
--- a/Eigen/src/Sparse/SparseVector.h
+++ b/Eigen/src/Sparse/SparseVector.h
@@ -103,7 +103,7 @@
       */
     inline Scalar& coeffRef(int i)
     {
-      return m_data.atWithInsertiob(i);
+      return m_data.atWithInsertion(i);
     }
 
   public:

test/sparse_vector.cpp

diff --git a/test/sparse_vector.cpp b/test/sparse_vector.cpp
index 0a66af6..64f52cb 100644
--- a/test/sparse_vector.cpp
+++ b/test/sparse_vector.cpp
@@ -54,7 +54,7 @@
   for (unsigned int i=0; i<zerocoords.size(); ++i)
   {
     VERIFY_IS_MUCH_SMALLER_THAN( v1.coeff(zerocoords[i]), eps );
-    VERIFY_RAISES_ASSERT( v1.coeffRef(zerocoords[i]) = 5 );
+    //VERIFY_RAISES_ASSERT( v1.coeffRef(zerocoords[i]) = 5 );
   }
   {
     VERIFY(int(nonzerocoords.size()) == v1.nonZeros());