pub struct AdvancedFftPlanner { /* private fields */ }Expand description
Planner for FFT operations that combines caching, serialization and auto-tuning. Uses OxiFFT as the execution backend (COOLJAPAN Pure Rust policy).
Implementations§
Source§impl AdvancedFftPlanner
Advanced FFT planner for managing plans
impl AdvancedFftPlanner
Advanced FFT planner for managing plans
Sourcepub fn new() -> AdvancedFftPlanner
pub fn new() -> AdvancedFftPlanner
Create a new FftPlanner with default configuration
Sourcepub fn with_config(config: PlanningConfig) -> AdvancedFftPlanner
pub fn with_config(config: PlanningConfig) -> AdvancedFftPlanner
Create a new FftPlanner with custom configuration
Sourcepub fn clear_cache(&self)
pub fn clear_cache(&self)
Clear the plan cache
Sourcepub fn plan_fft(
&mut self,
shape: &[usize],
forward: bool,
backend: PlannerBackend,
) -> Result<Arc<FftPlan>, FFTError>
pub fn plan_fft( &mut self, shape: &[usize], forward: bool, backend: PlannerBackend, ) -> Result<Arc<FftPlan>, FFTError>
Get or create a plan for the given shape and direction
Sourcepub fn plan_fft_1d<S, D>(
&mut self,
arr: &ArrayBase<S, D>,
forward: bool,
) -> Result<Arc<FftPlan>, FFTError>
pub fn plan_fft_1d<S, D>( &mut self, arr: &ArrayBase<S, D>, forward: bool, ) -> Result<Arc<FftPlan>, FFTError>
Plan a 1D FFT
Sourcepub fn plan_fft_2d<S, D>(
&mut self,
arr: &ArrayBase<S, D>,
forward: bool,
) -> Result<Arc<FftPlan>, FFTError>
pub fn plan_fft_2d<S, D>( &mut self, arr: &ArrayBase<S, D>, forward: bool, ) -> Result<Arc<FftPlan>, FFTError>
Plan a 2D FFT
Sourcepub fn plan_fft_nd<S, D>(
&mut self,
arr: &ArrayBase<S, D>,
forward: bool,
) -> Result<Arc<FftPlan>, FFTError>
pub fn plan_fft_nd<S, D>( &mut self, arr: &ArrayBase<S, D>, forward: bool, ) -> Result<Arc<FftPlan>, FFTError>
Plan an N-dimensional FFT
Sourcepub fn precompute_commonsizes(
&mut self,
sizes: &[&[usize]],
) -> Result<(), FFTError>
pub fn precompute_commonsizes( &mut self, sizes: &[&[usize]], ) -> Result<(), FFTError>
Pre-compute plans for common sizes
Sourcepub fn save_plans(&self) -> Result<(), FFTError>
pub fn save_plans(&self) -> Result<(), FFTError>
Save all plans to disk
Trait Implementations§
Source§impl Default for AdvancedFftPlanner
impl Default for AdvancedFftPlanner
Source§fn default() -> AdvancedFftPlanner
fn default() -> AdvancedFftPlanner
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for AdvancedFftPlanner
impl RefUnwindSafe for AdvancedFftPlanner
impl Send for AdvancedFftPlanner
impl Sync for AdvancedFftPlanner
impl Unpin for AdvancedFftPlanner
impl UnsafeUnpin for AdvancedFftPlanner
impl UnwindSafe for AdvancedFftPlanner
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.