Struct AdaptiveRungeKutta 

pub struct AdaptiveRungeKutta<'a>(/* private fields */);

Implementations

impl<'a> AdaptiveRungeKutta<'a>

pub fn order(&self) -> usize

pub fn from_matrix(rk_matrix: &'a [&'a [f64]]) -> Result<Self, RKError>

Trait Implementations

impl<'a> AdaptiveIntegrator for AdaptiveRungeKutta<'a>

fn adaptive_init<R: Real, S: VectorSpace<R>, M: Metric<S, R>, F: Fn(R, S) -> S>( &self, t0: R, state: S, ds: R, _force: F, _d: M, ) -> Box<[(R, S)]>

fn adaptive_step<R: Real, S: VectorSpace<R>, M: Metric<S, R>, F: Fn(R, S) -> S>( &self, state: &mut [(R, S)], ds: R, force: F, d: M, ) -> (R, S)

impl<'a> Clone for AdaptiveRungeKutta<'a>

fn clone(&self) -> AdaptiveRungeKutta<'a>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a> Debug for AdaptiveRungeKutta<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> PartialEq for AdaptiveRungeKutta<'a>

fn eq(&self, other: &AdaptiveRungeKutta<'a>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> Copy for AdaptiveRungeKutta<'a>

impl<'a> StructuralPartialEq for AdaptiveRungeKutta<'a>