pub struct Convergence<F: Scalar = f64> { /* private fields */ }Expand description
All sufficient convergence predicates that passed at the stopping stage.
A compound predicate remains one criterion; its conditions retain their conjunction. Tests unavailable at this stage are not evaluated retroactively.
Implementations§
Source§impl<F: Scalar> Convergence<F>
impl<F: Scalar> Convergence<F>
Sourcepub fn new(criterion: ConvergenceCriterion<F>) -> Self
pub fn new(criterion: ConvergenceCriterion<F>) -> Self
Construct a value with the supplied initial explanation.
Sourcepub fn criteria(&self) -> &[ConvergenceCriterion<F>]
pub fn criteria(&self) -> &[ConvergenceCriterion<F>]
Read all passing predicates in reporting order.
Sourcepub fn push(&mut self, criterion: ConvergenceCriterion<F>)
pub fn push(&mut self, criterion: ConvergenceCriterion<F>)
Record another predicate passing at the same observation stage.
Trait Implementations§
Source§impl<'de, F> Deserialize<'de> for Convergence<F>where
F: Deserialize<'de> + Scalar,
Available on crate feature serde only.
impl<'de, F> Deserialize<'de> for Convergence<F>where
F: Deserialize<'de> + Scalar,
Available on crate feature
serde only.Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<F> Serialize for Convergence<F>
Available on crate feature serde only.
impl<F> Serialize for Convergence<F>
Available on crate feature
serde only.impl<F: PartialEq + Scalar> StructuralPartialEq for Convergence<F>
Auto Trait Implementations§
impl<F> Freeze for Convergence<F>
impl<F> RefUnwindSafe for Convergence<F>
impl<F> Send for Convergence<F>
impl<F> Sync for Convergence<F>
impl<F> Unpin for Convergence<F>
impl<F> UnsafeUnpin for Convergence<F>
impl<F> UnwindSafe for Convergence<F>
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
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.