Version bump, license year update

Author: j-fu

LICENSE

@@ -2,7 +2,7 @@ LICENSE
 
 ExtendableSparse.jl is open-source code licensed under the BSD license.
 
-Copyright (c) 2018 Jürgen Fuhrmann <[email protected]>
+Copyright (c) 2019-2020 Jürgen Fuhrmann <[email protected]>
 
 All rights reserved.
 

Project.toml

@@ -1,7 +1,7 @@
 name = "ExtendableSparse"
 uuid = "95c220a8-a1cf-11e9-0c77-dbfce5f500b3"
 authors = ["Juergen Fuhrmann <[email protected]>"]
-version = "0.2.5"
+version = "0.2.6"
 
 [deps]
 DocStringExtensions = "ffbed154-4ef7-542d-bbb7-c09d3a79fcae"

README.md

@@ -6,7 +6,7 @@
 
 
 
-Sparse matrix class with efficient successive insertion of entries.
+Sparse matrix class with efficient successive insertion of entries and entry update.
 
 Without an intermediate data structure, efficient successive insertion/update of possibly duplicate entries in random order into a standard compressed colume storage structure appears to be not possible. The package introduces `ExtendableSparseMatrix`, a delegating wrapper containing a Julia standard `SparseMatrixCSC` struct for performing linear algebra operations and a `SparseMatrixLNK` struct realising a linked list based (but realised in vectors) format collecting new entries.
 
@@ -16,7 +16,13 @@ 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 `%1 = Base.getindex(A, 1, 2); %2 = %1 + 3;  Base.setindex!(A, %2, 1, 2)` triggering two index searches, one for `getindex!` and another one for `setindex!`.
+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 
+````
+%1 = Base.getindex(A, 1, 2)
+%2 = %1 + 3
+Base.setindex!(A, %2, 1, 2)
+````
+ triggering two index searches, one for `getindex!` and another one for `setindex!`.