Attempt to downcast `raw` to a concrete type. # Errors Returns `Err(self)` if the type parameter does not match the concrete type originally stored

Download a buffer from the Metal device. Metal buffer readback is handled transparently inside `execute`; this function is a no-op. # Errors This f

Download buffer from CUDA device (no-op; GPU memory managed in execute). # Errors This function currently cannot return an error; the `Result` signa

Eliminate dead temporary assignments from a program. Performs a reachability analysis starting from output expressions, transitively marking all refe

Create an empty sparse result.

Convenience: create ESTIMATE flags.

Execute the C2R plan with normalization. Output is normalized by 1/n. # Panics Panics if the plan is not C2R or buffer sizes don't match.

Execute the C2R plan without normalization. # Panics Panics if the plan is not C2R or buffer sizes don't match.

Execute R2C FFT in-place. The input buffer is reinterpreted: first N real values are input, and first N/2+1 complex values will be output. # Safety

Execute the plan in-place. For in-place execution, input and output strides must be identical.

Execute the N-dimensional FFT in-place. # Panics Panics if buffer size doesn't match the total size.

Execute the transform in-place on split-complex data. # Arguments `real` - Real parts (in-place) `imag` - Imaginary parts (in-place) # Panics Panics

Execute the plan in-place. # Panics Panics if buffer size doesn't match the plan size.

MIRI intentionally introduces floating-point non-determinism to detect code that incorrectly assumes deterministic FP results. Bit-exact comparison vi

Execute DFT on raw pointers. # Safety - `input` must point to `n` valid `Complex<T>` values - `output` must point to `n` valid `Complex<T>` values -

Execute the R2C plan. # Panics Panics if the plan is not R2C or buffer sizes don't match.

Export wisdom to a planner.

Convenience function for 2D split-complex forward FFT.

Convenience function for 3D split-complex forward FFT.

* One-shot forward FFT (f32). * * # Arguments * * * `real` - Real part of input * * `imag` - Imaginary part of input * * # Returns * * Interl

* One-shot forward FFT (f64). * * # Arguments * * * `real` - Real part of input * * `imag` - Imaginary part of input * * # Returns * * Interl

Compute the full Jacobian matrix of the FFT. For an N-point FFT, returns an NxN complex matrix where `J[k,n] = exp(-2πi·k·n/N) / √N` (normalized DFT

Convenience function for N-dimensional split-complex forward FFT.

Get the FFT size.

Find a coprime for multiplicative permutation.

Get the planning flags.

Get the planning flags.

Get the planning flags.

Create a flat (box) filter. # Arguments `n` - Signal length `width` - Filter width (number of frequency bins to pass)

Fused multiply-add: self * a + b

Fused multiply-subtract: self * a - b