Rosetta
|
#include <complex>
#include <vector>
Go to the source code of this file.
Namespaces | |
numeric | |
Unit headers. | |
numeric::fourier | |
Macros | |
#define | kiss_fft_scalar double |
#define | KISSFFT_MAXFACTORS 32 |
Typedefs | |
typedef std::complex < kiss_fft_scalar > | numeric::fourier::kiss_fft_cpx |
typedef class kiss_fft_state * | numeric::fourier::kiss_fft_cfg |
typedef class kiss_fftsplit_state * | numeric::fourier::kiss_fftsplit_cfg |
typedef class kiss_dct_state * | numeric::fourier::kiss_dct_cfg |
typedef class kiss_fftnd_state * | numeric::fourier::kiss_fftnd_cfg |
typedef class kiss_fftr_state * | numeric::fourier::kiss_fftr_cfg |
typedef class kiss_fftndr_state * | numeric::fourier::kiss_fftndr_cfg |
Definition in file kiss_fft_state.hh.
#define kiss_fft_scalar double |
Definition at line 23 of file kiss_fft_state.hh.
Referenced by numeric::fourier::kiss_idct().
#define KISSFFT_MAXFACTORS 32 |
In addition to state info, the state variables also contain a pointer to a precomputed buffer. To avoid frequent allocation/recalculation of this buffer, it may make sense to cache these buffers If many FFTs of the same size were requested, only a single allocation would be needed However, if many different-sized FFTs were desired, the memory usage of the cache could be quite large.
Definition at line 33 of file kiss_fft_state.hh.