Clarify runtime results.

git-svn-id: https://svn.dealii.org/trunk@15874 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/deal.II/include/dofs/dof_renumbering.h b/deal.II/deal.II/include/dofs/dof_renumbering.h
index f2b5e942fa2f0ed0a9eb9d4fe920362bbffc0097..632ca14b95d1dc9575e8962b4995184efee02e05 100644 (file)
--- a/deal.II/deal.II/include/dofs/dof_renumbering.h
+++ b/deal.II/deal.II/include/dofs/dof_renumbering.h
@@ -231,7 +231,11 @@ DEAL_II_NAMESPACE_OPEN
  * consequently the better the renumbering of degrees of freedom is
  * suited for this task. We also state the run-time of the program, in
  * part determined by the number of iterations needed, for the first 4
- * cycles on one of our machines.
+ * cycles on one of our machines. Note that the reported times
+ * correspond to the run time of the entire program, not just the
+ * affected solver; if a program runs twice as fast with one
+ * particular ordering than with another one, then this means that the
+ * actual solver is actually several times faster.
  *
  * <table>
  * <tr>