pub struct VelocityVerlet;Expand description
Velocity Verlet integration scheme.
Updates positions using both current and next accelerations:
q_{n+1} = q_n + v_n * dt + 0.5 * a_n * dt²
v_{n+1} = v_n + 0.5 * (a_n + a_{n+1}) * dtSince a_{n+1} is not generally available (forces depend on positions),
this implementation uses a_n for both terms, equivalent to the
“Störmer-Verlet” update.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for VelocityVerlet
impl RefUnwindSafe for VelocityVerlet
impl Send for VelocityVerlet
impl Sync for VelocityVerlet
impl Unpin for VelocityVerlet
impl UnsafeUnpin for VelocityVerlet
impl UnwindSafe for VelocityVerlet
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<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.