codespell

Author: j-fu

src/genericextendablesparsematrixcsc.jl

@@ -4,7 +4,7 @@
 Single threaded extendable sparse matrix parametrized by sparse matrix extension.
 
 Fields:
-- `cscmatrix`: a SparseMatrixCSC  containg existing matrix entries
+- `cscmatrix`: a SparseMatrixCSC  containing existing matrix entries
 - `xmatrix`: instance of an [`AbstractSparseMatrixExtension`](@ref) which is used to collect new entries
 """
 mutable struct GenericExtendableSparseMatrixCSC{Tm <: AbstractSparseMatrixExtension, Tv, Ti <: Integer} <: AbstractExtendableSparseMatrixCSC{Tv, Ti}

src/genericmtextendablesparsematrixcsc.jl

@@ -6,14 +6,14 @@ Extendable sparse matrix parametrized by sparse matrix extension allowing multit
 parallel matrix-vector multiplication.
 
 Fields:
-- `cscmatrix`: a SparseMatrixCSC  containg existing matrix entries
+- `cscmatrix`: a SparseMatrixCSC  containing existing matrix entries
 - `xmatrices`: vector of instances of [`AbstractSparseMatrixExtension`](@ref) used to collect new entries
 - `colparts`: vector describing colors of the partitions of the unknowns
 - `partnodes`: vector describing partition of the unknowns
 
 It is assumed that the set of unknowns is partitioned, and the partitioning is colored in such a way that
-several partitions of the same color can be handeled by different threads, both during matrix assembly (which
-in general would use a partition of e.g. finite elements compatible to the partioning of the nodes) and during
+several partitions of the same color can be handled by different threads, both during matrix assembly (which
+in general would use a partition of e.g. finite elements compatible to the partitioning of the nodes) and during
 matrix-vector multiplication. This approach is compatible with the current choice of the standard Julia
 sparse  ecosystem which prefers compressed colume storage (CSC) over compressed row storage (CSR).