oxifft 0.1.4

Pure Rust implementation of FFTW - the Fastest Fourier Transform in the West
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

//! Core planner and data structures.
//!
//! This module contains the fundamental types and traits that power OxiFFT:
//! - `Float` trait for generic floating-point operations
//! - `Complex<T>` for complex numbers
//! - `Tensor` and `IoDim` for N-dimensional data representation
//! - `Problem`, `Plan`, and `Solver` trait hierarchies
//! - The `Planner` that orchestrates algorithm selection

mod complex;
#[cfg(feature = "f128-support")]
pub mod f128_type;
#[cfg(feature = "f16-support")]
pub mod f16;
mod flags;
mod float;
mod hash;
mod ops;
mod plan;
mod planner;
mod primes;
mod problem;
mod rader_omega;
mod solver;
mod tensor;
mod trig;
mod twiddle;

pub use complex::Complex;
#[cfg(feature = "f128-support")]
pub use f128_type::F128;
#[cfg(feature = "f16-support")]
pub use f16::F16;
pub use flags::PlannerFlags;
pub use float::Float;
pub use hash::ProblemHash;
pub use ops::OpCount;
pub use plan::{Plan, WakeMode, WakeState};
pub use planner::{Planner, SolverChoice, WisdomEntry};
pub use primes::{factor, is_prime, mod_pow, primitive_root};
pub use problem::{Problem, ProblemKind};
pub use solver::Solver;
pub use tensor::{IoDim, Tensor};
pub use trig::TrigTable;
pub use twiddle::TwiddleCache;