Normalize half-complex data by 1/n.

Compute 2D NUFFT Type 1 with default options. Thin wrapper around [`nufft2d_type1`] using [`NufftOptions::default`]. # Errors Propagates errors fro

Compute 2D NUFFT Type 2 with default options. Thin wrapper around [`nufft2d_type2`] using a specified tolerance. # Errors Propagates errors from [`

Compute Type 3 NUFFT (non-uniform → non-uniform). # Arguments `source_points` - Source non-uniform locations in [-π, π] `values` - Complex values at

Number of buckets.

Calculate optimal number of repetitions for robustness. More repetitions increase accuracy but also runtime.

Pack V independent transforms (each of size N) into SoA buffers. `inputs_re[t][k]` / `inputs_im[t][k]` → `re_soa[k*V+t]` / `im_soa[k*V+t]`.

Recursively split work in parallel using join. Splits the range `[start, start + count)` recursively until chunks are smaller than `min_chunk_size`,

Parse a `(format_version N)` line, returning `N` on success.

Remove frequency contribution from all bucket stages.

Compute phase spectrogram. # Arguments `spectrogram` - Complex spectrogram # Returns Phase of each bin `(angle(X[k]))` in radians.

Precompute deconvolution factors for the Gaussian NUFFT. The spreading kernel in [`precompute_spreading_coeffs`] is: ```text w(dx) = exp(-β · (dx / (

Precompute spreading coefficients using Gaussian kernel.

Returns the set of distinct prime factors of n.

Process a single frame from the input buffer.

Query Metal device capabilities. # Errors Returns `GpuError::InitializationFailed` if no Metal-capable device is found (non-macOS or unsupported har

Query CUDA device capabilities using the real driver API. # Errors Returns `GpuError::NoBackendAvailable` if no CUDA device is present, or `GpuError

Recover frequency from bucket indices using CRT. # Arguments `bucket_indices` - Tuple of bucket indices from each hash # Returns Recovered frequen

Reduce fractional order to [0, 4).

Resample a real signal from one sample rate to another. Convenience wrapper around [`resample`] that computes the output length from the ratio of sam

Try to resolve remaining multiton buckets.

Rewrite the RHS of an assignment, excluding the assignment itself from self-reference replacement.

Row rank for a given global rank (0-indexed row in the 2D grid).

Get rustc version string.

Scatter from contiguous buffer to N-dimensional output.

Set the detection threshold.

Recover a solver name from an algorithm tag and factors.

Get indices sorted by magnitude (descending).

Compute inverse sparse FFT (sparse frequency domain to time domain). # Arguments `sparse_result` - Sparse frequency domain representation `n` - Outp

Splitmix64 PRNG — no external dependency.

Spread non-uniform values to the oversampled grid.

Generic Stockham implementation for any Float type.

Stockham FFT with stage fusion (scalar) - WORK IN PROGRESS. Fuses pairs of radix-2 stages together to reduce memory passes by half. This is NOT true

Subsample the input signal.

Build symbolic HC2R expressions for all j in 0..n. Unnormalized inverse (no 1/N factor): x[j] = Y[0].re + Y[N/2].re · cos(π·j)

Op count via `SymbolicFFT` (power-of-two sizes only). Returns `None` when symbolic computation is not applicable to the given codelet kind/size combi