pub struct Leapfrog;Expand description
Leapfrog (Störmer-Verlet) integration.
The leapfrog scheme stores velocities at half-integer time steps:
v_{n+1/2} = v_{n-1/2} + a_n * dt
q_{n+1} = q_n + v_{n+1/2} * dtThis implementation initialises the half-step velocity from the full-step velocity on first call, making it self-starting.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Leapfrog
impl RefUnwindSafe for Leapfrog
impl Send for Leapfrog
impl Sync for Leapfrog
impl Unpin for Leapfrog
impl UnsafeUnpin for Leapfrog
impl UnwindSafe for Leapfrog
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.