pub struct SAREXT {
pub startvalue: f64,
pub offsetonreverse: f64,
pub accelerationinitlong: f64,
pub accelerationlong: f64,
pub accelerationmaxlong: f64,
pub accelerationinitshort: f64,
pub accelerationshort: f64,
pub accelerationmaxshort: f64,
/* private fields */
}Fields§
§startvalue: f64§offsetonreverse: f64§accelerationinitlong: f64§accelerationlong: f64§accelerationmaxlong: f64§accelerationinitshort: f64§accelerationshort: f64§accelerationmaxshort: f64Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for SAREXT
impl RefUnwindSafe for SAREXT
impl Send for SAREXT
impl Sync for SAREXT
impl Unpin for SAREXT
impl UnsafeUnpin for SAREXT
impl UnwindSafe for SAREXT
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.