On 1/23/24 13:39, David Brown via Std-Proposals wrote:

> It might help to give a few more examples for some of these functions,

The motivation for reverse_bits() includes FFT, but this should be moved
to the motivation for next_bit_permutation(). The FFT stores the result
in a bit-reversed order, and swapping them back into normal order is
most efficiently done using next_bit_permutation(). For more information
see references in:

   https://en.wikipedia.org/wiki/Bit-reversal_permutation#Algorithms