Performs the inverse complex FFT. Input is `2*length` elements. Output is `2*length` elements. Scaling is such that FFT(IFFT(x)) = N*x. */
| 104 | Scaling is such that FFT(IFFT(x)) = N*x. |
| 105 | */ |
| 106 | void ifftUnordered(const float* input, float* output) { |
| 107 | pffft_transform(setup, input, output, NULL, PFFFT_BACKWARD); |
| 108 | } |
| 109 | |
| 110 | void fft(const float* input, float* output) { |
| 111 | pffft_transform_ordered(setup, input, output, NULL, PFFFT_FORWARD); |
nothing calls this directly
no outgoing calls
no test coverage detected