Struct FftCache 

pub(crate) struct FftCache<T> {
    forward_cache: HashMap<usize, Arc<dyn Fft<T>>>,
    inverse_cache: HashMap<usize, Arc<dyn Fft<T>>>,
}

Fields

forward_cache: HashMap<usize, Arc<dyn Fft<T>>>

inverse_cache: HashMap<usize, Arc<dyn Fft<T>>>

Implementations

impl<T> FftCache<T>

pub fn new() -> Self

pub fn contains_fft(&self, len: usize, direction: FftDirection) -> bool

pub fn get( &self, len: usize, direction: FftDirection, ) -> Option<Arc<dyn Fft<T>>>

pub fn insert(&mut self, fft: &Arc<dyn Fft<T>>)