pub struct ExponentialMovingAverage { /* private fields */ }Expand description
Exponential Moving Average (EMA) filter.
Each new value is blended with the running average: EMA_new = alpha * value + (1 - alpha) * EMA_old
The first pushed value initializes the EMA directly.
§Example
use numrs2::new_modules::streaming_stats::ExponentialMovingAverage;
let mut ema = ExponentialMovingAverage::new(0.5).expect("valid smoothing factor");
ema.push(10.0);
assert!((ema.value().expect("EMA has data") - 10.0).abs() < 1e-10);
ema.push(20.0);
assert!((ema.value().expect("EMA has data") - 15.0).abs() < 1e-10);Implementations§
Source§impl ExponentialMovingAverage
impl ExponentialMovingAverage
Sourcepub fn new(alpha: f64) -> Result<Self>
pub fn new(alpha: f64) -> Result<Self>
Creates a new EMA with the given smoothing factor alpha.
§Errors
Returns an error if alpha is not in the interval (0, 1].
Sourcepub fn push(&mut self, value: f64)
pub fn push(&mut self, value: f64)
Pushes a new observation. The first value initializes the EMA; subsequent values are exponentially blended.
Trait Implementations§
Source§impl Clone for ExponentialMovingAverage
impl Clone for ExponentialMovingAverage
Source§fn clone(&self) -> ExponentialMovingAverage
fn clone(&self) -> ExponentialMovingAverage
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for ExponentialMovingAverage
impl RefUnwindSafe for ExponentialMovingAverage
impl Send for ExponentialMovingAverage
impl Sync for ExponentialMovingAverage
impl Unpin for ExponentialMovingAverage
impl UnsafeUnpin for ExponentialMovingAverage
impl UnwindSafe for ExponentialMovingAverage
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.