Enum FftAlgorithm 

#[non_exhaustive]
pub enum FftAlgorithm {
    CooleyTukey,
    SplitRadix,
    CacheOblivious,
    Bluestein,
    Rader,
}

Supported FFT algorithm families.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

CooleyTukey

Cooley-Tukey radix-2 DIT (power-of-two sizes only).

SplitRadix

Split-radix algorithm (power-of-two sizes only).

CacheOblivious

Cache-oblivious four-step algorithm (any composite size).

Bluestein

Bluestein’s chirp-z transform (any size including primes).

Rader

Rader’s algorithm for prime sizes.

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 Debug for FftAlgorithm

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

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<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for FftAlgorithm

impl Eq for FftAlgorithm

impl StructuralPartialEq for FftAlgorithm