pub struct BollingerBands {
pub period: usize,
pub n_std: usize,
pub sma: Array1<f64>,
pub lower_band: Array1<f64>,
pub upper_band: Array1<f64>,
}Expand description
Bollinger Band data.
Fields§
§period: usizeSize of the rolling window for the SMA
n_std: usizeNumber of standard deviations used to construct Bollinger bands around the SMA
sma: Array1<f64>An array of SMA readings
lower_band: Array1<f64>An array of upper Bollinger band readings
upper_band: Array1<f64>An array of lower Bollinger band readings
Trait Implementations§
Auto Trait Implementations§
impl Freeze for BollingerBands
impl RefUnwindSafe for BollingerBands
impl Send for BollingerBands
impl Sync for BollingerBands
impl Unpin for BollingerBands
impl UnsafeUnpin for BollingerBands
impl UnwindSafe for BollingerBands
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<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.