From d9b7f5562a1c207477fd0643caf8c4797a461336 Mon Sep 17 00:00:00 2001 From: Wolfgang Bangerth Date: Tue, 30 Oct 2018 14:23:24 +0100 Subject: [PATCH] improve documentation Co-Authored-By: davydden --- include/deal.II/base/utilities.h | 2 +- source/base/utilities.cc | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/include/deal.II/base/utilities.h b/include/deal.II/base/utilities.h index 3cb5a2e6fc..a79c44664c 100644 --- a/include/deal.II/base/utilities.h +++ b/include/deal.II/base/utilities.h @@ -111,7 +111,7 @@ namespace Utilities * bits\_per\_dim * dim <= 64. * * @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 std::lexicographical_compare(). */ template diff --git a/source/base/utilities.cc b/source/base/utilities.cc index 50a755d2a6..d8a940908f 100644 --- 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; } -- 2.39.5