pub struct CandleSetting {
pub range_type: RangeType,
pub avg_period: usize,
pub factor: f64,
}Fields§
§range_type: RangeType§avg_period: usize§factor: f64Trait Implementations§
Source§impl Clone for CandleSetting
impl Clone for CandleSetting
impl Copy for CandleSetting
Auto Trait Implementations§
impl Forget for CandleSetting
impl Freeze for CandleSetting
impl Move for CandleSetting
impl RefUnwindSafe for CandleSetting
impl Send for CandleSetting
impl Sync for CandleSetting
impl Unpin for CandleSetting
impl UnsafeUnpin for CandleSetting
impl UnwindSafe for CandleSetting
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.