From 9ed93b28a9d217f1e191ff6c44d38d3084660c3a Mon Sep 17 00:00:00 2001
From: guido <guido@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Tue, 22 Apr 2003 07:40:45 +0000
Subject: [PATCH] Avoid iterator past end

git-svn-id: https://svn.dealii.org/trunk@7442 0785d39b-7218-0410-832d-ea1e28bc413d
---
 deal.II/lac/include/lac/sparse_matrix_ez.h | 16 +++++++++++++---
 1 file changed, 13 insertions(+), 3 deletions(-)

diff --git a/deal.II/lac/include/lac/sparse_matrix_ez.h b/deal.II/lac/include/lac/sparse_matrix_ez.h
index 18d8b92580..f9f286cbfa 100644
--- a/deal.II/lac/include/lac/sparse_matrix_ez.h
+++ b/deal.II/lac/include/lac/sparse_matrix_ez.h
@@ -1474,11 +1474,21 @@ SparseMatrixEZ<number>::begin (const unsigned int r) const
 template <typename number>
 inline
 typename SparseMatrixEZ<number>::const_iterator
-SparseMatrixEZ<number>::end (const unsigned int r) const
+SparseMatrixEZ<number>::end (unsigned int r) const
 {
   Assert (r<m(), ExcIndexRange(r,0,m()));
-  const_iterator result(this, r+1, 0);
-  if (row_info[r+1].length == 0)
+
+				   // Usually, we should return the
+				   // first element of the next row.
+  const_iterator result(this, ++r, 0);
+
+				   // If r was the last row, this is
+				   // always true. Otherwise, we have
+				   // to make sure that there IS an
+				   // entry in the next row. If not,
+				   // we advance to the next valid
+				   // entry or end().
+  if (r < row_info.size() && row_info[r].length == 0)
     ++result;
   return result;
 }
-- 
2.39.5