|   | Name | Description | 
|---|
   | Forward(Complex) | 
            Applies the forward Fast Fourier Transform (FFT) to arbitrary-length sample vectors.
             | 
   | Forward(Complex32) | 
            Applies the forward Fast Fourier Transform (FFT) to arbitrary-length sample vectors.
             | 
   | Forward(Complex, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to arbitrary-length sample vectors.
             | 
   | Forward(Complex32, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to arbitrary-length sample vectors.
             | 
   | Forward(Double, Double, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to arbitrary-length sample vectors.
             | 
   | Forward(Single, Single, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to arbitrary-length sample vectors.
             | 
   | Forward2D(MatrixComplex32, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to a two dimensional data in form of a matrix.
             | 
   | Forward2D(MatrixComplex, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to a two dimensional data in form of a matrix.
             | 
   | Forward2D(Complex, Int32, Int32, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to two dimensional sample data.
             | 
   | Forward2D(Complex32, Int32, Int32, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to two dimensional sample data.
             | 
   | ForwardMultiDim(Complex, Int32, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to multiple dimensional sample data.
             | 
   | ForwardMultiDim(Complex32, Int32, FourierOptions) | 
            Applies the forward Fast Fourier Transform (FFT) to multiple dimensional sample data.
             | 
   | ForwardReal(Double, Int32, FourierOptions) | 
            Packed Real-Complex forward Fast Fourier Transform (FFT) to arbitrary-length sample vectors.
            Since for real-valued time samples the complex spectrum is conjugate-even (symmetry),
            the spectrum can be fully reconstructed form the positive frequencies only (first half).
            The data array needs to be N+2 (if N is even) or N+1 (if N is odd) long in order to support such a packed spectrum.
             | 
   | ForwardReal(Single, Int32, FourierOptions) | 
            Packed Real-Complex forward Fast Fourier Transform (FFT) to arbitrary-length sample vectors.
            Since for real-valued time samples the complex spectrum is conjugate-even (symmetry),
            the spectrum can be fully reconstructed from the positive frequencies only (first half).
            The data array needs to be N+2 (if N is even) or N+1 (if N is odd) long in order to support such a packed spectrum.
             | 
   | FrequencyScale | 
            Generate the frequencies corresponding to each index in frequency space.
            The frequency space has a resolution of sampleRate/N.
            Index 0 corresponds to the DC part, the following indices correspond to
            the positive frequencies up to the Nyquist frequency (sampleRate/2),
            followed by the negative frequencies wrapped around.
             | 
   | Inverse(Complex) | 
            Applies the inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
             | 
   | Inverse(Complex32) | 
            Applies the inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
             | 
   | Inverse(Complex, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
             | 
   | Inverse(Complex32, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
             | 
   | Inverse(Double, Double, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
             | 
   | Inverse(Single, Single, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
             | 
   | Inverse2D(MatrixComplex32, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to a two dimensional data in form of a matrix.
             | 
   | Inverse2D(MatrixComplex, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to a two dimensional data in form of a matrix.
             | 
   | Inverse2D(Complex, Int32, Int32, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to two dimensional sample data.
             | 
   | Inverse2D(Complex32, Int32, Int32, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to two dimensional sample data.
             | 
   | InverseMultiDim(Complex, Int32, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to multiple dimensional sample data.
             | 
   | InverseMultiDim(Complex32, Int32, FourierOptions) | 
            Applies the inverse Fast Fourier Transform (iFFT) to multiple dimensional sample data.
             | 
   | InverseReal(Double, Int32, FourierOptions) | 
            Packed Real-Complex inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
            Since for real-valued time samples the complex spectrum is conjugate-even (symmetry),
            the spectrum can be fully reconstructed form the positive frequencies only (first half).
            The data array needs to be N+2 (if N is even) or N+1 (if N is odd) long in order to support such a packed spectrum.
             | 
   | InverseReal(Single, Int32, FourierOptions) | 
            Packed Real-Complex inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
            Since for real-valued time samples the complex spectrum is conjugate-even (symmetry),
            the spectrum can be fully reconstructed form the positive frequencies only (first half).
            The data array needs to be N+2 (if N is even) or N+1 (if N is odd) long in order to support such a packed spectrum.
             |