From 523ef66a8482adeb1e8cd4297c09f6346c313427 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?J=C3=BCrgen=20Fuhrmann?= Date: Tue, 20 Oct 2026 23:27:23 +0200 Subject: [PATCH 1/2] bump patch version --- Project.toml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Project.toml b/Project.toml index 135f7e0..294fadf 100644 --- a/Project.toml +++ b/Project.toml @@ -1,6 +1,6 @@ name = "ExtendableSparse" uuid = "95c220a8-a1cf-11e9-0c77-dbfce5f500b3" -version = "2.5.0" +version = "2.5.1" authors = ["Juergen Fuhrmann ", "Daniel Runge"] [deps] From 9018867146080c169b46dfe9106612146413fcac Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?J=C3=BCrgen=20Fuhrmann?= Date: Tue, 20 Oct 2026 23:31:00 +0200 Subject: [PATCH 2/2] typo --- src/genericmtextendablesparsematrixcsc.jl | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/genericmtextendablesparsematrixcsc.jl b/src/genericmtextendablesparsematrixcsc.jl index d980b93..25f835a 100644 --- a/src/genericmtextendablesparsematrixcsc.jl +++ b/src/genericmtextendablesparsematrixcsc.jl @@ -15,7 +15,7 @@ It is assumed that the set of unknowns is partitioned, and the partitioning is c 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). +sparse ecosystem which prefers compressed column storage (CSC) over compressed row storage (CSR). """ mutable struct GenericMTExtendableSparseMatrixCSC{Tm <: AbstractSparseMatrixExtension, Tv, Ti <: Integer} <: AbstractExtendableSparseMatrixCSC{Tv, Ti}