pub struct Alma { /* private fields */ }Expand description
Arnaud Legoux Moving Average — a Gaussian-weighted moving average.
Each output is a weighted sum of the last period inputs:
w[i] = exp(-(i - m)^2 / (2 * s^2)) for i in 0..period
m = offset * (period - 1)
s = period / sigma
ALMA = sum(price[i] * w[i]) / sum(w[i])The Gaussian is centred on the relative index offset * (period - 1), so
offset = 0.85 puts the peak near the newest sample (responsive), while
offset = 0.5 centres the peak in the middle of the window (smooth).
sigma controls how concentrated the Gaussian is: larger sigma ->
narrower kernel, smaller sigma -> broader (closer to SMA).
Reference: Arnaud Legoux and Dimitrios Kouzis-Loukas, 2009.
§Defaults
The community-standard parameters are period = 9, offset = 0.85,
sigma = 6.0. The first output lands after exactly period inputs.
§Example
use wickra_core::{Alma, Indicator};
let mut alma = Alma::new(9, 0.85, 6.0).unwrap();
let mut last = None;
for i in 0..40 {
last = alma.update(100.0 + f64::from(i));
}
assert!(last.is_some());Implementations§
Source§impl Alma
impl Alma
Sourcepub fn new(period: usize, offset: f64, sigma: f64) -> Result<Self>
pub fn new(period: usize, offset: f64, sigma: f64) -> Result<Self>
Construct a new ALMA with the given period, offset and sigma.
§Errors
Error::PeriodZeroifperiod == 0.Error::InvalidPeriodifoffsetis outside[0.0, 1.0]orsigma <= 0.0or either ofoffset/sigmais non-finite.
Trait Implementations§
Source§impl Indicator for Alma
impl Indicator for Alma
Source§fn update(&mut self, input: f64) -> Option<f64>
fn update(&mut self, input: f64) -> Option<f64>
Feed one new data point into the indicator and return the freshly
computed output, or
None if there is no value for this input. Read moreSource§fn reset(&mut self)
fn reset(&mut self)
Reset all internal state, leaving the indicator equivalent to a freshly
constructed instance with the same parameters.
Source§fn warmup_period(&self) -> usize
fn warmup_period(&self) -> usize
Number of inputs required before the first non-
None output can be produced.Source§fn is_ready(&self) -> bool
fn is_ready(&self) -> bool
Whether the indicator has emitted at least one value since the last reset.
Source§fn name(&self) -> &'static str
fn name(&self) -> &'static str
Stable, human-readable indicator name. Used by chaining and diagnostics.
Source§fn batch_nan_into(&mut self, inputs: &[Self::Input], out: &mut [f64])
fn batch_nan_into(&mut self, inputs: &[Self::Input], out: &mut [f64])
Source§fn batch_fast_into(&mut self, inputs: &[Self::Input], out: &mut [f64])
fn batch_fast_into(&mut self, inputs: &[Self::Input], out: &mut [f64])
Opt-in fast batch: like
batch_nan_into, but
an indicator with a vectorised kernel may reassociate its arithmetic to
run it in SIMD lanes. Each value then agrees with the exact batch to within
the tolerance the indicator documents (a few units in the last place), not
bit for bit; warmup positions, NaN placement and the output length are
identical. The kernels are deterministic: the same input produces the same
bits on every platform, with or without SIMD hardware. Read moreAuto Trait Implementations§
impl Freeze for Alma
impl RefUnwindSafe for Alma
impl Send for Alma
impl Sync for Alma
impl Unpin for Alma
impl UnsafeUnpin for Alma
impl UnwindSafe for Alma
Blanket Implementations§
Source§impl<T> BatchExt for Twhere
T: Indicator,
impl<T> BatchExt for Twhere
T: Indicator,
Source§fn batch(&mut self, inputs: &[Self::Input]) -> Vec<Option<Self::Output>>
fn batch(&mut self, inputs: &[Self::Input]) -> Vec<Option<Self::Output>>
Run the indicator over a slice of inputs in order, returning one output (or
None during warmup) per input.Source§impl<T> BatchNanExt for T
impl<T> BatchNanExt for T
Source§fn batch_nan(&mut self, inputs: &[f64]) -> Vec<f64>
fn batch_nan(&mut self, inputs: &[f64]) -> Vec<f64>
One
f64 per input, warmup positions filled with NaN, bit-for-bit equal
to replaying update.Source§fn batch_fast(&mut self, inputs: &[f64]) -> Vec<f64>
fn batch_fast(&mut self, inputs: &[f64]) -> Vec<f64>
The opt-in fast batch (
Indicator::batch_fast_into) into a fresh
vector: within the indicator’s documented tolerance of
batch_nan, deterministic across platforms.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> 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 more