Create a new MPI pool from a communicator.

Create new MPI flags with default settings.

Calculate local partition for a given process. Uses block distribution: each process gets n / num_procs elements, with the first (n % num_procs) proc

Create a new 3D distributed FFT plan. # Arguments `n0` - First dimension (distributed) `n1` - Second dimension `n2` - Third dimension `direction` - T

Create a new N-D distributed FFT plan. # Arguments `dims` - Dimension sizes (first dimension is distributed) `direction` - Transform direction `flags

Create a new 2D distributed FFT plan. # Arguments `n0` - Number of rows (distributed across processes) `n1` - Number of columns (local to each proces

Create a new pencil grid.

Create a new GPU buffer with the specified size. # Errors Returns `GpuError::InvalidSize` if `size` is zero.

Create a new Metal FFT plan. # Errors - `GpuError::NoBackendAvailable` — no Metal device found (or non-macOS). - `GpuError::InvalidSize` — `size` is

Create a new CUDA FFT plan, initialising real oxicuda resources. `FftPlan::new_1d` accepts any non-zero size (not only powers of two), so arbitrary f

Create a new GPU FFT plan. # Arguments `size` - Transform size `backend` - GPU backend to use # Errors Returns a [`GpuError`] if the requested bac

Create a new Fractional Fourier Transform plan. # Arguments `n` - Transform size `order` - Fractional order α (any real number, reduced mod 4) # Er

Create a new CZT plan. # Arguments `n` – number of input samples `m` – number of output frequency bins `a` – starting point on the z-plane (`A` in t

Create a new ring buffer with given capacity.

Create a new Sliding DFT with window size `n`. # Panics Panics if `n == 0`.

Create mel config with sensible defaults. `f_min` defaults to 0.0 and `f_max` defaults to `sample_rate / 2`.

Create a new streaming FFT processor. # Arguments `fft_size` - Size of FFT (window size) `hop_size` - Number of samples between frames `window` - Wi

Create a new twiddle table at runtime.

Create a new NUFFT plan. # Arguments `nufft_type` - Type of NUFFT (1, 2, or 3) `n_uniform` - Number of uniform grid points `points` - Non-uniform po

Create a new dual number.

Construct a `PartialFft` for computing the first `m` output bins. Strategy selection: - If `m` is a power-of-two, `m <= n/2`, and `m < log₂(N)`: `Out

Construct a `PartialFft` for computing arbitrary sparse bins. When `K < log₂(N)`, uses Goertzel. Otherwise falls back to a full FFT then slice (if bi

Get all non-zero buckets.