From: Martin Kronbichler Date: Fri, 28 Aug 2009 10:42:01 +0000 (+0000) Subject: Some more tiny comments changes. X-Git-Tag: v8.0.0~7218 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=a4d3b2166c5f449d23bde9c1d8d9b07b1518cc06;p=dealii.git Some more tiny comments changes. git-svn-id: https://svn.dealii.org/trunk@19350 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-16/step-16.cc b/deal.II/examples/step-16/step-16.cc index ddb02b3816..cf92a5ae1d 100644 --- a/deal.II/examples/step-16/step-16.cc +++ b/deal.II/examples/step-16/step-16.cc @@ -3,7 +3,7 @@ /* $Id$ */ /* */ -/* Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 by the deal.II authors */ +/* Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 by the deal.II authors */ /* */ /* This file is subject to QPL and may not be distributed */ /* without copyright and license information. Please refer */ @@ -94,17 +94,17 @@ class LaplaceProblem Triangulation triangulation; FE_Q fe; - MGDoFHandler mg_dof_handler; + MGDoFHandler mg_dof_handler; SparsityPattern sparsity_pattern; SparseMatrix system_matrix; // Here are the new objects for - // handling level matrices. - MGLevelObject mg_sparsity; - // We use number type float to - // save memory. It's only a - // preconditioner! + // handling level matrices: sparsity + // patterns and matrices. We use number + // type float to save memory. It's only + // a preconditioner! + MGLevelObject mg_sparsity; MGLevelObject > mg_matrices; Vector solution; @@ -112,6 +112,7 @@ class LaplaceProblem }; + // This function is as before. template LaplaceProblem::LaplaceProblem () : @@ -159,13 +160,13 @@ void LaplaceProblem::setup_system () // now but may change in a future // revision). Remark, that the // finest level is nlevels-1. - const unsigned int nlevels = triangulation.n_levels(); // We first have to resize the // container holding the // SparseMatrix classes, since they // have to release their // SparsityPattern before it can be // destroyed. + const unsigned int nlevels = triangulation.n_levels(); mg_matrices.resize(0, nlevels-1); mg_sparsity.resize(0, nlevels-1);