]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Doc updates.
authorWolfgang Bangerth <bangerth@math.tamu.edu>
Wed, 17 Jun 1998 09:48:45 +0000 (09:48 +0000)
committerWolfgang Bangerth <bangerth@math.tamu.edu>
Wed, 17 Jun 1998 09:48:45 +0000 (09:48 +0000)
git-svn-id: https://svn.dealii.org/trunk@408 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/deal.II/include/grid/tria.h

index a99aa6aeebfd0559ea337b6e2e6164491d5f5922..276fe663a1853900d4ebdfa4135a8640c55ace3a 100644 (file)
@@ -2271,7 +2271,7 @@ class Triangulation : public TriaDimensionInfo<dim> {
 
     
                                     /**
-                                     *  @name Information about the triangulation
+                                     * @name Information about the triangulation
                                      */
                                     /*@{*/
                                     /**
@@ -2398,10 +2398,10 @@ class Triangulation : public TriaDimensionInfo<dim> {
     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<dim> {
     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.

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.