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: CentrosymmKernel + KernelProperties + Clone,
<K as KernelProperties>::SVEHintsType<T>: SVEHints<T> + Clone,
impl<T, K> CentrosymmSVE<T, K>where
T: CustomNumeric + Send + Sync + Clone + 'static,
K: CentrosymmKernel + KernelProperties + Clone,
<K as KernelProperties>::SVEHintsType<T>: SVEHints<T> + Clone,
Sourcepub fn new(kernel: K, epsilon: f64) -> Result<CentrosymmSVE<T, K>, Error>
pub fn new(kernel: K, epsilon: f64) -> Result<CentrosymmSVE<T, K>, Error>
Create a new CentrosymmSVE
§Errors
Error::InvalidParameter if the SVE hints of the kernel give
segments that are not finite and strictly increasing
Trait Implementations§
Source§impl<T, K> SVEStrategy<T> for CentrosymmSVE<T, K>where
T: CustomNumeric + Send + Sync + Clone + 'static,
K: CentrosymmKernel + KernelProperties + Clone,
<K as KernelProperties>::SVEHintsType<T>: SVEHints<T> + Clone,
impl<T, K> SVEStrategy<T> for CentrosymmSVE<T, K>where
T: CustomNumeric + Send + Sync + Clone + 'static,
K: CentrosymmKernel + KernelProperties + Clone,
<K as KernelProperties>::SVEHintsType<T>: SVEHints<T> + Clone,
Auto 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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
impl<T, U> Imply<T> for U
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 moreimpl<T> MaybeSend for Twhere
T: Send,
impl<T> MaybeSendSync for T
impl<T> MaybeSync for Twhere
T: Sync,
§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
§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.