pub struct CentrosymmSVE<T, K>{ /* private fields */ }Expand description
Centrosymmetric SVE computation
Exploits even/odd symmetry for efficient computation. This manages the symmetry: creating reduced kernels, extending to full domain, and merging.
Implementations§
Source§impl<T, K> CentrosymmSVE<T, K>where
T: CustomNumeric + Send + Sync + Clone + 'static,
K: ReducedKernel + SVEKernel + Clone,
K::SVEHintsType<T>: SVEHints<T> + Clone,
impl<T, K> CentrosymmSVE<T, K>where
T: CustomNumeric + Send + Sync + Clone + 'static,
K: ReducedKernel + SVEKernel + Clone,
K::SVEHintsType<T>: SVEHints<T> + Clone,
Trait Implementations§
Source§impl<T, K> SVEStrategy<T> for CentrosymmSVE<T, K>where
T: CustomNumeric + Send + Sync + Clone + 'static,
K: ReducedKernel + SVEKernel + Clone,
K::SVEHintsType<T>: SVEHints<T> + Clone,
impl<T, K> SVEStrategy<T> for CentrosymmSVE<T, K>where
T: CustomNumeric + Send + Sync + Clone + 'static,
K: ReducedKernel + SVEKernel + Clone,
K::SVEHintsType<T>: SVEHints<T> + Clone,
Source§fn blocks(&self) -> Vec<KernelBlock<'_, T>>
fn blocks(&self) -> Vec<KernelBlock<'_, T>>
The discretized, weighted kernel blocks to decompose, the matrices of
Self::matrices with their entries evaluated on demand Read moreAuto Trait Implementations§
impl<T, K> Freeze for CentrosymmSVE<T, K>
impl<T, K> RefUnwindSafe for CentrosymmSVE<T, K>
impl<T, K> Send for CentrosymmSVE<T, K>
impl<T, K> Sync for CentrosymmSVE<T, K>
impl<T, K> Unpin for CentrosymmSVE<T, K>
impl<T, K> UnsafeUnpin for CentrosymmSVE<T, K>
impl<T, K> UnwindSafe for CentrosymmSVE<T, K>
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<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.