From 72a1804c4c6339d761f43ac104590d52325e8364 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Wed, 17 Jun 1998 09:48:45 +0000 Subject: [PATCH] Doc updates. git-svn-id: https://svn.dealii.org/trunk@408 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/deal.II/include/grid/tria.h | 35 ++++++++++++++++++----------- 1 file changed, 22 insertions(+), 13 deletions(-) diff --git a/deal.II/deal.II/include/grid/tria.h b/deal.II/deal.II/include/grid/tria.h index a99aa6aeeb..276fe663a1 100644 --- a/deal.II/deal.II/include/grid/tria.h +++ b/deal.II/deal.II/include/grid/tria.h @@ -2271,7 +2271,7 @@ class Triangulation : public TriaDimensionInfo { /** - * @name Information about the triangulation + * @name Information about the triangulation */ /*@{*/ /** @@ -2398,10 +2398,10 @@ class Triangulation : public TriaDimensionInfo { unsigned int n_active_cells () const; /** - * Return total number of active cells - * on level #level#. - * Maps to #n_active_lines(level)# in one space - * dimension and so on. + * Return total number of active cells + * on level #level#. + * Maps to #n_active_lines(level)# in one + * space dimension and so on. * * Regarding the computational effort of * this function, the same applies as @@ -2410,22 +2410,31 @@ class Triangulation : public TriaDimensionInfo { unsigned int n_active_cells (const unsigned int level) const; /** - * Return number of levels in use. + * Return number of levels in use. This + * may be less than the number of levels + * existing in the triangulation if by + * coarsening the highest level was + * completely depopulated. That level is + * not removed, since it will most likely + * be repopulated soon by the next + * refinement process. */ unsigned int n_levels () const; /** - * Return the maximum number of cells meeting - * at a common vertex. Since this number is - * an invariant under refinement, only the cells - * on the coarsest level are considered. The + * Return the maximum number of cells + * meeting at a common vertex. Since this + * number is an invariant under refinement, + * only the cells on + * the coarsest level are considered. The * operation is thus reasonably fast. The * invariance is only true for sufficiently * many cells in the coarsest triangulation - * (e.g. for a single cell one would be returned), + * (e.g. for a single cell one would be + * returned), * so a minimum of four is returned in - * two dimensions, 8 in three dimensions, etc, - * which is how many cells meet if the + * two dimensions, 8 in three dimensions, + * etc, which is how many cells meet if the * triangulation is refined. * * In one space dimension, two is returned. -- 2.39.5