pub struct GriffithsDominantCycleFeatures {
pub dominant_cycle: f64,
}Fields§
§dominant_cycle: f64Trait Implementations§
impl Copy for GriffithsDominantCycleFeatures
impl StructuralPartialEq for GriffithsDominantCycleFeatures
Auto Trait Implementations§
impl Forget for GriffithsDominantCycleFeatures
impl Freeze for GriffithsDominantCycleFeatures
impl Move for GriffithsDominantCycleFeatures
impl RefUnwindSafe for GriffithsDominantCycleFeatures
impl Send for GriffithsDominantCycleFeatures
impl Sync for GriffithsDominantCycleFeatures
impl Unpin for GriffithsDominantCycleFeatures
impl UnsafeUnpin for GriffithsDominantCycleFeatures
impl UnwindSafe for GriffithsDominantCycleFeatures
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.