pub fn fft<T: FFT>(v: &[T::F], inverse: bool) -> Vec<T::F>Expand description
Computes the discrete fourier transform of v, whose length is a power of 2. Forward transform: polynomial coefficients -> evaluate at roots of unity Inverse transform: values at roots of unity -> interpolated coefficients