Compute the Fourier transform of range using the O(N log N)
Cooley-Tukey Algorithm. range must be a random-access range with
slicing and a length equal to size as provided at the construction of
this object. The contents of range can be either numeric types,
which will be interpreted as pure real values, or complex types with
properties or members .re and .im that can be read.
Note: Pure real FFTs are automatically detected and the relevant
optimizations are performed.
Compute the Fourier transform of range using the O(N log N) Cooley-Tukey Algorithm. range must be a random-access range with slicing and a length equal to size as provided at the construction of this object. The contents of range can be either numeric types, which will be interpreted as pure real values, or complex types with properties or members .re and .im that can be read.
Note: Pure real FFTs are automatically detected and the relevant optimizations are performed.