From 5ccb72b2e49435488b57bb171d46afc180ff4bab Mon Sep 17 00:00:00 2001 From: Jonas Harsch Date: Mon, 26 Jul 2021 07:20:19 +0000 Subject: [PATCH] Fixed typo in TutorialSparse.dox (cherry picked from commit 5b81764c0f4e06ff12a0c769b1bd876b10ad7502) --- doc/TutorialSparse.dox | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/TutorialSparse.dox b/doc/TutorialSparse.dox index 350ea1139..c69171ec5 100644 --- a/doc/TutorialSparse.dox +++ b/doc/TutorialSparse.dox @@ -60,7 +60,7 @@ On the other hand, inserting elements with increasing inner indices in a given i The case where no empty space is available is a special case, and is referred as the \em compressed mode. It corresponds to the widely used Compressed Column (or Row) Storage schemes (CCS or CRS). Any SparseMatrix can be turned to this form by calling the SparseMatrix::makeCompressed() function. -In this case, one can remark that the \c InnerNNZs array is redundant with \c OuterStarts because we the equality: \c InnerNNZs[j] = \c OuterStarts[j+1]-\c OuterStarts[j]. +In this case, one can remark that the \c InnerNNZs array is redundant with \c OuterStarts because we have the equality: \c InnerNNZs[j] = \c OuterStarts[j+1]-\c OuterStarts[j]. Therefore, in practice a call to SparseMatrix::makeCompressed() frees this buffer. It is worth noting that most of our wrappers to external libraries requires compressed matrices as inputs.