pub struct Velocity<F: Frame> { /* private fields */ }Expand description
Velocity, in meters per second.
Implementations§
Source§impl<F: Frame> Velocity<F>
impl<F: Frame> Velocity<F>
Sourcepub fn from_array(components: [f32; 3]) -> Self
pub fn from_array(components: [f32; 3]) -> Self
From components on the axes of F, in meters per second.
The frame is the type parameter, so name it: Position::<Ned>::from_array or
a binding with a stated type. The frame-named constructors say it for you.
Trait Implementations§
impl<F: Frame> Copy for Velocity<F>
Auto Trait Implementations§
impl<F> Freeze for Velocity<F>where
PhantomData<F>: Freeze,
impl<F> RefUnwindSafe for Velocity<F>where
PhantomData<F>: RefUnwindSafe,
impl<F> Send for Velocity<F>where
PhantomData<F>: Send,
impl<F> Sync for Velocity<F>where
PhantomData<F>: Sync,
impl<F> Unpin for Velocity<F>where
PhantomData<F>: Unpin,
impl<F> UnsafeUnpin for Velocity<F>where
PhantomData<F>: UnsafeUnpin,
impl<F> UnwindSafe for Velocity<F>where
PhantomData<F>: UnwindSafe,
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.