Binary reordering of array elements. More...
#include <gfftswap.h>
Inheritance diagram for GFFT::GFFTswap2< M, P, T, I >:
Public Member Functions | |
| void | apply (T *data, int_t n=0, int_t r=0) |
Detailed Description
template<uint_t M, uint_t P, typename T, uint_t I = 0>
class GFFT::GFFTswap2< M, P, T, I >
- Template Parameters
-
N length of the data T value type
This is second version of binary reordering. It is based on template class recursion, where member function apply() is called twice recursively for the left and the right half-tree building the parameters n and r, which are the indexes of the exchanged data values.
- See Also
- SwapNR, GFFTswap2OMP
The documentation for this class was generated from the following file: