improve documentation

Co-Authored-By: davydden <davydden@gmail.com>

diff --git a/include/deal.II/base/utilities.h b/include/deal.II/base/utilities.h
index 3cb5a2e6fc02496f772a08dea703856100b30679..a79c44664c4462008a66b1d78eabf7bacb9f758b 100644 (file)
--- a/include/deal.II/base/utilities.h
+++ b/include/deal.II/base/utilities.h
@@ -111,7 +111,7 @@ namespace Utilities
    * <code>bits\_per\_dim * dim <= 64</code>.
    *
    * @note There is no need to use this function in order to compare indices
-   * returned by inverse_Hilbert_space_filling_curve(), that can be easily done
+   * returned by inverse_Hilbert_space_filling_curve(), as that can easily be done
    * via <code>std::lexicographical_compare()</code>.
    */
   template <int dim>

diff --git a/source/base/utilities.cc b/source/base/utilities.cc
index 50a755d2a6e6c4fb636605d81401598682e6e48c..d8a940908f1bb78675dfd732ef99401ad8d14269 100644 (file)
--- a/source/base/utilities.cc
+++ b/source/base/utilities.cc
@@ -283,7 +283,7 @@ namespace Utilities
     Integer res = 0;
     for (unsigned int i = 0; i < dim; ++i)
       {
-        // take @bits_per_dim from each integer and shift them
+        // take bits_per_dim from each integer and shift them
         const Integer v = (mask & index[dim - 1 - i]) << (bits_per_dim * i);
         res |= v;
       }