Enum FftAlgorithm 

pub enum FftAlgorithm {
    CooleyTukeyRadix2,
    Radix4,
    SplitRadix,
    MixedRadix,
    Bluestein,
    Rader,
    Winograd,
    GoodThomas,
    Streaming,
    CacheOblivious,
    InPlace,
    SimdOptimized,
    Parallel,
    Hybrid,
}

FFT Algorithm variants available for selection

Variants

CooleyTukeyRadix2

Standard Cooley-Tukey radix-2 FFT (optimal for power-of-2 sizes)

Radix4

Radix-4 FFT (faster for sizes that are powers of 4)

SplitRadix

Split-radix FFT (good balance of speed and memory)

MixedRadix

Mixed-radix FFT (handles non-power-of-2 sizes efficiently)

Bluestein

Bluestein’s algorithm (handles prime and arbitrary sizes)

Rader

Rader’s algorithm (efficient for prime sizes)

Winograd

Winograd FFT (minimal multiplications)

GoodThomas

Good-Thomas PFA (prime factor algorithm)

Streaming

Streaming FFT (memory-efficient for very large inputs)

CacheOblivious

Cache-oblivious FFT (optimized cache behavior)

InPlace

In-place FFT (minimal memory overhead)

SimdOptimized

SIMD-optimized FFT

Parallel

Parallel FFT (multi-threaded)

Hybrid

Hybrid (combines multiple algorithms)

Trait Implementations

impl Clone for FftAlgorithm

fn clone(&self) -> FftAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for FftAlgorithm

impl Debug for FftAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for FftAlgorithm

fn default() -> FftAlgorithm

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for FftAlgorithm

fn deserialize<__D>( __deserializer: __D, ) -> Result<FftAlgorithm, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for FftAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Eq for FftAlgorithm

impl Hash for FftAlgorithm

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for FftAlgorithm

fn eq(&self, other: &FftAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for FftAlgorithm

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for FftAlgorithm