From: David Wells Date: Sun, 29 Apr 2018 18:08:32 +0000 (-0400) Subject: Rewrap some comments. X-Git-Tag: v9.1.0-rc1~1105^2~6 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=865def91abb6049b5d5a2e825e18b2fc4b9257bb;p=dealii.git Rewrap some comments. --- diff --git a/source/grid/grid_out.cc b/source/grid/grid_out.cc index 4de8b5bf29..435016e07c 100644 --- a/source/grid/grid_out.cc +++ b/source/grid/grid_out.cc @@ -3172,11 +3172,8 @@ namespace internal const typename dealii::Triangulation::active_cell_iterator endc=tria.end(); - // if we are to treat curved - // boundaries, then generate a - // quadrature formula which will be - // used to probe boundary points at - // curved faces + // If we need to plot curved lines then generate a quadrature formula to + // place points via the mapping Quadrature *q_projector=nullptr; std::vector > boundary_points; if (mapping!=nullptr) @@ -3201,13 +3198,9 @@ namespace internal if (mapping==nullptr || (!cell->at_boundary() && !gnuplot_flags.curved_inner_cells)) { - // write out the four sides - // of this cell by putting - // the four points (+ the - // initial point again) in - // a row and lifting the - // drawing pencil at the - // end + // write out the four sides of this cell by putting the four + // points (+ the initial point again) in a row and lifting the + // drawing pencil at the end for (unsigned int i=0; i::vertices_per_cell; ++i) out << cell->vertex(GeometryInfo::ucd_to_deal[i]) << ' ' << cell->level() @@ -3219,11 +3212,8 @@ namespace internal << '\n'; } else - // cell is at boundary and we - // are to treat curved - // boundaries. so loop over - // all faces and draw them as - // small pieces of lines + // cell is at boundary and we are to treat curved boundaries. so + // loop over all faces and draw them as small pieces of lines { for (unsigned int face_no=0; face_no::faces_per_cell; ++face_no) @@ -3232,11 +3222,8 @@ namespace internal face = cell->face(face_no); if (face->at_boundary() || gnuplot_flags.curved_inner_cells) { - // compute offset - // of quadrature - // points within - // set of projected - // points + // compute offset of quadrature points within set of + // projected points const unsigned int offset=face_no*n_points; for (unsigned int i=0; itransform_unit_to_real_cell @@ -3250,11 +3237,8 @@ namespace internal } else { - // if, however, the - // face is not at - // the boundary, - // then draw it as - // usual + // if, however, the face is not at the boundary, then + // draw it as usual out << face->vertex(0) << ' ' << cell->level() << ' ' << static_cast(cell->material_id()) @@ -3273,8 +3257,7 @@ namespace internal if (q_projector != nullptr) delete q_projector; - // make sure everything now gets to - // disk + // make sure everything now gets to disk out.flush (); AssertThrow (out, ExcIO()); @@ -3301,11 +3284,8 @@ namespace internal const typename dealii::Triangulation::active_cell_iterator endc=tria.end(); - // if we are to treat curved - // boundaries, then generate a - // quadrature formula which will be - // used to probe boundary points at - // curved faces + // If we need to plot curved lines then generate a quadrature formula to + // place points via the mapping Quadrature *q_projector=nullptr; std::vector > boundary_points; if (mapping!=nullptr) @@ -3319,8 +3299,7 @@ namespace internal std::vector dummy_weights(n_points, 1./n_points); Quadrature<1> quadrature1d(boundary_points, dummy_weights); - // tensor product of points, - // only one copy + // tensor product of points, only one copy QIterated quadrature(quadrature1d, 1); q_projector = new Quadrature (QProjector::project_to_all_faces(quadrature)); } @@ -3428,10 +3407,7 @@ namespace internal cell, q_projector->point(offset+i*n_points+j+1))) << ' ' << cell->level() << ' ' << static_cast(cell->material_id()) << '\n'; - // and the - // first - // point - // again + // and the first point again out << p0 << ' ' << cell->level() << ' ' << static_cast(cell->material_id()) << '\n'; @@ -3449,14 +3425,9 @@ namespace internal &v1=line->vertex(1); if (line->at_boundary() || gnuplot_flags.curved_inner_cells) { - // transform_real_to_unit_cell - // could be - // replaced - // by using - // QProjector::project_to_line - // which is - // not yet - // implemented + // transform_real_to_unit_cell could be replaced + // by using QProjector::project_to_line + // which is not yet implemented const Point u0=mapping->transform_real_to_unit_cell(cell, v0), u1=mapping->transform_real_to_unit_cell(cell, v1); @@ -3485,8 +3456,7 @@ namespace internal delete q_projector; - // make sure everything now gets to - // disk + // make sure everything now gets to disk out.flush (); AssertThrow (out, ExcIO());