fixed too strong type constraint

patch version -> 0.2.7

Author: j-fu

Project.toml

@@ -1,7 +1,7 @@
 name = "ExtendableSparse"
 uuid = "95c220a8-a1cf-11e9-0c77-dbfce5f500b3"
 authors = ["Juergen Fuhrmann <juergen.fuhrmann@wias-berlin.de>"]
-version = "0.2.6"
+version = "0.2.7"
 
 [deps]
 DocStringExtensions = "ffbed154-4ef7-542d-bbb7-c09d3a79fcae"

README.md

@@ -16,7 +16,7 @@ Any linear algebra method on `ExtendableSparseMatrix` starts with a `flush!` met
 
 `ExtendableSparseMatrix` is aimed to work as a drop-in replacement to `SparseMatrixCSC` in finite element and finite volume codes especally in those cases where the sparsity structure is hard to detect a priori and where working with an intermediadte COO representation appears to be not convenient.
 
-In addition, the packages provides a method `updateindex!(A,op,v,i,j)` for both `SparseMatrixCSC` and for `ExtendableSparse` which allows to update a matrix element with one index search instead of two. It allows to replace e.g. `A[i,j]+=v` by `updateindex!(A,+,i,j,v)`. The former operation is lowered to 
+In addition, the package provides a method `updateindex!(A,op,v,i,j)` for both `SparseMatrixCSC` and for `ExtendableSparse` which allows to update a matrix element with one index search instead of two. It allows to replace e.g. `A[i,j]+=v` by `updateindex!(A,+,i,j,v)`. The former operation is lowered to 
 ````
 %1 = Base.getindex(A, 1, 2)
 %2 = %1 + 3

src/sparsematrixlnk.jl

@@ -326,7 +326,7 @@ function Base.:+(lnk::SparseMatrixLNK{Tv,Ti},csc::SparseMatrixCSC{Tv,Ti})::Spars
     for j=1:csc.n
         # Copy extension entries into col and sort them
         k=j
-        l_lnk_col=zero(Ti)
+        l_lnk_col=0
         while k>0
             if lnk.rowval[k]>0
                 l_lnk_col+=1