pub struct Evals {
pub function: usize,
pub jacobian: usize,
pub newton: usize,
pub decompositions: usize,
pub solves: usize,
}Expand description
Number of evaluations
Fields§
§function: usizeNumber of function evaluations
jacobian: usizeNumber of jacobian evaluations
newton: usizeNumber of Newton iterations
decompositions: usizeNumber of matrix decompositions
solves: usizeNumber of matrix system solves
Implementations§
Trait Implementations§
Source§impl AddAssign for Evals
impl AddAssign for Evals
Source§fn add_assign(&mut self, other: Self)
fn add_assign(&mut self, other: Self)
Performs the
+= operation. Read moreimpl Copy for Evals
impl Eq for Evals
impl StructuralPartialEq for Evals
Auto Trait Implementations§
impl Freeze for Evals
impl RefUnwindSafe for Evals
impl Send for Evals
impl Sync for Evals
impl Unpin for Evals
impl UnwindSafe for Evals
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.