From: bangerth Date: Fri, 12 Feb 2010 22:35:38 +0000 (+0000) Subject: Don't use #word but word. X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=53b46fe1b133461391bf65e30d3208e294d98e88;p=dealii-svn.git Don't use #word but word. git-svn-id: https://svn.dealii.org/trunk@20577 0785d39b-7218-0410-832d-ea1e28bc413d --- diff --git a/deal.II/examples/step-38/step-38.cc b/deal.II/examples/step-38/step-38.cc index 21935f5fc6..eb030711a7 100644 --- a/deal.II/examples/step-38/step-38.cc +++ b/deal.II/examples/step-38/step-38.cc @@ -163,16 +163,18 @@ class Step12 FE_DGQ fe; DoFHandler dof_handler; - // The next four members - // represent the linear system to - // be solved. #system_matrix and - // #right_hand_side are generated - // by assemble_system(), the - // #solution is computed in - // solve(). The #sparsity_pattern - // is used to determine the - // location of nonzero elements - // in #system_matrix. + // The next four members represent the + // linear system to be + // solved. system_matrix and + // right_hand_side are + // generated by + // assemble_system(), the + // solution is computed in + // solve(). The + // sparsity_pattern is used + // to determine the location of nonzero + // elements in + // system_matrix. SparsityPattern sparsity_pattern; SparseMatrix system_matrix; @@ -235,9 +237,9 @@ class Step12 }; - // We start with the constructor. The - // 1 in the constructor call of #fe - // is the polynomial degree. + // We start with the constructor. The 1 in + // the constructor call of fe is + // the polynomial degree. template Step12::Step12 () : @@ -254,16 +256,14 @@ void Step12::setup_system () // need to distribute the DoFs. dof_handler.distribute_dofs (fe); - // We start by generating the - // sparsity pattern. To this end, - // we first fill an intermediate - // object of type - // CompressedSparsityPattern with - // the couplings appearing in the - // system. After building the - // pattern, this object is copied - // to #sparsity_pattern and can be - // discarded. + // We start by generating the sparsity + // pattern. To this end, we first fill an + // intermediate object of type + // CompressedSparsityPattern with the + // couplings appearing in the system. After + // building the pattern, this object is + // copied to sparsity_pattern + // and can be discarded. // To build the sparsity pattern for DG // discretizations, we can call the