pub struct RangeBar {
pub open: f64,
pub high: f64,
pub low: f64,
pub close: f64,
}Expand description
One completed range bar. Its high - low is >= range_size.
Fields§
§open: f64§high: f64§low: f64§close: f64Trait Implementations§
impl Copy for RangeBar
impl StructuralPartialEq for RangeBar
Auto Trait Implementations§
impl Forget for RangeBar
impl Freeze for RangeBar
impl Move for RangeBar
impl RefUnwindSafe for RangeBar
impl Send for RangeBar
impl Sync for RangeBar
impl Unpin for RangeBar
impl UnsafeUnpin for RangeBar
impl UnwindSafe for RangeBar
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,
impl<T> Scalar for T
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.