pub struct MovingWindowSIMD<F> { /* private fields */ }Expand description
SIMD-optimized moving window statistics
Computes rolling statistics over a sliding window using SIMD acceleration.
Implementations§
Source§impl<F> MovingWindowSIMD<F>
impl<F> MovingWindowSIMD<F>
pub fn new(_windowsize: usize) -> Self
Sourcepub fn moving_mean<D>(&self, data: &ArrayBase<D, Ix1>) -> StatsResult<Array1<F>>where
D: Data<Elem = F>,
pub fn moving_mean<D>(&self, data: &ArrayBase<D, Ix1>) -> StatsResult<Array1<F>>where
D: Data<Elem = F>,
Compute moving mean using SIMD operations
Sourcepub fn moving_variance<D>(
&self,
data: &ArrayBase<D, Ix1>,
ddof: usize,
) -> StatsResult<Array1<F>>where
D: Data<Elem = F>,
pub fn moving_variance<D>(
&self,
data: &ArrayBase<D, Ix1>,
ddof: usize,
) -> StatsResult<Array1<F>>where
D: Data<Elem = F>,
Compute moving variance using SIMD operations
Sourcepub fn moving_min<D>(&self, data: &ArrayBase<D, Ix1>) -> StatsResult<Array1<F>>where
D: Data<Elem = F>,
pub fn moving_min<D>(&self, data: &ArrayBase<D, Ix1>) -> StatsResult<Array1<F>>where
D: Data<Elem = F>,
Compute moving minimum using SIMD operations where applicable
Sourcepub fn moving_max<D>(&self, data: &ArrayBase<D, Ix1>) -> StatsResult<Array1<F>>where
D: Data<Elem = F>,
pub fn moving_max<D>(&self, data: &ArrayBase<D, Ix1>) -> StatsResult<Array1<F>>where
D: Data<Elem = F>,
Compute moving maximum using SIMD operations where applicable
Auto Trait Implementations§
impl<F> Freeze for MovingWindowSIMD<F>
impl<F> RefUnwindSafe for MovingWindowSIMD<F>where
F: RefUnwindSafe,
impl<F> Send for MovingWindowSIMD<F>where
F: Send,
impl<F> Sync for MovingWindowSIMD<F>where
F: Sync,
impl<F> Unpin for MovingWindowSIMD<F>where
F: Unpin,
impl<F> UnwindSafe for MovingWindowSIMD<F>where
F: UnwindSafe,
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
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
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.