pub struct EulerSolver<'a, N, D, T, F>where
N: ComplexField + Copy,
D: Dimension,
T: Clone,
F: Derivative<N, D, T> + 'a,
DefaultAllocator: Allocator<N, D>,{ /* private fields */ }
Expand description
The struct that actually solves an IVP with Euler’s method Is the associated IVPStepper for Euler (the IVPSolver) You should use Euler and not this type directly
Trait Implementations§
Source§impl<'a, N, D, T, F> IVPStepper<D> for EulerSolver<'a, N, D, T, F>where
N: ComplexField + Copy,
D: Dimension,
T: Clone,
F: Derivative<N, D, T> + 'a,
DefaultAllocator: Allocator<N, D>,
impl<'a, N, D, T, F> IVPStepper<D> for EulerSolver<'a, N, D, T, F>where
N: ComplexField + Copy,
D: Dimension,
T: Clone,
F: Derivative<N, D, T> + 'a,
DefaultAllocator: Allocator<N, D>,
Source§type RealField = <N as ComplexField>::RealField
type RealField = <N as ComplexField>::RealField
The real field associated with the solver’s Field.
Source§type UserData = T
type UserData = T
Arbitrary data provided by the user for the derivative function
It must be clone because for any intermediate time steps (e.g. in runge-kutta)
gives the derivative function a clone of the params: only normal time steps get to update
the internal UserData state
Auto Trait Implementations§
impl<'a, N, D, T, F> !Freeze for EulerSolver<'a, N, D, T, F>
impl<'a, N, D, T, F> !RefUnwindSafe for EulerSolver<'a, N, D, T, F>
impl<'a, N, D, T, F> !Send for EulerSolver<'a, N, D, T, F>
impl<'a, N, D, T, F> !Sync for EulerSolver<'a, N, D, T, F>
impl<'a, N, D, T, F> !Unpin for EulerSolver<'a, N, D, T, F>
impl<'a, N, D, T, F> !UnwindSafe for EulerSolver<'a, N, D, T, F>
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.