From c652c65933a4c925e94929e7e5d3f5788f1e01a8 Mon Sep 17 00:00:00 2001 From: Timo Heister Date: Wed, 31 Oct 2018 08:27:00 +0100 Subject: [PATCH] improve documentation Co-Authored-By: davydden --- include/deal.II/base/utilities.h | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/include/deal.II/base/utilities.h b/include/deal.II/base/utilities.h index 846357a59f..e1598c2787 100644 --- a/include/deal.II/base/utilities.h +++ b/include/deal.II/base/utilities.h @@ -104,12 +104,12 @@ namespace Utilities const int bits_per_dim = 64); /** - * Interleave the least significant @p bits_per_dim bits from each element of @p index + * Pack the least significant @p bits_per_dim bits from each element of @p index * (starting from last) into a single unsigned integer. The last element - * of @p index will be used to set the first @p bits_per_dim in the - * resulting integer, the pre last element is used to set the next @p bits_per_dim, - * etc. Clearly, the following should hold bits\_per\_dim * dim <= - * 64. + * of @p index will be used to set the first @p bits_per_dim bits in the + * resulting integer, the second to last element is used to set the next @p bits_per_dim bits, + * etc.. To fit all the data into the output, the following should hold + * bits\_per\_dim * dim <= 64. * * The function is useful in debugging and visualization of indices returned * by inverse_Hilbert_space_filling_curve(). -- 2.39.5