pub struct Criteria {
pub residual: f64,
pub step: f64,
pub max_iterations: usize,
}Expand description
Stopping criteria for an iterative solver.
Fields§
§residual: f64Stop when |f(x)| falls to this.
step: f64Stop when the step falls to this.
max_iterations: usizeGive up after this many iterations.
Implementations§
Trait Implementations§
impl Copy for Criteria
impl StructuralPartialEq for Criteria
Auto Trait Implementations§
impl Freeze for Criteria
impl RefUnwindSafe for Criteria
impl Send for Criteria
impl Sync for Criteria
impl Unpin for Criteria
impl UnsafeUnpin for Criteria
impl UnwindSafe for Criteria
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,
impl<T> Scalar for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.