From c7405f430fb3fcfbdaf1b3824b83793ab57494a9 Mon Sep 17 00:00:00 2001
From: Wolfgang Bangerth <bangerth@math.tamu.edu>
Date: Thu, 23 Apr 2015 06:25:58 -0500
Subject: [PATCH] Fix an oversight in a previous patch for
 DynamicSparsityPattern iterators.

---
 include/deal.II/lac/dynamic_sparsity_pattern.h | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/include/deal.II/lac/dynamic_sparsity_pattern.h b/include/deal.II/lac/dynamic_sparsity_pattern.h
index 21400616d0..6d1cb08a37 100644
--- a/include/deal.II/lac/dynamic_sparsity_pattern.h
+++ b/include/deal.II/lac/dynamic_sparsity_pattern.h
@@ -1073,18 +1073,18 @@ DynamicSparsityPattern::end (const size_type r) const
   // iterator to it. also skip rows for which we do not have
   // store anything based on the IndexSet given to the sparsity
   // pattern
+  //
+  // note: row_length(row) returns zero if the row is not locally stored
   unsigned int row = r+1;
   while ((row<n_rows())
          &&
-         ((row_length(row)==0)
-          ||
-          ((rowset.size() != 0) &&
-           (rowset.is_element(row) == false))))
-
-    if (row == n_rows())
-      return iterator(this);
-    else
-      return iterator(this, row, 0);
+         (row_length(row)==0))
+    ++row;
+
+  if (row == n_rows())
+    return iterator(this);
+  else
+    return iterator(this, row, 0);
 }
 
 
-- 
2.39.5