Remove some unnecessary ';'s.

diff --git a/include/deal.II/numerics/time_dependent.h b/include/deal.II/numerics/time_dependent.h
index 621ec62f9d797315871b038f81cf29be759e90e0..d215ed31cdf8bb30163f3ede88b0c7cf9ee1857b 100644 (file)
--- a/include/deal.II/numerics/time_dependent.h
+++ b/include/deal.II/numerics/time_dependent.h
@@ -1569,8 +1569,8 @@ void TimeDependent::do_loop (InitFunctionObject      init_function,
             if (n_timesteps-(step-look_back) <= n_timesteps)
               timesteps[n_timesteps-(step-look_back)-1]->sleep(look_back);
             break;
-          };
-    };
+          }
+    }
 
   // make the last few timesteps sleep
   for (int step=n_timesteps;

diff --git a/source/lac/constraint_matrix.cc b/source/lac/constraint_matrix.cc
index 5939293efa072ea854a32f49a2ba2113b997e676..d4290717457a80fbd6f8bf50ec39d54607b83941 100644 (file)
--- a/source/lac/constraint_matrix.cc
+++ b/source/lac/constraint_matrix.cc
@@ -838,8 +838,8 @@ void ConstraintMatrix::condense (DynamicSparsityPattern &sparsity) const
                     if ((new_col < column) && (old_rowlength != new_rowlength))
                       ++j;
                     old_rowlength = new_rowlength;
-                  };
-              };
+                  }
+              }
           }
       else
         // row must be distributed
@@ -864,8 +864,8 @@ void ConstraintMatrix::condense (DynamicSparsityPattern &sparsity) const
                   sparsity.add (lines[distribute[row]].entries[p].first,
                                 lines[distribute[sparsity.column_number(row,j)]]
                                 .entries[q].first);
-          };
-    };
+          }
+    }
 }
 
 
@@ -1049,9 +1049,9 @@ void ConstraintMatrix::condense (BlockDynamicSparsityPattern &sparsity) const
                            .entries.size(); ++q)
                         sparsity.add (row,
                                       lines[distribute[global_col]].entries[q].first);
-                    };
-                };
-            };
+                    }
+                }
+            }
         }
       else
         {
@@ -1086,11 +1086,11 @@ void ConstraintMatrix::condense (BlockDynamicSparsityPattern &sparsity) const
                         for (size_type q=0; q!=lines[distribute[global_col]].entries.size(); ++q)
                           sparsity.add (lines[distribute[row]].entries[p].first,
                                         lines[distribute[global_col]].entries[q].first);
-                    };
-                };
-            };
-        };
-    };
+                    }
+                }
+            }
+        }
+    }
 }