From c2d09d3eb1cd8614eb109bbf227c7a078b64c0df Mon Sep 17 00:00:00 2001
From: Benjamin Brands <benjamin.brands@fau.de>
Date: Fri, 23 Feb 2018 00:59:35 +0100
Subject: [PATCH] fix_minor_flaw_in_documentation

---
 include/deal.II/base/table.h | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/include/deal.II/base/table.h b/include/deal.II/base/table.h
index 4526cd1514..d568d0b9cb 100644
--- a/include/deal.II/base/table.h
+++ b/include/deal.II/base/table.h
@@ -538,16 +538,16 @@ public:
    * in the equivalent of doing
    * @code
    *   Table<2,T> t;
-   *   for (unsigned int i=0; i<t.sizes()[0]; ++i)
-   *     for (unsigned int j=0; j<t.sizes()[1]; ++j)
+   *   for (unsigned int i=0; i<t.size(0); ++i)
+   *     for (unsigned int j=0; j<t.size(1); ++j)
    *       t[i][j] = *entries++;
    * @endcode
    * On the other hand, if the second argument to this function is false, then
    * this would result in code of the following form:
    * @code
    *   Table<2,T> t;
-   *   for (unsigned int j=0; j<t.sizes()[1]; ++j)
-   *     for (unsigned int i=0; i<t.sizes()[0]; ++i)
+   *   for (unsigned int j=0; j<t.size(1); ++j)
+   *     for (unsigned int i=0; i<t.size(0); ++i)
    *       t[i][j] = *entries++;
    * @endcode
    * Note the switched order in which we fill the table elements by traversing
-- 
2.39.5