std :: dsp::fft
#include <std/dsp/fft.h> source ยท definition
#include <std/dsp/fft.h>
int fft_prepare(unsigned long n)
Builds the twiddle table for every length up to n (a power of two), so later transforms of those lengths allocate nothing. 1 on success, 0 if n isn't a power of two or memory ran out.