Struct EulerSolver

Source
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>,

Source§

type Error = IVPError

Error type. IVPError must be able to convert to the error type.
Source§

type Field = N

The field, complex or real, that the solver is operating on.
Source§

type RealField = <N as ComplexField>::RealField

The real field associated with the solver’s Field.
Source§

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
Source§

fn step( &mut self, ) -> Result<(Self::RealField, BVector<Self::Field, D>), IVPStatus<Self::Error>>

Step forward in the solver. The solver may request a step be redone, signal that the solution is finished, or give the value of the next solution value.
Source§

fn time(&self) -> Self::RealField

Get the current time of the solver.

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> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.