Rosetta 3.3
|
#include <iostream>
#include <string>
#include <limits>
#include <cmath>
#include <complex>
#include <vector>
Classes | |
class | numeric::fourier::kiss_fft_state |
class | numeric::fourier::kiss_fftr_state |
class | numeric::fourier::kiss_fftnd_state |
class | numeric::fourier::kiss_fftndr_state |
Namespaces | |
namespace | numeric |
A 1D histogram based upon a map structure. | |
namespace | numeric::fourier |
Defines | |
#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_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 |
#define kiss_fft_scalar double |
#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.