Highly Efficient FFT for Exascale: HeFFTe v2.3
|
Class to represent the call-graph nodes. More...
#include <heffte_stock_algos.h>
Public Member Functions | |
biFuncNode (size_t sig_size, fft_type type) | |
biFuncNode (size_t sig_size, size_t a, size_t ainv) | |
Public Attributes | |
size_t | sz = 0 |
Fourier_Transform< F, L > | fptr |
size_t | left = 0 |
size_t | right = 0 |
complex_vector< F, L > | workspace |
Class to represent the call-graph nodes.
A class to map out what the call-graph of the FFT will look like, then hold it in memory for the FFTs.