pub struct ZeroLag { /* private fields */ }Expand description
ZeroLag Indicator
Based on John Ehlers’ “Zero Lag (well, almost)” The indicator acknowledgement that the EMA filter has an error term: Error = Price - EMA[1]. It introduces this error term into the equation in addition to the value of the new data sample, and applies a gain term to minimize the lag.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ZeroLag
impl RefUnwindSafe for ZeroLag
impl Send for ZeroLag
impl Sync for ZeroLag
impl Unpin for ZeroLag
impl UnsafeUnpin for ZeroLag
impl UnwindSafe for ZeroLag
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.