From 0e4161f29c5fcbe8be95abbb887db33b3a2f7958 Mon Sep 17 00:00:00 2001 From: wolf Date: Fri, 28 May 1999 09:24:21 +0000 Subject: [PATCH] Add doc for a traphole. git-svn-id: https://svn.dealii.org/trunk@1352 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/lac/source/sparse_matrix.cc | 8 ++++++++ 1 file changed, 8 insertions(+) diff --git a/deal.II/lac/source/sparse_matrix.cc b/deal.II/lac/source/sparse_matrix.cc index 4c7a1a33e4..d1ae0644c5 100644 --- a/deal.II/lac/source/sparse_matrix.cc +++ b/deal.II/lac/source/sparse_matrix.cc @@ -366,6 +366,14 @@ SparseMatrixStruct::operator () (const unsigned int i, const unsigned int j) con // all other entries are sorted, so // we can use a binary seach algorithm + // + // note that the entries are only sorted + // upon compression, so this would fail + // for non-compressed sparsity patterns; + // however, that is why the Assertion is + // at the top of this function, so it + // may not be called for noncompressed + // structures. const int * const p = lower_bound (&colnums[rowstart[i]+1], &colnums[rowstart[i+1]], static_cast(j)); -- 2.39.5