pub struct PivotPoints { /* private fields */ }Expand description
Standard Pivot Points Uses the High, Low, and Close of the previous period to calculate the current period’s Support and Resistance levels. Output: (P, R1, S1, R2, S2)
Implementations§
Source§impl PivotPoints
impl PivotPoints
Trait Implementations§
Source§impl Clone for PivotPoints
impl Clone for PivotPoints
Source§impl Debug for PivotPoints
impl Debug for PivotPoints
Source§impl Default for PivotPoints
impl Default for PivotPoints
Auto Trait Implementations§
impl Forget for PivotPoints
impl Freeze for PivotPoints
impl Move for PivotPoints
impl RefUnwindSafe for PivotPoints
impl Send for PivotPoints
impl Sync for PivotPoints
impl Unpin for PivotPoints
impl UnsafeUnpin for PivotPoints
impl UnwindSafe for PivotPoints
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.