pub struct Solution<T, V, D>{
pub t: Vec<T>,
pub y: Vec<V>,
pub status: Status<T, V, D>,
pub evals: Evals,
pub steps: Steps,
pub timer: Timer<T>,
}Expand description
Solution of returned by differential equation solvers
§Fields
y- Outputted dependent variable points.t- Outputted independent variable points.status- Status of the solver.evals- Number of function evaluations.steps- Number of steps.rejected_steps- Number of rejected steps.accepted_steps- Number of accepted steps.timer- Timer for tracking solution time.
Fields§
§t: Vec<T>Outputted independent variable points.
y: Vec<V>Outputted dependent variable points.
status: Status<T, V, D>Status of the solver.
evals: EvalsNumber of function, jacobian, etc evaluations.
steps: StepsNumber of steps taken during the solution.
timer: Timer<T>Timer for tracking solution time - Running during solving, Completed after finalization
Implementations§
Source§impl<T, V, D> Solution<T, V, D>
impl<T, V, D> Solution<T, V, D>
Sourcepub fn push(&mut self, t: T, y: V)
pub fn push(&mut self, t: T, y: V)
Puhes a new point to the solution, e.g. t and y vecs.
§Arguments
t- The time point.y- The state vector.
Source§impl<T, V, D> Solution<T, V, D>
impl<T, V, D> Solution<T, V, D>
Sourcepub fn into_tuple(self) -> (Vec<T>, Vec<V>)
pub fn into_tuple(self) -> (Vec<T>, Vec<V>)
Simplifies the Solution into a tuple of vectors in form (t, y). By doing so, the Solution will be consumed and the status, evals, steps, rejected_steps, and accepted_steps will be discarded.
§Returns
(Vec<T>, Vec<V)- Tuple of time and state vectors.
Sourcepub fn last(&self) -> Result<(&T, &V), Box<dyn Error>>
pub fn last(&self) -> Result<(&T, &V), Box<dyn Error>>
Returns the last accepted step of the solution in form (t, y).
§Returns
Result<(T, V), Box<dyn std::error::Error>>- Result of time and state vector.
Sourcepub fn iter(&self) -> Zip<Iter<'_, T>, Iter<'_, V>>
pub fn iter(&self) -> Zip<Iter<'_, T>, Iter<'_, V>>
Returns an iterator over the solution.
§Returns
std::iter::Zip<std::slice::Iter<'_, T>, std::slice::Iter<'_, V>>- An iterator yielding (t, y) tuples.
Trait Implementations§
Auto Trait Implementations§
impl<T, V, D> Freeze for Solution<T, V, D>
impl<T, V, D> RefUnwindSafe for Solution<T, V, D>
impl<T, V, D> Send for Solution<T, V, D>
impl<T, V, D> Sync for Solution<T, V, D>
impl<T, V, D> Unpin for Solution<T, V, D>
impl<T, V, D> UnwindSafe for Solution<T, V, D>
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<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.